Types for deadlock-free higher-order programs
DOI10.1007/978-3-319-19195-9_1zbMATH Open1347.68061OpenAlexW991226753MaRDI QIDQ2827445FDOQ2827445
Authors: Luca Padovani, Luca Novara 
Publication date: 19 October 2016
Published in: Formal Techniques for Distributed Objects, Components, and Systems (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01767327/file/978-3-319-19195-9_1_Chapter.pdf
Recommendations
Theory of programming languages (68N15) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (20)
- Type-Based Analysis of Deadlock for a Concurrent Calculus with Interrupts
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Hybrid Type System for Lock-Freedom of Mobile Processes
- Prioritise the best variation
- Towards static deadlock resolution in the \(\pi\)-calculus
- Comparing type systems for deadlock freedom
- Title not available (Why is that?)
- Type-safe higher-order channels in ML-like languages
- Comparing deadlock-free session typed processes
- Type-safe higher-order channels with channel locality
- Asynchronous session-based concurrency: deadlock-freedom in cyclic process networks
- Deadlock and lock freedom in the linear \(\pi\)-calculus
- Title not available (Why is that?)
- A New Type System for Deadlock-Free Processes
- Type and behaviour reconstruction for higher-order concurrent programs
- A type system for lock-free processes
- Type systems for concurrent programs.
- Fencing off Go: liveness and safety for channel-based programming
This page was built for publication: Types for deadlock-free higher-order programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2827445)
