2 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.PL2024★ 1 cited
Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination
Kento Takyu, Kazunori Ueda
Hierarchical graph rewriting is a highly expressive computational formalism that manipulates graphs enhanced with box structures for representing hierarchies. It has provided the f…
cs.PL2024★ 2 cited
Introducing Quantification into a Hierarchical Graph Rewriting Language
Haruto Mishina, Kazunori Ueda
LMNtal is a programming and modeling language based on hierarchical graph rewriting that uses logical variables to represent connectivity and membranes to represent hierarchy. On t…