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