How to implement Haskell's newtype using a function encoding?...

How to infer the type of the Scott encoded List constructor?...

Why do we use folds to encode datatypes as functions?...

How do I use the Church encoding for Free Monads?...

Is there any non-recursive term that folds over a scott-encoded list?...

How to use a Reader type encoded with continuation passing style...

Why are explicit forall quantifiers necessary for rank-n types?...

How do you represent nested types using the Scott Encoding?...