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