LEADER 03687nam  22007215  450 
001 996466114703316
005 20230221050914.0
010   $a3-540-31429-6
024 7 $a10.1007/11617990
035   $a(CKB)1000000000232780
035   $a(SSID)ssj0000320541
035   $a(PQKBManifestationID)11231115
035   $a(PQKBTitleCode)TC0000320541
035   $a(PQKBWorkID)10257813
035   $a(PQKB)10694791
035   $a(DE-He213)978-3-540-31429-5
035   $a(MiAaPQ)EBC3068270
035   $a(PPN)123130816
035   $a(EXLCZ)991000000000232780
100   $a20100409d2006      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aTypes for Proofs and Programs$b[electronic resource] $eInternational Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004, Revised Selected Papers /$fedited by Jean-Christophe Filliatre, Christine Paulin-Mohring, Benjamin Werner
205   $a1st ed. 2006.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006.
215   $a1 online resource (VIII, 280 p.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3839
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-31428-8 
320   $aIncludes bibliographical references and index.
327   $aFormalized 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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3839
606   $aComputer science
606   $aCompilers (Computer programs)
606   $aMachine theory
606   $aComputer science?Mathematics
606   $aArtificial intelligence
606   $aComputer Science Logic and Foundations of Programming
606   $aCompilers and Interpreters
606   $aFormal Languages and Automata Theory
606   $aSymbolic and Algebraic Manipulation
606   $aArtificial Intelligence
615  0$aComputer science.
615  0$aCompilers (Computer programs).
615  0$aMachine theory.
615  0$aComputer science?Mathematics.
615  0$aArtificial intelligence.
615 14$aComputer Science Logic and Foundations of Programming.
615 24$aCompilers and Interpreters.
615 24$aFormal Languages and Automata Theory.
615 24$aSymbolic and Algebraic Manipulation.
615 24$aArtificial Intelligence.
676   $a005.131
702   $aFilliatre$b Jean-Christophe$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aPaulin-Mohring$b Christine$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aWerner$b Benjamin$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996466114703316
996   $aTypes for Proofs and Programs$9771867
997   $aUNISA