Single-exponential algorithm for simple grammar bisimilarity yields first polynomial-time equivalence check for context-free session types via linear-valuation conversion.
In 21st ACM SIGPLAN International Conference on Functional Programming (ICFP)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Extends logical relations to recursive session types for PSNI, proves soundness/completeness via biorthogonality with observation-index stratification, and gives an IFC refinement type system with secrecy polymorphism.
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.
-
Logical Relations for Session-Typed Concurrency
Extends logical relations to recursive session types for PSNI, proves soundness/completeness via biorthogonality with observation-index stratification, and gives an IFC refinement type system with secrecy polymorphism.