{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:02:01Z","timestamp":1767927721193,"version":"3.49.0"},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"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":8113,"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":[[1991,5]]},"DOI":"10.1016\/0304-3975(91)90230-y","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"389-402","source":"Crossref","is-referenced-by-count":61,"title":["An abstract framework for environment machines"],"prefix":"10.1016","volume":"82","author":[{"given":"P.-L.","family":"Curien","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90230-Y_BIB1","article-title":"Explicit substitutions","volume":"90","author":"Abadi","year":"1990","journal-title":"Proc. Conf. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(91)90230-Y_BIB2","unstructured":"S. Abramsky, The lazy \u03bb-calculus, in: D. Turner, ed., Declarative Programming (Addison-Wesley, Reading, MA, to appear)."},{"key":"10.1016\/0304-3975(91)90230-Y_BIB3","article-title":"Cat\u00e9gories et logiques faibles","volume":"30","author":"B\u00e9nabou","year":"1973"},{"issue":"5","key":"10.1016\/0304-3975(91)90230-Y_BIB4","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","article-title":"Lambda-calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem","volume":"34","author":"de Bruijn","year":"1972","journal-title":"Indag Math."},{"key":"10.1016\/0304-3975(91)90230-Y_BIB5","series-title":"Combinators and Functional Programming Languages","article-title":"The Amber Machine","volume":"242","author":"Cardelli","year":"1986"},{"key":"10.1016\/0304-3975(91)90230-Y_BIB6","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0167-6423(87)90020-7","article-title":"The Categorical Abstract Machine","volume":"8","author":"Cousineau","year":"1987","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0304-3975(91)90230-Y_BIB7","series-title":"Categorical Combinators, Sequential Algorithms and Functional Programming","author":"Curien","year":"1986"},{"key":"10.1016\/0304-3975(91)90230-Y_BIB8","series-title":"France-Japan Artificial Intelligence and Computer Science Symposium","article-title":"A confluent calculus of explicit substitutions","author":"Hardin","year":"1989"},{"key":"10.1016\/0304-3975(91)90230-Y_BIB9","article-title":"A simple, lazy, abstract machine to execute supercombinators","volume":"274","author":"Fairbairn","year":"1987"},{"key":"10.1016\/0304-3975(91)90230-Y_BIB10","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0304-3975(89)90105-9","article-title":"Confluence results for the pure strong C.C.L. lambda-calculi as subsystems of C.C.L.","volume":"65","author":"Hardin","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90230-Y_BIB11","unstructured":"J.-L. Krivine, Unpublished notes."},{"key":"10.1016\/0304-3975(91)90230-Y_BIB12","series-title":"Th\u00e9se de Doctorat","article-title":"Logiques, cat\u00e9gories et machines","author":"Lafont","year":"1987"},{"key":"10.1016\/0304-3975(91)90230-Y_BIB13","article-title":"Reducibility and evaluation","author":"Lafont","year":"1988","journal-title":"Seminar notes"},{"key":"10.1016\/0304-3975(91)90230-Y_BIB14","article-title":"Deductive Systems and Categories II: Standard Constructions and Closed Categories","volume":"86","author":"Lambek","year":"1969"},{"key":"10.1016\/0304-3975(91)90230-Y_BIB15","article-title":"Multicategories revisited","volume":"92","author":"Lambek","year":"1989","journal-title":"Proc. A.M.S. Conf. on Categories in Computer Science and Logic, Boulder 1987"},{"key":"10.1016\/0304-3975(91)90230-Y_BIB16","series-title":"Introduction to Higher Order Categorical Logic","author":"Lambek","year":"1986"},{"key":"10.1016\/0304-3975(91)90230-Y_BIB17","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","article-title":"The mechanical evaluation of expressions","volume":"6","author":"Landin","year":"1964","journal-title":"Computing J."},{"key":"10.1016\/0304-3975(91)90230-Y_BIB18","article-title":"Compilation des langages fonctionnels dans les combinateurs cat\u00e9goriques; Application au langage ML","volume":"VII","author":"Mauny","year":"1985"},{"key":"10.1016\/0304-3975(91)90230-Y_BIB19","article-title":"R\u00e9ductions correctes et optimales dans le lambda-calcul","volume":"VII","author":"L\u00e9vy","year":"1978"},{"key":"10.1016\/0304-3975(91)90230-Y_BIB20","article-title":"Categorical, Functional and Algebraic Aspects of the Type-free Lambda-calculus","volume":"9","author":"Obtulowicz","year":"1982"},{"key":"10.1016\/0304-3975(91)90230-Y_BIB21","series-title":"Proc. 29th Conf. on Foundations of Computer Science","article-title":"Fully abstract models of the lazy \u03bb-calculus","author":"Luke Ong","year":"1988"},{"key":"10.1016\/0304-3975(91)90230-Y_BIB22","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\/0304-3975(91)90230-Y_BIB23","author":"Yokouchi","year":"1988","journal-title":"A rewriting system for categorical combinators with multiple arguments"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190230Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190230Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:53:43Z","timestamp":1555127623000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759190230Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["030439759190230Y"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90230-y","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}