Types for Proofs and Programs International Workshop, TYPES 2006, Nottingham, UK, April 18-21, 2006, Revised Selected Papers /

• Corporate Author: SpringerLink (Online service)
• Other Authors: Altenkirch, Thorsten (Editor), McBride, Conor (Editor)
• Format: Electronic eBook
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007.
• Series: Lecture Notes in Computer Science, 4502
• Subjects: Computer science.; Programming languages (Electronic computers).; Computer logic.; Mathematical logic.; Computer science > Mathematics.; Artificial intelligence.; Computer Science.; Programming Languages, Compilers, Interpreters.; Logics and Meanings of Programs.; Mathematical Logic and Formal Languages.; Symbolic and Algebraic Manipulation.; Artificial Intelligence (incl. Robotics).

Table of Contents:

• Weyl’s Predicative Classical Mathematics as a Logic-Enriched Type Theory
• Crafting a Proof Assistant
• On Constructive Cut Admissibility in Deduction Modulo
• Fast Reflexive Arithmetic Tactics the Linear Case and Beyond
• Combining de Bruijn Indices and Higher-Order Abstract Syntax in Coq
• Deciding Equality in the Constructor Theory
• A Formalisation of a Dependently Typed Language as an Inductive-Recursive Family
• Truth Values Algebras and Proof Normalization
• Curry-Style Types for Nominal Terms
• (In)consistency of Extensions of Higher Order Logic and Type Theory
• Constructive Type Classes in Isabelle
• Zermelo’s Well-Ordering Theorem in Type Theory
• A Finite First-Order Theory of Classes
• Coinductive Correctness of Homographic and Quadratic Algorithms for Exact Real Numbers
• Using Intersection Types for Cost-Analysis of Higher-Order Polymorphic Functional Programs
• Subset Coercions in Coq
• A Certified Distributed Security Logic for Authorizing Code.