Ebook: Types for Proofs and Programs: International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004, Revised Selected Papers
Author: Robin Adams (auth.) Jean-Christophe Filliâtre Christine Paulin-Mohring Benjamin Werner (eds.)
- Tags: Logics and Meanings of Programs, Programming Languages Compilers Interpreters, Mathematical Logic and Formal Languages, Symbolic and Algebraic Manipulation, Artificial Intelligence (incl. Robotics)
- Series: Lecture Notes in Computer Science 3839
- Year: 2006
- Publisher: Springer-Verlag Berlin Heidelberg
- Edition: 1
- Language: English
- pdf
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.
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.
Content:
Front Matter....Pages -
Formalized Metatheory with Terms Represented by an Indexed Family of Types....Pages 1-16
A Content Based Mathematical Search Engine: Whelp....Pages 17-32
A Machine-Checked Formalization of the Random Oracle Model....Pages 33-49
Extracting a Normalization Algorithm in Isabelle/HOL....Pages 50-65
A Structured Approach to Proving Compiler Optimizations Based on Dataflow Analysis....Pages 66-81
Formalising Bitonic Sort in Type Theory....Pages 82-97
A Semi-reflexive Tactic for (Sub-)Equational Reasoning....Pages 98-114
A Uniform and Certified Approach for Two Static Analyses....Pages 115-137
Solving Two Problems in General Topology Via Types....Pages 138-153
A Tool for Automated Theorem Proving in Agda....Pages 154-169
Surreal Numbers in Coq....Pages 170-185
A Few Constructions on Constructors....Pages 186-200
Tactic-Based Optimized Compilation of Functional Programs....Pages 201-214
Interfaces as Games, Programs as Strategies....Pages 215-231
?Z: Zermelo’s Set Theory as a PTS with 4 Sorts....Pages 232-251
Exploring the Regular Tree Types....Pages 252-267
On Constructive Existence....Pages 268-273
Back Matter....Pages -
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.
Content:
Front Matter....Pages -
Formalized Metatheory with Terms Represented by an Indexed Family of Types....Pages 1-16
A Content Based Mathematical Search Engine: Whelp....Pages 17-32
A Machine-Checked Formalization of the Random Oracle Model....Pages 33-49
Extracting a Normalization Algorithm in Isabelle/HOL....Pages 50-65
A Structured Approach to Proving Compiler Optimizations Based on Dataflow Analysis....Pages 66-81
Formalising Bitonic Sort in Type Theory....Pages 82-97
A Semi-reflexive Tactic for (Sub-)Equational Reasoning....Pages 98-114
A Uniform and Certified Approach for Two Static Analyses....Pages 115-137
Solving Two Problems in General Topology Via Types....Pages 138-153
A Tool for Automated Theorem Proving in Agda....Pages 154-169
Surreal Numbers in Coq....Pages 170-185
A Few Constructions on Constructors....Pages 186-200
Tactic-Based Optimized Compilation of Functional Programs....Pages 201-214
Interfaces as Games, Programs as Strategies....Pages 215-231
?Z: Zermelo’s Set Theory as a PTS with 4 Sorts....Pages 232-251
Exploring the Regular Tree Types....Pages 252-267
On Constructive Existence....Pages 268-273
Back Matter....Pages -
....