Conc-Trees for Functional and Parallel Programming

  title={Conc-Trees for Functional and Parallel Programming},
  author={Aleksandar Prokopec and Martin Odersky},
Expressing parallel algorithms as functional programs has been a longstanding goal. This task is made easier through the use of proper sequence data structures, which allow splitting the data structure between the processors as easily as concatenating several data structures together. Efficient update, split and concatenation operations are essential for declarative-style parallel programs. This paper introduces the persistent Conc-tree data structure, along with several variants. The Conc-tree… CONTINUE READING