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