The Functional Programming Group at the University of Glasgow was started in 1986 by John Hughes and Mary Sheeran. Since then it has grown in size and strength, becoming one of the largest computing science research groups at Glasgow and earning an international reputation. The first Glasgow Functional Programming Workshop was organised in the summer of 1988. Its purpose was threefold: to provide a snapshot of all the research going on within the group, to share research ideas between Glaswegians and colleagues in the U.K. and abroad, and to introduce research students to the art of writing and presenting papers at a semi-formal (but still local and friendly) conference. The success of the first workshop has led to an annual series: Rothesay (1988), Fraserburgh (1989), Ullapool (1990). Portree (1991), Ayr (1992), and the workshop reported in these proceedings: Ayr (1993). Most participants wrote a paper that appeared in the draft proceedings (distributed at the workshop), and each draft paper was presented by one of the authors. The papers were all refereed by several other participants at the workshop, both internal and external, and the programme committee selected papers for these proceedings. Most papers have been revised twice, based firstly on feedback at the workshop, and secondly using the referee reports.

Klappentext

The Glasgow Functional Programming Workshops have been held annually since 1988, and provide an invaluable opportunity for the discussion of unresolved research issues, and for the presentation of current results. This volume is based on the proceedings of the 1993 workshop, which was held in Ayr, Scotland, from 5 - 7 July 1993. The papers cover the spectrum of functional programming research, including implementation, performance, parallelism, algorithms, and semantics. They reflect the current trend towards emphasis on practical issues, and also give several examples of how theoretical research can be successfully applied to practical programming. Among the actual topics covered are: projection-based termination analysis; deterministic concurrency; using strictness in the STG machine; distributed garbage collection of cyclic structures; bidirectional fold and scan; separating interaction; time profiling a lazy functional compiler; and solving recursive domain equations by term rewriting.

Inhalt
The Boom Hierarchy.- Factoring an Adequacy Proof (Preliminary Report).- Projection-Based Termination Analysis.- A Framework for Optimising Abstract Data Types.- Spiking Your Caches.- Experiments with Destructive Updates in a Lazy Functional Language (Extended Abstract).- The aim is Laziness in a Data-Parallel Language.- On the Comparative Evaluation of Parallel Languages and Systems: A Functional Note.- Deterministic Concurrency.- Using Strictness in the STG Machine.- The Implementer's Dilemma: A Mathematical Model of Compile Time Garbage Collection.- Functional Graph Algorithms with Depth-First Search (Preliminary Summary).- Distributed Garbage Collection of Cyclic Structures.- Update Avoidance Analysis by Abstract Interpretation.- Local Speculative Evaluation for Distributed Graph Reduction.- Bidirectional Fold and Scan.- Measuring the Effectiveness of a Simple Strictness Analyser.- Implementing Fudgets with Standard Widget Sets.- Profiling Parallel Functional Computations (Without Parallel Machines).- Time Profiling a Lazy Functional Compiler.- Solving Recursive Domain Equations by Term Rewriting.- Separating Interaction.- Author Index.