The following pages link to (Q3779784):
Displayed 18 items.
- A combinatory logic approach to higher-order E-unification (Q673971) (← links)
- Termination of narrowing revisited (Q1035697) (← links)
- Enumerating outer narrowing derivations for constructor-based term rewriting systems (Q1124376) (← links)
- Completion for unification (Q1178701) (← links)
- Complete sets of transformations for general E-unification (Q1262754) (← links)
- Completeness results for basic narrowing (Q1328184) (← links)
- Basic narrowing revisited (Q1824412) (← links)
- Normal forms in combinatory logic (Q1903133) (← links)
- Higher-order unification via combinators (Q2367541) (← links)
- Unification modulo an equality theory for equational logic programming (Q2639627) (← links)
- Modular Termination of Basic Narrowing (Q3522005) (← links)
- Negation with logical variables in conditional rewriting (Q5055728) (← links)
- Detecting redundant narrowing derivations by the LSE-SL reducibility test (Q5055750) (← links)
- Narrowing directed by a graph of terms (Q5055753) (← links)
- Equation solving in conditional AC-theories (Q5096202) (← links)
- On the connection between narrowing and proof by consistency (Q5210767) (← links)
- A new approach to general E-unification based on conditional rewriting systems (Q5881211) (← links)
- An optimal narrowing strategy for general canonical systems (Q5881212) (← links)