article

A call-by-name lambda-calculus machine

Author:

Jean-Louis KrivineAuthors Info & Claims

Higher-Order and Symbolic Computation, Volume 20, Issue 3

Pages 199 - 207

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

Published: 01 September 2007 Publication History

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.

References

[1]

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.

Digital Library

Google Scholar

[2]

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).

Crossref

Google Scholar

[3]

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).

Crossref

Google Scholar

[4]

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).

Digital Library

Google Scholar

[5]

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

Crossref

Google Scholar

[6]

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

Crossref

Google Scholar

[7]

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

Digital Library

Google Scholar

[8]

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

Crossref

Google Scholar

Cited By

View all

Barrett CCastle DHeijltjes WSobocinski PLago UEsparza J(2024)The Relational Machine CalculusProceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3661814.3662091(1-15)Online publication date: 8-Jul-2024
https://dl.acm.org/doi/10.1145/3661814.3662091
Sylvestre LSérot JChailloux E(2024)Hardware Implementation of OCaml Using a Synchronous Functional LanguagePractical Aspects of Declarative Languages10.1007/978-3-031-52038-9_10(151-168)Online publication date: 15-Jan-2024
https://dl.acm.org/doi/10.1007/978-3-031-52038-9_10
Sullivan ZDownen PAriola Z(2023)Closure Conversion in Little PiecesProceedings of the 25th International Symposium on Principles and Practice of Declarative Programming10.1145/3610612.3610622(1-13)Online publication date: 22-Oct-2023
https://dl.acm.org/doi/10.1145/3610612.3610622
Show More Cited By

Index Terms

A call-by-name lambda-calculus machine
1. Mathematics of computing
  1. Continuous mathematics
    1. Calculus
      1. Lambda calculus
  2. Mathematical analysis
    1. Calculus
      1. Lambda calculus
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
        Functional languages

Recommendations

Call-by-value is dual to call-by-name

The rules of classical logic may be formulated in pairs corresponding to De Morgan duals: rules about & are dual to rules about V. A line of work, including that of Filinski (1989), Griffin (1990), Parigot (1992), Danos, Joinet, and Schellinx (1995), ...
Call-by-value is dual to call-by-name
ICFP '03: Proceedings of the eighth ACM SIGPLAN international conference on Functional programming

The rules of classical logic may be formulated in pairs corresponding to De Morgan duals: rules about & are dual to rules about V. A line of work, including that of Filinski (1989), Griffin (1990), Parigot (1992), Danos, Joinet, and Schellinx (1995), ...
Focused Linear Logic and the λ-calculus

Linear logic enjoys strong symmetries inherited from classical logic while providing a constructive framework comparable to intuitionistic logic. However, the computational interpretation of sequent calculus presentations of linear logic remains ...

Comments

Information & Contributors

Information

Published In

cover image Higher-Order and Symbolic Computation

Higher-Order and Symbolic Computation Volume 20, Issue 3

September 2007

135 pages

ISSN:1388-3690

Issue’s Table of Contents

Publisher

Kluwer Academic Publishers

United States

Publication History

Published: 01 September 2007

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

61
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Barrett CCastle DHeijltjes WSobocinski PLago UEsparza J(2024)The Relational Machine CalculusProceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3661814.3662091(1-15)Online publication date: 8-Jul-2024
https://dl.acm.org/doi/10.1145/3661814.3662091
Sylvestre LSérot JChailloux E(2024)Hardware Implementation of OCaml Using a Synchronous Functional LanguagePractical Aspects of Declarative Languages10.1007/978-3-031-52038-9_10(151-168)Online publication date: 15-Jan-2024
https://dl.acm.org/doi/10.1007/978-3-031-52038-9_10
Sullivan ZDownen PAriola Z(2023)Closure Conversion in Little PiecesProceedings of the 25th International Symposium on Principles and Practice of Declarative Programming10.1145/3610612.3610622(1-13)Online publication date: 22-Oct-2023
https://dl.acm.org/doi/10.1145/3610612.3610622
Van Bakel SWu NTye E(2023)A Calculus of Delayed ReductionsProceedings of the 25th International Symposium on Principles and Practice of Declarative Programming10.1145/3610612.3610613(1-13)Online publication date: 22-Oct-2023
https://dl.acm.org/doi/10.1145/3610612.3610613
Accattoli BDal Lago UVanoni G(2022)Multi types and reasonable spaceProceedings of the ACM on Programming Languages10.1145/35476506:ICFP(799-825)Online publication date: 31-Aug-2022
https://dl.acm.org/doi/10.1145/3547650
Accattoli BDal Lago UVanoni G(2022)Reasonable Space for the λ-Calculus, LogarithmicallyProceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3531130.3533362(1-13)Online publication date: 2-Aug-2022
https://dl.acm.org/doi/10.1145/3531130.3533362
Kesner D(2022)A fine-grained computational interpretation of Girard’s intuitionistic proof-netsProceedings of the ACM on Programming Languages10.1145/34986696:POPL(1-28)Online publication date: 12-Jan-2022
https://dl.acm.org/doi/10.1145/3498669
Sullivan ZDownen PAriola ZLindley SMogensen T(2021)Strictly capturing non-strict closuresProceedings of the 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation10.1145/3441296.3441398(74-89)Online publication date: 18-Jan-2021
https://dl.acm.org/doi/10.1145/3441296.3441398
Accattoli BDal Lago UVanoni G(2021)The (In)Efficiency of interactionProceedings of the ACM on Programming Languages10.1145/34343325:POPL(1-33)Online publication date: 4-Jan-2021
https://dl.acm.org/doi/10.1145/3434332
Accattoli BLago UVanoni GGorla D(2021)The space of interactionProceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS52264.2021.9470726(1-13)Online publication date: 29-Jun-2021
https://dl.acm.org/doi/10.1109/LICS52264.2021.9470726
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Call-by-value is dual to call-by-name

Call-by-value is dual to call-by-name

Focused Linear Logic and the λ-calculus

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations