{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:55Z","timestamp":1761611155225,"version":"build-2065373602"},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":5688,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1998]]},"DOI":"10.1016\/s1571-0661(05)01183-7","type":"journal-article","created":{"date-parts":[[2005,4,13]],"date-time":"2005-04-13T14:20:46Z","timestamp":1113402046000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Logic Programming with Bunched Implications"],"prefix":"10.1016","volume":"17","author":[{"given":"David J.","family":"Pym","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"volume":"volume I","year":"1975","author":"Anderson","key":"10.1016\/S1571-0661(05)01183-7_bib1"},{"key":"10.1016\/S1571-0661(05)01183-7_bib2","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF00284976","article-title":"Display logic","volume":"11","author":"Belnap","year":"1982","journal-title":"Journal of Philosophical Logic"},{"key":"10.1016\/S1571-0661(05)01183-7_bib3","series-title":"Proceedings of Second International Conference on Typed \u03bb-calculi and Applications, volume 902 of Lecture Notes in Computer Science","first-page":"78","article-title":"What is a categorical model of intuitionistic linear logic?","author":"Bierman","year":"1995"},{"key":"10.1016\/S1571-0661(05)01183-7_bib4","series-title":"Reports of the Midwest Category Seminar, volume 137 of Lecture Notes in Mathematics","first-page":"1","article-title":"On closed categories of functors","author":"Day","year":"1970"},{"key":"10.1016\/S1571-0661(05)01183-7_bib5","unstructured":"J.M. Dunn. Conseqution formulation of positive R with co-tenability and t. In [1], pp381\u2013391."},{"key":"10.1016\/S1571-0661(05)01183-7_bib6","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":"10.1016\/S1571-0661(05)01183-7_bib7","doi-asserted-by":"crossref","unstructured":"J.A. Harland, D.J. Pym, and M. Winikoff. Programming in lygon: an overview. In M. Wirsing and M. Nivat, editors, Proc. AMAST '96, pages 391\u2013405. LNCS 1101, 1996.","DOI":"10.1007\/BFb0014329"},{"issue":"2","key":"10.1016\/S1571-0661(05)01183-7_bib8","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1006\/inco.1994.1036","article-title":"Logic programming in a fragment of intuitionistic linear logic","volume":"110","author":"Hodas","year":"1994","journal-title":"Information and Computation"},{"year":"1990","series-title":"Essentials of Logic Programming","author":"Hogger","key":"10.1016\/S1571-0661(05)01183-7_bib9"},{"key":"10.1016\/S1571-0661(05)01183-7_bib10","doi-asserted-by":"crossref","unstructured":"S.S. Ishtiaq and D.J. Pym. A relevant analysis of natural deduction. To appear (1998) in Journal of Logic and Computation.","DOI":"10.1093\/logcom\/8.6.809"},{"year":"1968","series-title":"Mathematical Logic","author":"Kleene","key":"10.1016\/S1571-0661(05)01183-7_bib11"},{"year":"1986","series-title":"Introduction to Higher-Order Categorical Logic","author":"Lambek","key":"10.1016\/S1571-0661(05)01183-7_bib12"},{"key":"10.1016\/S1571-0661(05)01183-7_bib13","unstructured":"P. Martin-L\u00f6f. On the meanings of the logical constants and the justifications of the logical laws. Technical Report 2, Scuola di Specializziazione in Logica Matem\u00e1tica, Universit\u00e0 di Siena, 1982."},{"issue":"1 & 2","key":"10.1016\/S1571-0661(05)01183-7_bib14","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0743-1066(89)90031-9","article-title":"A logical analysis of modules in logic programming","volume":"6","author":"Miller","year":"1989","journal-title":"J. Logic. Programming"},{"key":"10.1016\/S1571-0661(05)01183-7_bib15","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","article-title":"Uniform proofs as a foundation for logic programming","volume":"51","author":"Miller","year":"1991","journal-title":"Annals of Pure and Applied Logic"},{"author":"O'Hearn","key":"10.1016\/S1571-0661(05)01183-7_bib16"},{"author":"O'Hearn","key":"10.1016\/S1571-0661(05)01183-7_bib17"},{"key":"10.1016\/S1571-0661(05)01183-7_bib18","doi-asserted-by":"crossref","unstructured":"D.J. Pym. Logic programming with bunched implications. 1998. In Preparation.","DOI":"10.1016\/S1571-0661(05)01183-7"},{"author":"Pym","key":"10.1016\/S1571-0661(05)01183-7_bib19"},{"key":"10.1016\/S1571-0661(05)01183-7_bib20","unstructured":"D.J. Pym. The semantics and proof theory of the logic of bunched implications, II: Predicate BI. 1998. In Preparation."},{"key":"10.1016\/S1571-0661(05)01183-7_bib21","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1093\/logcom\/4.2.175","article-title":"A uniform proof-theoretic investigation of linear logic programming","volume":"4","author":"Pym","year":"1994","journal-title":"J. Logic. Computat"},{"year":"1987","series-title":"Relevant Logic: A Philosophical Examination of Inference","author":"Read","key":"10.1016\/S1571-0661(05)01183-7_bib22"},{"year":"1977","series-title":"A structure for Plans and Behaviour","author":"Sacerdoti","key":"10.1016\/S1571-0661(05)01183-7_bib23"},{"key":"10.1016\/S1571-0661(05)01183-7_bib24","unstructured":"A. Urquhart. Semantics for relevant logics. Journal of Symbolic Logic, pages 1059\u20131073, 1972."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105011837?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105011837?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:06:23Z","timestamp":1761609983000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105011837"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"references-count":24,"alternative-id":["S1571066105011837"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)01183-7","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Logic Programming with Bunched Implications","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)01183-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Elsevier Science B.V. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}