Blogs (28) >>
ICFP 2017
Sun 3 - Sat 9 September 2017 Oxford, United Kingdom
Wed 6 Sep 2017 13:45 - 14:07 at L1 - Contracts and Sessions Chair(s): Matthew Flatt

Session-typed languages building on the Curry-Howard isomorphism between linear logic and session-typed communication guarantee session fidelity and deadlock freedom. Unfortunately, these strong guarantees exclude many naturally occurring programming patterns pertaining to shared resources. In this paper, we introduce sharing into a session-typed language where types are stratified into linear and shared layers with modal operators connecting the layers. The resulting language retains session fidelity but not the absence of deadlocks, which can arise from contention for shared processes. We illustrate our language on various examples, such as the dining philosophers problem, and provide a translation of the untyped asynchronous $\pi$-calculus into our language.

Wed 6 Sep

icfp-2017-papers
13:00 - 14:30: Research Papers - Contracts and Sessions at L1
Chair(s): Matthew FlattUniversity of Utah
icfp-2017-papers150469560000013:00 - 13:22
Talk
Hernan MelgrattiUniversity of Buenos Aires, Argentina, Luca PadovaniUniversity of Turin, Italy
DOI
icfp-2017-papers150469695000013:22 - 13:45
Talk
Lucas WayeHarvard University, USA, Christos DimoulasHarvard University, USA, Stephen ChongHarvard University, USA
DOI
icfp-2017-papers150469830000013:45 - 14:07
Talk
Stephanie BalzerCarnegie Mellon University, USA, Frank PfenningCarnegie Mellon University, USA
DOI
icfp-2017-papers150469965000014:07 - 14:30
Talk
Atsushi IgarashiKyoto University, Japan, Peter ThiemannUniversity of Freiburg, Germany, Vasco VasconcelosUniversity of Lisbon, Portugal, Philip WadlerUniversity of Edinburgh, UK
DOI