Parallelizing functional programs by generalization
From MaRDI portal
Publication:4948006
DOI10.1017/S0956796899003536zbMATH Open0949.68050OpenAlexW2127814526MaRDI QIDQ4948006FDOQ4948006
Authors: Alfons Geser, S. Gorlatch
Publication date: 26 April 2000
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0956796899003536
Recommendations
- scientific article; zbMATH DE number 1088022
- Extracting and implementing list homomorphisms in parallel program development
- A short cut to parallelization theorems
- The third homomorphism theorem on trees: downward \& upward lead to divide-and-conquer
- Generalising and dualising the third list-homomorphism theorem: functional pearl
Cited In (9)
- Parallel functional programming in Eden
- Incremental computing with abstract data structures
- The third homomorphism theorem on trees: downward \& upward lead to divide-and-conquer
- Continuation-based compilation of functional languages for parallel machines
- Skeleton-based parallel programming: functional and parallel semantics in a single shot
- A cost calculus for parallel functional programming
- An approach to multicore parallelism using functional programming: a case study based on Presburger arithmetic
- A short cut to parallelization theorems
- Title not available (Why is that?)
This page was built for publication: Parallelizing functional programs by generalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4948006)