Types for Deadlock-Free Higher-Order Programs

DOI10.1007/978-3-319-19195-9_1zbMATH Open1347.68061OpenAlexW991226753MaRDI QIDQ2827445FDOQ2827445

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

Mathematics Subject Classification ID

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 (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Prioritise the best variation
• Title not available (Why is that?)
• Asynchronous session-based concurrency: deadlock-freedom in cyclic process networks
• Type and behaviour reconstruction for higher-order concurrent programs
• A type system for lock-free processes

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)