{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:25Z","timestamp":1761610345139,"version":"build-2065373602"},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":5323,"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":[[1999]]},"DOI":"10.1016\/s1571-0661(05)80292-0","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"18-24","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Towards Verified Lazy Implementation of Concurrent Value-Passing Languages (Abstract)"],"prefix":"10.1016","volume":"27","author":[{"given":"Anna","family":"Ing\u00f3lfsd\u00f3ttir","sequence":"first","affiliation":[]},{"given":"Rosario","family":"Pugliese","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S1571-0661(05)80292-0_BIBACC91","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1017\/S0956796800000186","article-title":"Explicit substitution","volume":"1","author":"Abadi","year":"1991","journal-title":"Journal of Functional Programming"},{"issue":"2\/3","key":"10.1016\/S1571-0661(05)80292-0_BIBCAS87","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/0022-0000(87)90025-0","article-title":"Bisimulations and abstraction homomorphisms","volume":"34","author":"Castellani","year":"1987","journal-title":"Journal of Computer and System Sciences"},{"issue":"30","key":"10.1016\/S1571-0661(05)80292-0_BIBCOH81","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/356850.356854","article-title":"Garbage collection of linked data structures","volume":"13","author":"Cohen","year":"1981","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/S1571-0661(05)80292-0_BIBFKW99","article-title":"Within ARMS's reach: Compilation of left\u2013linear rewrite systems via minimal rewrite systems","author":"Fokkink","year":"1999","journal-title":"To appear in ACM Transaction on Programming Languages and Systems"},{"key":"10.1016\/S1571-0661(05)80292-0_BIBGHT84","series-title":"Prentice Hall, London","article-title":"Principles of Functional Programming","author":"Glaser","year":"1984"},{"key":"10.1016\/S1571-0661(05)80292-0_BIBING96","unstructured":"A. Ing\u00f3lfsd\u00f3ttir. A Semantic theory for value\u2013passing processes, late approach. To appear in Information and Computation."},{"key":"10.1016\/S1571-0661(05)80292-0_BIBIP98","unstructured":"A. Ing\u00f3lfsd\u00f3ttir and R. Pugliese. Towards verified lazy implementation of concurrent value-passing languages (Available at http:\/\/www.cs.auc.dk\/~annai\/)."},{"key":"10.1016\/S1571-0661(05)80292-0_BIBJEF94","article-title":"A fully abstract semantics for concurrent graph reduction","author":"Jeffrey","year":"1994","journal-title":"Proc. of LICS"},{"key":"10.1016\/S1571-0661(05)80292-0_BIBLAN66","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1145\/365230.365257","article-title":"The next 700 programming languages","volume":"Vol. 9","author":"Landin","year":"1966","journal-title":"Communications of the ACM"},{"key":"10.1016\/S1571-0661(05)80292-0_BIBLAU93","series-title":"20th Symposium of Principles of Programming Languages","first-page":"144","article-title":"A natural semantics for lazy evaluation","author":"Launchbury","year":"1993"},{"key":"10.1016\/S1571-0661(05)80292-0_BIBKW96","unstructured":"J. F. Th. Kamperman and H. R. Walter. Simulating TRSs by minimal TRSs: a simple, efficient, and correct compilation technique. Tech. Rep. CS-R9605, CWI, Amsterdam. Available at http:\/\/www.cwi.nl\/epic"},{"key":"10.1016\/S1571-0661(05)80292-0_BIBMCC63","unstructured":"J. McCarthy. Towards a mathematical science of computation. Proceedings Information Processing '62. North-Holland, Amsterdam, 21-28, 1962."},{"key":"10.1016\/S1571-0661(05)80292-0_BIBMIL80","series-title":"volume 92 of Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","article-title":"A Calculus of Communicating Systems","author":"Milner","year":"1980"},{"key":"10.1016\/S1571-0661(05)80292-0_BIBMOR73","doi-asserted-by":"crossref","unstructured":"F. L. Morris. Advice on structuring compilers and proving them correct. 1st Symposium of Principles of Programming Languages. ACM, New York, 144-152.","DOI":"10.1145\/512927.512941"},{"key":"10.1016\/S1571-0661(05)80292-0_BIBPRA75","series-title":"Prentice-Hall International","article-title":"Programming languages, design and implementation","author":"Pratt","year":"1975"},{"issue":"2","key":"10.1016\/S1571-0661(05)80292-0_BIBWF89","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1093\/comjnl\/32.2.142","article-title":"Non-strict languages\u2013programming and implementation","volume":"32","author":"Wray","year":"1989","journal-title":"The Computer Journal"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802920?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802920?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:07:45Z","timestamp":1761610065000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105802920"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"references-count":16,"alternative-id":["S1571066105802920"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80292-0","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Towards Verified Lazy Implementation of Concurrent Value-Passing Languages (Abstract)","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)80292-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}