Abstract
We introduce a geometry of interaction model given by an algebra of clauses equipped with resolution (following [Gir95a]) into which proofs of Elementary Linear Logic can be interpreted. In order to extend geometry of interaction computation (Execution) to more programs of 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 number of steps which is elementary in the size of the program. We establish that Weak Execution coincides with standard Execution on programs coming from proofs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. Baillot and M. Pedicini. Elementary complexity and geometry of interaction. Prepublication, Quaderni dell’Istituto per le Applicazioni del Calcolo “M.Picone” di Roma, IAC-CNR n. 21-998, January 1999.
V. Danos. La Logique Linéaire appliquée à l’étude de divers processus de normalisation (principalement du λ-calcul). PhD thesis, Université Paris VII, Juin 1990.
V. Danos and L. Regnier. Proof nets and the Hilbert space. In J.-Y. Girard, Y. Lafont, and L. Regnier, editors, Advances in Linear Logic, pages 307–328. Cambridge University Press, 1995. London Mathematical Society Lecture Note Series 222, Proceedings of the 1993 Workshop on Linear Logic, Cornell University, Ithaca.
J.-Y. Girard. Geometry of interaction I: an interpretation of system F. In Ferro and al, editors, Proceedings of A.S.L. Meetings, Padova, 1988. North-Holland.
J.-Y. Girard. Geometry of interaction II: Deadlock free algorithms. In Martin-Löf and Mints, editors, Proceedings of COLOG’88, volume 417 of Lecture Notes in Computer Science, pages 76–93. Springer Verlag, 1988.
J.-Y. Girard. Geometry of interaction 3: the general case. In J.-Y. Girard, Y. Lafont, and L. Regnier, editors, Advances in Linear Logic, pages 329–389. Cambridge University Press, 1995. London Mathematical Society Lecture Note Series 222, Proceedings of the 1993 Workshop on Linear Logic, Cornell University, Ithaca.
J.-Y. Girard. Light linear logic. In D. Leivant, editor, Proceedings of the International Workshop on Logic and Computational Complexity (LCC’94), volume 960 of LNCS, pages 145–176, Berlin, GER, October 1995. Springer. 25, 39
M. I. Kanovich, M. Okada, and A. Scedrov. Phase semantics for light linear logic (extended abstract). In Mathematical foundations of programming semantics (Pittsburgh, PA, 1997), volume 6 of Electron. Notes Theor. Comput. Sci. Elsevier, Amsterdam, 1997.
P. Malacaria and L. Regnier. Some results on the interpretation of λ-calculus in operator algebras. In Proceedings of the Sixth Annual Symposium on Logic in Computer Science, pages 63–72. IEEE Computer Society Press, 1991.
M. Pedicini. Remarks on elementary linear logic. In A Special Issue on the “Linear Logic 96, Tokyo Meeting”, volume 3 of Electronic Notes in Theoretical Computer Science, Amsterdam, The Netherlands, 1996. Elsevier.
L. Regnier. Lambda-Calcul et réseaux. PhD thesis, Université Paris VII, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baillot, P., Pedicini, M. (1999). Elementary Complexity and Geometry of Interaction. In: Girard, JY. (eds) Typed Lambda Calculi and Applications. TLCA 1999. Lecture Notes in Computer Science, vol 1581. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48959-2_4
Download citation
DOI: https://doi.org/10.1007/3-540-48959-2_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65763-7
Online ISBN: 978-3-540-48959-7
eBook Packages: Springer Book Archive