**[Abramsky 1993]**
S. Abramsky. Computational interpretations of linear logic.
*Theoretical Computer Science*, 111:3-57, 1993.
Available in DVI and
PostScript formats.

**[Andreoli 1990a]**
J.-M. Andreoli. *Proposal for a Synthesis of Logic and Object-Oriented
Programming Paradigms*. PhD thesis, University of Paris VI, 1990.

**[Andreoli 1990b]**
J.-M. Andreoli. Logic programming with focusing proofs in linear logic.
*Journal of Logic and Computation*, 2(3):297-347, 1992.
Available in
PostScript format.

**[Andreoli & Pareschi 1990]**
J.-M. Andreoli and R. Pareschi. LO and behold! Concurrent structured processes.
In *Proceedings of OOPSLA'90*, pages 44-56, Ottawa, Canada, October 1990.
Published as ACM SIGPLAN Notices, vol.25, no.10.

**[Andreoli & Pareschi 1991]**
J.-M. Andreoli and R. Pareschi.
Linear objects: Logical processes with built-in inheritance.
*New Generation Computing*, 9:445-473, 1991.

**[Bellin & Scott 1992]**
G. Bellin and P. J. Scott. On the pi-calculus and linear logic. Manuscript, 1992.
Available in
PostScript format.

**[Bruscoli & Guglielmi 1995]**
P. Bruscoli and A. Guglielmi. A Linear Logic Programming Language with
Parallel and Sequential Conjunction, *Proceedings of the 1995 GULP-PRODE
Joint Conference on Declarative Programming*, Marina di Vietri,
Italy, 11-14 September 1995.

**[Cerrito 1990]**
S. Cerrito. A linear semantics for allowed logic programs.
In *Proceedings of the Fifth Symposium on Logic in Computer
Science*, pages 219-227, Philadelphia, Pennsylvania, June 1990. IEEE
Computer Society Press.

**[Cerrito 1992b]**
S. Cerrito. A linear axiomatization of negation as failure.
*Journal of Logic Programming*, 12:1-24, 1992.

**[Cerrito 1992a]**
S. Cerrito. Negation and linear completion.
In L. Farinas del Cerro and M. Penttonen, editors, *Intensional
Logic for Programming*, pages 155-194. Clarendon Press, 1992.

**[Cervesato et. al.]**
I. Cervesato, J. S. Hodas, and F. Pfenning,
*Efficient Resource Management for Linear Logic Proof Search*,
submitted to Extensions of Logic Programming 1996.
Available in DVI
and Postscript.
An
abstract is also available.

**[Chirimar 1995]**
J. Chirimar. *Proof Theoretic Approach to Specification Languages*.
PhD thesis, Department of Computer and Information Science,
University of Pennsylvania, 1995.
Available in PostScript format.

**[Chirimar et.al. 1992]**
J. Chirimar, C. A. Gunter, and J. G. Riecke.
Proving memory management invariants for a language based on linear logic.
*Lisp and Functional Programming*, pages 139-150, 1992.
Available in PostScript format.

**[Chirimar et. al.]**
J. Chirimar, C. A. Gunter, and J. G. Riecke.
Reference counting as a computational interpretation of linear logic.
*Journal of Functional Programming*, to appear.
Available in PostScript format.

**[Delzanno & Martelli 1995]**
G. Delzanno and M. Martelli. Objects in Forum. *Proceedings of the 1995
International Symposium on Logic Programming*, 4-7 December 1995,
Portland Oregon.

**[Galmiche & Boudinet 1994]**
D. Galmiche and E. Boudinet. Proof search for programming in intuitionistic
linear logic. In D. Galmiche and L. Wallen, editors, *CADE-12 Workshop on
Proof Search in Type-Theoretic Languages*, pages 24-30, Nancy, France,
June 1994.

**[Galmiche & Perrier 1994]**
D. Galmiche and G. Perrier. Foundations of proof search strategies design in
linear logic. In *Symposium on Logical Foundations of Computer Science*,
pages 101-113, St. Petersburg, Russia, 1994. Springer-Verlag LNCS 813.
Also available as Technical Report CRIN 94-R-112 from the Centre di
Recherche en Informatique de Nancy.

**[Girard 1987]**
J.-Y. Girard. Linear logic.
*Theoretical Computer Science*, 50:1-102, 1987.

**[Girard 1993]**
J.-Y. Girard. On the unity of logic.
*Annals of Pure and Applied Logic*, 59:201-217, 1993.

**[Guzmán & Hudak 1990]**
J. C. Guzmán and P. Hudak.
Single-threaded polymorphic lambda calculus.
In *Proceedings of the Fifth Symposium on Logic in Computer
Science*, pages 333-343, Philadelphia, Pennsylvania, June 1990. IEEE
Computer Society Press.

**[Harland & Pym 1992]**
J. Harland and D. Pym.
On resolution in fragments of classical linear logic.
In *Proceedings of the Russian Conference on Logic Programming
and Automated Reasoning*, pages 30-41. Springer-Verlag LNAI 624, July 1992.
Available in PostScript format.

**[Harland & Winikoff 1995]**
J. Harland and M. Winikoff.
Implementation and development issues for the linear logic programming language
Lygon. In *Proceedings of the Eighteenth Australian Computer Science
Conference*, pages 563-572, Adelaide, Australia, February 1995.
Also available as Technical Report TR 95/6, Melbourne University,
Department of Computer Science.
Available in PostScript format.

