A General Adequacy Result for a Linear Functional Language

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

[2]  Torben Braüner,et al.  The Girard Translation Extended with Recursion , 1994, CSL.

[3]  Bart Jacobs,et al.  Semantics of Weakening and Contraction , 1994, Ann. Pure Appl. Log..

[4]  Torben Braüner,et al.  A Model of Intuitionistic Affine Logic From Stable Domain Theory , 1994, ICALP.

[5]  Gordon D. Plotkin,et al.  An axiomatisation of computationally adequate domain theoretic models of FPC , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[6]  Søren Riis,et al.  Count(q) Does Not Imply Count(p) , 1994, Ann. Pure Appl. Log..

[7]  Peter D. Mosses,et al.  An Action Semantics for ML Concurrency Primitives , 1994, FME.

[8]  Lars Arge,et al.  External-Storage Data Structures for Plane-Sweep Algorithms , 1994 .

[9]  Sten Agerholm,et al.  LCF Examples in HOL , 1994, Comput. J..

[10]  Allan Cheng,et al.  Local Model Checking and Traces , 1994 .

[11]  Arne Skou,et al.  Automatic Verification of Real-Timed Systems Using EPSILON , 1994 .

[12]  Nils Klarlund,et al.  The Limit View of Infinite Computations , 1994, CONCUR.

[13]  Glynn Winskel,et al.  Petri Nets and Bisimulations , 1994 .

[14]  Radha Jagadeesan,et al.  Full Abstraction for PCF , 1994, Inf. Comput..

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

[16]  Gordon D. Plotkin,et al.  Type theory and recursion , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

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

[18]  Axel Poigné,et al.  Basic category theory , 1993, LICS 1993.

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

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

[21]  Axel Poigné,et al.  A Note on Inconsistencies Caused by Fixpoints in a Cartesian Closed Category , 1990, Theor. Comput. Sci..

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

[23]  Jean-Yves Girard,et al.  Linear Logic , 1987, Theor. Comput. Sci..

[24]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[25]  G. Winskel.  The formal semantics of programming languages , 1993 .

[26]  Samson Abramsky,et al.  Handbook of logic in computer science. , 1992 .

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

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

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

[30]  Per Martin-Löf,et al.  Intuitionistic type theory , 1984, Studies in proof theory.

[31]  J. Roger Hindley,et al.  To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism , 1980 .

[32]  F. W. Lawvere,et al.  Diagonal arguments and cartesian closed categories , 1969 .