Logo

Isabelle/HOL: A Proof Assistant for Higher-Order Logic

Large book cover: Isabelle/HOL: A Proof Assistant for Higher-Order Logic

Isabelle/HOL: A Proof Assistant for Higher-Order Logic
by

Publisher: Springer
ISBN/ASIN: 3540433767
ISBN-13: 9783540433767
Number of pages: 223

Description:
This book is a self-contained introduction to interactive proof in higher-order logic (HOL), using the proof assistant Isabelle. It is a tutorial for potential users rather than a monograph for researchers. The book has three parts: Elementary Techniques; Logic and Sets; Advanced Material.

Download or read it online for free here:
Download link
(1.2MB, PDF)

Similar books

Book cover: The Life of Pi: From Archimedes to Eniac and BeyondThe Life of Pi: From Archimedes to Eniac and Beyond
by - DocServer
The desire to understand Pi, the challenge, and originally the need, to calculate ever more accurate values of Pi, has challenged mathematicians for many many centuries, and Pi has provided compelling examples of computational mathematics.
(22869 views)
Book cover: Computer Algebra, Algorithms, Systems and ApplicationsComputer Algebra, Algorithms, Systems and Applications
by - Czech Technical University
From the table of contents: Introduction; Algorithms for algebraic computation; Integrated mathematical systems; Basic possibilities of integrated mathematical systems; Applications of computer algebra; Another sources of study.
(20386 views)
Book cover: Probabilistic Programming and Bayesian Methods for HackersProbabilistic Programming and Bayesian Methods for Hackers
by - GitHub, Inc.
This book is designed as an introduction to Bayesian inference from a computational understanding-first, and mathematics-second, point of view. The book assumes no prior knowledge of Bayesian inference nor probabilistic programming.
(25452 views)
Book cover: Mathematics for Algorithm and Systems AnalysisMathematics for Algorithm and Systems Analysis
by - Dover Publications
This text assists undergraduates in mastering the mathematical language to address problems in the field's many applications. It consists of 4 units: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.
(34406 views)