Abstract is missing.
- IntroductionKevin Hammond, Greg Michaelson. 3-29 [doi]
- FoundationsGreg Michaelson, Kevin Hammond, Chris Clack. 31-61 [doi]
- Programming Language ConstructsRita Loogen. 63-92 [doi]
- ProofSimon J. Thompson. 93-119 [doi]
- Realisations for Strict LanguagesWerner E. Kluge. 121-148 [doi]
- Realisations for Non-Strict LanguagesChris Clack. 149-187 [doi]
- Data ParallelismJohn O'Donnell. 191-206 [doi]
- Cost ModellingDavid Skillicorn. 207-218 [doi]
- Shaping DistributionsC. Barry Jay. 219-232 [doi]
- Performance MonitoringNathan Charles, Colin Runciman. 233-246 [doi]
- Memory Performance of Dataflow ProgramsA. P. Willem Böhm, Jeffrey P. Hammes. 247-265 [doi]
- Portability of Performance in the BSP ModelJonathan Hill. 267-287 [doi]
- Algorithmic SkeletonsMurray Cole. 289-303 [doi]
- Coordination LanguagesPaul Kelly, Frank Taylor. 305-321 [doi]
- Parallel and Distributed Programming in Concurrent CleanRinus Plasmeijer, Marko C. J. D. van Eekelen, Marco Pil, Pascal R. Serrarens. 323-338 [doi]
- Functional Process ModellingAli Abdallah. 339-360 [doi]
- Validating Programs in Concurrent MLFlemming Nielson. 361-378 [doi]
- Explicit ParallelismJocelyn Sérot. 379-396 [doi]
- Large Scale Functional ApplicationsPhilip W. Trinder, Hans-Wolfgang Loidl, Kevin Hammond. 399-426 [doi]
- SummaryGreg Michaelson, Kevin Hammond. 427-430 [doi]