Parallelization of divide-and-conquer in the Bird-Meertens formalism

DOI10.1007/BF01211000zbMath0841.68055MaRDI QIDQ1906040

Sergei Gorlatch, Christian Lengauer

Publication date: 2 July 1996

Published in: Formal Aspects of Computing (Search for Journal in Brave)

zbMATH Keywords

specificationBird-Meertens formalismparallel functional program schema

Mathematics Subject Classification ID

Distributed algorithms (68W15) Theory of software (68N99)

Cites Work

• Unnamed Item
• Unnamed Item
• An exercise in transformational programming: Backtracking and Branch-and- Bound
• Deriving parallel programs from specifications using cost information
• The automated proof of a trace transformation for a bitonic sort
• Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
• Pipelines for Divide-and-Conquer Functions
• Can programming be liberated from the von Neumann style?
• List processing primitives for parallel computation

This page was built for publication: Parallelization of divide-and-conquer in the Bird-Meertens formalism