{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:21Z","timestamp":1761611121710,"version":"build-2065373602"},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"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":6784,"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":[[1995]]},"DOI":"10.1016\/s1571-0661(04)00003-9","type":"journal-article","created":{"date-parts":[[2004,1,29]],"date-time":"2004-01-29T05:14:39Z","timestamp":1075353279000},"page":"32-45","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Termination, deadlock and divergence in the \u03bb-calculus with multiplicities"],"prefix":"10.1016","volume":"1","author":[{"given":"Gerard","family":"Boudol","sequence":"first","affiliation":[]},{"given":"Cosimo","family":"Laneve","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00003-9_NEWBIB1","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1017\/S0956796800000186","article-title":"Explicit substitutions","volume":"1","author":"Abadi","year":"1991","journal-title":"Journal of Functional Programming"},{"key":"10.1016\/S1571-0661(04)00003-9_NEWBIB2","series-title":"Research Topics in Functional Programming","first-page":"65","article-title":"The Lazy Lambda Calculus","author":"Abramsky","year":"1989"},{"issue":"2","key":"10.1016\/S1571-0661(04)00003-9_NEWBIB3","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1006\/inco.1993.1044","article-title":"Full abstraction in the lazy lambda calculus","volume":"105","author":"Abramsky","year":"1993","journal-title":"Information and Computation"},{"issue":"1","key":"10.1016\/S1571-0661(04)00003-9_NEWBIB4","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1145\/147508.147527","article-title":"Termination, deadlock and divergence","volume":"39","author":"Aceto","year":"1992","journal-title":"Journal of the ACM"},{"year":"1985","series-title":"The Lambda Calculus","author":"Barendregt","key":"10.1016\/S1571-0661(04)00003-9_NEWBIB5"},{"key":"10.1016\/S1571-0661(04)00003-9_NEWBIB6","doi-asserted-by":"crossref","unstructured":"G. Boudol. The lambda calculus with multiplicities. Technical Report 2025, INRIA Sophia-Antipolis, September 1993. Available as ftp\/pub\/papers\/boudol\/lambadm-prelim.ps.Z by anonymous ftp at cma.cma.fr.","DOI":"10.1007\/3-540-57208-2_1"},{"key":"10.1016\/S1571-0661(04)00003-9_NEWBIB7","unstructured":"G. Boudol and C. Laneve. The discriminating power of multiplicities in the \u03bb-calculus. Draft. Available as~ftp\/pub\/papers\/boudol\/dpm-draft.ps.Z by anonymous ftp at cma.cma.fr, 1994."},{"key":"10.1016\/S1571-0661(04)00003-9_NEWBIB8","doi-asserted-by":"crossref","unstructured":"G. Boudol and C. Laneve. Termination, deadlock and divergence in the \u03bb-calculus with multiplicities. Draft. Available by anonymous ftp at cma.cma.fras~ftp\/pub\/papers\/boudol\/tddlm-draft.ps.Z. August, 1994.","DOI":"10.1016\/S1571-0661(04)00003-9"},{"issue":"1","key":"10.1016\/S1571-0661(04)00003-9_NEWBIB9","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(76)90009-8","article-title":"An algebraic interpretation of the \u03bb\u03b2K-calculus; and an application of a labelled \u03bb-calculus","volume":"2","author":"L\u00e9vy","year":"1976","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)00003-9_NEWBIB10","unstructured":"J. J. L\u00e9vy. R\u00e9ductions Correctes et Optimales dans le Lambda Calcul. PhD thesis, Universit\u00e9 Paris VII, 1978."},{"key":"10.1016\/S1571-0661(04)00003-9_NEWBIB11","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0168-0072(83)90030-1","article-title":"Set theoretical models of lambda calculus: Theories, expansions and isomorphisms","volume":"24","author":"Longo","year":"1983","journal-title":"Annals of Pure and Applied Logic"},{"key":"10.1016\/S1571-0661(04)00003-9_NEWBIB12","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1017\/S0960129500001407","article-title":"Functions as processes","volume":"2","author":"Milner","year":"1992","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/S1571-0661(04)00003-9_NEWBIB13","unstructured":"L. Ong. The Lazy Lambda Calculus: an Investigation into the Foundations of Functional Programming. PhD thesis, Imperial College of Science and Technology, University of London, 1988."},{"issue":"1","key":"10.1016\/S1571-0661(04)00003-9_NEWBIB14","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1006\/inco.1994.1042","article-title":"The lazy lambda calculus in a concurrency scenario","volume":"120","author":"Sangiorgi","year":"1994","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)00003-9_NEWBIB15","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1137\/0205036","article-title":"The relation between computational and denotational properties for Scott D\u221e-model of the lambda-calculus","volume":"5","author":"Wadsworth","year":"1976","journal-title":"SIAM Journal on Computing"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104000039?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104000039?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:03:36Z","timestamp":1761609816000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104000039"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"references-count":15,"alternative-id":["S1571066104000039"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00003-9","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Termination, deadlock and divergence in the \u03bb-calculus with multiplicities","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(04)00003-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}