2DT-FP: An FP based programming language for efficient parallel programming of multiprocessor networks

Abstract

We propose a new paradigm for programming tightly coupled multicomputer systems, 2DT. 2DT-programs are composed of local computations on linear data (columns) and global transformations on 2-dimensional combinations of the columns (2D-arrays). Local computations can be expressed in a functional or imperative base language; a typed variant of Backus’ FP, 2DT-FP, is chosen in this paper. An interleaving semantics for 2DT-FP is given, exposing the potential for parallel execution of 2DT-FP programs. The claim is proved that any sequential and thus any parallel execution will deliver the same result.