Affiliation:
1. University of Copenhagen, Copenhagen, Denmark
2. Waseda University, Tokyo, Japan
Abstract
We show that the accuracy of online partial evaluation, or polyvariant specialization based on constant propagation, can be simulated by offline partial evaluation using a maximally polyvariant binding-time analysis. We point out that, while their accuracy is the same, online partial evaluation offers better opportunities for powerful generalization strategies. Our results are presented using a flowchart language with recursive procedures.
Publisher
Association for Computing Machinery (ACM)
Reference53 articles.
1. Binding-time analysis and the taming of C pointers
2. Andersen L. O. 1994. Program analysis and specialization for the C programming language. DIKU Rep. 94/19. Department of Computer Science University of Copenhagen Copenhagen Denmark.]] Andersen L. O. 1994. Program analysis and specialization for the C programming language. DIKU Rep. 94/19. Department of Computer Science University of Copenhagen Copenhagen Denmark.]]
3. Fixpoint computation for polyvariant static analyses of higher-order applicative programs
4. A partial evaluator, and its use as a programming tool
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献