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