Polarized Proof Nets with Cycles and Fixpoints Semantics

@inproceedings{Montelatici2003PolarizedPN,
  title={Polarized Proof Nets with Cycles and Fixpoints Semantics},
  author={Rapha{\"e}l Montelatici},
  booktitle={TLCA},
  year={2003}
}
Starting from Laurent’s work on Polarized Linear Logic, we define a new polarized linear deduction system which handles recursion. This is achieved by extending the cut-rule, in such a way that iteration unrolling is achieved by cut-elimination. The proof nets counterpart of this extension is obtained by allowing oriented cycles, which had no meaning in usual polarized linear logic. We also free proof nets from additional constraints, leading up to a correctness criterion as straightforward as… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Linear Logic

Theor. Comput. Sci. • 1987
View 3 Excerpts
Highly Influenced

Polarized categories and polarized games

P-A. Melliès, P. Selinger
Forthcoming paper, • 2003
View 1 Excerpt
Highly Influenced

Polarized games (extended abstract)

O. Laurent
Seventeenth annual IEEE symposium on Logic In Computer Science, p. 265-274. IEEE Computer Society, • 2002
View 2 Excerpts
Highly Influenced

Polarized proof-nets and lambda-µ-calculus

Theor. Comput. Sci. • 2003
View 1 Excerpt

Etude de la polarisation en logique

O. Laurent
PHD thesis, Université Aix-Marseille II, March • 2002
View 3 Excerpts

Présentation axiomatique de théorèmes de complétude forte en sémantique des jeux et en logique classique

R. Montelatici
Mémoire de DEA, Univ. Paris 7, • 2001
View 3 Excerpts

Similar Papers

Loading similar papers…