Extracting constructive content from classical logic via control-like reductions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 664 LNCS, Issue , 1993, Pages 45-59

  Barbanera, Franco ^a   Berardi, Slefano ^a  

^a UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; COMPUTATION THEORY; DIFFERENTIATION (CALCULUS); PATHOLOGY;

CLASSICAL LOGIC; COMPUTATIONAL CONTENTS; COMPUTER SCIENTISTS; CONTROL OPERATORS; LAMBDA-CALCULI; PEANO ARITHMETIC; REDUCTION RULES; TYPED LAMBDA CALCULUS;

COMPUTER CIRCUITS;

EID: 84968335869     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0037097     Document Type: Conference Paper

References (12)

1. Barbanera F., Berardi S. A constructive valuation interpretation for classical logic and its use in witness extraction. Proceedings of Colloquium on Trees in Algebra and Progranuning (CAAP), LNCS 581, Springer Verlag, 1992.
2. Barbanera F., Berardi S. Continuations and simple types: a strong normalization result. Proceedings of the ACM SIGPLAN Workshop on Continuations. Report No STAN-CS-92-1426 Stanford University. San Francisco, June 1992.
3. Coquand T. A Game-theoric semantic of Classical Logic, 1992, submitted to JSL
4. M. Felleisen, R. IIieb, The revised report on the syntactic theories of sequential control. Technical report 100, University of Rice, IIouston, 1989. To appear in Theoretical Compalcr Science.
5. M. Felleisen, D. Friedman, E. Kohlbecker, and B. Duba, Reasoning with continuations. In “Proceedings of the First Annual Symposium on Logic in Computer Science”, pages 131-141, 1986.
6. Friedman H. Classically and intuitionistically provably recursive functions. In Scott D.S. and Mullcr G.H. editors, Higher Set Theory, vol.699 of Lecture Notes in Malhematics, 21-28. Springer Verlag, 1978.
7. Girard Y.J. A new constructive logic: Classical Logic, in MSCS, n. 1, 1990.
8. Timothy G. Griffin. A formulas-as-types notion of control. In “Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages”, 1990.
9. Kreisel G. Mathematical significance of consistency proofs. Journal of Symbolic Logic, 23:155-182, 1958.
10. Murthy C. Extracting constructive content from classical proofs. Ph.d. thesis, Department of Computer science, Cornell University, 1990.
11. Parigot M. lambda-nm-calculus: an algorithmic interpretation of classical natural deduction. Manuscript.
12. Prawitz D. Validity and nornaalizability of proofs in 1-st and 2-nd order classical and intuitionistic logic. In Atti del I Congresso Raliano di Logiea, Napoli, Bibliopolis, 11-36, 1981.