Conservative concurrency in Haskell

DOI10.1109/LICS.2012.66MaRDI QIDQ2986833zbMATH OpenOpenAlexFDO

Authors David Sabel, Manfred Schmidt-Schauß

Publication date 16 May 2017

Published in 2012 27th Annual IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL http://dl.acm.org/citation.cfm?id=2359541

zbMATH Keywords

concurrencycontextual equivalencefunctional programmingHaskellsemantics

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) 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)

Recommendations

• A concurrent lambda calculus with futures
• Frontiers of Combining Systems
• Correctness of an STM Haskell implementation
• A poor man's concurrency monad
• Modelling deterministic concurrent I/O

Cited in

(10)

• Observational program calculi and the correctness of translations
• A concurrent ML library in concurrent Haskell
• scientific article; zbMATH DE number 7453965 (Why is no real title available?)
• Rewriting with generalized nominal unification
• Structural rewriting in the pi-calculus
• Contextual equivalences in call-by-need and call-by-name polymorphically typed calculi (preliminary report)
• Observing success in the pi-calculus
• Reversible session-based concurrency in Haskell
• Minimal translations from synchronous communication to synchronizing locks
• A concurrent lambda calculus with futures

Describes a project that uses

Uses Software

• Haskell

This page was built for publication: Conservative concurrency in Haskell

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