NEWS
author wenzelm
Thu Oct 22 12:26:55 1998 +0200 (1998-10-22)
changeset 5726 5de7e399ec88
parent 5722 c669e2161b08
child 5731 f84dc3b811e9
permissions -rw-r--r--
tuned;
record package;
wenzelm@5726
     1
wenzelm@5363
     2
Isabelle NEWS -- history user-relevant changes
wenzelm@5363
     3
==============================================
wenzelm@2553
     4
wenzelm@4981
     5
New in this Isabelle version
wenzelm@4981
     6
----------------------------
oheimb@4649
     7
wenzelm@5127
     8
*** Overview of INCOMPATIBILITIES (see below for more details) ***
wenzelm@4842
     9
wenzelm@5726
    10
* several changes of automated proof tools;
wenzelm@5373
    11
wenzelm@5726
    12
* HOL: major changes to the inductive and datatype packages, including
wenzelm@5726
    13
some minor incompatibilities of theory syntax;
berghofe@5214
    14
wenzelm@5726
    15
* HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
wenzelm@5217
    16
called `inj_on';
paulson@5160
    17
nipkow@5275
    18
* HOL: removed duplicate thms in Arith:
nipkow@5275
    19
  less_imp_add_less  should be replaced by  trans_less_add1
nipkow@5275
    20
  le_imp_add_le      should be replaced by  trans_le_add1
paulson@5160
    21
wenzelm@5726
    22
* HOL: unary minus is now overloaded (new type constraints may be
wenzelm@5726
    23
required);
paulson@5490
    24
wenzelm@5726
    25
* HOL and ZF: unary minus for integers is now #- instead of #~.  In
wenzelm@5726
    26
ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
wenzelm@5726
    27
now taken as an integer constant.
paulson@5541
    28
wenzelm@5726
    29
* Pure: ML function 'theory_of' renamed to 'theory';
wenzelm@5397
    30
wenzelm@5363
    31
wenzelm@5127
    32
*** Proof tools ***
nipkow@4880
    33
nipkow@5657
    34
* Simplifier:
nipkow@5657
    35
  1. Asm_full_simp_tac is now more aggressive.
nipkow@5657
    36
     1. It will sometimes reorient premises if that increases their power to
nipkow@5657
    37
        simplify.
nipkow@5657
    38
     2. It does no longer proceed strictly from left to right but may also
nipkow@5657
    39
        rotate premises to achieve further simplification.
nipkow@5657
    40
     For compatibility reasons there is now Asm_lr_simp_tac which is like the
nipkow@5657
    41
     old Asm_full_simp_tac in that it does not rotate premises.
nipkow@5657
    42
  2. The simplifier now knows a little bit about nat-arithmetic.
nipkow@4880
    43
wenzelm@5127
    44
* Classical reasoner: wrapper mechanism for the classical reasoner now
wenzelm@5127
    45
allows for selected deletion of wrappers, by introduction of names for
wenzelm@5127
    46
wrapper functionals.  This implies that addbefore, addSbefore,
wenzelm@5127
    47
addaltern, and addSaltern now take a pair (name, tactic) as argument,
wenzelm@5127
    48
and that adding two tactics with the same name overwrites the first
wenzelm@5127
    49
one (emitting a warning).
oheimb@4824
    50
  type wrapper = (int -> tactic) -> (int -> tactic)
oheimb@4649
    51
  setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
oheimb@4824
    52
  addWrapper, addSWrapper: claset * (string * wrapper) -> claset
oheimb@4824
    53
  delWrapper, delSWrapper: claset *  string            -> claset
oheimb@4649
    54
  getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
oheimb@4649
    55
wenzelm@5705
    56
* Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
wenzelm@5726
    57
semantics; addbefore now affects only the unsafe part of step_tac
wenzelm@5726
    58
etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
wenzelm@5726
    59
FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
wenzelm@5726
    60
by Force_tac;
oheimb@5524
    61
wenzelm@5726
    62
* Classical reasoner: setwrapper to setWrapper and compwrapper to
wenzelm@5726
    63
compWrapper; added safe wrapper (and access functions for it);
oheimb@5524
    64
wenzelm@5127
    65
* HOL/split_all_tac is now much faster and fails if there is nothing
wenzelm@5726
    66
to split.  Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
wenzelm@5726
    67
and the names of the automatically generated variables have changed.
wenzelm@5726
    68
split_all_tac has moved within claset() from unsafe wrappers to safe
wenzelm@5726
    69
wrappers, which means that !!-bound variables are split much more
wenzelm@5726
    70
aggressively, and safe_tac and clarify_tac now split such variables.
wenzelm@5726
    71
If this splitting is not appropriate, use delSWrapper "split_all_tac".
wenzelm@5726
    72
Note: the same holds for record_split_tac, which does the job of
wenzelm@5726
    73
split_all_tac for record fields.
wenzelm@5127
    74
wenzelm@5726
    75
* HOL/Simplifier: Rewrite rules for case distinctions can now be added
wenzelm@5726
    76
permanently to the default simpset using Addsplits just like
wenzelm@5726
    77
Addsimps. They can be removed via Delsplits just like
wenzelm@5726
    78
Delsimps. Lower-case versions are also available.
wenzelm@5127
    79
wenzelm@5726
    80
* HOL/Simplifier: The rule split_if is now part of the default
wenzelm@5726
    81
simpset. This means that the simplifier will eliminate all occurrences
wenzelm@5726
    82
of if-then-else in the conclusion of a goal. To prevent this, you can
wenzelm@5726
    83
either remove split_if completely from the default simpset by
wenzelm@5726
    84
`Delsplits [split_if]' or remove it in a specific call of the
wenzelm@5726
    85
simplifier using `... delsplits [split_if]'.  You can also add/delete
wenzelm@5726
    86
other case splitting rules to/from the default simpset: every datatype
wenzelm@5726
    87
generates suitable rules `split_t_case' and `split_t_case_asm' (where
wenzelm@5726
    88
t is the name of the datatype).
wenzelm@5127
    89
wenzelm@5726
    90
* Classical reasoner / Simplifier combination: new force_tac (and
wenzelm@5127
    91
derivatives Force_tac, force) combines rewriting and classical
wenzelm@5127
    92
reasoning (and whatever other tools) similarly to auto_tac, but is
wenzelm@5726
    93
