We bridge two distinct approaches to one-pass CPS transformations, i.e., CPS transformations that reduce administrative redexes at transformation time instead of in a post-processing phase. One approach is compositional and higher-order, and is due to Appel, Danvy and Filinski, and Wand, building on Plotkin's seminal work. The other is non-compositional and based on a syntactic theory of the lambda-calculus, and is due to Sabry and Felleisen. To relate the two approaches, we use Church encoding, Reynolds's defunctionalization, and an implementation technique for syntactic theories, refocusing, developed in the second author's PhD thesis
Higher-order program transformations raise new challenges for proving properties of their output, si...
We build on Danvy and Nielsen's first-order program transformation into continuation-passing style (...
We show that a non-duplicating transformation into continuation-passing style (CPS) has no effect on...
We bridge two distinct approaches to one-pass CPS transformations, i.e., CPS transformations that re...
We present a new transformation of call-by-value lambda-terms into continuation-passing style (CPS)....
AbstractWe present a new transformation of λ-terms into continuation-passing style (CPS). This trans...
The extra compaction of Sabry and Felleisen's transformation is due to making continuations occur fi...
Higher-order program transformations raise new challenges for provingproperties of their output, sin...
The extra compaction of the most compacting CPS transformation in existence, which is due to Sabry a...
A lambda-encoding such as the CPS transformation gives rise to administrative redexes. In his semina...
AbstractWe present a new transformation of λ-terms into continuation-passing style (CPS). This trans...
We build on Danvy and Nielsen's first-order program transformation into continuation-passing style (...
We show that a non-duplicating CPS transformation has no effect on control-flow analysis and that it...
We show that a non-duplicating CPS transformation has no effect on control-flow analysis and that it...
We show that a non-duplicating CPS transformation has no effect on control-flow analysis and that it...
Higher-order program transformations raise new challenges for proving properties of their output, si...
We build on Danvy and Nielsen's first-order program transformation into continuation-passing style (...
We show that a non-duplicating transformation into continuation-passing style (CPS) has no effect on...
We bridge two distinct approaches to one-pass CPS transformations, i.e., CPS transformations that re...
We present a new transformation of call-by-value lambda-terms into continuation-passing style (CPS)....
AbstractWe present a new transformation of λ-terms into continuation-passing style (CPS). This trans...
The extra compaction of Sabry and Felleisen's transformation is due to making continuations occur fi...
Higher-order program transformations raise new challenges for provingproperties of their output, sin...
The extra compaction of the most compacting CPS transformation in existence, which is due to Sabry a...
A lambda-encoding such as the CPS transformation gives rise to administrative redexes. In his semina...
AbstractWe present a new transformation of λ-terms into continuation-passing style (CPS). This trans...
We build on Danvy and Nielsen's first-order program transformation into continuation-passing style (...
We show that a non-duplicating CPS transformation has no effect on control-flow analysis and that it...
We show that a non-duplicating CPS transformation has no effect on control-flow analysis and that it...
We show that a non-duplicating CPS transformation has no effect on control-flow analysis and that it...
Higher-order program transformations raise new challenges for proving properties of their output, si...
We build on Danvy and Nielsen's first-order program transformation into continuation-passing style (...
We show that a non-duplicating transformation into continuation-passing style (CPS) has no effect on...