Abstract. In the field of program transformation, one often transforms programs into continuation-passing style to make their flow of control explicit, and then immediately removes the resulting continuations using defunctionalisation to make the programs first-order. In this article, we show how these two transformations can be fused together into a single transformation step that cuts out the need to first introduce and then eliminate continuations. Our approach is calculational, uses standard equational reasoning techniques, and is widely applicable.
AbstractIn this paper, we are concerned in transforming FP programs so as to minimize the number of ...
In game semantics and related approaches to programming language semantics,programs are modelled by ...
Abstract. A popular formalism of higher order rewriting, especially in the light of termination rese...
In the field of program transformation, one often transforms programs into continuation-passing styl...
Plotkin's -value calculus is sound but incomplete for reasoning about -transfor-mations on prog...
This paper points out and illustrates continuations as functions abstracting a delimited context ins...
In the realm of functional programming a wealth of techniques have been explored to transform a prog...
Functional programs are particularly well suited to formal manipulation by equational reasoning. In ...
Context: Reynolds showed us how to use continuation-passing style and defunctionalization to transfo...
. The paper shows how term rewriting techniques can be used to automatically transform first-order f...
Functional programs are particularly well suited to formal manipulation by equational reasoning. In ...
Functional programming is particularly well suited for equational reasoning – referential trans-pare...
Abstract. Continuations can be used to explain a wide variety of control behaviours, including calli...
We continue to investigate the direct-style transformation by extending it to programs requiring cal...
Abstract. In game semantics and related approaches to programming language semantics, programs are m...
AbstractIn this paper, we are concerned in transforming FP programs so as to minimize the number of ...
In game semantics and related approaches to programming language semantics,programs are modelled by ...
Abstract. A popular formalism of higher order rewriting, especially in the light of termination rese...
In the field of program transformation, one often transforms programs into continuation-passing styl...
Plotkin's -value calculus is sound but incomplete for reasoning about -transfor-mations on prog...
This paper points out and illustrates continuations as functions abstracting a delimited context ins...
In the realm of functional programming a wealth of techniques have been explored to transform a prog...
Functional programs are particularly well suited to formal manipulation by equational reasoning. In ...
Context: Reynolds showed us how to use continuation-passing style and defunctionalization to transfo...
. The paper shows how term rewriting techniques can be used to automatically transform first-order f...
Functional programs are particularly well suited to formal manipulation by equational reasoning. In ...
Functional programming is particularly well suited for equational reasoning – referential trans-pare...
Abstract. Continuations can be used to explain a wide variety of control behaviours, including calli...
We continue to investigate the direct-style transformation by extending it to programs requiring cal...
Abstract. In game semantics and related approaches to programming language semantics, programs are m...
AbstractIn this paper, we are concerned in transforming FP programs so as to minimize the number of ...
In game semantics and related approaches to programming language semantics,programs are modelled by ...
Abstract. A popular formalism of higher order rewriting, especially in the light of termination rese...