Sound and Complete Typing for lambda-mu
Abstract
In this paper we define intersection and union type assignment for Parigot's calculus lambda-mu. We show that this notion is complete (i.e. closed under subject-expansion), and show also that it is sound (i.e. closed under subject-reduction). This implies that this notion of intersection-union type assignment is suitable to define a semantics.
- Publication:
-
arXiv e-prints
- Pub Date:
- January 2011
- DOI:
- 10.48550/arXiv.1101.4425
- arXiv:
- arXiv:1101.4425
- Bibcode:
- 2011arXiv1101.4425V
- Keywords:
-
- Computer Science - Logic in Computer Science;
- F.3.2
- E-Print:
- In Proceedings ITRS 2010, arXiv:1101.4104