Syntactic accidents in program analysis: on the impact of the CPS transformation

Damian, Daniel; Danvy, Olivier

doi:10.1017/s0956796802004379

Cited by 13 publications

(21 citation statements)

References 44 publications

(74 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This technique is instrumental in binding-time analysis [3] and continuation-based partial evaluation [14]. Seeing let expressions as syntactic sugar for β-redexes, it appears clearly that the context-sensitive administrative reduction includes the standard let optimization, independently of whether continuations are put first or last.…”

Section: Cps Transformation Of Let Expressionsmentioning

confidence: 99%

CPS transformation of beta-redexes

Danvy¹,

Nielsen²

2005

Information Processing Letters

Self Cite

View full text Add to dashboard Cite

Section: Cps Transformation Of Let Expressionsmentioning

confidence: 99%

CPS transformation of beta-redexes

Danvy¹,

Nielsen²

2005

Information Processing Letters

Self Cite

View full text Add to dashboard Cite

“…In our initial work [7], we considered only one step of the CPS transformation, namely the introduction of continuations on terms in monadic normal form. We then turned to transforming source terms into monadic normal form [6,9].…”

Section: Cps Transformation Of Flow Informationmentioning

confidence: 99%

“…(λ-abstraction labels) Figure 1: The language of labeled λ-terms constraint-based control-flow analysis [6,7,9,35]. It also opens the way to directly investigating the effect of the CPS transformation on other analyses, as for instance, binding-time analysis.…”

Section: This Workmentioning

confidence: 99%

“…The CPS transformation for (unlabeled) λ-terms is defined in Figure 5. As in our earlier work [7,9], we consider a transformation with η-expanded tail calls: the continuation passed at a function call is always a syntactic λ-abstraction.…”

Section: Cps Transformation Of Termsmentioning

confidence: 99%

“…The CPS transformation has been extended to types [26,47], which has led to the discovery of its logical content [17,28]. Over the last two years, both Palsberg and Wand [35] and Damian and Danvy [6,7,9] have developed a CPS transformation of control-flow information. They have used it to show that a CPS transformation does not affect the control-flow information collected by a monovariant constraint-based control-flow analysis.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Simple CPS Transformation of Control-Flow Information

Damian¹

2002

Logic Journal of IGPL

View full text Add to dashboard Cite

We build on Danvy and Nielsen's first-order program transformation into continuation-passing style (CPS) to design a new CPS transformation of flow information that is simpler and more efficient than what has been presented in previous work. The key to simplicity and efficiency is that our CPS transformation constructs the flow information in one go, instead of first computing an intermediate result and then exploiting it to construct the flow information.More precisely, we show how to compute control-flow information for CPStransformed programs from control-flow information for direct-style programs and vice-versa. As a corollary, we confirm that CPS transformation has no effect on the control-flow information obtained by constraint-based control-flow analysis. The transformation has immediate applications in assessing the effect of the CPS transformation over other analyses such as, for instance, binding-time analysis.

show abstract

A First-Order One-Pass CPS Transformation

Danvy

Nielsen

2002

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

We present a new transformation of call-by-value lambdaterms into continuation-passing style (CPS). This transformation operates in one pass and is both compositional and first-order. Because it operates in one pass, it directly yields compact CPS programs that are comparable to what one would write by hand. Because it is compositional, it allows proofs by structural induction. Because it is first-order, reasoning about it does not require the use of a logical relation. This new CPS transformation connects two separate lines of research. It has already been used to state a new and simpler correctness proof of a direct-style transformation, and to develop a new and simpler CPS transformation of control-flow information. Basic Research in Computer Science (www.brics.dk), funded by the Danish National Research Foundation.

show abstract

Syntactic accidents in program analysis: on the impact of the CPS transformation

Cited by 13 publications

References 44 publications

CPS transformation of beta-redexes

CPS transformation of beta-redexes

A Simple CPS Transformation of Control-Flow Information

A First-Order One-Pass CPS Transformation

Contact Info

Product

Resources

About