The following pages link to (Q4385532):
Displaying 50 items.
- On the termination problem for one-rule semi-Thue system (Q5055868) (← links)
- Decidable approximations of term rewriting systems (Q5055873) (← links)
- Semantics and strong sequentially of priority term rewriting systems (Q5055874) (← links)
- Higher-order families (Q5055875) (← links)
- Rewriting regular inequalities (Q5055882) (← links)
- Dummy elimination: Making termination easier (Q5055895) (← links)
- Unique normal forms for nonlinear term rewriting systems: Root overlaps (Q5055958) (← links)
- String Diagram Rewrite Theory I: Rewriting with Frobenius Structure (Q5066951) (← links)
- Equation solving in conditional AC-theories (Q5096202) (← links)
- An abstract concurrent machine for rewriting (Q5096204) (← links)
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths (Q5096206) (← links)
- Jungle rewriting: An abstract description of a lazy narrowing machine (Q5096278) (← links)
- A confluent relational calculus for higher-order programming with constraints (Q5096302) (← links)
- “Syntactic” AC-unification (Q5096305) (← links)
- On modularity in term rewriting and narrowing (Q5096311) (← links)
- Higher order conditional rewriting and narrowing (Q5096313) (← links)
- Buchberger's algorithm: A constraint-based completion procedure (Q5096314) (← links)
- How to win a game with features (Q5096316) (← links)
- An introduction to category-based equational logic (Q5096381) (← links)
- CPO models for infinite term rewriting (Q5096397) (← links)
- Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems (Q5096744) (← links)
- Lazy narrowing: Strong completeness and eager variable elimination (extended abstract) (Q5096745) (← links)
- Negation elimination in equational formulae (Q5096830) (← links)
- One-rule trace-rewriting systems and confluence (Q5096864) (← links)
- Rational rewriting (Q5096902) (← links)
- Critical pairs in term graph rewriting (Q5096914) (← links)
- Proving convergence of self-stabilizing systems using first-order rewriting and regular languages (Q5138353) (← links)
- A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting (Q5166636) (← links)
- Closure of Tree Automata Languages under Innermost Rewriting (Q5170159) (← links)
- Variant Narrowing and Equational Unification (Q5179131) (← links)
- On Transfinite Knuth-Bendix Orders (Q5200038) (← links)
- Buchberger's algorithm: The term rewriter's point of view (Q5204333) (← links)
- Completion of rewrite systems with membership constraints (Q5204334) (← links)
- Induction using term orderings (Q5210765) (← links)
- On notions of inductive validity for first-order equational clauses (Q5210769) (← links)
- Simple termination revisited (Q5210790) (← links)
- Termination orderings for rippling (Q5210791) (← links)
- Associative-commutative deduction with constraints (Q5210795) (← links)
- AC-superposition with constraints: No AC-unifiers needed (Q5210796) (← links)
- On pot, pans and pudding or how to discover generalised critical Pairs (Q5210806) (← links)
- Decidable call by need computations in term rewriting (extended abstract) (Q5234682) (← links)
- Well-founded coalgebras, revisited (Q5361146) (← links)
- Confluence: The Unifying, Expressive Power of Locality (Q5403076) (← links)
- FLIC: Application to Caching of a Dynamic Dependency Analysis for a 3D Oriented CRS (Q5415651) (← links)
- Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation (Q5504591) (← links)
- Towards an Efficient Implementation of Tree Automata Completion (Q5505416) (← links)
- Termination by absence of infinite chains of dependency pairs (Q5878910) (← links)
- Context rewriting (Q5881173) (← links)
- Consistency and semantics of equational definitions over predefined algebras (Q5881176) (← links)
- Collapsed tree rewriting: Completeness, confluence, and modularity (Q5881178) (← links)
