A formulae-as-type notion of control
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Lambda-calculus, types and models
Lambda-calculus, types and models
Dependent choice, 'quote' and the clock
Theoretical Computer Science
A syntactic correspondence between context-sensitive calculi and abstract machines
Theoretical Computer Science
A syntactic correspondence between context-sensitive calculi and abstract machines
Theoretical Computer Science
A concrete framework for environment machines
ACM Transactions on Computational Logic (TOCL)
Strongly reducing variants of the Krivine abstract machine
Higher-Order and Symbolic Computation
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information Processing Letters
Soft Linear Logic and Polynomial Complexity Classes
Electronic Notes in Theoretical Computer Science (ENTCS)
Uniformity and the Taylor expansion of ordinary lambda-terms
Theoretical Computer Science
Defunctionalized interpreters for programming languages
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Lazy evaluation and delimited control
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Sequent calculi and abstract machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
A verified framework for higher-order uncurrying optimizations
Higher-Order and Symbolic Computation
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
The very lazy λ-calculus and the STEC machine
IFL'09 Proceedings of the 21st international conference on Implementation and application of functional languages
Theoretical Computer Science
ASMs and operational algorithmic completeness of lambda calculus
Fields of logic and computation
Krivine machines and higher-order schemes
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
IFL'10 Proceedings of the 22nd international conference on Implementation and application of functional languages
Böhm trees, krivine's machine and the taylor expansion of lambda-terms
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
An Implicit Characterization of PSPACE
ACM Transactions on Computational Logic (TOCL)
A hierarchy for delimited continuations in call-by-name
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Recursive schemes, krivine machines, and collapsible pushdown automata
RP'12 Proceedings of the 6th international conference on Reachability Problems
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An operational foundation for the tactic language of Coq
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
A synthetic operational account of call-by-need evaluation
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
| Hi-index | 0.00 |
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.