summary |
shortlog |
changelog |
graph |
tags |
branches |
files |
changeset |
file |
revisions |
annotate |
diff |
raw

doc-src/ERRATA.txt

author | nipkow |

Sun Sep 11 12:52:00 1994 +0200 (1994-09-11) | |

changeset 601 | 208834a9ba70 |

parent 599 | 08b403fe92b1 |

child 614 | da97045ef59a |

permissions | -rw-r--r-- |

Added primrec section

1 $Id$

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

6 changes to Isabelle.

8 Thanks to Sara Kalvala, Tobias Nipkow

11 INTRODUCTION TO ISABELLE

13 Advanced Methods

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

23 Introduction

25 page 67: show_brackets is another flag, controlling display of bracketting

27 Tactics

29 page 85: subgoals_tac is another tactic, for multiple calls to subgoal_tac

31 Theories

33 page 117: the three lines of ML shown can be abbreviated to just

34 init_thy_reader();

36 page 118: extend_theory has been replaced by numerous functions for adding

37 types, constants, axioms, etc.

39 Defining Logics

41 page 127: type constraints ("::") now have a very low priority of 4.

42 As in ML, they must usually be enclosed in paretheses.

44 Syntax Transformations

46 page 145, line -5: delete repeated "the" in "before the the .thy file"

49 ISABELLE'S OBJECT-LOGICS

51 Zermelo-Fraenkel Set Theory

53 page 209: axioms have been renamed:

54 union_iff is now Union_iff

55 power_set is now Pow_iff

57 page 215, bottom of figure 17.10: DiffD2 is now "c : A - B ==> c ~: B"

59 page 215, bottom: rules mem_anti_sym and mem_anti_refl are now mem_asym and

60 mem_irrefl

62 page 222, top: missing braces in qconverse_def (around right-hand side)

63 and QSigma_def (around <x;y>)

65 page 223, top: lfp_def, gfp_def have missing braces around the argument of

66 Inter, Union

68 page 228: now there is also a theory of cardinal numbers and some

69 developments involving the Axiom of Choice.

71 page 229: now there is another examples directory, IMP (a semantics

72 equivalence proof for an imperative language)

74 Higher-Order Logic

76 page 243: Pow is a new constant of type 'a set => 'a set set

78 page 246: Pow is defined by Pow(A) == {B. B <= A}

80 page 248: Pow has the rules

81 PowI A<=B ==> A: Pow(B)

82 PowD A: Pow(B) ==> A<=B

84 page 259: HOL theory files may now include datatype declarations, primitive

85 recursive function definitions, and (co)inductive definitions. (Three

86 sections added.)

88 page 259: now there is another examples directory, IMP (a semantics

89 equivalence proof for an imperative language)