Introduction to linear logic and ludics, part I
2005, HAL (Le Centre pour la Communication Scientifique Directe)
Abstract
In this two-part survey paper, we introduce linear logic and ludics, which were both introduced by Girard, in 1986 and 2001, respectively. They offer a thorough revisitation of mathematical logic from first principles, with inspiration from and applications to computer science. Some important keywords are: resources, geometry of computation, polarities, interaction, and games. We assume some basic knowledge of sequent calculus and natural deduction (see ), of λ-calculus (the classical reference is , see also ), and of category theory (only in section 7, see ). This paper is not trying to survey the whole and impressive body of works on linear logic since 17 years, but rather chooses a route that tries to highlight the deep originality of the subject. The bibliography is in consequence very partial (also reading the latter as a French word, wich meanss something like "personal", possibly biased). In sequent calculus, depending on presentations, you can see the left and right rules for, say, conjunction given
References (28)
- S. Abramsky and G. McCusker, Game semantics, in Computational logic, U. Berger and H. Schwichtenberg eds, Springer Verlag (1999).
- R. Amadio and P.-L. Curien, Domains and lambda-calculi, Cambridge University Press (1998).
- J.-M. Andreoli and R. Pareschi, Linear objects: logical processes with built-in inheritance, New Generation Computing 9(3-4), 445-473 (1991).
- P. Baillot, Approches dynamiques en semantique de la logique lineaire: jeux et geometrie de l'interaction, Thèse de Doctorat, Université d'Aix-Marseille 2 (1999).
- H. Barendregt, The lambda calculus; its syntax and semantics, North-Holland (1984).
- M. Barr, * -autonomous categories and linear logic, Mathematical Structures in Computer Science 1(2), 159-178 (1991).
- G. Bierman, What is a categorical model of intuitionistic linear logic?, in Proc. Typed Lambda Calculi and Applications, Springer Lect. Notes in Comp. Sci. 902, (1995).
- P.-L. Curien, Introduction to ludics, draft notes (2001).
- V. Danos and R. Di Cosmo, The linear logic primer, available from http://www.pps.jussieu.fr/ di- cosmo.
- V. Danos, J.-B. Joinet, and H. Schellinx, The structure of exponentials: uncovering the dynamics of linear logic proofs, in Proc. Kurt Gödel Symposiun '93, Lecture Notes in Computer Science 713 (1993).
- V. Danos, J.-B. Joinet, and H. Schellinx, A new deconstructive logic: linear logic, Journal of Symbolic Logic 62(3), 755-807 (1997).
- V. Danos and L. Regnier, The structure of multiplicatives, Archive for Mathematical Logic 28, 181-203 (1989).
- J.-Y. Girard, The system F of variable types, fifteen years later, Theoretical Computer Science 45, 159-192 (1986).
- J.-Y. Girard, Linear logic, Theoretical Computer Science 50, 1-102 (1987).
- J.-Y. Girard, Y. Lafont, and P. Taylor, Proofs and Types, Cambridge University Press (1989).
- J.-Y. Girard, Linear logic: it's syntax and semantics, in Advances of Linear Logic, J.-Y. Girard, Y. Lafont, and L. Regnier eds, Cambridge University Press, 1-42 (1995).
- J.-Y. Girard, Locus solum: from the rules of logic to the logic of rules, Mathematical Structures in Computer Science 11(3), 301-506 (2001).
- J. Goubault-Larrecq and I. Mackie, Proof theory and automated deduction, Kluwer (1997).
- Stefano Guerrini and Andrea Masini, Parsing MELL proof nets. Theoretical Computer Science 254(1-2), 317-335 (2001).
- R. Hindley and J. Seldin, Introduction to combinators and lambda-calculus, Cambridge University Press (1986).
- G. Huet and D. Oppen, Equations and Rewrite Rules: a Survey, in Formal Language Theory: Perspectives and Open Problems, R. Book (ed.), Academic Press, 349-405 (1980).
- M. Hyland, Game semantics, in Semantics and Logics of Computation, Pitts and Dybjer (eds.), Cambridge University Press, (1997).
- J.-L. Krivine, Lambda-calculus, types and models, Ellis Horwood (1993).
- P. Lincoln, J. Mitchell, A. Scedrov, Decision problems for propositional linear logic, Annals of Pure and Applied Logic 56, 239-311 (1992).
- S. Mac Lane, Categories for the working mathematician, Springer-Verlag (1971).
- P.-A. Melliès, Categorical models of linear logic revisited, submitted (2003).
- R. Seely, Linear logic, * -autonomous categories and cofree coalgebras, in Applications of categories in logic and computer science, Contempory Mathematics 92 (1989).
- G. Winskel, Event structures, Springer Lect. Notes in Comp. Sci. 255 (1986).