Implicit and Explicit Parallel Programming in Haskell

Implicit and Explicit Parallel Programming in Haskell (1993)

Cached

Download Links

by Mark P. Jones , Paul Hudak

Citations:

29 - 1 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Implicit and Explicit Parallel Programming in Haskell	INFERENCE
AUTHOR NAME	Mark P. Jones	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Computer Science	SVM HeaderParse 0.2
AUTHOR ADDR	Yale University New Haven, CT 06520-2158	SVM HeaderParse 0.2
AUTHOR NAME	Paul Hudak	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Computer Science	SVM HeaderParse 0.2
AUTHOR ADDR	Yale University New Haven, CT 06520-2158	SVM HeaderParse 0.2
ABSTRACT	Abstract It has often been suggested that functional languages provide an excellent basis for programming parallel computer systems. This is largely a result of the lack of side effects which makes it possible to evaluate the subexpressions of a given term without any risk of interference. On the other hand, the lack of side-effects has also been seen as a weakness of functional languages since it rules out many features of traditional imperative languages such as state, I/O and exceptions. These ideas can be simulated in a functional language but the resulting programs are sometimes unnatural and inefficient. On the bright side, recent work has shown how many of these features can be naturally incorporated into a functional language without compromising efficiency by expressing computations in terms of monads or continuations. Unfortunately, the "single-threading " implied by these techniques often destroys many opportunities for parallelism. In this paper, we describe a simple extension to the Haskell I/O monad that allows a form of explicit high-level concurrency. It is a simple matter to incorporate these features in a sequential implementation, and genuine parallelism can be obtained on a parallel machine. In addition, the inclusion of constructs for explicit concurrency enhances the use of Haskell as an executable specification language, since some programs are most naturally described as a composition of parallel processes. \Lambda This research was supported by ARPA via a subcontract to Intermetrics, Inc. 1	SVM HeaderParse 0.2
YEAR	1993	SVM HeaderParse 0.2
VENUE TYPE	TECHREPORT	INFERENCE
TECH	Technical Report YALEU/DCS/RR-982	INFERENCE
CITATIONS	20 found	ParsCit 1.0