Complexity of sufficient-completeness
- 1 January 1986
- book chapter
- Published by Springer Nature
- p. 426-442
- https://doi.org/10.1007/3-540-17179-7_26
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A decidability result about sufficient-completeness of axiomatically specified abstract data typesPublished by Springer Nature ,2006
- Proof by induction using test setsPublished by Springer Nature ,1986
- Semantic confluence tests and completion methodsInformation and Control, 1985
- Computing with rewrite systemsInformation and Control, 1985
- The complexity of monadic recursion schemes: exponential time boundsJournal of Computer and System Sciences, 1984
- Proofs by induction in equational theories with constructorsJournal of Computer and System Sciences, 1982
- Equations and Rewrite Rules: A SurveyPublished by Elsevier ,1980
- How to prove algebraic inductive hypotheses without inductionPublished by Springer Nature ,1980
- The algebraic specification of abstract data typesActa Informatica, 1978
- Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.Published by Elsevier ,1970