## PERs from Projections for Binding-Time Analysis (1994)

### Cached

### Download Links

- [ftp.dina.kvl.dk]
- [ftp.dcs.glasgow.ac.uk]
- [www.c3.lanl.gov]
- DBLP

### Other Repositories/Bibliography

Venue: | Journal of Lisp and Symbolic Computation |

Citations: | 1 - 0 self |

### BibTeX

@ARTICLE{Davis94persfrom,

author = {Kei Davis},

title = {PERs from Projections for Binding-Time Analysis},

journal = {Journal of Lisp and Symbolic Computation},

year = {1994},

volume = {8}

}

### OpenURL

### 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. 1 Introduction and Background We take as given that binding-time analysis is essential for good partial evaluation, and we do not address...

### Citations

239 | The lazy lambda calculus
- Abramsky
- 1990
(Show Context)
Citation Context ...short for n i (). 2.2 Standard semantics The standard S type and expression semantics are defined in Figure 4. Function types give rise to lifted function spaces as in Abramsky's lazy lambda calculus =-=[Abr89]-=-, and the semantics distinguishes those expressions of function type that have WHNF (have value lift f for some f) and those that do not (have value ?). Products are unlifted; a unary sumof -products ... |

68 |
Binding time analysis for higher order untyped functional languages
- Consel
- 1990
(Show Context)
Citation Context ... T P z [[ T1 -? T2 ]] may be restricted to functions that map ? to ? and distribute over u, for all function types T1 -? T2 . (These results follow from those shown in [Dav94].) 8 Related Work Consel =-=[Con90]-=- describes a binding-time analysis for higherorder untyped languages. As in our analysis abstract values have two parts, the first describing the static/dynamic properties of values, and the second de... |

54 |
Abstract interpretation, logical relations, and Kan extensions
- Abramsky
- 1990
(Show Context)
Citation Context ....e [Lambda abstraction] j e1 e2 [Function application] j fix e [Fixed point] Figure 2: Expressions. 2.1 Expression semantics Since two different expression semantics will be given, following Abramsky =-=[Abr90]-=- we define a semantics E parameterised by a set of defining constants. The semantics E is defined in Figure 3; the defining constants are plus, sel i , tuple, inc i , outc i , choose, mkfun, apply, an... |

