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