The following pages link to (Q3210187):
Displaying 22 items.
- Towards a foundation of completion procedures as semidecision procedures (Q673134) (← links)
- Equational completion in order-sorted algebras (Q912606) (← links)
- A rationale for conditional equational programming (Q915429) (← links)
- Programming with narrowing: a tutorial (Q968524) (← links)
- Simplifying conditional term rewriting systems: Unification, termination and confluence (Q1100891) (← links)
- C-expressions: A variable-free calculus for equational logic programming (Q1208416) (← links)
- Schematization of infinite sets of rewrite rules generated by divergent completion processes (Q1262755) (← links)
- Deductive and inductive synthesis of equational programs (Q1322836) (← links)
- Elimination of conditions (Q1974693) (← links)
- Ternary Equational Languages (Q2830209) (← links)
- (Q3635984) (← links)
- (Q4204131) (← links)
- (Q4303127) (← links)
- Narrowing and unification in functional programming —An evaluation mechanism for absolute set abstraction (Q5055714) (← links)
- More problems in rewriting (Q5055812) (← links)
- Equation solving in conditional AC-theories (Q5096202) (← links)
- An abstract concurrent machine for rewriting (Q5096204) (← links)
- Extended term rewriting systems (Q5881265) (← links)
- Conditional rewriting logic: Deduction, models and concurrency (Q5881267) (← links)
- Confluence of the disjoint union of conditional term rewriting systems (Q5881285) (← links)
- Compiling concurrent rewriting onto the Rewrite Rule Machine (Q5881288) (← links)
- Local confluence of conditional and generalized term rewriting systems (Q6151615) (← links)
