The following pages link to Computing with rewrite systems (Q3707361):
Displaying 38 items.
- Towards a foundation of completion procedures as semidecision procedures (Q673134) (← links)
- Bi-rewrite systems (Q674746) (← links)
- Synthetic programming (Q761788) (← links)
- A rationale for conditional equational programming (Q915429) (← links)
- Termination orderings for associative-commutative rewriting systems (Q1072371) (← links)
- On sufficient-completeness and related properties of term rewriting systems (Q1077161) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- Critical pair criteria for completion (Q1106659) (← links)
- Fast Knuth-Bendix completion with a term rewriting system compiler (Q1123602) (← links)
- Enumerating outer narrowing derivations for constructor-based term rewriting systems (Q1124376) (← links)
- A rewrite mechanism for logic programs with negation (Q1127337) (← links)
- When is an extension of a specification consistent? Decidable and undecidable cases (Q1186708) (← links)
- Rewriting techniques and applications. 3rd international conference, RTA-89, Chapel Hill, NC, USA, April 3--5, 1989. Proceedings (Q1187660) (← links)
- Deductive and inductive synthesis of equational programs (Q1322836) (← links)
- Programs with restoration of computations (Q1592016) (← links)
- Category-based modularisation for equational logic programming (Q1901708) (← links)
- Linear and unit-resulting refutations for Horn theories (Q1923821) (← links)
- Unification modulo an equality theory for equational logic programming (Q2639627) (← links)
- Sufficient-completeness, ground-reducibility and their complexity (Q2641108) (← links)
- Pushing the frontiers of combining rewrite systems farther outwards (Q2782485) (← links)
- Canonical Inference for Implicational Systems (Q3541718) (← links)
- (Q3700828) (← links)
- Rewrite rule systems for modal propositional logic (Q3992233) (← links)
- Canonical Ground Horn Theories (Q4916071) (← links)
- Rewriting, and equational unification: the higher-order cases (Q5055746) (← links)
- Proofs in parameterized specifications (Q5055758) (← links)
- Program transformation and rewriting (Q5055762) (← links)
- Encompassment properties and automata with constraints (Q5055805) (← links)
- Rewrite systems for integer arithmetic (Q5055840) (← links)
- Set-theoretic graph rewriting (Q5096290) (← links)
- An introduction to category-based equational logic (Q5096381) (← links)
- (Q5297489) (← links)
- A proof system for conditional algebraic specifications (Q5881266) (← links)
- A survey of ordinal interpretations of type ɛ0 for termination of rewriting systems (Q5881273) (← links)
- Meta-rule synthesis from crossed rewrite systems (Q5881274) (← links)
- Completion procedures as semidecision procedures (Q5881279) (← links)
- Clausal rewriting (Q5881281) (← links)
- Design strategies for rewrite rules (Q5881289) (← links)
