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