NEWS
author nipkow
Thu Jan 14 14:29:52 1999 +0100 (1999-01-14)
changeset 6131 2d9e609abcdb
parent 6070 032babd0120b
child 6141 a6922171b396
permissions -rw-r--r--
More Arith.
wenzelm@5363
     1
Isabelle NEWS -- history user-relevant changes
wenzelm@5363
     2
==============================================
wenzelm@2553
     3
wenzelm@4981
     4
New in this Isabelle version
wenzelm@4981
     5
----------------------------
oheimb@4649
     6
paulson@5931
     7
*** Overview of INCOMPATIBILITIES (see below for more details) ***
paulson@5931
     8
paulson@5931
     9
* HOL: Removed the obsolete syntax "Compl A"; use -A for set complement
paulson@5931
    10
paulson@6064
    11
* ZF: The con_defs part of an inductive definition may no longer refer to 
paulson@6064
    12
  constants declared in the same theory;
nipkow@6057
    13
nipkow@6057
    14
paulson@6069
    15
*** Proof tools ***
paulson@6069
    16
paulson@6069
    17
* Provers/Arith/fast_lin_arith.ML contains a functor for creating a decision
paulson@6069
    18
procedure for linear arithmetic. Currently it is used for types `nat' and
paulson@6069
    19
`int' in HOL (see below) but can, should and will be instantiated for other
paulson@6069
    20
types and logics as well.
paulson@6069
    21
paulson@6069
    22
paulson@6014
    23
*** General ***
paulson@6014
    24
paulson@6014
    25
* in locales, the "assumes" and "defines" parts may be omitted if empty;
wenzelm@5973
    26
oheimb@6028
    27
* new print_mode "xsymbols" for extended symbol support 
oheimb@6028
    28
  (e.g. genuiely long arrows)
oheimb@6028
    29
nipkow@6057
    30
*** HOL ***
nipkow@6057
    31
nipkow@6063
    32
* There are now decision procedures for linear arithmetic over nat and int:
nipkow@6131
    33
nipkow@6131
    34
1. arith_tac copes with arbitrary formulae involving `=', `<', `<=', `+',
nipkow@6131
    35
`-', `Suc' and numerical constants; other subterms are treated as atomic;
nipkow@6131
    36
subformulae not involving type `nat' or `int' are ignored; quantified
nipkow@6131
    37
subformulae are ignored unless they are positive universal or negative
nipkow@6131
    38
existential. The tactic has to be invoked by hand and can be a little bit
nipkow@6131
    39
slow. In particular, the running time is exponential in the number of
nipkow@6131
    40
occurrences of `-' on `nat'.
nipkow@6131
    41
nipkow@6131
    42
2. fast_arith_tac is a cut-down version of arith_tac: it only takes (negated)
nipkow@6131
    43
(in)equalities among the premises and the conclusion into account (i.e. no
nipkow@6131
    44
compound formulae) and does not know about `-' on `nat'. It is fast and is
nipkow@6057
    45
used automatically by the simplifier.
nipkow@6131
    46
nipkow@6063
    47
NB: At the moment, these decision procedures do not cope with mixed nat/int
nipkow@6131
    48
formulae where the two parts interact, such as `m < n ==> int(m) < int(n)'.
oheimb@6028
    49
wenzelm@5973
    50
*** Internal programming interfaces ***
wenzelm@5781
    51
wenzelm@5781
    52
* tuned current_goals_markers semantics: begin / end goal avoids
wenzelm@5781
    53
printing empty lines;
wenzelm@5781
    54
wenzelm@5973
    55
* removed prs and prs_fn hook, which was broken because it did not
wenzelm@5973
    56
include \n in its semantics, forcing writeln to add one
wenzelm@5973
    57
uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
wenzelm@5973
    58
string -> unit if you really want to output text without newline;
wenzelm@5973
    59
wenzelm@5781
    60
paulson@6064
    61
*** ZF ***
paulson@6064
    62
paulson@6064
    63
* new primrec section allows primitive recursive functions to be given
paulson@6070
    64
  directly (as in HOL) over datatypes and the natural numbers;
paulson@6064
    65
paulson@6064
    66
* new tactics induct_tac and exhaust_tac for induction (or case analysis)
paulson@6070
    67
  over datatypes and the natural numbers;
paulson@6064
    68
paulson@6064
    69
* the datatype declaration of type T now defines the recursor T_rec;
paulson@6064
    70
paulson@6069
    71
* The syntax "if P then x else y" is now available in addition to if(P,x,y).
paulson@6069
    72
paulson@6064
    73
wenzelm@5781
    74
New in Isabelle98-1 (October 1998)
wenzelm@5781
    75
----------------------------------
wenzelm@5781
    76
wenzelm@5127
    77
*** Overview of INCOMPATIBILITIES (see below for more details) ***
wenzelm@4842
    78
wenzelm@5726
    79
* several changes of automated proof tools;
wenzelm@5373
    80
wenzelm@5726
    81
* HOL: major changes to the inductive and datatype packages, including
wenzelm@5726
    82
some minor incompatibilities of theory syntax;
berghofe@5214
    83
wenzelm@5726
    84
* HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
wenzelm@5217
    85
called `inj_on';
paulson@5160
    86
nipkow@5275
    87
* HOL: removed duplicate thms in Arith:
nipkow@5275
    88
  less_imp_add_less  should be replaced by  trans_less_add1
nipkow@5275
    89
  le_imp_add_le      should be replaced by  trans_le_add1
paulson@5160
    90
wenzelm@5726
    91
* HOL: unary minus is now overloaded (new type constraints may be
wenzelm@5726
    92
required);
paulson@5490
    93
wenzelm@5726
    94
* HOL and ZF: unary minus for integers is now #- instead of #~.  In
wenzelm@5726
    95
ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
wenzelm@5726
    96
now taken as an integer constant.
paulson@5541
    97
wenzelm@5726
    98
* Pure: ML function 'theory_of' renamed to 'theory';
wenzelm@5397
    99
wenzelm@5363
   100
wenzelm@5127
   101
*** Proof tools ***
nipkow@4880
   102
nipkow@5657
   103
* Simplifier:
nipkow@5657
   104
  1. Asm_full_simp_tac is now more aggressive.
nipkow@5657
   105
     1. It will sometimes reorient premises if that increases their power to
nipkow@5657
   106
        simplify.
nipkow@5657
   107
     2. It does no longer proceed strictly from left to right but may also
nipkow@5657
   108
        rotate premises to achieve further simplification.
nipkow@5657
   109
     For compatibility reasons there is now Asm_lr_simp_tac which is like the
nipkow@5657
   110
     old Asm_full_simp_tac in that it does not rotate premises.
nipkow@5657
   111
  2. The simplifier now knows a little bit about nat-arithmetic.
nipkow@4880
   112
wenzelm@5127
   113