aimed to solve the given subgoal completely.
wenzelm@5127
    94
wenzelm@5127
    95
wenzelm@5127
    96
*** General ***
wenzelm@5127
    97
wenzelm@5217
    98
* new top-level commands `Goal' and `Goalw' that improve upon `goal'
wenzelm@5127
    99
and `goalw': the theory is no longer needed as an explicit argument -
wenzelm@5127
   100
the current theory context is used; assumptions are no longer returned
wenzelm@5127
   101
at the ML-level unless one of them starts with ==> or !!; it is
wenzelm@5217
   102
recommended to convert to these new commands using isatool fixgoal
wenzelm@5217
   103
(backup your sources first!);
wenzelm@4842
   104
wenzelm@5217
   105
* new top-level commands 'thm' and 'thms' for retrieving theorems from
wenzelm@5207
   106
the current theory context, and 'theory' to lookup stored theories;
paulson@4806
   107
paulson@5722
   108
* new theory section 'locale' for declaring constants, assumptions and
paulson@5722
   109
definitions that have local scope;
paulson@5722
   110
wenzelm@5127
   111
* new theory section 'nonterminals' for purely syntactic types;
wenzelm@4858
   112
wenzelm@5127
   113
* new theory section 'setup' for generic ML setup functions
wenzelm@5127
   114
(e.g. package initialization);
wenzelm@4869
   115
wenzelm@5131
   116
* the distribution now includes Isabelle icons: see
wenzelm@5131
   117
lib/logo/isabelle-{small,tiny}.xpm;
wenzelm@5131
   118
wenzelm@5363
   119
* isatool install - install binaries with absolute references to
wenzelm@5363
   120
ISABELLE_HOME/bin;
wenzelm@5363
   121
wenzelm@5572
   122
* isatool logo -- create instances of the Isabelle logo (as EPS);
wenzelm@5572
   123
wenzelm@5407
   124
* print mode 'emacs' reserved for Isamode;
wenzelm@5407
   125
wenzelm@5726
   126
* support multiple print (ast) translations per constant name;
wenzelm@5726
   127
wenzelm@4711
   128
paulson@4661
   129
*** HOL ***
paulson@4661
   130
wenzelm@5710
   131
* there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
nipkow@5709
   132
wenzelm@5217
   133
* HOL/inductive package reorganized and improved: now supports mutual
paulson@5267
   134
definitions such as
wenzelm@5217
   135
wenzelm@5217
   136
  inductive EVEN ODD
wenzelm@5217
   137
    intrs
wenzelm@5217
   138
      null "0 : EVEN"
wenzelm@5217
   139
      oddI "n : EVEN ==> Suc n : ODD"
wenzelm@5217
   140
      evenI "n : ODD ==> Suc n : EVEN"
wenzelm@5217
   141
wenzelm@5217
   142
new theorem list "elims" contains an elimination rule for each of the
wenzelm@5217
   143
recursive sets; inductive definitions now handle disjunctive premises
wenzelm@5217
   144
correctly (also ZF);
berghofe@5214
   145
wenzelm@5217
   146
INCOMPATIBILITIES: requires Inductive as an ancestor; component
wenzelm@5217
   147
"mutual_induct" no longer exists - the induction rule is always
wenzelm@5217
   148
contained in "induct";
wenzelm@5217
   149
wenzelm@5217
   150
wenzelm@5217
   151
* HOL/datatype package re-implemented and greatly improved: now
paulson@5267
   152
supports mutually recursive datatypes such as
wenzelm@5217
   153
wenzelm@5217
   154
  datatype
wenzelm@5217
   155
    'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
wenzelm@5217
   156
            | SUM ('a aexp) ('a aexp)
wenzelm@5217
   157
            | DIFF ('a aexp) ('a aexp)
wenzelm@5217
   158
            | NUM 'a
wenzelm@5217
   159
  and
wenzelm@5217
   160
    'a bexp = LESS ('a aexp) ('a aexp)
wenzelm@5217
   161
            | AND ('a bexp) ('a bexp)
wenzelm@5217
   162
            | OR ('a bexp) ('a bexp)
wenzelm@5217
   163
paulson@5267
   164
as well as indirectly recursive datatypes such as
berghofe@5214
   165
wenzelm@5217
   166
  datatype
wenzelm@5217
   167
    ('a, 'b) term = Var 'a
wenzelm@5217
   168
                  | App 'b ((('a, 'b) term) list)
berghofe@5214
   169
wenzelm@5217
   170
The new tactic  mutual_induct_tac [<var_1>, ..., <var_n>] i  performs
wenzelm@5217
   171
induction on mutually / indirectly recursive datatypes.
wenzelm@5217
   172
wenzelm@5217
   173
Primrec equations are now stored in theory and can be accessed via
wenzelm@5217
   174
<function_name>.simps.
wenzelm@5217
   175
wenzelm@5217
   176
INCOMPATIBILITIES:
berghofe@5214
   177
wenzelm@5217
   178
  - Theories using datatypes must now have theory Datatype as an
wenzelm@5217
   179
    ancestor.
wenzelm@5217
   180
  - The specific <typename>.induct_tac no longer exists - use the
wenzelm@5217
   181
    generic induct_tac instead.
berghofe@5226
   182
  - natE has been renamed to nat.exhaust - use exhaust_tac
wenzelm@5217
   183
    instead of res_inst_tac ... natE. Note that the variable
berghofe@5226
   184
    names in nat.exhaust differ from the names in natE, this
wenzelm@5217
   185
    may cause some "fragile" proofs to fail.
wenzelm@5217
   186
  - The theorems split_<typename>_case and split_<typename>_case_asm
wenzelm@5217
   187
    have been renamed to <typename>.split and <typename>.split_asm.
wenzelm@5217
   188
  - Since default sorts of type variables are now handled correctly,
wenzelm@5217
   189
    some datatype definitions may have to be annotated with explicit
wenzelm@5217
   190
    sort constraints.
wenzelm@5217
   191
  - Primrec definitions no longer require function name and type
wenzelm@5217
   192
    of recursive argument.
berghofe@5214
   193
wenzelm@5217
   194
Consider using isatool fixdatatype to adapt your theories and proof
wenzelm@5217
   195
scripts to the new package (backup your sources first!).
wenzelm@5217
   196
wenzelm@5217
   197
wenzelm@5726
   198
* HOL/record package: considerably improved implementation; now
wenzelm@5726
   199
includes concrete syntax for record types, terms, updates; theorems
wenzelm@5726
   200
for surjective pairing and splitting !!-bound record variables; proof
wenzelm@5726
   201
support is as follows:
wenzelm@5726
   202
wenzelm@5726
   203
  1) standard conversions (selectors or updates applied to record
wenzelm@5726
   204
constructor terms) are part of the standard simpset;
wenzelm@5726
   205
wenzelm@5726
   206
  2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
wenzelm@5726
   207
made part of standard simpset and claset via addIffs;
wenzelm@5726
   208
wenzelm@5726
   209
  3) a tactic for record field splitting (record_split_tac) is part of
wenzelm@5726
   210
the standard claset (addSWrapper);
wenzelm@5726
   211
wenzelm@5726
   212
To get a better idea about these rules you may retrieve them via
wenzelm@5726
   213
something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
wenzelm@5726
   214
the name of your record type.
wenzelm@5726
   215
wenzelm@5726
   216
The split tactic 3) conceptually simplifies by the following rule:
wenzelm@5726
   217
wenzelm@5726
   218
  "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
wenzelm@5726
   219
wenzelm@5726
   220
Thus any record variable that is bound by meta-all will automatically
wenzelm@5726
   221
blow up into some record constructor term, consequently the
wenzelm@5726
   222
simplifications of 1), 2) apply.  Thus force_tac, auto_tac etc. shall
wenzelm@5726
   223
solve record problems automatically.
wenzelm@5726
   224
berghofe@5214
   225
wenzelm@5125
   226
* reorganized the main HOL image: HOL/Integ and String loaded by
wenzelm@5125
   227
default; theory Main includes everything;
wenzelm@5125
   228
paulson@5650
   229
* automatic simplification of integer sums and comparisons, using cancellation;
paulson@5650
   230
oheimb@5526
   231
* added option_map_eq_Some and not_Some_eq to the default simpset and claset;
wenzelm@5127
   232
wenzelm@5127
   233
* added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
wenzelm@5127
   234
wenzelm@5127
   235
* many new identities for unions, intersections, set difference, etc.;
wenzelm@5127
   236
wenzelm@5127
   237
* expand_if, expand_split, expand_sum_case and expand_nat_case are now
wenzelm@5127
   238
called split_if, split_split, split_sum_case and split_nat_case (to go
wenzelm@5127
   239
with add/delsplits);
wenzelm@5125
   240
wenzelm@5127
   241
* HOL/Prod introduces simplification procedure unit_eq_proc rewriting
wenzelm@5127
   242
(?x::unit) = (); this is made part of the default simpset, which COULD
wenzelm@5127
   243
MAKE EXISTING PROOFS FAIL under rare circumstances (consider
wenzelm@5207
   244
'Delsimprocs [unit_eq_proc];' as last resort); also note that
wenzelm@5207
   245
unit_abs_eta_conv is added in order to counter the effect of
wenzelm@5207
   246
unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
wenzelm@5207
   247
%u.f();
wenzelm@5125
   248
wenzelm@5217
   249
* HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
wenzelm@5217
   250
makes more sense);
berghofe@5109
   251
paulson@5475
   252
* HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
paulson@5475
   253
  It and 'sym RS equals0D' are now in the default  claset, giving automatic
paulson@5475
   254
  disjointness reasoning but breaking a few old proofs.
paulson@5267
   255
wenzelm@5217
   256
* HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
wenzelm@5217
   257
to 'converse' from 'inverse' (for compatibility with ZF and some
wenzelm@5217
   258
literature);
wenzelm@5085
   259
wenzelm@5127
   260
* HOL/recdef can now declare non-recursive functions, with {} supplied as
wenzelm@5127
   261
the well-founded relation;
oheimb@4838
   262
paulson@5490
   263
* HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
paulson@5490
   264
    Compl A.  The "Compl" syntax remains available as input syntax for this
paulson@5490
   265
    release ONLY.
paulson@5490
   266
wenzelm@5127
   267
* HOL/Update: new theory of function updates:
wenzelm@5127
   268
    f(a:=b) == %x. if x=a then b else f x
wenzelm@5127
   269
may also be iterated as in f(a:=b,c:=d,...);
nipkow@5077
   270
wenzelm@5127
   271
* HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
paulson@4899
   272
nipkow@5282
   273
* HOL/List:
nipkow@5282
   274
  - new function list_update written xs[i:=v] that updates the i-th
nipkow@5282
   275
    list position. May also be iterated as in xs[i:=a,j:=b,...].
nipkow@5428
   276
  - new function `upt' written [i..j(] which generates the list
