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