Polarized Proof-Nets: Proof-Nets for LC

Authors:
Olivier Laurent
Affiliations:
-
Venue:
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Year:
1999

Citing 1
Cited 2

Linear logic

Theoretical Computer Science

A unified theory of program logics: an approach based on the π-calculus

VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Compressing Polarized Boxes

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define a notion of polarization in linear logic (LL) coming from the polarities of Jean-Yves Girard's classical sequent calculus LC. This allows us to define a translation between the two systems. Then we study the application of this polar ization constraint to proofnets for full linear logic described in [7]. This yields an important simplification of the correctness criterion for polarized proof-nets. In this way we obtain a system of proof-nets for LC.