Markov’s principle for propositional type theory

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

Volumn 2142, Issue , 2001, Pages 570-584

  Kopylov, Alexei ^a   Nogin, Aleksey ^a  

^a Cornell University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; SEMANTICS;

CONSTRUCTIVE SEMANTICS; CONSTRUCTIVE TYPE THEORY; TYPE THEORY;

COMPUTER CIRCUITS;

EID: 23044528884     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44802-0_40     Document Type: Conference Paper

References (20)

1. Stuart F. Allen. A Non-Type-Theoretic Semantics for Type-Theoretic Language. PhD thesis, Cornell University, 1987.
2. Stuart F. Allen. A Non-type-theoretic Definition of Martin-L¨of’s Types. In Proceedings of the Second Symposium on Logic in Computer Science, pages 215–224. IEEE, June 1987.
3. Roland C. Backhouse, Paul Chisholm, Grant Malcolm, and Erik Saaman. Do-ityourself type theory. Formal Aspects of Computing, 1:19–84, 1989.
4. M. J. Beeson. Foundations of Constructive Mathematics. Springer-Verlag, 1985.
5. Douglas Bridges and Fred Richman. Varieties of Constructive Mathematics. Cambridge University Press, Cambridge, 1988.
6. Robert L. Constable, Stuart F. Allen, H. M. Bromley, W. R. Cleaveland, J. F. Cremer, R. W. Harper, Douglas J. Howe, T. B. Knoblock, N. P. Mendler, P. Panangaden, James T. Sasaki, and Scott F. Smith. Implementing Mathematics with the NuPRL Development System. Prentice-Hall, NJ, 1986.
7. Robert L. Constable and Karl Crary. Computational complexity and induction for partial computable functions in type theory. In Preprint, 1998.
8. Matt Fairtlough and Michael Mendler. Propositional laxlogic. Information and Computation, 137(1):1–33, 1997.
9. Jason J. Hickey. The MetaPRL Logical Programming Environment. PhD thesis, Cornell University, January 2001.
10. Jason J. Hickey, Aleksey Nogin, et al. MetaPRL home page. http://metaprl.org/.
11. Martin Hofmann. Extensional concepts in intensional Type theory. PhD thesis, University of Edinburgh, Laboratory for Foundations of Computer Science, 1995.
12. A.A. Markov. On the continuity of constructive function. Uspekhi Matematicheskikh Nauk, 9/3(61):226–230, 1954. In Russian.
13. A.A. Markov. On constructive mathematics. Trudy Matematicheskogo Instituta imeni V.A. Steklova, 67:8–14, 1962. In Russian. English Translation: A.M.S. Translations, series 2, vol.98, pp. 1-9. MR 27#3528.
14. Per Martin-Löf. Constructive mathematics and computer programming. In Proceedings of the Sixth International Congress for Logic, Methodology, and Philosophy of Science, pages 153–175, Amsterdam, 1982. North Holland.
15. Aleksey Nogin. Quotient types – a modular approach. Technical report, Cornell University, 2001. To appear.
16. Erik Palmgren. The Friedman translation for Martin-Löf’s type theory. Mathematical Logic Quarterly, 41:314–326, 1995.
17. Frank Pfenning. Intensionality, extensionality, and proof irrelevance in modal type theory. In Proceedings of the 16th Annual Symposium on Logic in Computer Science, Boston, Massachusetts, June 2001. LICS. To appear.
18. Simon Thompson. Type Theory and Functional Programming. Addison-Wesley, 1991.
19. A.S. Troelstra and D. van Dalen. Constructivism in Mathematics, An Introduction, Vol. I,II. North-Holland, Amsterdam, 1988.
20. Duminda Wijesekera. Constructive modal logics I. Annals of Pure and Applied Logic, 50:271–301, 1990.