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
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
Infinitary Lambda Calculi and Böhm Models
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
Infinitary lambda calculus and discrimination of Berarducci trees
Theoretical Computer Science - Australasian computer science
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
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
An approach to call-by-name delimited continuations
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Typing streams in the Λμ-calculus
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
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
Call-by-Value solvability, revisited
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
| Hi-index | 0.00 |
Λμ-calculus is an extension of Parigot's λμ-calculus which (i) satisfies Separation theorem: it is Böhm-complete, (ii) corresponds to CBN delimited control and (iii) is provided with a stream interpretation. In the present paper, we study solvability and investigate Böhm trees for Λμ-calculus. Moreover, we make clear the connections between Λμ-calculus and infinitary λ-calculi. After establishing a standardization theorem for Λμ-calculus, we characterize solvability. Then, we study infinite Λμ-Böhm trees, which are Böhm-like trees for Λμ-calculus; this allows to strengthen the separation results that we established previously for Λμ-calculus and to shed a new light on the failure of separation in Parigot's original λμ-calculus. Our construction clarifies Λμ-calculus both as an infinitary calculus and as a core language for dealing with streams as primitive objects.