* Classical reasoner: wrapper mechanism for the classical reasoner now
wenzelm@5127
   114
allows for selected deletion of wrappers, by introduction of names for
wenzelm@5127
   115
wrapper functionals.  This implies that addbefore, addSbefore,
wenzelm@5127
   116
addaltern, and addSaltern now take a pair (name, tactic) as argument,
wenzelm@5127
   117
and that adding two tactics with the same name overwrites the first
wenzelm@5127
   118
one (emitting a warning).
oheimb@4824
   119
  type wrapper = (int -> tactic) -> (int -> tactic)
oheimb@4649
   120
  setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
oheimb@4824
   121
  addWrapper, addSWrapper: claset * (string * wrapper) -> claset
oheimb@4824
   122
  delWrapper, delSWrapper: claset *  string            -> claset
oheimb@4649
   123
  getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
oheimb@4649
   124
wenzelm@5705
   125
* Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
wenzelm@5726
   126
semantics; addbefore now affects only the unsafe part of step_tac
wenzelm@5726
   127
etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
wenzelm@5726
   128
FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
wenzelm@5726
   129
by Force_tac;
oheimb@5524
   130
wenzelm@5726
   131
* Classical reasoner: setwrapper to setWrapper and compwrapper to
wenzelm@5726
   132
compWrapper; added safe wrapper (and access functions for it);
oheimb@5524
   133
wenzelm@5127
   134
* HOL/split_all_tac is now much faster and fails if there is nothing
wenzelm@5726
   135
to split.  Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
wenzelm@5726
   136
and the names of the automatically generated variables have changed.
wenzelm@5726
   137
split_all_tac has moved within claset() from unsafe wrappers to safe
wenzelm@5726
   138
wrappers, which means that !!-bound variables are split much more
wenzelm@5726
   139
aggressively, and safe_tac and clarify_tac now split such variables.
wenzelm@5726
   140
If this splitting is not appropriate, use delSWrapper "split_all_tac".
wenzelm@5726
   141
Note: the same holds for record_split_tac, which does the job of
wenzelm@5726
   142
split_all_tac for record fields.
wenzelm@5127
   143
wenzelm@5726
   144
* HOL/Simplifier: Rewrite rules for case distinctions can now be added
wenzelm@5726
   145
permanently to the default simpset using Addsplits just like
wenzelm@5726
   146
Addsimps. They can be removed via Delsplits just like
wenzelm@5726
   147
Delsimps. Lower-case versions are also available.
wenzelm@5127
   148
wenzelm@5726
   149
* HOL/Simplifier: The rule split_if is now part of the default
wenzelm@5726
   150
simpset. This means that the simplifier will eliminate all occurrences
wenzelm@5726
   151
of if-then-else in the conclusion of a goal. To prevent this, you can
wenzelm@5726
   152
either remove split_if completely from the default simpset by
wenzelm@5726
   153
`Delsplits [split_if]' or remove it in a specific call of the
wenzelm@5726
   154
simplifier using `... delsplits [split_if]'.  You can also add/delete
wenzelm@5726
   155
other case splitting rules to/from the default simpset: every datatype
wenzelm@5726
   156
generates suitable rules `split_t_case' and `split_t_case_asm' (where
wenzelm@5726
   157
t is the name of the datatype).
wenzelm@5127
   158
wenzelm@5726
   159
* Classical reasoner / Simplifier combination: new force_tac (and
wenzelm@5127
   160
derivatives Force_tac, force) combines rewriting and classical
wenzelm@5127
   161
reasoning (and whatever other tools) similarly to auto_tac, but is
wenzelm@5726
   162
aimed to solve the given subgoal completely.
wenzelm@5127
   163
wenzelm@5127
   164
wenzelm@5127
   165
*** General ***
wenzelm@5127
   166
wenzelm@5217
   167
* new top-level commands `Goal' and `Goalw' that improve upon `goal'
wenzelm@5127
   168
