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