Functional Programming Languages and Computer Architecture: Portland, Oregon, USA, September 14–16, 1987 Proceedings

Control of parallelism in the Manchester dataflow machine....Pages 1-15
The D-RISC—An architecture for use in multiprocessors....Pages 16-33
Tim: A simple, lazy abstract machine to execute supercombinators....Pages 34-45
The G-machine as a representation of stack semantics....Pages 46-59
Categorical multi-combinators....Pages 60-79
Evaluating functional programs on the flagship machine....Pages 80-97
GRIP — a high-performance architecture for parallel graph reduction....Pages 98-112
Concurrent garbage collection on stock hardware....Pages 113-133
Matrix algebra and applicative programming....Pages 134-153
Attribute grammars as a functional programming paradigm....Pages 154-173
The planar topology of functional programs....Pages 174-193
Functional programming with sets....Pages 194-211
A theory for natural modelisation and implementation of functions with variable arity....Pages 212-233
Pomset interpretations of parallel functional programs....Pages 234-256
SIGNAL: A declarative language for synchronous programming of real-time systems....Pages 257-277
Controlling the behaviour of functional language systems....Pages 278-300
A standard ML compiler....Pages 301-324
Performance polymorphism....Pages 325-346
Mapping a single-assignment language onto the warp systolic array....Pages 347-363
Clean — A language for functional graph rewriting....Pages 364-384
Projections for strictness analysis....Pages 385-407
Detecting sharing of partial applications in functional programs....Pages 408-425
Finding fixed points in finite lattices....Pages 426-445
Evaluation transformers — A model for the parallel evaluation of functional languages (extended abstract)....Pages 446-470