and `goalw': the theory is no longer needed as an explicit argument -
wenzelm@5127
   169
the current theory context is used; assumptions are no longer returned
wenzelm@5127
   170
at the ML-level unless one of them starts with ==> or !!; it is
wenzelm@5217
   171
recommended to convert to these new commands using isatool fixgoal
wenzelm@5217
   172
(backup your sources first!);
wenzelm@4842
   173
wenzelm@5217
   174
* new top-level commands 'thm' and 'thms' for retrieving theorems from
wenzelm@5207
   175
the current theory context, and 'theory' to lookup stored theories;
paulson@4806
   176
paulson@5722
   177
* new theory section 'locale' for declaring constants, assumptions and
paulson@5722
   178
definitions that have local scope;
paulson@5722
   179
wenzelm@5127
   180
* new theory section 'nonterminals' for purely syntactic types;
wenzelm@4858
   181
wenzelm@5127
   182
* new theory section 'setup' for generic ML setup functions
wenzelm@5127
   183
(e.g. package initialization);
wenzelm@4869
   184
wenzelm@5131
   185
* the distribution now includes Isabelle icons: see
wenzelm@5131
   186
lib/logo/isabelle-{small,tiny}.xpm;
wenzelm@5131
   187
wenzelm@5363
   188
* isatool install - install binaries with absolute references to
wenzelm@5363
   189
ISABELLE_HOME/bin;
wenzelm@5363
   190
wenzelm@5572
   191
* isatool logo -- create instances of the Isabelle logo (as EPS);
wenzelm@5572
   192
wenzelm@5407
   193
* print mode 'emacs' reserved for Isamode;
wenzelm@5407
   194
wenzelm@5726
   195
* support multiple print (ast) translations per constant name;
wenzelm@5726
   196
wenzelm@4711
   197
paulson@4661
   198
*** HOL ***
paulson@4661
   199
wenzelm@5710
   200
* there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
nipkow@5709
   201
wenzelm@5217
   202
* HOL/inductive package reorganized and improved: now supports mutual
paulson@5267
   203
definitions such as
wenzelm@5217
   204
wenzelm@5217
   205
  inductive EVEN ODD
wenzelm@5217
   206
    intrs
wenzelm@5217
   207
      null "0 : EVEN"
wenzelm@5217
   208
      oddI "n : EVEN ==> Suc n : ODD"
wenzelm@5217
   209
      evenI "n : ODD ==> Suc n : EVEN"
wenzelm@5217
   210
wenzelm@5217
   211
new theorem list "elims" contains an elimination rule for each of the
wenzelm@5217
   212
recursive sets; inductive definitions now handle disjunctive premises
wenzelm@5217
   213
correctly (also ZF);
berghofe@5214
   214
wenzelm@5217
   215
INCOMPATIBILITIES: requires Inductive as an ancestor; component
wenzelm@5217
   216
"mutual_induct" no longer exists - the induction rule is always
wenzelm@5217
   217
contained in "induct";
wenzelm@5217
   218
wenzelm@5217
   219
wenzelm@5217
   220
* HOL/datatype package re-implemented and greatly improved: now
paulson@5267
   221
supports mutually recursive datatypes such as
wenzelm@5217
   222
wenzelm@5217
   223
  datatype
wenzelm@5217
   224
    'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
wenzelm@5217
   225
            | SUM ('a aexp) ('a aexp)
wenzelm@5217
   226
            | DIFF ('a aexp) ('a aexp)
wenzelm@5217
   227
            | NUM 'a
wenzelm@5217
   228
  and
wenzelm@5217
   229
    'a bexp = LESS ('a aexp) ('a aexp)
wenzelm@5217
   230
            | AND ('a bexp) ('a bexp)
wenzelm@5217
   231
            | OR ('a bexp) ('a bexp)
wenzelm@5217
   232
paulson@5267
   233
as well as indirectly recursive datatypes such as
berghofe@5214
   234
wenzelm@5217
   235
  datatype
wenzelm@5217
   236
    ('a, 'b) term = Var 'a
wenzelm@5217
   237
                  | App 'b ((('a, 'b) term) list)
berghofe@5214
   238
wenzelm@5217
   239
The new tactic  mutual_induct_tac [<var_1>, ..., <var_n>] i  performs
wenzelm@5217
   240
induction on mutually / indirectly recursive datatypes.
wenzelm@5217
   241
wenzelm@5217
   242
Primrec equations are now stored in theory and can be accessed via
wenzelm@5217
   243
<function_name>.simps.
wenzelm@5217
   244
wenzelm@5217
   245
INCOMPATIBILITIES:
berghofe@5214
   246
wenzelm@5217
   247
  - Theories using datatypes must now have theory Datatype as an
wenzelm@5217
   248
    ancestor.
wenzelm@5217
   249
  - The specific <typename>.induct_tac no longer exists - use the
wenzelm@5217
   250
    generic induct_tac instead.
berghofe@5226
   251
  - natE has been renamed to nat.exhaust - use exhaust_tac
wenzelm@5217
   252
    instead of res_inst_tac ... natE. Note that the variable
berghofe@5226
   253
    names in nat.exhaust differ from the names in natE, this
wenzelm@5217
   254
    may cause some "fragile" proofs to fail.
wenzelm@5217
   255
  - The theorems split_<typename>_case and split_<typename>_case_asm
wenzelm@5217
   256
    have been renamed to <typename>.split and <typename>.split_asm.
wenzelm@5217
   257
  - Since default sorts of type variables are now handled correctly,
wenzelm@5217
   258
    some datatype definitions may have to be annotated with explicit
wenzelm@5217
   259
    sort constraints.
wenzelm@5217
   260
  - Primrec definitions no longer require function name and type
wenzelm@5217
   261
    of recursive argument.
berghofe@5214
   262
wenzelm@5217
   263
Consider using isatool fixdatatype to adapt your theories and proof
wenzelm@5217
   264
scripts to the new package (backup your sources first!).
wenzelm@5217
   265
wenzelm@5217
   266
wenzelm@5726
   267
* HOL/record package: considerably improved implementation; now
wenzelm@5726
   268
includes concrete syntax for record types, terms, updates; theorems
wenzelm@5726
   269
for surjective pairing and splitting !!-bound record variables; proof
wenzelm@5726
   270
support is as follows:
wenzelm@5726
   271
wenzelm@5726
   272
  1) standard conversions (selectors or updates applied to record
wenzelm@5726
   273
constructor terms) are part of the standard simpset;
wenzelm@5726
   274
wenzelm@5726
   275
  2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
wenzelm@5726
   276
made part of standard simpset and claset via addIffs;
wenzelm@5726
   277
wenzelm@5726
   278
  3) a tactic for record field splitting (record_split_tac) is part of
wenzelm@5726
   279
the standard claset (addSWrapper);
wenzelm@5726
   280
wenzelm@5726
   281
To get a better idea about these rules you may retrieve them via
wenzelm@5726
   282
something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
wenzelm@5726
   283
the name of your record type.
wenzelm@5726
   284
wenzelm@5726
   285
The split tactic 3) conceptually simplifies by the following rule:
wenzelm@5726
   286
wenzelm@5726
   287
  "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
wenzelm@5726
   288
wenzelm@5726
   289
Thus any record variable that is bound by meta-all will automatically
wenzelm@5726
   290
blow up into some record constructor term, consequently the
wenzelm@5726
   291
simplifications of 1), 2) apply.  Thus force_tac, auto_tac etc. shall
wenzelm@5726
   292
solve record problems automatically.
wenzelm@5726
   293
berghofe@5214
   294
wenzelm@5125
   295
* reorganized the main HOL image: HOL/Integ and String loaded by
wenzelm@5125
   296
default; theory Main includes everything;
wenzelm@5125
   297
paulson@5650
   298
* automatic simplification of integer sums and comparisons, using cancellation;
paulson@5650
   299
oheimb@5526
   300
* added option_map_eq_Some and not_Some_eq to the default simpset and claset;
wenzelm@5127
   301
wenzelm@5127
   302
* added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
wenzelm@5127
   303
wenzelm@5127
   304
* many new identities for unions, intersections, set difference, etc.;
wenzelm@5127
   305
wenzelm@5127
   306
* expand_if, expand_split, expand_sum_case and expand_nat_case are now
wenzelm@5127
   307
called split_if, split_split, split_sum_case and split_nat_case (to go
wenzelm@5127
   308
with add/delsplits);
wenzelm@5125
   309
wenzelm@5127
   310
* HOL/Prod introduces simplification procedure unit_eq_proc rewriting
wenzelm@5127
   311
(?x::unit) = (); this is made part of the default simpset, which COULD
wenzelm@5127
   312
MAKE EXISTING PROOFS FAIL under rare circumstances (consider
wenzelm@5207
   313
'Delsimprocs [unit_eq_proc];' as last resort); also note that
wenzelm@5207
   314
unit_abs_eta_conv is added in order to counter the effect of
wenzelm@5207
   315
unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
wenzelm@5207
   316
%u.f();
wenzelm@5125
   317
wenzelm@5217
   318
* HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
wenzelm@5217
   319
makes more sense);
berghofe@5109
   320
paulson@5475
   321
* HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
paulson@5475
   322
  It and 'sym RS equals0D' are now in the default  claset, giving automatic
paulson@5475
   323
  disjointness reasoning but breaking a few old proofs.
paulson@5267
   324
wenzelm@5217
   325
* HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
wenzelm@5217
   326
to 'converse' from 'inverse' (for compatibility with ZF and some
wenzelm@5217
   327
literature);
wenzelm@5085
   328
wenzelm@5127
   329
* HOL/recdef can now declare non-recursive functions, with {} supplied as
wenzelm@5127
   330
the well-founded relation;
oheimb@4838
   331
paulson@5490
   332
* HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
paulson@5490
   333
    Compl A.  The "Compl" syntax remains available as input syntax for this
paulson@5490
   334
    release ONLY.
paulson@5490
   335
wenzelm@5127
   336
* HOL/Update: new theory of function updates:
wenzelm@5127
   337
    f(a:=b) == %x. if x=a then b else f x
wenzelm@5127
   338
may also be iterated as in f(a:=b,c:=d,...);
nipkow@5077
   339
wenzelm@5127
   340
* HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
paulson@4899
   341
nipkow@5282
   342
* HOL/List:
nipkow@5282
   343
  - new function list_update written xs[i:=v] that updates the i-th
nipkow@5282
   344
    list position. May also be iterated as in xs[i:=a,j:=b,...].
nipkow@5428
   345
  - new function `upt' written [i..j(] which generates the list
