The Dutch parallel reduction machine project

In November 1984 three research groups at the universities of Amsterdam, Nijmegen and Utrecht started a cooperative project sponsored by the Dutch Ministry of Science and Education (Science Council). The first phase lasting until the end of 1987 is a pilot study and has as aim to answer the following question. Is it possible and realistic to construct an efficient parallel reduction machine? The present paper gives an outline of the problems concerning parallel reduction machines and of our research towards their solutions.

[1]  Pierre-Louis Curien,et al.  The Categorical Abstract Machine , 1987, Sci. Comput. Program..

[2]  A. C. Norman,et al.  SKIM - The S, K, I reduction machine , 1980, LISP Conference.

[3]  Willem G. Vree,et al.  Parallel graph reduction for divide-and-conquer applications -- Part I: program transformation , 1988 .

[4]  Pieter H. Hartel,et al.  Statistics on graph reduction of SASL programs , 1988, Softw. Pract. Exp..

[5]  J. R. Kennaway,et al.  DACTL: A computational model and compiler target language based on graph reduction , 1987 .

[6]  D. A. Turner,et al.  A new implementation technique for applicative languages , 1979, Softw. Pract. Exp..

[7]  Alan Mycroft,et al.  Abstract interpretation and optimising transformations for applicative programs , 1982 .

[8]  D. A. Turner,et al.  Miranda: A Non-Strict Functional language with Polymorphic Types , 1985, FPCA.

[9]  W. G. Vree,et al.  A load distribution network for a multi processor reduction machine , 1986 .

[10]  Marko C. J. D. van Eekelen,et al.  Specification of reduction strategies in term rewriting systems , 1986, Graph Reduction.

[11]  Thomas Johnsson Efficient compilation of lazy evaluation , 1984, SIGP.

[12]  Marko C. J. D. van Eekelen,et al.  Towards an Intermediate Language based on Graph Rewriting , 1987, PARLE.

[13]  Simon L. Peyton Jones,et al.  FLIC—a functional language intermediate code , 1988, SIGP.

[14]  Robert M. Keller,et al.  Proceedings of the Workshop on Graph Reduction , 1986 .

[15]  Paul Hudak,et al.  Distributed execution of functional programs using serial combinators , 1985, IEEE Transactions on Computers.

[16]  Doug DeGroot,et al.  Logic programming - functions, relations and equations , 1986 .

[17]  Pieter W. M. Koopman Interactive programs in a functional language: A functional implementation of an editor , 1987, Softw. Pract. Exp..

[18]  Robert M. Keller,et al.  A loosely-coupled applicative multi-processing system* , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[19]  M. Ronan Sleep,et al.  Transputer-Based Experiments with the ZAPP Architecture , 1987, PARLE.

[20]  Rod M. Burstall,et al.  HOPE: An experimental applicative language , 1980, LISP Conference.

[21]  Marko C. J. D. van Eekelen,et al.  CLEAN: A language for functional graph writing , 1987, FPCA.

[22]  Paul Hudak,et al.  Para-functional programming: a paradigm for programming multiprocessor systems , 1986, POPL '86.

[23]  Wim Bronnenberg,et al.  DOOM: A Decentralized Object-Oriented Machine , 1987, IEEE Micro.

[24]  Simon L. Peyton Jones Using Futurebus in a fifth-generation computer , 1986, Microprocess. Microsystems.

[25]  José Meseguer,et al.  Principles of OBJ2 , 1985, POPL.

[26]  Werner E. Kluge Cooperating Reduction Machines , 1983, IEEE Transactions on Computers.

[27]  Hendrik Pieter Barendregt,et al.  Functional Programming and the Language TALE , 1986, Current Trends in Concurrency.

[28]  P. H. Hartel Experimental parallel reduction machine user manual , 1987 .

[29]  G. R. Renardel de Lavalette,et al.  Strictness analysis for POLYREC, a language with polymorphic and recursive types , 1988 .

[30]  Paul Hudak,et al.  Arrays, non-determinism, side-effects, and parallelism: A functional perspective , 1987, Graph Reduction.

[31]  Michael J. O'Donnell,et al.  Equational Logic as a Programming Language , 1985, Logic of Programs.

[32]  Richard B. Kieburtz,et al.  The G-Machine: A Fast, Graph-Reduction Evaluator , 1985, FPCA.