Types for Deadlock-Free Higher-Order Programs

Type systems for communicating processes are typically studied using abstract models – e.g., process algebras – that distill the communication behavior of programs but overlook their structure in terms of functions, methods, objects, modules. It is not always obvious how to apply these type systems to structured programming languages. In this work we port a recently developed type system that ensures deadlock freedom in the π-calculus to a higher-order language.

[1]  Luca Padovani,et al.  Types for Deadlock-Free Higher-Order Concurrent Programs , 2014 .

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

[3]  Kohei Honda,et al.  Types for Dyadic Interaction , 1993, CONCUR.

[4]  Luca Padovani.  Type Reconstruction for the Linear π-Calculus with Composite and Equi-Recursive Types , 2014, FoSSaCS.

[5]  Philip Wadler.  Propositions as sessions , 2012, ICFP '12.

[6]  Naoki Kobayashi.  A type system for lock-free processes , 2002 .

[7]  Luca Padovani,et al.  Polymorphic Types for Leak Detection in a Session-Oriented Functional Language , 2013, FMOODS/FORTE.

[8]  Fabrizio Montesi,et al.  Progress as Compositional Lock-Freedom , 2014, COORDINATION.

[9]  Flemming Nielson,et al.  Type and effect systems - behaviours for concurrency , 1999 .

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

[11]  Benjamin C. Pierce,et al.  Linearity and the pi-calculus , 1999, TOPL.

[12]  Luca Padovani,et al.  Type Reconstruction Algorithms for Deadlock-Free and Lock-Free Linear π-Calculi , 2015, COORDINATION.

[13]  B. Courcelle.  Fundamental properties of infinite trees , 1983 .

[14]  Luca Padovani,et al.  Deadlock and lock freedom in the linear π-calculus , 2014, CSL-LICS.

[15]  Naoki Kobayashi,et al.  A New Type System for Deadlock-Free Processes , 2006, CONCUR.

[16]  Vasco Thudichum Vasconcelos,et al.  Language Primitives and Type Discipline for Structured Communication-Based Programming Revisited: Two Systems for Higher-Order Session Communication , 1998, SecReT@ICALP.