Applications of Linear Logic to Computation: An Overview

This paper is an overview of existing applications of Linear Logic LL to issues of computation After a substantial introduction to LL it discusses the implications of LL to functional programming logic programming concurrent and object oriented programming and some other applications of LL like semantics of negation in LP non monotonic issues in AI planning etc Although the overview covers pretty much the state of the art in this area by necessity many of the works are only mentioned and referenced but not discussed in any considerable detail The paper does not presuppose any previous exposition to LL and is addressed more to computer scientists probably with a theoretical inclination than to logicians The paper contains over references of which some are about applications of LL

[1]  Vaughan R. Pratt.  Arithmetic + Logic + Geometry = Concurrency , 1992, LATIN.

[2]  N. Kobayashi,et al.  Typed Higher-Order Concurrent Linear Logic Programming , 1994 .

[3]  Radha Jagadeesan,et al.  New foundations for the geometry of interaction , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[4]  Vijay Saraswat Xerox.  Higher-order , linear , concurrent constraint programming , 1992 .

[5]  Steffen Hölldobler,et al.  On Deductive Planning and the Frame Problem , 1992, LPAR.

[6]  de Paiva,et al.  The Dialectica categories , 1991 .

[7]  Valeria C V de Paiva,et al.  Term Assignment for Intuitionistic Linear Logic , 1992 .

[8]  Martín Abadi,et al.  Linear logic without boxes , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[9]  James Harland,et al.  On Resolution in Fragments of Classical Linear Logic , 1992, LPAR.

[10]  Max I. Kanovich.  Horn programming in linear logic is NP-complete , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[11]  Gopalan Nadathur,et al.  Uniform Proofs as a Foundation for Logic Programming , 1991, Ann. Pure Appl. Log..

[12]  Y. Lafont.  From proof-nets to interaction nets , 1995 .

[13]  Michael Barr,et al.  *-Autonomous categories and linear logic , 1991, Mathematical Structures in Computer Science.

[14]  Jean-Yves Girard,et al.  Geometry of Interaction 1: Interpretation of System F , 1989 .

[15]  Philip Wadler,et al.  Is there a use for linear logic? , 1991, PEPM '91.

[16]  Jean-Marc Andreoli,et al.  Interaction abstract machines , 1993 .

[17]  Carolyn Brown,et al.  A categorical linear framework for Petri nets , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[18]  Steeen Hh Olldobler.  On Deductive Planning and the Frame Problem , 1992 .

[19]  Jean-Marc Andreoli,et al.  Logic Programming with Sequent Systems, A Linear Logic Approach , 1989, ELP.

[20]  Hiu Fai Chau,et al.  A Proof Search System for a Modal Substructural Logic Based on Labelled Deductive Systems , 1993, LPAR.

[21]  Patrick Lincoln,et al.  Constant-Only Multiplicative Linear Logic is NP-Complete , 1992, Theor. Comput. Sci..

[22]  Jean-Yves Girard,et al.  Geometry of interaction 2: deadlock-free algorithms , 1990, Conference on Computer Logic.

[23]  Jean-Yves Girard.  Logic and Exceptions: A Few Remarks , 1992, J. Log. Comput..

[24]  Samson Abramsky,et al.  Computational Interpretations of Linear Logic , 1993, Theor. Comput. Sci..

[25]  Steffen Hölldobler,et al.  Linear Deductive Planning , 1996, J. Log. Comput..

[26]  Yves Lafont,et al.  The Linear Abstract Machine , 1988, Theor. Comput. Sci..

[27]  Johan Lilius.  High-Level Nets and Linear Logic , 1992, Application and Theory of Petri Nets.

[28]  Andrea Asperti,et al.  Linear Logic, Comonads and Optimal Reduction , 1995, Fundam. Informaticae.

[29]  Martín Abadi,et al.  The geometry of optimal lambda reduction , 1992, POPL '92.

[30]  Andre Scedrov,et al.  Bounded Linear Logic: A Modular Approach to Polynomial-Time Computability , 1992, Theor. Comput. Sci..

[31]  Yves Lafont,et al.  Interaction nets , 1989, POPL '90.

[32]  V. Michele Abrusci.  Phase Semantics and Sequent Calculus for Pure Noncommutative Classical Linear Propositional Logic , 1991, J. Symb. Log..

[33]  Philip Wadler,et al.  Linear Types can Change the World! , 1990, Programming Concepts and Methods.

[34]  Radha Jagadeesan,et al.  Games and Full Completeness for Multiplicative Linear Logic , 1994, J. Symb. Log..

[35]  WadlerPhilip.  Is there a use for linear logic , 1991 .

[36]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[37]  John S. Conery,et al.  Logical Objects , 1988, ICLP/SLP.

