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