Abstract
AbstractWe present an algorithm to decide the equivalence of context-free session types, practical to the point of being incorporated in a compiler. We prove its soundness and completeness. We further evaluate its behaviour in practice. In the process, we introduce an algorithm to decide the bisimilarity of simple grammars.
Publisher
Springer International Publishing
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Parametric Subtyping for Structural Parametric Polymorphism;Proceedings of the ACM on Programming Languages;2024-01-05
2. Parameterized Algebraic Protocols;Proceedings of the ACM on Programming Languages;2023-06-06
3. System $$F^\mu _\omega $$ with Context-free Session Types;Programming Languages and Systems;2023
4. Polymorphic lambda calculus with context-free session types;Information and Computation;2022-11
5. Nested Session Types;ACM Transactions on Programming Languages and Systems;2022-07-15