Pages that link to "Item:Q1111368"

The following pages link to Conditional rewrite rules: Confluence and termination (Q1111368):

Displaying 13 items.

• Dependency pairs for proving termination properties of conditional term rewriting systems (Q347382) (← links)
• Levels of undecidability in rewriting (Q627134) (← links)
• A combinatory logic approach to higher-order E-unification (Q673971) (← links)
• Strict coherence of conditional rewriting modulo axioms (Q683741) (← links)
• Normal forms and normal theories in conditional rewriting (Q730473) (← links)
• A completion procedure for conditional equations (Q758211) (← links)
• On the confluence of lambda-calculus with conditional rewriting (Q987976) (← links)
• Operational termination of conditional term rewriting systems (Q1041807) (← links)
• Deductive and inductive synthesis of equational programs (Q1322836) (← links)
• Incremental constraint satisfaction for equational logic programming (Q1367535) (← links)
• The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors (Q1635507) (← links)
• Rewriting systems over similarity and generalized pseudometric spaces and their properties (Q1677217) (← links)
• Reversible computation in term rewriting (Q1683707) (← links)