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