Isabelle/HOL

@inproceedings{Nipkow2002IsabelleHOL,
  title={Isabelle/HOL},
  author={Tobias Nipkow and Lawrence Charles Paulson and Markus Wenzel},
  booktitle={Lecture Notes in Computer Science},
  year={2002}
}
By reading, you can know the knowledge and things more, not only about what you get from people to people. Book will be more trusted. As this isabelle hol a proof assistant for higher order logic, it will really give you the good idea to be successful. It is not only for you to be success in certain life you can be successful in everything. The success can be started by knowing the basic knowledge and do actions. 

From LCF to Isabelle/HOL

This work focuses on Isabelle/HOL and its distinctive strengths, which include automatic proof search, borrowing techniques from the world of first order theorem proving, but also the automatic search for counterexamples.

Isabelle/HOL as a Meta-Language for Teaching Logic

This claim is supported by discussing three formalizations in Isabelle/HOL used in a recent course on automated reasoning that are a formalization of System W, the Natural Deduction Assistant (NaDeA), and a one-sided sequent calculus that uses the authors' Sequent Calculus Verifier (SeCaV).

Unifying Theories of Programming in Isabelle

This is a tutorial introduction to the two most basic theories in Hoare & He's Unifying Theories of Programming and their mechanisation in the Isabelle interactive theorem prover. We describe the

A Verified Decision Procedure for Orders in Isabelle/HOL

We present the first verified implementation of a decision procedure for the quantifier-free theory of partial and linear orders. We formalise the procedure in Isabelle/HOL and provide a

LiFtEr: Language to Encode Induction Heuristics for Isabelle/HOL

Proof assistants, such as Isabelle/HOL, offer tools to facilitate inductive theorem proving. Isabelle experts know how to use these tools effectively; however they did not have a systematic way to

A Formalization and Proof Checker for Isabelle’s Metalogic

This work formalizes this metalogic and the language of proof terms in Isabelle/HOL, defines an executable (but inefficient) proof term checker and proves the correctness of all the proofs in those theories.

Admissible Types-to-PERs Relativization in Higher-Order Logic

It is proved that, for a large practical fragment of HOL which includes container types such as datatypes and codatatypes, types-to-PERs relativization is admissible, in that the provability of the original, type-based statement implies the provabilities of its relativized, PER-based counterpart.

Interactive Proof: Introduction to Isabelle/HOL

  • T. Nipkow
  • Computer Science
    Software Safety and Security
  • 2012
This paper introduces interactive theorem proving with the Isabelle/HOL system and introduces the proof language Isar, which is shown how to write structured proofs that are readable by both the machine and the human.

A Case Study in Computer-Assisted Meta-reasoning

This work discusses human and mechanized reasoning with regards to the use of proof assistants, in particular Isabelle/HOL and indicates that proof assistants are well suited as development tools for assuredly correct programs in languages like Haskell.

Formalizing a Seligman-Style Tableau System for Hybrid Logic

This work formalizes soundness and completeness proofs for a Seligman-style tableau system for hybrid logic in the proof assistant Isabelle/HOL and shows how to lift certain rule restrictions, thereby simplifying the original un-formalized proof.
...

References

SHOWING 1-10 OF 24 REFERENCES

HOLCF = HOL + LCF

This paper describes in detail how domain theory is embedded in HOL, and presents applications from functional programming, concurrency and denotational semantics.

Isabelle: A Generic Theorem Prover

This book discusses theories, terms and types, tactics, and theorems of Isabelle Theories as well as its application to proof management.

Isabelle, Isar - a versatile environment for human readable formal proof documents

This work aims to make formal theory developments with machine-checked proofs accessible to a broader audience, and demonstrates that the Isar concepts are indeed sufficiently versatile to cover a broad range of applications.

Object-Oriented Verification Based on Record Subtyping in Higher-Order Logic

It is shown how extensible records with structural subtyping can be represented directly in Higher-Order Logic, and an environment for object-oriented specification and verification (HOOL) is built, which offers several well-known concepts like classes, objects, methods and late-binding.

Introduction to HOL: a theorem proving environment for higher order logic

A tutorial on goal-directed proof: tactics and tacticals and theorem-Proving With HOL, a simple proof tool for goal-oriented proof of the binomial theorem.

Functional unification of higher-order patterns

The complete development of a unification algorithm for so-called higher-order patterns, a subclass of lambda -terms, is presented and the result is a directly executable functional program in de Bruijn's (1972) notation.

Mechanizing Nonstandard Real Analysis

This paper first describes the construction and use of the hyperreals in the theorem-prover Isabelle within the framework of higher-order logic (HOL). The theory, which includes infinitesimals and

Definition of standard ML

This book provides a formal definition of Standard ML for the benefit of all concerned with the language, including users and implementers, and the authors have defined their semantic objects in mathematical notation that is completely independent of StandardML.

Proofs and types

Sense, denotation and semantics natural deduction the Curry-Howard isomorphism the normalisation theorem Godel's system T coherence spaces denotational semantics of T sums in natural deduction system