A call-by-name lambda-calculus machine
Cached
Download Links
- [hal.archives-ouvertes.fr]
- [www.pps.jussieu.fr]
- DBLP
Other Repositories/Bibliography
by
Jean-louis Krivine
| Venue: | Higher Order and Symbolic Computation |
| Citations: | 19 - 0 self |
BibTeX
@ARTICLE{Krivine_acall-by-name,
author = {Jean-louis Krivine},
title = {A call-by-name lambda-calculus machine},
journal = {Higher Order and Symbolic Computation},
year = {},
pages = {2007}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present, in this paper, a particularly simple lazy machine which runs programs written in λ-calculus. It was introduced by the present writer more than twenty years ago. It has been, since, used and implemented
Citations
| 299 | The mechanical evaluation of expressions - Landin - 1964 |
| 206 | A formulae-as-types notion of control - Griffin - 1990 |
| 136 | de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem - G - 1972 |
| 17 | A syntactic correspondence between context-sensitive calculi and abstract machines - Biernacka, Danvy - 2007 |
| 17 | Disjunctive tautologies as synchronisation schemes - Danos, Krivine - 2000 |
| 17 | Dependent choice, ‘quote’ and the clock - Krivine - 2003 |
| 1 | Typed λ-calculus in classical Zermelo-Frænkel set theory - Krivine - 2001 |
