The following pages link to (Q3819993):
Displaying 30 items.
- Reachability analysis over term rewriting systems (Q556686) (← links)
- On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems (Q671506) (← links)
- Conditional linearization (Q698633) (← links)
- A rationale for conditional equational programming (Q915429) (← links)
- Conditional rewrite rules (Q1065790) (← links)
- Conditional rewrite rules: Confluence and termination (Q1111368) (← links)
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths (Q1200982) (← links)
- Proving termination of (conditional) rewrite systems. A semantic approach (Q1323317) (← links)
- Completeness results for basic narrowing (Q1328184) (← links)
- Perpetuality and uniform normalization in orthogonal rewrite systems (Q1854401) (← links)
- Implicit induction in conditional theories (Q1891255) (← links)
- An improved general path order (Q1925013) (← links)
- Logicality of conditional rewrite systems (Q1978646) (← links)
- Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
- Shallow confluence of conditional term rewriting systems (Q2518609) (← links)
- Structures for abstract rewriting (Q2642463) (← links)
- Church-Rosser property for conditional rewriting systems with built-in predicates as premises (Q2782478) (← links)
- (Q4847002) (← links)
- Reachability in Conditional Term Rewriting Systems (Q4916227) (← links)
- Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems (Q4993358) (← links)
- Conditional rewrite rule systems with built-in arithmetic and induction (Q5055742) (← links)
- Equation solving in conditional AC-theories (Q5096202) (← links)
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths (Q5096206) (← links)
- Probabilistic logic over equations and domain restrictions (Q5377701) (← links)
- Combinations of simplifying conditional term rewriting systems (Q5881179) (← links)
- Sufficient conditions for modular termination of conditional term rewriting systems (Q5881180) (← links)
- Extended term rewriting systems (Q5881265) (← links)
- Proof by consistency in conditional equational theories (Q5881278) (← links)
- Confluence of the disjoint union of conditional term rewriting systems (Q5881285) (← links)
- Complete sets of reductions with constraints (Q6488546) (← links)
