[1] V., MicheleAbrusci and Paul, Ruet, Non-commutative logic I: Themultiplicative fragment, Annals of Pure and Applied Logic, vol. 101 (1999), no. 1, pp. 29-64.Google Scholar

[2] Jean-Marc, Andreoli, Logic programming with focusing proofs in linear logic, Journal of Logic and Computation, vol. 2 (1992), no. 3, pp. 297-347.Google Scholar

[3] Michele, Bugliesi,GiorgioDelzannoLuigi, Liquori, and Maurizio, Martelli, Alinear logic calculus of objects, Proceedings of the Joint International Conference and Symposium on Logic Programming (M., Maher, editor),MIT Press, September 1996.

[4] Manuel M. T., Chakravarty, On the massively parallel execution of declarative programs, Ph.D. thesis, Technische Universität Berlin, Fachbereich Informatik, February 1997.

[5] Jawahar, Chirimar, Proof theoretic approach to specification languages, Ph.D. thesis, University of Pennsylvania, February 1995.

[6] Alonzo, Church, A formulation of the simple theory of types, The Journal of Symbolic Logic, vol. 5 (1940), pp. 56-68.Google Scholar

[7] Vicent, Danos, Jean-Baptiste, Joinet, and Harold, Schellinx, LKQ and LKT: sequent calculi for second order logic based upon dual linear decompositions of classical implication, Workshop on linear logic (Girard,Lafont, andRegnier, editors),London Mathematical Society Lecture Notes 222, Cambridge University Press, 1995, pp. 211-224.

[8] Giorgio, Delzanno and Maurizio, Martelli, Objects in Forum, Proceedings of the International Logic Programming Symposium, 1995.

[9] Roy, Dyckhoff, Contraction-free sequent calculi for intuitionistic logic, The Joural of Symbolic Logic, vol. 57 (1992), no. 3, pp. 795-807.Google Scholar

[10] Amy, Felty, A logic program for transforming sequent proofs to natural deduction proofs, Extensions of Logic Programming: International Workshop, Tübingen (Peter, Schroeder-Heister, editor), LNAI, vol. 475, Springer-Verlag, 1991, pp. 157-178.

[11] Amy, Felty and Dale, Miller, Specifying theorem provers in a higher-order logic programming language, Ninth International Conference on Automated Deduction (Argonne, IL), Springer-Verlag,May 1988, pp. 61-80.

[12] Gerhard, Gentzen, Investigations into logical deductions, TheCollectedPapers ofGerhard Gentzen (M. E., Szabo, editor), North-Holland Publishing Co., Amsterdam, 1969, pp. 68-131.

[13] Jean-YvesGirard, , Linear logic, Theoretical Computer Science, vol. 50 (1987), pp. 1-102.Google Scholar

[14] Jean-YvesGirard, , On the unity of logic, Annals of Pure and Applied Logic, vol. 59 (1993), pp. 201- 217.Google Scholar

[15] Alessio, Guglielmi and Lutz, Straßburger, Non-commutativity and MELL in the calculus of structures, CSL 2001 (L., Fribourg, editor), LNCS, vol. 2142, 2001, pp. 54-68.Google Scholar

[16] Robert, Harper, Furio, Honsell, and Gordon, Plotkin, A framework for defining logics, Journal of the ACM, vol. 40 (1993), no. 1, pp. 143-184.Google Scholar

[17] Joshua, Hodas and DaleMiller, Logic programming in a fragment of intuitionistic linear logic, Information and Computation, vol. 110 (1994), no. 2, pp. 327-365.Google Scholar

[18] Joshua, Hodas, Kevin, Watkins, Naoyuki, Tamura, and Kyoung-Sun, Kang, Efficient implementation of a linear logic programming language, Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming (Joxan, Jaffar, editor), 1998, pp. 145 - 159.Google Scholar

[19] Patrick, Lincoln, Andre, Scedrov, and Natarajan, Shankar, Linearizing intuitionistic implication, Annals of Pure and Applied Logic, (1993), pp. 151-177.Google Scholar

[20] P. L, opez and E., Pimentel, The UMA Forum linear logic programming language, implementation, January 1998.

[21] Raymond, McDowell and DaleMiller, Cut-elimination for a logic with definitions and induction, Theoretical Computer Science, vol. 232 (2000), pp. 91-119.Google Scholar

[22] Dale, Miller, The -calculus as a theory in linear logic: Preliminary results, Proceedings of the 1992 Workshop on Extensions to Logic Programming (E., Lamma and P., Mello, editors), LNCS, no. 660, Springer-Verlag, 1993, pp. 242-265.

[23] Dale, Miller, Forum: A multiple-conclusion specification language, Theoretical Computer Science, vol. 165 (1996), no. 1, pp. 201-232.Google Scholar

[24] Dale, Miller, Gopalan, Nadathur, Frank, Pfenning, and Andre, Scedrov, Uniform proofs as a foundation for logic programming, Annals of Pure and Applied Logic, vol. 51 (1991), pp. 125-157.Google Scholar

[25] Gopalan, Nadathur and DaleMiller, An Overview of Prolog, Fifth International Logic Programming Conference (Seattle),MIT Press, August 1988, pp. 810-827.

[26] Lawrence C., Paulson, The foundation of a generic theorem prover, Journal of Automated Reasoning, vol. 5 (1989), pp. 363-397.Google Scholar

[27] Frank, Pfenning, Elf: A language for logic definition and verified metaprogramming, Fourth Annual Symposium on Logic in Computer Science (Monterey, CA), June 1989, pp. 313- 321.

[28] Elaine Gouvˆea, Pimentel, Logica linear e a especificaç ao de sistemas computacionais, Ph.D. thesis, Universidade Federal de Minas Gerais, Belo Horizonte, M.G., Brasil, December 2001, (written in English).

[29] Christian, Retoré, Pomset logic: a non-commutative extension of classical linear logic, Proceedings of TLCA, vol. 1210, 1997, pp. 300-318.Google Scholar

[30] Giorgia, Ricci, On the expressive powers of a logic programming presentation of linear logic (FORUM), Ph.D. thesis, Department ofMathematics, Siena University, December 1998.

[31] Christian, Urban, Forum and its implementations, Master's thesis, University of St. Andrews, December 1997.