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