Pages that link to "Item:Q3992231"

The following pages link to Nondeterministic algebraic specifications and nonconfluent term rewriting (Q3992231):

Displaying 20 items.

• A new generic scheme for functional logic programming with constraints (Q880985) (← links)
• Programming with narrowing: a tutorial (Q968524) (← links)
• Rewriting with a nondeterministic choice operator (Q1096383) (← links)
• Reasoning with first order nondeterministic specifications (Q1806174) (← links)
• A functorial semantics for multi-algebras and partial algebras, with applications to syntax. (Q1853456) (← links)
• Rasiowa-Sikorski deduction systems in computer science applications. (Q1853457) (← links)
• Evaluation strategies for functional logic programming (Q2456576) (← links)
• Improving the efficiency of non-deterministic computations (Q2841287) (← links)
• Inequational deduction as term graph rewriting (Q2843931) (← links)
• Semantic determinism and functional logic program properties (Q2864514) (← links)
• Lazy context cloning for non-deterministic graph rewriting (Q2867896) (← links)
• Equivalence of two formal semantics for functional logic programs (Q2867964) (← links)
• Transforming Functional Logic Programs into Monadic Functional Programs (Q3003513) (← links)
• A Hierarchy of Semantics for Non-deterministic Term Rewriting Systems ∗ (Q3165970) (← links)
• Compiling a Functional Logic Language: The Fair Scheme (Q3453653) (← links)
• Inductively Sequential Term-Graph Rewrite Systems (Q3540390) (← links)
• Functional Logic Programming: From Theory to Curry (Q4916076) (← links)
• A compiler for nondeterministic term rewriting systems (Q5055858) (← links)
• (Q5287526) (← links)
• Conditional rewriting logic: Deduction, models and concurrency (Q5881267) (← links)