Completeness in data type specifications
- 1 January 1985
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Stop losing sleep over incomplete data type specificationsPublished by Association for Computing Machinery (ACM) ,1984
- Completion of a set of rules modulo a set of equationsPublished by Association for Computing Machinery (ACM) ,1984
- Computer experiments with the REVE term rewriting system generatorPublished by Association for Computing Machinery (ACM) ,1983
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- Proofs by induction in equational theories with constructorsJournal of Computer and System Sciences, 1982
- On proving inductive properties of abstract data typesPublished by Association for Computing Machinery (ACM) ,1980
- Equations and Rewrite Rules: A SurveyPublished by Elsevier ,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