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