{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T20:02:37Z","timestamp":1648756957469},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"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":9694,"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":[[1987]]},"DOI":"10.1016\/0304-3975(87)90029-6","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T17:44:32Z","timestamp":1034271872000},"page":"125-150","source":"Crossref","is-referenced-by-count":0,"title":["Building exact computation sequences"],"prefix":"10.1016","volume":"53","author":[{"given":"Alex","family":"Pelin","sequence":"first","affiliation":[]},{"given":"Jean H.","family":"Gallier","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(87)90029-6_BIB1","series-title":"Proceedings Workshop Rewrite Rule Laboratory","article-title":"Ecologiste: A system to make complete and consistent specifications easier","author":"Barros","year":"1983"},{"key":"10.1016\/0304-3975(87)90029-6_BIB2","series-title":"Computational Logic","author":"Boyer","year":"1979"},{"key":"10.1016\/0304-3975(87)90029-6_BIB3","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","article-title":"Orderings for term-rewriting systems","volume":"3","author":"Dershowitz","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(87)90029-6_BIB4","series-title":"Proceedings 7th International Conference on Automated Deduction","first-page":"259","article-title":"A narrowing procedure for theories with constructors","volume":"170","author":"Fribourg","year":"1984"},{"key":"10.1016\/0304-3975(87)90029-6_BIB5","first-page":"767","article-title":"Confluent reductions: Abstract properties and applications to term rewriting systems","author":"Huet","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(87)90029-6_BIB6","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0022-0000(82)90006-X","article-title":"Proofs by induction in equational theories with constructors","volume":"25","author":"Huet","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(87)90029-6_BIB7","series-title":"Formal Language Theory: Perspectives and Open Problems","first-page":"349","article-title":"Equations and rewrite rules: A survey","author":"Huet","year":"1980"},{"key":"10.1016\/0304-3975(87)90029-6_BIB8","series-title":"Tech. Rept.","article-title":"Church\u2014Rosser computations with equatorial term rewriting systems","author":"Jouannaud","year":"1983"},{"key":"10.1016\/0304-3975(87)90029-6_BIB9","series-title":"Tech. Rept. SRI-CSL and CRIN 84-R-046","article-title":"Completion of a set of rules module a set of equations","author":"Jouannaud","year":"1984"},{"key":"10.1016\/0304-3975(87)90029-6_BIB10","series-title":"Proceedings 7th International Conference on Automated Deduction","first-page":"175","article-title":"Termination of a set of rules module a set of equations","volume":"170","author":"Jouannaud","year":"1984"},{"key":"10.1016\/0304-3975(87)90029-6_BIB11","series-title":"Proceedings 7th International Conference on Automated Deduction","first-page":"282","article-title":"A general inductive completion algorithm and applications to abstract data types","volume":"170","author":"Kirchner","year":"1984"},{"key":"10.1016\/0304-3975(87)90029-6_BIB12","series-title":"Computational Problems in Abstract Algebras","first-page":"263","article-title":"Simple word problems in universal algebras","author":"Knuth","year":"1970"},{"key":"10.1016\/0304-3975(87)90029-6_BIB13","doi-asserted-by":"crossref","DOI":"10.1145\/567446.567461","article-title":"On proving inductive properties of abstract data types","author":"Musser","year":"1980","journal-title":"Proceedings 7th POPL"},{"key":"10.1016\/0304-3975(87)90029-6_BIB14","series-title":"Proceedings 9th Colloquium on Trees in Algebra and Programming","article-title":"Preuve par induction dans les th\u00e9ories \u00e9quationelles en presence de relations entre les constructeurs","author":"Paul","year":"1984"},{"key":"10.1016\/0304-3975(87)90029-6_BIB15","series-title":"Proceedings 7th International Conference on Automated Deduction","first-page":"476","article-title":"Solving world problems in free algebras using complexity functions","volume":"170","author":"Pelin","year":"1984"},{"key":"10.1016\/0304-3975(87)90029-6_BIB16","article-title":"Computing normal forms using complexity functions over Nk","author":"Pelin","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(87)90029-6_BIB17","series-title":"Proceedings CAAP-86","first-page":"45","article-title":"Exact computation sequences","volume":"214","author":"Pelin","year":"1986"},{"key":"10.1016\/0304-3975(87)90029-6_BIB18","series-title":"Th\u00e8se d'\u00c9tat","article-title":"Etude des syst\u00e8mes de r\u00e9\u00e9criture conditionels et applications aux types abstraits alg\u00e9briques","author":"Remy","year":"1984"},{"key":"10.1016\/0304-3975(87)90029-6_BIB19","article-title":"REVEURS: A system for validating conditional algebraic specifications of algebraic abstract data types","author":"Remy","year":"1984","journal-title":"Proceedings ECAI-84"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587900296?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587900296?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T02:18:10Z","timestamp":1580869090000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397587900296"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987]]}},"alternative-id":["0304397587900296"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(87)90029-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1987]]}}}