Pages that link to "Item:Q5881171"
From MaRDI portal
The following pages link to Conditional Term Rewriting Systems (Q5881171):
Displaying 39 items.
- Algebraic semantics of rewriting terms and types (Q5881172) (← links)
- Context rewriting (Q5881173) (← links)
- Explicit cyclic substitutions (Q5881174) (← links)
- Simple type inference for term graph rewriting systems (Q5881175) (← links)
- Consistency and semantics of equational definitions over predefined algebras (Q5881176) (← links)
- Completeness of combinations of conditional constructor systems (Q5881177) (← links)
- Collapsed tree rewriting: Completeness, confluence, and modularity (Q5881178) (← links)
- Combinations of simplifying conditional term rewriting systems (Q5881179) (← links)
- Sufficient conditions for modular termination of conditional term rewriting systems (Q5881180) (← links)
- Termination of combined (rewrite and λ-calculus) systems (Q5881181) (← links)
- Type removal in term rewriting (Q5881182) (← links)
- Termination of term rewriting by interpretation (Q5881183) (← links)
- Path orderings for termination of associative-commutative rewriting (Q5881184) (← links)
- Generic induction proofs (Q5881185) (← links)
- A constructor-based approach for positive/negative-conditional equational specifications (Q5881186) (← links)
- Semantics for positive/negative conditional rewrite systems (Q5881187) (← links)
- Inductive theorem proving by consistency for first-order clauses (Q5881188) (← links)
- Reduction techniques for first-order reasoning (Q5881189) (← links)
- Conditional term rewriting and first-order theorem proving (Q5881190) (← links)
- Decidability of regularity and related properties of ground normal form languages (Q5881191) (← links)
- Computing linearizations using test sets (Q5881192) (← links)
- Proving group isomorphism theorems (Q5881193) (← 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)
- Trace rewriting systems (Q5881198) (← links)
- A calculus for conditional inductive theorem proving (Q5881199) (← links)
- Implementing contextual rewriting (Q5881200) (← links)
- Confluence of terminating membership conditional TRS (Q5881201) (← links)
- Completeness and confluence of order-sorted term rewriting (Q5881203) (← links)
- Completion for constrained term rewriting systems (Q5881204) (← links)
- Generalized partial computation using disunification to solve constraints (Q5881205) (← links)
- Termination proofs of well-moded logic programs via conditional rewrite systems (Q5881206) (← links)
- Logic programs with polymorphic types: A condition for static type checking (Q5881208) (← 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)
- An optimal narrowing strategy for general canonical systems (Q5881212) (← links)
- Set-of-support strategy for higher-order logic (Q5881215) (← links)