[38]  Vaughan R. Pratt,et al.  The Duality of TIme and Information , 1992, CONCUR.

[39]  Glynn Winskel,et al.  Completeness Results for Linear Logic on Petri Nets , 1993, Ann. Pure Appl. Log..

[40]  Narciso Martí-Oliet,et al.  Rewriting Logic as a Logical and Semantic Framework , 1996 .

[41]  Jean-Marc Andreoli,et al.  Abstract Interpretation of Linear Logic Programming , 1993, ILPS.

[42]  José Meseguer,et al.  An algebraic axiomatization of linear logic models , 1991 .

[43]  Guy Perrier,et al.  A Procedure for Automatic Proof Nets Construction , 1992, LPAR.

[44]  Hirofumi Katsuno,et al.  On the Difference between Updating a Knowledge Base and Revising It , 1991, KR.

[45]  Patrick Denis Lincoln.  Computational aspects of linear logic , 1992 .

[46]  MeseguerJosé.  Conditional rewriting logic as a unified model of concurrency , 1992 .

[47]  Vaughan R. Pratt,et al.  Action Logic and Pure Induction , 1990, JELIA.

[48]  Carl A. Gunter,et al.  Proving memory management invariants for a language based on linear logic , 1992, LFP '92.

[49]  Dirk Roorda,et al.  Resource Logics : Proof-Theoretical Investigations , 1991 .

[50]  Andre Scedrov,et al.  A brief guide to linear logic , 1990, Bull. EATCS.

[51]  Cosimo Laneve,et al.  Interaction Systems II: The Practice of Optimal Reductions , 1993, Theor. Comput. Sci..

[52]  John Lamping,et al.  An algorithm for optimal lambda calculus reduction , 1989, POPL '90.

[53]  Cosimo Laneve,et al.  Optimal Reductions in Interaction Systems , 1993, TAPSOFT.

[54]  Vincent Danos,et al.  Local and asynchronous beta-reduction , 1993, LICS 1993.

[55]  Vinod Kathail,et al.  Optimal interpreters for lambda-calculus based functional languages , 1990 .

[56]  Cosimo Laneve,et al.  Paths, Computations and Labels in the Lambda-Calculus , 1993, RTA.

[57]  Narciso Martí-Oliet,et al.  From Petri nets to linear logic , 1989, Mathematical Structures in Computer Science.

[58]  Roberto Gorrieri,et al.  Implicative formulae in the proofs of computations' analogy , 1989, POPL '90.

[59]  Valeria de Paiva,et al.  A Dialectica-like Model of Linear Logic , 1989, Category Theory and Computer Science.

[60]  Ian Mackie,et al.  Lilac: a functional programming language based on linear logic , 1994, Journal of Functional Programming.

[61]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

[62]  JEAN-MARC ANDREOLI,et al.  Logic Programming with Focusing Proofs in Linear Logic , 1992, J. Log. Comput..

[63]  Dov M. Gabbay,et al.  Extending the Curry-Howard interpretation to linear, relevant and other resource logics , 1992, Journal of Symbolic Logic.

[64]  Richard Blute.  Proof Nets and Coherence Theorems , 1991, Category Theory and Computer Science.

[65]  Eric Monteiro.  Linear Logic as CSP , 1994, J. Log. Comput..

[66]  Cosimo Laneve,et al.  Paths in the lambda-calculus. Three years of communications without understanding , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[67]  R. A. G. Seely,et al.  Linear Logic, -Autonomous Categories and Cofree Coalgebras , 1989 .

[68]  Vincent Danos,et al.  The structure of multiplicatives , 1989, Arch. Math. Log..

[69]  David N. Yetter,et al.  Quantales and (noncommutative) linear logic , 1990, Journal of Symbolic Logic.

[70]  José Meseguer,et al.  A logical theory of concurrent objects , 1990, OOPSLA/ECOOP '90.

[71]  Denis Lugiez,et al.  Complement Problems and Tree Automata in AC-like Theories (Extended Abstract) , 1993, STACS.

[72]  Jirí Zlatuska.  Committed-Choice Concurrent Logic Programming in Linear Logic , 1993, Kurt Gödel Colloquium.

[73]  José Meseguer,et al.  A logical theory of concurrent objects and its realization in the Maude language , 1993 .

[74]  Jean-Marc Andreoli,et al.  Communication as Fair Distribution of Knowledge , 1991, OOPSLA.

[75]  Carl A. Gunter,et al.  Reference counting as a computational interpretation of linear logic , 1996, Journal of Functional Programming.

[76]  Bertram Fronhöfer,et al.  Plan Generation by Linear Proofs: On Semantics , 1989, GWAI.

