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