The dutch parallel reduction machine project
Future Generation Computer SystemsPublished 1 December 1987Open access
Henk Barendregt, M.C.J.D. van Eekelen, M.J. Plasmeijer, Pieter Hartel, L.O. Hertzberger, W. G. Vree
Citations14
SJR quartileQ1
SJR score1.55
SNIP2.23
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The present paper gives an outline of the problems concerning parallel reduction machines and of the research towards their solutions.
Abstract
Contains fulltext : 309544.pdf (Publisher’s version ) (Open Access)
Keywords
Computer ScienceEngineeringPhysics and Astronomy
Software Practice and ExperienceA new implementation technique for applicative languages
612 Citations1979David A. Turner
By using results from combinatory logic an applicative language, such as LISP, can be translated into a form from which all bound variables have been removed, and a machine is described which can efficiently execute the resulting code.
Principles of OBJ2
468 Citations1985Kokichi Futatsugi, Joseph A. Goguen +2 more
Four clsssrs of design principles for 01352 ate discussed briefly in this inttoduct, and then in mote detail brlnw: motlulntizntion and patnmcteriantion; (2) subsorts; (3) implcmcntnt; and (4) inlrtaction and flexibility.
HOPE
351 Citations1980R. M. Burstall, David MacQueen +1 more
An applicative language called HOPE is described and discussed, to produce a very simple programming language which encourages the construction of clear and manipulable programs.
Efficient compilation of lazy evaluation
226 Citations1984Thomas Johnsson
The principles underlying an efficient implementation of a lazy functional language, compiling to code for ordinary computers, based on combinator-like graph reduction: the user defined functions are used as rewrite rules in the graph.
Edinburgh Research Archive (University of Edinburgh)Abstract interpretation and optimising transformations for applicative programs
208 Citations1982Alan Mycroft
Lecture notes in computer scienceClean — A language for functional graph rewriting
143 Citations1987T. H. Brus, M.C.J.D. van Eekelen +2 more
A sequential implementation of Clean on a conventional machine is described and its performance is compared with other systems to show that Clean can be efficiently implemented.
1979 International Workshop on Managing Requirements Knowledge (MARK)A loosely-coupled applicative multi-processing system
106 Citations1979Robert Keller, Gary Lindstrom +1 more
Indications are that programming languages deserve consideration at the earliest stages of architectural conception, included in such considerations are issues such as storage and task management.
International Journal of Parallel ProgrammingA network of microprocessors to execute reduction languages, part I
81 Citations1979Gyula A. Mag�
The architecture of a cellular processor capable of directly and efficiently executing reduction languages as defined by Backus is described, which consists of two interconnected networks of microprocessors.
SKIM - The S, K, I reduction machine
66 Citations1980Tania Clarke, P. J.S. Gladstone +2 more
The high level reduction language that SKIM supports, the way in which this language is compiled into combinators and the hardware and microcode that then evaluate programs are discussed.
Para-functional programming
62 Citations1986Paul Hudak, Lauren Smith
This paper is concerned with ways to allow the programmer to explicitly express this mapping of program to machine, by using annotations that, given a few minor constraints, cannot alter the functional semantics of the program.
Lecture notes in computer scienceThe G-machine: A fast, graph-reduction evaluator
49 Citations1985Richard B. Kieburtz
The G-machine is an abstract architecture for evaluating functional-language programs by programmed graph reduction by compiling an applicative expression.
Lecture notes in computer scienceTowards an intermediate language based on Graph Rewriting
43 Citations1987Henk Barendregt, M.C.J.D. van Eekelen +4 more
Lean is an experimental language for specifying computations in terms of graph rewriting based on an alternative to Term Rewriting Systems (TRS) in which the terms are replaced by graphs.
IEEE Transactions on ComputersDistributed execution of functional programs using serial combinators
40 Citations1985Paul Hudak, Benjamin Goldberg
The authors describe a program transformation technique based on serial combinators that offers in some sense just the right granularity for this style of computing, and that can be fine-tuned for particular multiprocessor architectures.
Lecture notes in computer scienceTransputer-based experiments with the ZAPP architecture
37 Citations1987Dylan McBurney, M. R. Sleep
Experiments with a parallel architecture called ZAPP simulated on several connected INMOS transputers covered a range of applications including matrix multiply, heuristic search and the 0–1 knapsack optimisation problem.
IEEE MicroDOOM: A Decentralized Object-Oriented Machine
36 Citations1987Wim Bronnenberg, Loek Nijman +2 more
Research into the potentials and problems of parallelism led to a new programming language and supportive parallel operating system and architecture and studies continue on a 100-node prototype.
IEEE Transactions on ComputersCooperating Reduction Machines
25 Citations1983Kluge
This paper presents a concept and a system architecture for the concurrent execution of program expressions of a concrete reduction language based on λ-expressions.
Software Practice and ExperienceStatistics on graph reduction of SASL programs
22 Citations1988Pieter Hartel, A.H. Veen
The execution has been studied of four small and four medium‐sized SASL programs, when interpreted by a variant of Turner's combinator reducer, and the behaviour of the graph is quite ordinary in the sense that a simple model is sufficient to obtain a good approximation.
Lecture notes in computer scienceArrays, non-determinism, side-effects, and parallelism: A functional perspective
21 Citations1987Paul Hudak
Incremental, functional updates to arrays, executed in a non-deterministic manner, are shown to achieve the same effect (in both efficiency and functionality) as parallel assignment to imperative arrays.
International Journal of Parallel ProgrammingA network of microprocessors to execute reduction languages, part II
17 Citations1979Gyula A. Mag�
The architecture of a cellular processor capable of directly and efficiently executing reduction languages as defined by Backus is described, which consists of two interconnected networks of microprocessors.
Lecture notes in computer scienceFunctional programming and the language tale
15 Citations1986Henk Barendregt, Marc van Leeuwen
The motivation for introducing TALE was to give a complete description of a language with precise semantics and at the same time a flexible syntax for actual programming.
Lecture notes in computer scienceSpecification of reduction strategies in term rewriting systems
11 Citations1987M.C.J.D. van Eekelen, M.J. Plasmeijer
There is a growing interest in Term Rewriting Systems (TRS's), which are used as a conceptual basis for new programming languages such as functional languages and algebraic specification languages.
Microprocessors and MicrosystemsUsing Futurebus in a fifth-generation computer
10 Citations1986Simon Peyton Jones
A design is presented for a parallel computer (GRIP) based on Futurebus, which limits bus bandwidth requirements by using intelligent memories, and offers higher performance and lower cost than a more extensible multiprocessor.
Software Practice and ExperienceInteractive programs in a functional language: A functional implementation of an editor
8 Citations1987Pieter Koopman
This paper shows that an existing functional programming language is very well suited for the elegant implementation of interactive programs, as an example, a text editor.
OpenGrey (Institut de l'Information Scientifique et Technique)The architecture of a reduction language machine Hardware model
6 Citations1979Kluge, W.E., Gesellschaft fuer Mathematik und Datenverarbeitung m.b.H. Bonn, St. Augustin (Germany, F.R.). Inst. fuer Informationssystemforschung
Logic Group preprint seriesStrictness analysis for POLYREC, a language with polymorphic and recursive types
5 Citations1988Gerard R. Renardel de Lavalette
This paper defines the functional language POLYREC with polymorphic and recursive types, and develops concrete and abstract interpretations for this language, based on complete partial orderings and complete lattices.