Pages that link to "Item:Q915429"

The following pages link to A rationale for conditional equational programming (Q915429):

Displaying 31 items.

• Dependency pairs for proving termination properties of conditional term rewriting systems (Q347382) (← links)
• A new generic scheme for functional logic programming with constraints (Q880985) (← links)
• On the confluence of lambda-calculus with conditional rewriting (Q987976) (← links)
• Operational termination of conditional term rewriting systems (Q1041807) (← links)
• Conditional narrowing modulo a set of equations (Q1261194) (← links)
• Completeness results for basic narrowing (Q1328184) (← links)
• Incremental constraint satisfaction for equational logic programming (Q1367535) (← links)
• Abstract data type systems (Q1391729) (← 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)
• Automata-driven automated induction (Q1854445) (← links)
• Elimination of conditions (Q1974693) (← links)
• Specification and proof in membership equational logic (Q1978640) (← links)
• Logicality of conditional rewrite systems (Q1978646) (← links)
• Structures for abstract rewriting (Q2642463) (← links)
• (Q2980968) (← links)
• R n - and G n -logics (Q4645806) (← links)
• Term rewriting systems with sort priorities (Q4876348) (← links)
• Termination proofs and the length of derivations (Q5055719) (← links)
• Open problems in rewriting (Q5055780) (← links)
• More problems in rewriting (Q5055812) (← links)
• Level-confluence of conditional rewrite systems with extra variables in right-hand sides (Q5055830) (← links)
• Problems in rewriting III (Q5055847) (← links)
• Higher order conditional rewriting and narrowing (Q5096313) (← links)
• Sufficient conditions for modular termination of conditional term rewriting systems (Q5881180) (← links)
• Termination of combined (rewrite and λ-calculus) systems (Q5881181) (← links)
• Semantics for positive/negative conditional rewrite systems (Q5881187) (← links)
• A maximal-literal unit strategy for horn clauses (Q5881264) (← links)
• Extended term rewriting systems (Q5881265) (← links)
• Conditional rewriting logic: Deduction, models and concurrency (Q5881267) (← links)
• Local confluence of conditional and generalized term rewriting systems (Q6151615) (← links)