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