[77]  Arnon Avron,et al.  Simple Consequence Relations , 1988, Inf. Comput..

[78]  Vladimir Alexiev,et al.  Mutable Object State for Object-Oriented Logic Programming: A Survey , 1993 .

[79]  Michael Thielscher,et al.  Equational Logic Programming Actions, and Change , 1992, JICSLP.

[80]  Carolyn Brown,et al.  Linear logic and Petri nets : categories, algebra and proof , 1990 .

[81]  Henry G. Baker,et al.  Lively linear Lisp: “look ma, no garbage!” , 1992, SIGP.

[82]  Glynn Winskel,et al.  Petri Nets as Models of Linear Logic , 1990, CAAP.

[83]  Patrick Lincoln,et al.  Adventures in Associative-Commutative Unification , 1989, J. Symb. Comput..

[84]  Cosimo Laneve,et al.  Interaction Systems I: The theory of optimal reductions , 1994, Mathematical Structures in Computer Science.

[85]  Philip Wadler,et al.  A Taste of Linear Logic , 1993, MFCS.

[86]  William A. Howard,et al.  The formulae-as-types notion of construction , 1969 .

[87]  Jean-Yves Girard,et al.  Towards a geometry of interaction , 1989 .

[88]  Serenella Cerrito,et al.  A linear semantics for allowed logic programs , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[89]  Carl A. Gunter,et al.  Nets as Tensor Theories , 1989 .

[90]  Bertram Fronhöfer.  Linear Proofs and Linear Logic , 1992, JELIA.

[91]  Akinori Yonezawa,et al.  ACL - A Concurrent Linear Logic Programming Paradigm , 1993, ILPS.

[92]  J. Gallier.  Constructive Logics. Part II: Linear Logic and Proof Nets , 1991 .

[93]  J. Girard,et al.  Proofs and types , 1989 .

[94]  Carl A. Gunter,et al.  Normal process representatives , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[95]  A. Troelstra.  Lectures on linear logic , 1992 .

[96]  James Harland,et al.  The Uniform Proof-Theoretic Foundation of Linear Logic Programming , 1991, ISLP.

[97]  P. Lincoln,et al.  Operational aspects of linear lambda calculus , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[98]  Vaughan R. Pratt,et al.  Event Spaces and their Linear Logic , 1991, AMAST.

[99]  Gerard Allwein,et al.  Kripke models for linear logic , 1993, Journal of Symbolic Logic.

[100]  Andreas Blass,et al.  A Game Semantics for Linear Logic , 1992, Ann. Pure Appl. Log..

[101]  Gérard Boudol,et al.  Some Chemical Abstract Machines , 1993, REX School/Symposium.

[102]  Serenella Cerrito,et al.  A Linear Axiomatization of Negation as Failure , 1992, J. Log. Program..

[103]  Paolo Ciancarini,et al.  Comparative Semantics of LO , 1994 .

[104]  Uday S. Reddy,et al.  A linear logic model of state , 1993 .

[105]  José Meseguer,et al.  From Petri Nets to Linear Logic through Categories: A Survey , 1991, Int. J. Found. Comput. Sci..

[106]  Jean-Yves Girard,et al.  Linear Logic and Lazy Computation , 1987, TAPSOFT, Vol.2.

[107]  Dale Miller,et al.  Logic Programming in a Fragment of Intuitionistic Linear Logic , 1994, Inf. Comput..

[108]  Jacqueline Vauzeilles,et al.  Generating Plans in Linear Logic I. Actions as Proofs , 1993, Theor. Comput. Sci..

[109]  Jean-Yves Girard.  Linear Logic and Parallelism , 1986, Mathematical Models for the Semantics of Parallelism.

[110]  Patrick Lincoln,et al.  First-Order Linear Logic without Modalities is NEXPTIME-Hard , 1994, Theor. Comput. Sci..

[111]  Jean-Marc Andreoli,et al.  True Concurrency Semantics for a Linear Logic Programming Language with Braodcast Communication , 1993, TAPSOFT.

[112]  Jean-Marc Andreoli,et al.  LO and behold! Concurrent structured processes , 1990, OOPSLA/ECOOP '90.

[113]  Andre Scedrov,et al.  Linear Logic and Computation: A Survey , 1995 .

[114]  Dale Miller.  The pi-Calculus as a Theory in Linear Logic: Preliminary Results , 1992, ELP.

[115]  Yves Lafont,et al.  The Paradigm of Interaction (short Version) , 1991 .

[116]  Jean-Yves Girard,et al.  On the Unity of Logic , 1993, Ann. Pure Appl. Log..

[117]  J. Lambek.  The Mathematics of Sentence Structure , 1958 .