Sound and Complete Typing for lambda-mu

Details Sound and Complete Typing for lambda-mu Sound and Complete Typing for lambda-mu

2011-01-24

arxiv.org/abs/1101.4425v1

EPTCS 45, 2011, pp. 31-44

Computer Science

Logic in Computer Science

In Proceedings ITRS 2010, arXiv:1101.4104

Scientific paper

10.4204/EPTCS.45.3

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.

Affiliated with

Also associated with

No associations

Rating

Sound and Complete Typing for lambda-mu does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sound and Complete Typing for lambda-mu, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sound and Complete Typing for lambda-mu will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-635552