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