Tutorial notes on partial evaluation

Consel, Charles; Danvy, Olivier

doi:10.1145/158511.158707

Cited by 237 publications

(175 citation statements)

References 51 publications

Supporting

Mentioning

172

Contrasting

Unclassified

Order By: Relevance

“…3.3). This is orthogonal to control issues and, thus, our approach can be integrated in both online or offline partial evaluation schemes (see, e.g., [10] for a gentle introduction to online and offline partial evaluation). For simplicity, though, we consider in the following an offline scheme for partial evaluation and assume that the program contains some function annotations that can be used to ensure the termination of partial computations.…”

Section: The Partial Evaluation Semanticsmentioning

confidence: 99%

Preserving Sharing in the Partial Evaluation of Lazy Functional Programs

Fischer

Silva

Tamarit

et al. 2008

Logic-Based Program Synthesis and Transformation

View full text Add to dashboard Cite

Abstract. The goal of partial evaluation is the specialization of programs w.r.t. part of their input data. Although this technique is already well-known in the context of functional languages, current approaches are either overly restrictive or destroy sharing through the specialization process, which is unacceptable from a performance point of view. In this work, we present the basis of a new partial evaluation scheme for first-order lazy functional programs that preserves sharing through the specialization process and still allows the unfolding of arbitrary function calls.

show abstract

Section: The Partial Evaluation Semanticsmentioning

confidence: 99%

Preserving Sharing in the Partial Evaluation of Lazy Functional Programs

Fischer

Silva

Tamarit

et al. 2008

Logic-Based Program Synthesis and Transformation

View full text Add to dashboard Cite

show abstract

“…Partial evaluation of functional programs [8,15] has mainly stressed off-line approaches, while supercompilation of functional [32,31] and partial deduction of logic programs [13,3,1,30,25,20] have concentrated on on-line control.…”

Section: Off-llne Vs On-line Controlmentioning

confidence: 99%

A polyvariant binding-time analysis for off-line partial deduction

Bruynooghe

Leuschel

Sagonas

1998

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. We study the notion of binding-time analysis for logic programs. We formalise the unfolding aspect of an on-line partial deduction system as a Prolog program. Using abstract interpretation, we collect information about the run-time behaviour of the program. We use this information to make the control decisions about the unfolding at analysis time and to turn the on-line system into an off-line system. We report on some initial experiments.

show abstract

“…Our approach is illustrated by three generative programming approaches, namely AOP [13], annotations [3], and program specialization [5,10]; conceptually other approaches can be considered. AOP is well-suited to introduce crosscutting behaviors in GPL-translated programs (e.g., prologue and epilogue code of API invocations).…”

Section: Introductionmentioning

confidence: 99%

A Generative Programming Approach to Developing DSL Compilers

Consel

Latry

Réveillère

et al. 2005

Generative Programming and Component Engineering

Self Cite

View full text Add to dashboard Cite

Abstract. Domain-Specific Languages (DSLs) represent a proven approach to raising the abstraction level of programming. They offer highlevel constructs and notations dedicated to a domain, structuring program design, easing program writing, masking the intricacies of underlying software layers, and guaranteeing critical properties. On the one hand, DSLs facilitate a straightforward mapping between a conceptual model and a solution expressed in a specific programming language. On the other hand, DSLs complicate the compilation process because of the gap in the abstraction level between the source and target language. The nature of DSLs make their compilation very different from the compilation of common General-Purpose Languages (GPLs). In fact, a DSL compiler generally produces code written in a GPL; low-level compilation is left to the compiler of the target GPL. In essence, a DSL compiler defines some mapping of the high-level information and features of a DSL into the target GPL and underlying layers (e.g., middleware, protocols, objects, . . . ). This paper presents a methodology to develop DSL compilers, centered around the use of generative programming tools. Our approach enables the development of a DSL compiler to be structured on facets that represent dimensions of compilation. Each facet can then be implemented in a modular way, using aspects, annotations and specialization. Because these tools are high level, they match the needs of a DSL, facilitating the development of the DSL compiler, and making it modular and retargetable. We illustrate our approach with a DSL for telephony services. The structure of the DSL compiler is presented, as well as practical uses of generative tools for some compilation facets.

show abstract

Tutorial notes on partial evaluation

Cited by 237 publications

References 51 publications

Preserving Sharing in the Partial Evaluation of Lazy Functional Programs

Preserving Sharing in the Partial Evaluation of Lazy Functional Programs

A polyvariant binding-time analysis for off-line partial deduction

A Generative Programming Approach to Developing DSL Compilers

Contact Info

Product

Resources

About