Detail

Reasoning Techniques for Higher-Order Session Processes

Characterizing contextual equivalence is a long-standing issue for higher-order (process) languages. In the setting of a higher-order ?-calculus with sessions, in this talk I will present characteristic bisimilarity, a typed bisimilarity which fully characterizes contextual equivalence.
To our knowledge, ours is the first characterization of its kind.
Using simple values inhabiting session types, our approach distinguishes from untyped methods for characterising contextual equivalence in higher-order processes: we show that observing as inputs only a precise finite set of higher-order values suffices to reason about higher-order session processes.