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

https://doi.org/10.1016/0167-739X(92)90010-9Get rights and content

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.

References (13)

  • H.T Kung

    The Structure of Parallel Algorithms

  • J Backus

    Can programming be liberated from the Von Neumann style?

  • C Bettini

    La Connection Machine come architettura hardware per l'implementazione di un linguaggio applicativo parallelo

  • E Decio

    Sull'implementazione di un linguaggio applicativo concorrente

  • D Friedman et al.

    An approach to fair applicative multiprogramming

  • P Henderson

    Functional Programming, Application and Implementation

    (1980)
There are more references available in the full text version of this article.

Cited by (0)

View full text
Copyright © 1992 Published by Elsevier B.V.