NEWS
author ballarin
Sat Feb 10 08:48:10 2001 +0100 (2001-02-10)
changeset 11091 45ffef3d3e75
parent 11062 e86340dc1d28
child 11094 b803ef642e60
permissions -rw-r--r--
Updates to HOL/Algebra:
- axclasses consolidated (lemma one_not_zero)
- summation operator SUM removed, now uses setsum
Use of setsum made it necessary to relax sort constraint in its definition
to {zero, plus}.
wenzelm@10944
     1
wenzelm@5363
     2
Isabelle NEWS -- history user-relevant changes
wenzelm@5363
     3
==============================================
wenzelm@2553
     4
wenzelm@11062
     5
New in Isabelle99-2 (February 2001)
wenzelm@11062
     6
-----------------------------------
wenzelm@11062
     7
nipkow@10224
     8
*** Overview of INCOMPATIBILITIES ***
nipkow@10224
     9
ballarin@11091
    10
* HOL/Algebra: special summation operator SUM no longer exists, it has
ballarin@11091
    11
been replaced by setsum; infix 'assoc' now has priority 50 (like 'dvd');
ballarin@11091
    12
ballarin@11091
    13
* HOL/Algebra: axiom 'one_not_zero' has been moved from axclass 'ring'
ballarin@11091
    14
to 'domain', this makes the theory consistent with mathematical literature;
ballarin@11091
    15
 
wenzelm@11043
    16
* HOL: inductive package no longer splits induction rule aggressively,
wenzelm@11043
    17
but only as far as specified by the introductions given; the old
wenzelm@11043
    18
format may recovered via ML function complete_split_rule or attribute
wenzelm@11043
    19
'split_rule (complete)';
wenzelm@11043
    20
wenzelm@10998
    21
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
wenzelm@10998
    22
gfp_Tarski to gfp_unfold;
nipkow@10224
    23
paulson@10288
    24
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
paulson@10288
    25
wenzelm@10858
    26
* HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
wenzelm@10858
    27
relation); infix "^^" has been renamed "``"; infix "``" has been
wenzelm@10858
    28
renamed "`"; "univalent" has been renamed "single_valued";
nipkow@10793
    29
wenzelm@10998
    30
* HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
wenzelm@10998
    31
operation;
wenzelm@10998
    32
nipkow@10868
    33
* HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
nipkow@10856
    34
wenzelm@10391
    35
* Isar: 'obtain' no longer declares "that" fact as simp/intro;
wenzelm@10391
    36
wenzelm@10401
    37
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm@10401
    38
consequence, it is no longer monotonic wrt. the local goal context
wenzelm@10401
    39
(which is now passed through the inductive cases);
wenzelm@10401
    40
wenzelm@10976
    41
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm@10976
    42
\<gg> to \<ggreater>;
wenzelm@10976
    43
nipkow@10224
    44
wenzelm@10245
    45
*** Document preparation ***
wenzelm@10245
    46
wenzelm@10858
    47
* \isabellestyle{NAME} selects version of Isabelle output (currently
wenzelm@10858
    48
available: are "it" for near math-mode best-style output, "sl" for
wenzelm@10858
    49
slanted text style, and "tt" for plain type-writer; if no
wenzelm@10858
    50
\isabellestyle command is given, output is according to slanted
wenzelm@10858
    51
type-writer);
wenzelm@10858
    52
wenzelm@10322
    53
* support sub/super scripts (for single symbols only), input syntax is
wenzelm@10322
    54
like this: "A\<^sup>*" or "A\<^sup>\<star>";
wenzelm@10322
    55
wenzelm@10858
    56
* some more standard symbols; see Appendix A of the system manual for
wenzelm@11062
    57
the complete list of symbols defined in isabellesym.sty;
wenzelm@10858
    58
wenzelm@10998
    59
* improved isabelle style files; more abstract symbol implementation
wenzelm@10998
    60
(should now use \isamath{...} and \isatext{...} in custom symbol
wenzelm@10998
    61
definitions);
wenzelm@10998
    62
wenzelm@10634
    63
* antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
wenzelm@10634
    64
state; Note that presentation of goal states does not conform to
wenzelm@10634
    65
actual human-readable proof documents.  Please do not include goal
wenzelm@10634
    66
states into document output unless you really know what you are doing!
wenzelm@10322
    67
wenzelm@11062
    68
* proper indentation of antiquoted output with proportional LaTeX
wenzelm@11062
    69
fonts;
wenzelm@10862
    70
wenzelm@11050
    71
* no_document ML operator temporarily disables LaTeX document
wenzelm@11050
    72
generation;
wenzelm@11050
    73
wenzelm@11062
    74
* isatool unsymbolize tunes sources for plain ASCII communication;
wenzelm@11062
    75
wenzelm@10322
    76
wenzelm@10306
    77
*** Isar ***
wenzelm@10306
    78
wenzelm@10547
    79
* Pure: Isar now suffers initial goal statements to contain unbound
wenzelm@10547
    80
schematic variables (this does not conform to actual readable proof
wenzelm@10547
    81
documents, due to unpredictable outcome and non-compositional proof
wenzelm@10547
    82
checking); users who know what they are doing may use schematic goals
wenzelm@10547
    83
for Prolog-style synthesis of proven results;
wenzelm@10547
    84
wenzelm@10391
    85
* Pure: assumption method (an implicit finishing) now handles actual
wenzelm@10391
    86
rules as well;
wenzelm@10391
    87
wenzelm@10391
    88
* Pure: improved 'obtain' --- moved to Pure, insert "that" into
wenzelm@10391
    89
initial goal, declare "that" only as Pure intro (only for single
wenzelm@10391
    90
steps); the "that" rule assumption may now be involved in implicit
wenzelm@10391
    91
finishing, thus ".." becomes a feasible for trivial obtains;
wenzelm@10391
    92
wenzelm@10391
    93
* Pure: default proof step now includes 'intro_classes'; thus trivial
wenzelm@10391
    94
instance proofs may be performed by "..";
wenzelm@10391
    95
wenzelm@10391
    96
* Pure: ?thesis / ?this / "..." now work for pure meta-level
wenzelm@10391
    97
statements as well;
wenzelm@10306
    98
wenzelm@10858
    99
* Pure: the builtin notion of 'finished' goal now includes the ==-refl
wenzelm@10858
   100
rule (as well as the assumption rule);
wenzelm@10858
   101
wenzelm@10858
   102
* Pure: 'thm_deps' command visualizes dependencies of theorems and
wenzelm@10858
   103
lemmas, using the graph browser tool;
wenzelm@10858
   104
wenzelm@10944
   105
* Pure: predict failure of "show" in interactive mode;
wenzelm@10944
   106
wenzelm@11016
   107
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm@11016
   108
wenzelm@10401
   109
* HOL: improved method 'induct' --- now handles non-atomic goals
wenzelm@10401
   110
(potential INCOMPATIBILITY); tuned error handling;
wenzelm@10401
   111
wenzelm@10557
   112
* HOL: cases and induct rules now provide explicit hints about the
wenzelm@10547
   113
number of facts to be consumed (0 for "type" and 1 for "set" rules);
wenzelm@10547
   114
any remaining facts are inserted into the goal verbatim;
wenzelm@10547
   115
wenzelm@10858
   116
* HOL: local contexts (aka cases) may now contain term bindings as
wenzelm@10858
   117
well; the 'cases' and 'induct' methods new provide a ?case binding for
wenzelm@10858
   118
the result to be shown in each case;
wenzelm@10858
   119
wenzelm@10770
   120
* HOL: added 'recdef_tc' command;
wenzelm@10770
   121
wenzelm@11016
   122
* isatool convert assists in eliminating legacy ML scripts;
wenzelm@11016
   123
wenzelm@10306
   124
wenzelm@10245
   125
*** HOL ***
wenzelm@10245
   126
wenzelm@10245
   127
* HOL/Library: a collection of generic theories to be used together
wenzelm@10245
   128
with main HOL; the theory loader path already includes this directory
wenzelm@10245
   129
by default; the following existing theories have been moved here:
wenzelm@10245
   130
HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
wenzelm@10337
   131
(as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
wenzelm@10245
   132
wenzelm@10966
   133
* HOL/Unix: "Some aspects of Unix file-system security", a typical
wenzelm@10966
   134
modelling and verification task performed in Isabelle/HOL +
wenzelm@10966
   135
Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
wenzelm@10966
   136
wenzelm@10514
   137
* HOL basics: added overloaded operations "inverse" and "divide"
wenzelm@10726
   138
(infix "/"), syntax for generic "abs" operation, generic summation
wenzelm@10726
   139
operator;
wenzelm@10452
   140
wenzelm@10391
   141
* HOL/typedef: simplified package, provide more useful rules (see also
wenzelm@10391
   142
HOL/subset.thy);
wenzelm@10391
   143
wenzelm@10915
   144
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm@10915
   145
now expressed as a proper nested rule (old-style tactic scripts may
wenzelm@10915
   146
require atomize_strip_tac to cope with non-atomic premises);
wenzelm@10915
   147
wenzelm@10915
   148
* HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
wenzelm@10915
   149
to "split_conv" (old name still available for compatibility);
wenzelm@10915
   150
wenzelm@10915
   151
* HOL: improved concrete syntax for strings (e.g. allows translation
wenzelm@10915
   152
rules with string literals);
wenzelm@10915
   153
wenzelm@10944
   154
* HOL-Hyperreal: a new target, extending HOL-Real with the hyperreals
wenzelm@10944
   155
and Fleuriot's mechanization of analysis;
paulson@10756
   156
paulson@10756
   157
* HOL-Real, HOL-Hyperreals: improved arithmetic simplification;
wenzelm@10391
   158
wenzelm@10858
   159
paulson@10474
   160
*** CTT ***
paulson@10474
   161
wenzelm@10547
   162
* CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
wenzelm@10547
   163
"lam" is displayed as TWO lambda-symbols
paulson@10474
   164
wenzelm@10547
   165
* CTT: theory Main now available, containing everything (that is, Bool
wenzelm@10547
   166
and Arith);
wenzelm@10547
   167
paulson@10474
   168
wenzelm@10391
   169
*** General ***
wenzelm@10391
   170
wenzelm@10664
   171
* print modes "brackets" and "no_brackets" control output of nested =>
wenzelm@10664
   172
(types) and ==> (props); the default behaviour is "brackets";
wenzelm@10664
   173
wenzelm@11062
   174
* system: support Poly/ML 4.0;
wenzelm@10634
   175
wenzelm@10547
   176
* Pure: the Simplifier has been implemented properly as a derived rule
wenzelm@10547
   177
outside of the actual kernel (at last!); the overall performance
wenzelm@10547
   178
penalty in practical applications is about 50%, while reliability of
wenzelm@10547
   179
the Isabelle inference kernel has been greatly improved;
wenzelm@10547
   180
wenzelm@10391
   181
* Provers: fast_tac (and friends) now handle actual object-logic rules
wenzelm@10391
   182
as assumptions as well;
wenzelm@10391
   183
wenzelm@10391
   184
wenzelm@10245
   185
wenzelm@10103
   186
New in Isabelle99-1 (October 2000)
wenzelm@10103
   187
----------------------------------
wenzelm@8015
   188
wenzelm@10003
   189
*** Overview of INCOMPATIBILITIES ***
paulson@8014
   190
wenzelm@8848
   191
* HOL: simplification of natural numbers is much changed; to partly
wenzelm@8848
   192
recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
wenzelm@8848
   193
issue the following ML commands:
wenzelm@8848
   194
wenzelm@8848
   195
  Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
wenzelm@8848
   196
  Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
paulson@8788
   197
wenzelm@10129
   198
* HOL: simplification no longer dives into case-expressions; this is
wenzelm@10129
   199
controlled by "t.weak_case_cong" for each datatype t;
wenzelm@10003
   200
wenzelm@10003
   201
* HOL: nat_less_induct renamed to less_induct;
wenzelm@10003
   202
wenzelm@10003
   203
* HOL: systematic renaming of the SOME (Eps) rules, may use isatool
wenzelm@10003
   204
fixsome to patch .thy and .ML sources automatically;
paulson@8967
   205
wenzelm@10003
   206
  select_equality  -> some_equality
wenzelm@10003
   207
  select_eq_Ex     -> some_eq_ex
wenzelm@10003
   208
  selectI2EX       -> someI2_ex
wenzelm@10003
   209
  selectI2         -> someI2
wenzelm@10003
   210
  selectI          -> someI
wenzelm@10003
   211
  select1_equality -> some1_equality
wenzelm@10003
   212
  Eps_sym_eq       -> some_sym_eq_trivial
wenzelm@10003
   213
  Eps_eq           -> some_eq_trivial
wenzelm@10003
   214
wenzelm@10003
   215
* HOL: exhaust_tac on datatypes superceded by new generic case_tac;
wenzelm@10003
   216
wenzelm@10003
   217
* HOL: removed obsolete theorem binding expand_if (refer to split_if
wenzelm@10003
   218
instead);
wenzelm@10003
   219
wenzelm@10003
   220
* HOL: the recursion equations generated by 'recdef' are now called
wenzelm@10003
   221
f.simps instead of f.rules;
wenzelm@10003
   222
wenzelm@10003
   223
* HOL: qed_spec_mp now also handles bounded ALL as well;
wenzelm@10003
   224
wenzelm@10003
   225
* HOL: 0 is now overloaded, so the type constraint ":: nat" may
wenzelm@10003
   226
sometimes be needed;
wenzelm@10003
   227
wenzelm@10003
   228
* HOL: the constant for "f``x" is now "image" rather than "op ``";
paulson@8014
   229
paulson@10065
   230
* HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
paulson@10065
   231
wenzelm@9330
   232
* HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
wenzelm@9330
   233
product is now "<*>" instead of "Times"; the lexicographic product is
wenzelm@9330
   234
now "<*lex*>" instead of "**";
nipkow@8705
   235
wenzelm@10003
   236
* HOL: theory Sexp is now in HOL/Induct examples (it used to be part
wenzelm@10003
   237
of main HOL, but was unused); better use HOL's datatype package;
paulson@9971
   238
wenzelm@10137
   239
* HOL: removed "symbols" syntax for constant "override" of theory Map;
wenzelm@10137
   240
the old syntax may be recovered as follows:
wenzelm@10137
   241
wenzelm@10137
   242
  syntax (symbols)
wenzelm@10137
   243
    override  :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
wenzelm@10137
   244
      (infixl "\\<oplus>" 100)
wenzelm@10137
   245
wenzelm@8848
   246
* HOL/Real: "rabs" replaced by overloaded "abs" function;
wenzelm@8848
   247
wenzelm@8887
   248
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm@8887
   249
Lfp, Gfp, WF); this only affects ML packages that refer to const names
wenzelm@8887
   250
