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