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