
Guy Argo:
A New Sharing Mechanism for the TIM. 25-35
Geoffrey L. Burn:
The Abstract interpretation of Higher-Order Functional Languages: From Properties to Absract Domains (Technical Summary). 56-72
Kei Davis:
A Note on the Choice of Domains for Projection-Based Program Analysis. 73-81
Alain Deutsch:
An Operational Model of Strictness Properties and Its Abstractions (Extended Abstract). 82-99
Andrew J. Gill:
A Novel Approach Towards Peephole Optimisations. 100-111
Cordelia V. Hall:
Strictness Analysis Using Hindley-Milner Type Inference. 128-133
Kevin Hammond:
Efficient Type Inference Using Monads (Summary). 146-157
Rogardt Heldal:
Generating More Practical Compilers by Partial Evaluation. 158-163
David Murphy:
A Semantics for Relational Programming. 239-252
Lars Rossen:
From Primitive Recursive Functions to Silicon through Relations. 253-264
Nick Rothwell:
Functional Compilation from the Standard ML Core Language to Lambda Calculus. 265-277
Colin Runciman:
TIP in Haskell - another Exercise in Functional Programming. 278-292
Paul Sanders:
Experiments in Haskell - A Network Simulation Algorithm. 293-297
David Sands:
Operational Theories of Improvement in Functional Languages (Extended Abstract). 298-311
Patrick M. Sansom:
Combining Single-Space and Two-Space Compacting Garbage Collectors. 312-323
Ben A. Sijtsma:
Requirements for a Functional Programming Environment. 339-346