Types for Proofs and Programs (eBook, PDF)

International Workshop, TYPES 2000, Durham, UK, December 8-12, 2000. Selected Papers
Redaktion: Callaghan, Paul; Pollack, Robert; McKinna, James; Luo, Zhaohui

• Format: PDF

Produktbeschreibung

This book constitutes the thoroughly refereed post-proceedings of the International Workshop of the TYPES Working Group, TYPES 2000, held in Durham, UK in December 2000. The 15 revised full papers presented were carefully reviewed and selected during two rounds of refereeing and revision. All current issues on type theory and type systems and their applications to programming, systems design, and proof theory are addressed.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer Berlin Heidelberg
• Seitenzahl: 248
• Erscheinungstermin: 3. August 2003
• Englisch
• ISBN-13: 9783540458425
• Artikelnr.: 53381040

Autorenporträt

Paul Callaghan, University of Durham, UK / Zhaohui Luo, University of Durham, UK / James McKinna, University of Durham, UK / Robert Pollack, The University of Edinburgh, UK

Inhaltsangabe

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.