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

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

by Thorsten Altenkirch
     
 

ISBN-10: 3540744630

ISBN-13: 9783540744634

Pub. Date: 10/24/2007

Publisher: Springer Berlin Heidelberg

The refereed post-proceedings of the International Workshop of the Types Working Group are presented in this volume. The 17 papers address all current issues in formal reasoning and computer programming based on type theory, including languages and computerized tools for reasoning; applications in several domains, such as analysis of programming languages;

Overview

The refereed post-proceedings of the International Workshop of the Types Working Group are presented in this volume. The 17 papers address all current issues in formal reasoning and computer programming based on type theory, including languages and computerized tools for reasoning; applications in several domains, such as analysis of programming languages; certified software; formalization of mathematics; and mathematics education.

Product Details

ISBN-13:
9783540744634
Publisher:
Springer Berlin Heidelberg
Publication date:
10/24/2007
Series:
Lecture Notes in Computer Science / Theoretical Computer Science and General Issues Series, #4502
Edition description:
2007
Pages:
272
Product dimensions:
9.21(w) x 6.14(h) x 0.60(d)

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.

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >