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