Higher-Order and Symbolic Computation

, Volume 20, Issue 3, pp 199–207

A call-by-name lambda-calculus machine


DOI: 10.1007/s10990-007-9018-9

Cite this article as:
Krivine, JL. Higher-Order Symb Comput (2007) 20: 199. doi:10.1007/s10990-007-9018-9


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.


Lambda-calculus machine Control instruction Curry-Howard correspondence 

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  1. 1.C.N.R.S.University Paris VIIParis cedex 05France

Personalised recommendations