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

Brossura

ISBN 10: 3540314288 ISBN 13: 9783540314288

Casa editrice: Springer Berlin Heidelberg, 2008

Riassunto

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.

Su questo libro

Contenuti

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.

Product Description

Book by None

Dettagli dell'edizione

• Editore: Springer Berlin Heidelberg
• Data di pubblicazione: 2008
• Lingua: Inglese
• ISBN 10: 3540314288
• ISBN 13: 9783540314288
• Rilegatura: Copertina flessibile
• Numero di pagine: 288
• Redattore: Filliatre Jean-Christophe
• Contatto del produttore: non disponibile
• Persona responsabile: Springer Nature Customer Service Center GmbH; ProductSafety@springernature.com; ; Europaplatz 3; Heidelberg; 69115; Germania