Functional Programming Languages and Computer Architecture

Control of parallelism in the Manchester dataflow machine.- The D-RISC—An architecture for use in multiprocessors.- Tim: A simple, lazy abstract machine to execute supercombinators.- The G-machine as a representation of stack semantics.- Categorical multi-combinators.- Evaluating functional programs on the flagship machine.- GRIP — a high-performance architecture for parallel graph reduction.- Concurrent garbage collection on stock hardware.- Matrix algebra and applicative programming.- Attribute grammars as a functional programming paradigm.- The planar topology of functional programs.- Functional programming with sets.- A theory for natural modelisation and implementation of functions with variable arity.- Pomset interpretations of parallel functional programs.- SIGNAL: A declarative language for synchronous programming of real-time systems.- Controlling the behaviour of functional language systems.- A standard ML compiler.- Performance polymorphism.- Mapping a single-assignment language onto the warp systolic array.- Clean — A language for functional graph rewriting.- Projections for strictness analysis.- Detecting sharing of partial applications in functional programs.- Finding fixed points in finite lattices.- Evaluation transformers — A model for the parallel evaluation of functional languages (extended abstract).