Optimising the Memory Management of Higher-Order Functional Programs

See this document in CiteSeerX!

Optimising the Memory Management of Higher-Order Functional Programs (1997) (Make Corrections) (3 citations)
Markus Mohnen

Home/Search Context Related

View or download:
i2.informatik.rwthaachen....diss.ps.gz
Cached: PS.gz PS PDF Image Update Help

From: i2.informatik.rwthaachen...index (more)
(Enter author homepages)

Rate this article:

(best)
Comment on this article

(Enter summary)
Abstract: Interpretation : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 35 4.1 Abstract Domains . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 4.2 Interpretation of Selectors and Constructors . . . . . . . . . . . . . . . . . . . 40 4.3 Interpretation of (Partial) Applications . . . . . . . . . . . . . . . . . . . . . . 44 4.4 The Complete Abstract Interpretation . . . . . . . . . . . . . . . . . . . . . . 44 4.5 EOEcient Computation of E . . . . . . . . . . . . . . . ... (Update)

Context of citations to this paper: More

.... of special language constructs and analysis using unique objects [21, 1, 24] some are solely based on compiler analyses [7, 12, 18, 10], and others combine it with special memory layout techniques [23] In this work we develop a purely analysis based memory management...

...analysed in terms of the denotational semantics. An example for such a property is the escape behaviour of functional programs [PG92,Moh97a]. It allows the prediction of the reachability of data structures in the graph reduction implementation of functional programs. In...

Cited by: More
Practical Aspects for a Working Compile Time Garbage .. - Mazur, Ross.. (2001) (Correct)
Fixed Points in Metrified Quasi Ordered Sets: Modelling Escaping.. - Mohnen (Correct)
Practical Aspects for a working Compile Time Garbage .. - Mazur, Ross.. (2001) (Correct)

Active bibliography (related documents): More All
1.0: Using Quasi Ordered Sets to Model Program Properties Denotationally - Mohnen (1997) (Correct)
0.9: FUNC: A Functional Language... and more! - Mohnen (Correct)
0.8: the Garbage Collection Bibliography - Richard Jones (2003) (Correct)

Similar documents based on text: More All
0.4: Improving Integration Quality for Heterogeneous Data Sources - Altareva (2004) (Correct)
0.4: Efficient Compile-Time Garbage Collection for Arbitrary Data.. - Mohnen (1995) (Correct)
0.4: Design and Evaluation of a Bandwidth Broker that Provides Network .. - Sander (2003) (Correct)

Related documents from co-citation: More All
2: Debugging and Optimization Using the Ciao System Preprocessor (context) - Hermenegildo, Bueno et al. - 1999
2: A model for inter-module analysis and optimizing compilation - Bueno, Garc et al. - 2000
2: Live-structure analysis for logic programming languages with declarations - Bruynooghe, Janssens et al. - 1996

BibTeX entry: (Update)

