TY  - BOOK
AU  - Filliâtre,Jean-Christophe
AU  - Paulin-Mohring,Christine
AU  - Werner,Benjamin
ED  - SpringerLink (Online service)
TI  - Types for Proofs and Programs: International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004, Revised Selected Papers 
T2  - Lecture Notes in Computer Science,
SN  - 9783540314295
AV  - QA76.9.L63 
U1  - 005.1015113 23
PY  - 2006///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Logic design
KW  - Algebra
KW  - Data processing
KW  - Artificial intelligence
KW  - Computer Science
KW  - Logics and Meanings of Programs
KW  - Programming Languages, Compilers, Interpreters
KW  - Mathematical Logic and Formal Languages
KW  - Symbolic and Algebraic Manipulation
KW  - Artificial Intelligence (incl. Robotics)
N1  - 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
UR  - http://dx.doi.org/10.1007/11617990
ER  -