{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T08:05:40Z","timestamp":1648886740381},"reference-count":20,"publisher":"Elsevier BV","issue":"3","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":[[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":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1998]]},"DOI":"10.1016\/s1571-0661(04)00146-x","type":"journal-article","created":{"date-parts":[[2004,1,29]],"date-time":"2004-01-29T10:14:39Z","timestamp":1075371279000},"page":"265-290","source":"Crossref","is-referenced-by-count":1,"title":["\u03bbS"],"prefix":"10.1016","volume":"16","author":[{"family":"Arvind","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan-Willem","family":"Maessen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rishiyur S.","family":"Nikhil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph E.","family":"Stoy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S1571-0661(04)00146-X_NEWBIB1","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1017\/S0956796800000186","article-title":"Explicit substitutions","volume":"1","author":"Abadi","year":"1991","journal-title":"J. of Functional Programming"},{"key":"10.1016\/S1571-0661(04)00146-X_NEWBIB2","unstructured":"S. Aditya, Arvind, L. Augustsson, J.-W. Maessen, and R. S. Nikhil. Semantics of pH: A Parallel Dialect of Haskell. In Proc. Haskell Wkshp. (FPCA 95), La Jolla CA, USA, June 1995."},{"key":"10.1016\/S1571-0661(04)00146-X_NEWBIB3","doi-asserted-by":"crossref","unstructured":"S. Aditya, Arvind, and J. Stoy. Semantics of barriers in a non-strict, implicitly-parallel language. In Functional Programming and Computer Architecture, 1995.","DOI":"10.1145\/224164.224206"},{"issue":"1\u20132","key":"10.1016\/S1571-0661(04)00146-X_NEWBIB4","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(94)00185-L","article-title":"Properties of a first-order functional language with sharing","volume":"146","author":"Ariola and Arvind","year":"1995","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)00146-X_NEWBIB5","unstructured":"Z. M. Ariola and S. Blom. Cyclic lambda calculi. Technical Report CIS-TR-96\u201313, Dept. of Computer and Information Sciences, Univ. of Oregon, Eugene OR, USA, 1996."},{"key":"10.1016\/S1571-0661(04)00146-X_NEWBIB6","doi-asserted-by":"crossref","unstructured":"Z. M. Ariola, M. Felleisen, J. Maraist, M. Odersky, and P. Wadler. The call-by-need lambda calculus. In Proc. ACM Conf. on Principles of Programming Languages, pages 233\u2013246, 1995.","DOI":"10.1145\/199448.199507"},{"key":"10.1016\/S1571-0661(04)00146-X_NEWBIB7","doi-asserted-by":"crossref","unstructured":"Z. M. Ariola and J. W. Klop. Cyclic lambda graph rewriting. In Proc. Ninth Symp. on Logic in Computer Science (LICS'94), Paris, France, pages 416\u2013425, 1994.","DOI":"10.1109\/LICS.1994.316066"},{"issue":"4","key":"10.1016\/S1571-0661(04)00146-X_NEWBIB8","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1145\/69558.69562","article-title":"I-Structures: Data Structures for Parallel Computing","volume":"11","author":"Arvind","year":"1989","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"10.1016\/S1571-0661(04)00146-X_NEWBIB9","series-title":"The Lambda Calculus, Its Syntax and Semantics","author":"Barendregt","year":"1981"},{"key":"10.1016\/S1571-0661(04)00146-X_NEWBIB10","doi-asserted-by":"crossref","unstructured":"P. Barth, R. S. Nikhil, and Arvind. M-Structures: Extending a Parallel, Non-strict, Functional Language with State. In Springer Verlag LNCS 523 (Proc. Functional Programming and Computer Architecture, Cambridge MA, USA), pages 538\u2013568, 1991","DOI":"10.1007\/3540543961_26"},{"key":"10.1016\/S1571-0661(04)00146-X_NEWBIB11","unstructured":"W. Clinger, and J. Rees (eds.). Revised4 Report on the Algorithmic Language Scheme. Technical report, MIT AI Laboratory, November 2 1991."},{"key":"10.1016\/S1571-0661(04)00146-X_NEWBIB12","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0304-3975(89)90069-8","article-title":"A syntactic theory of sequential state","volume":"69","author":"Felleisen","year":"1989","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)00146-X_NEWBIB13","doi-asserted-by":"crossref","unstructured":"P. Hudak et. al. Report on the Programming Language Haskell, A Non-strict, Purely Functional Language, Version 1.2. ACM SIGPLAN Notices, 27 (5), May 1992.","DOI":"10.1145\/130697.130699"},{"key":"10.1016\/S1571-0661(04)00146-X_NEWBIB14","doi-asserted-by":"crossref","unstructured":"J. Launchbury. A Natural Semantics for Lazy Evaluation. In Proc. ACM Conf. on Principles of Programming Languages, pages 144\u2013154, 1993.","DOI":"10.1145\/158511.158618"},{"key":"10.1016\/S1571-0661(04)00146-X_NEWBIB15","doi-asserted-by":"crossref","unstructured":"J. Launchbury and S. L. Peyton Jones. Lazy Functional State Threads. In Proc. ACM SIGPLAN '94 Conf. on Programming Language Design and Implementation, Orlando FL, USA, pages 24\u201335, June 22\u201324 1994.","DOI":"10.1145\/178243.178246"},{"issue":"3","key":"10.1016\/S1571-0661(04)00146-X_NEWBIB16","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1017\/S0956796800000125","article-title":"Equivalence in Functional Languages with Effects","volume":"1","author":"Mason","year":"1991","journal-title":"J. of Functional Programming"},{"key":"10.1016\/S1571-0661(04)00146-X_NEWBIB17","series-title":"The Definition of Standard ML","author":"Milner","year":"1990"},{"key":"10.1016\/S1571-0661(04)00146-X_NEWBIB18","unstructured":"R. S. Nikhil. Id (Version 90.1) Language Reference Manual. Technical Report CSG Memo 284\u20132, MIT Lab for Computer Science, 545 Technology Square, Cambridge MA 02139, USA, July 15 1991."},{"key":"10.1016\/S1571-0661(04)00146-X_NEWBIB19","series-title":"A Classical Mind: Essays in Honor of C.A.R. Hoare","first-page":"379","article-title":"The Semantics of Id","author":"Stoy","year":"1994"},{"key":"10.1016\/S1571-0661(04)00146-X_NEWBIB20","unstructured":"C. P. Wadsworth. Semantics and Pragmatics of the Lambda-calculus, 1971. D. Phil. thesis, University of Oxford."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610400146X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610400146X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,29]],"date-time":"2020-03-29T12:30:31Z","timestamp":1585485031000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106610400146X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998]]}},"alternative-id":["S157106610400146X"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00146-x","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[1998]]}}}