000 | 03319nam a22006015i 4500 | ||
---|---|---|---|
001 | 978-3-540-31429-5 | ||
003 | DE-He213 | ||
005 | 20240423125834.0 | ||
007 | cr nn 008mamaa | ||
008 | 100409s2006 gw | s |||| 0|eng d | ||
020 |
_a9783540314295 _9978-3-540-31429-5 |
||
024 | 7 |
_a10.1007/11617990 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aTypes for Proofs and Programs _h[electronic resource] : _bInternational Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004, Revised Selected Papers / _cedited by Jean-Christophe Filliatre, Christine Paulin-Mohring, Benjamin Werner. |
250 | _a1st ed. 2006. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2006. |
|
300 |
_aVIII, 280 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v3839 |
|
505 | 0 | _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. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aCompilers (Computer programs). | |
650 | 0 | _aMachine theory. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aArtificial intelligence. | |
650 | 1 | 4 | _aComputer Science Logic and Foundations of Programming. |
650 | 2 | 4 | _aCompilers and Interpreters. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
650 | 2 | 4 | _aSymbolic and Algebraic Manipulation. |
650 | 2 | 4 | _aArtificial Intelligence. |
700 | 1 |
_aFilliatre, Jean-Christophe. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aPaulin-Mohring, Christine. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aWerner, Benjamin. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540314288 |
776 | 0 | 8 |
_iPrinted edition: _z9783540819882 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v3839 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/11617990 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c182241 _d182241 |