Abstract
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.
This material was mostly developed while the author was a student in the Department of Computer Science at the University of Pennsylvania. The work was funded under ONR N00014-88-K-0633, NSF CCR-87-05596, NSF CCR-91-02753, and DARPA N00014-85-K-0018 through the University of Pennsylvania
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A. W. Bollen. Relevant logic programming. Journal of Automated Reasoning, 7(4):563–586, December 1991.
D. M. Gabbay and U. Reyle. N-Prolog: An extension of Prolog with hypothetical implications. I. Journal of Logic Programming, 1:319–355, 1984.
Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1–102, 1987.
Jean-Yves Girard. On the unity of logic. Technical Report 26, Université Paris VII, June 1991.
Joshua S. Hodas. Lolli: An extension of λProlog with linear logic context management. In Dale Miller, editor, Proceedings of the 1992 λProlog Workshop, 1992.
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.
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.
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.
Joshua S. Hodas and Dale Miller. Logic programming in a fragment of intuitionistic linear logic. Journal of Information and Computation, 1994. To appear.
Dale Miller. A logical analysis of modules in logic programming. Journal of Logic Programming, 6:79–108, 1989.
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.
Gopalan Nadathur and Dale Miller. An Overview of λProlog. In Fifth International Logic Programming Conference, pages 810–827, Seattle, Washington, August 1988. MIT Press.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hodas, J.S. (1994). Logic programming with multiple context management schemes. In: Dyckhoff, R. (eds) Extensions of Logic Programming. ELP 1993. Lecture Notes in Computer Science, vol 798. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58025-5_55
Download citation
DOI: https://doi.org/10.1007/3-540-58025-5_55
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58025-6
Online ISBN: 978-3-540-48417-2
eBook Packages: Springer Book Archive