Sound and Complete Typing for lambda-mu
ITRS(2011)
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.
MoreTranslated text
Key words
Type Inference
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined