BTA Algorithms to Ensure Termination of O-line Partial Evaluation Arne J....  Home/Search
Context
Related
| diku.dk/~panic/articles/Ershov2.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: diku.dk/~panic/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A partial evaluator, given a program and a known "static" part of its input data, outputs a residual program in which computations depending only on the static data have been precomputed [3]. The ideal is a "black box" which discovers and performs nontrivial static computations whenever possible, and never fails to terminate. Practical partial evaluators fall short of this goal: they sometimes loop (typical of functional programing partial evaluation), or terminate but are excessively... (Update)
Similar documents (at the sentence level):
70.4%: BTA Algorithms to Ensure Termination of Off-line Partial.. - Glenstrup, Jones (1996) (Correct)
Active bibliography (related documents): More All
0.1: Advanced Techniques for Logic Program Specialisation - Leuschel (1997) (Correct)
0.1: Partial Evaluation - Mogensen, Sestoft (1996) (Correct)
0.0: A Constraint-based Partial Evaluator for Functional - Logic Programs And (Correct)
Similar documents based on text: More All
0.4: BTA Termination Using CFL-Reachability - Das, Reps (1996) (Correct)
0.3: Termination Analysis and Specialization-Point Insertion in.. - Glenstrup, Jones (2004) (Correct)
0.3: Eye Controlled Media: Present and Future State - Glenstrup, Engell-Nielsen (1995) (Correct)
BibTeX entry: (Update)
@misc{ -unknown,
title = "Unknown",
url = "citeseer.ist.psu.edu/647680.html" }
Citations (may not include all citations):1450 The design and analysis of computer algorithms (context) - Aho, Hopcroft et al. - 1975
638 Partial evaluation and Automatic program generation (context) - Jones, Gomard et al. - 1993
233 Natural semantics (context) - Kahn
224 Partial evaluation in logic programming (context) - Lloyd, Shepherdson - 1991
58 Ensuring Global Termination of Partial Deduction While Allow.. - Martens, Gallagher - 1995
41 Automatic program specialization: a re-examination from basi.. (context) - Jones - 1988
37 Global control for partial deduction through characteristic .. (context) - Leuschel, Martens - 1996
27 Mixed computation: potential applications and problems for s.. (context) - Ershov - 1982
23 Finiteness analysis (context) - Holst - 1991
22 What not to do when writing an interpreter for specialisatio.. - Jones - 1996
2 Private communication (context) - Andersen, Holst
Documents on the same site (http://www.diku.dk/~panic/):
Termination Analysis and Specialization-Point Insertion in.. - Glenstrup, Jones (2004) (Correct)
Quantifying Optimal Mesh and Ring Design Costs - Stidsen, Glenstrup (2004) (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