Narrowing directed by a graph of terms
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3871334 (Why is no real title available?)
- scientific article; zbMATH DE number 3945331 (Why is no real title available?)
- scientific article; zbMATH DE number 4022666 (Why is no real title available?)
- scientific article; zbMATH DE number 4041327 (Why is no real title available?)
- scientific article; zbMATH DE number 4090847 (Why is no real title available?)
- scientific article; zbMATH DE number 3688776 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- Narrowing directed by a graph of terms
Cited in
(17)- Termination of narrowing revisited
- Enumerating outer narrowing derivations for constructor-based term rewriting systems
- Basic narrowing revisited
- Enhancing top-down solving with widening and narrowing
- scientific article; zbMATH DE number 4041327 (Why is no real title available?)
- An implementation of narrowing
- scientific article; zbMATH DE number 512906 (Why is no real title available?)
- scientific article; zbMATH DE number 1761888 (Why is no real title available?)
- Solving equations by graph transformation
- scientific article; zbMATH DE number 1418369 (Why is no real title available?)
- Narrowing directed by a graph of terms
- On the connection between narrowing and proof by consistency
- scientific article; zbMATH DE number 969074 (Why is no real title available?)
- Termination of Narrowing in Left-Linear Constructor Systems
- An optimal narrowing strategy for general canonical systems
- A compositional semantic basis for the analysis of equational Horn programs
- Loop detection in term rewriting using the eliminating unfoldings
This page was built for publication: Narrowing directed by a graph of terms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055753)