Continuations, proofs and tests
<|reference_start|>Continuations, proofs and tests: Continuation Passing Style (CPS) is one of the most important issues in the field of functional programming languages, and the quest for a primitive notion of types for continuation is still open. Starting from the notion of ``test'' proposed by Girard, we develop a notion of test for intuitionistic logic. We give a complete deductive system for tests and we show that it is good to deal with ``continuations''. In particular, in the proposed system it is possible to work with Call by Value and Call by Name translations in a uniform way.<|reference_end|>
@article{guerrini2006continuations,,
    title={Continuations, proofs and tests},
    author={Stefano Guerrini and Andrea Masini},
    journal={arXiv preprint arXiv:cs/0605043},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0605043},
    primaryClass={cs.LO cs.PL}
}