Type-directed partial evaluation
O Danvy - Proceedings of the 23rd ACM SIGPLAN-SIGACT …, 1996 - dl.acm.org
We present a strikingly simple partial evaluator, that is type-directed and reifies a compiled
program into the text of a residual, specialized program. Our partial evaluator is concise (a …
program into the text of a residual, specialized program. Our partial evaluator is concise (a …
Generative programming and active libraries
K Czarnecki, U Eisenecker, R Glück… - … International Seminar on …, 2000 - Springer
We describe generative programming, an approach to generating customized programming
components or systems, and active libraries, which are based on this approach. In contrast …
components or systems, and active libraries, which are based on this approach. In contrast …
ATGen: automatic test data generation using constraint logic programming and symbolic execution
C Meudec - Software testing, verification and reliability, 2001 - Wiley Online Library
The verification and validation of software through dynamic testing is an area of software
engineering where progress towards automation has been slow. In particular the automatic …
engineering where progress towards automation has been slow. In particular the automatic …
[PDF][PDF] The λΠ-calculus Modulo as a Universal Proof Language.
M Boespflug, Q Carbonneaux, O Hermant - PxTP, 2012 - academia.edu
The λΠ-calculus forms one of the vertices in Barendregt's λ-cube and has been used as the
core language for a number of logical frameworks. Following earlier extensions of natural …
core language for a number of logical frameworks. Following earlier extensions of natural …
Domain-specific languages: from design to implementation application to video device drivers generation
Domain-specific languages (DSL) have many potential advantages in terms of software
engineering, ranging from increased productivity to the application of formal methods …
engineering, ranging from increased productivity to the application of formal methods …
Conjunctive partial deduction: Foundations, control, algorithms, and experiments
D De Schreye, R Glück, J Jørgensen… - The Journal of Logic …, 1999 - Elsevier
Partial deduction in the Lloyd–Shepherdson framework cannot achieve certain optimisations
which are possible by unfold/fold transformations. We introduce conjunctive partial …
which are possible by unfold/fold transformations. We introduce conjunctive partial …
Normalization by evaluation
U Berger, M Eberl, H Schwichtenberg - Prospects for Hardware …, 1998 - Springer
Normalization by Evaluation Page 1 Ulrich Berger, Matthias Eberl and Helmut Schwichtenberg
Mathematisches Institut der Universit at M unchen Abstract. We extend normalization by …
Mathematisches Institut der Universit at M unchen Abstract. We extend normalization by …
Normalization and partial evaluation
P Dybjer, A Filinski - International Summer School on Applied Semantics, 2000 - Springer
We give an introduction to normalization by evaluation and type-directed partial evaluation.
We first present normalization by evaluation for a combinatory version of Gödel System T …
We first present normalization by evaluation for a combinatory version of Gödel System T …
Collapsing towers of interpreters
Given a tower of interpreters, ie, a sequence of multiple interpreters interpreting one another
as input programs, we aim to collapse this tower into a compiler that removes all interpretive …
as input programs, we aim to collapse this tower into a compiler that removes all interpretive …
A partial evaluation framework for order-sorted equational programs modulo axioms
Partial evaluation is a powerful and general program optimization technique with many
successful applications. Existing PE schemes do not apply to expressive rule-based …
successful applications. Existing PE schemes do not apply to expressive rule-based …