Minimal translations from synchronous communication to synchronizing locks

DOI10.4204/EPTCS.339.7MaRDI QIDQ6643748

Manfred Schmidt-Schauß, David Sabel

Publication date: 26 November 2024

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Title not available (Why is that?)
• A concurrent lambda calculus with futures
• Fair testing
• Closures of may-, should- and must-convergences for contextual equivalence
• A calculus of mobile processes. I
• Towards a unified approach to encodability and separation results for process calculi
• Observational program calculi and the correctness of translations
• The \(\pi\)-calculus: A theory of mobile processes
• A concurrent ML library in concurrent Haskell
• Conservative Concurrency in Haskell
• A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
• Events in Haskell, and how to implement them
• Stronger Validity Criteria for Encoding Synchrony
• Comparing the expressive power of the synchronous and asynchronous \(\pi\)-calculi

This page was built for publication: Minimal translations from synchronous communication to synchronizing locks

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