Affiliation:
1. Université de Paris, France / CNRS, France / IRIF, France / Institut Universitaire de France, France
Abstract
This paper introduces a functional term calculus, called pn, that captures the essence of the operational semantics of Intuitionistic Linear Logic Proof-Nets with a faithful degree of granularity, both statically and dynamically. On the static side, we identify an equivalence relation on pn-terms which is sound and complete with respect to the classical notion of structural equivalence for proof-nets. On the dynamic side, we show that every single (exponential) step in the term calculus translates to a different single (exponential) step in the graphical formalism, thus capturing the original Girard’s granularity of proof-nets but on the level of terms. We also show some fundamental properties of the calculus such as confluence, strong normalization, preservation of β-strong normalization and the existence of a strong bisimulation that captures pairs of pn-terms having the same graph reduction.
Publisher
Association for Computing Machinery (ACM)
Subject
Safety, Risk, Reliability and Quality,Software
Reference68 articles.
1. Explicit substitutions
2. Computational interpretations of linear logic
3. Beniamino Accattoli. 2011. Jumping around the box: graphical and operational studies on Lambda Calculus and Linear Logic.. Università di Roma La Sapienza. Beniamino Accattoli. 2011. Jumping around the box: graphical and operational studies on Lambda Calculus and Linear Logic.. Università di Roma La Sapienza.
4. Proof Nets and the Linear Substitution Calculus
5. Distilling abstract machines
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献