Skip to main content

Linear logic as logic programming: An abstract

  • Invited papers
  • Conference paper
  • First Online:
Book cover Logical Aspects of Computational Linguistics (LACL 1996)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1328))

  • 118 Accesses

Parts of this abstract are taken from the paper [16].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jean-Marc Andreoli. Logic programming with focusing proofs in linear logic. Journal of Logic and Computation, 2(3):297–347, 1992.

    MATH  MathSciNet  Google Scholar 

  2. J.M. Andreoli and R. Pareschi. Linear objects: Logical processes with built-in inheritance. New Generation Computing, 9(3–4):445–473, 1991.

    Article  Google Scholar 

  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 Conference and Symposium on Logic Programming MIT Press, September 1996.

    Google Scholar 

  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.

    Google Scholar 

  5. Jawahar Chirimar. Proof Theoretic Approach to Specification Languages. PhD thesis, University of Pennsylvania, February 1995. Available on the web from http//www.cis.upenn.edu/~dale/forum/.

    Google Scholar 

  6. Giorgio Delzanno and Maurizio Martelli. Objects in forum. In Proceedings of the International Logic Programming Symposium, 1995.

    Google Scholar 

  7. Amy Felty. Implementing tactics and tacticals in a higher-order logic programming language. Journal of Automated Reasoning, 11(1):43–81, August 1993.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  9. Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1–102, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  10. Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Journal of the ACM, 40(1):143–184, 1993.

    Article  MathSciNet  MATH  Google Scholar 

  11. J. Hennesy and D. Patterson. Computer Architecture A Quantitative Approach. Morgan Kaufman Publishers, Inc., 1990.

    Google Scholar 

  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.

    Google Scholar 

  13. Joshua Hodas and Dale Miller. Logic programming in a fragment of intuitionistic linear logic. Information and Computation, 110(2):327–365, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  14. Dale Miller. The π-calculus as a theory in linear logic: Preliminary results. In E. Lamma and P. Mello, editors, Proceedings of the 1992 Workshop on Extensions to Logic Programming, number 660 in LNCS, pages 242–265. Springer-Verlag, 1993.

    Google Scholar 

  15. Dale Miller. A multiple-conclusion meta-logic. In S. Abramsky, editor, Ninth Annual Symposium on Logic in Computer Science, pages 272–281, Paris, July 1994.

    Google Scholar 

  16. Dale Miller. Forum: A multiple-conclusion specification language. Theoretical Computer Science, 165:201–232, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  MathSciNet  MATH  Google Scholar 

  18. Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes, Part I. Information and Computation, pages 1–20, September 1992.

    Google Scholar 

  19. Fernando C. N. Pereira. Prolog and natural-language analysis: into the third decade. In Proceedings of the 1990 North American Conference on Logic Programming. MIT Press, 1990.

    Google Scholar 

  20. Frank Pfenning. Logic programming in the LF logical framework. In Gérard Huet and Gordon D. Plotkin, editors, Logical Frameworks. Cambridge University Press, 1991.

    Google Scholar 

  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.

    Google Scholar 

  22. Frank Pfenning and Ekkehard Rohwedder. Implementing the meta-theory of deductive systems. In Proceedings of the 1992 Conference on Automated Deduction, June 1992.

    Google Scholar 

  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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Christian Retoré

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Miller, D. (1997). Linear logic as logic programming: An abstract. In: Retoré, C. (eds) Logical Aspects of Computational Linguistics. LACL 1996. Lecture Notes in Computer Science, vol 1328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052151

Download citation

  • DOI: https://doi.org/10.1007/BFb0052151

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63700-4

  • Online ISBN: 978-3-540-69631-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics