Isabelle/HOL : a proof assistant for higher-order logic
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...
Đã lưu trong:
| Những tác giả chính: | , , |
|---|---|
| Định dạng: | Livre numérique |
| Ngôn ngữ: | Anglais |
| Được phát hành: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Loạt: | Lecture notes in computer science
2283 |
| Những chủ đề: | |
| Truy cập trực tuyến: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Chú thích: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Isabelle/HOL, a proof assistant for higher-order logic, Tobias Nipkow, Lawrence C. Paulson, Markus Wenzel, 2002, Berlin, Springer, 1 vol. (XIII-218 p.), Lecture notes in computer science, 3-540-43376-7 • Isabelle/HOL, Texte imprimé, 9783662182291 |
| LEADER | 04378nam a22004457a 4500 | ||
|---|---|---|---|
| 001 | 948675 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155181130 | ||
| 020 | |a 9783540459491 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004.015113 | ||
| 082 | |a 004 | ||
| 100 | 1 | |a Nipkow, Tobias, |d 1958-..., |c informaticien. | |
| 245 | 1 | 0 | |a Isabelle/HOL : |b a proof assistant for higher-order logic |c Tobias Nipkow, Lawrence C. Paulson, Markus Wenzel. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 2283 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Elementary Techniques -- 1. The Basics -- 2. Functional Programming in HOL -- 3. More Functional Programming -- 4. Presenting Theories -- Logic and Sets -- 5. The Rules of the Game -- 6. Sets, Functions, and Relations -- 7. Inductively Defined Sets -- Advanced Material -- 8. More about Types -- 9. Advanced Simplification, Recursion, and Induction -- 10. Case Study: Verifying a Security Protocol. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a 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, Logic and Sets, presents a collection of lower-level tactics that you can use to apply rules selectively. It also describes I- belle/HOL s treatment of sets, functions, and relations and explains how to de?ne sets inductively. One of the examples concerns the theory of model checking, and another is drawn from a classic textbook on formal languages. | ||
| 650 | |a Génie logiciel | ||
| 650 | |a Informatique | ||
| 650 | |a Langages de programmation | ||
| 650 | |a Intelligence artificielle | ||
| 650 | |a Logique symbolique et mathématique | ||
| 650 | |a Théorèmes |x Démonstration automatique | ||
| 650 | |a Logique informatique | ||
| 700 | 1 | |a Paulson, Lawrence C., |d 1955-...., |c informaticien. |4 aut | |
| 700 | 1 | |a Wenzel, Markus. |4 aut | |
| 776 | 0 | |0 069528578 |t Isabelle/HOL |o a proof assistant for higher-order logic |f Tobias Nipkow, Lawrence C. Paulson, Markus Wenzel |d 2002 |c Berlin |n Springer |p 1 vol. (XIII-218 p.) |s Lecture notes in computer science |z 3-540-43376-7 | |
| 776 | 0 | |t Isabelle/HOL |b Texte imprimé |z 9783662182291 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-45949-9 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-QMBNSP0G-0 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:748058850 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-45949-9 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:751510297 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-45949-9 |z Accès INSA CVL | |
| 997 | |0 948675 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||