Adaptive lock-free data structures in Haskell

a general method for concurrent implementation swapping

conference
Authors
Affiliation

Chao-Hong Chen

Indiana University, USA

Vikraman Choudhury

Indiana University, USA

Ryan R. Newton

Indiana University, USA

Published

September 7, 2017

Doi

10.1145/3122955.3122973

Back to top

Citation

BibTeX citation:
@inproceedings{chen2017,
  author = {Chen, Chao-Hong and Choudhury, Vikraman and R. Newton, Ryan},
  title = {Adaptive Lock-Free Data Structures in {Haskell}},
  booktitle = {Proceedings of the 10th ACM SIGPLAN International
    Symposium on Haskell, Oxford, United Kingdom, September 7-8, 2017},
  date = {2017},
  url = {https://doi.org/10.1145/3122955.3122973},
  doi = {10.1145/3122955.3122973},
  langid = {en}
}
For attribution, please cite this work as:
Chen, Chao-Hong, Vikraman Choudhury, and Ryan R. Newton. 2017. “Adaptive Lock-Free Data Structures in Haskell.” Proceedings of the 10th ACM SIGPLAN International Symposium on Haskell, Oxford, United Kingdom, September 7-8, 2017, accepted. https://doi.org/10.1145/3122955.3122973.