church-encoding

The article demonstrates a trick to implement dependent if-expressions without dependent types using Church encoding and rebindable syntax in Haskell, proving it works with simple type inference.

A deep dive into the theoretical foundations of Church encoding, connecting it with parametricity and the Yoneda lemma in the context of System F and polymorphic lambda calculus.