A Curry-Howard foundation for functional computation with control (1997)
| Venue: | In Proceedings of ACM SIGPLAN-SIGACT Symposium on Principle of Programming Languages |
| Citations: | 67 - 3 self |
BibTeX
@INPROCEEDINGS{Ong97acurry-howard,
author = {C. -h. L. Ong and C. A. Stewart},
title = {A Curry-Howard foundation for functional computation with control},
booktitle = {In Proceedings of ACM SIGPLAN-SIGACT Symposium on Principle of Programming Languages},
year = {1997},
pages = {215--227},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We introduce the type theory ¯ v , a call-by-value variant of Parigot's ¯-calculus, as a Curry-Howard representation theory of classical propositional proofs. The associated rewrite system is Church-Rosser and strongly normalizing, and definitional equality of the type theory is consistent, compatible with cut, congruent and decidable. The attendant call-by-value programming language ¯pcf v is obtained from ¯ v by augmenting it by basic arithmetic, conditionals and fixpoints. We study the behavioural properties of ¯pcf v and show that, though simple, it is a very general language for functional computation with control: it can express all the main control constructs such as exceptions and first-class continuations. Proof-theoretically the dual ¯ v -constructs of naming and ¯-abstraction witness the introduction and elimination rules of absurdity respectively. Computationally they give succinct expression to a kind of generic (forward) "jump" operator, which may be regarded as a unif...
