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