{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T07:53:00Z","timestamp":1712217180949},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0890-5401(03)00014-2","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"19-42","source":"Crossref","is-referenced-by-count":17,"title":["Term rewriting for normalization by evaluation"],"prefix":"10.1016","volume":"183","author":[{"given":"Ulrich","family":"Berger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Eberl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Helmut","family":"Schwichtenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0890-5401(03)00014-2_BIB1","series-title":"CTCS\u201995, Cambridge","first-page":"182","article-title":"Categorical reconstruction of a reduction free normalization proof","volume":"vol. 953","author":"Altenkirch","year":"1995"},{"key":"10.1016\/S0890-5401(03)00014-2_BIB2","series-title":"Automated Deduction\u2014A Basis for Applications","first-page":"41","article-title":"Proof theory at work: program development in the Minlog system","volume":"vol. II","author":"Benl","year":"1998"},{"key":"10.1016\/S0890-5401(03)00014-2_BIB3","unstructured":"U. Berger, Continuous functionals of dependent and transfinite types, Habilitationsschrift, Mathematisches Institut der Universit\u00e4t M\u00fcnchen, 1997"},{"key":"10.1016\/S0890-5401(03)00014-2_BIB4","series-title":"Prospects for Hardware Foundations","first-page":"117","article-title":"Normalization by evaluation","volume":"vol. 1546","author":"Berger","year":"1998"},{"key":"10.1016\/S0890-5401(03)00014-2_BIB5","series-title":"Proceedings 6th Symposium on Logic in Computer Science (LICS\u201991)","first-page":"203","article-title":"An inverse of the evaluation functional for typed \u03bb-calculus","author":"Berger","year":"1991"},{"key":"10.1016\/S0890-5401(03)00014-2_BIB6","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1017\/S0960129596002150","article-title":"Intuitionistic model constructions and normalization proofs","volume":"7","author":"Coquand","year":"1997","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0890-5401(03)00014-2_BIB7","series-title":"Categories for Types","author":"Crole","year":"1993"},{"key":"10.1016\/S0890-5401(03)00014-2_BIB8","series-title":"Partial Evaluation","first-page":"73","article-title":"Pragmatics of type-directed partial evaluation","volume":"vol. 1110","author":"Danvy","year":"1996"},{"key":"10.1016\/S0890-5401(03)00014-2_BIB9","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":"Indagationes Math."},{"key":"10.1016\/S0890-5401(03)00014-2_BIB10","series-title":"Principles and Practice of Declarative Programming 1999","first-page":"378","article-title":"A semantic account of type-directed partial evaluation","volume":"vol. 1702","author":"Filinski","year":"1999"},{"key":"10.1016\/S0890-5401(03)00014-2_BIB11","article-title":"Introduction to Higher Order Categorical Logic","volume":"vol. 7","author":"Lambek","year":"1986"},{"issue":"4","key":"10.1016\/S0890-5401(03)00014-2_BIB12","first-page":"184","article-title":"Recursive functions of symbolic expressions and their computation by machine","volume":"3","author":"McCarthy","year":"1960","journal-title":"Commun. Assoc. Comput. Mach."},{"key":"10.1016\/S0890-5401(03)00014-2_BIB13","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","article-title":"LCF considered as a programming language","volume":"5","author":"Plotkin","year":"1977","journal-title":"Theoret. Comput. Sci."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540103000142?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540103000142?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T01:23:37Z","timestamp":1553390617000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540103000142"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0890540103000142"],"URL":"https:\/\/doi.org\/10.1016\/s0890-5401(03)00014-2","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}