MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  PERs from projections for binding-time analysis (1995) [1 citations — 0 self]

Download:
Download as a PDF | Download as a PS
by Kei Davis
Journal of Lisp and Symbolic Computation
ftp://ftp.dina.kvl.dk/pub/Staff/Peter.Sestoft/pepm94-proceedings/davis.ps.gz
Add To MetaCart

Abstract:

First-order projection-based binding-time analysis has proven genuinely useful in partial evaluation [Lau91a, Lau91c]. There have been three notable generalisations of projection-based analysis to higher order. The first lacked a formal basis [Mog89]; the second used structures strictly more general that projections, namely partial equivalence relations (PERs) [HS91]; the third involved a complex construction that gave rise to impractically large abstract domains [Dav93]. This paper presents a technique free of these shortcomings: it is simple, entirely projection-based, satisfies a formal correctness condition, and gives rise to reasonably small abstract domains. Though the technique is cast in terms of projections, there is also an interpretation in terms of PERs. The principal limitation of the technique is the restriction to monomorphic typing.

Citations

203 The lazy lambda calculus – Abramsky - 1990
68 Binding Time Analysis for Higher Order Untyped Functional Languages – Consel - 1990
51 Strictness analysis on non-flat domains (by abstract interpretation over finite domains – Wadler - 1987
46 Abstract interpretation, logical relations and Kan extensions – Abramsky - 1990
45 Projection Factorisations in Partial Evaluation – Launchbury - 1989
44 Automatic program specialization: A re-examination from basic principles – Jones
39 Polymorphic binding-time analysis – Henglein, Mossin - 1994
32 A self-applicable partial evaluator for the lambda-calculus: Correctness and pragmatics – Gomard - 1992
30 Binding Time Analysis: A New PERspective – Hunt, Sands - 1991
23 Abstract Interpretation in Logical Form – Jensen - 1992
17 A strongly-typed self-applicable partial evaluator – Launchbury - 1991
14 Projections for specialisation – Launchbury - 1988
13 PERs generalise projections for strictness analysis – Hunt - 1990
12 Higher-order Binding-time Analysis – Davis - 1993
10 A note on abstract interpretation of polymorphic functions – Baraki - 1989
7 Abstract Interpretation of Polymorphic Higher-Order Functions – Baraki - 1993
6 Polymorphic strictness analysis using frontiers – Seward - 1993
3 Binding-time analysis for polymorphically typed higher order languages – Mogensen - 1989
2 Automatic bindingtime analysis for a typed -calculus – Nielson, Nielson - 1988
2 Static properties of partial reduction – Schmidt
1 Projection-based Program Analysis.Thesis submitted for degree of – Davis - 1994
1 Projection-based Program Analysis. Thesis submitted for degree of – Davis - 1994