Theorem Proving in Higher Order Logics [electronic resource] : 15th International Conference, TPHOLs 2002 Hampton, VA, USA, August 20–23, 2002 Proceedings /

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.

Bibliographic Details

Main Authors:	Carreño, Victor A. editor., Muñoz, César A. editor., Tahar, Sofiène. editor., SpringerLink (Online service)
Format:	Texto biblioteca
Language:	eng
Published:	Berlin, Heidelberg : Springer Berlin Heidelberg, 2002
Subjects:	Computer science., Logic design., Architecture, Computer., Software engineering., Computers., Computer Science., Computer System Implementation., Theory of Computation., Software Engineering., Logic Design.,
Online Access:	http://dx.doi.org/10.1007/3-540-45685-6
Tags:	Add Tag No Tags, Be the first to tag this record!