Relational treatment of term graphs with bound variables

DOI10.1093/JIGPAL/6.2.259zbMATH Open0892.68051OpenAlexW2048380469MaRDI QIDQ4383702FDOQ4383702

Authors Wolfram Kahl

Publication date 27 July 1998

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/975e66c34918430eb1052bce9015b5eb535b829d

zbMATH Keywords

term graphsrelational matching

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• A flexible categorial formalisation of term graphs as directed hypergraphs
• scientific article; zbMATH DE number 1231490
• scientific article; zbMATH DE number 919844
• Essentials of term graph rewriting
• A Term-Graph Syntax for Algebras over Multisets

Cited in

(6)

• A flexible categorial formalisation of term graphs as directed hypergraphs
• On a Graph Calculus for Algebras of Relations
• Relational matching for graphical calculi of relations
• Bound graph polysemy
• Positive Fork Graph Calculus
• Nested term graphs (work in progress)

This page was built for publication: Relational treatment of term graphs with bound variables

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