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