Elementary Complexity and Geometry of Interaction

@inproceedings{Baillot1999ElementaryCA,
  title={Elementary Complexity and Geometry of Interaction},
  author={Patrick Baillot and Marco Pedicini},
  booktitle={TLCA},
  year={1999}
}
We introduce a geometry of interaction model given by an algebra of clauses equipped with resolution (following [Gir95]) into which proofs of Elementary Linear Logic can be interpreted. In order to extend geometry of interaction computation (the so called execution formula) to a wider class of programs in the algebra than just those coming from proofs, we define a variant of execution (called weak execution). Its application to any program of clauses is shown to terminate with a bound on the… CONTINUE READING
Highly Cited
This paper has 56 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

References

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

Geometry of interaction 3: the general case

  • J.-Y. Girard
  • J.-Y. Girard, Y. Lafont, and L. Regnier, editors…
  • 1995
Highly Influential
6 Excerpts

Elementary recursive functions and linear logic

  • V. Danos, J.-B. Joinet
  • presented at the international workshop Implicit…
  • 1999
1 Excerpt

Proof nets and the Hilbert space

  • L. Regnier.
  • 1999

In A Special Issue on the “Linear Logic 96

  • M. Pedicini. Remarks on elementary linear logic
  • Tokyo Meeting”, volume 3 of Electronic Notes in…
  • 1996
2 Excerpts

Lambda-Calcul et réseaux

  • L. Regnier
  • PhD thesis, Université Paris VII
  • 1992
3 Excerpts

La Logique Linéaire appliquée à l’étude de divers processus de normalisation (principalement du λ-calcul)

  • V. Danos
  • PhD thesis, Université Paris VII, Juin
  • 1990
1 Excerpt

Similar Papers

Loading similar papers…