Types for Proofs and Programs [electronic resource] : International Workshop, TYPES 2000 Durham, UK, December 8–12, 2000 Selected Papers /

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.

Saved in:
Bibliographic Details
Main Authors: Callaghan, Paul. editor., Luo, Zhaohui. editor., McKinna, James. editor., Pollack, Robert. editor., SpringerLink (Online service)
Format: Texto biblioteca
Language:eng
Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2002
Subjects:Computer science., Architecture, Computer., Programming languages (Electronic computers)., Computer logic., Mathematical logic., Artificial intelligence., Computer Science., Logics and Meanings of Programs., Computer System Implementation., Mathematical Logic and Foundations., Mathematical Logic and Formal Languages., Programming Languages, Compilers, Interpreters., Artificial Intelligence (incl. Robotics).,
Online Access:http://dx.doi.org/10.1007/3-540-45842-5
Tags: Add Tag
No Tags, Be the first to tag this record!