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