{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T01:59:35Z","timestamp":1776304775768,"version":"3.50.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1982,10,1]],"date-time":"1982-10-01T00:00:00Z","timestamp":402278400000},"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":11247,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1982,10]]},"DOI":"10.1016\/0022-0000(82)90006-x","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"239-266","source":"Crossref","is-referenced-by-count":142,"title":["Proofs by induction in equational theories with constructors"],"prefix":"10.1016","volume":"25","author":[{"given":"Gerard","family":"Huet","sequence":"first","affiliation":[]},{"given":"Jean-Marie","family":"Hullot","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(82)90006-X_BIB1","article-title":"Mechanizing Structural Induction","author":"Aubin","year":"1976"},{"key":"10.1016\/0022-0000(82)90006-X_BIB2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1145\/321864.321875","article-title":"Proving theorems about LISP functions","volume":"22","author":"Boyer","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(82)90006-X_BIB3","series-title":"A Computational Logic","author":"Boyer","year":"1979"},{"key":"10.1016\/0022-0000(82)90006-X_BIB4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1093\/comjnl\/12.1.41","article-title":"Proving properties of programs by structural induction","volume":"12","author":"Burstall","year":"1969","journal-title":"Comput. J."},{"key":"10.1016\/0022-0000(82)90006-X_BIB5","series-title":"Proceedings 20th Symposium on Foundations of Computer Science","first-page":"123","article-title":"Orderings for term-rewriting systems","author":"Dershowitz","year":"1979"},{"key":"10.1016\/0022-0000(82)90006-X_BIB6","series-title":"Proceedings of the Fifth Conference on Automated Deduction","first-page":"356","article-title":"How to prove algebraic inductive hypotheses without induction, with applications to the correctness of data type implementation","author":"Goguen","year":"1980"},{"key":"10.1016\/0022-0000(82)90006-X_BIB7","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","article-title":"Initial algebras semantics and continuous algebras","volume":"24","author":"Goguen","year":"1977","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(82)90006-X_BIB8","first-page":"80","article-title":"An initial algebra approach to the specification, correctness, and implementation of abstract data types","volume":"Vol. 4","author":"Goguen","year":"1978"},{"key":"10.1016\/0022-0000(82)90006-X_BIB9_1","series-title":"Eighteenth IEEE Symposium on Foundations of Computer Science","first-page":"30","article-title":"Confluent reductions: Abstract properties and applications to term rewriting systems","author":"Huet","year":"1977"},{"issue":"4","key":"10.1016\/0022-0000(82)90006-X_BIB9_2","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"Huet","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No 25","key":"10.1016\/0022-0000(82)90006-X_BIB10","article-title":"A complete proof of correctness of the Knuth-Bendix completion algorithm","author":"Huet","year":"1980","journal-title":"Rapport de Recherche INRIA"},{"key":"10.1016\/0022-0000(82)90006-X_BIB18","unstructured":"J. Comput. System Sci., to appear."},{"key":"10.1016\/0022-0000(82)90006-X_BIB11_1","series-title":"Formal Languages: Perspectives and Open Problems","article-title":"Equations and rewrite rules: A survey","author":"Huet","year":"1980"},{"key":"10.1016\/0022-0000(82)90006-X_BIB11_2","author":"Huet","year":"1980"},{"key":"10.1016\/0022-0000(82)90006-X_BIB12","series-title":"Two generalizations of the recursive path ordering","author":"Kamin","year":"1980"},{"key":"10.1016\/0022-0000(82)90006-X_BIB13","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\/0022-0000(82)90006-X_BIB14","article-title":"Decision Procedures for Simple Equational Theories with Commutative-Associative Axioms: Complete Sets of Commutative-Associative Reductions","author":"Lankford","year":"1977"},{"key":"10.1016\/0022-0000(82)90006-X_BIB15","series-title":"Proceedings of the Seventh Annual ACM Symposium on Principles of Programming Languages","first-page":"154","article-title":"On proving inductive properties of abstract data types","author":"Musser","year":"1980"},{"key":"10.1016\/0022-0000(82)90006-X_BIB16","series-title":"Complete Sets of Reductions for Equational Theories with Complete Unification Algorithms","author":"Peterson","year":"1977"},{"key":"10.1016\/0022-0000(82)90006-X_BIB17","article-title":"A Recursively Defined Ordering for Proving Termination of Term Rewriting Systems","author":"Plaisted","year":"1978"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200008290006X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200008290006X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:50:14Z","timestamp":1550325014000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200008290006X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,10]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,10]]}},"alternative-id":["002200008290006X"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(82)90006-x","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1982,10]]}}}