On proving syntactic properties of CPS programs (1999)
Cached
Download Links
- [www.brics.dk]
- [pecan.srv.cs.cmu.edu]
- [www.cs.cmu.edu]
- DBLP
Other Repositories/Bibliography
by
Belmina Dzafic
,
Olivier Danvy
,
Olivier Danvy
,
Belmina Dza C
,
Frank Pfenning
,
Frank Pfenning
| Citations: | 22 - 8 self |
BibTeX
@MISC{Dzafic99onproving,
author = {Belmina Dzafic and Olivier Danvy and Olivier Danvy and Belmina Dza C and Frank Pfenning and Frank Pfenning},
title = {On proving syntactic properties of CPS programs},
year = {1999}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Higher-order program transformations raise new challenges for proving properties of their output, since they resist traditional, rst-order proof techniques. In this work, we consider (1) the \one-pass" continuationpassing style (CPS) transformation, which is second-order, and (2) the occurrences of parameters of continuations in its output. To this end, we specify the one-pass CPS transformation relationally and we use the proof technique of logical relations.
