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