Simon Peyton Jones, André Santos  Home/Search
Context Related
| informatik.unibonn....simplifier.ps.gz di.ufpe.br/~alms/p...ransf_in_ghc.ps.gz dcs.gla.ac.uk/pub/...y_transf_in_ghc.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: informatik.unibonn....index.body (more) From: math.jussieu.fr...p.dcs.gla.ac.uk (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we describe the full set of local program transformations implemented in the Glasgow Haskell Compiler. The transformations are presented as source to source transformations in a simple functional language. The idea is that by composing these simple and small high level transformations one can achieve most of the benefits of more complicated and specialised transformations, many of which are often implemented as code generation optimisations. 1 Motivation Quite a few compilers use ... (Update)
Context of citations to this paper: More
...directly. 4. 3 A Desugarer The Glasgow Haskell Compiler ghc compiles Haskell programs by translation into an intermediate language Core [PS94, Pey96]. The part which performs this translation is called desugarer, because it removes the syntactic sugar like patternmatching, list...
.... context patterns is the need for an adequate method for describing transformations, e.g. in optimising compilers written in Haskell [PS94, Pey96]. Such functions typically recursively search for an instance a subpattern in a value (aka program) and replace this instance....
Cited by: More
Once Upon a Type - Turner, Wadler, Mossin (1997) (Correct)
Automatic Extraction of Context Information From Programs .. - Schütz, Schmidt-Schauß (1997) (Correct)
Implementing Context Patterns in the Glasgow Haskell Compiler - Mohnen, Tobies (1997) (Correct)
Similar documents (at the sentence level):
17.9%: Compilation by Transformation in Non-Strict Functional Languages - Santos (1995) (Correct)
Active bibliography (related documents): More All
0.4: Realizing State-Based Database Concepts in a Non-Strict.. - Ichikawa (1998) (Correct)
0.3: A transformation-based optimiser for Haskell - Jones, Santos (1998) (Correct)
0.3: Compiling Haskell by program transformation: a report from the.. - Jones (1996) (Correct)
Similar documents based on text: More All
0.1: Declarative systems architecture: a quantitative approach (AQUA).. - Jones (Correct)
0.1: Let-Floating: Moving Bindings to Give Faster Programs - Jones, Partain, Santos (1996) (Correct)
0.0: IDIOM: Integrating Dependent and-, Independent and-, .. - Gupta, Costa, Yang, .. (1991) (Correct)
Related documents from co-citation: More All
8: A natural semantics for lazy evaluation - Launchbury - 1993
7: ORBIT - an optimising compiler for Scheme (context) - Kranz - 1988
7: A call-by-need lambda calculus - Ariola, Felleisen et al. - 1995
BibTeX entry: (Update)
SL Peyton Jones & A Santos [1994], "Compilation by transformation in the Glasgow Haskell Compiler," in Functional Programming, Glasgow 1994 , K Hammond, DN Turner & PM Sansom, eds., Workshops in Computing, Springer Verlag, 184--204. http://citeseer.ist.psu.edu/peytonjones94compilation.html More
@misc{ jones94compilation,
author = "S. Jones and A. Santos",
title = "Compilation by transformation in the Glasgow Haskell Compiler",
text = "SL Peyton Jones & A Santos [1994], Compilation by transformation in the
Glasgow Haskell Compiler, in Functional Programming, Glasgow 1994 , K Hammond,
DN Turner & PM Sansom, eds., Workshops in Computing, Springer Verlag, 184--204.",
year = "1994",
url = "citeseer.ist.psu.edu/peytonjones94compilation.html" }
Citations (may not include all citations):521 Compiling with Continuations (context) - Appel - 1992
324 Deforestation: Transforming programs to eliminate trees - Wadler - 1990
161 A short cut to deforestation - Gill, Launchbury et al. - 1993
146 The Glasgow Haskell compiler: a technical overview - Jones, Hall et al. - 1993
89 closure-passing style (context) - Appel, Jim - 1989
84 Lambda lifting: Transforming programs to recursive equations - Johnsson - 1985
53 Realistic compilation by program transformation - Kelsey, Hudak - 1989
40 Unboxed values as first class citizens (context) - Jones, Launchbury - 1991
32 Automatic Methods for Program Transformation (context) - Chin - 1990
29 of Programming Languages. PhD thesis, Programming Research G.. - Hughes, Implementation - 1983
19 ORBIT - an optimising compiler for Scheme (context) - Kranz - 1988
17 Deforestation for higher-order functions - Marlow, Wadler
15 Compilation by Program Transformation (context) - Kelsey - 1989
13 A modular fully-lazy lambda lifter in Haskell - Jones, Lester - 1991
7 The nofib benchmarking suite (context) - Partain
5 Functional Programming (context) - Launchbury, Sansom - 1992
5 MERILL: An equational reasoning system in Standard ML (context) - Matthews - 1993
2 Analysing a set of transformation rules using completion (context) - Matthews - 1994
2 the effectiveness of a simple strictness analyser (context) - Jones, Partain - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.informatik.uni-bonn.de/~ralf/index.body.html): More
Compiling Haskell by program transformation: a report from the.. - Jones (1996) (Correct)
Implementing lazy functional languages on stock hardware: the.. - Jones (1992) (Correct)
Generational garbage collection for Haskell - Sansom, Jones (1993) (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