The following pages link to (Q3696486):
Displayed 21 items.
- A compositional semantic basis for the analysis of equational Horn programs (Q671509) (← links)
- Code selection by inversion of order-sorted derivors (Q914361) (← links)
- Conditional equational theories and complete sets of transformations (Q918541) (← links)
- Simplifying conditional term rewriting systems: Unification, termination and confluence (Q1100891) (← links)
- A class of confluent term rewriting systems and unification (Q1101209) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- Narrowing vs. SLD-resolution (Q1105364) (← links)
- Enumerating outer narrowing derivations for constructor-based term rewriting systems (Q1124376) (← links)
- Narrowing based procedures for equational disunification (Q1197097) (← links)
- Schematization of infinite sets of rewrite rules generated by divergent completion processes (Q1262755) (← links)
- Three systems for cryptographic protocol analysis (Q1330137) (← links)
- Basic narrowing revisited (Q1824412) (← links)
- Kernel-LEAF: A logic plus functional language (Q2638759) (← links)
- Unification modulo an equality theory for equational logic programming (Q2639627) (← links)
- Logic and functional programming by retractions (Q3817574) (← links)
- Detecting redundant narrowing derivations by the LSE-SL reducibility test (Q5055750) (← links)
- A semantic approach to order-sorted rewriting (Q5055784) (← links)
- On narrowing, refutation proofs and constraints (Q5055818) (← links)
- Optimization of rewriting and complexity of rewriting (Q5096207) (← links)
- An optimal narrowing strategy for general canonical systems (Q5881212) (← links)
- NARROWER (Q5973903) (← links)