2020/08/31 by Ryan Kavanagh · 1 citation
Computer Science · #cs.PL
paper · pdf · doi:10.4204/eptcs.322.7
published as EPTCS 322, 2020, pp. 69-87 · In Proceedings EXPRESS/SOS 2020, arXiv:2008.12414
arxiv created 2020/08/31 · arxiv updated 2020/09/01
Session-types specify communication protocols for communicating processes, and session-typed languages are often specified using substructural operational semantics given by multiset rewriting systems. We give an observed communication semantics for a session-typed language with recursion, where a process's observation is given by its external communications. To do so, we introduce fair executions for multiset rewriting systems, and extract observed communications from fair process executions. This semantics induces an intuitively reasonable notion of observational equivalence that we conjecture coincides with semantic equivalences induced by denotational semantics, bisimulations, and barbed congruences for these languages.