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.
Padovani, L., Novara, L. (2015). Types for Deadlock-Free Higher-Order Programs. DEU : Springer [10.1007/978-3-319-19195-9_1].
Types for Deadlock-Free Higher-Order Programs
PADOVANI, Luca;
2015
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.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
