|
|
|
|
| LEADER |
02521nmm a2200373 u 4500 |
| 001 |
EB000658661 |
| 003 |
EBX01000000000000001349492 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540485865
|
| 100 |
1 |
|
|a Paulson, Lawrence C.
|
| 245 |
0 |
0 |
|a Isabelle
|h Elektronische Ressource
|b A Generic Theorem Prover
|c by Lawrence C. Paulson
|
| 250 |
|
|
|a 1st ed. 1994
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1994, 1994
|
| 300 |
|
|
|a XIX, 329 p
|b online resource
|
| 505 |
0 |
|
|a Foundations -- Getting started with Isabelle -- Advanced methods -- Basic use of Isabelle -- Proof management: The subgoal module -- Tactics -- Tacticals -- Theorems and forward proof -- Theories, terms and types -- Defining logics -- Syntax transformations -- Substitution tactics -- Simplification -- The classical reasoner -- Basic concepts -- First-order logic -- Zermelo-Fraenkel set theory -- Higher-order logic -- First-order sequent calculus -- Constructive Type Theory -- Syntax of Isabelle Theories
|
| 653 |
|
|
|a Computer Science Logic and Foundations of Programming
|
| 653 |
|
|
|a Software engineering
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Mathematical logic
|
| 653 |
|
|
|a Artificial Intelligence
|
| 653 |
|
|
|a Software Engineering
|
| 653 |
|
|
|a Formal Languages and Automata Theory
|
| 653 |
|
|
|a Machine theory
|
| 653 |
|
|
|a Artificial intelligence
|
| 653 |
|
|
|a Mathematical Logic and Foundations
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/BFb0030541
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/BFb0030541?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 005.131
|
| 520 |
|
|
|a As a generic theorem prover, Isabelle supports a variety of logics. Distinctive features include Isabelle's representation of logics within a meta-logic and the use of higher-order unification to combine inference rules. Isabelle can be applied to reasoning in pure mathematics or verification of computer systems. This volume constitutes the Isabelle documentation. It begins by outlining theoretical aspects and then demonstrates the use in practice. Virtually all Isabelle functions are described, with advice on correct usage and numerous examples. Isabelle's built-in logics are also described in detail. There is a comprehensive bebliography and index. The book addresses prospective users of Isabelle as well as researchers in logic and automated reasoning
|