Young Gil Park  Home/Search
Context Related
| nyu.edu/pub/techreports/tr597.ps.Z de/pub/languages/nyu.edu/t...tr597.ps.Z 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: hypatia.dcs.qmw...tional.implemen (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: One of the major overheads in implementing functional languages is the storage management overhead due to dynamic allocation and automatic reclamation of indefinite-extent storage. This dissertation investigates the problems of statically inferring lifetime information about dynamically-allocated objects in higher-order polymorphic functional languages, both strict and non-strict, and of applying that information to reduce the storage management overhead. We have developed a set of compile-time ... (Update)
Context of citations to this paper: More
...was actually copied. 7. Sharing Analysis to Optimize Polymorphic Tag Free GC Many papers (e.g. Deutsch90] ISY88] JLM89] [Park91]) have been published recently describing algorithms for detecting sharing of aggregate structures in a program. We do not describe a new...
.... that, using the principle of abstract interpretation, the abstract escape semantics is a safe abstraction of the exact escape semantics [16]. The termination of interpretation under the abstract escape semantics can be proved as follows: Since nml functions are recursive,...
Cited by: More
the Garbage Collection Bibliography - Richard Jones (2003) (Correct)
Escape Analysis on Lists - Park, Goldberg (1992) (Correct)
Polymorphic Type Reconstruction for Garbage Collection without .. - Goldberg, Gloger (1992) (Correct)
Active bibliography (related documents): More All
1.0: Projections for Polymorphic First-Order Strictness Analysis - Hughes, Launchbury (1991) (Correct)
0.8: Analysis and Efficient Implementation of Functional Programs - Sestoft (1991) (Correct)
0.7: A New Framework for Strictness Analysis Using Demand Propagation - Tremblay, Gao (Correct)
Similar documents based on text: More All
0.3: Fast Escape Analysis and Stack Allocation for Object-Based.. - Gay, Steensgaard (2000) (Correct)
0.3: Escape Analysis for Java. Theory and Practice - Blanchet (2003) (Correct)
0.2: Escape Analysis: Final Report for EPSRC grant GR/R53401 - Hill (2002) (Correct)
Related documents from co-citation: More All
3: IEEE Press (context) - International, Computer - 1985
3: Compile-time garbage collection by sharing analysis (context) - Jones, Le M'etayer - 1989
3: ORBIT: An Optimizing Compiler for Scheme (context) - Kranz - 1988
BibTeX entry: (Update)
Park, Y.G. Semantic Analyses for Storage Management Optimizations in Functional Language Implementations. Ph.D. Thesis, New York University, 1991. http://citeseer.ist.psu.edu/park91semantic.html More
@techreport{ park92semantic,
author = "G. Park",
title = "Semantic Analyses for Storage Management Optimizations in Functional Language Implementations",
number = "TR1992-597",
month = ",",
year = "1992",
url = "citeseer.ist.psu.edu/park91semantic.html" }
Citations (may not include all citations):815 Abstract interpretation: a unified lattice model for static .. (context) - Cousot, Cousot - 1977
809 A theory of type polymorphism in programming (context) - Milner - 1978
729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
388 On understanding types (context) - Cardelli, Wegner - 1985
359 The Implementation of Functional Programming Languages (context) - Jones - 1987
346 Denotational Semantics: The Scott-Strachey Approach to Progr.. (context) - Stoy - 1977
312 Systematic design of program analysis frameworks (context) - Cousot, Cousot - 1979
273 Can programming be liberated from the von Neumann style (context) - Backus - 1978
252 Analysis of pointers and structures (context) - Chase, Wegman et al. - 1990
221 Denotational Semantics - A Methodology for Language Developm.. (context) - Schmidt - 1986
220 Orbit: an optimizing compiler for Scheme (context) - Kranz, Kelsey et al. - 1986
220 ORBIT: An Optimizing Compiler for Scheme (context) - Kranz - 1988
173 A real-time garbage collector based on the lifetime of objec.. - Lieberman, Hewitt - 1983
138 Abstract Interpretation of Declarative Languages (context) - Abramsky, Hankin - 1987
94 Projections for strictness analysis - Wadler, Hughes - 1987
86 Functional Programming (context) - Field, Harrison - 1988
85 Garbage collection can be faster than stack allocation - Appel - 1987
81 Distributed garbage collection using reference counting (context) - Bevan - 1987
81 Garbage collection of linked data structures (context) - Cohen - 1981
74 Replacing function parameters by global variables (context) - Sestoft - 1989
72 A semantic model of reference counting and its abstraction - Hudak - 1986
70 A standard ML compiler - Appel, MacQueen - 1987
68 Program Flow Analysis: Theory and Applications (context) - Muchnick, Jones - 1981
68 On determining lifetime and aliasing of dynamically allocate.. (context) - Deutsch - 1990
67 Strictness analysis of higher-order functions (context) - Burn, Hankin et al. - 1986
63 and application of functional programming languages (context) - Hudak, evolution - 1989
63 Three approaches to type structure (context) - Reynolds - 1985
61 Detecting global variables in denotational specifications (context) - Schmidt - 1985
55 An efficient garbage collection scheme for parallel computer.. - Watson, Watson - 1987
54 Strictness analysis on non-flat domains (context) - Wadler - 1987
53 Compile-time garbage collection by sharing analysis (context) - Jones, Le Metayer - 1989
44 Data flow analysis of applicative programs using minimal fun.. (context) - Jones, Mycroft - 1986
41 Strictness analysis - a practical approach (context) - Clark, Jones - 1985
41 Lifetime analysis of dynamically allocated objects (context) - Ruggieri, Murtagh - 1988
40 A denotational framework for data flow analysis (context) - Nielson - 1982
39 Massachusetts Institute of Technology (context) - Jr, for et al. - 1978
35 The essence of ML (context) - Mitchell, Harper - 1988
32 Functional Programming: Application and Implementation (context) - Henderson - 1980
28 Strictness analysis and polymorphic invariance (context) - Abramsky - 1986
28 Analysis of functional programs to detect run-time garbage c.. (context) - Inoue, Seki et al. - 1988
25 Generational reference counting: a reduced-communication dis.. (context) - Goldberg - 1989
23 Safety consideration for storage allocation optimizations (context) - Chase - 1988
22 The aggregate update problem in functional programming syste.. (context) - Hudak, Bloss - 1985
21 A backward analysis for compile-time garbage collection (context) - Jensen, Morgensen - 1990
19 Optimization of very high level languages (context) - Schwartz - 1975
19 Code optimizations for lazy evaluation (context) - Bloss, Hudak et al. - 1988
18 A relational approach to strictness analysis for higherorder.. - Abramsky, Jensen - 1991
18 A protocol for distributed reference counting (context) - Lermen, Mauer - 1986
17 Abstract Interpretation and Optimizing Transformations for A.. (context) - Mycroft - 1981
17 An optimizing compiler for lexically scoped LISP (context) - Brooks, Gabriel et al. - 1982
17 Path semantics (context) - Bloss, Hudak - 1987
16 Strictness detection in non-flat domains (context) - Hughes - 1986
16 Copy elimination in functional languages (context) - Gopinath, Hennessy - 1989
15 An efficient incremental automatic garbage collector (context) - Deutsch, Bobrow - 1976
14 Finding fixpoints in abstract interpretation (context) - Jones, Clark - 1987
13 The Theory and Practice Semantic Program Analysis for Higher.. (context) - Young - 1989
13 A relationship between abstract interpretation and projectio.. (context) - Burn - 1990
13 Higher order escape analysis: optimizing stack allocation in.. (context) - Goldberg, Park - 1990
13 Finding fixed points in finite lattices (context) - Martin, Hankin - 1987
12 Compiling strictness into streams (context) - Hall, Wise - 1987
11 A Practical Introduction to Denotational Semantics (context) - Allison - 1986
11 Binding time optimization in programming languages: an appro.. (context) - Jones, Muchnick - 1976
10 Frontiers and open sets in abstract interpretation (context) - Hunt - 1989
10 Detecting sharing of partial applications in functional lang.. (context) - Goldberg - 1987
10 Variations on strictness analysis (context) - Bloss, Hudak - 1986
8 Collecting interpretations of expressions (context) - Hudak, Young - 1988
8 Detecting Stack-Based Environments in Denotational Definitio.. (context) - Schmidt - 1986
8 A compositional analysis of evaluation-order and its applica.. (context) - Draghicescu, Purushothaman - 1990
7 Reference escape analysis: Optimizing reference counting bas.. (context) - Park, Goldberg - 1991
7 Multiprocessor List Memory Management (context) - Rudalics - 1988
7 FLIC - a Functional language intermediate code (context) - Jones - 1988
7 Abstract interpretation of first-order polymorphic functions (context) - Hughes - 1988
6 Path Analysis: Using Order-of-Evaluation Information to Opti.. (context) - Bloss - 1989
6 Garbage Collection and Other Optimizations - Chase - 1987
4 Lifetime analysis for procedure parameters (context) - Kastens, Schmidt - 1986
4 Dynamic Memory Allocation Techniques Based on the Lifetimes .. (context) - Ruggieri - 1987
4 A combinator-based compiler for a functional language (context) - Hudak, Kranz - 1984
3 Strictness Analysis Applied to Programs with Lazy List Const.. (context) - Hall - 1987
3 An optimizing compiler for a modern functional language (context) - Bloss, Hudak et al. - 1988
2 Principle type schemes for functional languages (context) - Damas, Milner - 1982
2 IFIP Workshop on Partial Evaluation and Mixed Computation (context) - Hughes, of - 1987
1 Shifting garbage collection overhead at compile time (context) - Barth - 1977
1 Higher-order strictness for untyped lambda calculus (context) - Hudak, Young - 1986
Documents on the same site (http://hypatia.dcs.qmw.ac.uk/SEL-HPC/Articles/GeneratedHtml/functional.implemen.html): More
Cheap Deforestation for Non-strict Functional Languages - Gill (1996) (Correct)
Incremental Recompilation for Standard ML of New Jersey - Harper, Lee, Pfennig, Rollins (1994) (Correct)
Statistics on Storage Management in a Lazy Functional.. - Wild, Glaser, Hartel (1992) (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