Sessions as Propositions

Recently, Wadler presented a continuation-passing translation from a session-typed functional language, GV, to a process calculus based on classical linear logic, CP. However, this translation is one-way: CP is more expressive than GV. We propose an extension of GV, called HGV, and give translations showing that it is as expressive as CP. The new translations shed light both on the original translation from GV to CP, and on the limitations in expressiveness of GV.

[1]  Vasco Thudichum Vasconcelos,et al.  Linear type theory for asynchronous session types , 2009, Journal of Functional Programming.

[2]  Philip Wadler.  Propositions as sessions , 2014, J. Funct. Program..

[3]  M. Nivat.  Fiftieth volume of theoretical computer science , 1988 .

[4]  Samson Abramsky,et al.  Proofs as Processes , 1992, Theor. Comput. Sci..

[5]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[6]  Frank Pfenning,et al.  Session Types as Intuitionistic Linear Propositions , 2010, CONCUR.

[7]  Gianluigi Bellin,et al.  On the pi-Calculus and Linear Logic , 1992, Theor. Comput. Sci..

[8]  Matthias Felleisen,et al.  On the Expressive Power of Programming Languages , 1990, European Symposium on Programming.

[9]  Davide Sangiorgi,et al.  Session types revisited , 2012, PPDP.