The following pages link to (Q3336736):
Displaying 15 items.
- Building exact computation sequences (Q579925) (← links)
- Confluence for graph transformations (Q672753) (← links)
- Strict coherence of conditional rewriting modulo axioms (Q683741) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- Equational completion in order-sorted algebras (Q912606) (← links)
- Termination orderings for associative-commutative rewriting systems (Q1072371) (← links)
- Termination of rewriting (Q1098624) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- Conditional narrowing modulo a set of equations (Q1261194) (← links)
- A general conservative extension theorem in process algebras with inequalities (Q1391791) (← links)
- Termination modulo equations by abstract commutation with an application to iteration (Q1391793) (← links)
- Kleene Monads: Handling Iteration in a Framework of Generic Effects (Q2888474) (← links)
- Dummy elimination in equational rewriting (Q5055853) (← links)
- AC-Termination of rewrite systems: A modified Knuth-Bendix ordering (Q5096208) (← links)
- Confluence of algebraic rewriting systems (Q5879266) (← links)
