The third homomorphism theorem on trees: downward \& upward lead to divide-and-conquer

DOI10.1145/1480881.1480905MaRDI QIDQ5261516zbMATH OpenOpenAlexFDO

Authors Akimasa Morihata, Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi

Publication date 3 July 2015

Published in Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

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

zbMATH Keywords

divide-and-conquerpolynomial data structuresthird homomorphism theoremHuet's zippers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Nonnumerical algorithms (68W05) Functional programming and lambda calculus (68N18) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• A short cut to parallelization theorems
• Balanced trees inhabiting functional parallel programming
• Parallelizing functional programs by generalization
• scientific article; zbMATH DE number 1088022
• Parallel implementation of tree skeletons

Cited in

(7)

• Counterexample-guided partial bounding for recursive function synthesis
• Generalising and dualising the third list-homomorphism theorem: functional pearl
• Incremental computing with abstract data structures
• Balanced trees inhabiting functional parallel programming
• Filter-embedding semiring fusion for programming with MapReduce
• Lambda calculus with algebraic simplification for reduction parallelisation: extended study
• A short cut to parallelization theorems

This page was built for publication: The third homomorphism theorem on trees: downward \& upward lead to divide-and-conquer

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