Rewritings for Polarized Multiplicative and Exponential Proof Structures

Authors:
Christophe Fouqueré;Virgile Mogbil
Affiliations:
LIPN-UMR7030, Université Paris 13, CNRS, Villetaneuse, France;LIPN-UMR7030, Université Paris 13, CNRS, Villetaneuse, France
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 5
Cited 1

Linear logic

Theoretical Computer Science
From proof-nets to interaction nets

Proceedings of the workshop on Advances in linear logic
Focussing Proof-Net Construction as a Middleware Paradigm

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Correctness of Multiplicative Proof Nets is Linear

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Syntax vs. semantics: a polarized approach

Theoretical Computer Science - Game theory meets theoretical computer science

Ludics and natural language: first approaches

LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study conditions for a concurrent construction of proof-nets in the framework of linear logic following Andreoli's works. We define specific correctness criteria for that purpose. We first study the multiplicative case and show how the correctness criterion given by Danos and decidable in linear time, may be extended to closed modules (i.e. validity of polarized proof structures). We then study the exponential case and give a correctness criterion by means of a contraction relation that helps to discover frontiers of exponential boxes.