%0 Conference Proceedings
%T Types for Deadlock-Free Higher-Order Programs
%+ Università degli studi di Torino = University of Turin (UNITO)
%A Padovani, Luca
%A Novara, Luca
%Z Part 1: Ensuring Properties of Distributed Systems
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 35th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE)
%C Grenoble, France
%Y Susanne Graf
%Y Mahesh Viswanathan
%I Springer International Publishing
%3 Formal Techniques for Distributed Objects, Components, and Systems
%V LNCS-9039
%P 3-18
%8 2015-06-02
%D 2015
%R 10.1007/978-3-319-19195-9_1
%K Type System
%K Parallel Composition
%K Side Condition
%K Typing Rule
%K Level Polymorphism
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01767327/document
%2 https://inria.hal.science/hal-01767327/file/978-3-319-19195-9_1_Chapter.pdf
%L hal-01767327
%U https://inria.hal.science/hal-01767327
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-FORTE
%~ IFIP-LNCS-9039