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