The Glasgow functional programming group has held a workshop each summer since 1988. The entire group, accompanied by a selection of colleagues from other institutions, retreats to a pleasant Scottish location for a few days. Everyone speaks briefly, enhancing coherence, cross­ fertilisation, and camaraderie in our work. The proceedings of the first workshop were published as a technical report. Demand for this was large enough to encourage wider publication, and subsequent proceedings have been published in the Springer-Verlag Workshops in Computing series. These are the proceedings of the-meeting held 12-14 August 1991, in Portree on the Isle of Skye. A preliminary proceedings was prepared in advance of the meeting. Most presentations were limited to a brief fifteen minutes, outlining the essentials of their subject, and referring the audience to the pre-print proceedings for details. Papers were then refereed and rewritten, and you hold the final results in your hands. A number of themes emerged at this year's workshop, including relational algebra and its application to hardware design, partial evaluation and program transformation, implementation techniques, and strictness analysis. We were especially pleased to see applications of functional programming emerge as a theme. One of the sessions was devoted to a lively discussion of applications, and was greatly enhanced by our industrial participants. The workshop was organised by Kei Davis, Cordelia Hall, Rogardt Heldal, Carsten Kehler Holst, John Hughes, John O'Donnell, and Satnam Singh all from the University of Glasgow.

Inhalt

A Parallel Functional Database on GRIP.- A New Sharing Mechanism for the TIM.- BWM: A Concrete Machine for Graph Reduction.- ACTRESS: An Action Semantics Directed Compiler Generator (Summary).- The Abstract Interpretation of Higher-Order Functional Languages: From Properties to Abstract Domains (Technical Summary).- A Note on the Choice of Domains for Projection-Based Program Analysis.- An Operational Model of Strictness Properties and its Abstractions (Extended Abstract).- A Novel Approach Towards Peephole Optimisations.- Evaluation Order Analysis for Lazy Data Structures.- Strictness Analysis Using Hindley-Milner Type Inference.- Extending Deforestation for First Order Functional Programs.- Efficient Type Inference Using Monads (Summary).- Generating More Practical Compilers by Partial Evaluation.- A Loop-Detecting Interpreter for Lazy Programs.- Making Functionality More General.- Getting Your Wires Crossed.- Implementing Projection-based Strictness Analysis.- Vuillemin's Exact Real Arithmetic.- A Semantics for Relational Programming.- From Primitive Recursive Functions to Silicon through Relations.- Functional Compilation from the Standard ML Core Language to Lambda Calculus.- TIP in Haskell - Another Exercise in Functional Programming.- Experiments in Haskell - A Network Simulation Algorithm.- Operational Theories of Improvement in Functional Languages (Extended Abstract).- Combining Single-Space and Two-Space Compacting Garbage Collectors.- External Function Calls in a Functional Language.- A Note on Abstraction in Ruby.- Requirements for a Functional Programming Environment.- Debugging by Dataflow - Summary.- Using XView/X11 from Miranda.- Author Index.