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