高次逻辑中的定理证明 Theorem proving in higher order logics

书籍目录

Invited Talks  Formal Methods at NASA Langley　Higher Order Unification 30 Years LaterRegular Papers　Combining Higher Order Abstract Syntax with Tacticall 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. Robustfless　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　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.Author Index

作者简介

在线阅读本书







This book constitutes the refereed proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics, TPHOLs 2002, held in Hampton, VA, USA in August 2002.The 20 revised full papers presented together with 2 invited contributions were carefully reviewed and selected from 34 submissions. All current issues in HOL theorem proving and formal verification of software and hardware systems are addressed. Among the HOL theorem proving systems evaluated are Isabelle/HOL, Isabelle/Isar, and Coq. 





  

length: (cm)23.3    　　　            　　　　　            　　　　　 width:(cm)15.4

 高次逻辑中的定理证明 Theorem proving in higher order logics下载