Pieter Hartel, Hugh Glaser, John Wild  Home/Search
Context Related
| src.doc.ic.ac.uk/pub...1.3.flogra.ps.gz hpc.doc.ic.ac.uk/ala...1.3.flogra.ps.gz 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: src.doc.ic.ac.uk/public/i...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: To implement lazy functional languages efficiently it is necessary for a compiler analyse many properties of the program. Analysis techniques proposed to support such implementations have a similar structure and each analysis is of sufficient complexity that it requires a significant body of research to exploit to the full. We present flow graphs as a formal framework to support the different program analysis and synthesis techniques providing the structure for such a compiler. We have formally ... (Update)
Context of citations to this paper: More
...including the benchmark programs, are elaborated on in the following sections. 2. 1 Compiled graph reduction The FAST compiler [Hartel91a] which has been developed at Southampton University in the UK, translates lazy functional programs into super combinators and outputs...
...used are flexible, with data space frequently allocated at run time. We use many powerful compilation techniques in our compiler [5]. Our analysis greatly reduces our dependence on the storage manager and graph reducer to the extent that some smaller problems can...
Cited by: More
Thunk Lifting: reducing the Heap Usage in an Implementation.. - Haydarlou, Hartel (1995) (Correct)
Compilation of Functional Languages Using Flow Graph Analysis - Hartel, Glaser, Wild (1994) (Correct)
Declarative Solutions to Partitioned-Grid Problems - Etalle, Hartel, Vree (1998) (Correct)
Active bibliography (related documents): More All
0.4: Statistics on Storage Management in a Lazy Functional.. - Wild, Glaser, Hartel (1992) (Correct)
0.3: On the Benefits of Different Analyses in the Compilation.. - Hartel, Glaser, Wild (1991) (Correct)
0.3: A Pragmatic Approach to the Analysis and Compilation of.. - Glaser, Hartel, Wild (1990) (Correct)
Similar documents based on text: More All
0.4: Programming by Numbers: A programming method for novices - Glaser, Hartel, Garratt (1998) (Correct)
0.4: Programming by Numbers - A programming method for complete.. - Glaser, Hartel (1998) (Correct)
0.2: The Functional "C" Experience - Hartel, Muller, Glaser (2002) (Correct)
Related documents from co-citation: More All
13: Report on the Programming Language Haskell: A Non-Strict (context) - Hudak - 1992
12: Design considerations for a parallel reduction machine (context) - Vree - 1989
10: Miranda: A non-strict functional language with polymorphic types (context) - Turner - 1985
BibTeX entry: (Update)
P. H. Hartel, H. W. Glaser, and J. M. Wild. Compilation of functional languages using flow graph analysis. Software---practice and experience, 24(2):127--173, Feb 1994. http://citeseer.ist.psu.edu/article/hartel94compilation.html More
@article{ hartel94compilation,
author = "Pieter H. Hartel and Hugh Glaser and John. M. Wild",
title = "Compilation of Functional Languages using Flow Graph Analysis",
journal = "Software - Practice and Experience",
volume = "24",
number = "2",
pages = "127-173",
year = "1994",
url = "citeseer.ist.psu.edu/article/hartel94compilation.html" }
Citations (may not include all citations):346 Denotational semantics: the Scott-Strachey approach to progr.. (context) - Stoy - 1977
143 A new implementation technique for applicative languages (context) - Turner - 1979
138 Abstract interpretation of declarative languages (context) - Abramsky, Hankin - 1987
66 Efficient compilation of lazy evaluation - Johnsson - 1984
66 Attribute grammars as a functional programming paradigm - Johnsson - 1987
54 Strictness analysis on non-flat domains (context) - Wadler - 1987
48 Backwards analysis of functional programs (context) - Hughes - 1987
41 Strictness analysis - a practical approach (context) - Clack, Jones - 1985
37 Flow analysis of lazy higher-order functional programs (context) - Jones - 1987
28 Compile-time analysis of functional programs (context) - Hughes - 1990
25 Design considerations for a parallel reduction machine (context) - Vree - 1989
24 Strictness analysis using abstract reduction (context) - Nocker - 1990
17 Statistics on graph reduction of sasl programs (context) - Hartel, Veen - 1988
8 Interactive programs in a functional language: A functional .. (context) - Koopman - 1987
7 Performance of lazy combinator graph reduction (context) - Hartel - 1989
4 A pragmatic approach to the analysis and compilation of lazy.. - Glaser, Hartel et al. - 1990
1 A new method for strictness analysis on non-flat domains (context) - Jones, le M'etayer - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://src.doc.ic.ac.uk/public/ic.doc/ALA/papers/A.Bennett/fast_works/index): More
An Implementation of Static Functional Process Networks - Stuart Cox (1992) (Correct)
Simulation of Multicache Parallel Graph Reduction - Bennett, Kelly (1992) (Correct)
Program Transformations for Static Process Networks - Stuart Cox (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