{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:14:45Z","timestamp":1761610485751,"version":"build-2065373602"},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T00:00:00Z","timestamp":1112313600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T00:00:00Z","timestamp":1112313600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3041,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2005,4]]},"DOI":"10.1016\/j.entcs.2004.11.020","type":"journal-article","created":{"date-parts":[[2005,4,19]],"date-time":"2005-04-19T09:53:39Z","timestamp":1113904419000},"page":"65-77","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Vicious Circles in Orthogonal Term Rewriting Systems"],"prefix":"10.1016","volume":"124","author":[{"given":"Jeroen","family":"Ketema","sequence":"first","affiliation":[]},{"given":"Jan Willem","family":"Klop","sequence":"additional","affiliation":[]},{"given":"Vincent","family":"van Oostrom","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.entcs.2004.11.020_bib001","article-title":"The Lambda Calculus: Its Syntax and Semantics","volume":"103","author":"Barendregt","year":"1985"},{"key":"10.1016\/j.entcs.2004.11.020_bib002","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(79)90004-5","article-title":"Church-Rosser strategies in the lambda calculus","volume":"9","author":"Bergstra","year":"1979","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.entcs.2004.11.020_bib003","unstructured":"Bergstra, J.A., J.W. Klop and A. Middeldorp, \u201cTermherschrijfsystemen,\u201d Programmatuurkunde, Kluwer Bedrijfswetenschappen, Deventer, 1989, in Dutch"},{"key":"10.1016\/j.entcs.2004.11.020_bib004","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1006\/inco.2000.2888","article-title":"Perpetuality and uniform normalization in orthogonal rewrite systems","volume":"164","author":"Khasidashvili","year":"2001","journal-title":"Information and Computation"},{"key":"10.1016\/j.entcs.2004.11.020_bib005","unstructured":"Klop, J., Unpublished notes for the seminar on reduction machines"},{"key":"10.1016\/j.entcs.2004.11.020_bib006","series-title":"Term rewriting systems","first-page":"1","volume":"2","author":"Klop","year":"1995"},{"key":"10.1016\/j.entcs.2004.11.020_bib007","series-title":"To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","first-page":"193","article-title":"Reduction cycles in combinatory logic","author":"Klop","year":"1980"},{"key":"10.1016\/j.entcs.2004.11.020_bib008","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1016\/S0304-3975(00)00379-0","article-title":"How to normalize the Jay","volume":"254","author":"Probst","year":"2001","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.entcs.2004.11.020_bib009","article-title":"Term Rewriting Systems","volume":"55","author":"Terese","year":"2003"},{"author":"van Oostrom","key":"10.1016\/j.entcs.2004.11.020_bib010"},{"author":"van Oostrom","key":"10.1016\/j.entcs.2004.11.020_bib011"},{"key":"10.1016\/j.entcs.2004.11.020_bib012","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/inco.2000.2874","article-title":"The combinator S","volume":"159","author":"Waldmann","year":"2000","journal-title":"Information and Computation"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105001295?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105001295?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:09:12Z","timestamp":1761610152000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105001295"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,4]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,4]]}},"alternative-id":["S1571066105001295"],"URL":"https:\/\/doi.org\/10.1016\/j.entcs.2004.11.020","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2005,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Vicious Circles in Orthogonal Term Rewriting Systems","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.entcs.2004.11.020","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2005 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}