书目名称 | Isabelle/HOL | 副标题 | A Proof Assistant fo | 编辑 | Tobias Nipkow,Markus Wenzel,Lawrence C. Paulson | 视频video | | 概述 | Includes supplementary material: | 丛书名称 | Lecture Notes in Computer Science | 图书封面 |  | 描述 | This volume is a self-contained introduction to interactive proof in high- order logic (HOL), using the proof assistant Isabelle 2002. Compared with existing Isabelle documentation, it provides a direct route into higher-order logic, which most people prefer these days. It bypasses ?rst-order logic and minimizes discussion of meta-theory. It is written for potential users rather than for our colleagues in the research world. Another departure from previous documentation is that we describe Markus Wenzel’s proof script notation instead of ML tactic scripts. The l- ter make it easier to introduce new tactics on the ?y, but hardly anybody does that. Wenzel’s dedicated syntax is elegant, replacing for example eight simpli?cation tactics with a single method, namely simp, with associated - tions. The book has three parts. – The ?rst part, Elementary Techniques, shows how to model functional programs in higher-order logic. Early examples involve lists and the natural numbers. Most proofs are two steps long, consisting of induction on a chosen variable followed by the auto tactic. But even this elementary part covers such advanced topics as nested and mutual recursion. – The second part, | 出版日期 | Textbook 2002 | 关键词 | Formal Methods; Formal Reasoning; Formal Specification; Formal Verification; Functional Programming; High | 版次 | 1 | doi | https://doi.org/10.1007/3-540-45949-9 | isbn_softcover | 978-3-540-43376-7 | isbn_ebook | 978-3-540-45949-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 | issn_series | 0302-9743 | copyright | Springer-Verlag Berlin Heidelberg 2002 |
The information of publication is updating
|
|