Types for Proofs and Programs: International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004, Revised Selected P by Jean-Christophe FilliatreTypes for Proofs and Programs: International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004, Revised Selected P by Jean-Christophe Filliatre

Types for Proofs and Programs: International Workshop, TYPES 2004, Jouy-en-Josas, France, December…

byJean-Christophe FilliatreEditorChristine Paulin-Mohring, Benjamin Werner

Paperback | January 25, 2006

Pricing and Purchase Info

$114.32 online 
$136.95 list price save 16%
Earn 572 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

The 17 revised full papers presented here cover 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.

Title:Types for Proofs and Programs: International Workshop, TYPES 2004, Jouy-en-Josas, France, December…Format:PaperbackDimensions:280 pages, 23.5 × 15.5 × 0.07 inPublished:January 25, 2006Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540314288

ISBN - 13:9783540314288

Look for similar items by category:

Reviews

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.