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