Labelled Lambda-calculi with Explicit Copy and Erase

Maribel Fernández
Nikolaos Siafakas

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.

In Mário Florido and Ian Mackie: Proceedings First International Workshop on Linearity (LINEARITY 2009), Coimbra, Portugal, 12th September 2009, Electronic Proceedings in Theoretical Computer Science 22, pp. 49–64.
Published: 30th March 2010.

ArXived at: http://dx.doi.org/10.4204/EPTCS.22.5 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org