M. Mohnen. Optimising the Memory Management of Higher{Order Functional Programs. Technical Report AIB-97-13, RWTH Aachen, 1997. PhD Thesis. http://citeseer.ist.psu.edu/mohnen97optimising.html More

@misc{ mohnen97optimising,
  author = "M. Mohnen",
  title = "Optimising the Memory Management of Higher{Order Functional Programs",
  text = "M. Mohnen. Optimising the Memory Management of Higher{Order Functional
    Programs. Technical Report AIB-97-13, RWTH Aachen, 1997. PhD Thesis.",
  year = "1997",
  url = "citeseer.ist.psu.edu/mohnen97optimising.html" }

Citations (may not include all citations):
385 A Transformation System for Developing Recursive Programs - Burstall, Darlington - 1977
359 The Implementation of Functional Programming Languages (context) - Jones - 1987
346 Denotational Semantics: The ScottStrachey Approach to Progra.. (context) - Stoy - 1977
324 Deforestation: transforming programs to eliminate trees - Wadler - 1990
244 Imperative functional programming - Jones, Wadler
228 A Technique for High-Performance Data Compression (context) - Welch
210 Implementing Lazy Functional Languages on Stock Hardware: Th.. - Jones - 1992
193 Abstract Interpretation: A Unied Lattice Model for Static An.. (context) - Cousot, Cousot - 1977
167 Garbage collection in an uncooperative environment (context) - Boehm, Weiser - 1988
161 A Short Cut to Deforestation - Gill, Launchbury et al.
138 Abstract Interpretation of Declarative Languages (context) - Abramsky, Hankin - 1987
138 Functional Programming and Parallel Graph Rewriting (context) - Plasmeijer, van Eekelen - 1993
120 The Java Virtual Machine Specication (context) - Lindholm, Yellin - 1997
88 Implementation of the Typed Call-by-Value calculus using a S.. (context) - Tofte, Talpin - 1994
83 From Region Inference to von Neumann Machines via Region Rep.. - Birkedal, Tofte et al. - 1996
79 Shortcut deforestation in calculational form - Takano, Meijer - 1995
73 Unboxed Values as First Class Citizens in a Non-Strict Funct.. - Jones, Launchbury - 1991
69 Compiling Lazy Functional Languages (context) - Johnsson - 1987
67 Strictness Analysis for Higher-Order Functions (context) - Burn, Hankin et al. - 1986
61 The Theory and Practice of Transforming Call-by-Need into Ca.. (context) - Mycroft - 1980
61 ControlFlow Analysis of HigherOrder Languages or Taming Lamb.. - Shivers - 1991
53 Compile-Time Garbage Collection by Sharing Analysis (context) - Jones, Le and et al.
49 and TypeBased Closure Analysis (context) - Banerjee, Modular - 1997
46 Deriving Structural Hylomorphisms From Recursive Denitions - Hu, Iwasaki et al. - 1996
44 Clean A Language for Functional Graph Rewriting (context) - Brus, van Ecklen et al.
43 Lazy Abstract Machine to Execute Supercombinators (context) - Fairbairn, Wray et al.
42 Categorical semantics for higher order polymorphic lambda ca.. (context) - Seely - 1987
38 Escape Analysis on Lists - Park, Goldberg - 1992
37 Types as Abstract Interpretations (context) - Cousot
36 Compiling Lazy Functional Languages (context) - Augustsson - 1987
35 Implementing Functional Languages: A Tutorial (context) - Jones, Lester - 1991
28 Strictness Analysis and Polymorphic Invariance (context) - Abramsky
28 Safe fusion of functional expressions II: Further improvemen.. (context) - Chin - 1994
28 When will deforestation stop (context) - Ferguson, Wadler - 1988
28 Analysis of Functional Programs to Detect RunTime Garbage Ce.. (context) - Inoue, Seki et al. - 1988
28 The Theory of Strictness Analysis for Higher Order Functions (context) - Burn, Hankin et al.
27 second edition (context) - Flanagan, Nutshell - 1997
26 Garbage Collection (context) - Jones, Lins - 1996
26 the Complexity of Escape Analysis (context) - Deutsch
21 A generalization of Dijkstra's algorithm (context) - Knuth - 1977
21 A Backward Analysis for Compile-time Garbage Collection (context) - Jensen, Mogensen
21 Listlessness is Better than Laziness (context) - Wadler - 1984
19 Higher Order Deforestation - Hamilton - 1996
18 Information and Control (context) - de Bakker, Zucker et al. - 1982
17 Guaranteeing Safe Destructive Updates through a Type System .. - Smetsers, Barendsen et al. - 1994
17 Compile-time Garbage Collection for Higher-Order Functional .. (context) - Hughes - 1992
17 Deforestation for HigherOrder Functions - Marlow, Wadler
15 Assessing the Evaluation Transformer Model of Reduction on t.. - Finne, Burn
14 Compilation by Transformation in NonStrict Functional Langua.. - Santos - 1995
14 A Grammar-Based Data-Flow Analysis to Stop Deforestation (context) - rensen - 1994
14 Constraints to Stop HigherOrder Deforestation - Seidl, rensen
14 An Introduction to Abstract Interpretation (context) - Abramsky, Hankin
14 Compile-Time Garbage Collection by Necessity Analysis (context) - Hamilton, Jones
13 Improving the Three Instruction Machine (context) - Argo
13 Higher Order Escape Analysis: Optimizing Stack Allocation in.. (context) - Goldberg, Park
10 Uniqueness Type Inference (context) - Barendsen, Smetsers
9 Listlessness is better than laziness II: composing listless .. (context) - Wadler
8 Bounded Fixed-Point Iteration (context) - Nielson, Nielson - 1992
8 Grundlagen der funktionalen Programmierung (context) - Thiemann - 1994
8 Inductive Assertion Synthesis and a Language Due to Dijkstra (context) - Jones, Muchnick et al. - 1981
8 Bounded Fixed Point Iteration (context) - Nielson, Nielson
7 The ins and outs of Clean I/O - Achten, Plasmeijer - 1995
7 Integer Constraints to Stop Deforestation - Seidl - 1996
7 On Functors Expressible in the Polymorphic Lambda Calculus (context) - Reynolds, Plotkin - 1990
6 Denotational semantics in the cpo and metric approach (context) - Baier, Majster-Cederbaum - 1994
5 Programming Research Group - Wadsworth, pragmatics et al. - 1971
5 Semantics of Types in Programming Languages - Gunter - 1994
5 CompileTime Garbage Collection for Lazy Functional Languages (context) - Hamilton - 1995
5 Functional Programming (context) - Launchbury, Sansom - 1992
5 The nob Benchmark Suite of Haskell Programs (context) - Partain
4 EOEcient Closure Utilisation by Higher-Order Inheritance Ana.. (context) - Mohnen
4 A Semantic Model of Binding Times for Safe Partial Evaluatio.. - Henglein, Sands
4 Proceedings of the 19th Symposium on Principles of Programmi.. (context) - of, Symposium et al. - 1992
4 Proceedings of the 24th Symposium on Principles of Programmi.. (context) - of, Symposium et al. - 1997
4 Number 25 in EATCS Monographs of Theoretical Computer Scienc.. (context) - Wechler, for - 1992
4 Metric completion versus ideal completion (context) - Majster-Cederbaum, Baier - 1996
3 Space eOEcient conservative garbage collection (context) - Boehm - 1991
3 EOEcient Compile-Time Garbage Collection for Arbitrary Data .. (context) - Mohnen
3 Finiteness Conditions for Fixed Point Iteration (context) - Nielson, Nielson - 1992
3 An Experiment in Compile Time Garbage Collection (context) - Jones - 1995
2 Using Quasi Ordered Sets to Model Program Properties Denotat.. - Mohnen - 1997
2 number 217 in Lecture Notes in Computer Science (context) - Ganzinger, Jones et al. - 1986
2 Analysis and eOEcient implementation of functional programs (context) - Sestoft - 1991
2 Number 21 in Cambridge Tracts in Theoretical Computer Scienc.. (context) - Stoltenberg-Hansen, Lindstr et al. - 1994
2 Doaitse Swierstra (context) - Hermenegildo - 1995
1 Functional Specication of Imperative Programs: An Alternativ.. (context) - Mohnen - 1995
1 Region Inference for HigherOrder Functional Languages (context) - Tofte
1 Is Compile Time Garbage Collection Worth The Eoeort (context) - Jones, White
1 EOEcient FixPoint Computation (context) - Vergauwen, Wauman et al. - 1994
1 Escape Analysis Revisited (context) - Mohnen - 1998
1 Measuring the eoeectiveness of a simple strictness analyser (context) - Jones, Partain - 1993
1 FUNC: A Functional Language : : : and more (context) - Mohnen - 1995
1 Lattice Theory: First Conzepts and Distributive Lattices (context) - Gr - 1971
1 Strictness analysis on nonAEat domains (context) - Wadler
1 Functional Programming (context) - Jones, Hutton et al. - 1990
1 BUGS in Writing: A Guide to Debugging Your Prose (context) - Dupr - 1995
1 Optimising Lazy Functional Programs Using Flow Inference (context) - Fax

Documents on the same site (http://www-i2.informatik.rwth-aachen.de/Staff/Former/mohnen/PUBLICATIONS/index.html): More
Using Quasi Ordered Sets to Model Program Properties Denotationally - Mohnen (1997) (Correct)
Efficient Compile-Time Garbage Collection for Arbitrary Data.. - Mohnen (1995) (Correct)
Efficient Closure Utilisation by Higher-Order Inheritance Analysis - Mohnen (1995) (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