Types for Proofs and Programs: International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004, Revised Selected Papers / Edition 1

Types for Proofs and Programs: International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004, Revised Selected Papers / Edition 1

by Jean-Christophe Filliatre
     
 

ISBN-10: 3540314288

ISBN-13: 9783540314288

Pub. Date: 03/16/2006

Publisher: Springer Berlin Heidelberg

This book constitutes the thoroughly refereed post-proceedings of the annual International Workshop of the Types Working Group, TYPES 2004, held in Jouy-en-Josas, France in December 2004. The 17 revised full papers presented were carefully reviewed and selected from 33 submissions. All current issues of formal reasoning and computer programming based on type theory

…  See more details below

Overview

This book constitutes the thoroughly refereed post-proceedings of the annual International Workshop of the Types Working Group, TYPES 2004, held in Jouy-en-Josas, France in December 2004. The 17 revised full papers presented were carefully reviewed and selected from 33 submissions. All current issues of formal reasoning and computer programming based on type theory are addressed; in particular languages and computerised tools for reasoning, and applications in several domains such as analysis of programming languages, certified software, formalisation of mathematics and mathematics education.

Product Details

ISBN-13:
9783540314288
Publisher:
Springer Berlin Heidelberg
Publication date:
03/16/2006
Series:
Lecture Notes in Computer Science / Theoretical Computer Science and General Issues Series, #3839
Edition description:
2006
Pages:
280
Product dimensions:
9.21(w) x 6.14(h) x 0.61(d)

Table of Contents

Formalized Metatheory with Terms Represented by an Indexed Family of Types.- A Content Based Mathematical Search Engine: Whelp.- A Machine-Checked Formalization of the Random Oracle Model.- Extracting a Normalization Algorithm in Isabelle/HOL.- A Structured Approach to Proving Compiler Optimizations Based on Dataflow Analysis.- Formalising Bitonic Sort in Type Theory.- A Semi-reflexive Tactic for (Sub-)Equational Reasoning.- A Uniform and Certified Approach for Two Static Analyses.- Solving Two Problems in General Topology Via Types.- A Tool for Automated Theorem Proving in Agda.- Surreal Numbers in Coq.- A Few Constructions on Constructors.- Tactic-Based Optimized Compilation of Functional Programs.- Interfaces as Games, Programs as Strategies.-—Z: Zermelo’s Set Theory as a PTS with 4 Sorts.- Exploring the Regular Tree Types.- On Constructive Existence.

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >