Pages that link to "Item:Q3992231"
From MaRDI portal
The following pages link to Nondeterministic algebraic specifications and nonconfluent term rewriting (Q3992231):
Displayed 14 items.
- A new generic scheme for functional logic programming with constraints (Q880985) (← links)
- Programming with narrowing: a tutorial (Q968524) (← 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 Computations1 1Supported in part by NSF grants INT-9981317 and CCR-0110496 and by the Spanish Knowledge Society Foundation, the Spanish Research Funding Agency (CICYT) TIC 2001-2705-C03-01, by Acción Integrad (Q2841287) (← 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)
- 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)
- Conditional rewriting logic: Deduction, models and concurrency (Q5881267) (← links)