Offline partial evaluation can be as accurate as online partial evaluation

Christensen, Niels H.; Glück, Robert

doi:10.1145/963778.963784

Cited by 16 publications

(12 citation statements)

References 41 publications

(60 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[3,4,14,16,17]), which should make our results easily comparable and accessible. Throughout this paper, we assume that readers are familiar with the basics of partial evaluation, e.g., as presented by Jones et al [18,Part II].…”

Section: Introductionmentioning

confidence: 91%

“…We use two specializers in our experiments, and these represent typical offline and online partial evaluators for flowchart languages [14,[16][17][18]. 4 1. For an independent comparison, we use the classic offline partial evaluator mix by Gomard and Jones [16].…”

Section: Experimental Assessmentmentioning

confidence: 99%

“…A compiler generator produced by the third Futamura projection was observed to contain a straightforward function for converting binding-time-annotated programs into generating extensions [23]. The present work is also part of our investigation into the foundations of metacomputation including [1,4,[11][12][13][14][15]29].…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Bootstrapping Compiler Generators from Partial Evaluators

Glück

2012

Perspectives of Systems Informatics

Self Cite

View full text Add to dashboard Cite

Abstract. This paper shows that bootstrapping of compiler generators from program specializers is a viable alternative to the third Futamura projection. To practically validate the technique, a novel partial evaluation-based compiler generator was designed and implemented for a recursive flowchart language. Three-step bootstrapping was found to be faster and to produce the same compiler generator that Gomard and Jones produced two decades ago by double self-application. Compilergenerator bootstrapping has distinct properties that are not present in the classic three Futamura projections, such as the ability to turn a specializer into a compiler generator in one step without self-application. Up to now, the approach of hand-writing compiler generators has only been used to avoid difficulties when specializing strongly-typed languages, not as a first step towards compiler-generator bootstrapping.

show abstract

Section: Introductionmentioning

confidence: 91%

Section: Experimental Assessmentmentioning

confidence: 99%

See 1 more Smart Citation

Bootstrapping Compiler Generators from Partial Evaluators

Glück

2012

Perspectives of Systems Informatics

Self Cite

View full text Add to dashboard Cite

show abstract

“…While offline partial evaluators are usually faster, online ones produce more accurate results (though, from a theoretical point of view, they are equally powerful [3]). Partial evaluators based on the CPD scheme have traditionally followed the online approach.…”

Section: Introductionmentioning

confidence: 99%

A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs

Vidal

2011

Logic-Based Program Synthesis and Transformation

View full text Add to dashboard Cite

Abstract. Conjunctive partial deduction is a well-known technique for the partial evaluation of logic programs. The original formulation follows the so called online approach where all termination decisions are taken on-the-fly. In contrast, offline partial evaluators first analyze the source program and produce an annotated version so that the partial evaluation phase should only follow these annotations to ensure the termination of the process. In this work, we introduce a lightweight approach to conjunctive partial deduction that combines some of the advantages of both online and offline styles of partial evaluation.

show abstract

“…-The offline approach is in principle less precise (see, however, [6]) as it has to make decisions before the actual static values are known. -The offline approach leads to simpler specialisers, thus making self-application easier and leading to more efficient specialisation.…”

Section: Introductionmentioning

confidence: 99%

Supervising Offline Partial Evaluation of Logic Programs Using Online Techniques

Leuschel

Craig

Elphick

Logic-Based Program Synthesis and Transformation

View full text Add to dashboard Cite

Abstract. A major impediment for more widespread use of offline partial evaluation is the difficulty of obtaining and maintaining annotations for larger, realistic programs. Existing automatic binding-time analyses still only have limited applicability and annotations often have to be created or improved and maintained by hand, leading to errors. We present a technique to help overcome this problem by using online control techniques which supervise the specialisation process in order to detect such errors. We discuss an implementation in the logen system and show on a series of examples that this approach is effective: very few false alarms were raised while infinite loops were detected quickly. We also present the integration of this technique into a web interface, which highlights problematic annotations directly in the source code. A method to automatically fix incorrect annotations is presented, allowing the approach to be also used as a pragmatic binding time analysis. Finally we show how our method can be used for efficiently locating errors with built-ins inside Prolog source code.

show abstract

Offline partial evaluation can be as accurate as online partial evaluation

Cited by 16 publications

References 41 publications

Bootstrapping Compiler Generators from Partial Evaluators

Bootstrapping Compiler Generators from Partial Evaluators

A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs

Supervising Offline Partial Evaluation of Logic Programs Using Online Techniques

Contact Info

Product

Resources

About