The following pages link to Term rewriting induction (Q6488529):
Displaying 21 items.
- Mechanically certifying formula-based Noetherian induction reasoning (Q507366) (← links)
- Using induction and rewriting to verify and complete parameterized specifications (Q672051) (← links)
- Arboretum for a generalisation of Ramanujan polynomials (Q829672) (← links)
- Deductive and inductive synthesis of equational programs (Q1322836) (← links)
- Induction = I-axiomatization + first-order consistency. (Q1854350) (← links)
- Induction using term orders (Q1915132) (← links)
- Unprovability results for clause set cycles (Q2084942) (← links)
- Induction and Skolemization in saturation theorem proving (Q2084957) (← links)
- Transforming orthogonal inductive definition sets into confluent term rewrite systems (Q2141298) (← links)
- On transforming cut- and quantifier-free cyclic proofs into rewriting-induction proofs (Q2163179) (← links)
- Narrowing and Rewriting Logic: from Foundations to Applications (Q2873786) (← links)
- Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities (Q3522029) (← links)
- Termination of algorithms over non-freely generated data types (Q4647505) (← links)
- Proofs in parameterized specifications (Q5055758) (← links)
- Program transformation and rewriting (Q5055762) (← links)
- Improving rewriting induction approach for proving ground confluence (Q5111302) (← links)
- Induction using term orderings (Q5210765) (← links)
- Mechanizable inductive proofs for a class of ∀ ∃ formulas (Q5210766) (← links)
- Conditional rewriting in focus (Q5881263) (← links)
- A general framework to build contextual cover set induction provers (Q5950934) (← links)
- Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting (Q6052950) (← links)
