The SCEAS System
Navigation Menu

Conferences in DBLP

TYPES Workshops (types)
2000 (conf/types/2000)

  1. Peter Aczel, Nicola Gambino
    Collection Principles in Dependent Type Theory. [Citation Graph (0, 0)][DBLP]
    TYPES, 2000, pp:1-23 [Conf]
  2. Stefan Berghofer, Tobias Nipkow
    Executing Higher Order Logic. [Citation Graph (0, 0)][DBLP]
    TYPES, 2000, pp:24-40 [Conf]
  3. Alberto Ciaffaglione, Pietro Di Gianantonio
    A Tour with Constructive Real Numbers. [Citation Graph (0, 0)][DBLP]
    TYPES, 2000, pp:41-52 [Conf]
  4. Thierry Coquand, Makoto Takeyama
    An Implementation of Type: Type. [Citation Graph (0, 0)][DBLP]
    TYPES, 2000, pp:53-62 [Conf]
  5. Matt Fairtlough, Michael Mendler
    On the Logical Content of Computational Type Theory: A Solution to Curry's Problem. [Citation Graph (0, 0)][DBLP]
    TYPES, 2000, pp:63-78 [Conf]
  6. Herman Geuvers, Milad Niqui
    Constructive Reals in Coq: Axioms and Categoricity. [Citation Graph (0, 0)][DBLP]
    TYPES, 2000, pp:79-95 [Conf]
  7. Herman Geuvers, Freek Wiedijk, Jan Zwanenburg
    A Constructive Proof of the Fundamental Theorem of Algebra without Using the Rationals. [Citation Graph (0, 0)][DBLP]
    TYPES, 2000, pp:96-111 [Conf]
  8. Healfdene Goguen
    A Kripke-Style Model for the Admissibility of Structural Rules. [Citation Graph (0, 0)][DBLP]
    TYPES, 2000, pp:112-124 [Conf]
  9. Susumu Hayashi, Masahiro Nakata
    Towards Limit Computable Mathematics. [Citation Graph (0, 0)][DBLP]
    TYPES, 2000, pp:125-144 [Conf]
  10. Kristofer Johannisson
    Formalizing the Halting Problem in a Constructive Type Theory. [Citation Graph (0, 0)][DBLP]
    TYPES, 2000, pp:145-159 [Conf]
  11. Giuseppe Longo
    On the Proofs of Some Formally Unprovable Propositions and Prototype Proofs in Type Theory. [Citation Graph (0, 0)][DBLP]
    TYPES, 2000, pp:160-180 [Conf]
  12. Nicolas Magaud, Yves Bertot
    Changing Data Structures in Type Theory: A Study of Natural Numbers. [Citation Graph (0, 0)][DBLP]
    TYPES, 2000, pp:181-196 [Conf]
  13. Conor McBride
    Elimination with a Motive. [Citation Graph (0, 0)][DBLP]
    TYPES, 2000, pp:197-216 [Conf]
  14. Olivier Pons
    Generalization in Type Theory Based Proof Assistants. [Citation Graph (0, 0)][DBLP]
    TYPES, 2000, pp:217-232 [Conf]
  15. Monika Seisenberger
    An Inductive Version of Nash-Williams' Minimal-Bad-Sequence Argument for Higman's Lemma. [Citation Graph (0, 0)][DBLP]
    TYPES, 2000, pp:233-242 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002