Intersection and Union Types in the λμμ~-calculus

Authors:
Daniel J. Dougherty;Silvia Ghilezan;Pierre Lescanne
Affiliations:
Worcester Polytechnic Institute, Worcester MA 01609 USA;Faculty of Engineering, University of Novi Sad, Novi Sad, Serbia;LIP, École Normale Supérieure de Lyon, Lyon, France
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 11
Cited 5

A formulae-as-type notion of control

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Intersection and union types: syntax and semantics

Information and Computation
Intersection type assignment systems

Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
A Curry-Howard foundation for functional computation with control

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The duality of computation

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction

LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Une Extension de la Theorie des Types en lambda-Calcul

Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Tridirectional typechecking

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A calculus with polymorphic and polyvariant flow types

Journal of Functional Programming
Characterizing strong normalization in a language with control operators

PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Type assignment for intersections and unions in call-by-value languages

FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software

Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: Extending the Coppo-Dezani heritage

Theoretical Computer Science
Convolution λµ-calculus

TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
A filter model for the λµ-calculus

TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Completeness and Soundness Results for X with Intersection and Union Types

Fundamenta Informaticae - Intersection Types and Related Systems ITRS
Characterising Strongly Normalising Intuitionistic Terms

Fundamenta Informaticae - Intersection Types and Related Systems ITRS

Quantified Score

Hi-index	0.00

Visualization

Abstract

The original @l@?@m@m@? of Curien and Herbelin has a system of simple types, based on sequent calculus, embodying a Curry-Howard correspondence with classical logic. We introduce and discuss three type assignment systems that are extensions of @l@?@m@m@? with intersection and union types. The intrinsic symmetry in the @l@?@m@m@? calculus leads to an essential use of both intersection and union types.