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.
Publisher
Cambridge University Press (CUP)
Reference22 articles.
1. Dependently Typed Programming in Agda
2. Mimram, S. (2020) PROGRAM = PROOF. http://program-proof.mimram.fr.
3. Super-combinators a new implementation method for applicative languages
4. Norell, U. (2007) Towards a Practical Programming Language based on Dependent Type Theory. PhD Thesis, Chalmers University of Technology.