A short cut to parallelization theorems

DOI10.1145/2500365.2500580MaRDI QIDQ5244804zbMATH OpenOpenAlexFDO

Authors Akimasa Morihata

Publication date 30 March 2015

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

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

zbMATH Keywords

divide-and-conquer parallelismshortcut deforestationthird list-homomorphism theorem

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Data structures (68P05)

Recommendations

• The third homomorphism theorem on trees: downward \& upward lead to divide-and-conquer
• Parallelizing functional programs by generalization
• scientific article; zbMATH DE number 1088022
• Functional Pearls
• Generalising and dualising the third list-homomorphism theorem: functional pearl

Cited in

(9)

• Extracting and implementing list homomorphisms in parallel program development
• Parallelization of divide-and-conquer in the Bird-Meertens formalism
• Incremental computing with abstract data structures
• scientific article; zbMATH DE number 177853 (Why is no real title available?)
• scientific article; zbMATH DE number 1088022 (Why is no real title available?)
• The Parallel Simplicity of Compaction and Chaining
• Parallelizing functional programs by generalization
• Generalising and dualising the third list-homomorphism theorem: functional pearl
• The third homomorphism theorem on trees: downward \& upward lead to divide-and-conquer

This page was built for publication: A short cut to parallelization theorems

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