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