Types for Proofs and Programs International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004, Revised Selected Papers
Título:
Types for Proofs and Programs International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004, Revised Selected Papers
ISBN:
9783540314295
Edición:
1st ed. 2006.
PRODUCTION_INFO:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.
Descripción física:
VIII, 280 p. online resource.
Serie:
Theoretical Computer Science and General Issues, 3839
Contenido:
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.
Autor corporativo añadido:
Acceso electrónico:
Full Text Available From Springer Nature Computer Science 2006 Packages
Idioma:
Inglés