000 | 03433nam a22005895i 4500 | ||
---|---|---|---|
001 | 978-3-540-45685-8 | ||
003 | DE-He213 | ||
005 | 20240423132546.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2002 gw | s |||| 0|eng d | ||
020 |
_a9783540456858 _9978-3-540-45685-8 |
||
024 | 7 |
_a10.1007/3-540-45685-6 _2doi |
|
050 | 4 | _aQA76.9.S88 | |
072 | 7 |
_aUYD _2bicssc |
|
072 | 7 |
_aCOM011000 _2bisacsh |
|
072 | 7 |
_aUYD _2thema |
|
082 | 0 | 4 |
_a004.2 _223 |
245 | 1 | 0 |
_aTheorem Proving in Higher Order Logics _h[electronic resource] : _b15th International Conference, TPHOLs 2002, Hampton, VA, USA, August 20-23, 2002. Proceedings / _cedited by Victor A. Carreno, Cesar A. Munoz, Sofiene Tahar. |
250 | _a1st ed. 2002. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2002. |
|
300 |
_aX, 347 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2410 |
|
505 | 0 | _aInvited Talks -- Formal Methods at NASA Langley -- Higher Order Unification 30 Years Later -- Regular Papers -- Combining Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction -- Efficient Reasoning about Executable Specifications in Coq -- Verified Bytecode Model Checkers -- The 5 Colour Theorem in Isabelle/Isar -- Type-Theoretic Functional Semantics -- A Proposal for a Formal OCL Semantics in Isabelle/HOL -- Explicit Universes for the Calculus of Constructions -- Formalised Cut Admissibility for Display Logic -- Formalizing the Trading Theorem for the Classification of Surfaces -- Free-Style Theorem Proving -- A Comparison of Two Proof Critics: Power vs. Robustness -- Two-Level Meta-reasoning in Coq -- PuzzleTool: An Example of Programming Computation and Deduction -- A Formal Approach to Probabilistic Termination -- Using Theorem Proving for Numerical Analysis Correctness Proof of an Automatic Differentiation Algorithm -- Quotient Types: A Modular Approach -- Sequent Schema for Derived Rules -- Algebraic Structures and Dependent Records -- Proving the Equivalence of Microstep and Macrostep Semantics -- Weakest Precondition for General Recursive Programs Formalized in Coq. | |
650 | 0 | _aComputer systems. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aLogic design. | |
650 | 1 | 4 | _aComputer System Implementation. |
650 | 2 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aLogic Design. |
700 | 1 |
_aCarreno, Victor A. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aMunoz, Cesar A. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aTahar, Sofiene. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540440390 |
776 | 0 | 8 |
_iPrinted edition: _z9783662182413 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2410 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/3-540-45685-6 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c189119 _d189119 |