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