Algorithm + strategy = parallelism

DOI10.1017/S0956796897002967zbMath0933.68033OpenAlexW1990195720MaRDI QIDQ4236759

Kevin Hammond, S. L. Payton Jones, Phil W. Trinder, Hans-Wolfgang Loidl

Publication date: 18 May 1999

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0956796897002967

zbMATH Keywords

evaluation strategies

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Related Items (14)

Lazy tree splitting ⋮ Parallel elementwise processable functions in concurrent clean ⋮ Trends in trends in functional programming 1999/2000 versus 2007/2008 ⋮ Parseval wavelets on hierarchical graphs ⋮ A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations ⋮ Skeleton composition versus stable process systems in Eden ⋮ Hume box calculus: Robust system development through software transformation ⋮ An approach to multicore parallelism using functional programming: a case study based on Presburger arithmetic ⋮ Selective strictness and parametricity in structural operational semantics, inequationally ⋮ Space profiling for parallel functional programs ⋮ Implicitly threaded parallelism in Manticore ⋮ Graph-based communication in Eden ⋮ To be or not to be …lazy (In a Parallel Context) ⋮ Proving Properties of Lazy Functional Programs with Sparkle

This page was built for publication: Algorithm + strategy = parallelism