[go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

A call-by-name lambda-calculus machine

  • Published:
Higher-Order and Symbolic Computation

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Biernacka, M., Danvy, O.: A syntactic correspondence between context-sensitive calculi and abstract machines. Theor. Comput. Sci. 375(1–3), 76–108 (2007). Extended version available as the research report BRICS RS-06-18

    Article  MATH  MathSciNet  Google Scholar 

  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)

  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)

  5. Krivine, J.-L.: Lambda-Calculus, Types and Models. Ellis Horwood, Chichester (1993)

    MATH  Google Scholar 

  6. Krivine, J.-L.: Typed λ-calculus in classical Zermelo-Frænkel set theory. Arch. Math. Log. 40(3), 189–205 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  7. Krivine, J.-L.: Dependent choice, ‘quote’ and the clock. Theor. Comput. Sci. 308, 259–276 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  8. Landin, P.J.: The mechanical evaluation of expressions. Comput. J. 6, 308–320 (1964)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. C.N.R.S., University Paris VII, 2 place Jussieu, 75251, Paris cedex 05, France

    Jean-Louis Krivine

Authors
  1. Jean-Louis Krivine
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jean-Louis Krivine.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Krivine, JL. A call-by-name lambda-calculus machine. Higher-Order Symb Comput 20, 199–207 (2007). https://doi.org/10.1007/s10990-007-9018-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10990-007-9018-9

Keywords

Search

Navigation