{"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":1761610345795,"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(05)80199-9","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"215-221","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Clean: a Programming Environment Based on Term Graph Rewriting"],"prefix":"10.1016","volume":"2","author":[{"given":"M.J.","family":"Plasmeijer","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80199-9_BIB1","doi-asserted-by":"crossref","unstructured":"Barendregt H.P., Eekelen M.C.J.D. van, Glauert J.R.W., Kennaway J.R., Plasmeijer M.J. and Sleep M.R. (1987). Term graph rewriting, In Proc. Parallel Architectures and Languages Europe (PARLE '87), Eindhoven (Bakker J.W. de, Nijman A.J. and Treleaven P.C., eds.), LNCS, 259, II, pp. 141\u2013158. Berlin: Springer-Verlag.","DOI":"10.1007\/3-540-17945-3_8"},{"key":"10.1016\/S1571-0661(05)80199-9_BIB2","doi-asserted-by":"crossref","unstructured":"Barendsen E. and Smetsers J.E.W. (1993). Conventional and uniqueness typing in graph rewrite systems (extended abstract), in: R.K. Shyamasundar (ed.) Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science, Bombay, India, LNCS 761, Springer-Verlag, pp 41\u201351.","DOI":"10.1007\/3-540-57529-4_42"},{"key":"10.1016\/S1571-0661(05)80199-9_BIB3","doi-asserted-by":"crossref","unstructured":"Brus T., Eekelen M.C.J.D. van, Leer M. van, Plasmeijer M.J. and Barendregt H.P. (1987). Clean - a language for functional graph rewriting. In Proc. Conference on Functional Programming Languages and Computer Architecture (FPCA '87), Portland OR (Kahn G., ed.), LNCS, 274, pp. 364\u2013384. Berlin: Springer-Verlag.","DOI":"10.1007\/3-540-18317-5_20"},{"key":"10.1016\/S1571-0661(05)80199-9_BIB4","doi-asserted-by":"crossref","unstructured":"Eekelen M.C.J.D. van, Plasmeijer M.J. and Smetsers J.E.W. (1991). Parallel graph rewriting on loosely coupled machine architectures. In Proc. Conditional and Typed Rewriting Systems (CTRS '90), Montreal (Kaplan S. and Okada M., eds.), LNCS, 516, pp. 354\u2013369. Berlin: Springer-Verlag.","DOI":"10.1007\/3-540-54317-1_104"},{"key":"10.1016\/S1571-0661(05)80199-9_BIB5","unstructured":"Harper R., MacQueen D. and Milner R. (1986). Standard ML. Internal Report ECS-LFCS-86-2, Edinburgh University."},{"key":"10.1016\/S1571-0661(05)80199-9_BIB6","first-page":"29","article-title":". The principal type scheme of an object in combinatory logic","volume":"146","author":"Hindley","year":"1969","journal-title":"Trans American Mathematical Society"},{"issue":"5","key":"10.1016\/S1571-0661(05)80199-9_BIB7","first-page":"1","article-title":". Report on the programming language Haskell.","volume":"27","author":"Hudak","year":"1992","journal-title":"ACM SigPlan Notices"},{"key":"10.1016\/S1571-0661(05)80199-9_BIB8","doi-asserted-by":"crossref","unstructured":"N\u00f6cker E.G.J.M.H. (1993). Strictness analysis using abstract reduction. In Proc. Conference on Functional Programming Languages and Computer Architectures (FPCA '93), Copenhagen. ACM Press.","DOI":"10.1145\/165180.165219"},{"issue":"3","key":"10.1016\/S1571-0661(05)80199-9_BIB9","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","article-title":"Theory of type polymorphism in programming.","volume":"17","author":"Milner","year":"1978","journal-title":"J of Computer and System Sciences"},{"key":"10.1016\/S1571-0661(05)80199-9_BIB10","first-page":"202","article-title":"Concurrent Clean.","volume":"506","author":"N\u00f6cker","year":"1991"},{"year":"1993","series-title":"Functional Programming and Parallel Graph Rewriting","author":"Plasmeijer","key":"10.1016\/S1571-0661(05)80199-9_BIB11"},{"year":"1993","series-title":"Term Graph Rewriting","author":"Sleep","key":"10.1016\/S1571-0661(05)80199-9_BIB12"},{"key":"10.1016\/S1571-0661(05)80199-9_BIB13","first-page":"592","article-title":"Generating efficient code for lazy functional languages","volume":"523","author":"Smetsers","year":"1991"},{"key":"10.1016\/S1571-0661(05)80199-9_BIB14","series-title":"Term Graph Rewriting","article-title":"The functional strategy and transitive term rewriting systems","author":"Toyama","year":"1993"},{"key":"10.1016\/S1571-0661(05)80199-9_BIB15","first-page":"1","article-title":"Miranda: a non-strict functional language with polymorphic types","volume":"201","author":"Turner","year":"1985"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105801999?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105801999?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:46Z","timestamp":1761610066000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105801999"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"references-count":15,"alternative-id":["S1571066105801999"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80199-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":"Clean: a Programming Environment Based on Term Graph Rewriting","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)80199-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1995 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}