{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:32:30Z","timestamp":1648981950648},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6010,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,2]]},"DOI":"10.1016\/s0304-3975(96)00196-x","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"209-233","source":"Crossref","is-referenced-by-count":2,"title":["A confluent calculus for concurrent constraint programming"],"prefix":"10.1016","volume":"173","author":[{"given":"Kim","family":"Marriott","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Odersky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00196-X_BIB1","article-title":"The Lambda Calculus: its Syntax and Semantics","volume":"Vol. 103","author":"Barendregt","year":"1984"},{"key":"10.1016\/S0304-3975(96)00196-X_BIB2","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1145\/177492.177656","article-title":"Suspension analyses for concurrent logic programs","volume":"16","author":"Codish","year":"1994","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/S0304-3975(96)00196-X_BIB3","series-title":"Proc. 20th Internat. Coll. on Automata, Languages, and Programming","first-page":"633","article-title":"Efficient analysis of concurrent constraint logic programs","volume":"Vol. 700","author":"Codish","year":"1993"},{"key":"10.1016\/S0304-3975(96)00196-X_BIB4","series-title":"Proc Internat. Conf. on Principles and practice of Constraint Programming, CP'95","first-page":"345","article-title":"Guarded constructive disjunction: angel or demon?","volume":"Vol. 976","author":"Codognet","year":"1995"},{"key":"10.1016\/S0304-3975(96)00196-X_BIB5","series-title":"Proc. North American Conf. on Logic Programming","first-page":"215","article-title":"Abstract interpretation for concurrent logic languages","author":"Codognet","year":"1990"},{"key":"10.1016\/S0304-3975(96)00196-X_BIB6","series-title":"Proc. 8th IEEE Symp. on Logic in Computer Science","first-page":"210","article-title":"Compositional analysis for concurrent constraint programming","author":"Falaschi","year":"1993"},{"key":"10.1016\/S0304-3975(96)00196-X_BIB7","series-title":"Proc. 4th Internat. Conf. on Algebraic Methodology and Software Technology (AMAST'95)","first-page":"531","article-title":"Confluence and concurrent constraint programming","volume":"Vol. 936","author":"Falaschi","year":"1995"},{"key":"10.1016\/S0304-3975(96)00196-X_BIB8","article-title":"Cylindric Algebras","volume":"Vol. 64","author":"Henkin","year":"1971"},{"key":"10.1016\/S0304-3975(96)00196-X_BIB9","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","article-title":"Confluent reductions: Abstract properties and applications to term rewriting systems","volume":"27","author":"Huet","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(96)00196-X_BIB10","series-title":"Mathematical Centre Tracts","article-title":"Combinatory reduction systems","volume":"Vol. 127","author":"lop","year":"1980"},{"key":"10.1016\/S0304-3975(96)00196-X_BIB11","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/S0304-3975(96)00196-X_BIB12","series-title":"Proc. 4th Internat. Conf. on Logic Programming","first-page":"858","article-title":"Logic semantics for a class of committed-choice programs","author":"Maher","year":"1987"},{"key":"10.1016\/S0304-3975(96)00196-X_BIB13","first-page":"356","article-title":"A simple semantics for logic programming languages with delay","volume":"17","author":"Marriott","year":"1995"},{"key":"10.1016\/S0304-3975(96)00196-X_BIB14","series-title":"Proc. 2nd Internat. Workshop on Principles and Practice of Constraint Programming (PPCP'94)","first-page":"151","article-title":"CC programs with both in- and non-determinism: A concurrent semantics","volume":"Vol. 874","author":"Montanari","year":"1994"},{"key":"10.1016\/S0304-3975(96)00196-X_BIB15","article-title":"Funktionale Berechnung in einem uniform nebenl\u00e4ufigen Kalk\u00fcl mit logischen Variablen","author":"Niehren","year":"1994"},{"key":"10.1016\/S0304-3975(96)00196-X_BIB16","series-title":"Proc. 1st Internat. Conf. on Constraints in Computational Logics","first-page":"89","article-title":"A confluent relational calculus for higher-order programming with constraints","volume":"Vol. 845","author":"Niehren","year":"1994"},{"key":"10.1016\/S0304-3975(96)00196-X_BIB17","article-title":"Oracles and confluence \u2014 A fixpoint semantics for concurrent constraint programming","author":"Nystr\u00f6m","year":"1995"},{"key":"10.1016\/S0304-3975(96)00196-X_BIB18","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","article-title":"Call-by-name, call-by-value, and the \u03bb-calculus","volume":"1","author":"Plotkin","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00196-X_BIB19","series-title":"Proc. 17th Ann. ACM Symp. on Principles of Programming Languages","first-page":"232","article-title":"Concurrent constraint programming","author":"Saraswat","year":"1990"},{"key":"10.1016\/S0304-3975(96)00196-X_BIB20","series-title":"Conf. Record of the 18th Ann. ACM Symp. on Principles of Programming Languages","first-page":"333","article-title":"The semantic foundations of concurrent constraint programming","author":"Saraswat","year":"1991"},{"key":"10.1016\/S0304-3975(96)00196-X_BIB21","series-title":"Proc. 5th Internat. Symp. on Programming Language Implementation and Logic Programming","article-title":"Abstracting synchronization in concurrent constraint programming","volume":"Vol. 844","author":"Zaffanella","year":"1994"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759600196X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759600196X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T07:25:07Z","timestamp":1556522707000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759600196X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["S030439759600196X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00196-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}