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