Types for proofs and programs : International Workshop, TYPES 2000 Durham, UK, December 8 12, 2000 : selected papers
Enregistré dans:
| 企業作者: | |
|---|---|
| 其他作者: | , , |
| 格式: | Livre numérique |
| 語言: | Anglais |
| 出版: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| 叢編: | Lecture notes in computer science
2277 |
| 主題: | |
| 在線閱讀: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 提示: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Types for proofs and programs, International Workshop, TYPES 2000, Durham, UK, December 8-12, 2000, selected papers, Paul Callaghan ... [et al.], Berlin, Springer, 2002, 1 vol. (VIII-242 p.), Lecture notes in computer science, 3-540-43287-6 • Types for Proofs and Programs, Texte imprimé, 9783662194775 |
書本目錄:
- Collection Principles in Dependent Type Theory
- Executing Higher Order Logic
- A Tour with Constructive Real Numbers
- An Implementation of Type:Type
- On the Logical Content of Computational Type Theory: A Solution to Curry s Problem
- Constructive Reals in Coq: Axioms and Categoricity
- A Constructive Proof of the Fundamental Theorem of Algebra without Using the Rationals
- A Kripke-Style Model for the Admissibility of Structural Rules
- Towards Limit Computable Mathematics
- Formalizing the Halting Problem in a Constructive Type Theory
- On the Proofs of Some Formally Unprovable Propositions and Prototype Proofs in Type Theory
- Changing Data Structures in Type Theory: A Study of Natural Numbers
- Elimination with a Motive
- Generalization in Type Theory Based Proof Assistants
- An Inductive Version of Nash-Williams Minimal-Bad-Sequence Argument for Higman s Lemma.