A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Classical logic, storage operators and second-order lambda-calculus
1994
Annals of Pure and Applied Logic
We describe here a simple method in order to obtain programs from proofs in second-order classical logic. Then we extend to classical logic the results about storage operators (typed I-terms which simulate call-by-value in call-by-name) proved by for intuitionistic logic. This work generalizes previous results of Parigot (1992). (2) In our type system, the constant c will be declared to have as its type the second-order formula VX(l 1 X --t X), which axiomatizes classical logic over * E-mail
doi:10.1016/0168-0072(94)90047-7
fatcat:uhokyomxmzbklhdsngeuutwqby