Linear logic as logic programming: An abstract

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1328, Issue , 1997, Pages 63-67

  Miller, Dale ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84949768845     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0052151     Document Type: Conference Paper

References (23)

1. Jean-Marc Andreoli. Logic programming with focusing proofs in linear logic. Journal of Logic and Computation, 2(3):297-347, 1992.
2. J.M. Andreoli and R. Pareschi. Linear objects: Logical processes with built-in inheritance. New Generation Computing, 9(3-4):445-473, 1991.
3. Michele Bugliesi, Giorgio Delzanno, Luigi Liquori, and Maurizio Martelli. A linear logic calculus of objects. In M. Maher, editor, Proceedings of the Joint International Con/erence and Symposium on Logic Programming. MIT Press, September 1996.
4. Iliano Cervesato and Frank Pfenning. A linear logic framework. In Proceedings, Eleventh Annual IEEE Symposium on Logic in Computer Science, pages 264-275, New Brunswick, New Jersey, July 1996. IEEE Computer Society Press.
5. Jawahar Chirimar. Proof Theoretic Approach to Specification Languages. PhD thesis, University of Pennsylvania, February 1995. Available on the web from http//www _c9 is. upenn, edu/" dale/forum/.
6. Giorgio Delzarmo and Maurizio Martelli. Objects in forum. In Proceedings of the International Logic Programming Symposium, 1995.
7. Amy Felty. Implementing tactics and tacticals in a higher-order logic programming language. Journal of Automated Reasoning, 11(1):43-81, August 1993.
8. Gerhard Gentzen. Investigations into logical deductions. In M. E. Szabo, editor, The Collected Papers of Gerhard Gentzen, pages 68-131. North-Holland Publishing Co., Amsterdam, 1969.
9. Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1-102, 1987.
10. Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Journal of the ACM, 40(1):143-184, 1993.
11. J. Hennesy and D. Patterson. Computer Architecture A Quantitative Approach. Morgan Kaufman Publishers, Inc., 1990.
12. Joshua 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, 1992.
13. Joshua Hodas and Dale Miller. Logic programming in a fragment of intuitionistic linear logic. Information and Computation, 110(2):327-365, 1994.
14. Dale Miller. The π-calculus as a theory in linear logic: Preliminary results. In E. Lamina and P. Mello, editors, Proceedings of the 1992 Workshop on Extensions to Logic Programming, number 660 in LNCS, pages 242-265. Springer-Verlag, 1993.
15. Dale Miller. A multiple-conclusion recta-logic. In S. Abramsky, editor, Ninth Annual Symposium on Logic in Computer Science, pages 272-281, Paris, July 1994.
16. Dale Miller. Forum: A multiple-conclusion specification language. Theoretical Computer Science, 165:201-232, 1996.
17. Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125-157, 1991.
18. Robin MiMer, Joachim Parrow, and David Walker. A calculus of mobile processes, Part I. Information and Computation, pages 1-40, September 1992.
19. Fernando C. N. Pereira. Prolog and natural-language analysis: into the third decade. In Proceedings of the I990 North American Conference on Logic Programming. MIT Press, 1990.
20. Frank Pfenning. Logic programming in the LF logical framework. In G6rard Huet and Gordon D. Plotkin, editors, Logical Frameworks. Cambridge University Press, 1991.
21. Frank Pfenning. Structural cut elimination. In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science, pages 156-166, San Diego, California, 26-29 1995. IEEE Computer Society Press.
22. Frank Pfenning and Ekkehard Rohwedder. Implementing the meta-theory of deductive systems. In Proceedings of the 1992 Conference on Automated Deduction, June 1992.
23. John H. Reppy. CML: A higher-order concurrent language. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 293-305, June 1991.