Types for Proofs and Programs International Workshop, TYPES 2000, Durham, UK, December 8-12, 2000. Selected Papers /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Callaghan, Paul (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Luo, Zhaohui (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), McKinna, James (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Pollack, Robert (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
• Έκδοση: 1st ed. 2002.
• Σειρά: Lecture Notes in Computer Science, 2277
• Θέματα: Computer logic.; Architecture, Computer.; Mathematical logic.; Programming languages (Electronic computers).; Artificial intelligence.; Logics and Meanings of Programs.; Computer System Implementation.; Mathematical Logic and Foundations.; Mathematical Logic and Formal Languages.; Programming Languages, Compilers, Interpreters.; Artificial Intelligence.

Πίνακας περιεχομένων:

• 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.