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