Continuations, proofs and tests
| dc.creator | Guerrini, Stefano | |
| dc.creator | Masini, Andrea | |
| dc.date | 2006-05-09 | |
| dc.date.accessioned | 2026-07-07T07:09:30Z | |
| dc.date.available | 2026-07-07T07:09:30Z | |
| dc.description | 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. | |
| dc.description | 32 pages, uses xy-pic | |
| dc.identifier | https://arxiv.org/abs/cs/0605043 | |
| dc.identifier | http://arxiv.org/abs/cs/0605043 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/111087 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Programming Languages | |
| dc.title | Continuations, proofs and tests | |
| dc.type | text |