Functional Programming Languages and Computer Architecture: Nancy, France, September 16–19, 1985

Miranda: A non-strict functional language with polymorphic types....Pages 1-16
Data flow graph optimization in if1....Pages 17-34
Strictness analysis — a practical approach....Pages 35-49
The categorical abstract machine....Pages 50-64
High order programming in extended FP....Pages 65-80
Secd-m: a virtual machine for applicative programming....Pages 81-98
Cobweb — A combinator reduction architecture....Pages 99-112
How to replace failure by a list of successes a method for exception handling, backtracking, and pattern matching in lazy functional languages....Pages 113-128
Lazy memo-functions....Pages 129-146
An architecture for fast data movement in the FFP machine....Pages 147-163
An architecture that efficiently updates associative aggregates in applicative programming languages....Pages 164-189
Lambda lifting: Transforming programs to recursive equations....Pages 190-203
Optimizing almost-tail-recursive prolog programs....Pages 204-219
Designing regular array architectures using higher order functions....Pages 220-237
 $$v\mathcal{F}\mathcal{P}$$ : An environment for the multi-level specification, analysis, and synthesis of hardware algorithms....Pages 238-255
A distributed garbage collection algorithm....Pages 256-272
Cyclic reference counting for combinator machines....Pages 273-288
Design for a multiprocessing heap with on-board reference counting....Pages 289-304
A functional language and modular architecture for scientific computing....Pages 305-318
Practical polymorphism....Pages 319-333
Program verification in a logical theory of constructions....Pages 334-349
Transforming recursive programs for execution on parallel machines....Pages 350-367
Compiling pattern matching....Pages 368-381
Serial combinators: "optimal" grains of parallelism....Pages 382-399
The G-machine: A fast, graph-reduction evaluator....Pages 400-413