Skip to main content
SpringerLink
Log in
Book cover

Functional Programming, Glasgow 1992 pp 240–251Cite as

On Program Transformation in the Glasgow Haskell Compiler

  • Conference paper

  • 87 Accesses

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

In this paper we describe a series of program transformations that are currently being implemented in the Glasgow Haskell Compiler. They are semantics preserving program transformations and therefore are perfectly suitable for incorporation in a compiler. We describe some of the transformations, how they interact and their impact on the time/space behaviour of some programs.

Sponsored by CAPES, Brazil.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Augustsson. Compiling Lazy Functional Languages, Part II. PhD thesis, Department of Computer Science, Chalmers University of Technology, S412 96 Göteborg, November 1987.

    Google Scholar 

  2. W. N. Chin and J. Darlington. Removing higher-order expressions by program transformation, February 1991.

    Google Scholar 

  3. W. D. Partain. The nofib benchmarking suite. In J. Launchbury and P. M. Sansom, editors, Functional Programming, Glasgow 1992, Ayr, Scotland, 1992. Springer Verlag, Workshops in Computing.

    Google Scholar 

  4. S. L. Peyton Jones. Implementing lazy functional languages on stock hardware: The Spineless Tagless G-machine. Journal of Functional Programming, 2 (2): 127–202, April 1992.

    Article  MATH  Google Scholar 

  5. S. L. Peyton Jones and J. Launchbury. Unboxed values as first class citizens in a non-strict functional language. In Functional Programming Languages and Computer Architecture, Cambridge, September 1991.

    Google Scholar 

  6. S. L. Peyton Jones and D. Lester. A fully-lazy lambda lifter in Haskell. Software–Practice and Experience, 21 (5): 479–506, May 1991.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, University of Glasgow, Glasgow, G12 8QQ, Scotland, UK

    André Santos & Simon L. Peyton Jones

Authors
  1. André Santos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Simon L. Peyton Jones
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing Science, The University, G12 8QQ, Glasgow, Scotland

    John Launchbury MA (Oxon), MSc, PhD  & Patrick Sansom BSc (Hons)  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1993 British Computer Society

About this paper

Cite this paper

Santos, A., Peyton Jones, S.L. (1993). On Program Transformation in the Glasgow Haskell Compiler. In: Launchbury, J., Sansom, P. (eds) Functional Programming, Glasgow 1992. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3215-8_21

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3215-8_21

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19820-8

  • Online ISBN: 978-1-4471-3215-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation