S.L. Peyton Jones, G. Hutton and C.K. Holst (Editors)
Springer-Verlag Series of Workshops in Computing, Series Editor C.J. van Rijsbergen, Springer-Verlag, Berlin, 1991. ISBN 0-387-19667-6/3-540-19667-6.
Lifetime Analysis
G. Argo
.......................1
Compiling Laziness by Partial Evaluation
A. Bondorf
.......................9
Strictness Analysis in 4D
M.K. Davis and P.L. Wadler
.......................23
An Algorithmic and Semantic Approach to Debugging
C.V. Hall, K. Hammond and J.T. O'Donnell
.......................44
Abstract Interpretation of Term Graph Rewriting Systems
C. Hankin
.......................54
Compile-Time Garbage Collection by Necessity Analysis
G.W. Hamilton and S.B. Jones
.......................66
Improving Full Laziness
C.K. Holst
.......................71
Towards Binding-Time Analysis for Free
C.K. Holst and R.J.M. Hughes
.......................83
Towards Relating Forwards and Backwards Analyses
R.J.M. Hughes and J. Launchbury
.......................101
PERs Generalise Projections for Strictness Analysis
S. Hunt
.......................114
Functional Programming with Relations
G. Hutton
.......................126
Abstract Interpretation vs. Type Inference: A Topological Perspective
T. Jensen
.......................141
Analysing Heap Contents in a Graph Reduction Intermediate Language
T. Johnsson
.......................146
Is Compile Time Garbage Collection Worth the Effort?
S.B. Jones and M. White
.......................172
Generating a Pattern Matching Compiler by Partial Evaluation
J. Jørgensen
.......................177
An Experiment using Term Rewriting Techniques for Concurrency
C. Kirkwood
.......................196
Type Refinement in Ruby
D. Murphy
.......................201
Normal-Order Reduction using Scan Primitives
W.D. Partain
.......................218
Calculating Lenient Programs' Performance
P. Roe
.......................227
Problems and Proposals for Time and Space Profiling of Functional Programs
C. Runciman and D. Wakeling
.......................237
Solid Modelling in Haskell
D.C. Sinclair
.......................246
Differentiating Strictness
S. Singh
.......................264
Generalising Diverging Sequences of Rewrite Rules by Synthesising New Sorts
M. Thomas and P. Watson
.......................268
Concurrent Data Manipulation in a Pure Functional Language
P.W. Trinder
.......................274