A call-by-name lambda-calculus machine
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2007/10/25
-
Indian UGC (journal)
-
Refrences8
-
Citations49
-
Jean-Louis Krivine
Cite
Krivine, Jean-Louis. “A Call-by-Name Lambda-Calculus Machine”. Higher-Order and Symbolic Computation, vol. 20, no. 3, 2007, pp. 199-07, https://doi.org/10.1007/s10990-007-9018-9.
Krivine, J.-L. (2007). A call-by-name lambda-calculus machine. Higher-Order and Symbolic Computation, 20(3), 199-207. https://doi.org/10.1007/s10990-007-9018-9
Krivine JL. A call-by-name lambda-calculus machine. Higher-Order and Symbolic Computation. 2007;20(3):199-207.
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| A syntactic correspondence between context-sensitive calculi and abstract machines | Theoretical Computer Science |
| 17 | 2007 |
| Typed lambda-calculus in classical Zermelo-Frænkel set theory | Archive for Mathematical Logic |
| 31 | 2001 |
| 10.1016/S0304-3975(02)00776-4 | 2003 | |||
| Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem | Indagationes Mathematicae (Proceedings) | 257 | 1972 | |
| The Mechanical Evaluation of Expressions | The Computer Journal |
| 254 | 1964 |
Refrences Analysis
The category
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware 2
is the most frequently represented among the references in this article. It primarily includes studies from The Computer Journal The chart below illustrates the number of referenced publications per year.
Refrences used by this article by year
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
Classical (co)recursion: Mechanics | Journal of Functional Programming |
| 2023 | |
A fine-grained computational interpretation of Girard’s intuitionistic proof-nets | Proceedings of the ACM on Programming Languages |
| 1 | 2022 |
Multi types and reasonable space | Proceedings of the ACM on Programming Languages |
| 1 | 2022 |
A unifying type-theory for higher-order (amortized) cost analysis | Proceedings of the ACM on Programming Languages |
| 8 | 2021 |
The (In)Efficiency of interaction | Proceedings of the ACM on Programming Languages |
| 3 | 2021 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 29
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled A concrete framework for environment machines and was published in 2007. The most recent citation comes from a 2023 study titled Classical (co)recursion: Mechanics. This article reached its peak citation in 2016, with 8 citations. It has been cited in 17 different journals, 11% of which are open access. Among related journals, the ACM SIGPLAN Notices cited this research the most, with 7 citations. The chart below illustrates the annual citation trends for this article.