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