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