Recommendations
Cites work
- A Larch shared language handbook
- A program transformation from equational programs into logic programs
- Abstract data types and software validation
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- scientific article; zbMATH DE number 3888893 (Why is no real title available?)
- scientific article; zbMATH DE number 3913652 (Why is no real title available?)
- scientific article; zbMATH DE number 3913659 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3784268 (Why is no real title available?)
- scientific article; zbMATH DE number 194509 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- Logic programming with equations
- On sufficient-completeness and related properties of term rewriting systems
- Proofs by induction in equational theories with constructors
- Proving Properties of Programs by Structural Induction
- The algebraic specification of abstract data types
Cited in
(3)
This page was built for publication: Design strategies for rewrite rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5881289)