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