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