Single-exponential algorithm for simple grammar bisimilarity yields first polynomial-time equivalence check for context-free session types via linear-valuation conversion.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Simple grammar bisimilarity, with an application to session type equivalence
Single-exponential algorithm for simple grammar bisimilarity yields first polynomial-time equivalence check for context-free session types via linear-valuation conversion.