**[Hodas 1992]**
J. S. Hodas.
Specifying filler-gap dependency parsers in a linear-logic programming language.
In K. Apt, editor, *Proceedings of the Joint International
Conference and Symposium on Logic Programming*, pages 622-636, Washington,
DC, November 1992.
Available in DVI and
PostScript formats.

**[Hodas 1994]**
J. S. Hodas.
*Logic Programming in Intuitionistic Linear Logic: Theory, Design
and Implementation*. PhD thesis, University of Pennsylvania, Department
of Computer and Information Science, 1994.
Available in PostScript format.

**[Hodas & Miller 1994]**
J. S. Hodas and D. Miller.
Logic programming in a fragment of intuitionistic linear logic.
*Information and Computation*, 110(2):327-365, 1994.
Extended abstraction in the Proceedings of the Sixth Annual Symposium
on Logic in Computer Science, Amsterdam, July 15-18, 1991.
Available in DVI and
PostScript formats.

**[Kobayashi & Yonezawa 1993]**
N. Kobayashi and A. Yonezawa.
ACL - a concurrent linear logic programming paradigm.
In D. Miller, editor, *Proceedings of the International Logic Programming
Symposium*, pages 279-294, Vancouver, Canada, October 1993. MIT Press.

**[Kobayashi & Yonezawa 1994]**
N. Kobayashi and A. Yonezawa.
Asynchronous communication model based on linear logic.
*Formal Aspects of Computing*, 3:279-294, 1994.
Short version appeared in Joint International Conference and
Symposium on Logic Programming, Washington, DC, November 1992, Workshop on
Linear Logic and Logic Programming, edited by D. Miller.

**[Lafont 1989]**
Y. Lafont.
Functional programming and linear logic.
Lecture notes for the Summer School on Functional Programming and
Constructive Logic, Glasgow, United Kingdom, 1989.
Available in
PostScript format.

**[Lafont 1990]**
Y. Lafont.
Interaction nets.
In *Seventeenth Annual Symposium on Principles of Programming
Languages*, pages 95-108, San Francisco, California, 1990. ACM Press.

**[Lincoln & Saraswat 1993]**
P. Lincoln and V. Saraswat. Higher-order, linear, concurrent constraint
programming. Manuscript, January 1993.
Available in DVI
format.

**[Maraist et. al. 95]**
J. Maraist, M. Odersky, D. Turner, and P. Wadler. *Call-by-name,
call-by-value, call-by-need, and the linear lambda calculus*,
11'th International Conference on the Mathematical Foundations of
Programming Semantics, New Orleans, Lousiana, April 1995. Available
in
DVI format.

**[Miller et. al. 1991]**
D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov.
Uniform Proofs as a Foundation for Logic Programming.
*Annals of Pure and Applied logic*, 51:125-157, 1991.
Available in
DVI.
An
abstract
and
errata are also available.

**[Miller 1992]**
D. Miller. The pi-calculus as a theory in linear logic: Preliminary results.
In E. Lamma and P. Mello, editors, *Proceedings of the Workshop
on Extensions of Logic Programming*, pages 242-265. Springer-Verlag LNCS
660, 1992.
Available in
PostScript format.

**[Miller 1994]**
D. Miller. A multiple-conclusion meta-logic. In S. Abramsky, editor,
*Ninth Annual Symposium on Logic in Computer Science*, pages 272-281,
Paris, France, July 1994. IEEE Computer Society Press.
Available in
PostScript format.

**[O'Hearn 1991]**
P. W. O'Hearn.
Linear logic and interference control: Preliminary report.
In S. Abramsky, P.-L. Curien, A. M. Pitts D. H. Pitt, ,
A. PoignÂ, and D. E. Rydeheard, editors, *Proceedings of the
Conference on Category Theory and Computer Science*, pages 74-93, Paris,
France, 1991. Springer-Verlag LNCS 530.

**[Pym & Harland 1994]**
D. Pym and J. Harland.
A uniform proof-theoretic investigation of linear logic programming.
*Journal of Logic and Computation*, 4(2):175-207, April 1994.
Available in PostScript format.

**[Reddy 1993]**
U. S. Reddy. A typed foundation for directional logic programming.
In E. Lamma and P. Mello, editors, *Third International Workshop
on Extensions of logic programming*, pages 150-167, Bologna, Italy, 1993.
Springer-Verlag LNAI 660.
Available in DVI and
PostScript formats.

**[Saraswat 1993]**
V. Saraswat.
A brief introduction to linear concurrent constraint programming.
Manuscript, 1993.
Available in DVI format.

**[Tammet 1994]**
T. Tammet. Proof strategies in linear logic.
*Journal of Automated Reasoning*, 12:273-304, 1994.
Also available as Programming Methodology Group Report 70, Chalmers
University, 1993.
Available in PostScript format.

**[Wadler 90]**
P. Wadler. Linear types can change the world.
In M. Broy and C. B. Jones, editors, *IFIP TC 2 Working
Conference on Programming Concepts and Methods*, pages 561-581, Sea of
Gallilee, Israel, April 1990. North-Holland.
Available in PostScript format.