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