Theoretical Computer Science
Proof-nets and the Hilbert space
Proceedings of the workshop on Advances in linear logic
Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Correctness of Multiplicative Proof Nets is Linear
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Intuitionistic differential nets and lambda-calculus
Theoretical Computer Science
Extending the explicit substitution paradigm
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
This paper proposes a notion of reduction for the proof nets of Linear Logic modulo an equivalence relation on the contraction links, that essentially amounts to consider the contraction as an associative commutative binary operator that can float freely in and out of proof net boxes. The need for such a system comes, on one side, from the desire to make proof nets an even more parallel syntax for Linear Logic, and on the other side from the application of proof nets to l-calculus with or without explicit substitutions, which needs a notion of reduction more flexible than those present in the literature. The main result of the paper is that this relaxed notion of rewriting is still strongly normalizing.