The following pages link to (Q4385532):
Displaying 40 items.
- Combinations of simplifying conditional term rewriting systems (Q5881179) (← links)
- Termination of term rewriting by interpretation (Q5881183) (← links)
- Path orderings for termination of associative-commutative rewriting (Q5881184) (← links)
- Generic induction proofs (Q5881185) (← links)
- Reduction techniques for first-order reasoning (Q5881189) (← links)
- Semigroups satisfying x m+n = x n (Q5881194) (← links)
- Could orders be captured by term rewriting systems? (Q5881195) (← links)
- A categorical formulation for critical-pair/completion procedures (Q5881196) (← links)
- Implementing contextual rewriting (Q5881200) (← links)
- Confluence of terminating membership conditional TRS (Q5881201) (← links)
- Termination proofs of well-moded logic programs via conditional rewrite systems (Q5881206) (← links)
- Normalization by leftmost innermost rewriting (Q5881209) (← links)
- A strategy to deal with divergent rewrite systems (Q5881210) (← links)
- A new approach to general E-unification based on conditional rewriting systems (Q5881211) (← links)
- Extended term rewriting systems (Q5881265) (← links)
- Conditional rewriting logic: Deduction, models and concurrency (Q5881267) (← links)
- Higher-order unification, polymorphism, and subsorts (Q5881304) (← links)
- A modular construction of type theories (Q5883738) (← links)
- Strictly orthogonal left linear rewrite systems and primitive recursion (Q5935986) (← links)
- Normal forms for connectedness in categories (Q5935993) (← links)
- Regular database update logics (Q5940934) (← links)
- On interreduction of semi-complete term rewriting systems (Q5941203) (← links)
- Solving the word problem for two classes of non-associative rings by rewriting (Q5945294) (← links)
- The control layer in open mechanized reasoning systems: Annotations and tactics (Q5950930) (← links)
- Implementing conditional term rewriting by graph rewriting (Q5958126) (← links)
- Inductive-data-type systems (Q5958292) (← links)
- On the longest perpetual reductions in orthogonal expression reduction systems (Q5958775) (← links)
- The next 700 program transformers (Q6102254) (← links)
- Rewriting logic as a semantic framework for concurrency: a progress report (Q6104381) (← links)
- Variants and satisfiability in the infinitary unification wonderland (Q6113018) (← links)
- Local confluence of conditional and generalized term rewriting systems (Q6151615) (← links)
- Checking Sufficient Completeness by Inductive Theorem Proving (Q6487296) (← links)
- On Ground Convergence and Completeness of Conditional Equational Program Hierarchies (Q6487297) (← links)
- Congruence types (Q6560160) (← links)
- Theorem proving modulo associativity (Q6560183) (← links)
- A new proposal of concurrent process calculus (Q6560193) (← links)
- Higher-order proof by consistency (Q6567778) (← links)
- Fundamentals of context-sensitive rewriting (Q6573934) (← links)
- Koszul operads governing props and wheeled props (Q6592060) (← links)
- Dual tableau-based decision procedures for fragments of the logic of binary relations (Q6599613) (← links)
