{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T05:45:38Z","timestamp":1648705538311},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"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":5280,"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":[[1999,2]]},"DOI":"10.1016\/s0304-3975(98)00141-8","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"211-231","source":"Crossref","is-referenced-by-count":0,"title":["Orders, reduction graphs and spectra"],"prefix":"10.1016","volume":"212","author":[{"given":"B.","family":"Intrigila","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.Venturini","family":"Zilli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00141-8_BIB1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.3233\/FI-1996-263401","article-title":"Equational term graph rewriting","volume":"26","author":"Ariola","year":"1996","journal-title":"Fundam. Inform."},{"key":"10.1016\/S0304-3975(98)00141-8_BIB2","series-title":"The Lambda Calculus. Its Syntax and Semantics","author":"Barendregt","year":"1984"},{"key":"10.1016\/S0304-3975(98)00141-8_BIB3","first-page":"200","article-title":"Varieties of ordered algebras","volume":"13","author":"Bloom","year":"1976","journal-title":"JCSS"},{"key":"10.1016\/S0304-3975(98)00141-8_BIB4","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1006\/inco.1994.1079","article-title":"The ant-lion paradigm for strong normalization","volume":"114","author":"Boehm","year":"1994","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(98)00141-8_BIB5","series-title":"Introduction to Lattices and Orders","author":"Davey","year":"1994"},{"key":"10.1016\/S0304-3975(98)00141-8_BIB6","series-title":"Formal Models and Semantics","first-page":"243","article-title":"Rewrite systems","volume":"Vol. B","author":"Dershowitz","year":"1990"},{"key":"10.1016\/S0304-3975(98)00141-8_BIB7","article-title":"Open problems in rewriting","author":"Dershowitz","year":"1991","journal-title":"CWI Report"},{"key":"10.1016\/S0304-3975(98)00141-8_BIB8","series-title":"RTA93","article-title":"More problems on rewriting","volume":"vol. 690","author":"Dershowitz","year":"1993"},{"key":"10.1016\/S0304-3975(98)00141-8_BIB9","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0304-3975(91)90040-9","article-title":"Rewrite, rewrite, rewrite, rewrite, rewrite","volume":"83","author":"Dershowitz","year":"1991","journal-title":"\u2026 Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/S0304-3975(98)00141-8_BIB10","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/322358.322370","article-title":"The expressiveness of simple and second-order type structures","volume":"30 n","author":"Fortune","year":"1983","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(98)00141-8_BIB11","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/S0304-3975(98)00141-8_BIB12","article-title":"Combinatory Reduction Systems","volume":"vol. 127","author":"Klop","year":"1980"},{"key":"10.1016\/S0304-3975(98)00141-8_BIB13","series-title":"To H.B.Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","article-title":"Reductions cycles in Combinatory Logic","author":"Klop","year":"1980"},{"key":"10.1016\/S0304-3975(98)00141-8_BIB14","article-title":"R\u00e9ductions completes et optimales dans le lambda-calculi","author":"L\u00e9vy","year":"1978","journal-title":"Ph.D. Thesis"},{"key":"10.1016\/S0304-3975(98)00141-8_BIB15","series-title":"Introduction to Set Theory","author":"Monk","year":"1969"},{"key":"10.1016\/S0304-3975(98)00141-8_BIB16","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/malq.19710170113","article-title":"Eine Klassification der \u03b50-recursiven Funktionen","volume":"17","author":"Schwichtenberg","year":"1971","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"10.1016\/S0304-3975(98)00141-8_BIB17","series-title":"Trees in Algebra and Programming","first-page":"405","article-title":"Cofinality in reduction graphs","volume":"vol. 159","author":"Venturini-Zilli","year":"1983"},{"key":"10.1016\/S0304-3975(98)00141-8_BIB18","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0304-3975(84)90002-1","article-title":"Reduction graphs in the lambda calculus","volume":"29","author":"Venturini-Zilli","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00141-8_BIB19","series-title":"Introduction to Graph Theory","author":"Wilson","year":"1989"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001418?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001418?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T14:17:55Z","timestamp":1580825875000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598001418"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["S0304397598001418"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00141-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}