In prior work we proposed an interpretation of intuitionistic linear logic propositions as session types for concurrent processes. The type system obtained from the interpretation ensures fundamental properties of session-based typed disciplines—most notably, type preservation, session fidelity, and global progress. In this paper, we complement and strengthen these results by developing a theory of logical relations. Our development is based on, and is remarkably similar to, that for functional languages, extended to an (intuitionistic) linear type structure. A main result is that well-typed processes always terminate (strong normalization). We also introduce a notion of observational equivalence for session-typed processes. As applications, we prove that all proof conversions induced by the logic interpretation actually express observational equivalences, and explain how type isomorphisms resulting from linear logic equivalences are realized by coercions between interface types of session-based concurrent systems.
|Title of host publication||Lecture Notes in Computer Science|
|Publication status||Published - 1 Jan 2012|
|Event||21st European Symposium on Programming (ESOP) held as Part of the 15th European Joint Conferences on Theory and Practice of Software (ETAPS) - |
Duration: 1 Jan 2012 → …
|Conference||21st European Symposium on Programming (ESOP) held as Part of the 15th European Joint Conferences on Theory and Practice of Software (ETAPS)|
|Period||1/01/12 → …|
Pérez, J. A., Caires, L. M. M. D. C., Pfenning, F., & Toninho, B. (2012). Linear Logical Relations for Session-Based Concurrency. In Lecture Notes in Computer Science (pp. 539-558) https://doi.org/10.1007/978-3-642-28869-2_27