(Enter summary)
Abstract: this paper, that results from this kind of
analysis are, in a sense, polymorphic. This confirms an earlier conjecture [19], and shows
how the technique can be applied to first-order polymorphic functions.
The paper is organised as follows. In the next section, we review projection-based
strictness analysis very briefly. In Section 3 we introduce the types we will be working
with: they are the objects of a category. We show that parameterised types are functors,
with certain cancellation... (Update)
Context of citations to this paper: More
.... This has been done with good results at first order for binding time analysis [Lau91a] and for the analogous backward strictness analysis [HL92], though the results are slightly weaker than for monomorphic analysis. For BHA style strictness analysis, an approach to handling...
.... strictness analysis Wadler and Hughes [WH87] give an analysis technique for a first order monomorphic language, Hughes and Launchbury [HL92] for a first order polymorphic language, and Davis and Wadler [DW91] for a higher order monomorphic language. The situation is similar for...
Cited by: More
Compiling Laziness Using Projection Types - Baker-Finch
(Correct)
Abstract Interpretation of Functional Languages: From Theory to.. - Hunt (1991)
(Correct)
Projection-Based Termination Analysis - Kei Davis
(Correct)
Active bibliography (related documents): More All
1.0: Semantic Analyses for Storage Management Optimizations in.. - Park (1991)
(Correct)
0.7: Strictness Analysis - Another Method - Winikoff (1993)
(Correct)
0.6: Automatic Parallelization of Lazy Functional Programs - Hogen, Kindler, Loogen (1992)
(Correct)
Similar documents based on text: More All
0.3: Representing Demand by Partial Projections - Launchbury, Baraki (1993)
(Correct)
0.3: How Much Non-strictness do Lenient Programs Require? - Schauser, Goldstein (1995)
(Correct)
0.3: Inference of Polymorphic and Conditional Strictness Properties - Jensen (1998)
(Correct)
Related documents from co-citation: More All
4: Projection Factorisations in Partial Evaluation (context) - LAUNCHBURY - 1991
4: Projections for strictness analysis
- Wadler, Hughes - 1987
3: Frontiers and open sets in abstract interpretation (context) - Hunt - 1989
BibTeX entry: (Update)
Hughes, R.J.M. and Launchbury, J. Projections for polymorphic first-order strictness analysis. Math. Struct. in Comp. Science, vol. 2, pp. 301326, CUP, 1992. http://citeseer.ist.psu.edu/hughes91projections.html More
@article{ hughes92projections,
author = "John Hughes and John Launchbury",
title = "Projections for Polymorphic First-Order Strictness Analysis",
journal = "Mathematical Structures in Computer Science",
volume = "2",
number = "3",
pages = "301-326",
year = "1992",
url = "citeseer.ist.psu.edu/hughes91projections.html" }
Citations (may not include all citations):
221
Denotational Semantics: A Methodology for Language Developme.. (context) - Schmidt - 1986
143
Theorems for Free
- Wadler - 1989
138
Abstract Interpretation of Declarative Languages (context) - Abramsky, Hankin
94
Projections for Strictness Analysis
- Wadler, Hughes
61
The Theory and Practice of Transforming Call-by-Need into Ca.. (context) - Mycroft - 1980
56
Projection Factorisations in Partial Evaluation (context) - Launchbury
54
Strictness Analysis on Non-flat Domains (context) - Wadler
41
Strictness Analysis: a Practical Approach (context) - Clack, Peyton-Jones - 1985
36
Lazy Functional Languages: Abstract Interpretation and Compi.. (context) - Burn - 1991
28
Compile-time Analysis of Functional Programs (context) - Hughes - 1990
28
The Theory of Strictness Analysis for Higher-order Functions (context) - Burn, Hankin et al. - 1985
23
Strictness Analysis Aids Time Analysis
- Wadler - 1988
21
Higher-order Strictness Analysis for Untyped Lambda Calculus (context) - Hudak, Young - 1986
20
A Compositional Approach to Time Analysis of First Order Laz.. (context) - Bjerner, Holmstrom - 1989
18
A Relational Approach to Strictness Analysis for Higher-Orde..
- Abramsky, Jensen - 1991
16
Strictness Detection in Non-Flat Domains (context) - Hughes - 1985
16
The Category-Theoretic Solution of Recursive Domain Equation.. (context) - Smith, Plotkin - 1982
13
Finding Fixed Points in Finite Lattices (context) - Martin, Hankin
12
Compiling Strictness into Streams (context) - Hall, Wise - 1987
10
PERs generalise Projections for Strictness Analysis (context) - Hunt - 1991
10
Detecting Sharing of Partial Applications in Functional Prog.. (context) - Goldberg - 1987
10
Implementation and Programming Techniques for Functional Lan.. (context) - Wray - 1986
10
Inverse Image Analysis Generalises Strictness Analysis (context) - Dybjer
9
Analysing Strictness by Abstract Interpretation of Continuat.. (context) - Hughes
9
Handbook in Theoretical Computer Science (context) - Scott, Gunter et al. - 1992
9
A Note on Abstract Interpretation of Polymorphic Functions (context) - Baraki - 1991
7
Abstract Interpretation of First-order Polymorphic Functions (context) - Hughes - 1988
7
Semantic Parametricity in Polymorphic Lambda Calculus (context) - Freyd, Girard et al. - 1988
6
Colloque sur la Programmation (context) - Reynolds, of et al. - 1974
4
Categories for the Working Hardware Designer (context) - Sheeran - 1990
3
A Relation between Abstract Interpretation and Projection An.. (context) - Burn - 1990
3
Workshop on Programs as Data Objects (context) - Abramsky, Analysis et al. - 1985
3
Towards Relating Forwards and Backwards Analyses (context) - Hughes, Launchbury - 1991
2
IFIP Workshop on Partial Evaluation and Mixed Computation (context) - Hughes, of et al. - 1987
1
IFIP Workshop on Partial Evaluation and Mixed Computation (context) - Launchbury, Specialisation - 1987
1
Abstract interpretation: a unified lattice-theoretic model f.. (context) - Cousot, Cousot - 1977
1
Abstract reference counting (context) - Hudak
Documents on the same site (http://www.cs.chalmers.se/~rjmh/index.html): More
Generalising Monads to Arrows - Hughes (1998)
(Correct)
Implementing Projection-based Strictness Analysis - Kubiak, Hughes, Launchbury (1992)
(Correct)
Fast Abstract Interpretation Using Sequential Algorithms - Ferguson, Hughes (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