FEEDBACK Smiley face
Normal view MARC view ISBD view

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

Contributor(s): Callaghan, Paul [editor.] | Luo, Zhaohui [editor.] | McKinna, James [editor.] | Pollack, Robert [editor.] | Pollack, Robert [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 2277Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2002.Description: VIII, 248 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540458425.Subject(s): 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 resources: Click here to access online
Contents:
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.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in