{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:18Z","timestamp":1759638198947},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,2,1]],"date-time":"1992-02-01T00:00:00Z","timestamp":696902400000},"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":7837,"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":[[1992,2]]},"DOI":"10.1016\/0304-3975(92)90212-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"75-89","source":"Crossref","is-referenced-by-count":5,"title":["A list-oriented extension of the lambda-calculus satisfying the Church\u2014Rosser theorem"],"prefix":"10.1016","volume":"93","author":[{"given":"Gy\u00f6rgy E.","family":"R\u00e9v\u00e9sz","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"8","key":"10.1016\/0304-3975(92)90212-X_BIB1","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/359576.359579","article-title":"Can programming be liberated from the von Neumann style? A functional style and its algebra of programs","volume":"21","author":"Backus","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(92)90212-X_BIB2","series-title":"The Lambda Calculus: Its Syntax and Semantics","author":"Barendregt","year":"1984"},{"issue":"3","key":"10.1016\/0304-3975(92)90212-X_BIB3","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0743-1066(84)90012-8","article-title":"An extension of lambda-calculus for functional programming","volume":"1","author":"Revesz","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(92)90212-X_BIB4","article-title":"Lambda-Calculus, Combinators, and Functional Programming","volume":"Vol. 4","author":"Revesz","year":"1988"},{"key":"10.1016\/0304-3975(92)90212-X_BIB5","series-title":"The Implementation of Functional Languages","first-page":"431","article-title":"An introduction to Miranda","author":"Turner","year":"1987"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290212X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290212X?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:56:52Z","timestamp":1555127812000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290212X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,2]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,2]]}},"alternative-id":["030439759290212X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90212-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,2]]}}}