Advertisement
Published in:
2015 | OriginalPaper | Chapter
Types for Deadlock-Free Higher-Order Programs
Authors : Luca Padovani, Luca Novara
Published in: Formal Techniques for Distributed Objects, Components, and Systems
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.