Complete strategies for term graph narrowing

DOI10.1007/3-540-48483-3_11MaRDI QIDQ4941932zbMATH OpenFDO

Authors Detlef Plump, Annegret Habel

Publication date 12 March 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48483-3_11

zbMATH Keywords

narrowingterm rewriting systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 969074
• Narrowing directed by a graph of terms
• Solving equations by graph transformation
• Completeness results for basic narrowing
• scientific article; zbMATH DE number 1231490

Cited in

(14)

• Completeness results for basic narrowing
• Folding variant narrowing and optimal variant termination
• Narrowing Data-Structures with Pointers
• scientific article; zbMATH DE number 4041327 (Why is no real title available?)
• scientific article; zbMATH DE number 4053009 (Why is no real title available?)
• scientific article; zbMATH DE number 1231490 (Why is no real title available?)
• GETGRATS: a summary of scientific results (with annotated bibliography)
• Solving equations by graph transformation
• scientific article; zbMATH DE number 1420819 (Why is no real title available?)
• Narrowing directed by a graph of terms
• Lazy narrowing: strong completeness and eager variable elimination (extended abstract)
• scientific article; zbMATH DE number 969074 (Why is no real title available?)
• A rule-based procedure for graph query solving
• On completeness of narrowing strategies

This page was built for publication: Complete strategies for term graph narrowing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4941932)