Labelled Lambda-calculi with Explicit Copy and Erase

Details Labelled Lambda-calculi with Explicit Copy and Erase Labelled Lambda-calculi with Explicit Copy and Erase

2010-03-29

arxiv.org/abs/1003.5515v1

EPTCS 22, 2010, pp. 49-64

Computer Science

Logic in Computer Science

Scientific paper

10.4204/EPTCS.22.5

We present two rewriting systems that define labelled explicit substitution lambda-calculi. Our work is motivated by the close correspondence between Levy's labelled lambda-calculus and paths in proof-nets, which played an important role in the understanding of the Geometry of Interaction. The structure of the labels in Levy's labelled lambda-calculus relates to the multiplicative information of paths; the novelty of our work is that we design labelled explicit substitution calculi that also keep track of exponential information present in call-by-value and call-by-name translations of the lambda-calculus into linear logic proof-nets.

Affiliated with

Also associated with

No associations

Rating

Labelled Lambda-calculi with Explicit Copy and Erase 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 Labelled Lambda-calculi with Explicit Copy and Erase, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Labelled Lambda-calculi with Explicit Copy and Erase will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-499688