Tool support for logics of programs (Q4364537)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1088221
Language Label Description Also known as
default for all languages
No label defined
    English
    Tool support for logics of programs
    scientific article; zbMATH DE number 1088221

      Statements

      22 March 1999
      0 references
      generic theorem prover Isabelle
      0 references
      proof tools
      0 references
      generic reasoning
      0 references
      logic programming
      0 references
      unification
      0 references
      cryptographic protocols
      0 references
      0 references
      0 references
      0 references
      Tool support for logics of programs (English)
      0 references
      Basic concepts of the generic theorem prover Isabelle are presented. Main features of the prover are the following. A higher-order syntax supports variable binding (it uses typed \(\lambda\)-calculus to represent syntax of terms, formulas and rules). Unknowns in goals allow refinement and automatic proof search. A generic framework supports a wide range of notations and methods. The classical reasoner and simplifier let us construct proofs of realistic size. Isabelle implements two set theories. Isabelle/ZF is built upon first-order logic using the standard Zermelo-Fraenkel axioms. Isabelle/HOL (high-order logic) includes a polymorphically typed set theory, with sets represented by predicates. The prover supports inductive and co-inductive relations. Also an application of Isabelle to proofs about cryptographic protocols is presented. For the entire collection see [Zbl 0874.00040].
      0 references

      Identifiers