concurrency modeling 1cut elimination 1hierarchical graph rewriting 1multiplicative exponential linear logic 1proof nets 1
From the 1 of 2 linked papers with an AI index.
1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.PL2026★ 1 cited
Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination
Kento Takyu, Kazunori Ueda
The paper extends the LMNtal declarative language for hierarchical graph rewriting to support operations on promotion boxes from MELL proof nets, enabling implementation of cut eli…
cs.PL2024
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…