000 | 03380nam a22005895i 4500 | ||
---|---|---|---|
001 | 978-3-540-74464-1 | ||
003 | DE-He213 | ||
005 | 20240730190405.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2007 gw | s |||| 0|eng d | ||
020 |
_a9783540744641 _9978-3-540-74464-1 |
||
024 | 7 |
_a10.1007/978-3-540-74464-1 _2doi |
|
050 | 4 | _aQA76.76.C65 | |
072 | 7 |
_aUMC _2bicssc |
|
072 | 7 |
_aCOM010000 _2bisacsh |
|
072 | 7 |
_aUMC _2thema |
|
082 | 0 | 4 |
_a005.45 _223 |
245 | 1 | 0 |
_aTypes for Proofs and Programs _h[electronic resource] : _bInternational Workshop, TYPES 2006, Nottingham, UK, April 18-21, 2006, Revised Selected Papers / _cedited by Thorsten Altenkirch, Conor McBride. |
250 | _a1st ed. 2007. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2007. |
|
300 |
_aVIII, 272 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 ; _v4502 |
|
505 | 0 | _aWeyl's Predicative Classical Mathematics as a Logic-Enriched Type Theory -- Crafting a Proof Assistant -- On Constructive Cut Admissibility in Deduction Modulo -- Fast Reflexive Arithmetic Tactics the Linear Case and Beyond -- Combining de Bruijn Indices and Higher-Order Abstract Syntax in Coq -- Deciding Equality in the Constructor Theory -- A Formalisation of a Dependently Typed Language as an Inductive-Recursive Family -- Truth Values Algebras and Proof Normalization -- Curry-Style Types for Nominal Terms -- (In)consistency of Extensions of Higher Order Logic and Type Theory -- Constructive Type Classes in Isabelle -- Zermelo's Well-Ordering Theorem in Type Theory -- A Finite First-Order Theory of Classes -- Coinductive Correctness of Homographic and Quadratic Algorithms for Exact Real Numbers -- Using Intersection Types for Cost-Analysis of Higher-Order Polymorphic Functional Programs -- Subset Coercions in Coq -- A Certified Distributed Security Logic for Authorizing Code. | |
650 | 0 |
_aCompilers (Computer programs). _93350 |
|
650 | 0 |
_aComputer science. _99832 |
|
650 | 0 |
_aMachine theory. _9142330 |
|
650 | 0 |
_aComputer science _xMathematics. _93866 |
|
650 | 0 |
_aArtificial intelligence. _93407 |
|
650 | 1 | 4 |
_aCompilers and Interpreters. _931853 |
650 | 2 | 4 |
_aComputer Science Logic and Foundations of Programming. _942203 |
650 | 2 | 4 |
_aFormal Languages and Automata Theory. _9142331 |
650 | 2 | 4 |
_aSymbolic and Algebraic Manipulation. _955589 |
650 | 2 | 4 |
_aArtificial Intelligence. _93407 |
700 | 1 |
_aAltenkirch, Thorsten. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9142332 |
|
700 | 1 |
_aMcBride, Conor. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _925649 |
|
710 | 2 |
_aSpringerLink (Online service) _9142333 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540744634 |
776 | 0 | 8 |
_iPrinted edition: _z9783540842835 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v4502 _9142334 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-540-74464-1 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c93228 _d93228 |