nipkow@5428
   277
    [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
nipkow@5428
   278
    bound write [i..j], which is a shorthand for [i..j+1(].
nipkow@5282
   279
  - new lexicographic orderings and corresponding wellfoundedness theorems.
paulson@4779
   280
wenzelm@5127
   281
* HOL/Arith:
wenzelm@5127
   282
  - removed 'pred' (predecessor) function;
wenzelm@5127
   283
  - generalized some theorems about n-1;
wenzelm@5127
   284
  - many new laws about "div" and "mod";
wenzelm@5127
   285
  - new laws about greatest common divisors (see theory ex/Primes);
oheimb@4766
   286
wenzelm@5127
   287
* HOL/Relation: renamed the relational operator r^-1 "converse"
wenzelm@4842
   288
instead of "inverse";
wenzelm@4711
   289
nipkow@5651
   290
* HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
nipkow@5651
   291
  of the multiset ordering;
nipkow@5651
   292
wenzelm@5127
   293
* directory HOL/Real: a construction of the reals using Dedekind cuts
nipkow@5651
   294
  (not included by default);
nipkow@4835
   295
wenzelm@5127
   296
* directory HOL/UNITY: Chandy and Misra's UNITY formalism;
wenzelm@4711
   297
nipkow@5651
   298
* directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
nipkow@5651
   299
  programs, i.e. different program variables may have different types.
nipkow@5651
   300
paulson@5142
   301
* calling (stac rew i) now fails if "rew" has no effect on the goal
paulson@5142
   302
  [previously, this check worked only if the rewrite rule was unconditional]
paulson@5308
   303
  Now rew can involve either definitions or equalities (either == or =).
wenzelm@5002
   304
wenzelm@5363
   305
paulson@4879
   306
*** ZF ***
paulson@4879
   307
paulson@5332
   308
* theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
paulson@5332
   309
  only the theorems proved on ZF.ML;
paulson@5160
   310
paulson@5475
   311
* ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
paulson@5475
   312
  It and 'sym RS equals0D' are now in the default  claset, giving automatic
paulson@5475
   313
  disjointness reasoning but breaking a few old proofs.
paulson@5267
   314
paulson@5160
   315
* ZF/Update: new theory of function updates
paulson@5160
   316
    with default rewrite rule  f(x:=y) ` z = if(z=x, y, f`z)
paulson@5160
   317
  may also be iterated as in f(a:=b,c:=d,...);
paulson@5160
   318
paulson@4879
   319
* in  let x=t in u(x), neither t nor u(x) has to be an FOL term.
oheimb@4649
   320
paulson@5142
   321
* calling (stac rew i) now fails if "rew" has no effect on the goal
paulson@5142
   322
  [previously, this check worked only if the rewrite rule was unconditional]
paulson@5308
   323
  Now rew can involve either definitions or equalities (either == or =).
paulson@5142
   324
paulson@5160
   325
* case_tac provided for compatibility with HOL
paulson@5160
   326
    (like the old excluded_middle_tac, but with subgoals swapped)
paulson@5160
   327
wenzelm@4842
   328
wenzelm@5127
   329
*** Internal programming interfaces ***
wenzelm@5002
   330
wenzelm@5251
   331
* Pure: several new basic modules made available for general use, see
wenzelm@5251
   332
also src/Pure/README;
wenzelm@5207
   333
wenzelm@5008
   334
* improved the theory data mechanism to support encapsulation (data
wenzelm@5008
   335
kind name replaced by private Object.kind, acting as authorization
wenzelm@5373
   336
key); new type-safe user interface via functor TheoryDataFun; generic
wenzelm@5373
   337
print_data function becomes basically useless;
wenzelm@5002
   338
wenzelm@5251
   339
* removed global_names compatibility flag -- all theory declarations
wenzelm@5251
   340
are qualified by default;
wenzelm@5251
   341
wenzelm@5085
   342
* module Pure/Syntax now offers quote / antiquote translation
wenzelm@5085
   343
functions (useful for Hoare logic etc. with implicit dependencies);
wenzelm@5373
   344
see HOL/ex/Antiquote for an example use;
wenzelm@5085
   345
wenzelm@5127
   346
* Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
wenzelm@5127
   347
cterm -> thm;
wenzelm@5127
   348
wenzelm@5207
   349
* new tactical CHANGED_GOAL for checking that a tactic modifies a
wenzelm@5207
   350
subgoal;
paulson@5142
   351
wenzelm@5251
   352
* Display.print_goals function moved to Locale.print_goals;
wenzelm@5251
   353
wenzelm@5002
   354
wenzelm@5002
   355
wenzelm@4410
   356
New in Isabelle98 (January 1998)
wenzelm@4410
   357
--------------------------------
wenzelm@4410
   358
wenzelm@4410
   359
*** Overview of INCOMPATIBILITIES (see below for more details) ***
wenzelm@4410
   360
wenzelm@4410
   361
* changed lexical syntax of terms / types: dots made part of long
wenzelm@4410
   362
identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
wenzelm@4410
   363
wenzelm@4410
   364
* simpset (and claset) reference variable replaced by functions
wenzelm@4410
   365
simpset / simpset_ref;
wenzelm@4410
   366
wenzelm@4410
   367
* no longer supports theory aliases (via merge) and non-trivial
wenzelm@4410
   368
implicit merge of thms' signatures;
wenzelm@4410
   369
wenzelm@4410
   370
* most internal names of constants changed due to qualified names;
wenzelm@4410
   371
wenzelm@4410
   372
* changed Pure/Sequence interface (see Pure/seq.ML);
wenzelm@4410
   373
wenzelm@3454
   374
paulson@3715
   375
*** General Changes ***
paulson@3715
   376
wenzelm@4174
   377
* hierachically structured name spaces (for consts, types, axms, thms
wenzelm@3943
   378
etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
wenzelm@4108
   379
old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
wenzelm@4108
   380
isatool fixdots ensures space after dots (e.g. "%x. x"); set
wenzelm@4174
   381
long_names for fully qualified output names; NOTE: ML programs
wenzelm@4174
   382
(special tactics, packages etc.) referring to internal names may have
wenzelm@4174
   383
to be adapted to cope with fully qualified names; in case of severe
wenzelm@4174
   384
backward campatibility problems try setting 'global_names' at compile
wenzelm@4174
   385
time to have enrything declared within a flat name space; one may also
wenzelm@4174
   386
fine tune name declarations in theories via the 'global' and 'local'
wenzelm@4174
   387
section;
wenzelm@4108
   388
wenzelm@4108
   389
* reimplemented the implicit simpset and claset using the new anytype
wenzelm@4108
   390
data filed in signatures; references simpset:simpset ref etc. are
wenzelm@4108
   391
replaced by functions simpset:unit->simpset and
wenzelm@4108
   392
simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
wenzelm@4108
   393
to patch your ML files accordingly;
paulson@3856
   394
wenzelm@3857
   395
* HTML output now includes theory graph data for display with Java
wenzelm@3857
   396
applet or isatool browser; data generated automatically via isatool
wenzelm@3901
   397
usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
wenzelm@3857
   398
paulson@3856
   399
* defs may now be conditional; improved rewrite_goals_tac to handle
paulson@3856
   400
conditional equations;
paulson@3856
   401
wenzelm@4174
   402
* defs now admits additional type arguments, using TYPE('a) syntax;
wenzelm@4174
   403
wenzelm@3901
   404
* theory aliases via merge (e.g. M=A+B+C) no longer supported, always
wenzelm@3901
   405
creates a new theory node; implicit merge of thms' signatures is
wenzelm@4112
   406
restricted to 'trivial' ones; COMPATIBILITY: one may have to use
wenzelm@3901
   407
transfer:theory->thm->thm in (rare) cases;
wenzelm@3901
   408
wenzelm@3968
   409
* improved handling of draft signatures / theories; draft thms (and
wenzelm@3968
   410
ctyps, cterms) are automatically promoted to real ones;
wenzelm@3968
   411
wenzelm@3901
   412
* slightly changed interfaces for oracles: admit many per theory, named
wenzelm@3901
   413
(e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
wenzelm@3901
   414
wenzelm@3901
   415
* print_goals: optional output of const types (set show_consts and
wenzelm@3901
   416
show_types);
wenzelm@3851
   417
wenzelm@4388
   418
* improved output of warnings (###) and errors (***);
wenzelm@3697
   419
paulson@4178
   420
* subgoal_tac displays a warning if the new subgoal has type variables;
paulson@4178
   421
paulson@3715
   422
* removed old README and Makefiles;
wenzelm@3697
   423
paulson@3856
   424
* replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
wenzelm@3670
   425
paulson@3715
   426
* removed obsolete init_pps and init_database;
paulson@3715
   427
paulson@3715
   428
* deleted the obsolete tactical STATE, which was declared by
paulson@3715
   429
    fun STATE tacfun st = tacfun st st;
paulson@3715
   430
wenzelm@4388
   431
* cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
wenzelm@4388
   432
(which abbreviates $HOME);
wenzelm@4269
   433
wenzelm@4269
   434
* changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
wenzelm@4269
   435
use isatool fixseq to adapt your ML programs (this works for fully
wenzelm@4269
   436
qualified references to the Sequence structure only!);
wenzelm@4269
   437
wenzelm@4381
   438
* use_thy no longer requires writable current directory; it always
wenzelm@4381
   439
reloads .ML *and* .thy file, if either one is out of date;
wenzelm@4269
   440
paulson@3715
   441
paulson@3715
   442
*** Classical Reasoner ***
paulson@3715
   443
wenzelm@3744
   444
* Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
wenzelm@3744
   445
tactics that use classical reasoning to simplify a subgoal without
wenzelm@3744
   446
splitting it into several subgoals;
paulson@3715
   447
paulson@3719
   448
* Safe_tac: like safe_tac but uses the default claset;
paulson@3719
   449
paulson@3715
   450
paulson@3715
   451
*** Simplifier ***
paulson@3715
   452
paulson@3715
   453
* added simplification meta rules:
paulson@3715
   454
    (asm_)(full_)simplify: simpset -> thm -> thm;
paulson@3715
   455
paulson@3715
   456
* simplifier.ML no longer part of Pure -- has to be loaded by object
paulson@3715
   457
logics (again);
paulson@3715
   458
paulson@3715
   459
* added prems argument to simplification procedures;
paulson@3715
   460
paulson@4325
   461
* HOL, FOL, ZF: added infix function `addsplits':
paulson@4325
   462
  instead of `<simpset> setloop (split_tac <thms>)'
paulson@4325
   463
  you can simply write `<simpset> addsplits <thms>'
paulson@4325
   464
paulson@3715
   465
paulson@3715
   466
*** Syntax ***
paulson@3715
   467
wenzelm@4174
   468
* TYPE('a) syntax for type reflection terms;
wenzelm@4174
   469
wenzelm@3985
   470
* no longer handles consts with name "" -- declare as 'syntax' instead;
paulson@3856
   471
paulson@3856
   472
* pretty printer: changed order of mixfix annotation preference (again!);
wenzelm@3846
   473
paulson@3715
   474
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
paulson@3715
   475
paulson@3715
   476
paulson@3715
   477
*** HOL ***
paulson@3715
   478
wenzelm@5726
   479
* HOL: there is a new splitter `split_asm_tac' that can be used e.g.
oheimb@4189
   480
  with `addloop' of the simplifier to faciliate case splitting in premises.
oheimb@4189
   481
nipkow@4035
   482
* HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
wenzelm@3985
   483
wenzelm@3985
   484
* HOL/Auth: new protocol proofs including some for the Internet
nipkow@4035
   485
  protocol TLS;
wenzelm@3985
   486
wenzelm@4125
   487
* HOL/Map: new theory of `maps' a la VDM;
nipkow@3982
   488
wenzelm@4335
   489
* HOL/simplifier: simplification procedures nat_cancel_sums for
wenzelm@4335
   490
cancelling out common nat summands from =, <, <= (in)equalities, or
wenzelm@4335
   491
differences; simplification procedures nat_cancel_factor for
wenzelm@4335
   492
cancelling common factor from =, <, <= (in)equalities over natural
wenzelm@4373
   493
sums; nat_cancel contains both kinds of procedures, it is installed by
wenzelm@4373
   494
default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
wenzelm@4335
   495
nipkow@3580
   496
* HOL/simplifier: terms of the form
paulson@4325
   497
  `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)'  (or t=x)
nipkow@3580
   498
  are rewritten to
nipkow@4035
   499
  `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
nipkow@4035
   500
  and those of the form
paulson@4325
   501
  `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)'  (or t=x)
nipkow@4035
   502
  are rewritten to
nipkow@4035
   503
  `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
nipkow@4035
   504
nipkow@4035
   505
* HOL/datatype
nipkow@4035
   506
  Each datatype `t' now comes with a theorem `split_t_case' of the form
nipkow@3580
   507
nipkow@4035
   508
  P(t_case f1 ... fn x) =
nipkow@4035
   509
     ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
nipkow@4035
   510
        ...
oheimb@4189
   511
       (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
nipkow@4035
   512
     )
nipkow@4035
   513
oheimb@4930
   514
  and a theorem `split_t_case_asm' of the form
oheimb@4189
   515
oheimb@4189
   516
  P(t_case f1 ... fn x) =
oheimb@4189
   517
    ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
oheimb@4189
   518
        ...
oheimb@4189
   519
       (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
oheimb@4189
   520
     )
oheimb@4930
   521
  which can be added to a simpset via `addsplits'. The existing theorems
oheimb@4930
   522
  expand_list_case and expand_option_case have been renamed to
oheimb@4930
   523
  split_list_case and split_option_case.
oheimb@4189
   524
nipkow@4361
   525
* HOL/Arithmetic:
nipkow@4361
   526
  - `pred n' is automatically converted to `n-1'.
nipkow@4361
   527
    Users are strongly encouraged not to use `pred' any longer,
nipkow@4361
   528
    because it will disappear altogether at some point.
nipkow@4361
   529
  - Users are strongly encouraged to write "0 < n" rather than
nipkow@4361
   530
    "n ~= 0". Theorems and proof tools have been modified towards this
nipkow@4361
   531
    `standard'.
nipkow@4357
   532
nipkow@4502
   533
* HOL/Lists:
nipkow@4502
   534
  the function "set_of_list" has been renamed "set" (and its theorems too);
nipkow@4502
   535
  the function "nth" now takes its arguments in the reverse order and
nipkow@4502
   536
  has acquired the infix notation "!" as in "xs!n".
paulson@3570
   537
paulson@4154
   538
* HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
paulson@4154
   539
paulson@4154
   540
* HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
paulson@4154
   541
  specialist theorems (like UN1_I) are gone.  Similarly for (INT x.B x);
paulson@4154
   542
wenzelm@4575
   543
* HOL/record: extensible records with schematic structural subtyping
wenzelm@4575
   544
(single inheritance); EXPERIMENTAL version demonstrating the encoding,
wenzelm@4575
   545
still lacks various theorems and concrete record syntax;
wenzelm@4575
   546
wenzelm@4125
   547
paulson@3715
   548
*** HOLCF ***
wenzelm@3535
   549
wenzelm@4125
   550
* removed "axioms" and "generated by" sections;
wenzelm@4125
   551
oheimb@4123
   552
* replaced "ops" section by extended "consts" section, which is capable of
wenzelm@4125
   553
  handling the continuous function space "->" directly;
wenzelm@4125
   554
wenzelm@4125
   555
* domain package:
wenzelm@4125
   556
  . proves theorems immediately and stores them in the theory,
wenzelm@4125
   557
  . creates hierachical name space,
wenzelm@4125
   558
  . now uses normal mixfix annotations (instead of cinfix...),
wenzelm@4125
   559
  . minor changes to some names and values (for consistency),
wenzelm@4125
   560
  . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
wenzelm@4125
   561
  . separator between mutual domain defs: changed "," to "and",
wenzelm@4125
   562
  . improved handling of sort constraints;  now they have to
wenzelm@4125
   563
    appear on the left-hand side of the equations only;
oheimb@4123
   564
oheimb@4123
   565
* fixed LAM <x,y,zs>.b syntax;
wenzelm@3567
   566
wenzelm@3744
   567
* added extended adm_tac to simplifier in HOLCF -- can now discharge
wenzelm@3744
   568
adm (%x. P (t x)), where P is chainfinite and t continuous;
wenzelm@3579
   569
wenzelm@3579
   570
paulson@3719
   571
*** FOL and ZF ***
paulson@3719
   572
wenzelm@5726
   573
* FOL: there is a new splitter `split_asm_tac' that can be used e.g.
oheimb@4189
   574
  with `addloop' of the simplifier to faciliate case splitting in premises.
oheimb@4189
   575
wenzelm@3744
   576
* qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
wenzelm@3744
   577
in HOL, they strip ALL and --> from proved theorems;
wenzelm@3744
   578
paulson@3719
   579
wenzelm@3579
   580
wenzelm@3006
   581
New in Isabelle94-8 (May 1997)
wenzelm@3006
   582
------------------------------
wenzelm@2654
   583
paulson@3002
   584
*** General Changes ***
paulson@3002
   585
paulson@3002
   586
* new utilities to build / run / maintain Isabelle etc. (in parts
paulson@3002
   587
still somewhat experimental); old Makefiles etc. still functional;
wenzelm@2971
   588
wenzelm@3205
   589
* new 'Isabelle System Manual';
wenzelm@3205
   590
wenzelm@2825
   591
* INSTALL text, together with ./configure and ./build scripts;
wenzelm@2773
   592
wenzelm@3006
   593
* reimplemented type inference for greater efficiency, better error
wenzelm@3006
   594
messages and clean internal interface;
paulson@3002
   595
paulson@3002
   596
* prlim command for dealing with lots of subgoals (an easier way of
paulson@3002
   597
setting goals_limit);
paulson@3002
   598
wenzelm@3006
   599
wenzelm@3006
   600
*** Syntax ***
paulson@3002
   601
wenzelm@3116
   602
* supports alternative (named) syntax tables (parser and pretty
wenzelm@3116
   603
printer); internal interface is provided by add_modesyntax(_i);
wenzelm@3116
   604
paulson@3002
   605
* Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
paulson@3002
   606
be used in conjunction with the Isabelle symbol font; uses the
paulson@3002
   607
"symbols" syntax table;
paulson@3002
   608
wenzelm@2705
   609
* added token_translation interface (may translate name tokens in
wenzelm@2756
   610
arbitrary ways, dependent on their type (free, bound, tfree, ...) and
wenzelm@3116
   611
the current print_mode); IMPORTANT: user print translation functions
wenzelm@3116
   612
are responsible for marking newly introduced bounds
wenzelm@3116
   613
(Syntax.mark_boundT);
wenzelm@2705
   614
wenzelm@2730
   615
* token translations for modes "xterm" and "xterm_color" that display
wenzelm@3006
   616
names in bold, underline etc. or colors (which requires a color
wenzelm@3006
   617
version of xterm);
wenzelm@2730
   618
paulson@3002
   619
* infixes may now be declared with names independent of their syntax;
paulson@3002
   620
paulson@3002
   621
* added typed_print_translation (like print_translation, but may
paulson@3002
   622
access type of constant);
paulson@3002
   623
wenzelm@3006
   624
paulson@3002
   625
*** Classical Reasoner ***
paulson@3002
   626
paulson@3002
   627
Blast_tac: a new tactic!  It is often more powerful than fast_tac, but has
paulson@3002
   628
some limitations.  Blast_tac...
paulson@3002
   629
  + ignores addss, addbefore, addafter; this restriction is intrinsic
paulson@3002
   630
  + ignores elimination rules that don't have the correct format
wenzelm@5726
   631
        (the conclusion MUST be a formula variable)
paulson@3002
   632
  + ignores types, which can make HOL proofs fail
paulson@3002
   633
  + rules must not require higher-order unification, e.g. apply_type in ZF
paulson@3002
   634
    [message "Function Var's argument not a bound variable" relates to this]
paulson@3002
   635
  + its proof strategy is more general but can actually be slower
paulson@3002
   636
wenzelm@3107
   637
* substitution with equality assumptions no longer permutes other
wenzelm@3107
   638
assumptions;
paulson@3002
   639
paulson@3002
   640
* minor changes in semantics of addafter (now called addaltern); renamed
paulson@3002
   641
setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
wenzelm@3107
   642
(and access functions for it);
paulson@3002
   643
wenzelm@5726
   644
* improved combination of classical reasoner and simplifier:
oheimb@3317
   645
  + functions for handling clasimpsets
oheimb@3317
   646
  + improvement of addss: now the simplifier is called _after_ the
oheimb@3317
   647
    safe steps.
oheimb@3317
   648
  + safe variant of addss called addSss: uses safe simplifications
wenzelm@5726
   649
    _during_ the safe steps. It is more complete as it allows multiple
oheimb@3317
   650
    instantiations of unknowns (e.g. with slow_tac).
wenzelm@3006
   651
paulson@3002
   652
*** Simplifier ***
paulson@3002
   653
wenzelm@3006
   654
* added interface for simplification procedures (functions that
wenzelm@3006
   655
produce *proven* rewrite rules on the fly, depending on current
wenzelm@3006
   656
redex);
wenzelm@3006
   657
wenzelm@3006
   658
* ordering on terms as parameter (used for ordered rewriting);
wenzelm@3006
   659
wenzelm@3107
   660
* new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
paulson@3002
   661
paulson@3002
   662
* the solver is now split into a safe and an unsafe part.
paulson@3002
   663
This should be invisible for the normal user, except that the
paulson@3002
   664
functions setsolver and addsolver have been renamed to setSolver and
wenzelm@3107
   665
addSolver; added safe_asm_full_simp_tac;
paulson@3002
   666
paulson@3002
   667
paulson@3002
   668
*** HOL ***
paulson@3002
   669
nipkow@3042
   670
* a generic induction tactic `induct_tac' which works for all datatypes and
wenzelm@3107
   671
also for type `nat';
nipkow@3042
   672
nipkow@3316
   673
* a generic case distinction tactic `exhaust_tac' which works for all
nipkow@3316
   674
datatypes and also for type `nat';
nipkow@3316
   675
nipkow@3316
   676
* each datatype comes with a function `size';
nipkow@3316
   677
paulson@3002
   678
* patterns in case expressions allow tuple patterns as arguments to
wenzelm@3107
   679
constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
paulson@3002
   680
paulson@3002
   681
* primrec now also works with type nat;
paulson@3002
   682
paulson@3338
   683
* recdef: a new declaration form, allows general recursive functions to be
paulson@3338
   684
defined in theory files.  See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
paulson@3338
   685
paulson@3002
   686
* the constant for negation has been renamed from "not" to "Not" to
wenzelm@3107
   687
harmonize with FOL, ZF, LK, etc.;
paulson@3002
   688
wenzelm@3107
   689
* HOL/ex/LFilter theory of a corecursive "filter" functional for
wenzelm@3107
   690
infinite lists;
paulson@3002
   691
wenzelm@3227
   692
* HOL/Modelcheck demonstrates invocation of model checker oracle;
wenzelm@3227
   693
paulson@3002
   694
* HOL/ex/Ring.thy declares cring_simp, which solves equational
paulson@3002
   695
problems in commutative rings, using axiomatic type classes for + and *;
paulson@3002
   696
paulson@3002
   697
* more examples in HOL/MiniML and HOL/Auth;
paulson@3002
   698
paulson@3002
   699
* more default rewrite rules for quantifiers, union/intersection;
paulson@3002
   700
nipkow@3321
   701
* a new constant `arbitrary == @x.False';
nipkow@3321
   702
wenzelm@3107
   703
* HOLCF/IOA replaces old HOL/IOA;
wenzelm@3107
   704
wenzelm@5726
   705
* HOLCF changes: derived all rules and arities
wenzelm@5726
   706
  + axiomatic type classes instead of classes
slotosch@2653
   707
  + typedef instead of faking type definitions
paulson@2747
   708
  + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
wenzelm@2730
   709
  + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
slotosch@2653
   710
  + eliminated the types void, one, tr
slotosch@2653
   711
  + use unit lift and bool lift (with translations) instead of one and tr
slotosch@2653
   712
  + eliminated blift from Lift3.thy (use Def instead of blift)
wenzelm@3107
   713
  all eliminated rules are derived as theorems --> no visible changes ;
oheimb@2649
   714
wenzelm@3006
   715
paulson@3002
   716
*** ZF ***
wenzelm@2553
   717
paulson@2865
   718
* ZF now has Fast_tac, Simp_tac and Auto_tac.  Union_iff is a now a default
paulson@2865
   719
rewrite rule; this may affect some proofs.  eq_cs is gone but can be put back
paulson@2865
   720
as ZF_cs addSIs [equalityI];
wenzelm@2553
   721
wenzelm@2554
   722
wenzelm@2732
   723
wenzelm@2553
   724
New in Isabelle94-7 (November 96)
wenzelm@2553
   725
---------------------------------
wenzelm@2553
   726
wenzelm@2553
   727
* allowing negative levels (as offsets) in prlev and choplev;
wenzelm@2553
   728
wenzelm@2554
   729
* super-linear speedup for large simplifications;
wenzelm@2554
   730
wenzelm@2554
   731
* FOL, ZF and HOL now use miniscoping: rewriting pushes
wenzelm@2554
   732
quantifications in as far as possible (COULD MAKE EXISTING PROOFS
wenzelm@2554
   733
FAIL); can suppress it using the command Delsimps (ex_simps @
wenzelm@2554
   734
all_simps); De Morgan laws are also now included, by default;
wenzelm@2554
   735
wenzelm@2554
   736
* improved printing of ==>  :  ~:
wenzelm@2554
   737
wenzelm@2554
   738
* new object-logic "Sequents" adds linear logic, while replacing LK
wenzelm@2554
   739
and Modal (thanks to Sara Kalvala);
wenzelm@2554
   740
wenzelm@2554
   741
* HOL/Auth: correctness proofs for authentication protocols;
wenzelm@2554
   742
wenzelm@2554
   743
* HOL: new auto_tac combines rewriting and classical reasoning (many
wenzelm@2554
   744
examples on HOL/Auth);
wenzelm@2554
   745
wenzelm@2554
   746
* HOL: new command AddIffs for declaring theorems of the form P=Q to
wenzelm@2554
   747
the rewriter and classical reasoner simultaneously;
wenzelm@2554
   748
wenzelm@2554
   749
* function uresult no longer returns theorems in "standard" format;
wenzelm@2554
   750
regain previous version by: val uresult = standard o uresult;
wenzelm@2554
   751
wenzelm@2554
   752
wenzelm@2554
   753
wenzelm@2554
   754
New in Isabelle94-6
wenzelm@2554
   755
-------------------
wenzelm@2554
   756
wenzelm@2554
   757
* oracles -- these establish an interface between Isabelle and trusted
wenzelm@2554
   758
external reasoners, which may deliver results as theorems;
wenzelm@2554
   759
wenzelm@2554
   760
* proof objects (in particular record all uses of oracles);
wenzelm@2554
   761
wenzelm@2554
   762
* Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
wenzelm@2554
   763
wenzelm@2554
   764
* "constdefs" section in theory files;
wenzelm@2554
   765
wenzelm@2554
   766
* "primrec" section (HOL) no longer requires names;
wenzelm@2554
   767
wenzelm@2554
   768
* internal type "tactic" now simply "thm -> thm Sequence.seq";
wenzelm@2554
   769
wenzelm@2554
   770
wenzelm@2554
   771
wenzelm@2554
   772
New in Isabelle94-5
wenzelm@2554
   773
-------------------
wenzelm@2554
   774
wenzelm@2554
   775
* reduced space requirements;
wenzelm@2554
   776
wenzelm@2554
   777
* automatic HTML generation from theories;
wenzelm@2554
   778
wenzelm@2554
   779
* theory files no longer require "..." (quotes) around most types;
wenzelm@2554
   780
wenzelm@2554
   781
* new examples, including two proofs of the Church-Rosser theorem;
wenzelm@2554
   782
wenzelm@2554
   783
* non-curried (1994) version of HOL is no longer distributed;
wenzelm@2554
   784
wenzelm@2553
   785
paulson@2557
   786
paulson@2557
   787
New in Isabelle94-4
paulson@2557
   788
-------------------
paulson@2557
   789
paulson@2747
   790
* greatly reduced space requirements;
paulson@2557
   791
paulson@2557
   792
* theory files (.thy) no longer require \...\ escapes at line breaks;
paulson@2557
   793
wenzelm@5726
   794
* searchable theorem database (see the section "Retrieving theorems" on
paulson@2557
   795
page 8 of the Reference Manual);
paulson@2557
   796
paulson@2557
   797
* new examples, including Grabczewski's monumental case study of the
paulson@2557
   798
Axiom of Choice;
paulson@2557
   799
paulson@2557
   800
* The previous version of HOL renamed to Old_HOL;
paulson@2557
   801
wenzelm@5726
   802
* The new version of HOL (previously called CHOL) uses a curried syntax
paulson@2557
   803
for functions.  Application looks like f a b instead of f(a,b);
paulson@2557
   804
paulson@2557
   805
* Mutually recursive inductive definitions finally work in HOL;
paulson@2557
   806
paulson@2557
   807
* In ZF, pattern-matching on tuples is now available in all abstractions and
paulson@2557
   808
translates to the operator "split";
paulson@2557
   809
paulson@2557
   810
paulson@2557
   811
paulson@2557
   812
New in Isabelle94-3
paulson@2557
   813
-------------------
paulson@2557
   814
wenzelm@5726
   815
* new infix operator, addss, allowing the classical reasoner to
paulson@2557
   816
perform simplification at each step of its search.  Example:
wenzelm@5726
   817
        fast_tac (cs addss ss)
paulson@2557
   818
wenzelm@5726
   819
* a new logic, CHOL, the same as HOL, but with a curried syntax
wenzelm@5726
   820
for functions.  Application looks like f a b instead of f(a,b).  Also pairs
paulson@2557
   821
look like (a,b) instead of <a,b>;
paulson@2557
   822
paulson@2557
   823
* PLEASE NOTE: CHOL will eventually replace HOL!
paulson@2557
   824
paulson@2557
   825
* In CHOL, pattern-matching on tuples is now available in all abstractions.
paulson@2557
   826
It translates to the operator "split".  A new theory of integers is available;
paulson@2557
   827
paulson@2557
   828
* In ZF, integer numerals now denote two's-complement binary integers.
paulson@2557
   829
Arithmetic operations can be performed by rewriting.  See ZF/ex/Bin.ML;
paulson@2557
   830
wenzelm@5726
   831
* Many new examples: I/O automata, Church-Rosser theorem, equivalents
paulson@2557
   832
of the Axiom of Choice;
paulson@2557
   833
paulson@2557
   834
paulson@2557
   835
paulson@2557
   836
New in Isabelle94-2
paulson@2557
   837
-------------------
paulson@2557
   838
wenzelm@5726
   839
* Significantly faster resolution;
paulson@2557
   840
paulson@2557
   841
* the different sections in a .thy file can now be mixed and repeated
paulson@2557
   842
freely;
paulson@2557
   843
paulson@2557
   844
* Database of theorems for FOL, HOL and ZF.  New
paulson@2557
   845
commands including qed, qed_goal and bind_thm store theorems in the database.
paulson@2557
   846
paulson@2557
   847
* Simple database queries: return a named theorem (get_thm) or all theorems of
paulson@2557
   848
a given theory (thms_of), or find out what theory a theorem was proved in
paulson@2557
   849
(theory_of_thm);
paulson@2557
   850
paulson@2557
   851
* Bugs fixed in the inductive definition and datatype packages;
paulson@2557
   852
paulson@2557
   853
* The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
paulson@2557
   854
and HOL_dup_cs obsolete;
paulson@2557
   855
paulson@2557
   856
* Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
paulson@2557
   857
have been removed;
paulson@2557
   858
paulson@2557
   859
* Simpler definition of function space in ZF;
paulson@2557
   860
paulson@2557
   861
* new results about cardinal and ordinal arithmetic in ZF;
paulson@2557
   862
paulson@2557
   863
* 'subtype' facility in HOL for introducing new types as subsets of existing
paulson@2557
   864
types;
paulson@2557
   865
paulson@2557
   866
wenzelm@2553
   867
$Id$