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