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