9783540433767 - Isabelle/HOL: A Proof Assistant for Higher-Order Logic: 2283 (Lecture Notes in Computer Science) de Nipkow, Tobias (14 resultados)

Broschiert. Condición: Gut. 218 Seiten; Das hier angebotene Buch stammt aus einer teilaufgelösten Bibliothek und kann die entsprechenden Kennzeichnungen aufweisen (Rückenschild, Instituts-Stempel.); der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 395.

Condición: As New. Unread book in perfect condition.

Condición: New.

Condición: New.

Paperback. Condición: Used; Very Good. ***Simply Brit*** Welcome to our online used book store, where affordability meets great quality. Dive into a world of captivating reads without breaking the bank. We take pride in offering a wide selection of used books, from classics to hidden gems, ensuring there is something for every literary palate. All orders are shipped within 24 hours and our lightning fast-delivery within 48 hours coupled with our prompt customer service ensures a smooth journey from ordering to delivery. Discover the joy of reading with us, your trusted source for affordable books that do not compromise on quality.

Condición: New. In.

PF. Condición: New.

Condición: New.

Condición: As New. Unread book in perfect condition.

paperback. Condición: New. In shrink wrap. Looks like an interesting title!

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 240 pp. Englisch.

Kartoniert / Broschiert. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 prefe.

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 240 pp. Englisch.