doc-src/ERRATA.txt
 author lcp Tue Jan 24 03:00:32 1995 +0100 (1995-01-24) changeset 872 9b7236d774bd parent 863 67692db44c70 child 1083 53a0667e1cd2 permissions -rw-r--r--
```     1 \$Id\$
```
```     2 ERRATA in the book "Isabelle: A Generic Theorem Prover"
```
```     3 by Lawrence C. Paulson (contributions by Tobias Nipkow)
```
```     4
```
```     5 Some of these errors are typographical but most of them are due to continuing
```
```     6 changes to Isabelle.
```
```     7
```
```     8 Thanks to Sara Kalvala, Tobias Nipkow
```
```     9
```
```    10
```
```    11 INTRODUCTION TO ISABELLE
```
```    12
```
```    13 Advanced Methods
```
```    14
```
```    15 page 52, middle: the declaration "types bool,nat" should be "types bool nat"
```
```    16
```
```    17 page 57, bottom: should be addsimps in
```
```    18 	val add_ss = FOL_ss addrews [add_0, add_Suc]
```
```    19
```
```    20
```
```    21 ISABELLE REFERENCE MANUAL
```
```    22
```
```    23 Introduction
```
```    24
```
```    25 page 67: show_brackets is another flag, controlling display of bracketting
```
```    26
```
```    27 Tactics
```
```    28
```
```    29 page 85: subgoals_tac is another tactic, for multiple calls to subgoal_tac
```
```    30
```
```    31 Theories
```
```    32
```
```    33 page 117: the three lines of ML shown can be abbreviated to just
```
```    34 	init_thy_reader();
```
```    35
```
```    36 page 118: extend_theory has been replaced by numerous functions for adding
```
```    37 types, constants, axioms, etc.
```
```    38
```
```    39 Defining Logics
```
```    40
```
```    41
```
```    42
```
```    43 page 127: type constraints ("::") now have a very low priority of 4.
```
```    44 As in ML, they must usually be enclosed in paretheses.
```
```    45
```
```    46 Syntax Transformations
```
```    47
```
```    48 page 145, line -5: delete repeated "the" in "before the the .thy file"
```
```    49
```
```    50 Simplification
```
```    51
```
```    52 page 157 display: Union operator is too big
```
```    53
```
```    54 page 158, "!": Isabelle now permits more general left-hand sides, so called
```
```    55 higher-order patterns.
```
```    56
```
```    57 Classical reasoner
```
```    58
```
```    59 page 176: The package also provides tactics slow_tac, slow_best_tac, depth_tac
```
```    60 and deepen_tac.
```
```    61
```
```    62 ISABELLE'S OBJECT-LOGICS
```
```    63
```
```    64 First-Order Logic
```
```    65
```
```    66 pages 191, 196: FOL_dup_cs is now deleted (use deepen_tac FOL_cs instead)
```
```    67
```
```    68 Zermelo-Fraenkel Set Theory
```
```    69
```
```    70 page 204: type i has class term, not (just) logic
```
```    71
```
```    72 page 209: axioms have been renamed:
```
```    73 	union_iff is now Union_iff
```
```    74 	power_set is now Pow_iff
```
```    75
```
```    76 page 215, bottom of figure 17.10: DiffD2 is now  "c : A - B ==> c ~: B"
```
```    77
```
```    78 page 215, bottom: rules mem_anti_sym and mem_anti_refl are now mem_asym and
```
```    79 mem_irrefl
```
```    80
```
```    81 page 222, top: missing braces in qconverse_def (around right-hand side)
```
```    82 and QSigma_def (around <x;y>)
```
```    83
```
```    84 page 223, top: lfp_def, gfp_def have missing braces around the argument of
```
```    85 Inter, Union
```
```    86
```
```    87 page 228: now there is also a theory of cardinal numbers and some
```
```    88 developments involving the Axiom of Choice.
```
```    89
```
```    90 page 229: now there is another examples directory, IMP (a semantics
```
```    91 equivalence proof for an imperative language)
```
```    92
```
```    93 Higher-Order Logic
```
```    94
```
```    95 page 243: Pow is a new constant of type 'a set => 'a set set
```
```    96
```
```    97 page 246: Pow is defined by   Pow(A) == {B. B <= A}
```
```    98 empty_def should be  {} == {x.False}
```
```    99
```
```   100 page 248: Pow has the rules
```
```   101 	PowI     A<=B ==> A: Pow(B)
```
```   102 	PowD     A: Pow(B) ==> A<=B
```
```   103
```
```   104 page 251: split now has type [['a,'b] => 'c, 'a * 'b] => 'c
```
```   105 Definition modified accordingly
```
```   106
```
```   107 page 252: sum_case now has type ['a=>'c,'b=>'c, 'a+'b] =>'c
```
```   108 Definition and rules modified accordingly
```
```   109
```
```   110 page 252: HOL_dup_cs is now deleted (use deepen_tac HOL_cs instead)
```
```   111
```
```   112 page 254: nat_case now has type ['a, nat=>'a, nat] =>'a
```
```   113 Definition modified accordingly
```
```   114
```
```   115 page 256,258: list_case now takes the list as its last argument, not the
```
```   116 first.
```
```   117
```
```   118 page 259: HOL theory files may now include datatype declarations, primitive
```
```   119 recursive function definitions, and (co)inductive definitions.  (These new
```
```   120 sections are available separately as the file ml/HOL-extensions.dvi.gz,
```
```   121 host ftp.cl.cam.ac.uk.)
```
```   122
```
```   123 page 259: now there is another examples directory, IMP (a semantics
```
```   124 equivalence proof for an imperative language)
```