Lazy narrowing with simplification
From MaRDI portal
Recommendations
- Uniform Lazy Narrowing
- Lazy narrowing: strong completeness and eager variable elimination
- scientific article; zbMATH DE number 512891
- Simplifying reductions
- scientific article; zbMATH DE number 512892
- Reducing the complexity of reductions
- scientific article; zbMATH DE number 1559593
- A complete selection function for lazy conditional narrowing
- Kleene getting lazy
- On reducing the search space of higher-order lazy narrowing
Cited in
(20)- Evaluation strategies for functional logic programming
- An evaluation semantics for narrowing-based functional logic languages
- Implementing encapsulated search for a lazy functional logic language
- A transformation system for lazy functional logic programs
- A semantics for program analysis in narrowing-based functional logic languages
- Evaluation strategies for functional logic programming
- Reduction strategies for declarative programming
- A needed narrowing strategy
- scientific article; zbMATH DE number 512891 (Why is no real title available?)
- scientific article; zbMATH DE number 512892 (Why is no real title available?)
- scientific article; zbMATH DE number 515736 (Why is no real title available?)
- Uniform Lazy Narrowing
- scientific article; zbMATH DE number 1502127 (Why is no real title available?)
- scientific article; zbMATH DE number 1822269 (Why is no real title available?)
- scientific article; zbMATH DE number 826303 (Why is no real title available?)
- Solving equations by graph transformation
- scientific article; zbMATH DE number 1407673 (Why is no real title available?)
- Lazy narrowing in a graph machine
- Variant narrowing and equational unification
- Kleene getting lazy
This page was built for publication: Lazy narrowing with simplification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4395684)