internally;
wenzelm@8887
   251
wenzelm@10003
   252
* HOL and ZF: syntax for quotienting wrt an equivalence relation
wenzelm@10003
   253
changed from A/r to A//r;
wenzelm@9908
   254
wenzelm@10003
   255
* ZF: new treatment of arithmetic (nat & int) may break some old
wenzelm@10003
   256
proofs;
wenzelm@8921
   257
wenzelm@10003
   258
* Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
wenzelm@10003
   259
rulify -> rule_format, elimify -> elim_format, ...);
paulson@9542
   260
wenzelm@9941
   261
* Isar/Provers: intro/elim/dest attributes changed; renamed
wenzelm@9941
   262
intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
wenzelm@9937
   263
should have to change intro!! to intro? only); replaced "delrule" by
wenzelm@9937
   264
"rule del";
wenzelm@9437
   265
wenzelm@9612
   266
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
wenzelm@9612
   267
wenzelm@9437
   268
* Provers: strengthened force_tac by using new first_best_tac;
oheimb@9402
   269
wenzelm@10003
   270
* LaTeX document preparation: several changes of isabelle.sty (see
wenzelm@10003
   271
lib/texinputs);
wenzelm@8729
   272
paulson@8014
   273
wenzelm@8487
   274
*** Document preparation ***
wenzelm@8358
   275
wenzelm@9198
   276
* formal comments (text blocks etc.) in new-style theories may now
wenzelm@9753
   277
contain antiquotations of thm/prop/term/typ/text to be presented
wenzelm@9753
   278
according to latex print mode; concrete syntax is like this:
wenzelm@9753
   279
@{term[show_types] "f(x) = a + x"};
wenzelm@9198
   280
wenzelm@8358
   281
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm@8518
   282
including proper document sources;
wenzelm@8358
   283
wenzelm@8358
   284
* generated LaTeX sources are now deleted after successful run
wenzelm@8358
   285
(isatool document -c); may retain a copy somewhere else via -D option
wenzelm@8358
   286
of isatool usedir;
wenzelm@8358
   287
wenzelm@8566
   288
* isatool usedir -D now lets isatool latex -o sty update the Isabelle
wenzelm@10003
   289
style files, achieving self-contained LaTeX sources and simplifying
wenzelm@10003
   290
LaTeX debugging;
wenzelm@8566
   291
wenzelm@8518
   292
* old-style theories now produce (crude) LaTeX output as well;
wenzelm@8358
   293
wenzelm@9057
   294
* browser info session directories are now self-contained (may be put
wenzelm@9437
   295
on WWW server seperately); improved graphs of nested sessions; removed
wenzelm@9437
   296
graph for 'all sessions';
wenzelm@9057
   297
wenzelm@10003
   298
* several improvements in isabelle style files; \isabellestyle{it}
wenzelm@10003
   299
produces fake math mode output; \isamarkupheader is now \section by
wenzelm@10003
   300
default; see lib/texinputs/isabelle.sty etc.;
wenzelm@9489
   301
wenzelm@8358
   302
wenzelm@8184
   303
*** Isar ***
wenzelm@8184
   304
wenzelm@10003
   305
* Isar/Pure: local results and corresponding term bindings are now
wenzelm@10003
   306
subject to Hindley-Milner polymorphism (similar to ML); this
wenzelm@10003
   307
accommodates incremental type-inference very nicely;
wenzelm@8283
   308
wenzelm@10003
   309
* Isar/Pure: new derived language element 'obtain' supports
wenzelm@10003
   310
generalized existence reasoning;
wenzelm@8621
   311
wenzelm@10003
   312
* Isar/Pure: new calculational elements 'moreover' and 'ultimately'
wenzelm@10003
   313
support accumulation of results, without applying any rules yet;
wenzelm@10003
   314
useful to collect intermediate results without explicit name
wenzelm@10003
   315
references, and for use with transitivity rules with more than 2
wenzelm@10003
   316
premises;
wenzelm@8184
   317
wenzelm@10003
   318
* Isar/Pure: scalable support for case-analysis type proofs: new
wenzelm@10003
   319
'case' language element refers to local contexts symbolically, as
wenzelm@10003
   320
produced by certain proof methods; internally, case names are attached
wenzelm@10003
   321
to theorems as "tags";
wenzelm@8440
   322
wenzelm@10003
   323
* Isar/Pure: theory command 'hide' removes declarations from
wenzelm@9330
   324
class/type/const name spaces;
wenzelm@9330
   325
wenzelm@10003
   326
* Isar/Pure: theory command 'defs' supports option "(overloaded)" to
wenzelm@9330
   327
indicate potential overloading;
wenzelm@9330
   328
wenzelm@10003
   329
* Isar/Pure: changed syntax of local blocks from {{ }} to { };
wenzelm@8621
   330
wenzelm@10003
   331
* Isar/Pure: syntax of sorts made 'inner', i.e. have to write
wenzelm@10003
   332
"{a,b,c}" instead of {a,b,c};
wenzelm@9011
   333
wenzelm@10003
   334
* Isar/Pure now provides its own version of intro/elim/dest
wenzelm@10003
   335
attributes; useful for building new logics, but beware of confusion
wenzelm@10003
   336
with the version in Provers/classical;
wenzelm@9612
   337
wenzelm@10003
   338
* Isar/Pure: the local context of (non-atomic) goals is provided via
wenzelm@10003
   339
case name 'antecedent';
wenzelm@8440
   340
wenzelm@10003
   341
* Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
wenzelm@10003
   342
to the current context is now done automatically);
wenzelm@9383
   343
wenzelm@10003
   344
* Isar/Pure: theory command 'method_setup' provides a simple interface
wenzelm@10003
   345
for definining proof methods in ML;
wenzelm@9612
   346
wenzelm@10003
   347
* Isar/Provers: intro/elim/dest attributes changed; renamed
wenzelm@9941
   348
intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
wenzelm@9941
   349
most cases, one should have to change intro!! to intro? only);
wenzelm@9941
   350
replaced "delrule" by "rule del";
wenzelm@8283
   351
wenzelm@10003
   352
* Isar/Provers: new 'hypsubst' method, plain 'subst' method and
wenzelm@10003
   353
'symmetric' attribute (the latter supercedes [RS sym]);
wenzelm@10003
   354
wenzelm@10003
   355
* Isar/Provers: splitter support (via 'split' attribute and 'simp'
wenzelm@10003
   356
method modifier); 'simp' method: 'only:' modifier removes loopers as
wenzelm@10003
   357
well (including splits);
wenzelm@10003
   358
wenzelm@10003
   359
* Isar/Provers: Simplifier and Classical methods now support all kind
wenzelm@10003
   360
of modifiers used in the past, including 'cong', 'iff', etc.
wenzelm@10003
   361
wenzelm@10003
   362
* Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
wenzelm@10003
   363
of Simplifier and Classical reasoner);
wenzelm@10003
   364
wenzelm@10003
   365
* Isar/HOL: new proof method 'cases' and improved version of 'induct'
wenzelm@10003
   366
now support named cases; major packages (inductive, datatype, primrec,
wenzelm@10003
   367
recdef) support case names and properly name parameters;
wenzelm@9612
   368
wenzelm@10003
   369
* Isar/HOL: new transitivity rules for substitution in inequalities --
wenzelm@10003
   370
monotonicity conditions are extracted to be proven at end of
wenzelm@10003
   371
calculations;
wenzelm@10003
   372
wenzelm@10003
   373
* Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
wenzelm@10003
   374
method anyway;
wenzelm@10003
   375
wenzelm@10003
   376
* Isar/HOL: removed old expand_if = split_if; theorems if_splits =
wenzelm@10003
   377
split_if split_if_asm; datatype package provides theorems foo.splits =
wenzelm@10003
   378
foo.split foo.split_asm for each datatype;
wenzelm@10003
   379
wenzelm@10003
   380
* Isar/HOL: tuned inductive package, rename "intrs" to "intros"
wenzelm@10003
   381
(potential INCOMPATIBILITY), emulation of mk_cases feature for proof
wenzelm@10003
   382
scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
wenzelm@10003
   383
use "(cases (simplified))" method in proper proof texts);
wenzelm@10003
   384
wenzelm@10003
   385
* Isar/HOL: added global 'arith_split' attribute for 'arith' method;
wenzelm@10003
   386
wenzelm@10003
   387
* Isar: names of theorems etc. may be natural numbers as well;
wenzelm@10003
   388
wenzelm@10003
   389
* Isar: 'pr' command: optional arguments for goals_limit and
wenzelm@9724
   390
ProofContext.prems_limit; no longer prints theory contexts, but only
wenzelm@9724
   391
proof states;
wenzelm@8487
   392
wenzelm@10003
   393
* Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
wenzelm@8518
   394
additional print modes to be specified; e.g. "pr(latex)" will print
wenzelm@8518
   395
proof state according to the Isabelle LaTeX style;
wenzelm@8487
   396
wenzelm@10003
   397
* Isar: improved support for emulating tactic scripts, including proof
wenzelm@9612
   398
methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
wenzelm@9612
   399
'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
wenzelm@9612
   400
(for HOL datatypes);
wenzelm@8534
   401
wenzelm@10003
   402
* Isar: simplified (more robust) goal selection of proof methods: 1st
wenzelm@10003
   403
goal, all goals, or explicit goal specifier (tactic emulation); thus
wenzelm@10003
   404
'proof method scripts' have to be in depth-first order;
wenzelm@8673
   405
wenzelm@10003
   406
* Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
wenzelm@8729
   407
wenzelm@10003
   408
* Isar: removed 'help' command, which hasn't been too helpful anyway;
wenzelm@10003
   409
should instead use individual commands for printing items
wenzelm@10003
   410
(print_commands, print_methods etc.);
wenzelm@9224
   411
wenzelm@10003
   412
* Isar: added 'nothing' --- the empty list of theorems;
wenzelm@9239
   413
wenzelm@8184
   414
paulson@8014
   415
*** HOL ***
paulson@8014
   416
wenzelm@10080
   417
* HOL/MicroJava: formalization of a fragment of Java, together with a
wenzelm@10080
   418
corresponding virtual machine and a specification of its bytecode
wenzelm@10080
   419
verifier and a lightweight bytecode verifier, including proofs of
wenzelm@10080
   420
type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
wenzelm@10080
   421
