On the degeneracy of Σ-types in presence of computational classical logic

Lecture Notes in Computer Science

Volumn 3461, Issue , 2005, Pages 209-220

  Herbelin, Hugo ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL METHODS; COMPUTER SCIENCE; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; PROBLEM SOLVING; THEOREM PROVING;

COMPUTATIONAL CLASSICAL LOGIC; CONTROL OPERATORS; MARTIN-LÖF'S TYPE THEORY; Σ-TYPES;

LOGIC PROGRAMMING;

EID: 24944520912     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11417170_16     Document Type: Conference Paper

References (12)

1. The Coq development team: The Coq Proof Assistant Reference Manual, Version 8.0. (2004). Available at http://coq.inria.fr/doc.
2. Coquand, T.: Metamathematical investigations of a calculus of constructions. In Odifreddi, P., ed.: Logic and Computer Science. Apic Series 31. Academic Press (1990) 91-122.
3. Also INRIA Research Report number 1088, sept 1989.
4. Crolard, T.: A confluent lambda-calculus with a catch/throw mechanism. Journal of Functional Programming 9(6) (1999) 625-647
5. Felleisen, M., Friedman, D.P., Kohlbecker, E., Duba, B.F.: Reasoning with continuations. In: First Symposium on Logic and Computer Science. (1986) 131-141
6. Griffin, T.G.: The formulae-as-types notion of control. In: Conf. Record 17th Annual ACM Symp. on Principles of Programming Languages, POPL '90, San Francisco, CA, USA, 17-19 Jan 1990, ACM Press, New York (1990) 47-57
7. Martin-Löf, P.: Intuitionistic Type Theory. Bibliopolis (1984)
8. Parigot, M.: Lambda-mu-calculus: An algorithmic interpretation of classical natural deduction. In: Logic Programming and Automated Reasoning: International Conference LPAR '92 Proceedings, St. Petersburg, Russia, Springer-Verlag (1992) 190-201
9. Pottinger, G.: Definite descriptions and excluded middle in the theory of constructions (1989). Communication to the TYPES electronic mailing list.
10. Prawitz, D.: Natural Deduction - A Proof-Theoretical Study. Almqvist & Wiksell, Stockholm (1965)
11. Smith, J.M.: The independence of Peano's fourth axiom from Martin-Löf's type theory without universes. Journal of Symbolic Logic 53 (1988) 840-845
12. Spector, C.: Provably recursive functionals of analysis: a consistency proof of analysis by an extension of principles in current intuitionistic mathematics. In: Recursive Function Theory: Proc. Symposia in Pure Mathematics. Volume 5., American Mathematical Society (1962) 1-27