(Enter summary)
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.
1 Introduction
Program transformations can considerably improve the performance of certain
programs, by transforming... (Update)
Context of citations to this paper: More
...to reason about the effects of a program transformation in a more formal framework. Parts of this work have been previously presented in [SP92, PS94] 1.2 Structure of the thesis We start by describing the framework we will use to present and measure the effectiveness of our...
.... More aggressive unfolding heuristics may be used when unfolding lambda abstractions at the expense of possible code duplication (Santos Peyton Jones [1992]) In particular, top level function definitions may be inlined if it is expected that this will lead to further...
Cited by: More
Execution Profiling for Non-strict Functional Languages - Sansom (1994)
(Correct)
Compilation by Transformation in Non-Strict Functional Languages - Santos (1995)
(Correct)
Active bibliography (related documents): More All
0.2: Type-Secure Meta-Programming - Christopher Bentley Dornan (1998)
(Correct)
0.2: A Natural Semantics for Lazy Evaluation - Launchbury (1993)
(Correct)
0.2: Evaluation under λ-Abstraction - Xi (1996)
(Correct)
Similar documents based on text: More All
0.4: Making Haskell .NET Compatible - O'Boyle
(Correct)
0.2: User-extensible Simplification - Type-based Optimizer.. - Schupp, Gregor, Musser.. (2001)
(Correct)
0.1: The Jaskell Project - Vernet (1998)
(Correct)
Related documents from co-citation: More All
2: A natural semantics for lazy evaluation
- Launchbury - 1993
2: How to make adhoc polymorphism less ad-hoc
- Wadler, Blott - 1989
2: The glasgow Haskell compiler: a technical overview
- Jones, Hall et al. - 1993
BibTeX entry: (Update)
Andr'e Santos and Simon Peyton Jones. On program transformation in the Glasgow Haskell Compiler. In Launchbury and Sansom [LS92]. http://citeseer.ist.psu.edu/santos93program.html More
@misc{ santos-program,
author = "A. Santos and S. Jones",
title = "On program transformation in the Glasgow Haskell Compiler",
text = "Andr'e Santos and Simon Peyton Jones. On program transformation in the
Glasgow Haskell Compiler. In Launchbury and Sansom [LS92].",
url = "citeseer.ist.psu.edu/santos93program.html" }
Citations (may not include all citations):
210
Implementing lazy functional languages on stock hardware: Th..
- Jones - 1992
73
Unboxed values as first class citizens in a non-strict funct..
- Jones, Launchbury - 1991
36
Compiling Lazy Functional Languages (context) - Augustsson - 1987
7
The nofib benchmarking suite (context) - Partain - 1992
5
A fully-lazy lambda lifter in Haskell (context) - Jones, Lester - 1991
2
Removing higher-order expressions by program transformation (context) - Chin, Darlington - 1991
Documents on the same site (http://www.math.jussieu.fr/~fermigie/fermivista/ftp/ftp.dcs.gla.ac.uk.html): More
Space-saving Optimisations for the Glasgow Haskell Compiler - O'Sullivan (1994)
(Correct)
ESPRIT Basic Research Action 6309 FIDE - Deliverable Id
(Correct)
Formally Based Profiling for Higher-Order Functional Languages - Sansom, Jones (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC