Static and dynamic processor allocation for higher-order concurrent languages

DOI10.1007/3-540-59293-8_222zbMath1496.68113OpenAlexW1568982134MaRDI QIDQ5096756

Flemming Nielson, Hanne Riis Nielson

Publication date: 18 August 2022

Published in: TAPSOFT '95: Theory and Practice of Software Development (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59293-8_222

Mathematics Subject Classification ID

Theory of programming languages (68N15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Type reconstruction for linear \(\pi\)-calculus with I/O subtyping.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Data flow analysis of distributed communicating processes
• Program derivation by fixed point computation
• Type and behaviour reconstruction for higher-order concurrent programs
• Constraints for polymorphic behaviours of concurrent ML

This page was built for publication: Static and dynamic processor allocation for higher-order concurrent languages