Literature

The Glasgow Haskell Compiler

Documentation for the Glasgow Haskell Compiler

• The Glasgow Haskell compiler: a technical overview, 1992 (9 Seiten).
• Installing the Glasgow Functional Programming Tools, Version 2.01, July 26, 1996 (23 Seiten), LaTex, Dvi
• Release notes for Glasgow Haskell, July 26, 1996 (5 Seiten), LaTex, Dvi
• The Glorious Glasgow Haskell Compilation System, Version 2.01, User's Guide (92 Seiten), LaTex, Dvi
• S. Peyton Jones, J. Launchbury, W. Partain: GHC prelude: types and operations, July 1996 (15 Seiten) Dvi
• Will Partain: How to Add an Optimisation Pass to the Glasgow Haskell compiler (two months before version 0.23)

Tools for the Glasgow Haskell Compiler

• Glasgow Literate Programming, User's Guide (51 Seiten) LaTex, Dvi
• NoFib Benchmark Suite

The Glasgow Projects Aqua and Grasp

• Declarative system architecture: a quantitative approach. Case for support (Aqua project)
• Final report on the GRASP project, 1993

Programm Transformations

Implemented in GHC

• S.L. Peyton Jones, J. Launchbury: Unboxed values as first class citizen, 1991.
• David N. Turner, Philip Wadler, Christian Mossin: Once upon a type, 7'th International Conference on Functional Programming and Computer Architecture, San Diego, California, June 1995.

• Simon L Peyton Jones: Compiling Haskell by program transformation: a report form the trenches, 1996.
• Simon L Peyton Jones, Andre L M Santos: A transformation-based optimiser for Haskell, 1996. Extended version of the paper above.
• S. Peyton Jones, Andre Santos: Computation by Transformation in the Glasgow Haskell Compiler.
• Andre Santos: Compilation by Transformation in Non-Strict Functional Languages, PhD Thesis, July 1995 (208 Seiten).

Others

• The Haskell Report: Version 1.4
• J. Launchbury, T. Sheard: Warm Fusion: Deriving Build-Catas from Recursive Definitions.
• Paul A. Steckler: Correct higher-order program transformations; Thesis, Northeastern University, July 1994. (Soure: ftp://ftp.ccs.neu.edu/pub/people/steck/thesis.ps.Z)

  Presents a method for proving the correctness of compiler optimizations for higher-order programming languages. Optimizations exhibited:

  • selective and lightweight closure conversion (constructing source-level closures for procedures
  • ultra-beta (a generalization of copy propagation to higher-order languages)
  • selective thunkification (transforming call-by-name programs into call-by-value equivalents)

Bibliography

SEL-HPC Functional Programming Archive

• Program transformation subject area
• Partial evaluation subject area

Karlsruhe: Computer Science Bibliography Collection Avanced Search

• "program transformation" and functional
• "program transformation" and lambda
• transform* and (functional lambda) and yr>1990
• Some Publications of W.N. Chin

Hypertext Bibliography Project

• Result for query "program ;transformation"

Links to Program Transformation

• Research Plans by Pete Madden, Ian Green, and others of the project Computational Modelling of Mathematical Reasoning, Edinburgh.
• Partial Evaluation and Program Transformation, overview page by Tim Gabric, University of Melbourne.
• Specifications in Functional Languages and their Transformations, reseach plans, University of Leiden.
• Abstract Interpretation and Program Transformation, information about a course at Chalmers by John Hughes.
• Publications of Morten Heine Sørensen.