Resource operators for λ-calculus

We present a simple term calculus with an explicit control of erasure and duplication of substitutions, enjoying a sound and complete correspondence with the intuitionistic fragment of Linear Logic’s proof-nets. We show the operational behaviour of the calculus and some of its fundamental properties such as confluence, preservation of strong normalisation, strong normalisation of simply typed terms, step by step simulation of β-reduction and full composition.

Authors

• Delia Kesner
• Stéphane Lengrand

Keywords

No keywords are indexed for this paper.