A Proof Theoretical Account of Continuation Passing Style (2002)
| Venue: | In CSL ’02: Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic |
| Citations: | 3 - 0 self |
BibTeX
@INPROCEEDINGS{Ogata02aproof,
author = {Ichiro Ogata},
title = {A Proof Theoretical Account of Continuation Passing Style},
booktitle = {In CSL ’02: Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic},
year = {2002},
pages = {490--505},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We study "classical proofs as programs" paradigm in CallBy -Value (CBV) setting. Specifically, we show the CBV normalization for CND (Parigot 92) can be simulated by the cut-elimination procedure for LKQ (Danos-Joinet-Schellinx 93), namely the q-protocol. We use proof-term assignment system to prove this fact. The term calculus for CND we use follows Parigot's #-calculus with new CBV normalization procedure. A new term calculus for LKQ is presented as a variant of #-calculus with a let-construct. We then define a translation from CND into LKQ and prove simulation theorem. We also show the translation we use can be thought of a familiar CBV CPS-translation without translation on types.
