On Intuitionistic Linear Logic

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

[2]  H. Schwichtenberg.  Proof Theory: Some Applications of Cut-Elimination , 1977 .

[3]  W. Hodges.  Elementary Predicate Logic , 1983 .

[4]  Jean Gallier,et al.  Constructive Logics Part I: A Tutorial on Proof Systems and Typed gamma-Calculi , 1993, Theor. Comput. Sci..

[5]  D. Prawitz.  Ideas and Results in Proof Theory , 1971 .

[6]  F. E. J. Linton,et al.  Coequalizers in categories of algebras , 1969 .

[7]  Dag Prawitz,et al.  A survey of some connections between classical, intuitionistic and minimal logic , 1968 .

[8]  Peter Schroeder-Heister,et al.  A natural extension of natural deduction , 1984, Journal of Symbolic Logic.

[9]  Ascander Suarez.  Compiling ML into CAM , 1990 .

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

[11]  I. Moerdijk.  Review: A. G. Dragalin, Mathematical intuitionism. Introduction to proof theory , 1990 .

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

[13]  Peter W. O'Hearn.  Linear Logic and Interference Control , 1991, Category Theory and Computer Science.

[14]  G. Kreisel.  The Collected Papers of Gerhard Gentzen , 1971 .

[15]  Simon Ambler.  First order linear logic in symmetric monoidal closed categories , 1991 .

[16]  Samuel Eilenberg,et al.  Proceedings of the Conference on Categorical Algebra, La Jolla, 1965 , 1966 .

[17]  B. Russell,et al.  Principia Mathematica Vol. I , 1910 .

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

[19]  Pierre-Louis Curien,et al.  The Categorical Abstract Machine , 1987, Sci. Comput. Program..

[20]  Avron Arnon.  The semantics and proof theory of linear logic , 1988 .

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

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

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

[24]  A. G. Dragálin.  Mathematical Intuitionism. Introduction to Proof Theory , 1988 .

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

[26]  Rajeev Goré,et al.  Cut-free sequent and tableau systems for propositional Diodorean modal logics , 1994, Stud Logica.

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

[28]  Valeria de Paiva,et al.  Full intuitionistic linear logic , 1993 .

[29]  Martin Hyland,et al.  Dialogue Games and Innocent Strategies: An Approach to (Intensional) Full Abstraction for PCF , 1993 .

[30]  Eugenio Moggi,et al.  Computational lambda-calculus and monads , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[31]  F. William Lawvere,et al.  Adjointness in Foundations , 1969 .

[32]  J. Lambek,et al.  Introduction to higher order categorical logic , 1986 .

[33]  Alex K. Simpson,et al.  The proof theory and semantics of intuitionistic modal logic , 1994 .

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

[35]  Vincent Danos,et al.  The Structure of Exponentials: Uncovering the Dynamics of Linear Logic Proofs , 1993, Kurt Gödel Colloquium.

[36]  Anne Sjerp Troelstra.  Natural Deduction for Intuitionistic Linear Logic , 1995, Ann. Pure Appl. Log..

[37]  D. A. Turner,et al.  Miranda: A Non-Strict Functional language with Polymorphic Types , 1985, FPCA.

[38]  J. Roger Hindley,et al.  Introduction to combinators and λ-calculus , 1986, Acta Applicandae Mathematicae.

[39]  Nick Benton,et al.  A Term Calculus for Intuitionistic Linear Logic , 1993, TLCA.

[40]  Jean-Yves Girard,et al.  The System F of Variable Types, Fifteen Years Later , 1986, Theor. Comput. Sci..

[41]  Nick Benton,et al.  Computational types from a logical perspective , 1998, Journal of Functional Programming.

[42]  Wim H. Hesselink.  Axioms and models of linear logic , 2005, Formal Aspects of Computing.

[43]  Victor Harnik,et al.  Lambek's categorical proof theory and Läuchli's abstract realizability , 1992, Journal of Symbolic Logic.

[44]  Giuseppe Longo,et al.  Categories, types and structures - an introduction to category theory for the working computer scientist , 1991, Foundations of computing.

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

[46]  Andrzej Filinski.  Linear continuations , 1992, POPL '92.

[47]  W. R. Stoye.  The implementation of functional languages using custom hardware , 1985 .

[48]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[49]  D. A. Turner,et al.  A new implementation technique for applicative languages , 1979, Softw. Pract. Exp..

[50]  Simon L. Peyton Jones,et al.  Report on the programming language Haskell: a non-strict, purely functional language version 1.2 , 1992, SIGP.

[51]  Joachim Lambek.  Deductive systems and categories , 2005, Mathematical systems theory.

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

[53]  Haskell B. Curry,et al.  Combinatory Logic, Volume I , 1959 .

[54]  Philip Wadler,et al.  There's No Substitute for Linear Logic , 1991 .

[55]  R. Jagadeesan,et al.  Games and Full Abstraction for PCF : Preliminary , 1993 .

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

[57]  R. A. G. Seely,et al.  Categorical semantics for higher order polymorphic lambda calculus , 1987, Journal of Symbolic Logic.

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

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

[60]  S. Lane.  Categories for the Working Mathematician , 1971 .

[61]  Nick Benton.  Strong Normalisation for the Linear Term Calculus , 1995, J. Funct. Program..

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

[63]  J. Gallier.  On the Correspondence Between Proofs and -Terms , 1995 .

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

[65]  William W. Tait,et al.  Intensional interpretations of functionals of finite type I , 1967, Journal of Symbolic Logic.