Lock Free Data Structures Using STM in Haskell

DOI10.1007/11737414_6MaRDI QIDQ3434626zbMATH OpenOpenAlexFDO

Authors Anthony Discolo, Tim Harris, Simon Marlow, Satnam Singh, Simon Peyton-Jones

Publication date 2 May 2007

Published in Functional and Logic Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Data structures (68P05)

Recommendations

• Derivable partial locking for algebraic data types
• Adaptive lock-free maps: purely-functional to scalable
• Formal verification of a lock-free stack with hazard pointers
• Correctness of an STM Haskell implementation
• Analyzing the performance of lock-free data structures: a conflict-based model

Cited in

(3)

• Study on multi-core data structure in shared-memory
• scientific article; zbMATH DE number 1859707 (Why is no real title available?)
• Derivable partial locking for algebraic data types

Describes a project that uses

Uses Software

• Haskell

This page was built for publication: Lock Free Data Structures Using STM in Haskell

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