Monad transformers and modular interpreters
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Programming parallel algorithms
Communications of the ACM
BSPlib: The BSP programming library
Parallel Computing
A calculus of functional BSP programs
Science of Computer Programming - Special issue on mathematics of program construction
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
High Level BSP Programming: BSML and BSlambda
SFP '99 Selected papers from the 1st Scottish Functional Programming Workshop (SFP99)
Modular monadic semantics and compilation
Modular monadic semantics and compilation
Relation-based computations in a monadic BSP model
Parallel Computing
Parallel superposition for bulk synchronous parallel ML
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
Formal semantics of DRMA-style programming in BSPlib
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Type system for a safe execution of parallel programs in BSML
Proceedings of the fifth international workshop on High-level parallel programming and applications
Bulk synchronous parallel ML: modular implementation and performance prediction
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
| Hi-index | 0.00 |
The BSP model of computing allows parallel programs to be ported to a wide range of architectures with predictable runtime performance. We show how BSP may be implemented in a Haskell library in a way that preserves the cost predictability, and avoids the synchronisation-matching problem of low-level BSP. The library comprises interchangeable components, from which sequential and parallel implementations may be constructed, with a choice of local features including runtime cost-measurement.