Introducing quantification into a hierarchical graph rewriting language

DOI10.1007/978-3-031-71294-4_13MaRDI QIDQ7013533zbMATH OpenFDO

Authors Haruto Mishina, Kazunori Ueda

Publication date 12 March 2025

Full work available at URL https://doi.org/10.1007/978-3-031-71294-4_13

zbMATH Keywords

graph rewritinglanguage designquantification

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of programming languages (68N15) Grammars and rewriting systems (68Q42)

Cites work

• A strategy language for graph rewriting
• GrGen: A Fast SPO-Based Graph Rewriting Tool
• scientific article; zbMATH DE number 4030948 (Why is no real title available?)
• scientific article; zbMATH DE number 1302043 (Why is no real title available?)
• Implementing the \(\lambda_{GT}\) language: a functional language with graphs as first-class data
• LMNtal as a hierarchical logic programming language
• The model transformation language of the VIATRA2 framework
• Theory and practice of constraint handling rules

This page was built for publication: Introducing quantification into a hierarchical graph rewriting language

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