Springer, Lecture Notes in Computer Science, p. 39-56, 2020
DOI: 10.1007/978-3-030-45237-7_3
Full text: Unavailable
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.