The connection machine opportunity for the implementation of a concurrent functional language

Authors :: Claudio Bettini
Luca Spampinato
Source :: Future Generation Computer Systems. 7:231-245
Publication Year :: 1992
Publisher :: Elsevier BV, 1992.
Abstract: A concurrent functional language is presented, Parlam, which includes primitives for explicit control of parallel reductions. An abstract machine for Parlam (ParSEC) is derived from Landin's SECD machine by extending it for dealing with parallel computation. Several issues and problems about its implementation on a massively parallel computer are discussed and a specific implementative model for ParSEC under the Connection Machine is described.

Subjects :: Functional programming
Syntax (programming languages)
Computer Networks and Communications
Semantics (computer science)
Programming language
Computer science
Concurrency
Parallel computing
computer.software_genre
Abstract machine
SECD machine
Hardware and Architecture
Lazy evaluation
Massively parallel
computer
Software

Tools