{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:08:04Z","timestamp":1774987684141,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"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":4886,"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":[[2000,3]]},"DOI":"10.1016\/s0304-3975(99)00190-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:51:05Z","timestamp":1027633865000},"page":"171-181","source":"Crossref","is-referenced-by-count":7,"title":["The self-reduction in lambda calculus"],"prefix":"10.1016","volume":"235","author":[{"given":"Fangmin","family":"Song","sequence":"first","affiliation":[]},{"given":"Yongsen","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Yuechen","family":"Qian","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0304-3975(99)00190-5_BIB1","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1017\/S0956796800000356","article-title":"Enumerators of lambda terms are Reducing","volume":"2","author":"Barendregt","year":"1992","journal-title":"J. Functional Programm."},{"key":"10.1016\/S0304-3975(99)00190-5_BIB2","unstructured":"H. Barendregt, The Lambda Calculus: Its Syntax and Semantics, Revised Edition, North-Holland, Amsterdam, 1984."},{"issue":"2","key":"10.1016\/S0304-3975(99)00190-5_BIB3","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1017\/S0956796800020062","article-title":"Self-Interpretation in Lambda Calculus","volume":"1","author":"Barendregt","year":"1991","journal-title":"J. Functional Programm."},{"key":"10.1016\/S0304-3975(99)00190-5_BIB4","doi-asserted-by":"crossref","unstructured":"A. Berarducci, C. B\u00f6hm, A Self-Interpreter of Lambda Calculus Having a Normal Form, Lecture Notes in Computer Science, Vol. 702, Computer Science Logic, Springer, Berlin, 1992, pp. 85\u201399.","DOI":"10.1007\/3-540-56992-8_7"},{"key":"10.1016\/S0304-3975(99)00190-5_BIB5","series-title":"Introduction to Combinators and \u03bb-Calculus","author":"Hindley","year":"1986"},{"issue":"3","key":"10.1016\/S0304-3975(99)00190-5_BIB6","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1017\/S0956796800000423","article-title":"Efficient self-interpretation in lambda calculus","volume":"2","author":"Mogensen","year":"1992","journal-title":"J. Functional Programm."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001905?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001905?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T19:19:45Z","timestamp":1580843985000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599001905"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["S0304397599001905"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00190-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}