Vai al contenuto principale della pagina

Types for Proofs and Programs [[electronic resource] ] : International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004, Revised Selected Papers / / edited by Jean-Christophe Filliatre, Christine Paulin-Mohring, Benjamin Werner



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Titolo: Types for Proofs and Programs [[electronic resource] ] : International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004, Revised Selected Papers / / edited by Jean-Christophe Filliatre, Christine Paulin-Mohring, Benjamin Werner Visualizza cluster
Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006
Edizione: 1st ed. 2006.
Descrizione fisica: 1 online resource (VIII, 280 p.)
Disciplina: 005.131
Soggetto topico: 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
Persona (resp. second.): FilliatreJean-Christophe
Paulin-MohringChristine
WernerBenjamin
Note generali: Bibliographic Level Mode of Issuance: Monograph
Nota di bibliografia: Includes bibliographical references and index.
Nota di contenuto: 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.
Titolo autorizzato: Types for Proofs and Programs  Visualizza cluster
ISBN: 3-540-31429-6
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 996466114703316
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Serie: Theoretical Computer Science and General Issues, . 2512-2029 ; ; 3839