Execution Time of lambda-Terms via Denotational Semantics and Intersection Types

Details Execution Time of lambda-Terms via Denotational Semantics and Intersection Types Execution Time of lambda-Terms via Denotational Semantics and Intersection Types

2009-05-26

arxiv.org/abs/0905.4251v1

Computer Science

Logic in Computer Science

36 pages

Scientific paper

The multiset based relational model of linear logic induces a semantics of
the type free lambda-calculus, which corresponds to a non-idempotent
intersection type system, System R. We prove that, in System R, the size of the
type derivations and the size of the types are closely related to the execution
time of lambda-terms in a particular environment machine, Krivine's machine.

Affiliated with

Also associated with

No associations

Rating

Execution Time of lambda-Terms via Denotational Semantics and Intersection Types 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 Execution Time of lambda-Terms via Denotational Semantics and Intersection Types, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Execution Time of lambda-Terms via Denotational Semantics and Intersection Types will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-647528