Continuations, proofs and tests Export

@misc{citeulike:637528, abstract = {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.}, archivePrefix = {arXiv}, author = {Guerrini, Stefano and Masini, Andrea}, citeulike-article-id = {637528}, citeulike-linkout-0 = {http://arxiv.org/abs/cs.LO/0605043}, citeulike-linkout-1 = {http://arxiv.org/pdf/cs.LO/0605043}, day = {9}, eprint = {cs.LO/0605043}, keywords = {continuation, pnc, semantics, sequent}, month = {May}, posted-at = {2006-05-17 01:09:38}, priority = {2}, title = {Continuations, proofs and tests}, url = {http://arxiv.org/abs/cs.LO/0605043}, year = {2006} }

TY - ELEC ID - citeulike:637528 L3 - citeulike-article-id:637528 N2 - 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. TI - Continuations, proofs and tests KW - continuation KW - pnc KW - semantics KW - sequent AU - Guerrini, Stefano AU - Masini, Andrea PY - 2006/May/09/ UR - http://arxiv.org/abs/cs.LO/0605043 ER -