Abstract fun

  1. Propositions as types correspondance (PAT) (or Types as Propositions) is one of the most intriguing discoveries of Computer Science. The…

  2. Take a simple FP language without polymorphism, just monomorphic types, functions and products. It's well known that this language can be…

  3. Some time ago, I wrote a tutorial about parser combinators. The tutorial shows ho we can, with a few primitive parsers (e.g. for text and…

  4. OK, continuing my hack to make my focused lens library definetely typed. So far, I have type definitions for base typeclasses/interfaces…

  5. This is the 4th post documenting my tentative to add typings to my focused lens library. So far, I have type definitions for base…

  6. Last post I wrote about my first tentatives to add typings to my focused lens library. I explained the main issue was the lack of Higher…

  7. I remember my first attempts to learn Optics started long time ago, I stopped on basic things due to the lack of good resources at the…