Search-Based Binding Time Analysis using Type-Directed Pruning (2002)
Cached
Download Links
- [www.cse.ogi.edu]
- [www.cse.ogi.edu]
- [www.cse.ogi.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In: Proceedings of the ACM SIGPLAN Asian Symposium on Partial Evaluation and Semantics-Based Program Manipulation, Aizu |
| Citations: | 5 - 2 self |
BibTeX
@INPROCEEDINGS{Sheard02search-basedbinding,
author = {Tim Sheard and Nathan Linger},
title = {Search-Based Binding Time Analysis using Type-Directed Pruning},
booktitle = {In: Proceedings of the ACM SIGPLAN Asian Symposium on Partial Evaluation and Semantics-Based Program Manipulation, Aizu},
year = {2002},
pages = {2--0},
publisher = {ACM Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We introduce a new kind of Binding Time Analysis (BTA) based on search rather than constraint solving or abstract interpretation. The search is guided by type information which significantly prunes the size of the search space, making the algorithm practical. We also point out, that higher order multi-stage types are a rich and expressive medium for the expression of binding-time specifications. A goal of our work is to demonstrate that a single unified system which seamlessly integrates both manual staging and automatic BTA based staging can be built.
