@article( LL,Author="Girard, J.-Y.", Title="Linear Logic", Journal="Theoretical Computer Science", Volume="50", Year="1987", pages="1-102") @article( Mult,Author="Girard, J.-Y.", Title="Multiplicatives", Journal="{Rendiconti del Seminario Matematico dell' Universit\'a e Politecnico Torino, Special Issue on Logic and Computer Science}", Year="1987", pages="11-33") @inproceedings( Quant,Author="Girard, J.-Y.", Title="Quantifiers in Linear Logic", Booktitle="{Proc. of the SILFS Conference, Cesena, Italy}", Month="January", Year="1987") @misc( Quant2,Author="Girard, J.-Y.", Title="Quantifiers in linear logic {II}", HowPublished="{Pr\'epublications Paris 7 Logique, No. 19}", Month="January", Year="1991") @misc( GirardBoulder,Author="Girard, J.-Y.", Title="Towards a Geometry of Interaction", HowPublished="{In: Contemporary Math. 92, Amer. Math. Soc.}", Year="1989", Note="69-108") @inproceedings( GeomInterI,Author="Girard, J.-Y.", Title="Geometry of Interaction {I}: Interpretation of System {F}", Booktitle="Logic Colloquium '88", Editors="R. Ferro et al.", Publisher="North-Holland", Address="Amsterdam", Year="1989") @misc( GeomInterII,Author="Girard, J.-Y.", Title="Geometry of Interaction {II}: Deadlock-Free Algorithms", HowPublished="{In: Springer LNCS 417}", Year="1990") @article( FrenchSciAm,Author="Girard, J.-Y.", Title="La Logique Lin\'eaire", Journal="Pour La Science, \'Edition Francaise de Scientific American", Volume="150", Month="April", Year="1990", pages="74-85") @article( LC,Author="Girard, J.-Y.", Title="A new constructive logic: classical logic", Journal="Mathematical Structures in Computer Science", Volume="1", Year="1991", pages="255-296") @misc( LU,Author="Girard, J.-Y.", Title="On the unity of logic", HowPublished="Manuscript", Year="1991") @inproceedings( Lazy,Author="Girard, J.-Y. and Y. Lafont", Title="Linear Logic and Lazy Computation", Booktitle="{TAPSOFT '87, Volume 2}", Editors="H. Ehrig et al.", Publisher="{Springer LNCS 250}", Year="1987", Pages="52-66") @book( ProofsTypes,Author="Girard, J.-Y. and Y. Lafont and P. Taylor", Title="Proofs and Types", Publisher="Cambridge Tracts in Theoretical Computer Science, Cambridge University Press", Year="1989") @misc( GirardFix,Author="Girard, J.-Y.", Title="A fixpoint theorem in linear logic", HowPublished="{Announcement on `Linear' electronic forum }", Month="February", Year="1992") @article( Lafont88,Author="Lafont, Y.", Title="The Linear Abstract Machine", Journal="Theoretical Computer Science", Volume="59", Year="1988", pages="157-180") @inproceedings( Lafont90,Author="Lafont, Y.", Title="Interaction Nets", Booktitle="Proc. 17-th {ACM} Symp. on Principles of Programming Languages, San Francisco", Month="January", Year="1990", pages="95-108") @article( BLL, Author="Girard, J.-Y. and A. Scedrov and P.J. Scott", Title="Bounded Linear Logic: A Modular Approach to Polynomial Time Computability", Journal="Theoretical Computer Science", Volume="97", Year="1992", Pages="1-66") @article( DanosRegnier89,Author="Danos, V. and L. Regnier", Title="The Structure of Multiplicatives", Journal="Archive for Mathematical Logic", Volume="28", Year="1989", pages="181-203") @misc( Danos90,Author="Danos, V.", Title="{La Logique Lin\'eaire Appliqu\'ee \`a l'\'Etude de Divers Processus de Normalisation at Principalement du Lambda-Calcul}", HowPublished="{Th\`ese de Doctorat, Universit\'e de Paris VII}", Year="1990") @misc( Regnier92,Author="Regnier, L.", Title="{$\lambda$-calcul et R\'eseaux}", HowPublished="{Th\`ese de Doctorat, Universit\'e de Paris VII}", Year="1992") @inproceedings( Cerrito90,Author="Cerrito, S.", Title="A Linear Semantics for Allowed Logic Programs", Booktitle="Proc. 5-th {IEEE} Symp. on Logic in Computer Science, Philadelphia", Month="June", Year="1990") @article( AndreoliPareschi91,Author="Andreoli, J.-M. and R. Pareschi", Title="Linear Objects: Logical Processes with Built-In Inheritance", Journal="New Generation Computing", Volume="9", Year="1991") @inproceedings( AndreoliPareschi90,Author="Andreoli, J.-M. and R. Pareschi", Title="Logic programming with sequent systems: a linear logic approach", Booktitle="Proc. Workshop on Extensions of Logic Programming, Tuebingen", Year="1990", Publisher="Lecture Notes in Artificial Intelligence, Springer-Verlag, Berlin") @misc( Andreoli92,Author="Andreoli, J.-M.", Title="Logic programming with focusing proofs in linear logic", HowPublished="{{ \it Journal of Logic and Computation}}", Year="1992", Note="To appear.") @misc( AndreoliPareschi92,Author="Andreoli, J.-M. and R. Pareschi", Title="Associative communication and its optimization via abstract interpretation", HowPublished="Manuscript", Month="August", Year="1992") @misc( AbramskyVickers, Author="Abramsky, S. and S. Vickers", Title="Quantales, Observational Logic, and Process Semantics", HowPublished="Preprint", Month="January", Year="1990") @inproceedings( Hudak,Author="Guzman, J.C. and P. Hudak", Title="Single-Threaded Polymorphic Lambda Calculus", Booktitle="Proc. 5-th {IEEE} Symp. on Logic in Computer Science, Philadelphia", Month="June", Year="1990") @inproceedings( GunterGehlot89,Author="Gunter, C.A. and V. Gehlot", Title="Nets as Tensor Theories", Booktitle="Proc. 10-th International Conference on Application and Theory of Petri Nets, Bonn", Editor="G. De Michelis", Year="1989", pages="174-191") @inproceedings( GehlotGunter90,Author="Gehlot, V. and C.A. Gunter", Title="Normal Process Representatives", Booktitle="Proc. 5-th {IEEE} Symp. on Logic in Computer Science, Philadelphia", Month="June", Year="1990") @techreport( Asperti87,Author="Asperti, A.", Title="A Logic for Concurrency", Institution="{Dipartimento di Informatica, Universit\'a di Pisa}", Year="1987") @inproceedings( Asperti90,Author="Asperti, A. and G.-L. Ferrari and R. Gorrieri", Title="Implicative Formulae in the `Proofs as Computations' Analogy", Booktitle="Proc. 17-th {ACM} Symp. on Principles of Programming Languages, San Francisco", Month="January", Year="1990", pages="59-71") @inproceedings( Pratt91,Author="Pratt, V.R.", Title="Event spaces and their linear logic", Booktitle="{AMAST '91: Algebraic Methodology and Software Technology, Iowa City, 1991}", Series="Workshops in Computing", Publisher="Springer-Verlag", Year="1992", Pages="1-23") @article( Blass72,Author="Blass, A.", Title="Degrees of indeterminacy of games", Journal="Fundamenta Mathematicae", Volume="77", Year="1972", pages="151-166") @article( Blass92,Author="Blass, A.", Title="A game semantics for linear logic", Journal="Annals Pure Appl. Logic", Volume="56", Year="1992", pages="183-220", Note="{Special Volume dedicated to the memory of John Myhill}") @book( Barr79,Author="Barr, M.", Title="*-Autonomous Categories", Series="Lecture Notes in Mathematics", Volume="752", Publisher="Springer-Verlag", Address="Berlin", Year="1979") @article( Barr90,Author="Barr, M.", Title="Accessible categories and models of linear logic", Journal="Journal Pure Appl. Algebra", Volume="69", Year="1990", Pages="219-232") @inproceedings( Seely87,Author="Seely, R.A.G.", Title="Linear logic, *-autonomous categories, and cofree coalgebras", Booktitle="Categories in Computer Science and Logic", Editors="Gray, J.W. and A. Scedrov", Publisher="{Contemporary Math., vol. 92, American Math. Soc., Providence, RI}", Year="1989", pages="371-382") @inproceedings( Mayr,Author="Mayr, E.W.", Title="An Algorithm for the General {Petri} Net Reachability Problem", Booktitle="Proc. 13-th {ACM} Symp. on Theory of Computing, Milwaukee", Year="1981", pages="238-246") @inproceedings( Kosaraju,Author="Kosaraju, S.R.", Title="Decidability of Reachability in Vector Addition Systems", Booktitle="Proc. 14-th {ACM} Symp. on Theory of Computing", Year="1982", pages="267-281") @misc( Meseguer89,Author="Marti-Oliet, N. and J. Meseguer", Title="From {Petri} Nets to Linear Logic", HowPublished="{In: Springer LNCS 389, ed. by D.H. Pitt et al.}", Year="1989", Note="313-340") @inproceedings( BrownGurr,Author="Brown, C. and D. Gurr", Title="A Categorical Linear Framework for {Petri} Nets", Booktitle="Proc. 5-th {IEEE} Symp. on Logic in Computer Science, Philadelphia", Month="June", Year="1990") @book( AndersonBelnap,Author="{Anderson, A.R. and N.D. Belnap, Jr.}", Title="{Entailment. Volume 1}", Publisher="Princeton University Press", Address="{Princeton, New Jersey}", Year="1975") @book( Gallier,Author="Gallier, J.H.", Title="Logic for computer science", Publisher="Harper \& Row Publishers", Address="{New York}", Year="1986") @article( KripkeR,Author="Kripke, S.A.", Title="The Problem of Entailment{. Abstract}", Journal="Journal of Symbolic Logic", Volume="24", Year="1959", Pages="324") @article( Avron,Author="Avron, A.", Title="The Semantics and Proof Theory of Linear Logic", Journal="Theoretical Computer Science", Volume="57", Year="1988", pages="161-184") @article( Urq84,Author="Urquhart, A.", Title="The Undecidability of Entailment and Relevant Implication", Journal="Journal of Symbolic Logic", Volume="49", Year="1984", pages="1059-1073") @techreport( Urq89,Author="Urquhart, A.", Title="The Complexity of Decision Procedures in Relevance Logic", Number="217/89", Institution="Department of Computer Science, University of Toronto", Year="1989") @misc( Urq90,Author="Urquhart, A.", Title="The Complexity of Linear Logic", HowPublished="{Preprint, Preliminary Version}", Month="March", Year="1990") @misc( Roorda,Author="Roorda, D.", Title="Investigations into Classical Linear Logic", HowPublished="Preprint", Month="October", Year="1989") @article( McAloon,Author="McAloon, K.", Title="Petri Nets and Large Sets", Journal="Theoretical Computer Science", Volume="32", Year="1984", Pages="173-183") @article( KarpMiller,Author="Karp, R. and R. Miller", Title="Parallel Program Schemata", Journal="Journal of Computer and System Sciences", Volume="3", Year="1969", Pages="147-195") @article( Clote,Author="Clote, P.", Title="On the Finite Containment Problem for {Petri} Nets", Journal="Theoretical Computer Science", Volume="43", Year="1986", Pages="99-105") @techreport( Lipton,Author="Lipton, R.", Title="The reachability problem is exponential-space hard", Institution="Department of Computer Science, Yale University", Number="62", Month="January", Year="1976") @article( MayrMeyer,Author="Mayr, E. and A. Meyer", Title="The Complexity of the Word Problems for Commutative Semigroups and Polynomial Ideals", Journal="Advances in Mathematics", Volume="46", Year="1982", Pages="305-329") @article( Lambek61,Author="Lambek, J.", Title="How To Program An Infinite Abacus", Journal="Canadian Math. Bulletin", Volume="4", Year="1961", pages="295-302") @article( Lambek58,Author="Lambek, J.", Title="The Mathematics of Sentence Structure", Journal="Amer. Math. Monthly", Volume="65", Year="1958", pages="154-169") @inproceedings( Lambek87,Author="Lambek, J.", Title="Multicategories revisited", Booktitle="Categories in Computer Science and Logic", Editors="Gray, J.W. and A. Scedrov", Publisher="{Contemporary Math., vol. 92, American Math. Soc., Providence, RI}", Year="1989", pages="217-239") @inproceedings( Bawden86,Author="Bawden, A.", Title="Connection Graphs", Booktitle="Proc. {ACM} Symp. on Lisp and Functional Programming", Year="1986", pages="258-265") @article( Yetter,Author="Yetter, D.N.", Title="Quantales and (Noncommutative) Linear Logic", Journal="Journal of Symbolic Logic", Volume="55", Year="1990", Pages="41-64") @inproceedings( dePaiva89,Author="V.C.V. de Paiva", Title="A Dialectica-like Model of Linear Logic", Booktitle="Category Theory and Computer Science", Editors="D.H. Pitt et al.", Publisher="Springer {LNCS} 389", Month="September", Year="1989", Pages="341-356") @inproceedings( ChL,Author="Chirimar, J. and J. Lipton", Title="Provability in {TBLL}: A decision procedure", Booktitle="Computer Science Logic, Proceedings 1991", Editors="E. Boerger et al.", Publisher="Springer {LNCS} 626", Year="1992", Pages="341-356") @book( Gentzen,Author="Gentzen, G.", Title="{Collected Works. Edited by M.E. Szabo}", Publisher="North-Holland", Address="Amsterdam", Year="1969") @article( Direct,Author="Ketonen, J. and R. Weyhrauch", Title="A decidable fragment of predicate calculus", Journal="Theoretical Computer Science", Volume="32", Year="1984", Pages=" ") @book( HindleySeldin,Author="Hindley, J.R. and J.P. Seldin", Title="Introduction to Combinators and {Lambda} Calculus", Publisher="{London Mathematical Society Student Texts, Cambridge University Press}", Year="1986") @article( Minsky61,Author="Minsky, M.", Title="Recursive Unsolvability of Post's problem of `tag' and other topics in the theory of Turing machines", Journal="Annals of Mathematics", Volume="74:3", Year="1961", Pages="437-455") @book( Bar, Author="Barendregt, H.P.", Title="The Lambda Calculus: Its Syntax and Semantics", Publisher="North Holland", year="1984") @book( Gabbay, Author="Gabbay, D.M.", Title="Semantical Investigations in Heyting's Intuitionistic Logic", Publisher="D. Reidel", year="1981",pages="284") @techreport( Lob75, Author={L{\"o}b, M.H.}, Title="Embedding First-Order Predicate Logic in Fragments of Intuitionistic Logic", Institution="Mathematisch Institut, Amsterdam", Number="75-8",Year="1975") @book( GJ, Author="Garey, M.R. and D.S. Johnson", key="Garey and Johnson", Title="Computers and Intractability: A Guide to the Theory of NP-Completeness", Publisher="W.H. Freeman and Co.",year="1979") @inproceedings( ChandraStockmeyer,Author="Chandra, A.K. and L.J. Stockmeyer", Title="Alternation", Booktitle="Proc. 17th Ann. {IEEE} Symp. on Foundations of Computer Science", Year="1976", pages="98-108") @article( Chandra-Kozen-Stockmeyer81, AUTHOR = {Chandra, A.K. and D. C. Kozen and L. J. Stockmeyer}, TITLE = {Alternation}, JOURNAL = {Journal of the ACM}, YEAR = {1981}, VOLUME = {28}, NUMBER = {1}, PAGES = {114--133}, NOTE = {}) @inproceedings( EngbergWinskel89, author = "U. Engberg and G. Winskel", title = "Petri Nets as Models of Linear Logic", booktitle = "{Proceedings of CAAP '90}", year = "1990", editor = "A. Arnold", publisher = "{\it Lecture Notes in Computer Science vol.~431, Springer-Verlag}") @techreport( LL-SRI-TR, Author="P. Lincoln and J. Mitchell and A. Scedrov and N. Shankar", Title="Decision Problems for Propositional Linear Logic", Institution="CSL, SRI International", Number="SRI-CSL-90-08", Year="1990") @phdthesis( Gigi, Author="G. Bellin", title = "Mechanizing Proof Theory: Resource-Aware Logics and Proof-Transformations to Extract Implicit Information", school="Stanford University", year="1990") @phdthesis( Hudelmaier, Author="Hudelmaier, J.", title ="Bounds for Cut Elimination in Intuitionistic Propositional Logic", school="Universit{\"a}t T{\"u}bingen", year="1989") @book( Hopcroft-Ullman,Author="J. Hopcroft and J. Ullman", Title="Introduction to Automata Theory, Languages and Computation", Publisher="Addison-Wesley Publishing Company", Year="1979") @article( Post, Author="Post, E.L.", Title="Recursive Unsolvability of a Problem of Thue", Journal="Journal of Symbolic Logic", Volume="12",Year="1947", pages="1-11") @phdthesis( RKMeyer,Author="Meyer, R.K.", Title="Topics in Modal and Many-Valued Logic", School="University of Pittsburgh", Year="1966") @article( EATCS,Author="Scedrov, A.", Title="A Brief Guide to Linear Logic", Journal="Bulletin of the European Assoc. for Theoretical Computer Science", Volume="41", Month="June", Year="1990", Pages="154-165") @inproceedings( FOCS90, Author="Lincoln, P. and Mitchell, J. and Scedrov, A. and Shankar, N.", Title="Decision Problems for Propositional Linear Logic", Booktitle="Proc. 31st {IEEE} Symp. on Foundations of Computer Science", Pages="662--671", Year="1990") @article( LMSS92, Author="Lincoln, P. and Mitchell, J. and Scedrov, A. and Shankar, N.", Title="Decision Problems for Propositional Linear Logic", Journal="Annals Pure Appl. Logic", Volume="56", Year="1992", pages="239-311", Note="{Special Volume dedicated to the memory of John Myhill}") @inproceedings( Vorobjev, Author="Vorobjev, N.", Title="{New derivability algorithm in the constructive propositional calculus. (In Russian)}", Booktitle="Proceedings of the Steklov institute of Mathematics (Trudy), v.52", Year="1958", pages="193-225") @article( Pliushkevichus, Author="Pliushkevichus, R.", Title="On a version of the constructive predicate calculus without structural rules", Journal="Soviet Math. Doklady", Volume="6", Year="1965", pages="416-419") @article( Statman,author="Statman, R.", key="Statman 79", Title="Intuitionistic Propositional Logic is Polynomial-Space Complete", Journal="Theoretical Computer Science", Volume="9",year="1979",pages="67-72") @article( KetonenWeyhrauch, author= "J. Ketonen and R. Weyhrauch", title= "A Decidable Fragment of Predicate Calculus", journal= "Theoretical Computer Science", volume= "32", pages= "297-307", year=1984) @book( Kleene,Author="Kleene, S.C.", Title="Introduction to Metamathematics", Publisher="North-Holland", Year="1952") @incollection( Howard, key="Howard 80", Author="Howard, W.", Title="The formulas-as-types notion of construction", Booktitle="To H.B. Curry: Essays on Combinatory Logic, Lambda-Calculus and Formalism", Editors="Seldin, J.P. and J.R. Hindley", Publisher="Academic Press", Year="1980", Pages="479-490") @inproceedings( Mints, Author = "Mints, G.", title = "{Gentzen-type systems and resolution rules. Part I. Propositional logic}", booktitle = "COLOG-88", year = "1990", pages = "198-231", editor = "Martin-L{\"o}f, P. and Mints, G.", publisher = "{\it Lecture Notes in Computer Science vol.~417, Springer}") @article( Wajsberg, Author="Wajsberg, M.", Title="{Untersuchungen {\"u}ber den Aussagenkalk{\"u}l von A. Heyting}", Journal="Wiadomo{\'s}ci Matematyczne", Volume="46", Year="1938", pages="45-101") volume= "32", @misc( LS, author="Lincoln, P. and N. Shankar", Title="The Complexity of Cut Elimination in a Fragment of Linear Logic", Howpublished="Manuscript", Month="December", Year="1990") @article( Dyckhoff, Author="Dyckhoff, R.", Title="Contraction-free sequent calculi for intuitionistic logic", Journal="Journal of Symbolic Logic", Volume="57", Year="1992", Pages="795-807") @article( Abramsky90a, Author="Abramsky, S.", Title="Computational Interpretations of Linear Logic", Journal="Theoretical Computer Science", Year="1992", Note="{Special Issue on the 1990 Workshop on Math. Found. Prog. Semantics. To appear}") @article( Miller, Author="Miller, D. and G. Nadathur and F. Pfenning and A. Scedrov", Title="Uniform proofs as a foundation for logic programming", Journal="Annals Pure Appl. Logic", Volume="51", Year="1991", pages = "125-157", Note="{Special Issue on the 2-nd Annual IEEE Symposium on Logic in Computer Science, 1987.}") @incollection( Miller2, Author="Miller, D.", Title="Abstractions in logic programming", Booktitle="Logic and Computer Science", Editor="Odifreddi, P.", Publisher="{APIC Studies in Data Processing, Vol. 31, Academic Press}", Year="1990", Pages="329-359") @inproceedings( MillerHodas, Author = "Hodas, J.S. and D. Miller", Title = "Logic Programming in a Fragment of Intuitionistic Linear Logic", Booktitle = "{Proc. 6-th Annual IEEE Symposium on Logic in Computer Science, Amsterdam}", Month="July", Year = "1991", Pages = "32-42", Publisher = "{IEEE Computer Society Press, Los Alamitos, California}", Note="{Full paper to appear in {\it Information and Computation}. Draft available using anonymous ftp from host ftp.cis.upenn.edu and the file pub/papers/miller/ic92.dvi.Z.}") @inproceedings( LSS91, Author = "Lincoln, P. and A. Scedrov and N. Shankar", Title = "Linearizing Intuitionistic Implication", Booktitle = "{Proc. 6-th Annual IEEE Symposium on Logic in Computer Science, Amsterdam}", Month="July", Year = "1991", Pages = "51-62", Publisher = "{IEEE Computer Society Press, Los Alamitos, California}", Note="{Full paper to appear in {\it Annals of Pure and Applied Logic}. Draft available using anonymous ftp from host ftp.cis.upenn.edu and the file pub/papers/scedrov/lss91.dvi}") @inproceedings( Lamping, Author = "Lamping, J.", Title = "An Algorithm for Optimal Lambda Calculus Reduction", Booktitle = "{Proc. 17-th Annual ACM Symposium on Principles of Programming Languages, San Francisco}", Month="January", Year = "1990", Publisher = "{ACM Press, New York, NY}", Pages="16-30") @inproceedings( GonthierAbadiLevy92a, Author = "Gonthier, G. and M. Abadi and J.-J. Levy", Title = "The Geometry of Optimal Lambda Reduction", Booktitle = "{Proc. 19-th Annual ACM Symposium on Principles of Programming Languages, Albuquerque, New Mexico}", Month="January", Year = "1992", Publisher = "{ACM Press, New York, NY}") @inproceedings( GonthierAbadiLevy92b, Author = "Gonthier, G. and M. Abadi and J.-J. Levy", Title = "Linear Logic without Boxes", Booktitle = "{Proc. 7-th Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, California}", Month="June", Year = "1992", Pages="223-234", Publisher = "{IEEE Computer Society Press, Los Alamitos, California}") @inproceedings( LM92, Author = "Lincoln, P. and J. Mitchell", Title = "Operational aspects of linear lambda calculus", Booktitle = "{Proc. 7-th Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, California}", Month="June", Year = "1992", Pages="235-246", Publisher = "{IEEE Computer Society Press, Los Alamitos, California}") @inproceedings( AbrJag92a, Author = "Abramsky, S. and R. Jagadeesan", Title = "New Foundations for the Geometry of Interaction", Booktitle = "{Proc. 7-th Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, California}", Month="June", Year = "1992", Pages="211-222", Publisher = "{IEEE Computer Society Press, Los Alamitos, California}") @inproceedings( Kanovich92, Author = "Kanovich, M.", Title = "Horn Programming in Linear Logic is {NP}-Complete", Booktitle = "{Proc. 7-th Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, California}", Month="June", Year = "1992", Pages="200-210", Publisher = "{IEEE Computer Society Press, Los Alamitos, California}") @book( Curry, Author="Curry, H.B.", Title="Foundations of Mathematical Logic", Publisher="McGraw-Hill", Year="1963") @misc( LincolnWinkler92,Author="Lincoln, P. and T. Winkler", Title="{Constant-Only Multiplicative Linear Logic is NP-Complete}", HowPublished="Manuscript", Month="September", Year="1992", Note="Available using anonymous ftp from host ftp.csl.sri.com and the file pub/lincoln/comult-npc.dvi") @misc( BellinScott92,Author="Bellin, G. and P.J. Scott", Title="{Remarks on the $\pi$-Calculus and Linear Logic}", HowPublished="{Manuscript to be submitted to Proc. MFPS 8, Oxford}", Year="1992") @techreport(Miller92, Author="Miller, D.", Title="The $\pi$-calculus as a theory in linear logic: Preliminary results", Month="June", Year="1992", Institution="Computer Science Department, University of Pennsylvania", Number="MS-CIS-92-48", Note="Submitted. Available using anonymous ftp from host ftp.cis.upenn.edu and the file pub/papers/miller/pic.dvi.Z.") @inproceedings( CGR92, Author = "Chirimar, J. and C. Gunter and J. Riecke", Title = "Linear {ML}", Booktitle = "{Proc. ACM Symposium on Lisp and Functional Programming, San Francisco}", Month="June", Year = "1992", Publisher = "{ACM Press}") @misc( Mackie91,Author="Mackie, I.", Title="{Lilac - a functional programming language based on linear logic}", HowPublished="{Master's Thesis, Imperial College, London}", Year="1991") @misc( Cambridge92, Author="Benton, N. and G. Bierman and V. de Paiva and J.M.E. Hyland", Title="Term assignment for intuitionistic linear logic", HowPublished="Manuscript", Month="September", Year="1992") @misc( Wadler91,Author="Wadler, P.", Title="There's no substitute for linear logic", HowPublished="Manuscript", Month="December", Year="1991") @article( Shapiro,Author="Shapiro, E.Y.", Title="Alternation and the computational complexity of logic programs", Journal="Journal of Logic Programming", Volume="1", Year="1984", pages="19-33") @book( Troelstra,Author="Troelstra, A.S.", Title="Lectures on Linear Logic", Series="{CSLI Lecture Notes No. 29}", Publisher="Center for the Study of Language and Information, Stanford University", Year="1992") @misc( SaraswatLincoln,Author="Saraswat, V. and P. Lincoln", Title="Higher-Order, Linear, Concurrent Constraint Programming", Howpublished="Manuscript", Month="August", Year="1992") @misc( LincolnScedrov92,Author="Lincoln, P. and A. Scedrov", Title="First Order Linear Logic Without Modalities is {NEXPTIME}-Hard", Howpublished="Manuscript", Month="September", Year="1992", Note="Available using anonymous ftp from host ftp.cis.upenn.edu and the file pub/papers/scedrov/mall1.dvi") @phdthesis( Lincoln92,Author="Lincoln, P.D.", Title="Computational Aspects of Linear Logic", School="Stanford University", Year="1992") @inproceedings( Shankar92,Author="Shankar, N.", Title="Proof Search in the Intuitionistic Sequent Calculus", Booktitle="{Proc. of the 11th International Conference on Automated Deduction}", Month="June", Pages="522-536", Year="1992") @article( Stockmeyer,Author="Stockmeyer, L.", Title="Classifying the computational complexity of problems", Journal="Journal of Symbolic Logic", Volume="52", Year="1987", pages="1-43") @article( LincolnSigact,Author="Lincoln, P.", Title="Linear Logic", Journal="{ACM SIGACT Notices}", Volume="23", Number="2", Month="Spring", Year="1992", Pages="29-37") @misc( AbrJag92b,Author="Abramsky, S. and R. Jagadeesan", Title="Games and full completeness for multiplicative linear logic", HowPublished="Manuscript", Month="September", Year="1992", Note="{Available using anonymous ftp from the host theory.doc.ic.ac.uk and the file theory/papers/Abramsky/gfc.dvi}") @inproceedings( BluteSLNCS,Author="Blute, R.", Title="Proof nets and coherence theorems", Booktitle="{Category Theory and Computer Science, Proceedings 1991}", Editors="D.H. Pitt et al.", Publisher="{Springer LNCS 530}", Year="1991") @misc( BluteDiss,Author="Blute, R.", Title="Linear logic, coherence, and dinaturality", HowPublished="Dissertation, University of Pennsylvania", Month="September", Year="1991", Note="{Edited version to appear in {\it Theoretical Computer Science}}") @misc( GehlotDiss,Author="Gehlot, V.", Title="A proof-theoretic approach to semantics of concurrency", HowPublished="Dissertation, University of Pennsylvania", Year="1991") @misc( RoordaDiss,Author="Roorda, D.", Title="Resource logics: proof-theoretical investigations", HowPublished="Dissertation, University of Amsterdam", Month="September", Year="1991") @misc( Avron91,Author="Avron, A.", Title="Some properties of linear logic proved by semantic methods", HowPublished="Manuscript", Month="December", Year="1991") @article( DanosGaz,Author="Danos, V", Title="Logique lin\'eaire. Une repr\'esentation alg\'ebrique du calcul", Journal="Gaz. Math. (Soc. Math. de France)", Volume="41", Year="1989", pages="55-64") @misc( AllweinDunn92,Author="Allwein, G. and J.M. Dunn", Title="Kripke Models for Linear Logic", HowPublished="Manuscript", Month="January", Year="1992") @article( Rosenthal,Author="Rosenthal, K.I.", Title="Girard quantaloids", Journal="Mathematical Structures in Computer Science", Volume="2", Year="1992", pages="93-108") @article( AbrusciZ,Author="Abrusci, V.M.", Title="Noncommutative intuitionistic linear propositional logic", Journal="Zeitschr. f. Math. Logik u. Grundlagen d. Math.", Volume="36", Year="1990", pages="297-318") @article( AbrusciJSL,Author="Abrusci, V.M.", Title="Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic", Journal="Journal of Symbolic Logic", Volume="56", Year="1991", pages="1403-1451") @misc( BrownGurr91,Author="Brown, C. and D. Gurr", Title="Relations and noncommutative linear logic", HowPublished="Manuscript", Month="December", Year="1991") @misc( Asperti91,Author="Asperti, A.", Title="Linear Logic, Comonads and Optimal Reductions", HowPublished="Manuscript", Month="December", Year="1991") @inproceedings( MalacariaRegnier91, Author = "Malacaria, P. and L. Regnier", Title = "Some results on the interpretation of $\lambda$-calculus in operator algebras", Booktitle = "{Proc. 6-th Annual IEEE Symposium on Logic in Computer Science, Amsterdam}", Month="July", Year = "1991", Pages = "63-72", Publisher = "{IEEE Computer Society Press, Los Alamitos, California}") @inproceedings( LafontStreicher91, Author = "Lafont, Y. and T. Streicher", Title = "Game semantics for linear logic", Booktitle = "{Proc. 6-th Annual IEEE Symposium on Logic in Computer Science, Amsterdam}", Month="July", Year = "1991", Pages = "43-50", Publisher = "{IEEE Computer Society Press, Los Alamitos, California}") @article( Schellinx91,Author="Schellinx, H.", Title="Some syntactical observations on linear logic", Journal="Journal of Logic and Computation", Volume="1", Year="1991", pages="537-559") @misc( Ono91,Author="Ono, H.", Title="Phase structures and quantales --- a semantical study of logics without structural rules", HowPublished="Manuscript", Year="1991") @article( BellinKetonen92,Author="Bellin, G. and J. Ketonen", Title="A decision procedure revisited: Notes on direct logic, linear logic, and its implementation", Journal="Theoretical Computer Science", Volume="95", Year="1992", pages="115-142") @article( Dosen92,Author="Dosen, K.", Title="Nonmodal classical linear predicate logic is a fragment of intuitionistic linear logic", Journal="Theoretical Computer Science", Volume="102", Year="1992", pages="207-214") @misc( Jacobs92,Author="Jacobs, B.", Title="Semantics of weakening and contraction", HowPublished="Manuscript", Month="May", Year="1992")