Abstract
We give an operational semantics for the logic programming language BLP, based on the hereditary Harrop fragment of the logic of bunched implications, BI. We introduce BI, explaining the account of the sharing of resources built into its semantics, and indicate how it may be used to give a logic programming language. We explain that the basic input/output model of operational semantics, used in linear logic programming, will not work for bunched logic. We show how to obtain a complete, goal-directed proof theory for hereditary Harrop BI and how to reformulate the operational model to account for the interaction between multiplicative and additive structure. We give a prototypical example of how the resulting programming language handles, in contrast with Prolog, sharing and non-sharing use of resources purely logically.
Acknowledgements
Armelín is supported by an EPSRC Research Studentship. Pym acknowledges the support of the EPSRC via an Advanced Fellowship.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
W. Clocksin. Clause and effect. Springer-Verlag, 1997.
W. Clocksin and C. Mellish. Programming in Prolog. Springer-Verlag, 1994.
G. Cousineau and M. Mauny. The Functional Approach to Programming. Cambridge University Press, 1998.
J.-Y. Girard. Linear logic. Theoretical Computer Science, pages 1–102, 1987.
J.A. Harland, D.J. Pym, and M. Winikoff. Programming in Lygon: an overview. In M. Wirsing and M. Nivat, editors, LNCS 1101: 391–405, 1996.
I. Cervesato J. Hodas and F. Pfenning. Efficient resource management for linear logic proof search. Theoretical Computer Science, 232:133–163, 2000.
J.S. Hodas and D. Miller. Logic programming in a fragment of intuitionistic linear logic. Information and Computation, 110(2):327–365, 1 May 1994.
R. Kowalski. Logic for Problem-solving. North-Holland, Elsevier, 1979.
S. A. Kripke. Semantical analysis of intuitionistic logic I. In J. N. Crossley and M. A. E. Dummett, editors, Formal Systems and Recursive Functions, pages 92–130. North-Holland, Amsterdam, 1965.
D. Miller. A logical analysis of modules in logic programming. J. Logic. Programming, 6(1&2):431–483, 1981.
D. Miller, G. Nadathur, F. Pfenning, and A. Ščedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125–157, 1991.
P.W. O’Hearn and D.J. Pym. The logic of bunched implications. Bull. Symb. Logic, 5(2):215–244, June 1999.
P.W. O’Hearn, D.J. Pym, and H. Yang. Possible worlds and resources: The semantics of BI. Submitted. Manuscript at http://www.dcs.qmw.ac.uk/~pym, 2000.
D.J. Pym. On bunched predicate logic. In Proc. LICS’99, pages 183–192. IEEE Computer Society Press, 1999.
D.J. Pym. The Semantics and Proof Theory of the Logic of the Logic of Bunched Implications. Draft of research monograph, manuscript at http://www.dcs.qmw.ac.uk/~pym, 2000.
D.J. Pym and J.A. Harland. A uniform proof-theoretic investigation of linear logic programming. J. Logic. Computat., 4:175–207, 1994.
A. Urquhart. Semantics for relevant logics. J. Symb. Logic, 1059-1073, 1972.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Armelín, P.A., Pym, D.J. (2001). Bunched Logic Programming. In: Goré, R., Leitsch, A., Nipkow, T. (eds) Automated Reasoning. IJCAR 2001. Lecture Notes in Computer Science, vol 2083. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45744-5_21
Download citation
DOI: https://doi.org/10.1007/3-540-45744-5_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42254-9
Online ISBN: 978-3-540-45744-2
eBook Packages: Springer Book Archive