2 ERRATA in the book "Isabelle: A Generic Theorem Prover"
3 by Lawrence C. Paulson (contributions by Tobias Nipkow)
5 Some of these errors are typographical but most of them are due to continuing
8 Thanks to Sara Kalvala, Tobias Nipkow
11 INTRODUCTION TO ISABELLE
15 page 52, middle: the declaration "types bool,nat" should be "types bool nat"
17 page 57, bottom: should be addsimps in
18 val add_ss = FOL_ss addrews [add_0, add_Suc]
21 ISABELLE REFERENCE MANUAL
25 page 67: show_brackets is another flag, controlling display of bracketting
29 page 85: subgoals_tac is another tactic, for multiple calls to subgoal_tac
33 page 117: the three lines of ML shown can be abbreviated to just
36 page 118: extend_theory has been replaced by numerous functions for adding
37 types, constants, axioms, etc.
43 page 127: type constraints ("::") now have a very low priority of 4.
44 As in ML, they must usually be enclosed in paretheses.
46 Syntax Transformations
48 page 145, line -5: delete repeated "the" in "before the the .thy file"
52 page 157 display: Union operator is too big
54 page 158, "!": Isabelle now permits more general left-hand sides, so called
55 higher-order patterns.
58 ISABELLE'S OBJECT-LOGICS
62 page 191: FOL_dup_cs is now deleted (use deepen_tac FOL_cs instead)
64 Zermelo-Fraenkel Set Theory
66 page 204: type i has class term, not (just) logic
68 page 209: axioms have been renamed:
69 union_iff is now Union_iff
70 power_set is now Pow_iff
72 page 215, bottom of figure 17.10: DiffD2 is now "c : A - B ==> c ~: B"
74 page 215, bottom: rules mem_anti_sym and mem_anti_refl are now mem_asym and
77 page 222, top: missing braces in qconverse_def (around right-hand side)
78 and QSigma_def (around <x;y>)
80 page 223, top: lfp_def, gfp_def have missing braces around the argument of
83 page 228: now there is also a theory of cardinal numbers and some
84 developments involving the Axiom of Choice.
86 page 229: now there is another examples directory, IMP (a semantics
87 equivalence proof for an imperative language)
91 page 243: Pow is a new constant of type 'a set => 'a set set
93 page 246: Pow is defined by Pow(A) == {B. B <= A}
95 page 248: Pow has the rules
96 PowI A<=B ==> A: Pow(B)
97 PowD A: Pow(B) ==> A<=B
99 page 251: split now has type [['a,'b] => 'c, 'a * 'b] => 'c
100 Definition modified accordingly
102 page 252: sum_case now has type ['a=>'c,'b=>'c, 'a+'b] =>'c
103 Definition and rules modified accordingly
105 page 252: HOL_dup_cs is now deleted (use deepen_tac HOL_cs instead)
107 page 254: nat_case now has type ['a, nat=>'a, nat] =>'a
108 Definition modified accordingly
110 page 256,258: list_case now takes the list as its last argument, not the
113 page 259: HOL theory files may now include datatype declarations, primitive
114 recursive function definitions, and (co)inductive definitions. (These new
115 sections are available separately as the file ml/HOL-extensions.dvi.gz,
116 host ftp.cl.cam.ac.uk.)
118 page 259: now there is another examples directory, IMP (a semantics
119 equivalence proof for an imperative language)