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