nipkow@5428
   346
    [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
nipkow@5428
   347
    bound write [i..j], which is a shorthand for [i..j+1(].
nipkow@5282
   348
  - new lexicographic orderings and corresponding wellfoundedness theorems.
paulson@4779
   349
wenzelm@5127
   350
* HOL/Arith:
wenzelm@5127
   351
  - removed 'pred' (predecessor) function;
wenzelm@5127
   352
  - generalized some theorems about n-1;
wenzelm@5127
   353
  - many new laws about "div" and "mod";
wenzelm@5127
   354
  - new laws about greatest common divisors (see theory ex/Primes);
oheimb@4766
   355
wenzelm@5127
   356
* HOL/Relation: renamed the relational operator r^-1 "converse"
wenzelm@4842
   357
instead of "inverse";
wenzelm@4711
   358
nipkow@5651
   359
* HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
nipkow@5651
   360
  of the multiset ordering;
nipkow@5651
   361
wenzelm@5127
   362
* directory HOL/Real: a construction of the reals using Dedekind cuts
nipkow@5651
   363
  (not included by default);
nipkow@4835
   364
wenzelm@5127
   365
* directory HOL/UNITY: Chandy and Misra's UNITY formalism;
wenzelm@4711
   366
nipkow@5651
   367
* directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
nipkow@5651
   368
  programs, i.e. different program variables may have different types.
nipkow@5651
   369
paulson@5142
   370
* calling (stac rew i) now fails if "rew" has no effect on the goal
paulson@5142
   371
  [previously, this check worked only if the rewrite rule was unconditional]
paulson@5308
   372
  Now rew can involve either definitions or equalities (either == or =).
wenzelm@5002
   373
wenzelm@5363
   374
paulson@4879
   375
*** ZF ***
paulson@4879
   376
paulson@5332
   377
* theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
paulson@5332
   378
  only the theorems proved on ZF.ML;
paulson@5160
   379
paulson@5475
   380
* ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
paulson@5475
   381
  It and 'sym RS equals0D' are now in the default  claset, giving automatic
paulson@5475
   382
  disjointness reasoning but breaking a few old proofs.
paulson@5267
   383
paulson@5160
   384
* ZF/Update: new theory of function updates
paulson@5160
   385
    with default rewrite rule  f(x:=y) ` z = if(z=x, y, f`z)
paulson@5160
   386
  may also be iterated as in f(a:=b,c:=d,...);
paulson@5160
   387
paulson@4879
   388
* in  let x=t in u(x), neither t nor u(x) has to be an FOL term.
oheimb@4649
   389
paulson@5142
   390
* calling (stac rew i) now fails if "rew" has no effect on the goal
paulson@5142
   391
  [previously, this check worked only if the rewrite rule was unconditional]
paulson@5308
   392
  Now rew can involve either definitions or equalities (either == or =).
paulson@5142
   393
paulson@5160
   394
* case_tac provided for compatibility with HOL
paulson@5160
   395
    (like the old excluded_middle_tac, but with subgoals swapped)
paulson@5160
   396
wenzelm@4842
   397
wenzelm@5127
   398
*** Internal programming interfaces ***
wenzelm@5002
   399
wenzelm@5251
   400
* Pure: several new basic modules made available for general use, see
wenzelm@5251
   401
also src/Pure/README;
wenzelm@5207
   402
wenzelm@5008
   403
* improved the theory data mechanism to support encapsulation (data
wenzelm@5008
   404
kind name replaced by private Object.kind, acting as authorization
wenzelm@5373
   405
key); new type-safe user interface via functor TheoryDataFun; generic
wenzelm@5373
   406
print_data function becomes basically useless;
wenzelm@5002
   407
wenzelm@5251
   408
* removed global_names compatibility flag -- all theory declarations
wenzelm@5251
   409
are qualified by default;
wenzelm@5251
   410
wenzelm@5085
   411
* module Pure/Syntax now offers quote / antiquote translation
wenzelm@5085
   412
functions (useful for Hoare logic etc. with implicit dependencies);
wenzelm@5373
   413
see HOL/ex/Antiquote for an example use;
wenzelm@5085
   414
wenzelm@5127
   415
* Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
wenzelm@5127
   416
cterm -> thm;
wenzelm@5127
   417
wenzelm@5207
   418
* new tactical CHANGED_GOAL for checking that a tactic modifies a
wenzelm@5207
   419
subgoal;
paulson@5142
   420
wenzelm@5251
   421
* Display.print_goals function moved to Locale.print_goals;
wenzelm@5251
   422
wenzelm@5731
   423
* standard print function for goals supports current_goals_markers
wenzelm@5731
   424
variable for marking begin of proof, end of proof, start of goal; the
wenzelm@5731
   425
default is ("", "", ""); setting current_goals_markers := ("<proof>",
wenzelm@5731
   426
"</proof>", "<goal>") causes SGML like tagged proof state printing,
wenzelm@5731
   427
for example;
wenzelm@5731
   428
wenzelm@5002
   429
wenzelm@5002
   430
wenzelm@4410
   431
New in Isabelle98 (January 1998)
wenzelm@4410
   432
--------------------------------
wenzelm@4410
   433
wenzelm@4410
   434
*** Overview of INCOMPATIBILITIES (see below for more details) ***
wenzelm@4410
   435
wenzelm@4410
   436
* changed lexical syntax of terms / types: dots made part of long
wenzelm@4410
   437
identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
wenzelm@4410
   438
wenzelm@4410
   439
* simpset (and claset) reference variable replaced by functions
wenzelm@4410
   440
simpset / simpset_ref;
wenzelm@4410
   441
wenzelm@4410
   442
* no longer supports theory aliases (via merge) and non-trivial
wenzelm@4410
   443
implicit merge of thms' signatures;
wenzelm@4410
   444
wenzelm@4410
   445
* most internal names of constants changed due to qualified names;
wenzelm@4410
   446
wenzelm@4410
   447
* changed Pure/Sequence interface (see Pure/seq.ML);
wenzelm@4410
   448
wenzelm@3454
   449
paulson@3715
   450
*** General Changes ***
paulson@3715
   451
wenzelm@4174
   452
* hierachically structured name spaces (for consts, types, axms, thms
wenzelm@3943
   453
etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
wenzelm@4108
   454
old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
wenzelm@4108
   455
isatool fixdots ensures space after dots (e.g. "%x. x"); set
wenzelm@4174
   456
long_names for fully qualified output names; NOTE: ML programs
wenzelm@4174
   457
(special tactics, packages etc.) referring to internal names may have
wenzelm@4174
   458
to be adapted to cope with fully qualified names; in case of severe
wenzelm@4174
   459
backward campatibility problems try setting 'global_names' at compile
wenzelm@4174
   460
time to have enrything declared within a flat name space; one may also
wenzelm@4174
   461
fine tune name declarations in theories via the 'global' and 'local'
wenzelm@4174
   462
section;
wenzelm@4108
   463
wenzelm@4108
   464
* reimplemented the implicit simpset and claset using the new anytype
wenzelm@4108
   465
data filed in signatures; references simpset:simpset ref etc. are
wenzelm@4108
   466
replaced by functions simpset:unit->simpset and
wenzelm@4108
   467
simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
wenzelm@4108
   468
to patch your ML files accordingly;
paulson@3856
   469
wenzelm@3857
   470
* HTML output now includes theory graph data for display with Java
wenzelm@3857
   471
applet or isatool browser; data generated automatically via isatool
wenzelm@3901
   472
usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
wenzelm@3857
   473
paulson@3856
   474
* defs may now be conditional; improved rewrite_goals_tac to handle
paulson@3856
   475
conditional equations;
paulson@3856
   476
wenzelm@4174
   477
* defs now admits additional type arguments, using TYPE('a) syntax;
wenzelm@4174
   478
wenzelm@3901
   479
* theory aliases via merge (e.g. M=A+B+C) no longer supported, always
wenzelm@3901
   480
creates a new theory node; implicit merge of thms' signatures is
wenzelm@4112
   481
restricted to 'trivial' ones; COMPATIBILITY: one may have to use
wenzelm@3901
   482
transfer:theory->thm->thm in (rare) cases;
wenzelm@3901
   483
wenzelm@3968
   484
* improved handling of draft signatures / theories; draft thms (and
wenzelm@3968
   485
ctyps, cterms) are automatically promoted to real ones;
wenzelm@3968
   486
wenzelm@3901
   487
* slightly changed interfaces for oracles: admit many per theory, named
wenzelm@3901
   488
(e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
wenzelm@3901
   489
wenzelm@3901
   490
* print_goals: optional output of const types (set show_consts and
wenzelm@3901
   491
show_types);
wenzelm@3851
   492
wenzelm@4388
   493
* improved output of warnings (###) and errors (***);
wenzelm@3697
   494
paulson@4178
   495
* subgoal_tac displays a warning if the new subgoal has type variables;
paulson@4178
   496
paulson@3715
   497
* removed old README and Makefiles;
wenzelm@3697
   498
paulson@3856
   499
* replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
wenzelm@3670
   500
paulson@3715
   501
* removed obsolete init_pps and init_database;
paulson@3715
   502
paulson@3715
   503
* deleted the obsolete tactical STATE, which was declared by
paulson@3715
   504
    fun STATE tacfun st = tacfun st st;
paulson@3715
   505
wenzelm@4388
   506
* cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
wenzelm@4388
   507
(which abbreviates $HOME);
wenzelm@4269
   508
wenzelm@4269
   509
* changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
wenzelm@4269
   510
use isatool fixseq to adapt your ML programs (this works for fully
wenzelm@4269
   511
qualified references to the Sequence structure only!);
wenzelm@4269
   512
wenzelm@4381
   513
* use_thy no longer requires writable current directory; it always
wenzelm@4381
   514
reloads .ML *and* .thy file, if either one is out of date;
wenzelm@4269
   515
paulson@3715
   516
paulson@3715
   517
*** Classical Reasoner ***
paulson@3715
   518
wenzelm@3744
   519
* Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
wenzelm@3744
   520
tactics that use classical reasoning to simplify a subgoal without
wenzelm@3744
   521
splitting it into several subgoals;
paulson@3715
   522
paulson@3719
   523
* Safe_tac: like safe_tac but uses the default claset;
paulson@3719
   524
paulson@3715
   525
paulson@3715
   526
*** Simplifier ***
paulson@3715
   527
paulson@3715
   528
* added simplification meta rules:
paulson@3715
   529
    (asm_)(full_)simplify: simpset -> thm -> thm;
paulson@3715
   530
paulson@3715
   531
* simplifier.ML no longer part of Pure -- has to be loaded by object
paulson@3715
   532
logics (again);
paulson@3715
   533
paulson@3715
   534
* added prems argument to simplification procedures;
paulson@3715
   535
paulson@4325
   536
* HOL, FOL, ZF: added infix function `addsplits':
paulson@4325
   537
  instead of `<simpset> setloop (split_tac <thms>)'
paulson@4325
   538
  you can simply write `<simpset> addsplits <thms>'
paulson@4325
   539
paulson@3715
   540
paulson@3715
   541
*** Syntax ***
paulson@3715
   542
wenzelm@4174
   543
* TYPE('a) syntax for type reflection terms;
wenzelm@4174
   544
wenzelm@3985
   545
* no longer handles consts with name "" -- declare as 'syntax' instead;
paulson@3856
   546
paulson@3856
   547
* pretty printer: changed order of mixfix annotation preference (again!);
wenzelm@3846
   548
paulson@3715
   549
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
paulson@3715
   550
paulson@3715
   551
paulson@3715
   552
*** HOL ***
paulson@3715
   553
wenzelm@5726
   554
* HOL: there is a new splitter `split_asm_tac' that can be used e.g.
oheimb@4189
   555
  with `addloop' of the simplifier to faciliate case splitting in premises.
oheimb@4189
   556
nipkow@4035
   557
* HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
wenzelm@3985
   558
wenzelm@3985
   559
* HOL/Auth: new protocol proofs including some for the Internet
nipkow@4035
   560
  protocol TLS;
wenzelm@3985
   561
wenzelm@4125
   562
* HOL/Map: new theory of `maps' a la VDM;
nipkow@3982
   563
wenzelm@4335
   564
* HOL/simplifier: simplification procedures nat_cancel_sums for
wenzelm@4335
   565
cancelling out common nat summands from =, <, <= (in)equalities, or
wenzelm@4335
   566
differences; simplification procedures nat_cancel_factor for
wenzelm@4335
   567
cancelling common factor from =, <, <= (in)equalities over natural
wenzelm@4373
   568
sums; nat_cancel contains both kinds of procedures, it is installed by
wenzelm@4373
   569
default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
wenzelm@4335
   570
nipkow@3580
   571
* HOL/simplifier: terms of the form
paulson@4325
   572
  `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)'  (or t=x)
nipkow@3580
   573
  are rewritten to
nipkow@4035
   574
  `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
nipkow@4035
   575
  and those of the form
paulson@4325
   576
  `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)'  (or t=x)
nipkow@4035
   577
  are rewritten to
nipkow@4035
   578
  `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
nipkow@4035
   579
nipkow@4035
   580
* HOL/datatype
nipkow@4035
   581
  Each datatype `t' now comes with a theorem `split_t_case' of the form
nipkow@3580
   582
nipkow@4035
   583
  P(t_case f1 ... fn x) =
nipkow@4035
   584
     ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
nipkow@4035
   585
        ...
oheimb@4189
   586
       (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
nipkow@4035
   587
     )
nipkow@4035
   588
oheimb@4930
   589
  and a theorem `split_t_case_asm' of the form
oheimb@4189
   590
oheimb@4189
   591
  P(t_case f1 ... fn x) =
oheimb@4189
   592
    ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
oheimb@4189
   593
        ...
oheimb@4189
   594
       (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
oheimb@4189
   595
     )
oheimb@4930
   596
  which can be added to a simpset via `addsplits'. The existing theorems
oheimb@4930
   597
  expand_list_case and expand_option_case have been renamed to
oheimb@4930
   598
  split_list_case and split_option_case.
oheimb@4189
   599
nipkow@4361
   600
* HOL/Arithmetic:
nipkow@4361
   601
  - `pred n' is automatically converted to `n-1'.
nipkow@4361
   602
    Users are strongly encouraged not to use `pred' any longer,
nipkow@4361
   603
    because it will disappear altogether at some point.
nipkow@4361
   604
  - Users are strongly encouraged to write "0 < n" rather than
nipkow@4361
   605
    "n ~= 0". Theorems and proof tools have been modified towards this
nipkow@4361
   606
    `standard'.
nipkow@4357
   607
nipkow@4502
   608
* HOL/Lists:
nipkow@4502
   609
  the function "set_of_list" has been renamed "set" (and its theorems too);
nipkow@4502
   610
  the function "nth" now takes its arguments in the reverse order and
nipkow@4502
   611
  has acquired the infix notation "!" as in "xs!n".
paulson@3570
   612
paulson@4154
   613
* HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
paulson@4154
   614
paulson@4154
   615
* HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
paulson@4154
   616
  specialist theorems (like UN1_I) are gone.  Similarly for (INT x.B x);
paulson@4154
   617
wenzelm@4575
   618
* HOL/record: extensible records with schematic structural subtyping
wenzelm@4575
   619
(single inheritance); EXPERIMENTAL version demonstrating the encoding,
wenzelm@4575
   620
still lacks various theorems and concrete record syntax;
wenzelm@4575
   621
wenzelm@4125
   622
paulson@3715
   623
*** HOLCF ***
wenzelm@3535
   624
wenzelm@4125
   625
* removed "axioms" and "generated by" sections;
wenzelm@4125
   626
oheimb@4123
   627
* replaced "ops" section by extended "consts" section, which is capable of
wenzelm@4125
   628
  handling the continuous function space "->" directly;
wenzelm@4125
   629
wenzelm@4125
   630
* domain package:
wenzelm@4125
   631
  . proves theorems immediately and stores them in the theory,
wenzelm@4125
   632
  . creates hierachical name space,
wenzelm@4125
   633
  . now uses normal mixfix annotations (instead of cinfix...),
wenzelm@4125
   634
  . minor changes to some names and values (for consistency),
wenzelm@4125
   635
  . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
wenzelm@4125
   636
  . separator between mutual domain defs: changed "," to "and",
wenzelm@4125
   637
  . improved handling of sort constraints;  now they have to
wenzelm@4125
   638
    appear on the left-hand side of the equations only;
oheimb@4123
   639
oheimb@4123
   640
* fixed LAM <x,y,zs>.b syntax;
wenzelm@3567
   641
wenzelm@3744
   642
* added extended adm_tac to simplifier in HOLCF -- can now discharge
wenzelm@3744
   643
adm (%x. P (t x)), where P is chainfinite and t continuous;
wenzelm@3579
   644
wenzelm@3579
   645
paulson@3719
   646
*** FOL and ZF ***
paulson@3719
   647
wenzelm@5726
   648
* FOL: there is a new splitter `split_asm_tac' that can be used e.g.
oheimb@4189
   649
  with `addloop' of the simplifier to faciliate case splitting in premises.
oheimb@4189
   650
wenzelm@3744
   651
* qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
wenzelm@3744
   652
in HOL, they strip ALL and --> from proved theorems;
wenzelm@3744
   653
paulson@3719
   654
wenzelm@3579
   655
wenzelm@3006
   656
New in Isabelle94-8 (May 1997)
wenzelm@3006
   657
------------------------------
wenzelm@2654
   658
paulson@3002
   659
*** General Changes ***
paulson@3002
   660
paulson@3002
   661
* new utilities to build / run / maintain Isabelle etc. (in parts
paulson@3002
   662
still somewhat experimental); old Makefiles etc. still functional;
wenzelm@2971
   663
wenzelm@3205
   664
* new 'Isabelle System Manual';
wenzelm@3205
   665
wenzelm@2825
   666
* INSTALL text, together with ./configure and ./build scripts;
wenzelm@2773
   667
wenzelm@3006
   668
* reimplemented type inference for greater efficiency, better error
wenzelm@3006
   669
messages and clean internal interface;
paulson@3002
   670
paulson@3002
   671
* prlim command for dealing with lots of subgoals (an easier way of
paulson@3002
   672
setting goals_limit);
paulson@3002
   673
wenzelm@3006
   674
wenzelm@3006
   675
*** Syntax ***
paulson@3002
   676
wenzelm@3116
   677
* supports alternative (named) syntax tables (parser and pretty
wenzelm@3116
   678
printer); internal interface is provided by add_modesyntax(_i);
wenzelm@3116
   679
paulson@3002
   680
* Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
paulson@3002
   681
be used in conjunction with the Isabelle symbol font; uses the
paulson@3002
   682
"symbols" syntax table;
paulson@3002
   683
wenzelm@2705
   684
* added token_translation interface (may translate name tokens in
wenzelm@2756
   685
arbitrary ways, dependent on their type (free, bound, tfree, ...) and
wenzelm@3116
   686
the current print_mode); IMPORTANT: user print translation functions
wenzelm@3116
   687
are responsible for marking newly introduced bounds
wenzelm@3116
   688
(Syntax.mark_boundT);
wenzelm@2705
   689
wenzelm@2730
   690
* token translations for modes "xterm" and "xterm_color" that display
wenzelm@3006
   691
names in bold, underline etc. or colors (which requires a color
wenzelm@3006
   692
version of xterm);
wenzelm@2730
   693
paulson@3002
   694
* infixes may now be declared with names independent of their syntax;
paulson@3002
   695
paulson@3002
   696
* added typed_print_translation (like print_translation, but may
paulson@3002
   697
access type of constant);
paulson@3002
   698
wenzelm@3006
   699
paulson@3002
   700
*** Classical Reasoner ***
paulson@3002
   701
paulson@3002
   702
Blast_tac: a new tactic!  It is often more powerful than fast_tac, but has
paulson@3002
   703
some limitations.  Blast_tac...
paulson@3002
   704
  + ignores addss, addbefore, addafter; this restriction is intrinsic
paulson@3002
   705
  + ignores elimination rules that don't have the correct format
wenzelm@5726
   706
        (the conclusion MUST be a formula variable)
paulson@3002
   707
  + ignores types, which can make HOL proofs fail
paulson@3002
   708
  + rules must not require higher-order unification, e.g. apply_type in ZF
paulson@3002
   709
    [message "Function Var's argument not a bound variable" relates to this]
paulson@3002
   710
  + its proof strategy is more general but can actually be slower
paulson@3002
   711
wenzelm@3107
   712
* substitution with equality assumptions no longer permutes other
wenzelm@3107
   713
assumptions;
paulson@3002
   714
paulson@3002
   715
* minor changes in semantics of addafter (now called addaltern); renamed
paulson@3002
   716
setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
wenzelm@3107
   717
(and access functions for it);
paulson@3002
   718
wenzelm@5726
   719
* improved combination of classical reasoner and simplifier:
oheimb@3317
   720
  + functions for handling clasimpsets
oheimb@3317
   721
  + improvement of addss: now the simplifier is called _after_ the
oheimb@3317
   722
    safe steps.
oheimb@3317
   723
  + safe variant of addss called addSss: uses safe simplifications
wenzelm@5726
   724
    _during_ the safe steps. It is more complete as it allows multiple
oheimb@3317
   725
    instantiations of unknowns (e.g. with slow_tac).
wenzelm@3006
   726
paulson@3002
   727
*** Simplifier ***
paulson@3002
   728
wenzelm@3006
   729
* added interface for simplification procedures (functions that
wenzelm@3006
   730
produce *proven* rewrite rules on the fly, depending on current
wenzelm@3006
   731
redex);
wenzelm@3006
   732
wenzelm@3006
   733
* ordering on terms as parameter (used for ordered rewriting);
wenzelm@3006
   734
wenzelm@3107
   735
* new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
paulson@3002
   736
paulson@3002
   737
* the solver is now split into a safe and an unsafe part.
paulson@3002
   738
This should be invisible for the normal user, except that the
paulson@3002
   739
functions setsolver and addsolver have been renamed to setSolver and
wenzelm@3107
   740
addSolver; added safe_asm_full_simp_tac;
paulson@3002
   741
paulson@3002
   742
paulson@3002
   743
*** HOL ***
paulson@3002
   744
nipkow@3042
   745
* a generic induction tactic `induct_tac' which works for all datatypes and
wenzelm@3107
   746
also for type `nat';
nipkow@3042
   747
nipkow@3316
   748
* a generic case distinction tactic `exhaust_tac' which works for all
nipkow@3316
   749
datatypes and also for type `nat';
nipkow@3316
   750
nipkow@3316
   751
* each datatype comes with a function `size';
nipkow@3316
   752
paulson@3002
   753
* patterns in case expressions allow tuple patterns as arguments to
wenzelm@3107
   754
constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
paulson@3002
   755
paulson@3002
   756
* primrec now also works with type nat;
paulson@3002
   757
paulson@3338
   758
* recdef: a new declaration form, allows general recursive functions to be
paulson@3338
   759
defined in theory files.  See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
paulson@3338
   760
paulson@3002
   761
* the constant for negation has been renamed from "not" to "Not" to
wenzelm@3107
   762
harmonize with FOL, ZF, LK, etc.;
paulson@3002
   763
wenzelm@3107
   764
* HOL/ex/LFilter theory of a corecursive "filter" functional for
wenzelm@3107
   765
infinite lists;
paulson@3002
   766
wenzelm@3227
   767
* HOL/Modelcheck demonstrates invocation of model checker oracle;
wenzelm@3227
   768
paulson@3002
   769
* HOL/ex/Ring.thy declares cring_simp, which solves equational
paulson@3002
   770
problems in commutative rings, using axiomatic type classes for + and *;
paulson@3002
   771
paulson@3002
   772
* more examples in HOL/MiniML and HOL/Auth;
paulson@3002
   773
paulson@3002
   774
* more default rewrite rules for quantifiers, union/intersection;
paulson@3002
   775
nipkow@3321
   776
* a new constant `arbitrary == @x.False';
nipkow@3321
   777
wenzelm@3107
   778
* HOLCF/IOA replaces old HOL/IOA;
wenzelm@3107
   779
wenzelm@5726
   780
* HOLCF changes: derived all rules and arities
wenzelm@5726
   781
  + axiomatic type classes instead of classes
slotosch@2653
   782
  + typedef instead of faking type definitions
paulson@2747
   783
  + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
wenzelm@2730
   784
  + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
slotosch@2653
   785
  + eliminated the types void, one, tr
slotosch@2653
   786
  + use unit lift and bool lift (with translations) instead of one and tr
slotosch@2653
   787
  + eliminated blift from Lift3.thy (use Def instead of blift)
wenzelm@3107
   788
  all eliminated rules are derived as theorems --> no visible changes ;
oheimb@2649
   789
wenzelm@3006
   790
paulson@3002
   791
*** ZF ***
wenzelm@2553
   792
paulson@2865
   793
* ZF now has Fast_tac, Simp_tac and Auto_tac.  Union_iff is a now a default
paulson@2865
   794
rewrite rule; this may affect some proofs.  eq_cs is gone but can be put back
paulson@2865
   795
as ZF_cs addSIs [equalityI];
wenzelm@2553
   796
wenzelm@2554
   797
wenzelm@2732
   798
wenzelm@2553
   799
New in Isabelle94-7 (November 96)
wenzelm@2553
   800
---------------------------------
wenzelm@2553
   801
wenzelm@2553
   802
* allowing negative levels (as offsets) in prlev and choplev;
wenzelm@2553
   803
wenzelm@2554
   804
* super-linear speedup for large simplifications;
wenzelm@2554
   805
wenzelm@2554
   806
* FOL, ZF and HOL now use miniscoping: rewriting pushes
wenzelm@2554
   807
quantifications in as far as possible (COULD MAKE EXISTING PROOFS
wenzelm@2554
   808
FAIL); can suppress it using the command Delsimps (ex_simps @
wenzelm@2554
   809
all_simps); De Morgan laws are also now included, by default;
wenzelm@2554
   810
wenzelm@2554
   811
* improved printing of ==>  :  ~:
wenzelm@2554
   812
wenzelm@2554
   813
* new object-logic "Sequents" adds linear logic, while replacing LK
wenzelm@2554
   814
and Modal (thanks to Sara Kalvala);
wenzelm@2554
   815
wenzelm@2554
   816
* HOL/Auth: correctness proofs for authentication protocols;
wenzelm@2554
   817
wenzelm@2554
   818
* HOL: new auto_tac combines rewriting and classical reasoning (many
wenzelm@2554
   819
examples on HOL/Auth);
wenzelm@2554
   820
wenzelm@2554
   821
* HOL: new command AddIffs for declaring theorems of the form P=Q to
wenzelm@2554
   822
the rewriter and classical reasoner simultaneously;
wenzelm@2554
   823
wenzelm@2554
   824
* function uresult no longer returns theorems in "standard" format;
wenzelm@2554
   825
regain previous version by: val uresult = standard o uresult;
wenzelm@2554
   826
wenzelm@2554
   827
wenzelm@2554
   828
wenzelm@2554
   829
New in Isabelle94-6
wenzelm@2554
   830
-------------------
wenzelm@2554
   831
wenzelm@2554
   832
* oracles -- these establish an interface between Isabelle and trusted
wenzelm@2554
   833
external reasoners, which may deliver results as theorems;
wenzelm@2554
   834
wenzelm@2554
   835
* proof objects (in particular record all uses of oracles);
wenzelm@2554
   836
wenzelm@2554
   837
* Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
wenzelm@2554
   838
wenzelm@2554
   839
* "constdefs" section in theory files;
wenzelm@2554
   840
wenzelm@2554
   841
* "primrec" section (HOL) no longer requires names;
wenzelm@2554
   842
wenzelm@2554
   843
* internal type "tactic" now simply "thm -> thm Sequence.seq";
wenzelm@2554
   844
wenzelm@2554
   845
wenzelm@2554
   846
wenzelm@2554
   847
New in Isabelle94-5
wenzelm@2554
   848
-------------------
wenzelm@2554
   849
wenzelm@2554
   850
* reduced space requirements;
wenzelm@2554
   851
wenzelm@2554
   852
* automatic HTML generation from theories;
wenzelm@2554
   853
wenzelm@2554
   854
* theory files no longer require "..." (quotes) around most types;
wenzelm@2554
   855
wenzelm@2554
   856
* new examples, including two proofs of the Church-Rosser theorem;
wenzelm@2554
   857
wenzelm@2554
   858
* non-curried (1994) version of HOL is no longer distributed;
wenzelm@2554
   859
wenzelm@2553
   860
paulson@2557
   861
paulson@2557
   862
New in Isabelle94-4
paulson@2557
   863
-------------------
paulson@2557
   864
paulson@2747
   865
* greatly reduced space requirements;
paulson@2557
   866
paulson@2557
   867
* theory files (.thy) no longer require \...\ escapes at line breaks;
paulson@2557
   868
wenzelm@5726
   869
* searchable theorem database (see the section "Retrieving theorems" on
paulson@2557
   870
page 8 of the Reference Manual);
paulson@2557
   871
paulson@2557
   872
* new examples, including Grabczewski's monumental case study of the
paulson@2557
   873
Axiom of Choice;
paulson@2557
   874
paulson@2557
   875
* The previous version of HOL renamed to Old_HOL;
paulson@2557
   876
wenzelm@5726
   877
* The new version of HOL (previously called CHOL) uses a curried syntax
paulson@2557
   878
for functions.  Application looks like f a b instead of f(a,b);
paulson@2557
   879
paulson@2557
   880
* Mutually recursive inductive definitions finally work in HOL;
paulson@2557
   881
paulson@2557
   882
* In ZF, pattern-matching on tuples is now available in all abstractions and
paulson@2557
   883
translates to the operator "split";
paulson@2557
   884
paulson@2557
   885
paulson@2557
   886
paulson@2557
   887
New in Isabelle94-3
paulson@2557
   888
-------------------
paulson@2557
   889
wenzelm@5726
   890
* new infix operator, addss, allowing the classical reasoner to
paulson@2557
   891
perform simplification at each step of its search.  Example:
wenzelm@5726
   892
        fast_tac (cs addss ss)
paulson@2557
   893
wenzelm@5726
   894
* a new logic, CHOL, the same as HOL, but with a curried syntax
wenzelm@5726
   895
for functions.  Application looks like f a b instead of f(a,b).  Also pairs
paulson@2557
   896
look like (a,b) instead of <a,b>;
paulson@2557
   897
paulson@2557
   898
* PLEASE NOTE: CHOL will eventually replace HOL!
paulson@2557
   899
paulson@2557
   900
* In CHOL, pattern-matching on tuples is now available in all abstractions.
paulson@2557
   901
It translates to the operator "split".  A new theory of integers is available;
paulson@2557
   902
paulson@2557
   903
* In ZF, integer numerals now denote two's-complement binary integers.
paulson@2557
   904
Arithmetic operations can be performed by rewriting.  See ZF/ex/Bin.ML;
paulson@2557
   905
wenzelm@5726
   906
* Many new examples: I/O automata, Church-Rosser theorem, equivalents
paulson@2557
   907
of the Axiom of Choice;
paulson@2557
   908
paulson@2557
   909
paulson@2557
   910
paulson@2557
   911
New in Isabelle94-2
paulson@2557
   912
-------------------
paulson@2557
   913
wenzelm@5726
   914
* Significantly faster resolution;
paulson@2557
   915
paulson@2557
   916
* the different sections in a .thy file can now be mixed and repeated
paulson@2557
   917
freely;
paulson@2557
   918
paulson@2557
   919
* Database of theorems for FOL, HOL and ZF.  New
paulson@2557
   920
commands including qed, qed_goal and bind_thm store theorems in the database.
paulson@2557
   921
paulson@2557
   922
* Simple database queries: return a named theorem (get_thm) or all theorems of
paulson@2557
   923
a given theory (thms_of), or find out what theory a theorem was proved in
paulson@2557
   924
(theory_of_thm);
paulson@2557
   925
paulson@2557
   926
* Bugs fixed in the inductive definition and datatype packages;
paulson@2557
   927
paulson@2557
   928
* The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
paulson@2557
   929
and HOL_dup_cs obsolete;
paulson@2557
   930
paulson@2557
   931
* Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
paulson@2557
   932
have been removed;
paulson@2557
   933
paulson@2557
   934
* Simpler definition of function space in ZF;
paulson@2557
   935
paulson@2557
   936
* new results about cardinal and ordinal arithmetic in ZF;
paulson@2557
   937
paulson@2557
   938
* 'subtype' facility in HOL for introducing new types as subsets of existing
paulson@2557
   939
types;
paulson@2557
   940
paulson@2557
   941
wenzelm@2553
   942
$Id$