{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:30Z","timestamp":1761611070081},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1988,8,1]],"date-time":"1988-08-01T00:00:00Z","timestamp":586396800000},"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":9116,"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":[[1988,8]]},"DOI":"10.1016\/0304-3975(88)90149-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"317-325","source":"Crossref","is-referenced-by-count":53,"title":["Substitution revisited"],"prefix":"10.1016","volume":"59","author":[{"given":"Allen","family":"Stoughton","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(88)90149-1_BIB1","series-title":"The Lambda Calculus: Its Syntax and Semantics","author":"Barendregt","year":"1984"},{"key":"10.1016\/0304-3975(88)90149-1_BIB2","volume":"Vol. I","author":"Curry","year":"1958"},{"key":"10.1016\/0304-3975(88)90149-1_BIB3","series-title":"Mathematical Logic","author":"Ebbinghaus","year":"1984"},{"issue":"2","key":"10.1016\/0304-3975(88)90149-1_BIB4","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1137\/0214028","article-title":"Axioms for the theory of lambda-conversion","volume":"14","author":"Revesz","year":"1985","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/0304-3975(88)90149-1_BIB5","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1137\/0211062","article-title":"The category-theoretic solution of recursive domain equations","volume":"11","author":"Smyth","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(88)90149-1_BIB6","series-title":"Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory","author":"Stoy","year":"1977"},{"issue":"3","key":"10.1016\/0304-3975(88)90149-1_BIB7","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1137\/0205036","article-title":"The relation between computational and denotational properties for Scott's D\u221e-models of the lambda-calculus","volume":"5","author":"Wadsworth","year":"1976","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901491?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901491?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:54:05Z","timestamp":1555113245000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397588901491"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,8]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,8]]}},"alternative-id":["0304397588901491"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90149-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1988,8]]}}}