Extracting Constructive Content from Classical Logic via Control-like Reductions

  title={Extracting Constructive Content from Classical Logic via Control-like Reductions},
  author={Franco Barbanera and Stefano Berardi},
Recently there has been much interest in the problem of nding the computational content of classical reasoning. One of the most appealing directions for the computer scientist to tackle such a problem is the relation which has been established between classical logic and lambda calculi with control operators, like Felleisen's control operator C. In this paper we introduce a typed lambda calculus with the C operator corresponding to Peano Arithmetic, and a set of reduction rules related to the… CONTINUE READING

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 11 references

Continuations and simple types: a strong normalization result

F. Barbanera, S. Berardi
Proceedings of the ACM SIGPLAN Workshop on Continuations. Report No STAN-CS-92-1426 Stanford University. San Francisco, • 1992
View 5 Excerpts
Highly Influenced

A New Constructive Logic: Classical Logic

Mathematical Structures in Computer Science • 1991
View 4 Excerpts
Highly Influenced

Extracting constructive content from classical proofs

C. Murthy
Ph.d. thesis, • 1990
View 4 Excerpts
Highly Influenced

A Game-theoric semantic of Classical Logic, 1992, submitted to JSL

T. Coquand
View 3 Excerpts
Highly Influenced

Classically and intuitionistically provably recursive functions

H. Friedman
Higher Set Theory , • 1978
View 4 Excerpts
Highly Influenced

Gri n. A formulas-as-types notion of control

G. Timothy
In "Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Lan guages", • 1990
View 1 Excerpt

Validity and normalizability of proofs in 1-st and 2-nd order classi cal and intuitionistic logic

D. Prawitz
In Atti del I Congresso Italiano di Logica, Napoli, Bibliopolis, • 1981
View 1 Excerpt

Similar Papers

Loading similar papers…