Continuations, proofs and tests

Computer Science – Logic in Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

32 pages, uses xy-pic

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Continuations, proofs and tests does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Continuations, proofs and tests, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Continuations, proofs and tests will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-705730

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.