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