Concurrency combinators for declarative synchronization

DOI10.1007/978-3-540-30477-7_11MaRDI QIDQ5464036zbMATH OpenOpenAlexFDO

Authors Paweł T. Wojciechowski

Publication date 17 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b102225

Mathematics Subject Classification ID

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

Recommendations

• Support for implementation of evolutionary concurrent systems
• scientific article; zbMATH DE number 3956417
• Programming Languages and Systems
• Separation logic and concurrency
• scientific article; zbMATH DE number 3958701

Cited in

(6)

• scientific article; zbMATH DE number 17816 (Why is no real title available?)
• Unifying Semantics for Concurrent Programming
• UTCP: Compositional Semantics for Shared-Variable Concurrency
• scientific article; zbMATH DE number 6316140 (Why is no real title available?)
• Imperative streams—a monadic combinator library for synchronous programming
• Composable scheduler activations for Haskell

This page was built for publication: Concurrency combinators for declarative synchronization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464036)