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