(Enter summary)
Abstract: Strictness analysis is accepted as an important tool for the efficient implementation of lazy functional languages. However, the analyses are usually first-order and the optimisations that follow may be ad hoc. Using projections to represent static properties of programs is appealing because they naturally describe component-wise demand on data structures and can handle latent demands such as head-strictness. However their extension to higher-order functions is problematic. This paper... (Update)
Active bibliography (related documents): More All
0.7: Automatic Extraction of Context Information From Programs .. - Schütz, Schmidt-Schauß (1997)
(Correct)
0.6: Representing Demand by Partial Projections - Launchbury, Baraki (1993)
(Correct)
0.5: Intersection Type Assignment Systems - van Bakel (1995)
(Correct)
Similar documents based on text: More All
0.4: An Operational Semantics for Parallel Lazy Evaluation - Clem Baker-Finch University
(Correct)
0.4: A Unified Approach to Strictness Analysis and Optimising.. - Benton (1996)
(Correct)
0.4: Effective Strictness Analysis with HORN Constraints - Glynn, Stuckey, Sulzmann (2001)
(Correct)
BibTeX entry: (Update)
@misc{ baker-finch-compiling,
author = "Clement A. Baker-Finch",
title = "Compiling Laziness Using Projection Types",
url = "citeseer.ist.psu.edu/434261.html" }
Citations (may not include all citations):
325
Towards a theory of type structure (context) - Reynolds - 1974
283
Theoretical Computer Science (context) - Plotkin, call-by-value et al. - 1975
221
Denotational Semantics: A Methodology for Language Developme.. (context) - Schmidt - 1986
94
Projections for strictness analysis
- Wadler, Hughes - 1987
65
A transformation-based optimiser for Haskell
- Jones, Santos - 1998
56
Projection Factorisations in Partial Evaluation (context) - Launchbury - 1991
48
Backwards analysis of functional programs (context) - Hughes - 1987
35
CPS transformation after strictness analysis
- Danvy, Hatcliff - 1993
25
A new technique for strictness analysis (context) - Wright - 1991
21
Proving the correctness of compiler optimisations based on a..
- Burn, Le M'etayer - 1993
19
Minimal thunkification
- Amtoft - 1993
14
Measuring the effectiveness of a simple strictness analyser
- Jones, Partain - 1993
13
Reduction Types and Intensionality in Lambda Calculus (context) - Wright - 1993
13
Usage analysis with natural reduction types (context) - Wright, Baker-Finch - 1993
12
Parametricity and unboxing with unpointed types
- Launchbury, Paterson - 1996
10
Higher-order binding-time analysis
- Davis - 1993
8
Strictness analysis in 4D
- Davis, Wadler - 1990
6
Non-standard type inference for functional programs (context) - Damiani - 1998
5
Representing demand by partial projections
- Launchbury, Baraki - 1996
4
Projections for polymorphic first-order strictness analysis
- Hughes, Launchbury - 1992
4
Detecting and removing dead-code using rank 2 intersection
- Damiani, Prost
3
Compiling laziness using projections (context) - Paterson - 1996
3
PERs from projections for binding-time analysis
- Davis - 1995
2
A decidable intersection type system based on relevance (context) - Damiani, Giannini - 1994
2
Implementing projection-based strictness analysis
- Kubiak, Hughes et al. - 1992
1
A unified approach to strictness analysis and optimising tra..
- Benton - 1996
1
Type theory and projections for static analysis
- Baker-Finch - 1995
1
Two extensions to Curry's type inference system (context) - Cardonne, Coppo - 1990
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