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