Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

CORR
2006
Springer

favoriteEmaildiscussreport

123views Education» more CORR 2006»

Continuations, proofs and tests

13 years 4 months ago

Continuations, proofs and tests

Download www.di.univr.it

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.

Stefano Guerrini, Andrea Masini

Real-time Traffic

CORR 2006 | Education | Functional Programming Languages | Important Issues | Primitive Notion |

claim paper

Related Content

» Proof Theory for Kleene Algebra

» A polytime proof of correctness of the RabinMiller algorithm from Fermats little theorem

» Towards Quantitative Analysis of Proofs of Authorization Applications Framework and Techni...

» Uniqueness Continuity and Existence of Implicit Functions in Constructive Analysis

» Robust locally testable codes and products of codes

» Generating HighQuality Tests for Boolean Circuits by Treating Tests as Proof Encoding

» Verifying TestHypotheses An Experiment in Test and Proof

» A proof of completeness for continuous firstorder logic

» Can Proofs Be Animated By Games

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	CORR
Authors	Stefano Guerrini, Andrea Masini

Comments (0)