default search action
TYPES 2000: Durham, UK
- Paul Callaghan, Zhaohui Luo, James McKinna, Robert Pollack:
Types for Proofs and Programs, International Workshop, TYPES 2000, Durham, UK, December 8-12, 2000, Selected Papers. Lecture Notes in Computer Science 2277, Springer 2002, ISBN 3-540-43287-6 - Peter Aczel, Nicola Gambino:
Collection Principles in Dependent Type Theory. 1-23 - Stefan Berghofer, Tobias Nipkow:
Executing Higher Order Logic. 24-40 - Alberto Ciaffaglione, Pietro Di Gianantonio:
A Tour with Constructive Real Numbers. 41-52 - Thierry Coquand, Makoto Takeyama:
An Implementation of Type: Type. 53-62 - Matt Fairtlough, Michael Mendler:
On the Logical Content of Computational Type Theory: A Solution to Curry's Problem. 63-78 - Herman Geuvers, Milad Niqui:
Constructive Reals in Coq: Axioms and Categoricity. 79-95 - Herman Geuvers, Freek Wiedijk, Jan Zwanenburg:
A Constructive Proof of the Fundamental Theorem of Algebra without Using the Rationals. 96-111 - Healfdene Goguen:
A Kripke-Style Model for the Admissibility of Structural Rules. 112-124 - Susumu Hayashi, Masahiro Nakata:
Towards Limit Computable Mathematics. 125-144 - Kristofer Johannisson:
Formalizing the Halting Problem in a Constructive Type Theory. 145-159 - Giuseppe Longo:
On the Proofs of Some Formally Unprovable Propositions and Prototype Proofs in Type Theory. 160-180 - Nicolas Magaud, Yves Bertot:
Changing Data Structures in Type Theory: A Study of Natural Numbers. 181-196 - Conor McBride:
Elimination with a Motive. 197-216 - Olivier Pons:
Generalization in Type Theory Based Proof Assistants. 217-232 - Monika Seisenberger:
An Inductive Version of Nash-Williams' Minimal-Bad-Sequence Argument for Higman's Lemma. 233-242
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.