Types for Deadlock-Free Higher-Order Concurrent Programs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2014

Types for Deadlock-Free Higher-Order Concurrent Programs

Luca Novara
  • Function : Author
  • PersonId : 953465


Deadlock freedom is for concurrent programs what progress is for sequential ones: it indicates the absence of stable (i.e., irreducible) states in which some pending operations cannot be completed. In the particular case of communicating processes, operations are inputs and outputs on channels and deadlocks may be caused by mutual dependencies between communications. In this work we define an effect system ensuring deadlock freedom of higher-order programs that communicate over linear channels and study its integration with polymorphic and recursive types.
Fichier principal
Vignette du fichier
PadovaniNovara14.pdf (337.15 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00954364 , version 1 (01-03-2014)


  • HAL Id : hal-00954364 , version 1


Luca Padovani, Luca Novara. Types for Deadlock-Free Higher-Order Concurrent Programs. 2014. ⟨hal-00954364⟩
132 View
156 Download


Gmail Facebook X LinkedIn More