54 | Strictness analysis on non-flat domains (by abstract interpretation - Wadler - 1987 |

48 |
Automatic program specialization: a re-examination from basic principles
- Jones
- 1988
(Show Context)
Citation Context ...chbury [Lau91a] showed that this safety condition satisfies, and in a sense which he formalises, is equivalent to the correctness condition for binding-time analysis in the general framework of Jones =-=[Jon88]-=-. Using projection-based analysis, Launchbury implemented both monomorphic and polymorphic versions of a partial evaluator for a first-order language. His work culminated in the first strongly-typed p... |

47 |
Projection Factorisations in Partial Evaluation
- Launchbury
- 1991
(Show Context)
Citation Context ... satisfies fl ffi swap v swap ffi FST for swap defined by swap (x; y) = (y; x). Taking fl to be BOT always satisfies the safety condition but tells nothing; greater fl is more informative. Launchbury =-=[Lau91a]-=- showed that this safety condition satisfies, and in a sense which he formalises, is equivalent to the correctness condition for binding-time analysis in the general framework of Jones [Jon88]. Using ... |

36 |
Polymorphic binding-time analysis
- Henglein, Mossin
(Show Context)
Citation Context ...standard denotational semantics or a non-standard typing. Examples in the latter category include those of Gomard [Go92], Jensen [Jen92], the Nielsons [NN88], Schmidt [Sch88], and Henglein and Mossin =-=[HM94]-=-. Our focus is on those techniques based on non-standard interpretation, in particular, those using projections or partial equivalence relations (PERs) as the basic abstract values. A domain projectio... |

34 |
A self-applicable partial evaluator for the lambda calculus: correctness and pragmatics
- Gomard
- 1992
(Show Context)
Citation Context ...satisfy. Analysis techniques can usually be identified as being based on either a non-standard denotational semantics or a non-standard typing. Examples in the latter category include those of Gomard =-=[Go92]-=-, Jensen [Jen92], the Nielsons [NN88], Schmidt [Sch88], and Henglein and Mossin [HM94]. Our focus is on those techniques based on non-standard interpretation, in particular, those using projections or... |

34 | Binding time analysis: A new PERspective
- Hunt, Sands
- 1991
(Show Context)
Citation Context ...s 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 projectio... |

31 |
Abstract Interpretation in Logical Form
- Jensen
- 1992
(Show Context)
Citation Context ...is techniques can usually be identified as being based on either a non-standard denotational semantics or a non-standard typing. Examples in the latter category include those of Gomard [Go92], Jensen =-=[Jen92]-=-, the Nielsons [NN88], Schmidt [Sch88], and Henglein and Mossin [HM94]. Our focus is on those techniques based on non-standard interpretation, in particular, those using projections or partial equival... |

17 |
A strongly-typed self-applicable partial evaluator
- Launchbury
- 1991
(Show Context)
Citation Context ...n-based analysis, Launchbury implemented both monomorphic and polymorphic versions of a partial evaluator for a first-order language. His work culminated in the first strongly-typed partial evaluator =-=[Lau91c]-=----strong evidence for the value of the projection-based approach. There have been three notable attempts to generalise Launchbury's techniques to higher order. The first was Mogensen's generalisation... |

16 | PERs generalise projections for strictness analysis - Hunt - 1990 |

15 |
Projections for specialisation
- Launchbury
- 1987
(Show Context)
Citation Context ...cular, those using projections or partial equivalence relations (PERs) as the basic abstract values. A domain projection is a continuous idempotent function that approximates the identity. Launchbury =-=[Lau88]-=- hit upon the idea of using projections to encode degrees of staticness of data. The basic idea is that a projection maps to ? that part of a data structure that is dynamic (possibly not determined), ... |

13 | Higher-order Binding-time Analysis
- Davis
- 1993
(Show Context)
Citation Context ...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. Th... |

12 | A note on abstract interpretation of polymorphic functions - Baraki - 1989 |

10 | Abstract Interpretation of Polymorphic Higher-Order Functions - Baraki - 1991 |

8 | Polymorphic strictness analysis using frontiers - Seward - 1993 |

5 |
Binding-time analysis for polymorphically typed higher order languages
- Mogensen
- 1989
(Show Context)
Citation Context ...nalysis 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... |

3 |
Automatic binding-time analysis for a typed -calculus (Extended abstract
- Nielson, Nielson
- 1988
(Show Context)
Citation Context ...lly be identified as being based on either a non-standard denotational semantics or a non-standard typing. Examples in the latter category include those of Gomard [Go92], Jensen [Jen92], the Nielsons =-=[NN88]-=-, Schmidt [Sch88], and Henglein and Mossin [HM94]. Our focus is on those techniques based on non-standard interpretation, in particular, those using projections or partial equivalence relations (PERs)... |

3 |
Static properties of partial reduction
- Schmidt
(Show Context)
Citation Context ...d as being based on either a non-standard denotational semantics or a non-standard typing. Examples in the latter category include those of Gomard [Go92], Jensen [Jen92], the Nielsons [NN88], Schmidt =-=[Sch88]-=-, and Henglein and Mossin [HM94]. Our focus is on those techniques based on non-standard interpretation, in particular, those using projections or partial equivalence relations (PERs) as the basic abs... |

2 |
Projection-based Program Analysis. Thesis submitted for degree of
- Davis
- 1994
(Show Context)
Citation Context ... be generalised to higher order: T P z [[ T1 -? T2 ]] may be restricted to functions that map ? to ? and distribute over u, for all function types T1 -? T2 . (These results follow from those shown in =-=[Dav94]-=-.) 8 Related Work Consel [Con90] describes a binding-time analysis for higherorder untyped languages. As in our analysis abstract values have two parts, the first describing the static/dynamic propert... |

1 |
Projection-based Program Analysis.Thesis submitted for degree of
- Davis
- 1994
(Show Context)
Citation Context ... be generalised to higher order: T P z [[ T1 -? T2 ]] may be restricted to functions that map ? to ? and distribute over u, for all function types T1 -? T2 . (These results follow from those shown in =-=[Dav94]-=-.) 8 Related Work Consel [Con90] describes a binding-time analysis for higherorder untyped languages. As in our analysis abstract values have two parts, the first describing the static/dynamic propert... |