Correctness of Context-Moving Transformations for Term Rewriting Systems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3949707
- Correctness of program transformations as a termination problem
- Proving termination of context-sensitive rewriting by transformation
- scientific article; zbMATH DE number 1722708
- Transformations of Conditional Rewrite Systems Revisited
- Transformation for refining unraveled conditional term rewriting systems
- Transformation techniques for context-sensitive rewrite systems
- Remarks on Thatte's transformation of term rewriting systems
- Correctness of high-level transformation systems relative to nested conditions
- A compact fixpoint semantics for term rewriting systems
Cites work
- A general framework to build contextual cover set induction provers
- Automated Mathematical Induction
- scientific article; zbMATH DE number 1615264 (Why is no real title available?)
- scientific article; zbMATH DE number 1149426 (Why is no real title available?)
- Induction proofs with partial functions
- On sufficient-completeness and related properties of term rewriting systems
- Sound generalizations in mathematical induction
- Sound lemma generation for proving inductive validity of equations
Cited in
(2)
This page was built for publication: Correctness of Context-Moving Transformations for Term Rewriting Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743602)