works on
concurrency modeling 1cut elimination 1hierarchical graph rewriting 1multiplicative exponential linear logic 1proof nets 1

From the 1 of 1 linked paper with an AI index.

most citedEnhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

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…