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