Results 1  10
of
29,355
CPS Transformation of Flow Information
 Journal of Functional Programming
, 2001
"... We consider the question of how a continuationpassingstyle (CPS) transformation changes the ow analysis of a program. We present an algorithm that takes the least solution to the ow constraints of a program and constructs in linear time the least solution to the ow constraints for the CPStran ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We consider the question of how a continuationpassingstyle (CPS) transformation changes the ow analysis of a program. We present an algorithm that takes the least solution to the ow constraints of a program and constructs in linear time the least solution to the ow constraints for the CPStransformed
Three Steps for the CPS Transformation
, 1991
"... Transforming a #term into continuationpassing style (CPS) might seem mystical at first, but in fact it can be characterized by three separate aspects: . The values of all intermediate applications are given a name. . The evaluation of these applications is sequentialized based on a traversal o ..."
Abstract

Cited by 17 (4 self)
 Add to MetaCart
Transforming a #term into continuationpassing style (CPS) might seem mystical at first, but in fact it can be characterized by three separate aspects: . The values of all intermediate applications are given a name. . The evaluation of these applications is sequentialized based on a traversal
CPS Transform for Dependent ML
"... Dependent ML is a functional programming language that extends ML with a restricted form of dependent types. In this paper, we study a callbyvalue continuationpassing style (CPS) transform for ML ; 0 , a core of DML that excludes eects. In particular, we demonstrate how the type derivation of a ..."
Abstract
 Add to MetaCart
Dependent ML is a functional programming language that extends ML with a restricted form of dependent types. In this paper, we study a callbyvalue continuationpassing style (CPS) transform for ML ; 0 , a core of DML that excludes eects. In particular, we demonstrate how the type derivation
On the Idempotence of the CPS Transformation
 THE JOURNAL OF FUNCTIONAL PROGRAMMING.REVISED VERSION OF BRICS
, 1996
"... The CPS (continuationpassing style) transformation on terms has an interpretation both in programming languages, type theory, proof theory, and logic. Programming intuition suggests that it is idempotent, but this does not directly hold for all existing CPS transformations (Plotkin, Reynolds, Fisc ..."
Abstract
 Add to MetaCart
The CPS (continuationpassing style) transformation on terms has an interpretation both in programming languages, type theory, proof theory, and logic. Programming intuition suggests that it is idempotent, but this does not directly hold for all existing CPS transformations (Plotkin, Reynolds
Retraction Approach to CPS Transform
 HIGHERORDER AND SYMBOLIC COMPUTATION
, 1998
"... We study the continuation passing style (CPS) transform and its generalization, the computational transform, in which the notion of computation is generalized from continuation passing to an arbitrary one. To establish a relation between direct style and continuation passing style interpretation ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We study the continuation passing style (CPS) transform and its generalization, the computational transform, in which the notion of computation is generalized from continuation passing to an arbitrary one. To establish a relation between direct style and continuation passing style
Mechanized Verification of CPS Transformations
, 2007
"... Transformation to continuationpassing style (CPS) is often performed by optimizing compilers for functional programming languages. As part of the development and proof of correctness of a compiler for the miniML functional language, we have mechanically verified the correctness of two CPS transfor ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Transformation to continuationpassing style (CPS) is often performed by optimizing compilers for functional programming languages. As part of the development and proof of correctness of a compiler for the miniML functional language, we have mechanically verified the correctness of two CPS
Verifying CPS Transformations in Isabelle/HOL
, 2003
"... We have verified several versions of the CPS transformation in Isabelle/HOL. In our verification we adopted firstorder abstract syntax with variable names so that the formalization is close to that of handwritten proofs and compilers. To simplify treatment of fresh variables introduced by the tran ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We have verified several versions of the CPS transformation in Isabelle/HOL. In our verification we adopted firstorder abstract syntax with variable names so that the formalization is close to that of handwritten proofs and compilers. To simplify treatment of fresh variables introduced
CPS Transformation after Strictness Analysis
 ACM Letters on Programming Languages and Systems
, 1993
"... syntax of the source language ` c : ' f:::; x : ø ; :::g ` x : ø ß ` e : ø !ø ß ` fix e : ø ß [ fx : ø 1 g ` e : ø 2 ß ` x : ø 1 : e : ø 1 !ø 2 ß ` e 0 : ø 1 !ø 2 ß ` e 1 : ø 1 ß ` @ e 0 e 1 : ø 2 ß ` e 1 : ' ß ` e 2 : ø ß ` e 3 : ø ß ` if e 1 then e 2 else e 3 : ø ß ` e 0 : ø 0 ß [ fx ..."
Abstract

Cited by 29 (11 self)
 Add to MetaCart
] and by Fradet and Le M'etayer [9]. Both include a CPS transformation. Fradet and Le M'etayer compile both CBN and CBV programs by using the CBN and the CBV CPStransformation. Recently, Burn and Le M'etayer have combined this technique with a global programanalysis [2], which is comparable to our
A firstorder onepass CPS transformation
, 2003
"... We present a new transformation ofterms into continuationpassing style (CPS). This transformation operates in one pass and is both compositional and firstorder. Previous CPS transformations only enjoyed two out of the three properties of being firstorder, onepass, and compositional, but the new ..."
Abstract

Cited by 29 (10 self)
 Add to MetaCart
We present a new transformation ofterms into continuationpassing style (CPS). This transformation operates in one pass and is both compositional and firstorder. Previous CPS transformations only enjoyed two out of the three properties of being firstorder, onepass, and compositional
Representing control: a study of the CPS transformation
, 1992
"... This paper investigates the transformation of v terms into continuationpassing style (CPS). We show that by appropriate jexpansion of Fischer and Plotkin's twopass equational specification of the CPS transform, we can obtain a static and contextfree separation of the result terms into ..."
Abstract

Cited by 89 (8 self)
 Add to MetaCart
This paper investigates the transformation of v terms into continuationpassing style (CPS). We show that by appropriate jexpansion of Fischer and Plotkin's twopass equational specification of the CPS transform, we can obtain a static and contextfree separation of the result terms
Results 1  10
of
29,355