A syntactic theory of sequential control
Theoretical Computer Science
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
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
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
Infinite &lgr;-calculus and types
Theoretical Computer Science - Special issue: Gentzen
An Operational Investigation of the CPS Hierarchy
ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
Free Deduction: An Analysis of "Computations" in Classical Logic
Proceedings of the First Russian Conference on Logic Programming
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
A CPS-Translation of the Lambda-µ-Calculus
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
A sound and complete axiomatization of delimited continuations
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
An environment machine for the λμ-calculus
Mathematical Structures in Computer Science
Classical logic, continuation semantics and abstract machines
Journal of Functional Programming
Separation with Streams in the ?µ-calculus
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Head Normal Form Bisimulation for Pairs and the \lambda\mu-Calculus
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
A call-by-name lambda-calculus machine
Higher-Order and Symbolic Computation
Axioms for control operators in the CPS hierarchy
Higher-Order and Symbolic Computation
An approach to call-by-name delimited continuations
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Control reduction theories: The benefit of structural substitution
Journal of Functional Programming
On the Relations between the Syntactic Theories of λμ-Calculi
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Minimal classical logic and control operators
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A sound and complete CPS-translation for λµ-calculus
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Typing streams in the Λμ-calculus
ACM Transactions on Computational Logic (TOCL)
Standardization and böhm trees for Λµ-calculus
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
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
Typing control operators in the CPS hierarchy
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Standardization and böhm trees for Λµ-calculus
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
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
Böhm theorem and Böhm trees for the Λμ-calculus
Theoretical Computer Science
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
| Hi-index | 0.00 |
Λμ-calculus was introduced as a Böhm-complete extension of Parigot's λμ-calculus. Λμ-calculus, contrarily to Parigot's calculus, is a calculus of CBN delimited control as evidenced by Herbelin and Ghilezan. In their seminal paper on (CBV) delimited control, Danvy and Filinski introduced the CPS Hierarchy of control operators (shifti/reseti)i∈ω. In a similar way, we introduce in the present paper the Stream Hierarchy, a hierarchy of calculi extending and generalizing Λμ-calculus. The $(\Lambda^n)_{n\in\omega}$-calculi have Church-Rosser and Böhm theorems. We then present sound and complete CPS translations for the hierarchy. Next, we investigate the operational content of the hierarchy through its abstract machines, the $(\Lambda^n)_{n\in\omega}$-KAM. Finally, we establish that the Stream hierarchy is indeed a CBN analogue to the CPS hierarchy.