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