Functional Programming, Glasgow 1993

1. Front Matter

   Pages i-viii

   PDF

2. The Boom Hierarchy

   • Alexander Bunkenburg

   Pages 1-8

3. Factoring an Adequacy Proof (Preliminary Report)

   • Roy L. Crole, Andrew D. Gordon

   Pages 9-25

4. Projection-based Termination Analysis

   • Kei Davis

   Pages 26-42

5. A framework for optimising abstract data types

   • Cordelia V. Hall

   Pages 43-57

6. Spiking Your Caches

   • K. Hammond, G. L. Burn, D. B. Howe

   Pages 58-68

7. Experiments with destructive updates in a lazy functional language (extended abstract)

   • Pieter H. Hartel, Willem G. Vree

   Pages 69-82

8. The aim is laziness in a data-parallel language

   • Jonathan M. D. Hill

   Pages 83-99

9. On the Comparative Evaluation of Parallel Languages and Systems: A Functional Note

   • Robert E. Hiromoto

   Pages 100-112

10. Deterministic Concurrency

    • Ian Holyer, David Carter

    Pages 113-126

11. Using Strictness in the STG Machine

    • Denis B. Howe, Geoffrey L. Burn

    Pages 127-137

12. The Implementer’s Dilemma: A Mathematical Model of Compile Time Garbage Collection

    • Simon B. Jones, Andrew S. Tyas

    Pages 138-144

13. Functional Graph Algorithms with Depth-First Search (Preliminary Summary)

    • David J. King, John Launchbury

    Pages 145-155

14. Distributed Garbage Collection of Cyclic Structures

    • David Lester

    Pages 156-169

15. Update Avoidance Analysis by Abstract Interpretation

    • Simon Marlow

    Pages 170-184

16. Local Speculative Evaluation for Distributed Graph Reduction

    • James S. Mattson Jr., William G. Griswold

    Pages 185-192

17. Bidirectional Fold and Scan

    • John T. O’Donnell

    Pages 193-200

18. Measuring the effectiveness of a simple strictness analyser

    • Simon Peyton Jones, Will Partain

    Pages 201-221

19. Implementing Fudgets with Standard Widget Sets

    • Alastair Reid, Satnam Singh

    Pages 222-235

20. Profiling Parallel Functional Computations (Without Parallel Machines)

    • Colin Runciman, David Wakeling

    Pages 236-251

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.

• algorithm
• algorithms
• calculus
• concurrency
• functional programming
• programming
• semantics

• Department of Computing Science, The University, Glasgow, Scotland

  John T. O’Donnell, Kevin Hammond

Policies and ethics