Types for Deadlock-Free Higher-Order Programs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Types for Deadlock-Free Higher-Order Programs

Résumé

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.
Fichier principal
Vignette du fichier
978-3-319-19195-9_1_Chapter.pdf (219.9 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01767327 , version 1 (16-04-2018)

Licence

Paternité

Identifiants

Citer

Luca Padovani, Luca Novara. Types for Deadlock-Free Higher-Order Programs. 35th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2015, Grenoble, France. pp.3-18, ⟨10.1007/978-3-319-19195-9_1⟩. ⟨hal-01767327⟩
32 Consultations
96 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More