Abstract
The paper expounds geometry of interaction, for the first time in the full case, i.e. for all connectives of linear logic, including additives and constants. The interpretation is done within a C*-algebra which is induced by the rule of resolution of logic programming, and therefore the execution formula can be presented as a simple logic programming loop. Part of the data is public (shared channels) but part of it can be viewed as private dialect (defined up to isomorphism) that cannot be shared during interaction, thus illustrating the theme of communication without understanding. One can prove a nilpotency (i.e. termination) theorem for this semantics, and also its soundness w.r.t. a slight modification of familiar sequent calculus in the case of exponential-free conclusions.
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
Asperti, A.: Linear Logic, Comonads and Optimal Reductions, to appear in Fundamenta Informaticae, Special Issue devoted to Categories in Computer Science.
Blass, A.: A game semantics for linear logic, Annals Pure Appi. Logic 56, pp. 183–220, 1992.
Danos, V. & Regnier, L.: GOI 2.0. manuscript, 1993.
Girard, J.-Y.: Linear Logic, Theoretical Computer Science 50.1, pp. 1–102, 1987.
Girard, J.-Y.: Multiplicatives, Rendiconti del Seminario Matematico dell’Università e Policlinico di Torino, special issue on Logic and Computer Science, pp. 11–33, 1987.
Girard, J.-Y.: Towards a Geometry of Interaction, Categories in Computer Science and Logic, Contemporary Mathematics 92, AMS 1989, pp. 69–108.
Girard, J.-Y.: Geometry of Interaction I: interpretation of system F, Proceedings Logic Colloquium ’88, eds. Ferro & al., pp. 221–260, North Holland 1989.
Girard, J.-Y.: Geometry of Interaction II: deadlock-free algorithms, Proceedings of COLOG-88, eds Martin-Lof & Mints, pp. 76–93, LNCS 417, Springer-Verlag 1990.
Girard, J.-Y.: Proof-nets for additives, manuscript, 1994.
Gonthier, G. & Abadi, M. & Levy, J.-J.: The Geometry of Optimal Lambda Reduction, Proc. 19-th Annual ACM Symposium on Principles of Programming Languages, Albuquerque, New Mexico, ACM Press, New York, 1992.
Jacobs, B.: Semantics of weakening and contraction, Annals of Pure and Applied Logic 69, 1994, pp. 73–106.
Lincoln, P. & Mitchell, J. & Scedrov, A. & Shankar N.: Decision Problems in Propositional Linear Logic, Annals of Pure and Applied Logic 56, 1992, pp. 239–311.
Lincoln, P. & Winkler, T.: Constant-only Multiplicative Linear Logic is NP-complete, Theoretical Computer Science 135, 1994, pp. 155–159.
Martini, S. & Masini A.: On the fine structure of the exponential rules, to appear in Advances in Linear Logic, Cambridge University Press 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Girard, JY. (1995). On Geometry of Interaction. In: Schwichtenberg, H. (eds) Proof and Computation. NATO ASI Series, vol 139. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-79361-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-79361-5_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-79363-9
Online ISBN: 978-3-642-79361-5
eBook Packages: Springer Book Archive