A Step-indexed Semantic Model of Types for the Call-by-Name Lambda Calculus

Details A Step-indexed Semantic Model of Types for the Call-by-Name Lambda Calculus A Step-indexed Semantic Model of Types for the Call-by-Name Lambda Calculus

2011-05-10

arxiv.org/abs/1105.1985v3

Computer Science

Programming Languages

5 pages, 6 figures

Scientific paper

Step-indexed semantic models of types were proposed as an alternative to
purely syntactic safety proofs using subject-reduction. Building upon the work
by Appel and others, we introduce a generalized step-indexed model for the
call-by-name lambda calculus. We also show how to prove type safety of general
recursion in our call-by-name model.

Affiliated with

Also associated with

No associations

Rating

A Step-indexed Semantic Model of Types for the Call-by-Name Lambda Calculus 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 A Step-indexed Semantic Model of Types for the Call-by-Name Lambda Calculus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Step-indexed Semantic Model of Types for the Call-by-Name Lambda Calculus will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-280571