Lambda-calculus, types and models
Lambda-calculus, types and models
Intersection and union types: syntax and semantics
Information and Computation
A Curry-Howard foundation for functional computation with control
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
A complete characterization of complete intersection-type preorders
ACM Transactions on Computational Logic (TOCL)
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
On the Relation between the Lambda-Mu-Calculus and the Syntactic Theory of Sequential Control
LPAR '94 Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning
A Computational Interpretation of the lambda-µ-Calculus
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Completeness of continuation models for λµ-calculus
Information and Computation - Special issue: LICS'97
A semantic view of classical proofs: type-theoretic, categorical, and denotational characterizations
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Continuation models are universal for lambda-mu-calculus
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Classical logic, continuation semantics and abstract machines
Journal of Functional Programming
Intersection types and lambda models
Theoretical Computer Science - Logic, language, information and computation
On the Relations between the Syntactic Theories of λμ-Calculi
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Intersection and Union Types in the λμμ~-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Recursive domain equations of filter models
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
An output-based semantics of Λμ with explicit substitution in the π-calculus: extended abstract
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
| Hi-index | 0.00 |
We introduce an intersection type assignment system for the pure λµ-calculus, which is invariant under subject reduction and expansion. The system is obtained by describing Streicher and Reus's denotational model of continuations in the category of ω-algebraic lattices via Abramsky's domain logic approach. This provides a tool for showing the completeness of the type assignment system with respect to the continuation models via a filter model construction. We also show that typed λµ-terms in Parigot's system have a non-trivial intersection typing in our system.