Logic programming with multiple context management schemes

  • Joshua S. Hodas
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 798)


Two years experience with programming in Linear Logic has shown that while some problems require the full power of linear context management, for many this much control is too much. In such cases a restriction on either weakening or contraction, but not both, is most appropriate. In this article we introduce a refinement of the system proposed by Hodas and Miller in which each of these constraints is independently available. This enables programs to be more succinct, understandable, and efficient.


  1. 1.
    A. W. Bollen. Relevant logic programming. Journal of Automated Reasoning, 7(4):563–586, December 1991.Google Scholar
  2. 2.
    D. M. Gabbay and U. Reyle. N-Prolog: An extension of Prolog with hypothetical implications. I. Journal of Logic Programming, 1:319–355, 1984.Google Scholar
  3. 3.
    Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1–102, 1987.Google Scholar
  4. 4.
    Jean-Yves Girard. On the unity of logic. Technical Report 26, Université Paris VII, June 1991.Google Scholar
  5. 5.
    Joshua S. Hodas. Lolli: An extension of λProlog with linear logic context management. In Dale Miller, editor, Proceedings of the 1992 λProlog Workshop, 1992.Google Scholar
  6. 6.
    Joshua S. Hodas. Specifying filler-gap dependency parsers in a linear-logic programming language. In Krzysztof R. Apt, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, Washington D.C., pages 622–636, 1992.Google Scholar
  7. 7.
    Joshua S. Hodas. Logic Programming in Intuitionistic Linear Logic: Theory, Design, and Implementation. PhD thesis, University of Pennsylvania, Department of Computer and Information Science, August 1993.Google Scholar
  8. 8.
    Joshua S. Hodas and Dale Miller. Logic programming in a fragment of intuitionistic linear logic: Extended abstract. In G. Kahn, editor, Sixth Annual Symposium on Logic in Computer Science, pages 32–42, Amsterdam, July 1991.Google Scholar
  9. 9.
    Joshua S. Hodas and Dale Miller. Logic programming in a fragment of intuitionistic linear logic. Journal of Information and Computation, 1994. To appear.Google Scholar
  10. 10.
    Dale Miller. A logical analysis of modules in logic programming. Journal of Logic Programming, 6:79–108, 1989.Google Scholar
  11. 11.
    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.Google Scholar
  12. 12.
    Gopalan Nadathur and Dale Miller. An Overview of λProlog. In Fifth International Logic Programming Conference, pages 810–827, Seattle, Washington, August 1988. MIT Press.Google Scholar

Copyright information

© Springer-Verlag 1994

Authors and Affiliations

  • Joshua S. Hodas
    • 1
  1. 1.Computer Science DepartmentHarvey Mudd CollegeClaremont

Personalised recommendations