Pages that link to "Item:Q1264462"
From MaRDI portal
The following pages link to A deterministic lazy narrowing calculus (Q1264462):
Displaying 10 items.
- Lazy narrowing: strong completeness and eager variable elimination (Q671677) (← links)
- Ensuring the quasi-termination of needed narrowing computations (Q845935) (← links)
- The unification problem for confluent right-ground term rewriting systems. (Q1401934) (← links)
- Evaluation strategies for functional logic programming (Q2456576) (← links)
- A Locally Nameless Representation for a Natural Semantics for Lazy Evaluation (Q2915102) (← links)
- A Finite Representation of the Narrowing Space (Q3453648) (← links)
- Aliasing Control in an Imperative Pure Calculus (Q3460909) (← links)
- Solving Equations by Graph Transformation (Q4923538) (← links)
- Optimization by non-deterministic, lazy rewriting (Q5055730) (← links)
- Constraint functional logic programming over finite domains (Q5309079) (← links)