{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T16:52:48Z","timestamp":1675875168137},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"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":6163,"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":[[1996,9]]},"DOI":"10.1016\/0304-3975(96)00041-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:48:18Z","timestamp":1027644498000},"page":"75-95","source":"Crossref","is-referenced-by-count":14,"title":["A sequential reduction strategy"],"prefix":"10.1016","volume":"165","author":[{"given":"Sergio","family":"Antoy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aart","family":"Middeldorp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(96)00041-2_BIB1","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0022-0000(86)90033-4","article-title":"Conditional rewrite rules: confluence and termination","volume":"32","author":"Bergstra","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(96)00041-2_BIB2","series-title":"Proc. 10th IEEE Symp. on Logic in Computer Science","first-page":"508","article-title":"Sequentiality, second order monadic logic and tree automata","author":"Comon","year":"1995"},{"key":"10.1016\/0304-3975(96)00041-2_BIB3","first-page":"243","article-title":"Rewrite systems","volume":"Vol. B","author":"Dershowitz","year":"1990"},{"key":"10.1016\/0304-3975(96)00041-2_BIB4_1","series-title":"Computational Logic, Essays in Honor of Alan Robinson","first-page":"396","article-title":"Computations in orthogonal rewriting systems, I and II","author":"Huet","year":"1991"},{"key":"10.1016\/0304-3975(96)00041-2_BIB4_2","article-title":"Call by need computations in non-ambiguous linear term rewriting systems","author":"Huet","year":"1979"},{"key":"10.1016\/0304-3975(96)00041-2_BIB5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0168-0072(89)90024-9","article-title":"Sequential evaluation strategies for parallel-or and related reduction systems","volume":"43","author":"Kennaway","year":"1989","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0304-3975(96)00041-2_BIB6","series-title":"Mathematical Centre Tracts","article-title":"Combinatory reduction systems","volume":"Vol. 127","author":"Klop","year":"1980"},{"key":"10.1016\/0304-3975(96)00041-2_BIB7","first-page":"1","article-title":"Term rewriting systems","volume":"Vol. II","author":"Klop","year":"1992"},{"key":"10.1016\/0304-3975(96)00041-2_BIB8","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-08531-9","article-title":"Computing in Systems Described by Equations","volume":"Vol. 58","author":"O'Donnell","year":"1977","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/0304-3975(96)00041-2_BIB9","article-title":"Confluence for abstract and higher-order rewriting","author":"van Oostrom","year":"1994"},{"key":"10.1016\/0304-3975(96)00041-2_BIB10","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1137\/0222010","article-title":"NV-sequentiality: a decidable condition for call-by-need computations in term rewriting systems","volume":"22","author":"Oyamaguchi","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(96)00041-2_BIB11","first-page":"141","article-title":"Fairness in term rewriting systems","volume":"1","author":"Porat","year":"1994","journal-title":"Methods Logic Comput. Sci."},{"key":"10.1016\/0304-3975(96)00041-2_BIB12","series-title":"Proc. 2nd Internat. Workshop on Higher-Order Algebra, Logic and Term Rewriting","article-title":"On normalising strategies","author":"van Raamsdonk","year":"1995"},{"key":"10.1016\/0304-3975(96)00041-2_BIB13","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1006\/inco.1993.1026","article-title":"Programming in equational logic: beyond strong sequentiality","volume":"104","author":"Sekar","year":"1993","journal-title":"Inform. Comput."},{"key":"10.1016\/0304-3975(96)00041-2_BIB14","series-title":"Proc. 7th IEEE Symp. on Logic in Computer Science","first-page":"274","article-title":"Strong Sequentiality of left-linear overlapping term rewriting systems","author":"Toyama","year":"1992"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397596000412?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397596000412?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:54:52Z","timestamp":1555419292000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397596000412"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["0304397596000412"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(96)00041-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}