网上购物 货比三家
您现在的位置:快乐比价网 > 图书 > 教育/科技 > 科学与研究 > 商品详情

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

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

最 低 价:¥488.20

定 价:¥542.40

作 者:Victor A. Carreno 著

出 版 社:湖南文艺出版社

出版时间:2002-12-1

I S B N:9783540440390

商品详情

编辑推荐

The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community, with numerous individuals, as well as with prestigious organizations and societies, LNCS has grown into the most comprehensive computer science resarch forum available.
The scope of LNCS, including its subseries LNAI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material publised traditionally includes.
-proceedings(published in time for the respective conference)
-post-proceedings(consisting of thoroughly revised final full papers)
-research monographs(which may be basde on outstanding PhD work, research projects, technical reports, etc.)

内容简介

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.

作者简介

目录

Invited Talks
Formal Methods at NASA Langley
 Higher Order Unification 30 Years Later
Regular 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

商品评论(0条)

暂无评论!

您的浏览历史

loading 内容加载中,请稍后...