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