An equivalence between lambda-terms
Theoretical Computer Science
Proof-nets and the Hilbert space
Proceedings of the workshop on Advances in linear logic
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
KGC '93 Proceedings of the Third Kurt Gödel Colloquium on Computational Logic and Proof Theory
Control categories and duality: on the categorical semantics of the lambda-mu calculus
Mathematical Structures in Computer Science
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Noninterference through flow analysis
Journal of Functional Programming
Parameterizations and Fixed-Point Operators on Control Categories
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Resource operators for λ-calculus
Information and Computation
Theoretical Computer Science
A token machine for full geometry of interaction
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Polarized proof nets with cycles and fixpoints semantics
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
An exact correspondence between a typed pi-calculus and polarised proof-nets
Theoretical Computer Science
What is the problem with proof nets for classical logic?
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Intuitionistic differential nets and lambda-calculus
Theoretical Computer Science
Naming proofs in classical propositional logic
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Extending the explicit substitution paradigm
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Parameterizations and Fixed-Point Operators on Control Categories
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 5.23 |
We first define polarized proof-nets, an extension of MELL proof-nets for the polarized fragment of linear logic; the main difference with usual proof-nets is that we allow structural rules on any negative formula. The essential properties (confluence, strong normalization in the typed case) of polarized proof-nets are proved using a reduction preserving translation into usual proof-nets.We then give a reduction preserving encoding of Parigot's λµ-terms for classical logic as polarized proof-nets. It is based on the intuitionistic translation: A → B -- !A - B, so that it is a straightforward extension of the usual translation of λ-calculus into proof-nets. We give a reverse encoding which sequentializes any polarized proof-net as a λµ-term.In the last part of the paper, we extend the σ-equivalence for λ-calculus to λµ-calculus. Interestingly, this new σ-equivalence relation identifies normal λµ-terms. We eventually show that two terms are equivalent iff they are translated as the same polarized proof-net; thus the set of polarized proof-nets represents the quotient of λµ-calculus by σ-equivalence.