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