Skip to Main content Skip to Navigation
Conference papers

Types for Deadlock-Free Higher-Order Programs

Abstract : 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.
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-01767327
Contributor : Hal Ifip <>
Submitted on : Monday, April 16, 2018 - 10:18:45 AM
Last modification on : Monday, April 16, 2018 - 10:20:26 AM

File

978-3-319-19195-9_1_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

92

Files downloads

218