Types for Proofs and Programs International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004, Revised Selected Papers / [electronic resource] :
edited by Jean-Christophe Filliatre, Christine Paulin-Mohring, Benjamin Werner.
- 1st ed. 2006.
- VIII, 280 p. online resource.
- Theoretical Computer Science and General Issues, 3839 2512-2029 ; .
- Theoretical Computer Science and General Issues, 3839 .
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.
9783540314295
10.1007/11617990 doi
Computer science.
Compilers (Computer programs).
Machine theory.
Computer science--Mathematics.
Artificial intelligence.
Computer Science Logic and Foundations of Programming.
Compilers and Interpreters.
Formal Languages and Automata Theory.
Symbolic and Algebraic Manipulation.
Artificial Intelligence.
QA75.5-76.95
004.0151
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.
9783540314295
10.1007/11617990 doi
Computer science.
Compilers (Computer programs).
Machine theory.
Computer science--Mathematics.
Artificial intelligence.
Computer Science Logic and Foundations of Programming.
Compilers and Interpreters.
Formal Languages and Automata Theory.
Symbolic and Algebraic Manipulation.
Artificial Intelligence.
QA75.5-76.95
004.0151