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