Extracting constructive content from classical logic via control-like reductions-Reference-Cited by-同舟云学术

Extracting constructive content from classical logic via control-like reductions

Published: Issue: Volume: Page:45-59
ISSN:
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Barbanera Franco,Berardi Stefano

Publisher

Springer-Verlag

Link

http://link.springer.com/content/pdf/10.1007/BFb0037097.pdf

Reference12 articles.

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 Programming (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. Ilieb, The revised report on the syntactic theories of sequential control. Technical report 100, University of Rice, Houston, 1989. To appear in Theoretical Computer 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.

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Strong Normalization for HA + EM1 by Non-Deterministic Choice;Electronic Proceedings in Theoretical Computer Science;2013-09-04

2. Classical truth in higher types;Mathematical Logic Quarterly;2008-05-06

3. A type-theoretic foundation of delimited continuations;Higher-Order and Symbolic Computation;2007-10-24

4. A proof-theoretic foundation of abortive continuations;Higher-Order and Symbolic Computation;2007-10-24

5. Bibliography;Lectures on the Curry-Howard Isomorphism;2006