A correct-by-construction conversion from lambda calculus to combinatory logic

Abstract

Abstract This pearl defines a translation from well-typed lambda terms to combinatory logic, where both the preservation of types and the correctness of the translation are enforced statically.