Pages that link to "Item:Q5881262"
From MaRDI portal
The following pages link to Conditional and Typed Rewriting Systems (Q5881262):
Displaying 37 items.
- Conditional rewriting in focus (Q5881263) (← links)
- A maximal-literal unit strategy for horn clauses (Q5881264) (← links)
- Extended term rewriting systems (Q5881265) (← links)
- A proof system for conditional algebraic specifications (Q5881266) (← links)
- Conditional rewriting logic: Deduction, models and concurrency (Q5881267) (← links)
- Equivalences of rewrite programs (Q5881268) (← links)
- On finite representations of infinite sequences of terms (Q5881270) (← links)
- Infinite terms and infinite rewritings (Q5881271) (← links)
- Testing confluence of nonterminating rewriting systems (Q5881272) (← links)
- A survey of ordinal interpretations of type ɛ0 for termination of rewriting systems (Q5881273) (← links)
- Meta-rule synthesis from crossed rewrite systems (Q5881274) (← links)
- An application of automated equational reasoning to many-valued logic (Q5881275) (← links)
- Completion of first-order clauses with equality by strict superposition (Q5881276) (← links)
- Knuth-bendix completion of horn clause programs for restricted linear resolution and paramodulation (Q5881277) (← links)
- Proof by consistency in conditional equational theories (Q5881278) (← links)
- Completion procedures as semidecision procedures (Q5881279) (← links)
- Linear completion (Q5881280) (← links)
- Clausal rewriting (Q5881281) (← links)
- Adding algebraic rewriting to the calculus of constructions : Strong normalization preserved (Q5881282) (← links)
- On sufficient completeness of conditional specifications (Q5881283) (← links)
- FPL : Functional plus logic programming an integration of the FP and Prolog languages (Q5881284) (← links)
- Confluence of the disjoint union of conditional term rewriting systems (Q5881285) (← links)
- Implementing term rewriting by graph reduction: Termination of combined systems (Q5881286) (← links)
- Compiling concurrent rewriting onto the Rewrite Rule Machine (Q5881288) (← links)
- Design strategies for rewrite rules (Q5881289) (← links)
- A simplifier for untyped lambda expressions (Q5881291) (← links)
- Parallel graph rewriting on loosely coupled machine architectures (Q5881294) (← links)
- Typed equivalence, type assignment, and type containment (Q5881295) (← links)
- A fixed-point semantics for feature type systems (Q5881298) (← links)
- Unique-sort order-sorted theories : A description as monad morphisms (Q5881299) (← links)
- Equational logics (birkhoff's method revisited) (Q5881300) (← links)
- Compatibility of order-sorted rewrite rules (Q5881301) (← links)
- An universal termination condition for solving goals in equational languages (Q5881302) (← links)
- Constrained equational deduction (Q5881303) (← links)
- Higher-order unification, polymorphism, and subsorts (Q5881304) (← links)
- Second-order unification in the presence of linear shallow algebraic equations (Q5881305) (← links)
- An inference system for horn clause logic with equality (Q5881306) (← links)
