![]() |
CiteULike | ![]() |
dherman's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
The Formulae-as-Types Notion of ControlIn Conf.\ Record 17th Annual ACM Symp.\ on Principles of Programming Languages, POPL'90, San Francisco, CA, USA, 17--19 Jan 1990 (1990), pp. 47-57.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractThe programming language Scheme contains the control construct call/cc that allows access to the current continuation (the current control context). This, in effect, provides Scheme with first-class labels and jumps. We show that the well-known formulae-astypes correspondence, which relates a constructive proof of a formula ff to a program of type ff, can be extended to a typed Idealized Scheme. What is surprising about this correspondence is that it relates classical proofs to typed programs....
BibTeX record
RIS record