A syntactic theory of sequential control
Theoretical Computer Science
Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
Call-by-need and continuation-passing style
Lisp and Symbolic Computation
Reasoning about programs in continuation-passing style
Lisp and Symbolic Computation - Special issue on continuations—part I
Proceedings of the workshop on Advances in linear logic
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Theoretical Computer Science
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Control categories and duality: on the categorical semantics of the lambda-mu calculus
Mathematical Structures in Computer Science
Lambda terms for natural deduction, sequent calculus and cut elimination
Journal of Functional Programming
The call-by-need lambda calculus
Journal of Functional Programming
The call-by-need lambda calculus
Journal of Functional Programming
The Parametric Lambda Calculus: A Meta-Model for Computation (Texts in Theoretical Computer Science)
The Parametric Lambda Calculus: A Meta-Model for Computation (Texts in Theoretical Computer Science)
Separation with Streams in the ?µ-calculus
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
A concurrent lambda calculus with futures
Theoretical Computer Science - Applied semantics
A proof-theoretic foundation of abortive continuations
Higher-Order and Symbolic Computation
Control reduction theories: The benefit of structural substitution
Journal of 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)
An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
A type-theoretic foundation of delimited continuations
Higher-Order and Symbolic Computation
Minimal classical logic and control operators
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Defunctionalized interpreters for call-by-need evaluation
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Classical call-by-need sequent calculi: the unity of semantic artifacts
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
A Constructive Proof of Dependent Choice, Compatible with Classical Logic
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
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 study call-by-need from the point of view of the duality between call-by-name and call-by-value. We develop sequent-calculus style versions of call-by-need both in the minimal and classical case. As a result, we obtain a natural extension of call-by-need with control operators. This leads us to introduce a call-by-need λµ-calculus. Finally, by using the dualities principles of λµµ-calculus, we show the existence of a new call-by-need calculus, which is distinct from call-by-name, call-by-value and usual call-by-need theories.