A rewrite rule based approach for synthesizing abstract data types
- 1 January 1985
- book chapter
- Published by Springer Nature
- p. 188-207
- https://doi.org/10.1007/3-540-15198-2_12
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Computer experiments with the REVE term rewriting system generatorPublished by Association for Computing Machinery (ACM) ,1983
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- Rewrite rule theory and abstract data type analysisLecture Notes in Computer Science, 1982
- A System for Assisting Program TransformationACM Transactions on Programming Languages and Systems, 1982
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981
- Proofs by induction in equational theories with constructorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- On proving inductive properties of abstract data typesPublished by Association for Computing Machinery (ACM) ,1980
- A Deductive Approach to Program SynthesisACM Transactions on Programming Languages and Systems, 1980
- The algebraic specification of abstract data typesActa Informatica, 1978
- A Transformation System for Developing Recursive ProgramsJournal of the ACM, 1977