{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T14:07:34Z","timestamp":1751983654483},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422549"},{"type":"electronic","value":"9783540457442"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45744-5_21","type":"book-chapter","created":{"date-parts":[[2007,10,26]],"date-time":"2007-10-26T17:02:07Z","timestamp":1193418127000},"page":"289-304","source":"Crossref","is-referenced-by-count":9,"title":["Bunched Logic Programming"],"prefix":"10.1007","author":[{"given":"Pablo A.","family":"Armel\u00edn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David J.","family":"Pym","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,8]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"W. Clocksin. Clause and effect. Springer-Verlag, 1997.","DOI":"10.1007\/978-3-642-58274-5"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"W. Clocksin and C. Mellish. Programming in Prolog. Springer-Verlag, 1994.","DOI":"10.1007\/978-3-642-97596-7"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"G. Cousineau and M. Mauny. The Functional Approach to Programming. Cambridge University Press, 1998.","DOI":"10.1017\/CBO9781139173018"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"J.-Y. Girard. Linear logic. Theoretical Computer Science, pages 1\u2013102, 1987.","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"21_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/BFb0014329","volume-title":"Programming in Lygon: an overview","author":"J.A. Harland","year":"1996","unstructured":"J.A. Harland, D.J. Pym, and M. Winikoff. Programming in Lygon: an overview. In M. Wirsing and M. Nivat, editors, LNCS 1101: 391\u2013405, 1996."},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(99)00173-5","volume":"232","author":"I. Cervesato","year":"2000","unstructured":"I. Cervesato J. Hodas and F. Pfenning. Efficient resource management for linear logic proof search. Theoretical Computer Science, 232:133\u2013163, 2000.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"21_CR7","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1006\/inco.1994.1036","volume":"110","author":"J.S. Hodas","year":"1994","unstructured":"J.S. Hodas and D. Miller. Logic programming in a fragment of intuitionistic linear logic. Information and Computation, 110(2):327\u2013365, 1 May 1994.","journal-title":"Information and Computation"},{"key":"21_CR8","volume-title":"Logic for Problem-solving","author":"R. Kowalski","year":"1979","unstructured":"R. Kowalski. Logic for Problem-solving. North-Holland, Elsevier, 1979."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"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\u2013130. North-Holland, Amsterdam, 1965.","DOI":"10.1016\/S0049-237X(08)71685-9"},{"issue":"1&2","key":"21_CR10","first-page":"431","volume":"6","author":"D. Miller","year":"1981","unstructured":"D. Miller. A logical analysis of modules in logic programming. J. Logic. Programming, 6(1&2):431\u2013483, 1981.","journal-title":"J. Logic. Programming"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","volume":"51","author":"D. Miller","year":"1991","unstructured":"D. Miller, G. Nadathur, F. Pfenning, and A. \u0160\u010dedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125\u2013157, 1991.","journal-title":"Annals of Pure and Applied Logic"},{"issue":"2","key":"21_CR12","doi-asserted-by":"publisher","first-page":"215","DOI":"10.2307\/421090","volume":"5","author":"P.W. O\u2019Hearn","year":"1999","unstructured":"P.W. O\u2019Hearn and D.J. Pym. The logic of bunched implications. Bull. Symb. Logic, 5(2):215\u2013244, June 1999.","journal-title":"Bull. Symb. Logic"},{"key":"21_CR13","unstructured":"P.W. O\u2019Hearn, 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."},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"D.J. Pym. On bunched predicate logic. In Proc. LICS\u201999, pages 183\u2013192. IEEE Computer Society Press, 1999.","DOI":"10.1109\/LICS.1999.782614"},{"key":"21_CR15","unstructured":"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."},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1093\/logcom\/4.2.175","volume":"4","author":"D.J. Pym","year":"1994","unstructured":"D.J. Pym and J.A. Harland. A uniform proof-theoretic investigation of linear logic programming. J. Logic. Computat., 4:175\u2013207, 1994.","journal-title":"J. Logic. Computat."},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"A. Urquhart. Semantics for relevant logics. J. Symb. Logic, 1059-1073, 1972.","DOI":"10.2307\/2272559"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45744-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T21:51:14Z","timestamp":1556920274000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45744-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422549","9783540457442"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45744-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]}}}