|
|
|
|
| LEADER |
03635nam a2200565 4500 |
| 001 |
978-3-540-45685-8 |
| 003 |
DE-He213 |
| 005 |
20191028111411.0 |
| 007 |
cr nn 008mamaa |
| 008 |
121227s2002 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540456858
|9 978-3-540-45685-8
|
| 024 |
7 |
|
|a 10.1007/3-540-45685-6
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.9.A73
|
| 050 |
|
4 |
|a QA76.9.S88
|
| 072 |
|
7 |
|a UYD
|2 bicssc
|
| 072 |
|
7 |
|a COM032000
|2 bisacsh
|
| 072 |
|
7 |
|a UYD
|2 thema
|
| 082 |
0 |
4 |
|a 003.3
|2 23
|
| 245 |
1 |
0 |
|a Theorem Proving in Higher Order Logics
|h [electronic resource] :
|b 15th International Conference, TPHOLs 2002, Hampton, VA, USA, August 20-23, 2002. Proceedings /
|c edited by Victor A. Carreno, Cesar A. Munoz, Sofiene Tahar.
|
| 250 |
|
|
|a 1st ed. 2002.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2002.
|
| 300 |
|
|
|a X, 347 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 2410
|
| 505 |
0 |
|
|a Invited 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 |
|a Architecture, Computer.
|
| 650 |
|
0 |
|a Computers.
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
|
0 |
|a Logic design.
|
| 650 |
1 |
4 |
|a Computer System Implementation.
|0 http://scigraph.springernature.com/things/product-market-codes/I13057
|
| 650 |
2 |
4 |
|a Theory of Computation.
|0 http://scigraph.springernature.com/things/product-market-codes/I16005
|
| 650 |
2 |
4 |
|a Software Engineering.
|0 http://scigraph.springernature.com/things/product-market-codes/I14029
|
| 650 |
2 |
4 |
|a Logic Design.
|0 http://scigraph.springernature.com/things/product-market-codes/I12050
|
| 700 |
1 |
|
|a Carreno, Victor A.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Munoz, Cesar A.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Tahar, Sofiene.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783662182413
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540440390
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 2410
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-45685-6
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 912 |
|
|
|a ZDB-2-BAE
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
