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