A call-by-name lambda-calculus machine
- 131 Downloads
We present a particularly simple lazy lambda-calculus machine, which was introduced twenty-five years ago. It has been, since, used and implemented by several authors, but remained unpublished. We also build an extension, with a control instruction and continuations. This machine was conceived in order to execute programs obtained from mathematical proofs, by means of the Curry-Howard (also known as “proof-program”) correspondence. The control instruction corresponds to the axiom of excluded middle.
KeywordsLambda-calculus machine Control instruction Curry-Howard correspondence
Unable to display preview. Download preview PDF.
- 2.Danos, V., Krivine, J.-L.: Disjunctive tautologies and synchronisation schemes. In: Computer Science Logic’00. Lecture Notes in Computer Science, vol. 1862, pp. 292–301 (2000) Google Scholar
- 3.de Bruijn, N.G.: Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indag. Math. 34, 381–392 (1972) Google Scholar
- 4.Griffin, T.: A formulæ-as-type notion of control. In: Conference Record of the 17th A.C.M. Symposium on Principles of Programming Languages (1990) Google Scholar