Partial evaluation is a powerful automated strategy for transforming programs, some of whose inputs are known. The classic simple example is the power function, power n x = if n = 1 then x else x power (n 1) x which, given that n is known to be 3, can be transformed into the specialised versio
We present an implementation in the Coq proof assistant of type directed partial evaluation (TDPE) a...
We extend type specialisation to a computational lambda calculus with first-class references. The re...
We consider the problems of first-order unification and type inference from a general perspective on...
The essence of partial evaluation is beautifully simple: we just take a program, together with value...
We present a strikingly simple partial evaluator, that is typedirected and reifies a compiled progra...
We formally characterize partial evaluation of functional programs as a normalization problem in an ...
Type specialisation is an approach to program specialisation that works with both a program and its ...
Abstract. Partial evaluation is a program transformation that automatically specializes a program wi...
Partial evaluation, or program specialization, is used when a variable is known to often hold one pa...
We present an offline partial evaluator for a higher-order subset of ML with reference types. Its no...
Type-directed partial evaluation was originally implemented in Scheme, a dynamically typed language....
We report on a new environment developed and implemented inside the Nuprl type theory that facilita...
We give an introduction to normalization by evaluation and type-directed partial evaluation. We firs...
Abstract. Principal Type Specialisation is an approach to Type Specialisation designed to generate p...
This article presents an alternative method of type-directed partial evaluation, which is simpler an...
We present an implementation in the Coq proof assistant of type directed partial evaluation (TDPE) a...
We extend type specialisation to a computational lambda calculus with first-class references. The re...
We consider the problems of first-order unification and type inference from a general perspective on...
The essence of partial evaluation is beautifully simple: we just take a program, together with value...
We present a strikingly simple partial evaluator, that is typedirected and reifies a compiled progra...
We formally characterize partial evaluation of functional programs as a normalization problem in an ...
Type specialisation is an approach to program specialisation that works with both a program and its ...
Abstract. Partial evaluation is a program transformation that automatically specializes a program wi...
Partial evaluation, or program specialization, is used when a variable is known to often hold one pa...
We present an offline partial evaluator for a higher-order subset of ML with reference types. Its no...
Type-directed partial evaluation was originally implemented in Scheme, a dynamically typed language....
We report on a new environment developed and implemented inside the Nuprl type theory that facilita...
We give an introduction to normalization by evaluation and type-directed partial evaluation. We firs...
Abstract. Principal Type Specialisation is an approach to Type Specialisation designed to generate p...
This article presents an alternative method of type-directed partial evaluation, which is simpler an...
We present an implementation in the Coq proof assistant of type directed partial evaluation (TDPE) a...
We extend type specialisation to a computational lambda calculus with first-class references. The re...
We consider the problems of first-order unification and type inference from a general perspective on...