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