Cornelia Pusch (see also the homepage of project Bali at
wenzelm@10080
   422
http://isabelle.in.tum.de/Bali/);
wenzelm@10080
   423
wenzelm@8518
   424
* HOL/Algebra: new theory of rings and univariate polynomials, by
wenzelm@8518
   425
Clemens Ballarin;
paulson@8014
   426
wenzelm@10157
   427
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
wenzelm@10003
   428
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
wenzelm@10003
   429
Rasmussen;
wenzelm@8570
   430
wenzelm@10157
   431
* HOL/Lattice: fundamental concepts of lattice theory and order
wenzelm@10157
   432
structures, including duals, properties of bounds versus algebraic
wenzelm@10157
   433
laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
wenzelm@10157
   434
Theorem for complete lattices etc.; may also serve as a demonstration
wenzelm@10157
   435
for abstract algebraic reasoning using axiomatic type classes, and
wenzelm@10157
   436
mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
wenzelm@10157
   437
wenzelm@10003
   438
* HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
wenzelm@10003
   439
von Oheimb;
paulson@9542
   440
wenzelm@10164
   441
* HOL/IMPP: extension of IMP with local variables and mutually
wenzelm@10164
   442
recursive procedures, by David von Oheimb;
wenzelm@10164
   443
wenzelm@10003
   444
* HOL/Lambda: converted into new-style theory and document;
paulson@9542
   445
wenzelm@10003
   446
* HOL/ex/Multiquote: example of multiple nested quotations and
wenzelm@10003
   447
anti-quotations -- basically a generalized version of de-Bruijn
wenzelm@10003
   448
representation; very useful in avoiding lifting of operations;
wenzelm@8848
   449
wenzelm@9612
   450
* HOL/record: added general record equality rule to simpset; fixed
wenzelm@9612
   451
select-update simplification procedure to handle extended records as
wenzelm@9612
   452
well; admit "r" as field name;
paulson@9542
   453
paulson@8967
   454
* HOL: 0 is now overloaded over the new sort "zero", allowing its use with
paulson@8967
   455
other numeric types and also as the identity of groups, rings, etc.;
paulson@8967
   456
paulson@8967
   457
* HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
paulson@8967
   458
Types nat and int belong to this axclass;
paulson@8967
   459
wenzelm@10003
   460
* HOL: greatly improved simplification involving numerals of type nat, int, real:
paulson@8788
   461
   (i + #8 + j) = Suc k simplifies to  #7 + (i + j) = k
paulson@8832
   462
   i*j + k + j*#3*i     simplifies to  #4*(i*j) + k
paulson@8832
   463
  two terms #m*u and #n*u are replaced by #(m+n)*u
paulson@8832
   464
    (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
paulson@8832
   465
  and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
paulson@8832
   466
    or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
paulson@8736
   467
wenzelm@10003
   468
* HOL: meson_tac is available (previously in ex/meson.ML); it is a
wenzelm@10003
   469
powerful prover for predicate logic but knows nothing of clasets; see
wenzelm@10003
   470
ex/mesontest.ML and ex/mesontest2.ML for example applications;
paulson@9835
   471
wenzelm@8848
   472
* HOL: new version of "case_tac" subsumes both boolean case split and
wenzelm@8440
   473
"exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
wenzelm@8518
   474
exists, may define val exhaust_tac = case_tac for ad-hoc portability;
wenzelm@8440
   475
wenzelm@8848
   476
* HOL: simplification no longer dives into case-expressions: only the
wenzelm@10129
   477
selector expression is simplified, but not the remaining arms; to
wenzelm@10129
   478
enable full simplification of case-expressions for datatype t, you may
wenzelm@10129
   479
remove t.weak_case_cong from the simpset, either globally (Delcongs
wenzelm@10129
   480
[thm"t.weak_case_cong"];) or locally (delcongs [...]).
nipkow@8603
   481
wenzelm@8848
   482
* HOL/recdef: the recursion equations generated by 'recdef' for
wenzelm@8848
   483
function 'f' are now called f.simps instead of f.rules; if all
wenzelm@8848
   484
termination conditions are proved automatically, these simplification
wenzelm@8848
   485
rules are added to the simpset, as in primrec; rules may be named
wenzelm@8848
   486
individually as well, resulting in a separate list of theorems for
wenzelm@8848
   487
each equation;
wenzelm@8848
   488
wenzelm@9489
   489
* HOL/While is a new theory that provides a while-combinator. It
wenzelm@9489
   490
permits the definition of tail-recursive functions without the
wenzelm@9489
   491
provision of a termination measure. The latter is necessary once the
wenzelm@9489
   492
invariant proof rule for while is applied.
nipkow@9457
   493
wenzelm@10003
   494
* HOL: new (overloaded) notation for the set of elements below/above
wenzelm@10003
   495
some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
nipkow@8925
   496
wenzelm@8848
   497
* HOL: theorems impI, allI, ballI bound as "strip";
wenzelm@8848
   498
wenzelm@10003
   499
* HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
nipkow@9746
   500
induct_tac th "x1 ... xn" expects th to have a conclusion of the form
nipkow@9746
   501
P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
nipkow@9746
   502
wenzelm@10003
   503
* HOL/Real: "rabs" replaced by overloaded "abs" function;
nipkow@9737
   504
wenzelm@10003
   505
* HOL: theory Sexp now in HOL/Induct examples (it used to be part of
wenzelm@10003
   506
main HOL, but was unused);
nipkow@8626
   507
wenzelm@10003
   508
* HOL: fewer consts declared as global (e.g. have to refer to
wenzelm@10003
   509
"Lfp.lfp" instead of "lfp" internally; affects ML packages only);
wenzelm@8887
   510
wenzelm@10003
   511
* HOL: tuned AST representation of nested pairs, avoiding bogus output
wenzelm@10003
   512
in case of overlap with user translations (e.g. judgements over
wenzelm@10003
   513
tuples); (note that the underlying logical represenation is still
wenzelm@10003
   514
bogus);
wenzelm@9349
   515
nipkow@8412
   516
paulson@9542
   517
*** ZF ***
paulson@9542
   518
wenzelm@10003
   519
* ZF: simplification automatically cancels common terms in arithmetic
wenzelm@10003
   520
expressions over nat and int;
paulson@9542
   521
wenzelm@10003
   522
* ZF: new treatment of nat to minimize type-checking: all operators
wenzelm@10003
   523
coerce their operands to a natural number using the function natify,
wenzelm@10003
   524
making the algebraic laws unconditional;
paulson@9542
   525
wenzelm@10003
   526
* ZF: as above, for int: operators coerce their operands to an integer
wenzelm@10003
   527
using the function intify;
paulson@9542
   528
wenzelm@10003
   529
* ZF: the integer library now contains many of the usual laws for the
wenzelm@10003
   530
orderings, including $<=, and monotonicity laws for $+ and $*;
paulson@9542
   531
wenzelm@10003
   532
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
wenzelm@10003
   533
simplification;
paulson@9388
   534
wenzelm@10003
   535
* FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
wenzelm@10003
   536
to the simplifier and classical reasoner simultaneously;
paulson@9388
   537
paulson@9388
   538
wenzelm@8358
   539
*** General ***
wenzelm@8358
   540
wenzelm@10003
   541
* Provers: blast_tac now handles actual object-logic rules as
wenzelm@10003
   542
assumptions; note that auto_tac uses blast_tac internally as well;
wenzelm@10003
   543
wenzelm@10003
   544
* Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
wenzelm@10003
   545
outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
wenzelm@10003
   546
wenzelm@9941
   547
* Provers: delrules now handles destruct rules as well (no longer need
wenzelm@9941
   548
explicit make_elim);
wenzelm@9941
   549
wenzelm@10003
   550
* Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
wenzelm@10003
   551
  [| inj ?f;          ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
wenzelm@10003
   552
use instead the strong form,
wenzelm@10003
   553
  [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
wenzelm@10003
   554
in HOL, FOL and ZF the function cla_make_elim will create such rules
wenzelm@10003
   555
from destruct-rules;
wenzelm@9489
   556
wenzelm@9709
   557
* Provers: Simplifier.easy_setup provides a fast path to basic
wenzelm@9709
   558
Simplifier setup for new object-logics;
wenzelm@9709
   559
wenzelm@9709
   560
* Pure: AST translation rules no longer require constant head on LHS;
wenzelm@9349
   561
wenzelm@9709
   562
* Pure: improved name spaces: ambiguous output is qualified; support
wenzelm@9709
   563
for hiding of names;
wenzelm@8729
   564
wenzelm@10003
   565
* system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
wenzelm@10003
   566
XSYMBOL_HOME; no longer need to do manual configuration in most
wenzelm@10003
   567
situations;
wenzelm@10003
   568
wenzelm@9709
   569
* system: compression of ML heaps images may now be controlled via -c
wenzelm@9709
   570
option of isabelle and isatool usedir (currently only observed by
wenzelm@9709
   571
Poly/ML);
wenzelm@8358
   572
wenzelm@9981
   573
* system: isatool installfonts may handle X-Symbol fonts as well (very
wenzelm@9981
   574
useful for remote X11);
wenzelm@9981
   575
wenzelm@9709
   576
* system: provide TAGS file for Isabelle sources;
wenzelm@9052
   577
wenzelm@9288
   578
* ML: infix 'OF' is a version of 'MRS' with more appropriate argument
wenzelm@9288
   579
order;
wenzelm@9288
   580
wenzelm@8994
   581
* ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
wenzelm@8994
   582
timing flag supersedes proof_timing and Toplevel.trace;
wenzelm@8994
   583
wenzelm@10003
   584
* ML: new combinators |>> and |>>> for incremental transformations
wenzelm@10003
   585
with secondary results (e.g. certain theory extensions):
wenzelm@10003
   586
wenzelm@9330
   587
* ML: PureThy.add_defs gets additional argument to indicate potential
wenzelm@9330
   588
overloading (usually false);
wenzelm@9330
   589
wenzelm@10003
   590
* ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
wenzelm@10003
   591
results;
wenzelm@8440
   592
wenzelm@8358
   593
wenzelm@8015
   594
wenzelm@7986
   595
New in Isabelle99 (October 1999)
wenzelm@7986
   596
--------------------------------
oheimb@4649
   597
paulson@5931
   598
*** Overview of INCOMPATIBILITIES (see below for more details) ***
paulson@5931
   599
paulson@6922
   600
* HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
paulson@6922
   601
are no longer simplified.  (This allows the simplifier to unfold recursive
paulson@6922
   602
functional programs.)  To restore the old behaviour, declare
wenzelm@7215
   603
wenzelm@7215
   604
    Delcongs [if_weak_cong];
paulson@6922
   605
wenzelm@6269
   606
* HOL: Removed the obsolete syntax "Compl A"; use -A for set
wenzelm@6269
   607
complement;
paulson@5931
   608
wenzelm@6269
   609
* HOL: the predicate "inj" is now defined by translation to "inj_on";
paulson@6174
   610
berghofe@7847
   611
* HOL/datatype: mutual_induct_tac no longer exists --
berghofe@7847
   612
  use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
berghofe@7847
   613
wenzelm@6386
   614
* HOL/typedef: fixed type inference for representing set; type
wenzelm@6386
   615
arguments now have to occur explicitly on the rhs as type constraints;
wenzelm@6386
   616
wenzelm@6269
   617
* ZF: The con_defs part of an inductive definition may no longer refer
wenzelm@6269
   618
to constants declared in the same theory;
nipkow@6057
   619
wenzelm@6269
   620
* HOL, ZF: the function mk_cases, generated by the inductive
wenzelm@6269
   621
definition package, has lost an argument.  To simplify its result, it
wenzelm@6269
   622
uses the default simpset instead of a supplied list of theorems.
paulson@6141
   623
wenzelm@7215
   624
* HOL/List: the constructors of type list are now Nil and Cons;
wenzelm@7215
   625
nipkow@7619
   626
* Simplifier: the type of the infix ML functions
wenzelm@8729
   627
        setSSolver addSSolver setSolver addSolver
nipkow@7619
   628
is now  simpset * solver -> simpset  where `solver' is a new abstract type
nipkow@7619
   629
for packaging solvers. A solver is created via
wenzelm@8729
   630
        mk_solver: string -> (thm list -> int -> tactic) -> solver
nipkow@7619
   631
where the string argument is only a comment.
nipkow@6057
   632
wenzelm@7647
   633
paulson@6069
   634
*** Proof tools ***
paulson@6069
   635
wenzelm@6343
   636
* Provers/Arith/fast_lin_arith.ML contains a functor for creating a
wenzelm@6343
   637
decision procedure for linear arithmetic. Currently it is used for
wenzelm@7593
   638
types `nat', `int', and `real' in HOL (see below); it can, should and
wenzelm@7593
   639
will be instantiated for other types and logics as well.
paulson@6069
   640
nipkow@7324
   641
* The simplifier now accepts rewrite rules with flexible heads, eg
nipkow@7324
   642
     hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
nipkow@7324
   643
  They are applied like any rule with a non-pattern lhs, i.e. by first-order
nipkow@7324
   644
  matching.
paulson@6069
   645
wenzelm@7593
   646
paulson@6014
   647
*** General ***
paulson@6014
   648
wenzelm@7986
   649
* New Isabelle/Isar subsystem provides an alternative to traditional
wenzelm@7215
   650
tactical theorem proving; together with the ProofGeneral/isar user
wenzelm@7215
   651
interface it offers an interactive environment for developing human
wenzelm@7215
   652
readable proof documents (Isar == Intelligible semi-automated
wenzelm@7886
   653
reasoning); for further information see isatool doc isar-ref,
wenzelm@7986
   654
src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
wenzelm@7886
   655
wenzelm@9612
   656
* improved and simplified presentation of theories: better HTML markup
wenzelm@9612
   657
(including colors), graph views in several sizes; isatool usedir now
wenzelm@9612
   658
provides a proper interface for user theories (via -P option); actual
wenzelm@9612
   659
document preparation based on (PDF)LaTeX is available as well (for
wenzelm@9612
   660
new-style theories only); see isatool doc system for more information;
wenzelm@7215
   661
wenzelm@7252
   662
* native support for Proof General, both for classic Isabelle and
wenzelm@7986
   663
Isabelle/Isar;
wenzelm@7215
   664
wenzelm@7791
   665
* ML function thm_deps visualizes dependencies of theorems and lemmas,
wenzelm@7791
   666
using the graph browser tool;
wenzelm@7791
   667
wenzelm@6751
   668
* Isabelle manuals now also available as PDF;
wenzelm@6751
   669
wenzelm@6449
   670
* theory loader rewritten from scratch (may not be fully
wenzelm@6449
   671
bug-compatible); old loadpath variable has been replaced by show_path,
wenzelm@6671
   672
add_path, del_path, reset_path functions; new operations such as
wenzelm@7593
   673
update_thy, touch_thy, remove_thy, use/update_thy_only (see also
wenzelm@7593
   674
isatool doc ref);
wenzelm@6449
   675
wenzelm@7215
   676
* improved isatool install: option -k creates KDE application icon,
wenzelm@7215
   677
option -p DIR installs standalone binaries;
wenzelm@7215
   678
wenzelm@7215
   679
* added ML_PLATFORM setting (useful for cross-platform installations);
wenzelm@7215
   680
more robust handling of platform specific ML images for SML/NJ;
wenzelm@7215
   681
wenzelm@7886
   682
* the settings environment is now statically scoped, i.e. it is never
wenzelm@7986
   683
created again in sub-processes invoked from isabelle, isatool, or
wenzelm@7886
   684
Isabelle;
wenzelm@7886
   685
wenzelm@7215
   686
* path element specification '~~' refers to '$ISABELLE_HOME';
wenzelm@7215
   687
wenzelm@6343
   688
* in locales, the "assumes" and "defines" parts may be omitted if
wenzelm@6343
   689
empty;
wenzelm@5973
   690
wenzelm@6269
   691
* new print_mode "xsymbols" for extended symbol support (e.g. genuine
wenzelm@6269
   692
long arrows);
wenzelm@6259
   693
wenzelm@6343
   694
* new print_mode "HTML";
wenzelm@6343
   695
wenzelm@6343
   696
* new flag show_tags controls display of tags of theorems (which are
wenzelm@6343
   697
basically just comments that may be attached by some tools);
wenzelm@6343
   698
wenzelm@6461
   699
* Isamode 2.6 requires patch to accomodate change of Isabelle font
wenzelm@6461
   700
mode and goal output format:
wenzelm@6461
   701
wenzelm@6461
   702
diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
wenzelm@6461
   703
244c244
wenzelm@6461
   704
<       (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
wenzelm@6461
   705
---
wenzelm@6533
   706
>       (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
wenzelm@6461
   707
diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
wenzelm@6461
   708
181c181
wenzelm@6461
   709
< (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
wenzelm@6461
   710
---
wenzelm@6461
   711
> (defconst proofstate-proofstart-regexp "^Level [0-9]+"
wenzelm@6461
   712
wenzelm@7450
   713
* function bind_thms stores lists of theorems (cf. bind_thm);
wenzelm@7450
   714
wenzelm@7593
   715
* new shorthand tactics ftac, eatac, datac, fatac;
wenzelm@7593
   716
wenzelm@7593
   717
* qed (and friends) now accept "" as result name; in that case the
wenzelm@7986
   718
theorem is not stored, but proper checks and presentation of the
wenzelm@7986
   719
result still apply;
wenzelm@7593
   720
wenzelm@7805
   721
* theorem database now also indexes constants "Trueprop", "all",
wenzelm@7805
   722
"==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
wenzelm@7805
   723
oheimb@6028
   724
nipkow@6057
   725
*** HOL ***
nipkow@6057
   726
wenzelm@7215
   727
** HOL arithmetic **
wenzelm@7215
   728
wenzelm@6343
   729
* There are now decision procedures for linear arithmetic over nat and
wenzelm@6343
   730
int:
nipkow@6131
   731
wenzelm@6343
   732
1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
wenzelm@6343
   733
`+', `-', `Suc', `min', `max' and numerical constants; other subterms
wenzelm@6343
   734
are treated as atomic; subformulae not involving type `nat' or `int'
wenzelm@6343
   735
are ignored; quantified subformulae are ignored unless they are
wenzelm@6343
   736
positive universal or negative existential. The tactic has to be
wenzelm@6343
   737
invoked by hand and can be a little bit slow. In particular, the
wenzelm@6343
   738
running time is exponential in the number of occurrences of `min' and
wenzelm@6343
   739
`max', and `-' on `nat'.
nipkow@6131
   740
wenzelm@6343
   741
2. fast_arith_tac is a cut-down version of arith_tac: it only takes
wenzelm@6343
   742
(negated) (in)equalities among the premises and the conclusion into
wenzelm@6343
   743
account (i.e. no compound formulae) and does not know about `min' and
wenzelm@6343
   744
`max', and `-' on `nat'. It is fast and is used automatically by the
wenzelm@6343
   745
simplifier.
nipkow@6131
   746
wenzelm@6343
   747
NB: At the moment, these decision procedures do not cope with mixed
wenzelm@6343
   748
nat/int formulae where the two parts interact, such as `m < n ==>
wenzelm@6343
   749
int(m) < int(n)'.
oheimb@6028
   750
wenzelm@7215
   751
* HOL/Numeral provides a generic theory of numerals (encoded
wenzelm@7313
   752
efficiently as bit strings); setup for types nat/int/real is in place;
wenzelm@7215
   753
INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
wenzelm@7215
   754
int, existing theories and proof scripts may require a few additional
wenzelm@7215
   755
type constraints;
wenzelm@7215
   756
wenzelm@7215
   757
* integer division and remainder can now be performed on constant
wenzelm@7215
   758
arguments;
paulson@7157
   759
wenzelm@7215
   760
* many properties of integer multiplication, division and remainder
wenzelm@7215
   761
are now available;
paulson@6922
   762
paulson@7287
   763
* An interface to the Stanford Validity Checker (SVC) is available through the
paulson@7287
   764
tactic svc_tac.  Propositional tautologies and theorems of linear arithmetic
paulson@7287
   765
are proved automatically.  SVC must be installed separately, and its results
paulson@7287
   766
must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
paulson@7287
   767
invocation of the underlying oracle).  For SVC see
paulson@7444
   768
  http://verify.stanford.edu/SVC
paulson@6922
   769
wenzelm@7125
   770
* IsaMakefile: the HOL-Real target now builds an actual image;
wenzelm@7125
   771
wenzelm@7215
   772
wenzelm@7215
   773
** HOL misc **
wenzelm@7215
   774
wenzelm@7595
   775
* HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
wenzelm@7595
   776
(in Isabelle/Isar) -- by Gertrud Bauer;
wenzelm@7595
   777
wenzelm@7691
   778
* HOL/BCV: generic model of bytecode verification, i.e. data-flow
wenzelm@7691
   779
analysis for assembly languages with subtypes;
wenzelm@7691
   780
wenzelm@6278
   781
* HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
wenzelm@6278
   782
-- avoids syntactic ambiguities and treats state, transition, and
wenzelm@6278
   783
temporal levels more uniformly; introduces INCOMPATIBILITIES due to
wenzelm@6278
   784
changed syntax and (many) tactics;
wenzelm@6278
   785
wenzelm@7791
   786
* HOL/inductive: Now also handles more general introduction rules such
wenzelm@7791
   787
  as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
wenzelm@7791
   788
  theorems are now maintained within the theory (maintained via the
wenzelm@7791
   789
  "mono" attribute);
berghofe@7780
   790
wenzelm@7238
   791
* HOL/datatype: Now also handles arbitrarily branching datatypes
wenzelm@7238
   792
  (using function types) such as
wenzelm@7238
   793
wenzelm@7238
   794
  datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
berghofe@7047
   795
wenzelm@7326
   796
* HOL/record: record_simproc (part of the default simpset) takes care
wenzelm@7326
   797
of selectors applied to updated records; record_split_tac is no longer
wenzelm@7327
   798
part of the default claset; update_defs may now be removed from the
wenzelm@7327
   799
simpset in many cases; COMPATIBILITY: old behavior achieved by
wenzelm@7326
   800
wenzelm@7326
   801
  claset_ref () := claset() addSWrapper record_split_wrapper;
wenzelm@7326
   802
  Delsimprocs [record_simproc]
wenzelm@7326
   803
wenzelm@6386
   804
* HOL/typedef: fixed type inference for representing set; type
wenzelm@6386
   805
arguments now have to occur explicitly on the rhs as type constraints;
wenzelm@6386
   806
paulson@7287
   807
* HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
paulson@7287
   808
names rather than an ML expression;
paulson@7287
   809
paulson@7287
   810
* HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
paulson@7287
   811
supplied later.  Program schemes can be defined, such as
paulson@7287
   812
    "While B C s = (if B s then While B C (C s) else s)"
paulson@7287
   813
where the well-founded relation can be chosen after B and C have been given.
wenzelm@6563
   814
wenzelm@7215
   815
* HOL/List: the constructors of type list are now Nil and Cons;
wenzelm@7215
   816
INCOMPATIBILITY: while [] and infix # syntax is still there, of
wenzelm@7215
   817
course, ML tools referring to List.list.op # etc. have to be adapted;
wenzelm@7215
   818
wenzelm@7238
   819
* HOL_quantifiers flag superseded by "HOL" print mode, which is
wenzelm@7238
   820
disabled by default; run isabelle with option -m HOL to get back to
wenzelm@7238
   821
the original Gordon/HOL-style output;
wenzelm@7238
   822
wenzelm@7238
   823
* HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
wenzelm@7238
   824
ALL x<=y. P, EX x<y. P, EX x<=y. P;
wenzelm@7238
   825
wenzelm@7238
   826
* HOL basic syntax simplified (more orthogonal): all variants of
wenzelm@7238
   827
All/Ex now support plain / symbolic / HOL notation; plain syntax for
wenzelm@7238
   828
Eps operator is provided as well: "SOME x. P[x]";
wenzelm@7238
   829
berghofe@7320
   830
* HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
wenzelm@7261
   831
wenzelm@7280
   832
* HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
wenzelm@7280
   833
thus available for user theories;
wenzelm@7280
   834
wenzelm@7300
   835
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
wenzelm@7300
   836
HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
wenzelm@7300
   837
time;
wenzelm@7300
   838
wenzelm@7986
   839
* HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
wenzelm@7986
   840
several times and then mp;
oheimb@7492
   841
wenzelm@7215
   842
paulson@7113
   843
*** LK ***
paulson@7113
   844
wenzelm@7215
   845
* the notation <<...>> is now available as a notation for sequences of
wenzelm@7215
   846
formulas;
paulson@7113
   847
paulson@7113
   848
* the simplifier is now installed
paulson@7113
   849
wenzelm@8729
   850
* the axiom system has been generalized (thanks to Soren Heilmann)
paulson@7113
   851
paulson@7113
   852
* the classical reasoner now has a default rule database
paulson@7113
   853
paulson@7113
   854
paulson@6064
   855
*** ZF ***
paulson@6064
   856
paulson@6064
   857
* new primrec section allows primitive recursive functions to be given
wenzelm@6269
   858
directly (as in HOL) over datatypes and the natural numbers;
paulson@6064
   859
wenzelm@6269
   860
* new tactics induct_tac and exhaust_tac for induction (or case
wenzelm@6269
   861
analysis) over datatypes and the natural numbers;
paulson@6064
   862
paulson@6064
   863
* the datatype declaration of type T now defines the recursor T_rec;
paulson@6064
   864
paulson@6141
   865
* simplification automatically does freeness reasoning for datatype
wenzelm@6269
   866
constructors;
paulson@6141
   867
wenzelm@6269
   868
* automatic type-inference, with AddTCs command to insert new
wenzelm@6269
   869
type-checking rules;
paulson@6155
   870
wenzelm@6269
   871
* datatype introduction rules are now added as Safe Introduction rules
wenzelm@6269
   872
to the claset;
paulson@6155
   873
wenzelm@6269
   874
* the syntax "if P then x else y" is now available in addition to
wenzelm@6269
   875
if(P,x,y);
wenzelm@6269
   876
paulson@6069
   877
wenzelm@6343
   878
*** Internal programming interfaces ***
wenzelm@6343
   879
wenzelm@7919
   880
* tuned simplifier trace output; new flag debug_simp;
wenzelm@7919
   881
wenzelm@7420
   882
* structures Vartab / Termtab (instances of TableFun) offer efficient
wenzelm@7420
   883
tables indexed by indexname_ord / term_ord (compatible with aconv);
wenzelm@7420
   884
wenzelm@6386
   885
* AxClass.axclass_tac lost the theory argument;
wenzelm@6386
   886
wenzelm@6343
   887
* tuned current_goals_markers semantics: begin / end goal avoids
wenzelm@6343
   888
printing empty lines;
wenzelm@6343
   889
wenzelm@6343
   890
* removed prs and prs_fn hook, which was broken because it did not
wenzelm@6343
   891
include \n in its semantics, forcing writeln to add one
wenzelm@6343
   892
uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
wenzelm@6343
   893
string -> unit if you really want to output text without newline;
wenzelm@6343
   894
wenzelm@6343
   895
* Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
wenzelm@6343
   896
plain output, interface builders may have to enable 'isabelle_font'
wenzelm@6343
   897
mode to get Isabelle font glyphs as before;
wenzelm@6343
   898
wenzelm@6343
   899
* refined token_translation interface; INCOMPATIBILITY: output length
wenzelm@6343
   900
now of type real instead of int;
wenzelm@6343
   901
wenzelm@7196
   902
* theory loader actions may be traced via new ThyInfo.add_hook
wenzelm@7196
   903
interface (see src/Pure/Thy/thy_info.ML); example application: keep
wenzelm@7196
   904
your own database of information attached to *whole* theories -- as
wenzelm@7196
   905
opposed to intra-theory data slots offered via TheoryDataFun;
wenzelm@7196
   906
wenzelm@7647
   907
* proper handling of dangling sort hypotheses (at last!);
wenzelm@7647
   908
Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
wenzelm@7647
   909
extra sort hypotheses that can be witnessed from the type signature;
wenzelm@7986
   910
the force_strip_shyps flag is gone, any remaining shyps are simply
wenzelm@7986
   911
left in the theorem (with a warning issued by strip_shyps_warning);
wenzelm@7647
   912
wenzelm@6343
   913
paulson@6064
   914
wenzelm@5781
   915
New in Isabelle98-1 (October 1998)
wenzelm@5781
   916
----------------------------------
wenzelm@5781
   917
wenzelm@5127
   918
*** Overview of INCOMPATIBILITIES (see below for more details) ***
wenzelm@4842
   919
wenzelm@5726
   920
* several changes of automated proof tools;
wenzelm@5373
   921
wenzelm@5726
   922
* HOL: major changes to the inductive and datatype packages, including
wenzelm@5726
   923
some minor incompatibilities of theory syntax;
berghofe@5214
   924
wenzelm@5726
   925
* HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
wenzelm@5217
   926
called `inj_on';
paulson@5160
   927
nipkow@5275
   928
* HOL: removed duplicate thms in Arith:
nipkow@5275
   929
  less_imp_add_less  should be replaced by  trans_less_add1
nipkow@5275
   930
  le_imp_add_le      should be replaced by  trans_le_add1
paulson@5160
   931
wenzelm@5726
   932
* HOL: unary minus is now overloaded (new type constraints may be
wenzelm@5726
   933
required);
paulson@5490
   934
wenzelm@5726
   935
* HOL and ZF: unary minus for integers is now #- instead of #~.  In
wenzelm@5726
   936
ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
wenzelm@5726
   937
now taken as an integer constant.
paulson@5541
   938
wenzelm@5726
   939
* Pure: ML function 'theory_of' renamed to 'theory';
wenzelm@5397
   940
wenzelm@5363
   941
wenzelm@5127
   942
*** Proof tools ***
nipkow@4880
   943
nipkow@5657
   944
* Simplifier:
nipkow@5657
   945
  1. Asm_full_simp_tac is now more aggressive.
nipkow@5657
   946
     1. It will sometimes reorient premises if that increases their power to
nipkow@5657
   947
        simplify.
nipkow@5657
   948
     2. It does no longer proceed strictly from left to right but may also
nipkow@5657
   949
        rotate premises to achieve further simplification.
nipkow@5657
   950
     For compatibility reasons there is now Asm_lr_simp_tac which is like the
nipkow@5657
   951
     old Asm_full_simp_tac in that it does not rotate premises.
nipkow@5657
   952
  2. The simplifier now knows a little bit about nat-arithmetic.
nipkow@4880
   953
wenzelm@5127
   954
* Classical reasoner: wrapper mechanism for the classical reasoner now
wenzelm@5127
   955
allows for selected deletion of wrappers, by introduction of names for
wenzelm@5127
   956
wrapper functionals.  This implies that addbefore, addSbefore,
wenzelm@5127
   957
addaltern, and addSaltern now take a pair (name, tactic) as argument,
wenzelm@5127
   958
and that adding two tactics with the same name overwrites the first
wenzelm@5127
   959
one (emitting a warning).
oheimb@4824
   960
  type wrapper = (int -> tactic) -> (int -> tactic)
oheimb@4649
   961
  setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
oheimb@4824
   962
  addWrapper, addSWrapper: claset * (string * wrapper) -> claset
oheimb@4824
   963
  delWrapper, delSWrapper: claset *  string            -> claset
oheimb@4649
   964
  getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
oheimb@4649
   965
wenzelm@5705
   966
* Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
wenzelm@5726
   967
semantics; addbefore now affects only the unsafe part of step_tac
wenzelm@5726
   968
etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
wenzelm@5726
   969
FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
wenzelm@5726
   970
by Force_tac;
oheimb@5524
   971
wenzelm@5726
   972
* Classical reasoner: setwrapper to setWrapper and compwrapper to
wenzelm@5726
   973
compWrapper; added safe wrapper (and access functions for it);
oheimb@5524
   974
wenzelm@5127
   975
* HOL/split_all_tac is now much faster and fails if there is nothing
wenzelm@5726
   976
to split.  Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
wenzelm@5726
   977
and the names of the automatically generated variables have changed.
wenzelm@5726
   978
split_all_tac has moved within claset() from unsafe wrappers to safe
wenzelm@5726
   979
wrappers, which means that !!-bound variables are split much more
wenzelm@5726
   980
aggressively, and safe_tac and clarify_tac now split such variables.
wenzelm@5726
   981
If this splitting is not appropriate, use delSWrapper "split_all_tac".
wenzelm@5726
   982
Note: the same holds for record_split_tac, which does the job of
wenzelm@5726
   983
split_all_tac for record fields.
wenzelm@5127
   984
wenzelm@5726
   985
* HOL/Simplifier: Rewrite rules for case distinctions can now be added
wenzelm@5726
   986
permanently to the default simpset using Addsplits just like
wenzelm@5726
   987
Addsimps. They can be removed via Delsplits just like
wenzelm@5726
   988
Delsimps. Lower-case versions are also available.
wenzelm@5127
   989
wenzelm@5726
   990
* HOL/Simplifier: The rule split_if is now part of the default
wenzelm@5726
   991
simpset. This means that the simplifier will eliminate all occurrences
wenzelm@5726
   992
of if-then-else in the conclusion of a goal. To prevent this, you can
wenzelm@5726
   993
either remove split_if completely from the default simpset by
wenzelm@5726
   994
`Delsplits [split_if]' or remove it in a specific call of the
wenzelm@5726
   995
simplifier using `... delsplits [split_if]'.  You can also add/delete
wenzelm@5726
   996
other case splitting rules to/from the default simpset: every datatype
wenzelm@5726
   997
generates suitable rules `split_t_case' and `split_t_case_asm' (where
wenzelm@5726
   998
t is the name of the datatype).
wenzelm@5127
   999
wenzelm@5726
  1000
* Classical reasoner / Simplifier combination: new force_tac (and
wenzelm@5127
  1001
derivatives Force_tac, force) combines rewriting and classical
wenzelm@5127
  1002
reasoning (and whatever other tools) similarly to auto_tac, but is
wenzelm@5726
  1003
aimed to solve the given subgoal completely.
wenzelm@5127
  1004
wenzelm@5127
  1005
wenzelm@5127
  1006
*** General ***
wenzelm@5127
  1007
wenzelm@5217
  1008
* new top-level commands `Goal' and `Goalw' that improve upon `goal'
wenzelm@5127
  1009
and `goalw': the theory is no longer needed as an explicit argument -
wenzelm@5127
  1010
the current theory context is used; assumptions are no longer returned
wenzelm@5127
  1011
at the ML-level unless one of them starts with ==> or !!; it is
wenzelm@5217
  1012
recommended to convert to these new commands using isatool fixgoal
wenzelm@5217
  1013
(backup your sources first!);
wenzelm@4842
  1014
wenzelm@5217
  1015
* new top-level commands 'thm' and 'thms' for retrieving theorems from
wenzelm@5207
  1016
the current theory context, and 'theory' to lookup stored theories;
paulson@4806
  1017
paulson@5722
  1018
* new theory section 'locale' for declaring constants, assumptions and
paulson@5722
  1019
definitions that have local scope;
paulson@5722
  1020
wenzelm@5127
  1021
* new theory section 'nonterminals' for purely syntactic types;
wenzelm@4858
  1022
wenzelm@5127
  1023
* new theory section 'setup' for generic ML setup functions
wenzelm@5127
  1024
(e.g. package initialization);
wenzelm@4869
  1025
wenzelm@5131
  1026
* the distribution now includes Isabelle icons: see
wenzelm@5131
  1027
lib/logo/isabelle-{small,tiny}.xpm;
wenzelm@5131
  1028
wenzelm@5363
  1029
* isatool install - install binaries with absolute references to
wenzelm@5363
  1030
ISABELLE_HOME/bin;
wenzelm@5363
  1031
wenzelm@5572
  1032
* isatool logo -- create instances of the Isabelle logo (as EPS);
wenzelm@5572
  1033
wenzelm@5407
  1034
* print mode 'emacs' reserved for Isamode;
wenzelm@5407
  1035
wenzelm@5726
  1036
* support multiple print (ast) translations per constant name;
wenzelm@5726
  1037
wenzelm@6925
  1038
* theorems involving oracles are now printed with a suffixed [!];
wenzelm@6925
  1039
wenzelm@4711
  1040
paulson@4661
  1041
*** HOL ***
paulson@4661
  1042
wenzelm@5710
  1043
* there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
nipkow@5709
  1044
wenzelm@5217
  1045
* HOL/inductive package reorganized and improved: now supports mutual
paulson@5267
  1046
definitions such as
wenzelm@5217
  1047
wenzelm@5217
  1048
  inductive EVEN ODD
wenzelm@5217
  1049
    intrs
wenzelm@5217
  1050
      null "0 : EVEN"
wenzelm@5217
  1051
      oddI "n : EVEN ==> Suc n : ODD"
wenzelm@5217
  1052
      evenI "n : ODD ==> Suc n : EVEN"
wenzelm@5217
  1053
wenzelm@5217
  1054
new theorem list "elims" contains an elimination rule for each of the
wenzelm@5217
  1055
recursive sets; inductive definitions now handle disjunctive premises
wenzelm@5217
  1056
correctly (also ZF);
berghofe@5214
  1057
wenzelm@5217
  1058
INCOMPATIBILITIES: requires Inductive as an ancestor; component
wenzelm@5217
  1059
"mutual_induct" no longer exists - the induction rule is always
wenzelm@5217
  1060
contained in "induct";
wenzelm@5217
  1061
wenzelm@5217
  1062
wenzelm@5217
  1063
* HOL/datatype package re-implemented and greatly improved: now
paulson@5267
  1064
supports mutually recursive datatypes such as
wenzelm@5217
  1065
wenzelm@5217
  1066
  datatype
wenzelm@5217
  1067
    'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
wenzelm@5217
  1068
            | SUM ('a aexp) ('a aexp)
wenzelm@5217
  1069
            | DIFF ('a aexp) ('a aexp)
wenzelm@5217
  1070
            | NUM 'a
wenzelm@5217
  1071
  and
wenzelm@5217
  1072
    'a bexp = LESS ('a aexp) ('a aexp)
wenzelm@5217
  1073
            | AND ('a bexp) ('a bexp)
wenzelm@5217
  1074
            | OR ('a bexp) ('a bexp)
wenzelm@5217
  1075
paulson@5267
  1076
as well as indirectly recursive datatypes such as
berghofe@5214
  1077
wenzelm@5217
  1078
  datatype
wenzelm@5217
  1079
    ('a, 'b) term = Var 'a
wenzelm@5217
  1080
                  | App 'b ((('a, 'b) term) list)
berghofe@5214
  1081
wenzelm@5217
  1082
The new tactic  mutual_induct_tac [<var_1>, ..., <var_n>] i  performs
wenzelm@5217
  1083
induction on mutually / indirectly recursive datatypes.
wenzelm@5217
  1084
wenzelm@5217
  1085
Primrec equations are now stored in theory and can be accessed via
wenzelm@5217
  1086
<function_name>.simps.
wenzelm@5217
  1087
wenzelm@5217
  1088
INCOMPATIBILITIES:
berghofe@5214
  1089
wenzelm@5217
  1090
  - Theories using datatypes must now have theory Datatype as an
wenzelm@5217
  1091
    ancestor.
wenzelm@5217
  1092
  - The specific <typename>.induct_tac no longer exists - use the
wenzelm@5217
  1093
    generic induct_tac instead.
berghofe@5226
  1094
  - natE has been renamed to nat.exhaust - use exhaust_tac
wenzelm@5217
  1095
    instead of res_inst_tac ... natE. Note that the variable
berghofe@5226
  1096
    names in nat.exhaust differ from the names in natE, this
wenzelm@5217
  1097
    may cause some "fragile" proofs to fail.
wenzelm@5217
  1098
  - The theorems split_<typename>_case and split_<typename>_case_asm
wenzelm@5217
  1099
    have been renamed to <typename>.split and <typename>.split_asm.
wenzelm@5217
  1100
  - Since default sorts of type variables are now handled correctly,
wenzelm@5217
  1101
    some datatype definitions may have to be annotated with explicit
wenzelm@5217
  1102
    sort constraints.
wenzelm@5217
  1103
  - Primrec definitions no longer require function name and type
wenzelm@5217
  1104
    of recursive argument.
berghofe@5214
  1105
wenzelm@5217
  1106
Consider using isatool fixdatatype to adapt your theories and proof
wenzelm@5217
  1107
scripts to the new package (backup your sources first!).
wenzelm@5217
  1108
wenzelm@5217
  1109
wenzelm@5726
  1110
* HOL/record package: considerably improved implementation; now
wenzelm@5726
  1111
includes concrete syntax for record types, terms, updates; theorems
wenzelm@5726
  1112
for surjective pairing and splitting !!-bound record variables; proof
wenzelm@5726
  1113
support is as follows:
wenzelm@5726
  1114
wenzelm@5726
  1115
  1) standard conversions (selectors or updates applied to record
wenzelm@5726
  1116
constructor terms) are part of the standard simpset;
wenzelm@5726
  1117
wenzelm@5726
  1118
  2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
wenzelm@5726
  1119
made part of standard simpset and claset via addIffs;
wenzelm@5726
  1120
wenzelm@5726
  1121
  3) a tactic for record field splitting (record_split_tac) is part of
wenzelm@5726
  1122
the standard claset (addSWrapper);
wenzelm@5726
  1123
wenzelm@5726
  1124
To get a better idea about these rules you may retrieve them via
wenzelm@5726
  1125
something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
wenzelm@5726
  1126
the name of your record type.
wenzelm@5726
  1127
wenzelm@5726
  1128
The split tactic 3) conceptually simplifies by the following rule:
wenzelm@5726
  1129
wenzelm@5726
  1130
  "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
wenzelm@5726
  1131
wenzelm@5726
  1132
Thus any record variable that is bound by meta-all will automatically
wenzelm@5726
  1133
blow up into some record constructor term, consequently the
wenzelm@5726
  1134
simplifications of 1), 2) apply.  Thus force_tac, auto_tac etc. shall
wenzelm@5726
  1135
solve record problems automatically.
wenzelm@5726
  1136
berghofe@5214
  1137
wenzelm@5125
  1138
* reorganized the main HOL image: HOL/Integ and String loaded by
wenzelm@5125
  1139
default; theory Main includes everything;
wenzelm@5125
  1140
paulson@5650
  1141
* automatic simplification of integer sums and comparisons, using cancellation;
paulson@5650
  1142
oheimb@5526
  1143
* added option_map_eq_Some and not_Some_eq to the default simpset and claset;
wenzelm@5127
  1144
wenzelm@5127
  1145
* added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
wenzelm@5127
  1146
wenzelm@5127
  1147
* many new identities for unions, intersections, set difference, etc.;
wenzelm@5127
  1148
wenzelm@5127
  1149
* expand_if, expand_split, expand_sum_case and expand_nat_case are now
wenzelm@5127
  1150
called split_if, split_split, split_sum_case and split_nat_case (to go
wenzelm@5127
  1151
with add/delsplits);
wenzelm@5125
  1152
wenzelm@5127
  1153
* HOL/Prod introduces simplification procedure unit_eq_proc rewriting
wenzelm@5127
  1154
(?x::unit) = (); this is made part of the default simpset, which COULD
wenzelm@5127
  1155
MAKE EXISTING PROOFS FAIL under rare circumstances (consider
wenzelm@5207
  1156
'Delsimprocs [unit_eq_proc];' as last resort); also note that
wenzelm@5207
  1157
unit_abs_eta_conv is added in order to counter the effect of
wenzelm@5207
  1158
unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
wenzelm@5207
  1159
%u.f();
wenzelm@5125
  1160
wenzelm@5217
  1161
* HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
wenzelm@5217
  1162
makes more sense);
berghofe@5109
  1163
paulson@5475
  1164
* HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
paulson@5475
  1165
  It and 'sym RS equals0D' are now in the default  claset, giving automatic
paulson@5475
  1166
  disjointness reasoning but breaking a few old proofs.
paulson@5267
  1167
wenzelm@5217
  1168
* HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
wenzelm@5217
  1169
to 'converse' from 'inverse' (for compatibility with ZF and some
wenzelm@5217
  1170
literature);
wenzelm@5085
  1171
wenzelm@5127
  1172
* HOL/recdef can now declare non-recursive functions, with {} supplied as
wenzelm@5127
  1173
the well-founded relation;
oheimb@4838
  1174
paulson@5490
  1175
* HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
paulson@5490
  1176
    Compl A.  The "Compl" syntax remains available as input syntax for this
paulson@5490
  1177
    release ONLY.
paulson@5490
  1178
wenzelm@5127
  1179
* HOL/Update: new theory of function updates:
wenzelm@5127
  1180
    f(a:=b) == %x. if x=a then b else f x
wenzelm@5127
  1181
may also be iterated as in f(a:=b,c:=d,...);
nipkow@5077
  1182
wenzelm@5127
  1183
* HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
paulson@4899
  1184
nipkow@5282
  1185
* HOL/List:
nipkow@5282
  1186
  - new function list_update written xs[i:=v] that updates the i-th
nipkow@5282
  1187
    list position. May also be iterated as in xs[i:=a,j:=b,...].
nipkow@5428
  1188
  - new function `upt' written [i..j(] which generates the list
nipkow@5428
  1189
    [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
nipkow@5428
  1190
    bound write [i..j], which is a shorthand for [i..j+1(].
nipkow@5282
  1191
  - new lexicographic orderings and corresponding wellfoundedness theorems.
paulson@4779
  1192
wenzelm@5127
  1193
* HOL/Arith:
wenzelm@5127
  1194
  - removed 'pred' (predecessor) function;
wenzelm@5127
  1195
  - generalized some theorems about n-1;
wenzelm@5127
  1196
  - many new laws about "div" and "mod";
wenzelm@5127
  1197
  - new laws about greatest common divisors (see theory ex/Primes);
oheimb@4766
  1198
wenzelm@5127
  1199
* HOL/Relation: renamed the relational operator r^-1 "converse"
wenzelm@4842
  1200
instead of "inverse";
wenzelm@4711
  1201
nipkow@5651
  1202
* HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
nipkow@5651
  1203
  of the multiset ordering;
nipkow@5651
  1204
wenzelm@5127
  1205
* directory HOL/Real: a construction of the reals using Dedekind cuts
nipkow@5651
  1206
  (not included by default);
nipkow@4835
  1207
wenzelm@5127
  1208
* directory HOL/UNITY: Chandy and Misra's UNITY formalism;
wenzelm@4711
  1209
nipkow@5651
  1210
* directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
nipkow@5651
  1211
  programs, i.e. different program variables may have different types.
nipkow@5651
  1212
paulson@5142
  1213
* calling (stac rew i) now fails if "rew" has no effect on the goal
paulson@5142
  1214
  [previously, this check worked only if the rewrite rule was unconditional]
paulson@5308
  1215
  Now rew can involve either definitions or equalities (either == or =).
wenzelm@5002
  1216
wenzelm@5363
  1217
paulson@4879
  1218
*** ZF ***
paulson@4879
  1219
paulson@5332
  1220
* theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
paulson@5332
  1221
  only the theorems proved on ZF.ML;
paulson@5160
  1222
paulson@5475
  1223
* ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
paulson@5475
  1224
  It and 'sym RS equals0D' are now in the default  claset, giving automatic
paulson@5475
  1225
  disjointness reasoning but breaking a few old proofs.
paulson@5267
  1226
paulson@5160
  1227
* ZF/Update: new theory of function updates
paulson@5160
  1228
    with default rewrite rule  f(x:=y) ` z = if(z=x, y, f`z)
paulson@5160
  1229
  may also be iterated as in f(a:=b,c:=d,...);
paulson@5160
  1230
paulson@4879
  1231
* in  let x=t in u(x), neither t nor u(x) has to be an FOL term.
oheimb@4649
  1232
paulson@5142
  1233
* calling (stac rew i) now fails if "rew" has no effect on the goal
paulson@5142
  1234
  [previously, this check worked only if the rewrite rule was unconditional]
paulson@5308
  1235
  Now rew can involve either definitions or equalities (either == or =).
paulson@5142
  1236
paulson@5160
  1237
* case_tac provided for compatibility with HOL
paulson@5160
  1238
    (like the old excluded_middle_tac, but with subgoals swapped)
paulson@5160
  1239
wenzelm@4842
  1240
wenzelm@5127
  1241
*** Internal programming interfaces ***
wenzelm@5002
  1242
wenzelm@5251
  1243
* Pure: several new basic modules made available for general use, see
wenzelm@5251
  1244
also src/Pure/README;
wenzelm@5207
  1245
wenzelm@5008
  1246
* improved the theory data mechanism to support encapsulation (data
wenzelm@5008
  1247
kind name replaced by private Object.kind, acting as authorization
wenzelm@5373
  1248
key); new type-safe user interface via functor TheoryDataFun; generic
wenzelm@5373
  1249
print_data function becomes basically useless;
wenzelm@5002
  1250
wenzelm@5251
  1251
* removed global_names compatibility flag -- all theory declarations
wenzelm@5251
  1252
are qualified by default;
wenzelm@5251
  1253
wenzelm@5085
  1254
* module Pure/Syntax now offers quote / antiquote translation
wenzelm@5085
  1255
functions (useful for Hoare logic etc. with implicit dependencies);
wenzelm@5373
  1256
see HOL/ex/Antiquote for an example use;
wenzelm@5085
  1257
wenzelm@5127
  1258
* Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
wenzelm@5127
  1259
cterm -> thm;
wenzelm@5127
  1260
wenzelm@5207
  1261
* new tactical CHANGED_GOAL for checking that a tactic modifies a
wenzelm@5207
  1262
subgoal;
paulson@5142
  1263
wenzelm@5251
  1264
* Display.print_goals function moved to Locale.print_goals;
wenzelm@5251
  1265
wenzelm@5731
  1266
* standard print function for goals supports current_goals_markers
wenzelm@5731
  1267
variable for marking begin of proof, end of proof, start of goal; the
wenzelm@5731
  1268
default is ("", "", ""); setting current_goals_markers := ("<proof>",
wenzelm@5731
  1269
"</proof>", "<goal>") causes SGML like tagged proof state printing,
wenzelm@5731
  1270
for example;
wenzelm@5731
  1271
wenzelm@5002
  1272
wenzelm@5002
  1273
wenzelm@4410
  1274
New in Isabelle98 (January 1998)
wenzelm@4410
  1275
--------------------------------
wenzelm@4410
  1276
wenzelm@4410
  1277
*** Overview of INCOMPATIBILITIES (see below for more details) ***
wenzelm@4410
  1278
wenzelm@4410
  1279
* changed lexical syntax of terms / types: dots made part of long
wenzelm@4410
  1280
identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
wenzelm@4410
  1281
wenzelm@4410
  1282
* simpset (and claset) reference variable replaced by functions
wenzelm@4410
  1283
simpset / simpset_ref;
wenzelm@4410
  1284
wenzelm@4410
  1285
* no longer supports theory aliases (via merge) and non-trivial
wenzelm@4410
  1286
implicit merge of thms' signatures;
wenzelm@4410
  1287
wenzelm@4410
  1288
* most internal names of constants changed due to qualified names;
wenzelm@4410
  1289
wenzelm@4410
  1290
* changed Pure/Sequence interface (see Pure/seq.ML);
wenzelm@4410
  1291
wenzelm@3454
  1292
paulson@3715
  1293
*** General Changes ***
paulson@3715
  1294
wenzelm@4174
  1295
* hierachically structured name spaces (for consts, types, axms, thms
wenzelm@3943
  1296
etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
wenzelm@4108
  1297
old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
wenzelm@4108
  1298
isatool fixdots ensures space after dots (e.g. "%x. x"); set
wenzelm@4174
  1299
long_names for fully qualified output names; NOTE: ML programs
wenzelm@4174
  1300
(special tactics, packages etc.) referring to internal names may have
wenzelm@4174
  1301
to be adapted to cope with fully qualified names; in case of severe
wenzelm@4174
  1302
backward campatibility problems try setting 'global_names' at compile
wenzelm@4174
  1303
time to have enrything declared within a flat name space; one may also
wenzelm@4174
  1304
fine tune name declarations in theories via the 'global' and 'local'
wenzelm@4174
  1305
section;
wenzelm@4108
  1306
wenzelm@4108
  1307
* reimplemented the implicit simpset and claset using the new anytype
wenzelm@4108
  1308
data filed in signatures; references simpset:simpset ref etc. are
wenzelm@4108
  1309
replaced by functions simpset:unit->simpset and
wenzelm@4108
  1310
simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
wenzelm@4108
  1311
to patch your ML files accordingly;
paulson@3856
  1312
wenzelm@3857
  1313
* HTML output now includes theory graph data for display with Java
wenzelm@3857
  1314
applet or isatool browser; data generated automatically via isatool
wenzelm@3901
  1315
usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
wenzelm@3857
  1316
paulson@3856
  1317
* defs may now be conditional; improved rewrite_goals_tac to handle
paulson@3856
  1318
conditional equations;
paulson@3856
  1319
wenzelm@4174
  1320
* defs now admits additional type arguments, using TYPE('a) syntax;
wenzelm@4174
  1321
wenzelm@3901
  1322
* theory aliases via merge (e.g. M=A+B+C) no longer supported, always
wenzelm@3901
  1323
creates a new theory node; implicit merge of thms' signatures is
wenzelm@4112
  1324
restricted to 'trivial' ones; COMPATIBILITY: one may have to use
wenzelm@3901
  1325
transfer:theory->thm->thm in (rare) cases;
wenzelm@3901
  1326
wenzelm@3968
  1327
* improved handling of draft signatures / theories; draft thms (and
wenzelm@3968
  1328
ctyps, cterms) are automatically promoted to real ones;
wenzelm@3968
  1329
wenzelm@3901
  1330
* slightly changed interfaces for oracles: admit many per theory, named
wenzelm@3901
  1331
(e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
wenzelm@3901
  1332
wenzelm@3901
  1333
* print_goals: optional output of const types (set show_consts and
wenzelm@3901
  1334
show_types);
wenzelm@3851
  1335
wenzelm@4388
  1336
* improved output of warnings (###) and errors (***);
wenzelm@3697
  1337
paulson@4178
  1338
* subgoal_tac displays a warning if the new subgoal has type variables;
paulson@4178
  1339
paulson@3715
  1340
* removed old README and Makefiles;
wenzelm@3697
  1341
paulson@3856
  1342
* replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
wenzelm@3670
  1343
paulson@3715
  1344
* removed obsolete init_pps and init_database;
paulson@3715
  1345
paulson@3715
  1346
* deleted the obsolete tactical STATE, which was declared by
paulson@3715
  1347
    fun STATE tacfun st = tacfun st st;
paulson@3715
  1348
wenzelm@4388
  1349
* cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
wenzelm@4388
  1350
(which abbreviates $HOME);
wenzelm@4269
  1351
wenzelm@4269
  1352
* changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
wenzelm@4269
  1353
use isatool fixseq to adapt your ML programs (this works for fully
wenzelm@4269
  1354
qualified references to the Sequence structure only!);
wenzelm@4269
  1355
wenzelm@4381
  1356
* use_thy no longer requires writable current directory; it always
wenzelm@4381
  1357
reloads .ML *and* .thy file, if either one is out of date;
wenzelm@4269
  1358
paulson@3715
  1359
paulson@3715
  1360
*** Classical Reasoner ***
paulson@3715
  1361
wenzelm@3744
  1362
* Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
wenzelm@3744
  1363
tactics that use classical reasoning to simplify a subgoal without
wenzelm@3744
  1364
splitting it into several subgoals;
paulson@3715
  1365
paulson@3719
  1366
* Safe_tac: like safe_tac but uses the default claset;
paulson@3719
  1367
paulson@3715
  1368
paulson@3715
  1369
*** Simplifier ***
paulson@3715
  1370
paulson@3715
  1371
* added simplification meta rules:
paulson@3715
  1372
    (asm_)(full_)simplify: simpset -> thm -> thm;
paulson@3715
  1373
paulson@3715
  1374
* simplifier.ML no longer part of Pure -- has to be loaded by object
paulson@3715
  1375
logics (again);
paulson@3715
  1376
paulson@3715
  1377
* added prems argument to simplification procedures;
paulson@3715
  1378
paulson@4325
  1379
* HOL, FOL, ZF: added infix function `addsplits':
paulson@4325
  1380
  instead of `<simpset> setloop (split_tac <thms>)'
paulson@4325
  1381
  you can simply write `<simpset> addsplits <thms>'
paulson@4325
  1382
paulson@3715
  1383
paulson@3715
  1384
*** Syntax ***
paulson@3715
  1385
wenzelm@4174
  1386
* TYPE('a) syntax for type reflection terms;
wenzelm@4174
  1387
wenzelm@3985
  1388
* no longer handles consts with name "" -- declare as 'syntax' instead;
paulson@3856
  1389
paulson@3856
  1390
* pretty printer: changed order of mixfix annotation preference (again!);
wenzelm@3846
  1391
paulson@3715
  1392
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
paulson@3715
  1393
paulson@3715
  1394
paulson@3715
  1395
*** HOL ***
paulson@3715
  1396
wenzelm@5726
  1397
* HOL: there is a new splitter `split_asm_tac' that can be used e.g.
oheimb@4189
  1398
  with `addloop' of the simplifier to faciliate case splitting in premises.
oheimb@4189
  1399
nipkow@4035
  1400
* HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
wenzelm@3985
  1401
wenzelm@3985
  1402
* HOL/Auth: new protocol proofs including some for the Internet
nipkow@4035
  1403
  protocol TLS;
wenzelm@3985
  1404
wenzelm@4125
  1405
* HOL/Map: new theory of `maps' a la VDM;
nipkow@3982
  1406
wenzelm@4335
  1407
* HOL/simplifier: simplification procedures nat_cancel_sums for
wenzelm@4335
  1408
cancelling out common nat summands from =, <, <= (in)equalities, or
wenzelm@4335
  1409
differences; simplification procedures nat_cancel_factor for
wenzelm@4335
  1410
cancelling common factor from =, <, <= (in)equalities over natural
wenzelm@4373
  1411
sums; nat_cancel contains both kinds of procedures, it is installed by
wenzelm@4373
  1412
default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
wenzelm@4335
  1413
nipkow@3580
  1414
* HOL/simplifier: terms of the form
paulson@4325
  1415
  `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)'  (or t=x)
nipkow@3580
  1416
  are rewritten to
nipkow@4035
  1417
  `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
nipkow@4035
  1418
  and those of the form
paulson@4325
  1419
  `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)'  (or t=x)
nipkow@4035
  1420
  are rewritten to
nipkow@4035
  1421
  `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
nipkow@4035
  1422
nipkow@4035
  1423
* HOL/datatype
nipkow@4035
  1424
  Each datatype `t' now comes with a theorem `split_t_case' of the form
nipkow@3580
  1425
nipkow@4035
  1426
  P(t_case f1 ... fn x) =
nipkow@4035
  1427
     ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
nipkow@4035
  1428
        ...
oheimb@4189
  1429
       (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
nipkow@4035
  1430
     )
nipkow@4035
  1431
oheimb@4930
  1432
  and a theorem `split_t_case_asm' of the form
oheimb@4189
  1433
oheimb@4189
  1434
  P(t_case f1 ... fn x) =
oheimb@4189
  1435
    ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
oheimb@4189
  1436
        ...
oheimb@4189
  1437
       (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
oheimb@4189
  1438
     )
oheimb@4930
  1439
  which can be added to a simpset via `addsplits'. The existing theorems
oheimb@4930
  1440
  expand_list_case and expand_option_case have been renamed to
oheimb@4930
  1441
  split_list_case and split_option_case.
oheimb@4189
  1442
nipkow@4361
  1443
* HOL/Arithmetic:
nipkow@4361
  1444
  - `pred n' is automatically converted to `n-1'.
nipkow@4361
  1445
    Users are strongly encouraged not to use `pred' any longer,
nipkow@4361
  1446
    because it will disappear altogether at some point.
nipkow@4361
  1447
  - Users are strongly encouraged to write "0 < n" rather than
nipkow@4361
  1448
    "n ~= 0". Theorems and proof tools have been modified towards this
nipkow@4361
  1449
    `standard'.
nipkow@4357
  1450
nipkow@4502
  1451
* HOL/Lists:
nipkow@4502
  1452
  the function "set_of_list" has been renamed "set" (and its theorems too);
nipkow@4502
  1453
  the function "nth" now takes its arguments in the reverse order and
nipkow@4502
  1454
  has acquired the infix notation "!" as in "xs!n".
paulson@3570
  1455
paulson@4154
  1456
* HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
paulson@4154
  1457
paulson@4154
  1458
* HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
paulson@4154
  1459
  specialist theorems (like UN1_I) are gone.  Similarly for (INT x.B x);
paulson@4154
  1460
wenzelm@4575
  1461
* HOL/record: extensible records with schematic structural subtyping
wenzelm@4575
  1462
(single inheritance); EXPERIMENTAL version demonstrating the encoding,
wenzelm@4575
  1463
still lacks various theorems and concrete record syntax;
wenzelm@4575
  1464
wenzelm@4125
  1465
paulson@3715
  1466
*** HOLCF ***
wenzelm@3535
  1467
wenzelm@4125
  1468
* removed "axioms" and "generated by" sections;
wenzelm@4125
  1469
oheimb@4123
  1470
* replaced "ops" section by extended "consts" section, which is capable of
wenzelm@4125
  1471
  handling the continuous function space "->" directly;
wenzelm@4125
  1472
wenzelm@4125
  1473
* domain package:
wenzelm@4125
  1474
  . proves theorems immediately and stores them in the theory,
wenzelm@4125
  1475
  . creates hierachical name space,
wenzelm@4125
  1476
  . now uses normal mixfix annotations (instead of cinfix...),
wenzelm@4125
  1477
  . minor changes to some names and values (for consistency),
wenzelm@4125
  1478
  . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
wenzelm@4125
  1479
  . separator between mutual domain defs: changed "," to "and",
wenzelm@4125
  1480
  . improved handling of sort constraints;  now they have to
wenzelm@4125
  1481
    appear on the left-hand side of the equations only;
oheimb@4123
  1482
oheimb@4123
  1483
* fixed LAM <x,y,zs>.b syntax;
wenzelm@3567
  1484
wenzelm@3744
  1485
* added extended adm_tac to simplifier in HOLCF -- can now discharge
wenzelm@3744
  1486
adm (%x. P (t x)), where P is chainfinite and t continuous;
wenzelm@3579
  1487
wenzelm@3579
  1488
paulson@3719
  1489
*** FOL and ZF ***
paulson@3719
  1490
wenzelm@5726
  1491
* FOL: there is a new splitter `split_asm_tac' that can be used e.g.
oheimb@4189
  1492
  with `addloop' of the simplifier to faciliate case splitting in premises.
oheimb@4189
  1493
wenzelm@3744
  1494
* qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
wenzelm@3744
  1495
in HOL, they strip ALL and --> from proved theorems;
wenzelm@3744
  1496
paulson@3719
  1497
wenzelm@3579
  1498
wenzelm@3006
  1499
New in Isabelle94-8 (May 1997)
wenzelm@3006
  1500
------------------------------
wenzelm@2654
  1501
paulson@3002
  1502
*** General Changes ***
paulson@3002
  1503
paulson@3002
  1504
* new utilities to build / run / maintain Isabelle etc. (in parts
paulson@3002
  1505
still somewhat experimental); old Makefiles etc. still functional;
wenzelm@2971
  1506
wenzelm@3205
  1507
* new 'Isabelle System Manual';
wenzelm@3205
  1508
wenzelm@2825
  1509
* INSTALL text, together with ./configure and ./build scripts;
wenzelm@2773
  1510
wenzelm@3006
  1511
* reimplemented type inference for greater efficiency, better error
wenzelm@3006
  1512
messages and clean internal interface;
paulson@3002
  1513
paulson@3002
  1514
* prlim command for dealing with lots of subgoals (an easier way of
paulson@3002
  1515
setting goals_limit);
paulson@3002
  1516
wenzelm@3006
  1517
wenzelm@3006
  1518
*** Syntax ***
paulson@3002
  1519
wenzelm@3116
  1520
* supports alternative (named) syntax tables (parser and pretty
wenzelm@3116
  1521
printer); internal interface is provided by add_modesyntax(_i);
wenzelm@3116
  1522
paulson@3002
  1523
* Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
paulson@3002
  1524
be used in conjunction with the Isabelle symbol font; uses the
paulson@3002
  1525
"symbols" syntax table;
paulson@3002
  1526
wenzelm@2705
  1527
* added token_translation interface (may translate name tokens in
wenzelm@2756
  1528
arbitrary ways, dependent on their type (free, bound, tfree, ...) and
wenzelm@3116
  1529
the current print_mode); IMPORTANT: user print translation functions
wenzelm@3116
  1530
are responsible for marking newly introduced bounds
wenzelm@3116
  1531
(Syntax.mark_boundT);
wenzelm@2705
  1532
wenzelm@2730
  1533
* token translations for modes "xterm" and "xterm_color" that display
wenzelm@3006
  1534
names in bold, underline etc. or colors (which requires a color
wenzelm@3006
  1535
version of xterm);
wenzelm@2730
  1536
paulson@3002
  1537
* infixes may now be declared with names independent of their syntax;
paulson@3002
  1538
paulson@3002
  1539
* added typed_print_translation (like print_translation, but may
paulson@3002
  1540
access type of constant);
paulson@3002
  1541
wenzelm@3006
  1542
paulson@3002
  1543
*** Classical Reasoner ***
paulson@3002
  1544
paulson@3002
  1545
Blast_tac: a new tactic!  It is often more powerful than fast_tac, but has
paulson@3002
  1546
some limitations.  Blast_tac...
paulson@3002
  1547
  + ignores addss, addbefore, addafter; this restriction is intrinsic
paulson@3002
  1548
  + ignores elimination rules that don't have the correct format
wenzelm@5726
  1549
        (the conclusion MUST be a formula variable)
paulson@3002
  1550
  + ignores types, which can make HOL proofs fail
paulson@3002
  1551
  + rules must not require higher-order unification, e.g. apply_type in ZF
paulson@3002
  1552
    [message "Function Var's argument not a bound variable" relates to this]
paulson@3002
  1553
  + its proof strategy is more general but can actually be slower
paulson@3002
  1554
wenzelm@3107
  1555
* substitution with equality assumptions no longer permutes other
wenzelm@3107
  1556
assumptions;
paulson@3002
  1557
paulson@3002
  1558
* minor changes in semantics of addafter (now called addaltern); renamed
paulson@3002
  1559
setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
wenzelm@3107
  1560
(and access functions for it);
paulson@3002
  1561
wenzelm@5726
  1562
* improved combination of classical reasoner and simplifier:
oheimb@3317
  1563
  + functions for handling clasimpsets
oheimb@3317
  1564
  + improvement of addss: now the simplifier is called _after_ the
oheimb@3317
  1565
    safe steps.
oheimb@3317
  1566
  + safe variant of addss called addSss: uses safe simplifications
wenzelm@5726
  1567
    _during_ the safe steps. It is more complete as it allows multiple
oheimb@3317
  1568
    instantiations of unknowns (e.g. with slow_tac).
wenzelm@3006
  1569
paulson@3002
  1570
*** Simplifier ***
paulson@3002
  1571
wenzelm@3006
  1572
* added interface for simplification procedures (functions that
wenzelm@3006
  1573
produce *proven* rewrite rules on the fly, depending on current
wenzelm@3006
  1574
redex);
wenzelm@3006
  1575
wenzelm@3006
  1576
* ordering on terms as parameter (used for ordered rewriting);
wenzelm@3006
  1577
wenzelm@3107
  1578
* new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
paulson@3002
  1579
paulson@3002
  1580
* the solver is now split into a safe and an unsafe part.
paulson@3002
  1581
This should be invisible for the normal user, except that the
paulson@3002
  1582
functions setsolver and addsolver have been renamed to setSolver and
wenzelm@3107
  1583
addSolver; added safe_asm_full_simp_tac;
paulson@3002
  1584
paulson@3002
  1585
paulson@3002
  1586
*** HOL ***
paulson@3002
  1587
nipkow@3042
  1588
* a generic induction tactic `induct_tac' which works for all datatypes and
wenzelm@3107
  1589
also for type `nat';
nipkow@3042
  1590
nipkow@3316
  1591
* a generic case distinction tactic `exhaust_tac' which works for all
nipkow@3316
  1592
datatypes and also for type `nat';
nipkow@3316
  1593
nipkow@3316
  1594
* each datatype comes with a function `size';
nipkow@3316
  1595
paulson@3002
  1596
* patterns in case expressions allow tuple patterns as arguments to
wenzelm@3107
  1597
constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
paulson@3002
  1598
paulson@3002
  1599
* primrec now also works with type nat;
paulson@3002
  1600
paulson@3338
  1601
* recdef: a new declaration form, allows general recursive functions to be
paulson@3338
  1602
defined in theory files.  See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
paulson@3338
  1603
paulson@3002
  1604
* the constant for negation has been renamed from "not" to "Not" to
wenzelm@3107
  1605
harmonize with FOL, ZF, LK, etc.;
paulson@3002
  1606
wenzelm@3107
  1607
* HOL/ex/LFilter theory of a corecursive "filter" functional for
wenzelm@3107
  1608
infinite lists;
paulson@3002
  1609
wenzelm@3227
  1610
* HOL/Modelcheck demonstrates invocation of model checker oracle;
wenzelm@3227
  1611
paulson@3002
  1612
* HOL/ex/Ring.thy declares cring_simp, which solves equational
paulson@3002
  1613
problems in commutative rings, using axiomatic type classes for + and *;
paulson@3002
  1614
paulson@3002
  1615
* more examples in HOL/MiniML and HOL/Auth;
paulson@3002
  1616
paulson@3002
  1617
* more default rewrite rules for quantifiers, union/intersection;
paulson@3002
  1618
nipkow@3321
  1619
* a new constant `arbitrary == @x.False';
nipkow@3321
  1620
wenzelm@3107
  1621
* HOLCF/IOA replaces old HOL/IOA;
wenzelm@3107
  1622
wenzelm@5726
  1623
* HOLCF changes: derived all rules and arities
wenzelm@5726
  1624
  + axiomatic type classes instead of classes
slotosch@2653
  1625
  + typedef instead of faking type definitions
paulson@2747
  1626
  + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
wenzelm@2730
  1627
  + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
slotosch@2653
  1628
  + eliminated the types void, one, tr
slotosch@2653
  1629
  + use unit lift and bool lift (with translations) instead of one and tr
slotosch@2653
  1630
  + eliminated blift from Lift3.thy (use Def instead of blift)
wenzelm@3107
  1631
  all eliminated rules are derived as theorems --> no visible changes ;
oheimb@2649
  1632
wenzelm@3006
  1633
paulson@3002
  1634
*** ZF ***
wenzelm@2553
  1635
paulson@2865
  1636
* ZF now has Fast_tac, Simp_tac and Auto_tac.  Union_iff is a now a default
paulson@2865
  1637
rewrite rule; this may affect some proofs.  eq_cs is gone but can be put back
paulson@2865
  1638
as ZF_cs addSIs [equalityI];
wenzelm@2553
  1639
wenzelm@2554
  1640
wenzelm@2732
  1641
wenzelm@2553
  1642
New in Isabelle94-7 (November 96)
wenzelm@2553
  1643
---------------------------------
wenzelm@2553
  1644
wenzelm@2553
  1645
* allowing negative levels (as offsets) in prlev and choplev;
wenzelm@2553
  1646
wenzelm@2554
  1647
* super-linear speedup for large simplifications;
wenzelm@2554
  1648
wenzelm@2554
  1649
* FOL, ZF and HOL now use miniscoping: rewriting pushes
wenzelm@2554
  1650
quantifications in as far as possible (COULD MAKE EXISTING PROOFS
wenzelm@2554
  1651
FAIL); can suppress it using the command Delsimps (ex_simps @
wenzelm@2554
  1652
all_simps); De Morgan laws are also now included, by default;
wenzelm@2554
  1653
wenzelm@2554
  1654
* improved printing of ==>  :  ~:
wenzelm@2554
  1655
wenzelm@2554
  1656
* new object-logic "Sequents" adds linear logic, while replacing LK
wenzelm@2554
  1657
and Modal (thanks to Sara Kalvala);
wenzelm@2554
  1658
wenzelm@2554
  1659
* HOL/Auth: correctness proofs for authentication protocols;
wenzelm@2554
  1660
wenzelm@2554
  1661
* HOL: new auto_tac combines rewriting and classical reasoning (many
wenzelm@2554
  1662
examples on HOL/Auth);
wenzelm@2554
  1663
wenzelm@2554
  1664
* HOL: new command AddIffs for declaring theorems of the form P=Q to
wenzelm@2554
  1665
the rewriter and classical reasoner simultaneously;
wenzelm@2554
  1666
wenzelm@2554
  1667
* function uresult no longer returns theorems in "standard" format;
wenzelm@2554
  1668
regain previous version by: val uresult = standard o uresult;
wenzelm@2554
  1669
wenzelm@2554
  1670
wenzelm@2554
  1671
wenzelm@2554
  1672
New in Isabelle94-6
wenzelm@2554
  1673
-------------------
wenzelm@2554
  1674
wenzelm@2554
  1675
* oracles -- these establish an interface between Isabelle and trusted
wenzelm@2554
  1676
external reasoners, which may deliver results as theorems;
wenzelm@2554
  1677
wenzelm@2554
  1678
* proof objects (in particular record all uses of oracles);
wenzelm@2554
  1679
wenzelm@2554
  1680
* Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
wenzelm@2554
  1681
wenzelm@2554
  1682
* "constdefs" section in theory files;
wenzelm@2554
  1683
wenzelm@2554
  1684
* "primrec" section (HOL) no longer requires names;
wenzelm@2554
  1685
wenzelm@2554
  1686
* internal type "tactic" now simply "thm -> thm Sequence.seq";
wenzelm@2554
  1687
wenzelm@2554
  1688
wenzelm@2554
  1689
wenzelm@2554
  1690
New in Isabelle94-5
wenzelm@2554
  1691
-------------------
wenzelm@2554
  1692
wenzelm@2554
  1693
* reduced space requirements;
wenzelm@2554
  1694
wenzelm@2554
  1695
* automatic HTML generation from theories;
wenzelm@2554
  1696
wenzelm@2554
  1697
* theory files no longer require "..." (quotes) around most types;
wenzelm@2554
  1698
wenzelm@2554
  1699
* new examples, including two proofs of the Church-Rosser theorem;
wenzelm@2554
  1700
wenzelm@2554
  1701
* non-curried (1994) version of HOL is no longer distributed;
wenzelm@2554
  1702
wenzelm@2553
  1703
paulson@2557
  1704
paulson@2557
  1705
New in Isabelle94-4
paulson@2557
  1706
-------------------
paulson@2557
  1707
paulson@2747
  1708
* greatly reduced space requirements;
paulson@2557
  1709
paulson@2557
  1710
* theory files (.thy) no longer require \...\ escapes at line breaks;
paulson@2557
  1711
wenzelm@5726
  1712
* searchable theorem database (see the section "Retrieving theorems" on
paulson@2557
  1713
page 8 of the Reference Manual);
paulson@2557
  1714
paulson@2557
  1715
* new examples, including Grabczewski's monumental case study of the
paulson@2557
  1716
Axiom of Choice;
paulson@2557
  1717
paulson@2557
  1718
* The previous version of HOL renamed to Old_HOL;
paulson@2557
  1719
wenzelm@5726
  1720
* The new version of HOL (previously called CHOL) uses a curried syntax
paulson@2557
  1721
for functions.  Application looks like f a b instead of f(a,b);
paulson@2557
  1722
paulson@2557
  1723
* Mutually recursive inductive definitions finally work in HOL;
paulson@2557
  1724
paulson@2557
  1725
* In ZF, pattern-matching on tuples is now available in all abstractions and
paulson@2557
  1726
translates to the operator "split";
paulson@2557
  1727
paulson@2557
  1728
paulson@2557
  1729
paulson@2557
  1730
New in Isabelle94-3
paulson@2557
  1731
-------------------
paulson@2557
  1732
wenzelm@5726
  1733
* new infix operator, addss, allowing the classical reasoner to
paulson@2557
  1734
perform simplification at each step of its search.  Example:
wenzelm@5726
  1735
        fast_tac (cs addss ss)
paulson@2557
  1736
wenzelm@5726
  1737
* a new logic, CHOL, the same as HOL, but with a curried syntax
wenzelm@5726
  1738
for functions.  Application looks like f a b instead of f(a,b).  Also pairs
paulson@2557
  1739
look like (a,b) instead of <a,b>;
paulson@2557
  1740
paulson@2557
  1741
* PLEASE NOTE: CHOL will eventually replace HOL!
paulson@2557
  1742
paulson@2557
  1743
* In CHOL, pattern-matching on tuples is now available in all abstractions.
paulson@2557
  1744
It translates to the operator "split".  A new theory of integers is available;
paulson@2557
  1745
paulson@2557
  1746
* In ZF, integer numerals now denote two's-complement binary integers.
paulson@2557
  1747
Arithmetic operations can be performed by rewriting.  See ZF/ex/Bin.ML;
paulson@2557
  1748
wenzelm@5726
  1749
* Many new examples: I/O automata, Church-Rosser theorem, equivalents
paulson@2557
  1750
of the Axiom of Choice;
paulson@2557
  1751
paulson@2557
  1752
paulson@2557
  1753
paulson@2557
  1754
New in Isabelle94-2
paulson@2557
  1755
-------------------
paulson@2557
  1756
wenzelm@5726
  1757
* Significantly faster resolution;
paulson@2557
  1758
paulson@2557
  1759
* the different sections in a .thy file can now be mixed and repeated
paulson@2557
  1760
freely;
paulson@2557
  1761
paulson@2557
  1762
* Database of theorems for FOL, HOL and ZF.  New
paulson@2557
  1763
commands including qed, qed_goal and bind_thm store theorems in the database.
paulson@2557
  1764
paulson@2557
  1765
* Simple database queries: return a named theorem (get_thm) or all theorems of
paulson@2557
  1766
a given theory (thms_of), or find out what theory a theorem was proved in
paulson@2557
  1767
(theory_of_thm);
paulson@2557
  1768
paulson@2557
  1769
* Bugs fixed in the inductive definition and datatype packages;
paulson@2557
  1770
paulson@2557
  1771
* The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
paulson@2557
  1772
and HOL_dup_cs obsolete;
paulson@2557
  1773
paulson@2557
  1774
* Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
paulson@2557
  1775
have been removed;
paulson@2557
  1776
paulson@2557
  1777
* Simpler definition of function space in ZF;
paulson@2557
  1778
paulson@2557
  1779
* new results about cardinal and ordinal arithmetic in ZF;
paulson@2557
  1780
paulson@2557
  1781
* 'subtype' facility in HOL for introducing new types as subsets of existing
paulson@2557
  1782
types;
paulson@2557
  1783
paulson@2557
  1784
wenzelm@2553
  1785
$Id$