Balanced trees inhabiting functional parallel programming

DOI10.1145/2034773.2034791MaRDI QIDQ5176968zbMATH OpenOpenAlexFDO

Authors Akimasa Morihata, Kiminori Matsuzaki

Publication date 5 March 2015

Published in Proceedings of the 16th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2034773.2034791

zbMATH Keywords

parametric polymorphismequational reasoningbalanced treedivide-and-conquer parallelism

Mathematics Subject Classification ID

Data structures (68P05) Functional programming and lambda calculus (68N18) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• The third homomorphism theorem on trees: downward \& upward lead to divide-and-conquer
• Parallel implementation of tree skeletons
• Parallel programming with data structures and higher order functions
• Massive parallelization of divide-and-conquer algorithms over powerlists
• Derivation of a parallel algorithm for balancing binary trees

Cited in

(3)

• The third homomorphism theorem on trees: downward \& upward lead to divide-and-conquer
• Derivation of a parallel algorithm for balancing binary trees
• Lambda calculus with algebraic simplification for reduction parallelisation: extended study

This page was built for publication: Balanced trees inhabiting functional parallel programming

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