NEWS
author paulson
Fri Jun 24 17:25:10 2005 +0200 (2005-06-24)
changeset 16563 a92f96951355
parent 16547 09f7a953d2d6
child 16662 0836569a8ffc
permissions -rw-r--r--
meson method taking an argument list
wenzelm@5363
     1
Isabelle NEWS -- history user-relevant changes
wenzelm@5363
     2
==============================================
wenzelm@2553
     3
wenzelm@14655
     4
New in this Isabelle release
wenzelm@14655
     5
----------------------------
wenzelm@14655
     6
wenzelm@14655
     7
*** General ***
wenzelm@14655
     8
nipkow@15130
     9
* Theory headers: the new header syntax for Isar theories is
nipkow@15130
    10
nipkow@15130
    11
  theory <name>
wenzelm@16234
    12
  imports <theory1> ... <theoryN>
wenzelm@16234
    13
  uses <file1> ... <fileM>
nipkow@15130
    14
  begin
nipkow@15130
    15
wenzelm@16234
    16
where the 'uses' part is optional.  The previous syntax
wenzelm@16234
    17
wenzelm@16234
    18
  theory <name> = <theory1> + ... + <theoryN>:
wenzelm@16234
    19
wenzelm@16234
    20
will disappear in the next release.  Note that there is no change in
wenzelm@16234
    21
ancient non-Isar theories.
nipkow@15130
    22
berghofe@15475
    23
* Theory loader: parent theories can now also be referred to via
wenzelm@16234
    24
relative and absolute paths.
wenzelm@16234
    25
wenzelm@16234
    26
* Improved version of thms_containing searches for a list of criteria
wenzelm@16234
    27
instead of a list of constants. Known criteria are: intro, elim, dest,
wenzelm@16234
    28
name:string, simp:term, and any term. Criteria can be preceded by '-'
wenzelm@16234
    29
to select theorems that do not match. Intro, elim, dest select
wenzelm@16234
    30
theorems that match the current goal, name:s selects theorems whose
wenzelm@16234
    31
fully qualified name contain s, and simp:term selects all
wenzelm@16234
    32
simplification rules whose lhs match term.  Any other term is
wenzelm@16234
    33
interpreted as pattern and selects all theorems matching the
wenzelm@16234
    34
pattern. Available in ProofGeneral under 'ProofGeneral -> Find
wenzelm@16234
    35
Theorems' or C-c C-f.  Example:
wenzelm@16234
    36
wenzelm@16234
    37
  C-c C-f (100) "(_::nat) + _ + _" intro -name:"HOL."
wenzelm@16234
    38
wenzelm@16234
    39
prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
wenzelm@16234
    40
matching the current goal as introduction rule and not having "HOL."
wenzelm@16234
    41
in their name (i.e. not being defined in theory HOL).
wenzelm@16013
    42
wenzelm@15703
    43
wenzelm@15703
    44
*** Document preparation ***
wenzelm@15703
    45
wenzelm@16234
    46
* Commands 'display_drafts' and 'print_drafts' perform simple output
wenzelm@16234
    47
of raw sources.  Only those symbols that do not require additional
wenzelm@16234
    48
LaTeX packages (depending on comments in isabellesym.sty) are
wenzelm@16234
    49
displayed properly, everything else is left verbatim.  isatool display
wenzelm@16234
    50
and isatool print are used as front ends (these are subject to the
wenzelm@16234
    51
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
wenzelm@16234
    52
wenzelm@16234
    53
* There is now a flag to control hiding of proofs and some other
wenzelm@16234
    54
commands (such as 'ML' or 'parse/print_translation') in document
wenzelm@16234
    55
output.  Hiding is enabled by default, and can be disabled by the
wenzelm@16234
    56
option '-H false' of isatool usedir or by resetting the reference
wenzelm@16234
    57
variable IsarOutput.hide_commands in ML.  Additional commands to be
wenzelm@16234
    58
hidden may be declared using IsarOutput.add_hidden_commands.
wenzelm@16234
    59
wenzelm@15979
    60
* Several new antiquotation:
wenzelm@15979
    61
wenzelm@15979
    62
  @{term_type term} prints a term with its type annotated;
wenzelm@15979
    63
wenzelm@15979
    64
  @{typeof term} prints the type of a term;
wenzelm@15979
    65
wenzelm@16234
    66
  @{const const} is the same as @{term const}, but checks that the
wenzelm@16234
    67
  argument is a known logical constant;
wenzelm@15979
    68
wenzelm@15979
    69
  @{term_style style term} and @{thm_style style thm} print a term or
wenzelm@16234
    70
  theorem applying a "style" to it
wenzelm@16234
    71
wenzelm@16234
    72
Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
wenzelm@16234
    73
definitions, equations, inequations etc., 'concl' printing only the
wenzelm@16234
    74
conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem9'
wenzelm@16234
    75
to print the specified premise.  TermStyle.add_style provides an ML
wenzelm@16234
    76
interface for introducing further styles.  See also the "LaTeX Sugar"
wenzelm@16234
    77
document practical applications.
wenzelm@16234
    78
wenzelm@16234
    79
wenzelm@16234
    80
*** Pure ***
wenzelm@16234
    81
wenzelm@16234
    82
* Considerably improved version of 'constdefs' command.  Now performs
wenzelm@16234
    83
automatic type-inference of declared constants; additional support for
wenzelm@16234
    84
local structure declarations (cf. locales and HOL records), see also
wenzelm@16234
    85
isar-ref manual.  Potential INCOMPATIBILITY: need to observe strictly
wenzelm@16234
    86
sequential dependencies of definitions within a single 'constdefs'
wenzelm@16234
    87
section; moreover, the declared name needs to be an identifier.  If
wenzelm@16234
    88
all fails, consider to fall back on 'consts' and 'defs' separately.
wenzelm@16234
    89
wenzelm@16234
    90
* Improved indexed syntax and implicit structures.  First of all,
wenzelm@16234
    91
indexed syntax provides a notational device for subscripted
wenzelm@16234
    92
application, using the new syntax \<^bsub>term\<^esub> for arbitrary
wenzelm@16234
    93
expressions.  Secondly, in a local context with structure
wenzelm@16234
    94
declarations, number indexes \<^sub>n or the empty index (default
wenzelm@16234
    95
number 1) refer to a certain fixed variable implicitly; option
wenzelm@16234
    96
show_structs controls printing of implicit structures.  Typical
wenzelm@16234
    97
applications of these concepts involve record types and locales.
wenzelm@16234
    98
wenzelm@16234
    99
* New command 'no_syntax' removes grammar declarations (and
wenzelm@16234
   100
translations) resulting from the given syntax specification, which is
wenzelm@16234
   101
interpreted in the same manner as for the 'syntax' command.
wenzelm@16234
   102
wenzelm@16234
   103
* 'Advanced' translation functions (parse_translation etc.) may depend
wenzelm@16234
   104
on the signature of the theory context being presently used for
wenzelm@16234
   105
parsing/printing, see also isar-ref manual.
wenzelm@16234
   106
wenzelm@16234
   107
* Improved internal renaming of symbolic identifiers -- attach primes
wenzelm@16234
   108
instead of base 26 numbers.
wenzelm@16234
   109
wenzelm@16234
   110
* New flag show_question_marks controls printing of leading question
wenzelm@16234
   111
marks in schematic variable names.
wenzelm@16234
   112
wenzelm@16234
   113
* In schematic variable names, *any* symbol following \<^isub> or
wenzelm@16234
   114
\<^isup> is now treated as part of the base name.  For example, the
wenzelm@16234
   115
following works without printing of awkward ".0" indexes:
wenzelm@16234
   116
wenzelm@16234
   117
  lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
wenzelm@16234
   118
    by simp
wenzelm@16234
   119
wenzelm@16234
   120
* Inner syntax includes (*(*nested*) comments*).
wenzelm@16234
   121
wenzelm@16234
   122
* Pretty pinter now supports unbreakable blocks, specified in mixfix
wenzelm@16234
   123
annotations as "(00...)".
wenzelm@16234
   124
wenzelm@16234
   125
* Clear separation of logical types and nonterminals, where the latter
wenzelm@16234
   126
may only occur in 'syntax' specifications or type abbreviations.
wenzelm@16234
   127
Before that distinction was only partially implemented via type class
wenzelm@16234
   128
"logic" vs. "{}".  Potential INCOMPATIBILITY in rare cases of improper
wenzelm@16234
   129
use of 'types'/'consts' instead of 'nonterminals'/'syntax'.  Some very
wenzelm@16234
   130
exotic syntax specifications may require further adaption
wenzelm@16234
   131
(e.g. Cube/Base.thy).
wenzelm@16234
   132
wenzelm@16234
   133
* Removed obsolete type class "logic", use the top sort {} instead.
wenzelm@16234
   134
Note that non-logical types should be declared as 'nonterminals'
wenzelm@16234
   135
rather than 'types'.  INCOMPATIBILITY for new object-logic
wenzelm@16234
   136
specifications.
wenzelm@16234
   137
wenzelm@16234
   138
* Simplifier: can now control the depth to which conditional rewriting
wenzelm@16234
   139
is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
wenzelm@16234
   140
Limit.
wenzelm@16234
   141
wenzelm@16234
   142
* Simplifier: simplification procedures may now take the current
wenzelm@16234
   143
simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
wenzelm@16234
   144
interface), which is very useful for calling the Simplifier
wenzelm@16234
   145
recursively.  Minor INCOMPATIBILITY: the 'prems' argument of simprocs
wenzelm@16234
   146
is gone -- use prems_of_ss on the simpset instead.  Moreover, the
wenzelm@16234
   147
low-level mk_simproc no longer applies Logic.varify internally, to
wenzelm@16234
   148
allow for use in a context of fixed variables.
wenzelm@16234
   149
wenzelm@16234
   150
* thin_tac now works even if the assumption being deleted contains !!
wenzelm@16234
   151
or ==>.  More generally, erule now works even if the major premise of
wenzelm@16234
   152
the elimination rule contains !! or ==>.
wenzelm@16234
   153
wenzelm@16234
   154
* Reorganized bootstrapping of the Pure theories; CPure is now derived
wenzelm@16234
   155
from Pure, which contains all common declarations already.  Both
wenzelm@16234
   156
theories are defined via plain Isabelle/Isar .thy files.
wenzelm@16234
   157
INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
wenzelm@16234
   158
CPure.elim / CPure.dest attributes) now appear in the Pure name space;
wenzelm@16234
   159
use isatool fixcpure to adapt your theory and ML sources.
wenzelm@16234
   160
wenzelm@16234
   161
* New syntax 'name(i-j, i-, i, ...)' for referring to specific
wenzelm@16234
   162
selections of theorems in named facts via index ranges.
wenzelm@16234
   163
wenzelm@16506
   164
* More efficient treatment of intermediate checkpoints in interactive
wenzelm@16506
   165
theory development.
wenzelm@16506
   166
wenzelm@16234
   167
wenzelm@16234
   168
*** Locales ***
wenzelm@16234
   169
  
wenzelm@16234
   170
* New commands for the interpretation of locale expressions in
wenzelm@16234
   171
theories ('interpretation') and proof contexts ('interpret').  These
wenzelm@16234
   172
take an instantiation of the locale parameters and compute proof
wenzelm@16234
   173
obligations from the instantiated specification.  After the
wenzelm@16234
   174
obligations have been discharged, the instantiated theorems of the
wenzelm@16234
   175
locale are added to the theory or proof context.  Interpretation is
wenzelm@16234
   176
smart in that already active interpretations do not occur in proof
wenzelm@16234
   177
obligations, neither are instantiated theorems stored in duplicate.
wenzelm@16234
   178
Use print_interps to inspect active interpretations of a particular
wenzelm@16234
   179
locale.  For details, see the Isar Reference manual.
wenzelm@16234
   180
wenzelm@16234
   181
INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
wenzelm@16234
   182
'interpret' instead.
wenzelm@16234
   183
wenzelm@16234
   184
* Proper static binding of attribute syntax -- i.e. types / terms /
wenzelm@16234
   185
facts mentioned as arguments are always those of the locale definition
wenzelm@16234
   186
context, independently of the context of later invocations.  Moreover,
wenzelm@16234
   187
locale operations (renaming and type / term instantiation) are applied
wenzelm@16234
   188
to attribute arguments as expected.
wenzelm@16234
   189
wenzelm@16234
   190
INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
wenzelm@16234
   191
actual attributes; rare situations may require Attrib.attribute to
wenzelm@16234
   192
embed those attributes into Attrib.src that lack concrete syntax.
wenzelm@16234
   193
Attribute implementations need to cooperate properly with the static
wenzelm@16234
   194
binding mechanism.  Basic parsers Args.XXX_typ/term/prop and
wenzelm@16234
   195
Attrib.XXX_thm etc. already do the right thing without further
wenzelm@16234
   196
intervention.  Only unusual applications -- such as "where" or "of"
wenzelm@16234
   197
(cf. src/Pure/Isar/attrib.ML), which process arguments depending both
wenzelm@16234
   198
on the context and the facts involved -- may have to assign parsed
wenzelm@16234
   199
values to argument tokens explicitly.
wenzelm@16234
   200
wenzelm@16234
   201
* New context element "constrains" adds type constraints to parameters --
wenzelm@16234
   202
there is no logical significance.
wenzelm@16234
   203
wenzelm@16234
   204
* Context expressions: renaming parameters permits syntax
wenzelm@16234
   205
redeclaration as well.
wenzelm@16234
   206
wenzelm@16234
   207
* Locale definition: 'includes' now disallowed.
wenzelm@16234
   208
wenzelm@16234
   209
* Changed parameter management in theorem generation for long goal
wenzelm@16234
   210
statements with 'includes'.  INCOMPATIBILITY: produces a different
wenzelm@16234
   211
theorem statement in rare situations.
wenzelm@16234
   212
wenzelm@16234
   213
* Attributes 'induct' and 'cases': type or set names may now be
wenzelm@16234
   214
locally fixed variables as well.
wenzelm@15703
   215
wenzelm@15703
   216
* Antiquotations now provide the option 'locale=NAME' to specify an
wenzelm@16234
   217
alternative context used for evaluating and printing the subsequent
wenzelm@16234
   218
argument, as in @{thm [locale=LC] fold_commute}, for example.
wenzelm@16234
   219
wenzelm@16234
   220
wenzelm@16234
   221
*** Provers ***
wenzelm@16234
   222
wenzelm@16234
   223
* Provers/hypsubst.ML: improved version of the subst method, for
wenzelm@16234
   224
single-step rewriting: it now works in bound variable contexts. New is
wenzelm@16234
   225
'subst (asm)', for rewriting an assumption.  INCOMPATIBILITY: may
wenzelm@16234
   226
rewrite a different subterm than the original subst method, which is
wenzelm@16234
   227
still available as 'simplesubst'.
wenzelm@16234
   228
wenzelm@16234
   229
* Provers/quasi.ML: new transitivity reasoners for transitivity only
wenzelm@16234
   230
and quasi orders.
wenzelm@16234
   231
wenzelm@16234
   232
* Provers/trancl.ML: new transitivity reasoner for transitive and
wenzelm@16234
   233
reflexive-transitive closure of relations.
wenzelm@16234
   234
wenzelm@16234
   235
* Provers/blast.ML: new reference depth_limit to make blast's depth
wenzelm@16234
   236
limit (previously hard-coded with a value of 20) user-definable.
wenzelm@16234
   237
wenzelm@16234
   238
* Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
wenzelm@16234
   239
is peformed already.  Object-logics merely need to finish their
wenzelm@16234
   240
initial simpset configuration as before.  INCOMPATIBILITY.
wenzelm@15703
   241
berghofe@15475
   242
schirmer@14700
   243
*** HOL ***
schirmer@14700
   244
wenzelm@16234
   245
* Symbolic syntax of Hilbert Choice Operator is now as follows:
wenzelm@14878
   246
wenzelm@14878
   247
  syntax (epsilon)
wenzelm@14878
   248
    "_Eps" :: "[pttrn, bool] => 'a"    ("(3\<some>_./ _)" [0, 10] 10)
wenzelm@14878
   249
wenzelm@16234
   250
The symbol \<some> is displayed as the alternative epsilon of LaTeX
wenzelm@16234
   251
and x-symbol; use option '-m epsilon' to get it actually printed.
wenzelm@16234
   252
Moreover, the mathematically important symbolic identifier \<epsilon>
wenzelm@16234
   253
becomes available as variable, constant etc.  INCOMPATIBILITY,
wenzelm@16234
   254
wenzelm@16234
   255
* "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
wenzelm@16234
   256
Similarly for all quantifiers: "ALL x > y" etc.  The x-symbol for >=
wenzelm@16234
   257
is \<ge>.
wenzelm@16234
   258
wenzelm@16234
   259
* "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
wenzelm@16234
   260
instead of ":".
wenzelm@16234
   261
wenzelm@16234
   262
* theory SetInterval: changed the syntax for open intervals:
wenzelm@16234
   263
wenzelm@16234
   264
  Old       New
wenzelm@16234
   265
  {..n(}    {..<n}
wenzelm@16234
   266
  {)n..}    {n<..}
wenzelm@16234
   267
  {m..n(}   {m..<n}
wenzelm@16234
   268
  {)m..n}   {m<..n}
wenzelm@16234
   269
  {)m..n(}  {m<..<n}
wenzelm@16234
   270
wenzelm@16234
   271
The old syntax is still supported but will disappear in the next
wenzelm@16234
   272
release.  For conversion use the following Emacs search and replace
wenzelm@16234
   273
patterns (these are not perfect but work quite well):
nipkow@15046
   274
nipkow@15046
   275
  {)\([^\.]*\)\.\.  ->  {\1<\.\.}
nipkow@15046
   276
  \.\.\([^(}]*\)(}  ->  \.\.<\1}
nipkow@15046
   277
wenzelm@16234
   278
* theory Finite_Set: changed the syntax for 'setsum', summation over
wenzelm@16234
   279
finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
wenzelm@16234
   280
now either "SUM x:A. e" or "\<Sum>x \<in> A. e".
wenzelm@16234
   281
wenzelm@16234
   282
Some new syntax forms are available:
wenzelm@16234
   283
wenzelm@16234
   284
  "\<Sum>x | P. e"      for     "setsum (%x. e) {x. P}"
wenzelm@16234
   285
  "\<Sum>x = a..b. e"   for     "setsum (%x. e) {a..b}"
wenzelm@16234
   286
  "\<Sum>x = a..<b. e"  for     "setsum (%x. e) {a..<b}"
wenzelm@16234
   287
  "\<Sum>x < k. e"      for     "setsum (%x. e) {..<k}"
wenzelm@16234
   288
wenzelm@16234
   289
The latter form "\<Sum>x < k. e" used to be based on a separate
wenzelm@16234
   290
function "Summation", which has been discontinued.
wenzelm@16234
   291
wenzelm@16234
   292
* theory Finite_Set: in structured induction proofs, the insert case
wenzelm@16234
   293
is now 'case (insert x F)' instead of the old counterintuitive 'case
wenzelm@16234
   294
(insert F x)'.
wenzelm@16234
   295
wenzelm@16234
   296
* The 'refute' command has been extended to support a much larger
wenzelm@16234
   297
fragment of HOL, including axiomatic type classes, constdefs and
wenzelm@16234
   298
typedefs, inductive datatypes and recursion.
wenzelm@16234
   299
wenzelm@16234
   300
* Datatype induction via method 'induct' now preserves the name of the
wenzelm@16234
   301
induction variable. For example, when proving P(xs::'a list) by
wenzelm@16234
   302
induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
wenzelm@16234
   303
than P(list) ==> P(a#list) as previously.  Potential INCOMPATIBILITY
wenzelm@16234
   304
in unstructured proof scripts.
wenzelm@16234
   305
wenzelm@16234
   306
* Reworked implementation of records.  Improved scalability for
wenzelm@16234
   307
records with many fields, avoiding performance problems for type
wenzelm@16234
   308
inference. Records are no longer composed of nested field types, but
wenzelm@16234
   309
of nested extension types. Therefore the record type only grows linear
wenzelm@16234
   310
in the number of extensions and not in the number of fields.  The
wenzelm@16234
   311
top-level (users) view on records is preserved.  Potential
wenzelm@16234
   312
INCOMPATIBILITY only in strange cases, where the theory depends on the
wenzelm@16234
   313
old record representation. The type generated for a record is called
wenzelm@16234
   314
<record_name>_ext_type.
wenzelm@16234
   315
wenzelm@16234
   316
Flag record_quick_and_dirty_sensitive can be enabled to skip the
wenzelm@16234
   317
proofs triggered by a record definition or a simproc (if
wenzelm@16234
   318
quick_and_dirty is enabled).  Definitions of large records can take
wenzelm@16234
   319
quite long.
wenzelm@16234
   320
wenzelm@16234
   321
New simproc record_upd_simproc for simplification of multiple record
wenzelm@16234
   322
updates enabled by default.  Moreover, trivial updates are also
wenzelm@16234
   323
removed: r(|x := x r|) = r.  INCOMPATIBILITY: old proofs break
wenzelm@16234
   324
occasionally, since simplification is more powerful by default.
wenzelm@16234
   325
wenzelm@16234
   326
* Simplifier: automatically reasons about transitivity chains
wenzelm@16234
   327
involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
wenzelm@16234
   328
provided by Provers/trancl.ML as additional solvers.  INCOMPATIBILITY:
wenzelm@16234
   329
old proofs break occasionally as simplification may now solve more
wenzelm@16234
   330
goals than previously.
wenzelm@16234
   331
wenzelm@16234
   332
* Simplifier: converts x <= y into x = y if assumption y <= x is
wenzelm@16234
   333
present.  Works for all partial orders (class "order"), in particular
wenzelm@16234
   334
numbers and sets.  For linear orders (e.g. numbers) it treats ~ x < y
wenzelm@16234
   335
just like y <= x.
wenzelm@16234
   336
wenzelm@16234
   337
* Simplifier: new simproc for "let x = a in f x".  If a is a free or
wenzelm@16234
   338
bound variable or a constant then the let is unfolded.  Otherwise
wenzelm@16234
   339
first a is simplified to b, and then f b is simplified to g. If
wenzelm@16234
   340
possible we abstract b from g arriving at "let x = b in h x",
wenzelm@16234
   341
otherwise we unfold the let and arrive at g.  The simproc can be
wenzelm@16234
   342
enabled/disabled by the reference use_let_simproc.  Potential
wenzelm@16234
   343
INCOMPATIBILITY since simplification is more powerful by default.
webertj@15776
   344
paulson@16563
   345
* Classical reasoning: the meson method now accepts theorems as arguments.
paulson@16563
   346
wenzelm@14655
   347
wenzelm@14682
   348
*** HOLCF ***
wenzelm@14682
   349
wenzelm@14682
   350
* HOLCF: discontinued special version of 'constdefs' (which used to
wenzelm@16234
   351
support continuous functions) in favor of the general Pure one with
wenzelm@16234
   352
full type-inference.
wenzelm@14682
   353
wenzelm@14682
   354
paulson@14885
   355
*** ZF ***
paulson@14885
   356
wenzelm@16234
   357
* ZF/ex: theories Group and Ring provide examples in abstract algebra,
wenzelm@16234
   358
including the First Isomorphism Theorem (on quotienting by the kernel
wenzelm@16234
   359
of a homomorphism).
wenzelm@15089
   360
wenzelm@15089
   361
* ZF/Simplifier: install second copy of type solver that actually
wenzelm@16234
   362
makes use of TC rules declared to Isar proof contexts (or locales);
wenzelm@16234
   363
the old version is still required for ML proof scripts.
wenzelm@15703
   364
wenzelm@15703
   365
wenzelm@15703
   366
*** ML ***
wenzelm@15703
   367
wenzelm@15973
   368
* Pure/library.ML no longer defines its own option datatype, but uses
wenzelm@16234
   369
that of the SML basis, which has constructors NONE and SOME instead of
wenzelm@16234
   370
None and Some, as well as exception Option.Option instead of OPTION.
wenzelm@16234
   371
The functions the, if_none, is_some, is_none have been adapted
wenzelm@16234
   372
accordingly, while Option.map replaces apsome.
wenzelm@15973
   373
wenzelm@16151
   374
* The exception LIST has been given up in favour of the standard
wenzelm@16234
   375
exceptions Empty and Subscript, as well as Library.UnequalLengths.
wenzelm@16234
   376
Function like Library.hd and Library.tl are superceded by the standard
wenzelm@16234
   377
hd and tl functions etc.
wenzelm@16234
   378
wenzelm@16234
   379
A number of basic functions are now no longer exported to the ML
wenzelm@16234
   380
toplevel, as they are variants of standard functions.  The following
wenzelm@16234
   381
suggests how one can translate existing code:
wenzelm@15973
   382
wenzelm@15973
   383
    rev_append xs ys = List.revAppend (xs, ys)
wenzelm@15973
   384
    nth_elem (i, xs) = List.nth (xs, i)
wenzelm@15973
   385
    last_elem xs = List.last xs
wenzelm@15973
   386
    flat xss = List.concat xss
wenzelm@16234
   387
    seq fs = List.app fs
wenzelm@15973
   388
    partition P xs = List.partition P xs
wenzelm@15973
   389
    filter P xs = List.filter P xs
wenzelm@15973
   390
    mapfilter f xs = List.mapPartial f xs
wenzelm@15973
   391
wenzelm@15703
   392
* Pure: output via the Isabelle channels of writeln/warning/error
wenzelm@16234
   393
etc. is now passed through Output.output, with a hook for arbitrary
wenzelm@16234
   394
transformations depending on the print_mode (cf. Output.add_mode --
wenzelm@16234
   395
the first active mode that provides a output function wins).  Already
wenzelm@16234
   396
formatted output may be embedded into further text via Output.raw; the
wenzelm@16234
   397
result of Pretty.string_of/str_of and derived functions
wenzelm@16234
   398
(string_of_term/cterm/thm etc.) is already marked raw to accommodate
wenzelm@16234
   399
easy composition of diagnostic messages etc.  Programmers rarely need
wenzelm@16234
   400
to care about Output.output or Output.raw at all, with some notable
wenzelm@16234
   401
exceptions: Output.output is required when bypassing the standard
wenzelm@16234
   402
channels (writeln etc.), or in token translations to produce properly
wenzelm@16234
   403
formatted results; Output.raw is required when capturing already
wenzelm@16234
   404
output material that will eventually be presented to the user a second
wenzelm@16234
   405
time.  For the default print mode, both Output.output and Output.raw
wenzelm@16234
   406
have no effect.
wenzelm@16234
   407
wenzelm@16234
   408
* Pure: print_tac now outputs the goal through the trace channel.
wenzelm@16234
   409
wenzelm@16234
   410
* Isar debugging: new reference Toplevel.debug; default false.  Set to
wenzelm@16234
   411
make printing of exceptions THM, TERM, TYPE and THEORY more verbose.
wenzelm@15703
   412
wenzelm@16151
   413
* Pure: name spaces have been refined, with significant changes of the
wenzelm@16234
   414
internal interfaces -- INCOMPATIBILITY.  Renamed cond_extern(_table)
wenzelm@16234
   415
to extern(_table).  The plain name entry path is superceded by a
wenzelm@16234
   416
general 'naming' context, which also includes the 'policy' to produce
wenzelm@16234
   417
a fully qualified name and external accesses of a fully qualified
wenzelm@16234
   418
name; NameSpace.extend is superceded by context dependent
wenzelm@16234
   419
Sign.declare_name.  Several theory and proof context operations modify
wenzelm@16234
   420
the naming context.  Especially note Theory.restore_naming and
wenzelm@16234
   421
ProofContext.restore_naming to get back to a sane state; note that
wenzelm@16234
   422
Theory.add_path is no longer sufficient to recover from
wenzelm@16234
   423
Theory.absolute_path in particular.
wenzelm@16234
   424
wenzelm@16234
   425
* Pure: new flags short_names (default false) and unique_names
wenzelm@16234
   426
(default true) for controlling output of qualified names.  If
wenzelm@16234
   427
short_names is set, names are printed unqualified.  If unique_names is
wenzelm@16234
   428
reset, the name prefix is reduced to the minimum required to achieve
wenzelm@16234
   429
the original result when interning again, even if there is an overlap
wenzelm@16234
   430
with earlier declarations.
wenzelm@16151
   431
wenzelm@16456
   432
* Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
wenzelm@16456
   433
now 'extend', and 'merge' gets an additional Pretty.pp argument
wenzelm@16456
   434
(useful for printing error messages).  INCOMPATIBILITY.
wenzelm@16456
   435
wenzelm@16456
   436
* Pure: major reorganization of the theory context.  Type Sign.sg and
wenzelm@16456
   437
Theory.theory are now identified, referring to the universal
wenzelm@16456
   438
Context.theory (see Pure/context.ML).  Actual signature and theory
wenzelm@16456
   439
content is managed as theory data.  The old code and interfaces were
wenzelm@16456
   440
spread over many files and structures; the new arrangement introduces
wenzelm@16456
   441
considerable INCOMPATIBILITY to gain more clarity:
wenzelm@16456
   442
wenzelm@16456
   443
  Context -- theory management operations (name, identity, inclusion,
wenzelm@16456
   444
    parents, ancestors, merge, etc.), plus generic theory data;
wenzelm@16456
   445
wenzelm@16456
   446
  Sign -- logical signature and syntax operations (declaring consts,
wenzelm@16456
   447
    types, etc.), plus certify/read for common entities;
wenzelm@16456
   448
wenzelm@16456
   449
  Theory -- logical theory operations (stating axioms, definitions,
wenzelm@16456
   450
    oracles), plus a copy of logical signature operations (consts,
wenzelm@16456
   451
    types, etc.); also a few basic management operations (Theory.copy,
wenzelm@16456
   452
    Theory.merge, etc.)
wenzelm@16456
   453
wenzelm@16456
   454
The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
wenzelm@16456
   455
etc.) as well as the sign field in Thm.rep_thm etc. have been retained
wenzelm@16456
   456
for convenience -- they merely return the theory.
wenzelm@16456
   457
wenzelm@16547
   458
* Pure: the Isar proof context type is already defined early in Pure
wenzelm@16547
   459
as Context.proof (note that ProofContext.context and Proof.context are
wenzelm@16547
   460
aliases, where the latter is the preferred name).  This enables other
wenzelm@16547
   461
Isabelle components to refer to that type even before Isar is present.
wenzelm@16547
   462
wenzelm@16373
   463
* Pure/sign/theory: discontinued named name spaces (i.e. classK,
wenzelm@16373
   464
typeK, constK, axiomK, oracleK), but provide explicit operations for
wenzelm@16373
   465
any of these kinds.  For example, Sign.intern typeK is now
wenzelm@16373
   466
Sign.intern_type, Theory.hide_space Sign.typeK is now
wenzelm@16373
   467
Theory.hide_types.  Also note that former
wenzelm@16373
   468
Theory.hide_classes/types/consts are now
wenzelm@16373
   469
Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
wenzelm@16373
   470
internalize their arguments!  INCOMPATIBILITY.
wenzelm@16373
   471
wenzelm@16506
   472
* Pure: get_thm interface (of PureThy and ProofContext) expects
wenzelm@16506
   473
datatype thmref (with constructors Name and NameSelection) instead of
wenzelm@16506
   474
plain string -- INCOMPATIBILITY;
wenzelm@16506
   475
wenzelm@16151
   476
* Pure: cases produced by proof methods specify options, where NONE
wenzelm@16234
   477
means to remove case bindings -- INCOMPATIBILITY in
wenzelm@16234
   478
(RAW_)METHOD_CASES.
wenzelm@16151
   479
wenzelm@16373
   480
* Pure: the following operations retrieve axioms or theorems from a
wenzelm@16373
   481
theory node or theory hierarchy, respectively:
wenzelm@16373
   482
wenzelm@16373
   483
  Theory.axioms_of: theory -> (string * term) list
wenzelm@16373
   484
  Theory.all_axioms_of: theory -> (string * term) list
wenzelm@16373
   485
  PureThy.thms_of: theory -> (string * thm) list
wenzelm@16373
   486
  PureThy.all_thms_of: theory -> (string * thm) list
wenzelm@16373
   487
wenzelm@15703
   488
* Provers: Simplifier and Classical Reasoner now support proof context
wenzelm@16234
   489
dependent plug-ins (simprocs, solvers, wrappers etc.).  These extra
wenzelm@16234
   490
components are stored in the theory and patched into the
wenzelm@16234
   491
simpset/claset when used in an Isar proof context.  Context dependent
wenzelm@16234
   492
components are maintained by the following theory operations:
wenzelm@16234
   493
wenzelm@16234
   494
  Simplifier.add_context_simprocs
wenzelm@16234
   495
  Simplifier.del_context_simprocs
wenzelm@16234
   496
  Simplifier.set_context_subgoaler
wenzelm@16234
   497
  Simplifier.reset_context_subgoaler
wenzelm@16234
   498
  Simplifier.add_context_looper
wenzelm@16234
   499
  Simplifier.del_context_looper
wenzelm@16234
   500
  Simplifier.add_context_unsafe_solver
wenzelm@16234
   501
  Simplifier.add_context_safe_solver
wenzelm@16234
   502
wenzelm@16234
   503
  Classical.add_context_safe_wrapper
wenzelm@16234
   504
  Classical.del_context_safe_wrapper
wenzelm@16234
   505
  Classical.add_context_unsafe_wrapper
wenzelm@16234
   506
  Classical.del_context_unsafe_wrapper
wenzelm@16234
   507
wenzelm@16234
   508
IMPORTANT NOTE: proof tools (methods etc.) need to use
wenzelm@16234
   509
local_simpset_of and local_claset_of to instead of the primitive
wenzelm@16234
   510
Simplifier.get_local_simpset and Classical.get_local_claset,
wenzelm@16234
   511
respectively, in order to see the context dependent fields!
wenzelm@16234
   512
wenzelm@16251
   513
* File.sysify_path and File.quote_sysify path have been replaced by
wenzelm@16251
   514
File.platform_path and File.shell_path (with appropriate hooks).  This
wenzelm@16251
   515
provides a clean interface for unusual systems where the internal and
wenzelm@16251
   516
external process view of file names are different.
wenzelm@16251
   517
wenzelm@16234
   518
wenzelm@16234
   519
*** System ***
wenzelm@16234
   520
wenzelm@16234
   521
* Allow symlinks to all proper Isabelle executables (Isabelle,
wenzelm@16234
   522
isabelle, isatool etc.).
wenzelm@16234
   523
wenzelm@16234
   524
* ISABELLE_DOC_FORMAT setting specifies preferred document format (for
wenzelm@16234
   525
isatool doc, isatool mkdir, display_drafts etc.).
wenzelm@16234
   526
wenzelm@16234
   527
* isatool usedir: option -f allows specification of the ML file to be
wenzelm@16234
   528
used by Isabelle; default is ROOT.ML.
wenzelm@16234
   529
wenzelm@16251
   530
* New isatool version outputs the version identifier of the Isabelle
wenzelm@16251
   531
distribution being used.
wenzelm@16251
   532
wenzelm@16251
   533
* HOL: new isatool dimacs2hol converts files in DIMACS CNF format
wenzelm@16234
   534
(containing Boolean satisfiability problems) into Isabelle/HOL
wenzelm@16234
   535
theories.
wenzelm@15703
   536
wenzelm@15703
   537
wenzelm@14655
   538
wenzelm@14606
   539
New in Isabelle2004 (April 2004)
wenzelm@14606
   540
--------------------------------
wenzelm@13280
   541
skalberg@14171
   542
*** General ***
skalberg@14171
   543
ballarin@14398
   544
* Provers/order.ML:  new efficient reasoner for partial and linear orders.
ballarin@14398
   545
  Replaces linorder.ML.
ballarin@14398
   546
wenzelm@14606
   547
* Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
wenzelm@14606
   548
  (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
skalberg@14173
   549
  (\<a>...\<z>), are now considered normal letters, and can therefore
skalberg@14173
   550
  be used anywhere where an ASCII letter (a...zA...Z) has until
skalberg@14173
   551
  now. COMPATIBILITY: This obviously changes the parsing of some
skalberg@14173
   552
  terms, especially where a symbol has been used as a binder, say
skalberg@14173
   553
  '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
skalberg@14173
   554
  as an identifier.  Fix it by inserting a space around former
skalberg@14173
   555
  symbols.  Call 'isatool fixgreek' to try to fix parsing errors in
skalberg@14173
   556
  existing theory and ML files.
skalberg@14171
   557
paulson@14237
   558
* Pure: Macintosh and Windows line-breaks are now allowed in theory files.
paulson@14237
   559
wenzelm@14731
   560
* Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
wenzelm@14731
   561
  allowed in identifiers. Similar to Greek letters \<^isub> is now considered
wenzelm@14731
   562
  a normal (but invisible) letter. For multiple letter subscripts repeat
wenzelm@14731
   563
  \<^isub> like this: x\<^isub>1\<^isub>2.
kleing@14233
   564
kleing@14333
   565
* Pure: There are now sub-/superscripts that can span more than one
kleing@14333
   566
  character. Text between \<^bsub> and \<^esub> is set in subscript in
wenzelm@14606
   567
  ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
wenzelm@14606
   568
  superscript. The new control characters are not identifier parts.
kleing@14333
   569
schirmer@14561
   570
* Pure: Control-symbols of the form \<^raw:...> will literally print the
wenzelm@14606
   571
  content of "..." to the latex file instead of \isacntrl... . The "..."
wenzelm@14606
   572
  may consist of any printable characters excluding the end bracket >.
schirmer@14361
   573
paulson@14237
   574
* Pure: Using new Isar command "finalconsts" (or the ML functions
paulson@14237
   575
  Theory.add_finals or Theory.add_finals_i) it is now possible to
paulson@14237
   576
  declare constants "final", which prevents their being given a definition
paulson@14237
   577
  later.  It is useful for constants whose behaviour is fixed axiomatically
skalberg@14224
   578
  rather than definitionally, such as the meta-logic connectives.
skalberg@14224
   579
wenzelm@14606
   580
* Pure: 'instance' now handles general arities with general sorts
wenzelm@14606
   581
  (i.e. intersections of classes),
skalberg@14503
   582
kleing@14547
   583
* Presentation: generated HTML now uses a CSS style sheet to make layout
wenzelm@14731
   584
  (somewhat) independent of content. It is copied from lib/html/isabelle.css.
kleing@14547
   585
  It can be changed to alter the colors/layout of generated pages.
kleing@14547
   586
wenzelm@14556
   587
ballarin@14175
   588
*** Isar ***
ballarin@14175
   589
ballarin@14508
   590
* Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
ballarin@14508
   591
  cut_tac, subgoal_tac and thin_tac:
ballarin@14175
   592
  - Now understand static (Isar) contexts.  As a consequence, users of Isar
ballarin@14175
   593
    locales are no longer forced to write Isar proof scripts.
ballarin@14175
   594
    For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
ballarin@14175
   595
    emulations.
ballarin@14175
   596
  - INCOMPATIBILITY: names of variables to be instantiated may no
ballarin@14211
   597
    longer be enclosed in quotes.  Instead, precede variable name with `?'.
ballarin@14211
   598
    This is consistent with the instantiation attribute "where".
ballarin@14211
   599
ballarin@14257
   600
* Attributes "where" and "of":
ballarin@14285
   601
  - Now take type variables of instantiated theorem into account when reading
ballarin@14285
   602
    the instantiation string.  This fixes a bug that caused instantiated
ballarin@14285
   603
    theorems to have too special types in some circumstances.
ballarin@14285
   604
  - "where" permits explicit instantiations of type variables.
ballarin@14257
   605
wenzelm@14556
   606
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm@14556
   607
  current facts ("this"), admitting arbitrary combinations with "then"
wenzelm@14556
   608
  and derived forms.
kleing@14283
   609
ballarin@14211
   610
* Locales:
ballarin@14211
   611
  - Goal statements involving the context element "includes" no longer
ballarin@14211
   612
    generate theorems with internal delta predicates (those ending on
ballarin@14211
   613
    "_axioms") in the premise.
ballarin@14211
   614
    Resolve particular premise with <locale>.intro to obtain old form.
ballarin@14211
   615
  - Fixed bug in type inference ("unify_frozen") that prevented mix of target
ballarin@14211
   616
    specification and "includes" elements in goal statement.
ballarin@14254
   617
  - Rule sets <locale>.intro and <locale>.axioms no longer declared as
ballarin@14254
   618
    [intro?] and [elim?] (respectively) by default.
ballarin@14508
   619
  - Experimental command for instantiation of locales in proof contexts:
ballarin@14551
   620
        instantiate <label>[<attrs>]: <loc>
ballarin@14508
   621
    Instantiates locale <loc> and adds all its theorems to the current context
ballarin@14551
   622
    taking into account their attributes.  Label and attrs are optional
ballarin@14551
   623
    modifiers, like in theorem declarations.  If present, names of
ballarin@14551
   624
    instantiated theorems are qualified with <label>, and the attributes
ballarin@14551
   625
    <attrs> are applied after any attributes these theorems might have already.
ballarin@14551
   626
      If the locale has assumptions, a chained fact of the form
ballarin@14508
   627
    "<loc> t1 ... tn" is expected from which instantiations of the parameters
ballarin@14551
   628
    are derived.  The command does not support old-style locales declared
ballarin@14551
   629
    with "locale (open)".
ballarin@14551
   630
      A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
ballarin@14175
   631
ballarin@14175
   632
* HOL: Tactic emulation methods induct_tac and case_tac understand static
ballarin@14175
   633
  (Isar) contexts.
ballarin@14175
   634
wenzelm@14556
   635
kleing@14136
   636
*** HOL ***
kleing@14136
   637
kleing@14624
   638
* Proof import: new image HOL4 contains the imported library from
kleing@14624
   639
  the HOL4 system with about 2500 theorems. It is imported by
kleing@14624
   640
  replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
kleing@14624
   641
  can be used like any other Isabelle image.  See
kleing@14624
   642
  HOL/Import/HOL/README for more information.
kleing@14624
   643
ballarin@14398
   644
* Simplifier:
ballarin@14398
   645
  - Much improved handling of linear and partial orders.
ballarin@14398
   646
    Reasoners for linear and partial orders are set up for type classes
ballarin@14398
   647
    "linorder" and "order" respectively, and are added to the default simpset
ballarin@14398
   648
    as solvers.  This means that the simplifier can build transitivity chains
ballarin@14398
   649
    to solve goals from the assumptions.
ballarin@14398
   650
  - INCOMPATIBILITY: old proofs break occasionally.  Typically, applications
ballarin@14398
   651
    of blast or auto after simplification become unnecessary because the goal
ballarin@14398
   652
    is solved by simplification already.
ballarin@14398
   653
wenzelm@14731
   654
* Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
paulson@14389
   655
    all proved in axiomatic type classes for semirings, rings and fields.
paulson@14389
   656
paulson@14389
   657
* Numerics:
paulson@14389
   658
  - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
wenzelm@14731
   659
    now formalized using the Ring_and_Field theory mentioned above.
paulson@14389
   660
  - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
paulson@14389
   661
    than before, because now they are set up once in a generic manner.
wenzelm@14731
   662
  - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
paulson@14480
   663
    Look for the general versions in Ring_and_Field (and Power if they concern
paulson@14480
   664
    exponentiation).
paulson@14389
   665
paulson@14401
   666
* Type "rat" of the rational numbers is now available in HOL-Complex.
paulson@14389
   667
schirmer@14255
   668
* Records:
schirmer@14255
   669
  - Record types are now by default printed with their type abbreviation
schirmer@14255
   670
    instead of the list of all field types. This can be configured via
schirmer@14255
   671
    the reference "print_record_type_abbr".
wenzelm@14731
   672
  - Simproc "record_upd_simproc" for simplification of multiple updates added
schirmer@14255
   673
    (not enabled by default).
schirmer@14427
   674
  - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
schirmer@14427
   675
    EX x. x = sel r to True (not enabled by default).
schirmer@14255
   676
  - Tactic "record_split_simp_tac" to split and simplify records added.
wenzelm@14731
   677
kleing@14136
   678
* 'specification' command added, allowing for definition by
skalberg@14224
   679
  specification.  There is also an 'ax_specification' command that
skalberg@14224
   680
  introduces the new constants axiomatically.
kleing@14136
   681
nipkow@14375
   682
* arith(_tac) is now able to generate counterexamples for reals as well.
nipkow@14375
   683
ballarin@14399
   684
* HOL-Algebra: new locale "ring" for non-commutative rings.
ballarin@14399
   685
paulson@14243
   686
* HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
kleing@14610
   687
  definitions, thanks to Sava Krsti\'{c} and John Matthews.
kleing@14610
   688
wenzelm@14731
   689
* HOL-Matrix: a first theory for matrices in HOL with an application of
kleing@14610
   690
  matrix theory to linear programming.
kleing@14136
   691
nipkow@14380
   692
* Unions and Intersections:
nipkow@15119
   693
  The latex output syntax of UN and INT has been changed
nipkow@15119
   694
  from "\Union x \in A. B" to "\Union_{x \in A} B"
nipkow@15119
   695
  i.e. the index formulae has become a subscript.
nipkow@15119
   696
  Similarly for "\Union x. B", and for \Inter instead of \Union.
nipkow@14380
   697
kleing@14418
   698
* Unions and Intersections over Intervals:
wenzelm@14731
   699
  There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
wenzelm@14731
   700
  also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
kleing@14418
   701
  like in normal math, and corresponding versions for < and for intersection.
kleing@14418
   702
nipkow@15677
   703
* HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
nipkow@15677
   704
  lexicographic dictonary ordering has been added as "lexord".
nipkow@15677
   705
paulson@14401
   706
* ML: the legacy theory structures Int and List have been removed. They had
paulson@14401
   707
  conflicted with ML Basis Library structures having the same names.
nipkow@14380
   708
webertj@14464
   709
* 'refute' command added to search for (finite) countermodels.  Only works
webertj@14464
   710
  for a fragment of HOL.  The installation of an external SAT solver is
webertj@14464
   711
  highly recommended.  See "HOL/Refute.thy" for details.
webertj@14464
   712
berghofe@14602
   713
* 'quickcheck' command: Allows to find counterexamples by evaluating
berghofe@14602
   714
  formulae under an assignment of free variables to random values.
berghofe@14602
   715
  In contrast to 'refute', it can deal with inductive datatypes,
berghofe@14602
   716
  but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
berghofe@14602
   717
  for examples.
webertj@14464
   718
wenzelm@14606
   719
oheimb@14536
   720
*** HOLCF ***
oheimb@14536
   721
oheimb@14536
   722
* Streams now come with concatenation and are part of the HOLCF image
oheimb@14536
   723
wenzelm@14572
   724
wenzelm@14572
   725
kleing@14136
   726
New in Isabelle2003 (May 2003)
wenzelm@14606
   727
------------------------------
kleing@14136
   728
wenzelm@13280
   729
*** General ***
wenzelm@13280
   730
berghofe@13618
   731
* Provers/simplifier:
berghofe@13618
   732
nipkow@13781
   733
  - Completely reimplemented method simp (ML: Asm_full_simp_tac):
berghofe@13618
   734
    Assumptions are now subject to complete mutual simplification,
berghofe@13618
   735
    not just from left to right. The simplifier now preserves
berghofe@13618
   736
    the order of assumptions.
berghofe@13618
   737
berghofe@13618
   738
    Potential INCOMPATIBILITY:
berghofe@13618
   739
nipkow@13781
   740
    -- simp sometimes diverges where the old version did
nipkow@13781
   741
       not, e.g. invoking simp on the goal
berghofe@13618
   742
berghofe@13618
   743
        [| P (f x); y = x; f x = f y |] ==> Q
berghofe@13618
   744
nipkow@13781
   745
       now gives rise to the infinite reduction sequence
nipkow@13781
   746
nipkow@13781
   747
        P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
nipkow@13781
   748
nipkow@13781
   749
       Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
nipkow@13781
   750
       kind of problem.
nipkow@13781
   751
nipkow@13781
   752
    -- Tactics combining classical reasoner and simplification (such as auto)
nipkow@13781
   753
       are also affected by this change, because many of them rely on
nipkow@13781
   754
       simp. They may sometimes diverge as well or yield a different numbers
nipkow@13781
   755
       of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
nipkow@13781
   756
       in case of problems. Sometimes subsequent calls to the classical
nipkow@13781
   757
       reasoner will fail because a preceeding call to the simplifier too
nipkow@13781
   758
       eagerly simplified the goal, e.g. deleted redundant premises.
berghofe@13618
   759
berghofe@13618
   760
  - The simplifier trace now shows the names of the applied rewrite rules
berghofe@13618
   761
nipkow@13829
   762
  - You can limit the number of recursive invocations of the simplifier
nipkow@13829
   763
    during conditional rewriting (where the simplifie tries to solve the
nipkow@13829
   764
    conditions before applying the rewrite rule):
nipkow@13829
   765
    ML "simp_depth_limit := n"
nipkow@13829
   766
    where n is an integer. Thus you can force termination where previously
nipkow@13829
   767
    the simplifier would diverge.
nipkow@13829
   768
ballarin@13835
   769
  - Accepts free variables as head terms in congruence rules.  Useful in Isar.
nipkow@13829
   770
ballarin@13938
   771
  - No longer aborts on failed congruence proof.  Instead, the
ballarin@13938
   772
    congruence is ignored.
ballarin@13938
   773
berghofe@14008
   774
* Pure: New generic framework for extracting programs from constructive
berghofe@14008
   775
  proofs. See HOL/Extraction.thy for an example instantiation, as well
berghofe@14008
   776
  as HOL/Extraction for some case studies.
berghofe@14008
   777
nipkow@13868
   778
* Pure: The main goal of the proof state is no longer shown by default, only
nipkow@13868
   779
the subgoals. This behaviour is controlled by a new flag.
ballarin@13835
   780
   PG menu: Isabelle/Isar -> Settings -> Show Main Goal
nipkow@13815
   781
(ML: Proof.show_main_goal).
nipkow@13815
   782
nipkow@13815
   783
* Pure: You can find all matching introduction rules for subgoal 1, i.e. all
nipkow@13815
   784
rules whose conclusion matches subgoal 1:
nipkow@13815
   785
      PG menu: Isabelle/Isar -> Show me -> matching rules
nipkow@13815
   786
The rules are ordered by how closely they match the subgoal.
nipkow@13815
   787
In particular, rules that solve a subgoal outright are displayed first
nipkow@13815
   788
(or rather last, the way they are printed).
nipkow@13815
   789
(ML: ProofGeneral.print_intros())
nipkow@13815
   790
nipkow@13815
   791
* Pure: New flag trace_unify_fail causes unification to print
nipkow@13781
   792
diagnostic information (PG: in trace buffer) when it fails. This is
nipkow@13781
   793
useful for figuring out why single step proofs like rule, erule or
nipkow@13781
   794
assumption failed.
nipkow@13781
   795
nipkow@13815
   796
* Pure: Locale specifications now produce predicate definitions
wenzelm@13410
   797
according to the body of text (covering assumptions modulo local
wenzelm@13410
   798
definitions); predicate "loc_axioms" covers newly introduced text,
wenzelm@13410
   799
while "loc" is cumulative wrt. all included locale expressions; the
wenzelm@13410
   800
latter view is presented only on export into the global theory
wenzelm@13410
   801
context; potential INCOMPATIBILITY, use "(open)" option to fall back
wenzelm@13410
   802
on the old view without predicates;
wenzelm@13410
   803
wenzelm@13459
   804
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm@13459
   805
parameters (as in CASL, for example); just specify something like
wenzelm@13459
   806
``var x + var y + struct M'' as import;
wenzelm@13459
   807
wenzelm@13463
   808
* Pure: improved thms_containing: proper indexing of facts instead of
wenzelm@13463
   809
raw theorems; check validity of results wrt. current name space;
wenzelm@13463
   810
include local facts of proof configuration (also covers active
wenzelm@13541
   811
locales), cover fixed variables in index; may use "_" in term
wenzelm@13541
   812
specification; an optional limit for the number of printed facts may
wenzelm@13541
   813
be given (the default is 40);
wenzelm@13541
   814
wenzelm@13541
   815
* Pure: disallow duplicate fact bindings within new-style theory files
wenzelm@13541
   816
(batch-mode only);
wenzelm@13540
   817
wenzelm@13463
   818
* Provers: improved induct method: assumptions introduced by case
wenzelm@13463
   819
"foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
wenzelm@13463
   820
the goal statement); "foo" still refers to all facts collectively;
wenzelm@13463
   821
paulson@13550
   822
* Provers: the function blast.overloaded has been removed: all constants
paulson@13550
   823
are regarded as potentially overloaded, which improves robustness in exchange
paulson@13550
   824
for slight decrease in efficiency;
paulson@13550
   825
nipkow@13781
   826
* Provers/linorder: New generic prover for transitivity reasoning over
nipkow@13781
   827
linear orders.  Note: this prover is not efficient!
nipkow@13781
   828
wenzelm@13522
   829
* Isar: preview of problems to finish 'show' now produce an error
wenzelm@13522
   830
rather than just a warning (in interactive mode);
wenzelm@13522
   831
wenzelm@13280
   832
nipkow@13158
   833
*** HOL ***
nipkow@13158
   834
nipkow@13899
   835
* arith(_tac)
nipkow@13899
   836
nipkow@13899
   837
 - Produces a counter example if it cannot prove a goal.
nipkow@13899
   838
   Note that the counter example may be spurious if the goal is not a formula
nipkow@13899
   839
   of quantifier-free linear arithmetic.
nipkow@13899
   840
   In ProofGeneral the counter example appears in the trace buffer.
nipkow@13899
   841
nipkow@13899
   842
 - Knows about div k and mod k where k is a numeral of type nat or int.
nipkow@13899
   843
nipkow@13899
   844
 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
nipkow@13899
   845
   linear arithmetic fails. This takes account of quantifiers and divisibility.
wenzelm@14731
   846
   Presburger arithmetic can also be called explicitly via presburger(_tac).
nipkow@13899
   847
nipkow@13899
   848
* simp's arithmetic capabilities have been enhanced a bit: it now
nipkow@13899
   849
takes ~= in premises into account (by performing a case split);
nipkow@13899
   850
nipkow@13899
   851
* simp reduces "m*(n div m) + n mod m" to n, even if the two summands
nipkow@13899
   852
are distributed over a sum of terms;
nipkow@13899
   853
ballarin@13735
   854
* New tactic "trans_tac" and method "trans" instantiate
ballarin@13735
   855
Provers/linorder.ML for axclasses "order" and "linorder" (predicates
wenzelm@14731
   856
"<=", "<" and "=").
wenzelm@14731
   857
wenzelm@14731
   858
* function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
paulson@13587
   859
HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
paulson@13587
   860
wenzelm@13443
   861
* 'typedef' command has new option "open" to suppress the set
wenzelm@13443
   862
definition;
wenzelm@13443
   863
wenzelm@13522
   864
* functions Min and Max on finite sets have been introduced (theory
wenzelm@13522
   865
Finite_Set);
nipkow@13492
   866
wenzelm@13443
   867
* attribute [symmetric] now works for relations as well; it turns
wenzelm@13443
   868
(x,y) : R^-1 into (y,x) : R, and vice versa;
wenzelm@13443
   869
nipkow@13613
   870
* induct over a !!-quantified statement (say !!x1..xn):
nipkow@13613
   871
  each "case" automatically performs "fix x1 .. xn" with exactly those names.
nipkow@13613
   872
nipkow@13899
   873
* Map: `empty' is no longer a constant but a syntactic abbreviation for
nipkow@13899
   874
%x. None. Warning: empty_def now refers to the previously hidden definition
nipkow@13899
   875
of the empty set.
nipkow@13899
   876
ballarin@14018
   877
* Algebra: formalization of classical algebra.  Intended as base for
ballarin@14018
   878
any algebraic development in Isabelle.  Currently covers group theory
ballarin@14018
   879
(up to Sylow's theorem) and ring theory (Universal Property of
ballarin@14018
   880
Univariate Polynomials).  Contributions welcome;
paulson@13960
   881
paulson@13960
   882
* GroupTheory: deleted, since its material has been moved to Algebra;
paulson@13960
   883
wenzelm@14731
   884
* Complex: new directory of the complex numbers with numeric constants,
wenzelm@14731
   885
nonstandard complex numbers, and some complex analysis, standard and
paulson@13966
   886
nonstandard (Jacques Fleuriot);
paulson@13966
   887
paulson@13966
   888
* HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
paulson@13966
   889
wenzelm@14731
   890
* Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
paulson@13966
   891
Fleuriot);
paulson@13960
   892
wenzelm@13549
   893
* Real/HahnBanach: updated and adapted to locales;
wenzelm@13549
   894
ballarin@13995
   895
* NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
ballarin@13995
   896
Gray and Kramer);
paulson@13872
   897
paulson@13872
   898
* UNITY: added the Meier-Sanders theory of progress sets;
paulson@13872
   899
kleing@14011
   900
* MicroJava: bytecode verifier and lightweight bytecode verifier
kleing@14011
   901
as abstract algorithms, instantiated to the JVM;
kleing@14011
   902
schirmer@14010
   903
* Bali: Java source language formalization. Type system, operational
schirmer@14010
   904
semantics, axiomatic semantics. Supported language features:
schirmer@14010
   905
classes, interfaces, objects,virtual methods, static methods,
schirmer@14010
   906
static/instance fields, arrays, access modifiers, definite
schirmer@14010
   907
assignment, exceptions.
wenzelm@13549
   908
kleing@14011
   909
wenzelm@13549
   910
*** ZF ***
wenzelm@13549
   911
webertj@15154
   912
* ZF/Constructible: consistency proof for AC (Gdel's constructible
wenzelm@13549
   913
universe, etc.);
wenzelm@13549
   914
paulson@13872
   915
* Main ZF: virtually all theories converted to new-style format;
nipkow@13518
   916
wenzelm@13280
   917
wenzelm@13478
   918
*** ML ***
wenzelm@13478
   919
wenzelm@13478
   920
* Pure: Tactic.prove provides sane interface for internal proofs;
wenzelm@13478
   921
omits the infamous "standard" operation, so this is more appropriate
wenzelm@13478
   922
than prove_goalw_cterm in many situations (e.g. in simprocs);
wenzelm@13478
   923
wenzelm@13478
   924
* Pure: improved error reporting of simprocs;
wenzelm@13478
   925
wenzelm@13478
   926
* Provers: Simplifier.simproc(_i) provides sane interface for setting
wenzelm@13478
   927
up simprocs;
wenzelm@13478
   928
wenzelm@13478
   929
kleing@13953
   930
*** Document preparation ***
kleing@13953
   931
kleing@13953
   932
* uses \par instead of \\ for line breaks in theory text. This may
kleing@13953
   933
shift some page breaks in large documents. To get the old behaviour
kleing@13953
   934
use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
kleing@13953
   935
wenzelm@14731
   936
* minimized dependencies of isabelle.sty and isabellesym.sty on
kleing@13953
   937
other packages
kleing@13953
   938
kleing@13953
   939
* \<euro> now needs package babel/greek instead of marvosym (which
kleing@13953
   940
broke \Rightarrow)
kleing@13953
   941
wenzelm@14731
   942
* normal size for \<zero>...\<nine> (uses \mathbf instead of
kleing@13954
   943
textcomp package)
kleing@13953
   944
wenzelm@13280
   945
wenzelm@14572
   946
wenzelm@12984
   947
New in Isabelle2002 (March 2002)
wenzelm@12984
   948
--------------------------------
wenzelm@11474
   949
wenzelm@11572
   950
*** Document preparation ***
wenzelm@11572
   951
wenzelm@11842
   952
* greatly simplified document preparation setup, including more
wenzelm@11842
   953
graceful interpretation of isatool usedir -i/-d/-D options, and more
wenzelm@11842
   954
instructive isatool mkdir; users should basically be able to get
wenzelm@12899
   955
started with "isatool mkdir HOL Test && isatool make"; alternatively,
wenzelm@12899
   956
users may run a separate document processing stage manually like this:
wenzelm@12899
   957
"isatool usedir -D output HOL Test && isatool document Test/output";
wenzelm@11842
   958
wenzelm@11842
   959
* theory dependency graph may now be incorporated into documents;
wenzelm@11842
   960
isatool usedir -g true will produce session_graph.eps/.pdf for use
wenzelm@11842
   961
with \includegraphics of LaTeX;
wenzelm@11842
   962
wenzelm@11864
   963
* proper spacing of consecutive markup elements, especially text
wenzelm@11864
   964
blocks after section headings;
wenzelm@11864
   965
wenzelm@11572
   966
* support bold style (for single symbols only), input syntax is like
wenzelm@11572
   967
this: "\<^bold>\<alpha>" or "\<^bold>A";
wenzelm@11572
   968
wenzelm@11814
   969
* \<bullet> is now output as bold \cdot by default, which looks much
wenzelm@11572
   970
better in printed text;
wenzelm@11572
   971
wenzelm@11712
   972
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm@11712
   973
note that these symbols are currently unavailable in Proof General /
wenzelm@12769
   974
X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
wenzelm@12690
   975
wenzelm@12690
   976
* isatool latex no longer depends on changed TEXINPUTS, instead
wenzelm@12690
   977
isatool document copies the Isabelle style files to the target
wenzelm@12690
   978
location;
wenzelm@11712
   979
wenzelm@11572
   980
wenzelm@11633
   981
*** Isar ***
wenzelm@11633
   982
wenzelm@12312
   983
* Pure/Provers: improved proof by cases and induction;
wenzelm@12280
   984
  - 'case' command admits impromptu naming of parameters (such as
wenzelm@12280
   985
    "case (Suc n)");
wenzelm@12280
   986
  - 'induct' method divinates rule instantiation from the inductive
wenzelm@12280
   987
    claim; no longer requires excessive ?P bindings for proper
wenzelm@12280
   988
    instantiation of cases;
wenzelm@12280
   989
  - 'induct' method properly enumerates all possibilities of set/type
wenzelm@12280
   990
    rules; as a consequence facts may be also passed through *type*
wenzelm@12280
   991
    rules without further ado;
wenzelm@12280
   992
  - 'induct' method now derives symbolic cases from the *rulified*
wenzelm@12280
   993
    rule (before it used to rulify cases stemming from the internal
wenzelm@12280
   994
    atomized version); this means that the context of a non-atomic
wenzelm@12280
   995
    statement becomes is included in the hypothesis, avoiding the
wenzelm@12280
   996
    slightly cumbersome show "PROP ?case" form;
wenzelm@12280
   997
  - 'induct' may now use elim-style induction rules without chaining
wenzelm@12280
   998
    facts, using ``missing'' premises from the goal state; this allows
wenzelm@12280
   999
    rules stemming from inductive sets to be applied in unstructured
wenzelm@12280
  1000
    scripts, while still benefitting from proper handling of non-atomic
wenzelm@12280
  1001
    statements; NB: major inductive premises need to be put first, all
wenzelm@12280
  1002
    the rest of the goal is passed through the induction;
wenzelm@12280
  1003
  - 'induct' proper support for mutual induction involving non-atomic
wenzelm@12280
  1004
    rule statements (uses the new concept of simultaneous goals, see
wenzelm@12280
  1005
    below);
wenzelm@12853
  1006
  - append all possible rule selections, but only use the first
wenzelm@12853
  1007
    success (no backtracking);
wenzelm@11995
  1008
  - removed obsolete "(simplified)" and "(stripped)" options of methods;
wenzelm@12754
  1009
  - undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm@12754
  1010
  - added 'print_induct_rules' (covered by help item in recent Proof
wenzelm@12754
  1011
    General versions);
wenzelm@11995
  1012
  - moved induct/cases attributes to Pure, methods to Provers;
wenzelm@11995
  1013
  - generic method setup instantiated for FOL and HOL;
wenzelm@11986
  1014
wenzelm@12163
  1015
* Pure: support multiple simultaneous goal statements, for example
wenzelm@12163
  1016
"have a: A and b: B" (same for 'theorem' etc.); being a pure
wenzelm@12163
  1017
meta-level mechanism, this acts as if several individual goals had
wenzelm@12163
  1018
been stated separately; in particular common proof methods need to be
wenzelm@12163
  1019
repeated in order to cover all claims; note that a single elimination
wenzelm@12163
  1020
step is *not* sufficient to establish the two conjunctions, so this
wenzelm@12163
  1021
fails:
wenzelm@12163
  1022
wenzelm@12163
  1023
  assume "A & B" then have A and B ..   (*".." fails*)
wenzelm@12163
  1024
wenzelm@12163
  1025
better use "obtain" in situations as above; alternative refer to
wenzelm@12163
  1026
multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
wenzelm@12163
  1027
wenzelm@12078
  1028
* Pure: proper integration with ``locales''; unlike the original
webertj@15154
  1029
version by Florian Kammller, Isar locales package high-level proof
wenzelm@12078
  1030
contexts rather than raw logical ones (e.g. we admit to include
wenzelm@12280
  1031
attributes everywhere); operations on locales include merge and
wenzelm@12964
  1032
rename; support for implicit arguments (``structures''); simultaneous
wenzelm@12964
  1033
type-inference over imports and text; see also HOL/ex/Locales.thy for
wenzelm@12964
  1034
some examples;
wenzelm@12078
  1035
wenzelm@12707
  1036
* Pure: the following commands have been ``localized'', supporting a
wenzelm@12707
  1037
target locale specification "(in name)": 'lemma', 'theorem',
wenzelm@12707
  1038
'corollary', 'lemmas', 'theorems', 'declare'; the results will be
wenzelm@12707
  1039
stored both within the locale and at the theory level (exported and
wenzelm@12707
  1040
qualified by the locale name);
wenzelm@12707
  1041
wenzelm@12964
  1042
* Pure: theory goals may now be specified in ``long'' form, with
wenzelm@12964
  1043
ad-hoc contexts consisting of arbitrary locale elements. for example
wenzelm@12964
  1044
``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
wenzelm@12964
  1045
definitions may be given, too); the result is a meta-level rule with
wenzelm@12964
  1046
the context elements being discharged in the obvious way;
wenzelm@12964
  1047
wenzelm@12964
  1048
* Pure: new proof command 'using' allows to augment currently used
wenzelm@12964
  1049
facts after a goal statement ('using' is syntactically analogous to
wenzelm@12964
  1050
'apply', but acts on the goal's facts only); this allows chained facts
wenzelm@12964
  1051
to be separated into parts given before and after a claim, as in
wenzelm@12964
  1052
``from a and b have C using d and e <proof>'';
wenzelm@12078
  1053
wenzelm@11722
  1054
* Pure: renamed "antecedent" case to "rule_context";
wenzelm@11722
  1055
wenzelm@12964
  1056
* Pure: new 'judgment' command records explicit information about the
wenzelm@12964
  1057
object-logic embedding (used by several tools internally); no longer
wenzelm@12964
  1058
use hard-wired "Trueprop";
wenzelm@12964
  1059
wenzelm@11738
  1060
* Pure: added 'corollary' command;
wenzelm@11738
  1061
wenzelm@11722
  1062
* Pure: fixed 'token_translation' command;
wenzelm@11722
  1063
wenzelm@11899
  1064
* Pure: removed obsolete 'exported' attribute;
wenzelm@11899
  1065
wenzelm@11933
  1066
* Pure: dummy pattern "_" in is/let is now automatically lifted over
wenzelm@11933
  1067
bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
wenzelm@11899
  1068
supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
wenzelm@11899
  1069
wenzelm@11952
  1070
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm@11952
  1071
statements (atomic meta-level propositions); setup controlled via
wenzelm@11952
  1072
rewrite rules declarations of 'atomize' attribute; example
wenzelm@11952
  1073
application: 'induct' method with proper rule statements in improper
wenzelm@11952
  1074
proof *scripts*;
wenzelm@11952
  1075
wenzelm@12106
  1076
* Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
wenzelm@12106
  1077
now consider the syntactic context of assumptions, giving a better
wenzelm@12106
  1078
chance to get type-inference of the arguments right (this is
wenzelm@12106
  1079
especially important for locales);
wenzelm@12106
  1080
wenzelm@12312
  1081
* Pure: "sorry" no longer requires quick_and_dirty in interactive
wenzelm@12312
  1082
mode;
wenzelm@12312
  1083
wenzelm@12405
  1084
* Pure/obtain: the formal conclusion "thesis", being marked as
wenzelm@12405
  1085
``internal'', may no longer be reference directly in the text;
wenzelm@12405
  1086
potential INCOMPATIBILITY, may need to use "?thesis" in rare
wenzelm@12405
  1087
situations;
wenzelm@12405
  1088
wenzelm@12405
  1089
* Pure: generic 'sym' attribute which declares a rule both as pure
wenzelm@12405
  1090
'elim?' and for the 'symmetric' operation;
wenzelm@12405
  1091
wenzelm@12877
  1092
* Pure: marginal comments ``--'' may now occur just anywhere in the
wenzelm@12877
  1093
text; the fixed correlation with particular command syntax has been
wenzelm@12877
  1094
discontinued;
wenzelm@12877
  1095
berghofe@13023
  1096
* Pure: new method 'rules' is particularly well-suited for proof
berghofe@13023
  1097
search in intuitionistic logic; a bit slower than 'blast' or 'fast',
berghofe@13023
  1098
but often produces more compact proof terms with less detours;
berghofe@13023
  1099
wenzelm@12364
  1100
* Pure/Provers/classical: simplified integration with pure rule
wenzelm@12364
  1101
attributes and methods; the classical "intro?/elim?/dest?"
wenzelm@12364
  1102
declarations coincide with the pure ones; the "rule" method no longer
wenzelm@12364
  1103
includes classically swapped intros; "intro" and "elim" methods no
wenzelm@12364
  1104
longer pick rules from the context; also got rid of ML declarations
wenzelm@12364
  1105
AddXIs/AddXEs/AddXDs; all of this has some potential for
wenzelm@12364
  1106
INCOMPATIBILITY;
wenzelm@12364
  1107
wenzelm@12405
  1108
* Provers/classical: attribute 'swapped' produces classical inversions
wenzelm@12405
  1109
of introduction rules;
wenzelm@12405
  1110
wenzelm@12364
  1111
* Provers/simplifier: 'simplified' attribute may refer to explicit
wenzelm@12364
  1112
rules instead of full simplifier context; 'iff' attribute handles
wenzelm@12364
  1113
conditional rules;
wenzelm@11936
  1114
wenzelm@11745
  1115
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
wenzelm@11745
  1116
wenzelm@11690
  1117
* HOL: 'recdef' now fails on unfinished automated proofs, use
wenzelm@11633
  1118
"(permissive)" option to recover old behavior;
wenzelm@11633
  1119
wenzelm@11933
  1120
* HOL: 'inductive' no longer features separate (collective) attributes
wenzelm@11933
  1121
for 'intros' (was found too confusing);
wenzelm@11933
  1122
wenzelm@12405
  1123
* HOL: properly declared induction rules less_induct and
wenzelm@12405
  1124
wf_induct_rule;
wenzelm@12405
  1125
kleing@11788
  1126
wenzelm@11474
  1127
*** HOL ***
wenzelm@11474
  1128
wenzelm@11702
  1129
* HOL: moved over to sane numeral syntax; the new policy is as
wenzelm@11702
  1130
follows:
wenzelm@11702
  1131
wenzelm@11702
  1132
  - 0 and 1 are polymorphic constants, which are defined on any
wenzelm@11702
  1133
  numeric type (nat, int, real etc.);
wenzelm@11702
  1134
wenzelm@11702
  1135
  - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
wenzelm@11702
  1136
  binary representation internally;
wenzelm@11702
  1137
wenzelm@11702
  1138
  - type nat has special constructor Suc, and generally prefers Suc 0
wenzelm@11702
  1139
  over 1::nat and Suc (Suc 0) over 2::nat;
wenzelm@11702
  1140
wenzelm@12364
  1141
This change may cause significant problems of INCOMPATIBILITY; here
wenzelm@12364
  1142
are some hints on converting existing sources:
wenzelm@11702
  1143
wenzelm@11702
  1144
  - due to the new "num" token, "-0" and "-1" etc. are now atomic
wenzelm@11702
  1145
  entities, so expressions involving "-" (unary or binary minus) need
wenzelm@11702
  1146
  to be spaced properly;
wenzelm@11702
  1147
wenzelm@11702
  1148
  - existing occurrences of "1" may need to be constraint "1::nat" or
wenzelm@11702
  1149
  even replaced by Suc 0; similar for old "2";
wenzelm@11702
  1150
wenzelm@11702
  1151
  - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
wenzelm@11702
  1152
wenzelm@11702
  1153
  - remove all special provisions on numerals in proofs;
wenzelm@11702
  1154
wenzelm@13042
  1155
* HOL: simp rules nat_number expand numerals on nat to Suc/0
wenzelm@12837
  1156
representation (depends on bin_arith_simps in the default context);
wenzelm@12837
  1157
wenzelm@12736
  1158
* HOL: symbolic syntax for x^2 (numeral 2);
wenzelm@12736
  1159
wenzelm@12335
  1160
* HOL: the class of all HOL types is now called "type" rather than
wenzelm@12335
  1161
"term"; INCOMPATIBILITY, need to adapt references to this type class
wenzelm@12335
  1162
in axclass/classes, instance/arities, and (usually rare) occurrences
wenzelm@12335
  1163
in typings (of consts etc.); internally the class is called
wenzelm@12335
  1164
"HOL.type", ML programs should refer to HOLogic.typeS;
wenzelm@12335
  1165
wenzelm@12280
  1166
* HOL/record package improvements:
wenzelm@12280
  1167
  - new derived operations "fields" to build a partial record section,
wenzelm@12280
  1168
    "extend" to promote a fixed record to a record scheme, and
wenzelm@12280
  1169
    "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
wenzelm@12280
  1170
    declared as simp by default;
wenzelm@12587
  1171
  - shared operations ("more", "fields", etc.) now need to be always
wenzelm@12587
  1172
    qualified) --- potential INCOMPATIBILITY;
wenzelm@12280
  1173
  - removed "make_scheme" operations (use "make" with "extend") --
wenzelm@12280
  1174
    INCOMPATIBILITY;
wenzelm@11937
  1175
  - removed "more" class (simply use "term") -- INCOMPATIBILITY;
wenzelm@12253
  1176
  - provides cases/induct rules for use with corresponding Isar
wenzelm@12253
  1177
    methods (for concrete records, record schemes, concrete more
wenzelm@12280
  1178
    parts, and schematic more parts -- in that order);
wenzelm@11930
  1179
  - internal definitions directly based on a light-weight abstract
wenzelm@11930
  1180
    theory of product types over typedef rather than datatype;
wenzelm@11930
  1181
berghofe@13023
  1182
* HOL: generic code generator for generating executable ML code from
berghofe@13023
  1183
specifications; specific support for HOL constructs such as inductive
berghofe@13023
  1184
datatypes and sets, as well as recursive functions; can be invoked
berghofe@13023
  1185
via 'generate_code' theory section;
berghofe@13023
  1186
wenzelm@11933
  1187
* HOL: canonical cases/induct rules for n-tuples (n = 3..7);
wenzelm@11933
  1188
paulson@13824
  1189
* HOL: consolidated and renamed several theories.  In particular:
wenzelm@14731
  1190
        Ord.thy has been absorbed into HOL.thy
wenzelm@14731
  1191
        String.thy has been absorbed into List.thy
wenzelm@14731
  1192
wenzelm@11802
  1193
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm@11802
  1194
(beware of argument permutation!);
wenzelm@11802
  1195
wenzelm@11657
  1196
* HOL: linorder_less_split superseded by linorder_cases;
wenzelm@11657
  1197
wenzelm@12917
  1198
* HOL/List: "nodups" renamed to "distinct";
nipkow@12889
  1199
wenzelm@11633
  1200
* HOL: added "The" definite description operator; move Hilbert's "Eps"
paulson@13824
  1201
to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
paulson@13824
  1202
  - Ex_def has changed, now need to use some_eq_ex
wenzelm@11437
  1203
wenzelm@11572
  1204
* HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
wenzelm@11572
  1205
in this (rare) case use:
wenzelm@11572
  1206
wenzelm@11572
  1207
  delSWrapper "split_all_tac"
wenzelm@11572
  1208
  addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
wenzelm@11572
  1209
wenzelm@11572
  1210
* HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
wenzelm@11474
  1211
MAY FAIL;
nipkow@11361
  1212
wenzelm@11572
  1213
* HOL: introduced f^n = f o ... o f; warning: due to the limits of
wenzelm@11572
  1214
Isabelle's type classes, ^ on functions and relations has too general
wenzelm@11572
  1215
a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
wenzelm@11572
  1216
necessary to attach explicit type constraints;
nipkow@11307
  1217
wenzelm@12917
  1218
* HOL/Relation: the prefix name of the infix "O" has been changed from
wenzelm@12917
  1219
"comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
wenzelm@12917
  1220
renamed accordingly (eg "compI" -> "rel_compI").
nipkow@12489
  1221
wenzelm@11487
  1222
* HOL: syntax translations now work properly with numerals and records
wenzelm@11487
  1223
expressions;
wenzelm@11474
  1224
wenzelm@12457
  1225
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
wenzelm@12457
  1226
of "lam" -- INCOMPATIBILITY;
wenzelm@11474
  1227
wenzelm@11933
  1228
* HOL: got rid of some global declarations (potential INCOMPATIBILITY
wenzelm@11933
  1229
for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
wenzelm@11933
  1230
renamed "Product_Type.unit";
wenzelm@11611
  1231
nipkow@12564
  1232
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
nipkow@12564
  1233
wenzelm@12924
  1234
* HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
wenzelm@12924
  1235
the "cases" method);
wenzelm@12924
  1236
wenzelm@12597
  1237
* HOL/GroupTheory: group theory examples including Sylow's theorem (by
webertj@15154
  1238
Florian Kammller);
wenzelm@12597
  1239
wenzelm@12608
  1240
* HOL/IMP: updated and converted to new-style theory format; several
wenzelm@12608
  1241
parts turned into readable document, with proper Isar proof texts and
wenzelm@12608
  1242
some explanations (by Gerwin Klein);
wenzelm@12597
  1243
wenzelm@12734
  1244
* HOL-Real: added Complex_Numbers (by Gertrud Bauer);
wenzelm@12734
  1245
wenzelm@12690
  1246
* HOL-Hyperreal is now a logic image;
wenzelm@12690
  1247
wenzelm@11611
  1248
wenzelm@12022
  1249
*** HOLCF ***
wenzelm@12022
  1250
wenzelm@12622
  1251
* Isar: consts/constdefs supports mixfix syntax for continuous
wenzelm@12622
  1252
operations;
wenzelm@12622
  1253
wenzelm@12622
  1254
* Isar: domain package adapted to new-style theory format, e.g. see
wenzelm@12622
  1255
HOLCF/ex/Dnat.thy;
wenzelm@12622
  1256
wenzelm@12622
  1257
* theory Lift: proper use of rep_datatype lift instead of ML hacks --
wenzelm@12280
  1258
potential INCOMPATIBILITY; now use plain induct_tac instead of former
wenzelm@12280
  1259
lift.induct_tac, always use UU instead of Undef;
wenzelm@12022
  1260
wenzelm@12597
  1261
* HOLCF/IMP: updated and converted to new-style theory;
wenzelm@12597
  1262
wenzelm@12022
  1263
wenzelm@11474
  1264
*** ZF ***
wenzelm@11474
  1265
wenzelm@12622
  1266
* Isar: proper integration of logic-specific tools and packages,
wenzelm@12622
  1267
including theory commands '(co)inductive', '(co)datatype',
wenzelm@12622
  1268
'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
wenzelm@12622
  1269
'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
wenzelm@12622
  1270
wenzelm@12622
  1271
* theory Main no longer includes AC; for the Axiom of Choice, base
wenzelm@12622
  1272
your theory on Main_ZFC;
wenzelm@12622
  1273
wenzelm@12622
  1274
* the integer library now covers quotients and remainders, with many
wenzelm@12622
  1275
laws relating division to addition, multiplication, etc.;
paulson@12563
  1276
wenzelm@12280
  1277
* ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
wenzelm@12280
  1278
typeless version of the formalism;
wenzelm@12280
  1279
wenzelm@13025
  1280
* ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
wenzelm@13025
  1281
format;
wenzelm@12608
  1282
wenzelm@12280
  1283
* ZF/Induct: new directory for examples of inductive definitions,
wenzelm@12608
  1284
including theory Multiset for multiset orderings; converted to
wenzelm@12608
  1285
new-style theory format;
wenzelm@12177
  1286
wenzelm@13025
  1287
* ZF: many new theorems about lists, ordinals, etc.;
paulson@12850
  1288
wenzelm@11474
  1289
wenzelm@11474
  1290
*** General ***
wenzelm@11474
  1291
wenzelm@12280
  1292
* Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
wenzelm@12280
  1293
variable proof controls level of detail: 0 = no proofs (only oracle
wenzelm@12280
  1294
dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
wenzelm@12280
  1295
also ref manual for further ML interfaces;
wenzelm@12280
  1296
wenzelm@12280
  1297
* Pure/axclass: removed obsolete ML interface
wenzelm@12280
  1298
goal_subclass/goal_arity;
wenzelm@12280
  1299
wenzelm@12280
  1300
* Pure/syntax: new token syntax "num" for plain numerals (without "#"
wenzelm@12280
  1301
of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
wenzelm@12280
  1302
separate tokens, so expressions involving minus need to be spaced
wenzelm@12280
  1303
properly;
wenzelm@12280
  1304
wenzelm@12312
  1305
* Pure/syntax: support non-oriented infixes, using keyword "infix"
wenzelm@12312
  1306
rather than "infixl" or "infixr";
wenzelm@12312
  1307
wenzelm@12312
  1308
* Pure/syntax: concrete syntax for dummy type variables admits genuine
wenzelm@12312
  1309
sort constraint specifications in type inference; e.g. "x::_::foo"
wenzelm@12312
  1310
ensures that the type of "x" is of sort "foo" (but not necessarily a
wenzelm@12312
  1311
type variable);
wenzelm@12280
  1312
wenzelm@12280
  1313
* Pure/syntax: print modes "type_brackets" and "no_type_brackets"
wenzelm@12280
  1314
control output of nested => (types); the default behavior is
wenzelm@12280
  1315
"type_brackets";
wenzelm@12280
  1316
wenzelm@12280
  1317
* Pure/syntax: builtin parse translation for "_constify" turns valued
wenzelm@11817
  1318
tokens into AST constants;
wenzelm@11474
  1319
wenzelm@12280
  1320
* Pure/syntax: prefer later declarations of translations and print
wenzelm@12280
  1321
translation functions; potential INCOMPATIBILITY: need to reverse
wenzelm@12280
  1322
multiple declarations for same syntax element constant;
wenzelm@12280
  1323
wenzelm@12832
  1324
* Pure/show_hyps reset by default (in accordance to existing Isar
wenzelm@12832
  1325
practice);
wenzelm@12832
  1326
wenzelm@12280
  1327
* Provers/classical: renamed addaltern to addafter, addSaltern to
wenzelm@12280
  1328
addSafter;
wenzelm@12280
  1329
wenzelm@12280
  1330
* Provers/clasimp: ``iff'' declarations now handle conditional rules
wenzelm@12280
  1331
as well;
wenzelm@12253
  1332
wenzelm@12538
  1333
* system: tested support for MacOS X; should be able to get Isabelle +
wenzelm@12538
  1334
Proof General to work in a plain Terminal after installing Poly/ML
wenzelm@12538
  1335
(e.g. from the Isabelle distribution area) and GNU bash alone
wenzelm@12538
  1336
(e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
wenzelm@12538
  1337
support requires further installations, e.g. from
wenzelm@12538
  1338
http://fink.sourceforge.net/);
wenzelm@12538
  1339
wenzelm@12280
  1340
* system: support Poly/ML 4.1.1 (able to manage larger heaps);
wenzelm@11551
  1341
wenzelm@12753
  1342
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm@12753
  1343
of 40 MB), cf. ML_OPTIONS;
wenzelm@12753
  1344
wenzelm@11633
  1345
* system: Proof General keywords specification is now part of the
wenzelm@11633
  1346
Isabelle distribution (see etc/isar-keywords.el);
wenzelm@11633
  1347
wenzelm@12728
  1348
* system: support for persistent Proof General sessions (refrain from
wenzelm@12728
  1349
outdating all loaded theories on startup); user may create writable
wenzelm@12728
  1350
logic images like this: ``isabelle -q HOL Test'';
wenzelm@12597
  1351
wenzelm@11551
  1352
* system: smart selection of Isabelle process versus Isabelle
wenzelm@11572
  1353
interface, accommodates case-insensitive file systems (e.g. HFS+); may
wenzelm@11572
  1354
run both "isabelle" and "Isabelle" even if file names are badly
wenzelm@11572
  1355
damaged (executable inspects the case of the first letter of its own
wenzelm@11572
  1356
name); added separate "isabelle-process" and "isabelle-interface";
wenzelm@11551
  1357
wenzelm@12472
  1358
* system: refrain from any attempt at filtering input streams; no
wenzelm@12472
  1359
longer support ``8bit'' encoding of old isabelle font, instead proper
wenzelm@12472
  1360
iso-latin characters may now be used; the related isatools
wenzelm@12472
  1361
"symbolinput" and "nonascii" have disappeared as well;
wenzelm@12472
  1362
wenzelm@12472
  1363
* system: removed old "xterm" interface (the print modes "xterm" and
wenzelm@12472
  1364
"xterm_color" are still available for direct use in a suitable
wenzelm@12472
  1365
terminal);
wenzelm@12472
  1366
paulson@11314
  1367
oheimb@11169
  1368
wenzelm@11062
  1369
New in Isabelle99-2 (February 2001)
wenzelm@11062
  1370
-----------------------------------
wenzelm@11062
  1371
nipkow@10224
  1372
*** Overview of INCOMPATIBILITIES ***
nipkow@10224
  1373
paulson@11241
  1374
* HOL: please note that theories in the Library and elsewhere often use the
paulson@11241
  1375
new-style (Isar) format; to refer to their theorems in an ML script you must
wenzelm@12622
  1376
bind them to ML identifers by e.g.      val thm_name = thm "thm_name";
paulson@11241
  1377
wenzelm@11043
  1378
* HOL: inductive package no longer splits induction rule aggressively,
wenzelm@11043
  1379
but only as far as specified by the introductions given; the old
oheimb@11130
  1380
format may be recovered via ML function complete_split_rule or attribute
wenzelm@11043
  1381
'split_rule (complete)';
wenzelm@11043
  1382
wenzelm@10998
  1383
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
wenzelm@10998
  1384
gfp_Tarski to gfp_unfold;
nipkow@10224
  1385
paulson@10288
  1386
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
paulson@10288
  1387
wenzelm@10858
  1388
* HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
wenzelm@10858
  1389
relation); infix "^^" has been renamed "``"; infix "``" has been
wenzelm@10858
  1390
renamed "`"; "univalent" has been renamed "single_valued";
nipkow@10793
  1391
wenzelm@10998
  1392
* HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
wenzelm@10998
  1393
operation;
wenzelm@10998
  1394
nipkow@10868
  1395
* HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
nipkow@10856
  1396
wenzelm@10391
  1397
* Isar: 'obtain' no longer declares "that" fact as simp/intro;
wenzelm@10391
  1398
wenzelm@10401
  1399
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm@10401
  1400
consequence, it is no longer monotonic wrt. the local goal context
wenzelm@10401
  1401
(which is now passed through the inductive cases);
wenzelm@10401
  1402
wenzelm@10976
  1403
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm@10976
  1404
\<gg> to \<ggreater>;
wenzelm@10976
  1405
nipkow@10224
  1406
wenzelm@10245
  1407
*** Document preparation ***
wenzelm@10245
  1408
wenzelm@10858
  1409
* \isabellestyle{NAME} selects version of Isabelle output (currently
wenzelm@10858
  1410
available: are "it" for near math-mode best-style output, "sl" for
wenzelm@10858
  1411
slanted text style, and "tt" for plain type-writer; if no
wenzelm@10858
  1412
\isabellestyle command is given, output is according to slanted
wenzelm@10858
  1413
type-writer);
wenzelm@10858
  1414
wenzelm@10322
  1415
* support sub/super scripts (for single symbols only), input syntax is
wenzelm@10322
  1416
like this: "A\<^sup>*" or "A\<^sup>\<star>";
wenzelm@10322
  1417
wenzelm@10858
  1418
* some more standard symbols; see Appendix A of the system manual for
wenzelm@11062
  1419
the complete list of symbols defined in isabellesym.sty;
wenzelm@10858
  1420
wenzelm@10998
  1421
* improved isabelle style files; more abstract symbol implementation
wenzelm@10998
  1422
(should now use \isamath{...} and \isatext{...} in custom symbol
wenzelm@10998
  1423
definitions);
wenzelm@10998
  1424
wenzelm@10634
  1425
* antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
wenzelm@10634
  1426
state; Note that presentation of goal states does not conform to
wenzelm@10634
  1427
actual human-readable proof documents.  Please do not include goal
wenzelm@10634
  1428
states into document output unless you really know what you are doing!
wenzelm@10322
  1429
wenzelm@11062
  1430
* proper indentation of antiquoted output with proportional LaTeX
wenzelm@11062
  1431
fonts;
wenzelm@10862
  1432
wenzelm@11050
  1433
* no_document ML operator temporarily disables LaTeX document
wenzelm@11050
  1434
generation;
wenzelm@11050
  1435
wenzelm@11062
  1436
* isatool unsymbolize tunes sources for plain ASCII communication;
wenzelm@11062
  1437
wenzelm@10322
  1438
wenzelm@10306
  1439
*** Isar ***
wenzelm@10306
  1440
wenzelm@10547
  1441
* Pure: Isar now suffers initial goal statements to contain unbound
wenzelm@10547
  1442
schematic variables (this does not conform to actual readable proof
wenzelm@10547
  1443
documents, due to unpredictable outcome and non-compositional proof
wenzelm@10547
  1444
checking); users who know what they are doing may use schematic goals
wenzelm@10547
  1445
for Prolog-style synthesis of proven results;
wenzelm@10547
  1446
wenzelm@10391
  1447
* Pure: assumption method (an implicit finishing) now handles actual
wenzelm@10391
  1448
rules as well;
wenzelm@10391
  1449
wenzelm@10391
  1450
* Pure: improved 'obtain' --- moved to Pure, insert "that" into
wenzelm@10391
  1451
initial goal, declare "that" only as Pure intro (only for single
wenzelm@10391
  1452
steps); the "that" rule assumption may now be involved in implicit
wenzelm@10391
  1453
finishing, thus ".." becomes a feasible for trivial obtains;
wenzelm@10391
  1454
wenzelm@10391
  1455
* Pure: default proof step now includes 'intro_classes'; thus trivial
wenzelm@10391
  1456
instance proofs may be performed by "..";
wenzelm@10391
  1457
wenzelm@10391
  1458
* Pure: ?thesis / ?this / "..." now work for pure meta-level
wenzelm@10391
  1459
statements as well;
wenzelm@10306
  1460
wenzelm@11097
  1461
* Pure: more robust selection of calculational rules;
wenzelm@11097
  1462
wenzelm@10858
  1463
* Pure: the builtin notion of 'finished' goal now includes the ==-refl
wenzelm@10858
  1464
rule (as well as the assumption rule);
wenzelm@10858
  1465
wenzelm@10858
  1466
* Pure: 'thm_deps' command visualizes dependencies of theorems and
wenzelm@10858
  1467
lemmas, using the graph browser tool;
wenzelm@10858
  1468
wenzelm@10944
  1469
* Pure: predict failure of "show" in interactive mode;
wenzelm@10944
  1470
wenzelm@11016
  1471
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm@11016
  1472
wenzelm@10401
  1473
* HOL: improved method 'induct' --- now handles non-atomic goals
wenzelm@10401
  1474
(potential INCOMPATIBILITY); tuned error handling;
wenzelm@10401
  1475
wenzelm@10557
  1476
* HOL: cases and induct rules now provide explicit hints about the
wenzelm@10547
  1477
number of facts to be consumed (0 for "type" and 1 for "set" rules);
wenzelm@10547
  1478
any remaining facts are inserted into the goal verbatim;
wenzelm@10547
  1479
wenzelm@10858
  1480
* HOL: local contexts (aka cases) may now contain term bindings as
wenzelm@10858
  1481
well; the 'cases' and 'induct' methods new provide a ?case binding for
wenzelm@10858
  1482
the result to be shown in each case;
wenzelm@10858
  1483
wenzelm@10770
  1484
* HOL: added 'recdef_tc' command;
wenzelm@10770
  1485
wenzelm@11016
  1486
* isatool convert assists in eliminating legacy ML scripts;
wenzelm@11016
  1487
wenzelm@10306
  1488
wenzelm@10245
  1489
*** HOL ***
wenzelm@10245
  1490
wenzelm@10245
  1491
* HOL/Library: a collection of generic theories to be used together
wenzelm@10245
  1492
with main HOL; the theory loader path already includes this directory
wenzelm@10245
  1493
by default; the following existing theories have been moved here:
wenzelm@10245
  1494
HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
wenzelm@10337
  1495
(as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
wenzelm@10245
  1496
wenzelm@10966
  1497
* HOL/Unix: "Some aspects of Unix file-system security", a typical
wenzelm@10966
  1498
modelling and verification task performed in Isabelle/HOL +
wenzelm@10966
  1499
Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
wenzelm@10966
  1500
wenzelm@11094
  1501
* HOL/Algebra: special summation operator SUM no longer exists, it has
wenzelm@11094
  1502
been replaced by setsum; infix 'assoc' now has priority 50 (like
wenzelm@11094
  1503
'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
wenzelm@11094
  1504
'domain', this makes the theory consistent with mathematical
wenzelm@11094
  1505
literature;
wenzelm@11094
  1506
wenzelm@10514
  1507
* HOL basics: added overloaded operations "inverse" and "divide"
wenzelm@10726
  1508
(infix "/"), syntax for generic "abs" operation, generic summation
wenzelm@11094
  1509
operator \<Sum>;
wenzelm@10452
  1510
wenzelm@10391
  1511
* HOL/typedef: simplified package, provide more useful rules (see also
wenzelm@10391
  1512
HOL/subset.thy);
wenzelm@10391
  1513
wenzelm@10915
  1514
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm@10915
  1515
now expressed as a proper nested rule (old-style tactic scripts may
wenzelm@10915
  1516
require atomize_strip_tac to cope with non-atomic premises);
wenzelm@10915
  1517
wenzelm@10915
  1518
* HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
wenzelm@10915
  1519
to "split_conv" (old name still available for compatibility);
wenzelm@10915
  1520
wenzelm@10915
  1521
* HOL: improved concrete syntax for strings (e.g. allows translation
wenzelm@10915
  1522
rules with string literals);
wenzelm@10915
  1523
paulson@12245
  1524
* HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
paulson@12245
  1525
 and Fleuriot's mechanization of analysis, including the transcendental
paulson@12245
  1526
 functions for the reals;
paulson@10756
  1527
wenzelm@11094
  1528
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
wenzelm@10391
  1529
wenzelm@10858
  1530
paulson@10474
  1531
*** CTT ***
paulson@10474
  1532
wenzelm@10547
  1533
* CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
wenzelm@10547
  1534
"lam" is displayed as TWO lambda-symbols
paulson@10474
  1535
wenzelm@10547
  1536
* CTT: theory Main now available, containing everything (that is, Bool
wenzelm@10547
  1537
and Arith);
wenzelm@10547
  1538
paulson@10474
  1539
wenzelm@10391
  1540
*** General ***
wenzelm@10391
  1541
wenzelm@10547
  1542
* Pure: the Simplifier has been implemented properly as a derived rule
wenzelm@10547
  1543
outside of the actual kernel (at last!); the overall performance
wenzelm@10547
  1544
penalty in practical applications is about 50%, while reliability of
wenzelm@10547
  1545
the Isabelle inference kernel has been greatly improved;
wenzelm@10547
  1546
wenzelm@11112
  1547
* print modes "brackets" and "no_brackets" control output of nested =>
wenzelm@11112
  1548
(types) and ==> (props); the default behaviour is "brackets";
wenzelm@11112
  1549
wenzelm@10391
  1550
* Provers: fast_tac (and friends) now handle actual object-logic rules
wenzelm@10391
  1551
as assumptions as well;
wenzelm@10391
  1552
wenzelm@11124
  1553
* system: support Poly/ML 4.0;
wenzelm@11124
  1554
wenzelm@11124
  1555
* system: isatool install handles KDE version 1 or 2;
wenzelm@11124
  1556
wenzelm@10391
  1557
wenzelm@10245
  1558
wenzelm@10103
  1559
New in Isabelle99-1 (October 2000)
wenzelm@10103
  1560
----------------------------------
wenzelm@8015
  1561
wenzelm@10003
  1562
*** Overview of INCOMPATIBILITIES ***
paulson@8014
  1563
wenzelm@8848
  1564
* HOL: simplification of natural numbers is much changed; to partly
wenzelm@8848
  1565
recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
wenzelm@8848
  1566
issue the following ML commands:
wenzelm@8848
  1567
wenzelm@8848
  1568
  Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
wenzelm@8848
  1569
  Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
paulson@8788
  1570
wenzelm@10129
  1571
* HOL: simplification no longer dives into case-expressions; this is
wenzelm@10129
  1572
controlled by "t.weak_case_cong" for each datatype t;
wenzelm@10003
  1573
wenzelm@10003
  1574
* HOL: nat_less_induct renamed to less_induct;
wenzelm@10003
  1575
wenzelm@10003
  1576
* HOL: systematic renaming of the SOME (Eps) rules, may use isatool
wenzelm@10003
  1577
fixsome to patch .thy and .ML sources automatically;
paulson@8967
  1578
wenzelm@10003
  1579
  select_equality  -> some_equality
wenzelm@10003
  1580
  select_eq_Ex     -> some_eq_ex
wenzelm@10003
  1581
  selectI2EX       -> someI2_ex
wenzelm@10003
  1582
  selectI2         -> someI2
wenzelm@10003
  1583
  selectI          -> someI
wenzelm@10003
  1584
  select1_equality -> some1_equality
wenzelm@10003
  1585
  Eps_sym_eq       -> some_sym_eq_trivial
wenzelm@10003
  1586
  Eps_eq           -> some_eq_trivial
wenzelm@10003
  1587
wenzelm@10003
  1588
* HOL: exhaust_tac on datatypes superceded by new generic case_tac;
wenzelm@10003
  1589
wenzelm@10003
  1590
* HOL: removed obsolete theorem binding expand_if (refer to split_if
wenzelm@10003
  1591
instead);
wenzelm@10003
  1592
wenzelm@10003
  1593
* HOL: the recursion equations generated by 'recdef' are now called
wenzelm@10003
  1594
f.simps instead of f.rules;
wenzelm@10003
  1595
wenzelm@10003
  1596
* HOL: qed_spec_mp now also handles bounded ALL as well;
wenzelm@10003
  1597
wenzelm@10003
  1598
* HOL: 0 is now overloaded, so the type constraint ":: nat" may
wenzelm@10003
  1599
sometimes be needed;
wenzelm@10003
  1600
wenzelm@10003
  1601
* HOL: the constant for "f``x" is now "image" rather than "op ``";
paulson@8014
  1602
paulson@10065
  1603
* HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
paulson@10065
  1604
wenzelm@9330
  1605
* HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
wenzelm@9330
  1606
product is now "<*>" instead of "Times"; the lexicographic product is
wenzelm@9330
  1607
now "<*lex*>" instead of "**";
nipkow@8705
  1608
wenzelm@10003
  1609
* HOL: theory Sexp is now in HOL/Induct examples (it used to be part
wenzelm@10003
  1610
of main HOL, but was unused); better use HOL's datatype package;
paulson@9971
  1611
wenzelm@10137
  1612
* HOL: removed "symbols" syntax for constant "override" of theory Map;
wenzelm@10137
  1613
the old syntax may be recovered as follows:
wenzelm@10137
  1614
wenzelm@10137
  1615
  syntax (symbols)
wenzelm@10137
  1616
    override  :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
wenzelm@10137
  1617
      (infixl "\\<oplus>" 100)
wenzelm@10137
  1618
wenzelm@8848
  1619
* HOL/Real: "rabs" replaced by overloaded "abs" function;
wenzelm@8848
  1620
wenzelm@8887
  1621
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm@8887
  1622
Lfp, Gfp, WF); this only affects ML packages that refer to const names
wenzelm@8887
  1623
internally;
wenzelm@8887
  1624
wenzelm@10003
  1625
* HOL and ZF: syntax for quotienting wrt an equivalence relation
wenzelm@10003
  1626
changed from A/r to A//r;
wenzelm@9908
  1627
wenzelm@10003
  1628
* ZF: new treatment of arithmetic (nat & int) may break some old
wenzelm@10003
  1629
proofs;
wenzelm@8921
  1630
wenzelm@10003
  1631
* Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
wenzelm@10003
  1632
rulify -> rule_format, elimify -> elim_format, ...);
paulson@9542
  1633
wenzelm@9941
  1634
* Isar/Provers: intro/elim/dest attributes changed; renamed
wenzelm@9941
  1635
intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
wenzelm@9937
  1636
should have to change intro!! to intro? only); replaced "delrule" by
wenzelm@9937
  1637
"rule del";
wenzelm@9437
  1638
wenzelm@9612
  1639
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
wenzelm@9612
  1640
wenzelm@9437
  1641
* Provers: strengthened force_tac by using new first_best_tac;
oheimb@9402
  1642
wenzelm@10003
  1643
* LaTeX document preparation: several changes of isabelle.sty (see
wenzelm@10003
  1644
lib/texinputs);
wenzelm@8729
  1645
paulson@8014
  1646
wenzelm@8487
  1647
*** Document preparation ***
wenzelm@8358
  1648
wenzelm@9198
  1649
* formal comments (text blocks etc.) in new-style theories may now
wenzelm@9753
  1650
contain antiquotations of thm/prop/term/typ/text to be presented
wenzelm@9753
  1651
according to latex print mode; concrete syntax is like this:
wenzelm@9753
  1652
@{term[show_types] "f(x) = a + x"};
wenzelm@9198
  1653
wenzelm@8358
  1654
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm@8518
  1655
including proper document sources;
wenzelm@8358
  1656
wenzelm@8358
  1657
* generated LaTeX sources are now deleted after successful run
wenzelm@8358
  1658
(isatool document -c); may retain a copy somewhere else via -D option
wenzelm@8358
  1659
of isatool usedir;
wenzelm@8358
  1660
wenzelm@8566
  1661
* isatool usedir -D now lets isatool latex -o sty update the Isabelle
wenzelm@10003
  1662
style files, achieving self-contained LaTeX sources and simplifying
wenzelm@10003
  1663
LaTeX debugging;
wenzelm@8566
  1664
wenzelm@8518
  1665
* old-style theories now produce (crude) LaTeX output as well;
wenzelm@8358
  1666
wenzelm@9057
  1667
* browser info session directories are now self-contained (may be put
wenzelm@9437
  1668
on WWW server seperately); improved graphs of nested sessions; removed
wenzelm@9437
  1669
graph for 'all sessions';
wenzelm@9057
  1670
wenzelm@10003
  1671
* several improvements in isabelle style files; \isabellestyle{it}
wenzelm@10003
  1672
produces fake math mode output; \isamarkupheader is now \section by
wenzelm@10003
  1673
default; see lib/texinputs/isabelle.sty etc.;
wenzelm@9489
  1674
wenzelm@8358
  1675
wenzelm@8184
  1676
*** Isar ***
wenzelm@8184
  1677
wenzelm@10003
  1678
* Isar/Pure: local results and corresponding term bindings are now
wenzelm@10003
  1679
subject to Hindley-Milner polymorphism (similar to ML); this
wenzelm@10003
  1680
accommodates incremental type-inference very nicely;
wenzelm@8283
  1681
wenzelm@10003
  1682
* Isar/Pure: new derived language element 'obtain' supports
wenzelm@10003
  1683
generalized existence reasoning;
wenzelm@8621
  1684
wenzelm@10003
  1685
* Isar/Pure: new calculational elements 'moreover' and 'ultimately'
wenzelm@10003
  1686
support accumulation of results, without applying any rules yet;
wenzelm@10003
  1687
useful to collect intermediate results without explicit name
wenzelm@10003
  1688
references, and for use with transitivity rules with more than 2
wenzelm@10003
  1689
premises;
wenzelm@8184
  1690
wenzelm@10003
  1691
* Isar/Pure: scalable support for case-analysis type proofs: new
wenzelm@10003
  1692
'case' language element refers to local contexts symbolically, as
wenzelm@10003
  1693
produced by certain proof methods; internally, case names are attached
wenzelm@10003
  1694
to theorems as "tags";
wenzelm@8440
  1695
wenzelm@10003
  1696
* Isar/Pure: theory command 'hide' removes declarations from
wenzelm@9330
  1697
class/type/const name spaces;
wenzelm@9330
  1698
wenzelm@10003
  1699
* Isar/Pure: theory command 'defs' supports option "(overloaded)" to
wenzelm@9330
  1700
indicate potential overloading;
wenzelm@9330
  1701
wenzelm@10003
  1702
* Isar/Pure: changed syntax of local blocks from {{ }} to { };
wenzelm@8621
  1703
wenzelm@10003
  1704
* Isar/Pure: syntax of sorts made 'inner', i.e. have to write
wenzelm@10003
  1705
"{a,b,c}" instead of {a,b,c};
wenzelm@9011
  1706
wenzelm@10003
  1707
* Isar/Pure now provides its own version of intro/elim/dest
wenzelm@10003
  1708
attributes; useful for building new logics, but beware of confusion
wenzelm@10003
  1709
with the version in Provers/classical;
wenzelm@9612
  1710
wenzelm@10003
  1711
* Isar/Pure: the local context of (non-atomic) goals is provided via
wenzelm@10003
  1712
case name 'antecedent';
wenzelm@8440
  1713
wenzelm@10003
  1714
* Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
wenzelm@10003
  1715
to the current context is now done automatically);
wenzelm@9383
  1716
wenzelm@10003
  1717
* Isar/Pure: theory command 'method_setup' provides a simple interface
wenzelm@10003
  1718
for definining proof methods in ML;
wenzelm@9612
  1719
wenzelm@10003
  1720
* Isar/Provers: intro/elim/dest attributes changed; renamed
wenzelm@9941
  1721
intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
wenzelm@9941
  1722
most cases, one should have to change intro!! to intro? only);
wenzelm@9941
  1723
replaced "delrule" by "rule del";
wenzelm@8283
  1724
wenzelm@10003
  1725
* Isar/Provers: new 'hypsubst' method, plain 'subst' method and
wenzelm@10003
  1726
'symmetric' attribute (the latter supercedes [RS sym]);
wenzelm@10003
  1727
wenzelm@10003
  1728
* Isar/Provers: splitter support (via 'split' attribute and 'simp'
wenzelm@10003
  1729
method modifier); 'simp' method: 'only:' modifier removes loopers as
wenzelm@10003
  1730
well (including splits);
wenzelm@10003
  1731
wenzelm@10003
  1732
* Isar/Provers: Simplifier and Classical methods now support all kind
wenzelm@10003
  1733
of modifiers used in the past, including 'cong', 'iff', etc.
wenzelm@10003
  1734
wenzelm@10003
  1735
* Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
wenzelm@10003
  1736
of Simplifier and Classical reasoner);
wenzelm@10003
  1737
wenzelm@10003
  1738
* Isar/HOL: new proof method 'cases' and improved version of 'induct'
wenzelm@10003
  1739
now support named cases; major packages (inductive, datatype, primrec,
wenzelm@10003
  1740
recdef) support case names and properly name parameters;
wenzelm@9612
  1741
wenzelm@10003
  1742
* Isar/HOL: new transitivity rules for substitution in inequalities --
wenzelm@10003
  1743
monotonicity conditions are extracted to be proven at end of
wenzelm@10003
  1744
calculations;
wenzelm@10003
  1745
wenzelm@10003
  1746
* Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
wenzelm@10003
  1747
method anyway;
wenzelm@10003
  1748
wenzelm@10003
  1749
* Isar/HOL: removed old expand_if = split_if; theorems if_splits =
wenzelm@10003
  1750
split_if split_if_asm; datatype package provides theorems foo.splits =
wenzelm@10003
  1751
foo.split foo.split_asm for each datatype;
wenzelm@10003
  1752
wenzelm@10003
  1753
* Isar/HOL: tuned inductive package, rename "intrs" to "intros"
wenzelm@10003
  1754
(potential INCOMPATIBILITY), emulation of mk_cases feature for proof
wenzelm@10003
  1755
scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
wenzelm@10003
  1756
use "(cases (simplified))" method in proper proof texts);
wenzelm@10003
  1757
wenzelm@10003
  1758
* Isar/HOL: added global 'arith_split' attribute for 'arith' method;
wenzelm@10003
  1759
wenzelm@10003
  1760
* Isar: names of theorems etc. may be natural numbers as well;
wenzelm@10003
  1761
wenzelm@10003
  1762
* Isar: 'pr' command: optional arguments for goals_limit and
wenzelm@9724
  1763
ProofContext.prems_limit; no longer prints theory contexts, but only
wenzelm@9724
  1764
proof states;
wenzelm@8487
  1765
wenzelm@10003
  1766
* Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
wenzelm@8518
  1767
additional print modes to be specified; e.g. "pr(latex)" will print
wenzelm@8518
  1768
proof state according to the Isabelle LaTeX style;
wenzelm@8487
  1769
wenzelm@10003
  1770
* Isar: improved support for emulating tactic scripts, including proof
wenzelm@9612
  1771
methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
wenzelm@9612
  1772
'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
wenzelm@9612
  1773
(for HOL datatypes);
wenzelm@8534
  1774
wenzelm@10003
  1775
* Isar: simplified (more robust) goal selection of proof methods: 1st
wenzelm@10003
  1776
goal, all goals, or explicit goal specifier (tactic emulation); thus
wenzelm@10003
  1777
'proof method scripts' have to be in depth-first order;
wenzelm@8673
  1778
wenzelm@10003
  1779
* Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
wenzelm@8729
  1780
wenzelm@10003
  1781
* Isar: removed 'help' command, which hasn't been too helpful anyway;
wenzelm@10003
  1782
should instead use individual commands for printing items
wenzelm@10003
  1783
(print_commands, print_methods etc.);
wenzelm@9224
  1784
wenzelm@10003
  1785
* Isar: added 'nothing' --- the empty list of theorems;
wenzelm@9239
  1786
wenzelm@8184
  1787
paulson@8014
  1788
*** HOL ***
paulson@8014
  1789
wenzelm@10080
  1790
* HOL/MicroJava: formalization of a fragment of Java, together with a
wenzelm@10080
  1791
corresponding virtual machine and a specification of its bytecode
wenzelm@10080
  1792
verifier and a lightweight bytecode verifier, including proofs of
wenzelm@10080
  1793
type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
wenzelm@10080
  1794
Cornelia Pusch (see also the homepage of project Bali at
wenzelm@10080
  1795
http://isabelle.in.tum.de/Bali/);
wenzelm@10080
  1796
wenzelm@8518
  1797
* HOL/Algebra: new theory of rings and univariate polynomials, by
wenzelm@8518
  1798
Clemens Ballarin;
paulson@8014
  1799
wenzelm@10157
  1800
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
wenzelm@10003
  1801
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
wenzelm@10003
  1802
Rasmussen;
wenzelm@8570
  1803
wenzelm@10157
  1804
* HOL/Lattice: fundamental concepts of lattice theory and order
wenzelm@10157
  1805
structures, including duals, properties of bounds versus algebraic
wenzelm@10157
  1806
laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
wenzelm@10157
  1807
Theorem for complete lattices etc.; may also serve as a demonstration
wenzelm@10157
  1808
for abstract algebraic reasoning using axiomatic type classes, and
wenzelm@10157
  1809
mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
wenzelm@10157
  1810
wenzelm@10003
  1811
* HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
wenzelm@10003
  1812
von Oheimb;
paulson@9542
  1813
wenzelm@10164
  1814
* HOL/IMPP: extension of IMP with local variables and mutually
wenzelm@10164
  1815
recursive procedures, by David von Oheimb;
wenzelm@10164
  1816
wenzelm@10003
  1817
* HOL/Lambda: converted into new-style theory and document;
paulson@9542
  1818
wenzelm@10003
  1819
* HOL/ex/Multiquote: example of multiple nested quotations and
wenzelm@10003
  1820
anti-quotations -- basically a generalized version of de-Bruijn
wenzelm@10003
  1821
representation; very useful in avoiding lifting of operations;
wenzelm@8848
  1822
wenzelm@9612
  1823
* HOL/record: added general record equality rule to simpset; fixed
wenzelm@9612
  1824
select-update simplification procedure to handle extended records as
wenzelm@9612
  1825
well; admit "r" as field name;
paulson@9542
  1826
paulson@8967
  1827
* HOL: 0 is now overloaded over the new sort "zero", allowing its use with
paulson@8967
  1828
other numeric types and also as the identity of groups, rings, etc.;
paulson@8967
  1829
paulson@8967
  1830
* HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
paulson@8967
  1831
Types nat and int belong to this axclass;
paulson@8967
  1832
wenzelm@10003
  1833
* HOL: greatly improved simplification involving numerals of type nat, int, real:
paulson@8788
  1834
   (i + #8 + j) = Suc k simplifies to  #7 + (i + j) = k
paulson@8832
  1835
   i*j + k + j*#3*i     simplifies to  #4*(i*j) + k
paulson@8832
  1836
  two terms #m*u and #n*u are replaced by #(m+n)*u
paulson@8832
  1837
    (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
paulson@8832
  1838
  and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
paulson@8832
  1839
    or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
paulson@8736
  1840
wenzelm@10003
  1841
* HOL: meson_tac is available (previously in ex/meson.ML); it is a
wenzelm@10003
  1842
powerful prover for predicate logic but knows nothing of clasets; see
wenzelm@10003
  1843
ex/mesontest.ML and ex/mesontest2.ML for example applications;
paulson@9835
  1844
wenzelm@8848
  1845
* HOL: new version of "case_tac" subsumes both boolean case split and
wenzelm@8440
  1846
"exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
wenzelm@8518
  1847
exists, may define val exhaust_tac = case_tac for ad-hoc portability;
wenzelm@8440
  1848
wenzelm@8848
  1849
* HOL: simplification no longer dives into case-expressions: only the
wenzelm@10129
  1850
selector expression is simplified, but not the remaining arms; to
wenzelm@10129
  1851
enable full simplification of case-expressions for datatype t, you may
wenzelm@10129
  1852
remove t.weak_case_cong from the simpset, either globally (Delcongs
wenzelm@10129
  1853
[thm"t.weak_case_cong"];) or locally (delcongs [...]).
nipkow@8603
  1854
wenzelm@8848
  1855
* HOL/recdef: the recursion equations generated by 'recdef' for
wenzelm@8848
  1856
function 'f' are now called f.simps instead of f.rules; if all
wenzelm@8848
  1857
termination conditions are proved automatically, these simplification
wenzelm@8848
  1858
rules are added to the simpset, as in primrec; rules may be named
wenzelm@8848
  1859
individually as well, resulting in a separate list of theorems for
wenzelm@8848
  1860
each equation;
wenzelm@8848
  1861
wenzelm@9489
  1862
* HOL/While is a new theory that provides a while-combinator. It
wenzelm@9489
  1863
permits the definition of tail-recursive functions without the
wenzelm@9489
  1864
provision of a termination measure. The latter is necessary once the
wenzelm@9489
  1865
invariant proof rule for while is applied.
nipkow@9457
  1866
wenzelm@10003
  1867
* HOL: new (overloaded) notation for the set of elements below/above
wenzelm@10003
  1868
some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
nipkow@8925
  1869
wenzelm@8848
  1870
* HOL: theorems impI, allI, ballI bound as "strip";
wenzelm@8848
  1871
wenzelm@10003
  1872
* HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
nipkow@9746
  1873
induct_tac th "x1 ... xn" expects th to have a conclusion of the form
nipkow@9746
  1874
P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
nipkow@9746
  1875
wenzelm@10003
  1876
* HOL/Real: "rabs" replaced by overloaded "abs" function;
nipkow@9737
  1877
wenzelm@10003
  1878
* HOL: theory Sexp now in HOL/Induct examples (it used to be part of
wenzelm@10003
  1879
main HOL, but was unused);
nipkow@8626
  1880
wenzelm@10003
  1881
* HOL: fewer consts declared as global (e.g. have to refer to
wenzelm@10003
  1882
"Lfp.lfp" instead of "lfp" internally; affects ML packages only);
wenzelm@8887
  1883
wenzelm@10003
  1884
* HOL: tuned AST representation of nested pairs, avoiding bogus output
wenzelm@10003
  1885
in case of overlap with user translations (e.g. judgements over
wenzelm@10003
  1886
tuples); (note that the underlying logical represenation is still
wenzelm@10003
  1887
bogus);
wenzelm@9349
  1888
nipkow@8412
  1889
paulson@9542
  1890
*** ZF ***
paulson@9542
  1891
wenzelm@10003
  1892
* ZF: simplification automatically cancels common terms in arithmetic
wenzelm@10003
  1893
expressions over nat and int;
paulson@9542
  1894
wenzelm@10003
  1895
* ZF: new treatment of nat to minimize type-checking: all operators
wenzelm@10003
  1896
coerce their operands to a natural number using the function natify,
wenzelm@10003
  1897
making the algebraic laws unconditional;
paulson@9542
  1898
wenzelm@10003
  1899
* ZF: as above, for int: operators coerce their operands to an integer
wenzelm@10003
  1900
using the function intify;
paulson@9542
  1901
wenzelm@10003
  1902
* ZF: the integer library now contains many of the usual laws for the
wenzelm@10003
  1903
orderings, including $<=, and monotonicity laws for $+ and $*;
paulson@9542
  1904
wenzelm@10003
  1905
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
wenzelm@10003
  1906
simplification;
paulson@9388
  1907
wenzelm@10003
  1908
* FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
wenzelm@10003
  1909
to the simplifier and classical reasoner simultaneously;
paulson@9388
  1910
paulson@9388
  1911
wenzelm@8358
  1912
*** General ***
wenzelm@8358
  1913
wenzelm@10003
  1914
* Provers: blast_tac now handles actual object-logic rules as
wenzelm@10003
  1915
assumptions; note that auto_tac uses blast_tac internally as well;
wenzelm@10003
  1916
wenzelm@10003
  1917
* Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
wenzelm@10003
  1918
outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
wenzelm@10003
  1919
wenzelm@9941
  1920
* Provers: delrules now handles destruct rules as well (no longer need
wenzelm@9941
  1921
explicit make_elim);
wenzelm@9941
  1922
wenzelm@10003
  1923
* Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
wenzelm@10003
  1924
  [| inj ?f;          ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
wenzelm@10003
  1925
use instead the strong form,
wenzelm@10003
  1926
  [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
wenzelm@10003
  1927
in HOL, FOL and ZF the function cla_make_elim will create such rules
wenzelm@10003
  1928
from destruct-rules;
wenzelm@9489
  1929
wenzelm@9709
  1930
* Provers: Simplifier.easy_setup provides a fast path to basic
wenzelm@9709
  1931
Simplifier setup for new object-logics;
wenzelm@9709
  1932
wenzelm@9709
  1933
* Pure: AST translation rules no longer require constant head on LHS;
wenzelm@9349
  1934
wenzelm@9709
  1935
* Pure: improved name spaces: ambiguous output is qualified; support
wenzelm@9709
  1936
for hiding of names;
wenzelm@8729
  1937
wenzelm@10003
  1938
* system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
wenzelm@10003
  1939
XSYMBOL_HOME; no longer need to do manual configuration in most
wenzelm@10003
  1940
situations;
wenzelm@10003
  1941
wenzelm@9709
  1942
* system: compression of ML heaps images may now be controlled via -c
wenzelm@9709
  1943
option of isabelle and isatool usedir (currently only observed by
wenzelm@9709
  1944
Poly/ML);
wenzelm@8358
  1945
wenzelm@9981
  1946
* system: isatool installfonts may handle X-Symbol fonts as well (very
wenzelm@9981
  1947
useful for remote X11);
wenzelm@9981
  1948
wenzelm@9709
  1949
* system: provide TAGS file for Isabelle sources;
wenzelm@9052
  1950
wenzelm@9288
  1951
* ML: infix 'OF' is a version of 'MRS' with more appropriate argument
wenzelm@9288
  1952
order;
wenzelm@9288
  1953
wenzelm@8994
  1954
* ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
wenzelm@8994
  1955
timing flag supersedes proof_timing and Toplevel.trace;
wenzelm@8994
  1956
wenzelm@10003
  1957
* ML: new combinators |>> and |>>> for incremental transformations
wenzelm@10003
  1958
with secondary results (e.g. certain theory extensions):
wenzelm@10003
  1959
wenzelm@9330
  1960
* ML: PureThy.add_defs gets additional argument to indicate potential
wenzelm@9330
  1961
overloading (usually false);
wenzelm@9330
  1962
wenzelm@10003
  1963
* ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
wenzelm@10003
  1964
results;
wenzelm@8440
  1965
wenzelm@8358
  1966
wenzelm@8015
  1967
wenzelm@7986
  1968
New in Isabelle99 (October 1999)
wenzelm@7986
  1969
--------------------------------
oheimb@4649
  1970
paulson@5931
  1971
*** Overview of INCOMPATIBILITIES (see below for more details) ***
paulson@5931
  1972
paulson@6922
  1973
* HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
paulson@6922
  1974
are no longer simplified.  (This allows the simplifier to unfold recursive
paulson@6922
  1975
functional programs.)  To restore the old behaviour, declare
wenzelm@7215
  1976
wenzelm@7215
  1977
    Delcongs [if_weak_cong];
paulson@6922
  1978
wenzelm@6269
  1979
* HOL: Removed the obsolete syntax "Compl A"; use -A for set
wenzelm@6269
  1980
complement;
paulson@5931
  1981
wenzelm@6269
  1982
* HOL: the predicate "inj" is now defined by translation to "inj_on";
paulson@6174
  1983
berghofe@7847
  1984
* HOL/datatype: mutual_induct_tac no longer exists --
berghofe@7847
  1985
  use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
berghofe@7847
  1986
wenzelm@6386
  1987
* HOL/typedef: fixed type inference for representing set; type
wenzelm@6386
  1988
arguments now have to occur explicitly on the rhs as type constraints;
wenzelm@6386
  1989
wenzelm@6269
  1990
* ZF: The con_defs part of an inductive definition may no longer refer
wenzelm@6269
  1991
to constants declared in the same theory;
nipkow@6057
  1992
wenzelm@6269
  1993
* HOL, ZF: the function mk_cases, generated by the inductive
wenzelm@6269
  1994
definition package, has lost an argument.  To simplify its result, it
wenzelm@6269
  1995
uses the default simpset instead of a supplied list of theorems.
paulson@6141
  1996
wenzelm@7215
  1997
* HOL/List: the constructors of type list are now Nil and Cons;
wenzelm@7215
  1998
nipkow@7619
  1999
* Simplifier: the type of the infix ML functions
wenzelm@8729
  2000
        setSSolver addSSolver setSolver addSolver
nipkow@7619
  2001
is now  simpset * solver -> simpset  where `solver' is a new abstract type
nipkow@7619
  2002
for packaging solvers. A solver is created via
wenzelm@8729
  2003
        mk_solver: string -> (thm list -> int -> tactic) -> solver
nipkow@7619
  2004
where the string argument is only a comment.
nipkow@6057
  2005
wenzelm@7647
  2006
paulson@6069
  2007
*** Proof tools ***
paulson@6069
  2008
wenzelm@6343
  2009
* Provers/Arith/fast_lin_arith.ML contains a functor for creating a
wenzelm@6343
  2010
decision procedure for linear arithmetic. Currently it is used for
wenzelm@7593
  2011
types `nat', `int', and `real' in HOL (see below); it can, should and
wenzelm@7593
  2012
will be instantiated for other types and logics as well.
paulson@6069
  2013
nipkow@7324
  2014
* The simplifier now accepts rewrite rules with flexible heads, eg
nipkow@7324
  2015
     hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
nipkow@7324
  2016
  They are applied like any rule with a non-pattern lhs, i.e. by first-order
nipkow@7324
  2017
  matching.
paulson@6069
  2018
wenzelm@7593
  2019
paulson@6014
  2020
*** General ***
paulson@6014
  2021
wenzelm@7986
  2022
* New Isabelle/Isar subsystem provides an alternative to traditional
wenzelm@7215
  2023
tactical theorem proving; together with the ProofGeneral/isar user
wenzelm@7215
  2024
interface it offers an interactive environment for developing human
wenzelm@7215
  2025
readable proof documents (Isar == Intelligible semi-automated
wenzelm@7886
  2026
reasoning); for further information see isatool doc isar-ref,
wenzelm@7986
  2027
src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
wenzelm@7886
  2028
wenzelm@9612
  2029
* improved and simplified presentation of theories: better HTML markup
wenzelm@9612
  2030
(including colors), graph views in several sizes; isatool usedir now
wenzelm@9612
  2031
provides a proper interface for user theories (via -P option); actual
wenzelm@9612
  2032
document preparation based on (PDF)LaTeX is available as well (for
wenzelm@9612
  2033
new-style theories only); see isatool doc system for more information;
wenzelm@7215
  2034
wenzelm@7252
  2035
* native support for Proof General, both for classic Isabelle and
wenzelm@7986
  2036
Isabelle/Isar;
wenzelm@7215
  2037
wenzelm@7791
  2038
* ML function thm_deps visualizes dependencies of theorems and lemmas,
wenzelm@7791
  2039
using the graph browser tool;
wenzelm@7791
  2040
wenzelm@6751
  2041
* Isabelle manuals now also available as PDF;
wenzelm@6751
  2042
wenzelm@6449
  2043
* theory loader rewritten from scratch (may not be fully
wenzelm@6449
  2044
bug-compatible); old loadpath variable has been replaced by show_path,
wenzelm@6671
  2045
add_path, del_path, reset_path functions; new operations such as
wenzelm@7593
  2046
update_thy, touch_thy, remove_thy, use/update_thy_only (see also
wenzelm@7593
  2047
isatool doc ref);
wenzelm@6449
  2048
wenzelm@7215
  2049
* improved isatool install: option -k creates KDE application icon,
wenzelm@7215
  2050
option -p DIR installs standalone binaries;
wenzelm@7215
  2051
wenzelm@7215
  2052
* added ML_PLATFORM setting (useful for cross-platform installations);
wenzelm@7215
  2053
more robust handling of platform specific ML images for SML/NJ;
wenzelm@7215
  2054
wenzelm@7886
  2055
* the settings environment is now statically scoped, i.e. it is never
wenzelm@7986
  2056
created again in sub-processes invoked from isabelle, isatool, or
wenzelm@7886
  2057
Isabelle;
wenzelm@7886
  2058
wenzelm@7215
  2059
* path element specification '~~' refers to '$ISABELLE_HOME';
wenzelm@7215
  2060
wenzelm@6343
  2061
* in locales, the "assumes" and "defines" parts may be omitted if
wenzelm@6343
  2062
empty;
wenzelm@5973
  2063
wenzelm@6269
  2064
* new print_mode "xsymbols" for extended symbol support (e.g. genuine
wenzelm@6269
  2065
long arrows);
wenzelm@6259
  2066
wenzelm@6343
  2067
* new print_mode "HTML";
wenzelm@6343
  2068
wenzelm@6343
  2069
* new flag show_tags controls display of tags of theorems (which are
wenzelm@6343
  2070
basically just comments that may be attached by some tools);
wenzelm@6343
  2071
wenzelm@6461
  2072
* Isamode 2.6 requires patch to accomodate change of Isabelle font
wenzelm@6461
  2073
mode and goal output format:
wenzelm@6461
  2074
wenzelm@6461
  2075
diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
wenzelm@6461
  2076
244c244
wenzelm@6461
  2077
<       (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
wenzelm@6461
  2078
---
wenzelm@6533
  2079
>       (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
wenzelm@6461
  2080
diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
wenzelm@6461
  2081
181c181
wenzelm@6461
  2082
< (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
wenzelm@6461
  2083
---
wenzelm@6461
  2084
> (defconst proofstate-proofstart-regexp "^Level [0-9]+"
wenzelm@6461
  2085
wenzelm@7450
  2086
* function bind_thms stores lists of theorems (cf. bind_thm);
wenzelm@7450
  2087
wenzelm@7593
  2088
* new shorthand tactics ftac, eatac, datac, fatac;
wenzelm@7593
  2089
wenzelm@7593
  2090
* qed (and friends) now accept "" as result name; in that case the
wenzelm@7986
  2091
theorem is not stored, but proper checks and presentation of the
wenzelm@7986
  2092
result still apply;
wenzelm@7593
  2093
wenzelm@7805
  2094
* theorem database now also indexes constants "Trueprop", "all",
wenzelm@7805
  2095
"==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
wenzelm@7805
  2096
oheimb@6028
  2097
nipkow@6057
  2098
*** HOL ***
nipkow@6057
  2099
wenzelm@7215
  2100
** HOL arithmetic **
wenzelm@7215
  2101
wenzelm@6343
  2102
* There are now decision procedures for linear arithmetic over nat and
wenzelm@6343
  2103
int:
nipkow@6131
  2104
wenzelm@6343
  2105
1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
wenzelm@6343
  2106
`+', `-', `Suc', `min', `max' and numerical constants; other subterms
wenzelm@6343
  2107
are treated as atomic; subformulae not involving type `nat' or `int'
wenzelm@6343
  2108
are ignored; quantified subformulae are ignored unless they are
wenzelm@6343
  2109
positive universal or negative existential. The tactic has to be
wenzelm@6343
  2110
invoked by hand and can be a little bit slow. In particular, the
wenzelm@6343
  2111
running time is exponential in the number of occurrences of `min' and
wenzelm@6343
  2112
`max', and `-' on `nat'.
nipkow@6131
  2113
wenzelm@6343
  2114
2. fast_arith_tac is a cut-down version of arith_tac: it only takes
wenzelm@6343
  2115
(negated) (in)equalities among the premises and the conclusion into
wenzelm@6343
  2116
account (i.e. no compound formulae) and does not know about `min' and
wenzelm@6343
  2117
`max', and `-' on `nat'. It is fast and is used automatically by the
wenzelm@6343
  2118
simplifier.
nipkow@6131
  2119
wenzelm@6343
  2120
NB: At the moment, these decision procedures do not cope with mixed
wenzelm@6343
  2121
nat/int formulae where the two parts interact, such as `m < n ==>
wenzelm@6343
  2122
int(m) < int(n)'.
oheimb@6028
  2123
wenzelm@7215
  2124
* HOL/Numeral provides a generic theory of numerals (encoded
wenzelm@7313
  2125
efficiently as bit strings); setup for types nat/int/real is in place;
wenzelm@7215
  2126
INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
wenzelm@7215
  2127
int, existing theories and proof scripts may require a few additional
wenzelm@7215
  2128
type constraints;
wenzelm@7215
  2129
wenzelm@7215
  2130
* integer division and remainder can now be performed on constant
wenzelm@7215
  2131
arguments;
paulson@7157
  2132
wenzelm@7215
  2133
* many properties of integer multiplication, division and remainder
wenzelm@7215
  2134
are now available;
paulson@6922
  2135
paulson@7287
  2136
* An interface to the Stanford Validity Checker (SVC) is available through the
paulson@7287
  2137
tactic svc_tac.  Propositional tautologies and theorems of linear arithmetic
paulson@7287
  2138
are proved automatically.  SVC must be installed separately, and its results
paulson@7287
  2139
must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
paulson@7287
  2140
invocation of the underlying oracle).  For SVC see
paulson@7444
  2141
  http://verify.stanford.edu/SVC
paulson@6922
  2142
wenzelm@7125
  2143
* IsaMakefile: the HOL-Real target now builds an actual image;
wenzelm@7125
  2144
wenzelm@7215
  2145
wenzelm@7215
  2146
** HOL misc **
wenzelm@7215
  2147
wenzelm@7595
  2148
* HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
wenzelm@7595
  2149
(in Isabelle/Isar) -- by Gertrud Bauer;
wenzelm@7595
  2150
wenzelm@7691
  2151
* HOL/BCV: generic model of bytecode verification, i.e. data-flow
wenzelm@7691
  2152
analysis for assembly languages with subtypes;
wenzelm@7691
  2153
wenzelm@6278
  2154
* HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
wenzelm@6278
  2155
-- avoids syntactic ambiguities and treats state, transition, and
wenzelm@6278
  2156
temporal levels more uniformly; introduces INCOMPATIBILITIES due to
wenzelm@6278
  2157
changed syntax and (many) tactics;
wenzelm@6278
  2158
wenzelm@7791
  2159
* HOL/inductive: Now also handles more general introduction rules such
wenzelm@7791
  2160
  as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
wenzelm@7791
  2161
  theorems are now maintained within the theory (maintained via the
wenzelm@7791
  2162
  "mono" attribute);
berghofe@7780
  2163
wenzelm@7238
  2164
* HOL/datatype: Now also handles arbitrarily branching datatypes
wenzelm@7238
  2165
  (using function types) such as
wenzelm@7238
  2166
wenzelm@7238
  2167
  datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
berghofe@7047
  2168
wenzelm@7326
  2169
* HOL/record: record_simproc (part of the default simpset) takes care
wenzelm@7326
  2170
of selectors applied to updated records; record_split_tac is no longer
wenzelm@7327
  2171
part of the default claset; update_defs may now be removed from the
wenzelm@7327
  2172
simpset in many cases; COMPATIBILITY: old behavior achieved by
wenzelm@7326
  2173
wenzelm@7326
  2174
  claset_ref () := claset() addSWrapper record_split_wrapper;
wenzelm@7326
  2175
  Delsimprocs [record_simproc]
wenzelm@7326
  2176
wenzelm@6386
  2177
* HOL/typedef: fixed type inference for representing set; type
wenzelm@6386
  2178
arguments now have to occur explicitly on the rhs as type constraints;
wenzelm@6386
  2179
paulson@7287
  2180
* HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
paulson@7287
  2181
names rather than an ML expression;
paulson@7287
  2182
paulson@7287
  2183
* HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
paulson@7287
  2184
supplied later.  Program schemes can be defined, such as
paulson@7287
  2185
    "While B C s = (if B s then While B C (C s) else s)"
paulson@7287
  2186
where the well-founded relation can be chosen after B and C have been given.
wenzelm@6563
  2187
wenzelm@7215
  2188
* HOL/List: the constructors of type list are now Nil and Cons;
wenzelm@7215
  2189
INCOMPATIBILITY: while [] and infix # syntax is still there, of
wenzelm@7215
  2190
course, ML tools referring to List.list.op # etc. have to be adapted;
wenzelm@7215
  2191
wenzelm@7238
  2192
* HOL_quantifiers flag superseded by "HOL" print mode, which is
wenzelm@7238
  2193
disabled by default; run isabelle with option -m HOL to get back to
wenzelm@7238
  2194
the original Gordon/HOL-style output;
wenzelm@7238
  2195
wenzelm@7238
  2196
* HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
wenzelm@7238
  2197
ALL x<=y. P, EX x<y. P, EX x<=y. P;
wenzelm@7238
  2198
wenzelm@7238
  2199
* HOL basic syntax simplified (more orthogonal): all variants of
wenzelm@7238
  2200
All/Ex now support plain / symbolic / HOL notation; plain syntax for
wenzelm@7238
  2201
Eps operator is provided as well: "SOME x. P[x]";
wenzelm@7238
  2202
berghofe@7320
  2203
* HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
wenzelm@7261
  2204
wenzelm@7280
  2205
* HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
wenzelm@7280
  2206
thus available for user theories;
wenzelm@7280
  2207
wenzelm@7300
  2208
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
wenzelm@7300
  2209
HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
wenzelm@7300
  2210
time;
wenzelm@7300
  2211
wenzelm@7986
  2212
* HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
wenzelm@7986
  2213
several times and then mp;
oheimb@7492
  2214
wenzelm@7215
  2215
paulson@7113
  2216
*** LK ***
paulson@7113
  2217
wenzelm@7215
  2218
* the notation <<...>> is now available as a notation for sequences of
wenzelm@7215
  2219
formulas;
paulson@7113
  2220
paulson@7113
  2221
* the simplifier is now installed
paulson@7113
  2222
wenzelm@8729
  2223
* the axiom system has been generalized (thanks to Soren Heilmann)
paulson@7113
  2224
paulson@7113
  2225
* the classical reasoner now has a default rule database
paulson@7113
  2226
paulson@7113
  2227
paulson@6064
  2228
*** ZF ***
paulson@6064
  2229
paulson@6064
  2230
* new primrec section allows primitive recursive functions to be given
wenzelm@6269
  2231
directly (as in HOL) over datatypes and the natural numbers;
paulson@6064
  2232
wenzelm@6269
  2233
* new tactics induct_tac and exhaust_tac for induction (or case
wenzelm@6269
  2234
analysis) over datatypes and the natural numbers;
paulson@6064
  2235
paulson@6064
  2236
* the datatype declaration of type T now defines the recursor T_rec;
paulson@6064
  2237
paulson@6141
  2238
* simplification automatically does freeness reasoning for datatype
wenzelm@6269
  2239
constructors;
paulson@6141
  2240
wenzelm@6269
  2241
* automatic type-inference, with AddTCs command to insert new
wenzelm@6269
  2242
type-checking rules;
paulson@6155
  2243
wenzelm@6269
  2244
* datatype introduction rules are now added as Safe Introduction rules
wenzelm@6269
  2245
to the claset;
paulson@6155
  2246
wenzelm@6269
  2247
* the syntax "if P then x else y" is now available in addition to
wenzelm@6269
  2248
if(P,x,y);
wenzelm@6269
  2249
paulson@6069
  2250
wenzelm@6343
  2251
*** Internal programming interfaces ***
wenzelm@6343
  2252
wenzelm@7919
  2253
* tuned simplifier trace output; new flag debug_simp;
wenzelm@7919
  2254
wenzelm@7420
  2255
* structures Vartab / Termtab (instances of TableFun) offer efficient
wenzelm@7420
  2256
tables indexed by indexname_ord / term_ord (compatible with aconv);
wenzelm@7420
  2257
wenzelm@6386
  2258
* AxClass.axclass_tac lost the theory argument;
wenzelm@6386
  2259
wenzelm@6343
  2260
* tuned current_goals_markers semantics: begin / end goal avoids
wenzelm@6343
  2261
printing empty lines;
wenzelm@6343
  2262
wenzelm@6343
  2263
* removed prs and prs_fn hook, which was broken because it did not
wenzelm@6343
  2264
include \n in its semantics, forcing writeln to add one
wenzelm@6343
  2265
uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
wenzelm@6343
  2266
string -> unit if you really want to output text without newline;
wenzelm@6343
  2267
wenzelm@6343
  2268
* Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
wenzelm@6343
  2269
plain output, interface builders may have to enable 'isabelle_font'
wenzelm@6343
  2270
mode to get Isabelle font glyphs as before;
wenzelm@6343
  2271
wenzelm@6343
  2272
* refined token_translation interface; INCOMPATIBILITY: output length
wenzelm@6343
  2273
now of type real instead of int;
wenzelm@6343
  2274
wenzelm@7196
  2275
* theory loader actions may be traced via new ThyInfo.add_hook
wenzelm@7196
  2276
interface (see src/Pure/Thy/thy_info.ML); example application: keep
wenzelm@7196
  2277
your own database of information attached to *whole* theories -- as
wenzelm@7196
  2278
opposed to intra-theory data slots offered via TheoryDataFun;
wenzelm@7196
  2279
wenzelm@7647
  2280
* proper handling of dangling sort hypotheses (at last!);
wenzelm@7647
  2281
Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
wenzelm@7647
  2282
extra sort hypotheses that can be witnessed from the type signature;
wenzelm@7986
  2283
the force_strip_shyps flag is gone, any remaining shyps are simply
wenzelm@7986
  2284
left in the theorem (with a warning issued by strip_shyps_warning);
wenzelm@7647
  2285
wenzelm@6343
  2286
paulson@6064
  2287
wenzelm@5781
  2288
New in Isabelle98-1 (October 1998)
wenzelm@5781
  2289
----------------------------------
wenzelm@5781
  2290
wenzelm@5127
  2291
*** Overview of INCOMPATIBILITIES (see below for more details) ***
wenzelm@4842
  2292
wenzelm@5726
  2293
* several changes of automated proof tools;
wenzelm@5373
  2294
wenzelm@5726
  2295
* HOL: major changes to the inductive and datatype packages, including
wenzelm@5726
  2296
some minor incompatibilities of theory syntax;
berghofe@5214
  2297
wenzelm@5726
  2298
* HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
wenzelm@5217
  2299
called `inj_on';
paulson@5160
  2300
nipkow@5275
  2301
* HOL: removed duplicate thms in Arith:
nipkow@5275
  2302
  less_imp_add_less  should be replaced by  trans_less_add1
nipkow@5275
  2303
  le_imp_add_le      should be replaced by  trans_le_add1
paulson@5160
  2304
wenzelm@5726
  2305
* HOL: unary minus is now overloaded (new type constraints may be
wenzelm@5726
  2306
required);
paulson@5490
  2307
wenzelm@5726
  2308
* HOL and ZF: unary minus for integers is now #- instead of #~.  In
wenzelm@5726
  2309
ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
wenzelm@5726
  2310
now taken as an integer constant.
paulson@5541
  2311
wenzelm@5726
  2312
* Pure: ML function 'theory_of' renamed to 'theory';
wenzelm@5397
  2313
wenzelm@5363
  2314
wenzelm@5127
  2315
*** Proof tools ***
nipkow@4880
  2316
nipkow@5657
  2317
* Simplifier:
nipkow@5657
  2318
  1. Asm_full_simp_tac is now more aggressive.
nipkow@5657
  2319
     1. It will sometimes reorient premises if that increases their power to
nipkow@5657
  2320
        simplify.
nipkow@5657
  2321
     2. It does no longer proceed strictly from left to right but may also
nipkow@5657
  2322
        rotate premises to achieve further simplification.
nipkow@5657
  2323
     For compatibility reasons there is now Asm_lr_simp_tac which is like the
nipkow@5657
  2324
     old Asm_full_simp_tac in that it does not rotate premises.
nipkow@5657
  2325
  2. The simplifier now knows a little bit about nat-arithmetic.
nipkow@4880
  2326
wenzelm@5127
  2327
* Classical reasoner: wrapper mechanism for the classical reasoner now
wenzelm@5127
  2328
allows for selected deletion of wrappers, by introduction of names for
wenzelm@5127
  2329
wrapper functionals.  This implies that addbefore, addSbefore,
wenzelm@5127
  2330
addaltern, and addSaltern now take a pair (name, tactic) as argument,
wenzelm@5127
  2331
and that adding two tactics with the same name overwrites the first
wenzelm@5127
  2332
one (emitting a warning).
oheimb@4824
  2333
  type wrapper = (int -> tactic) -> (int -> tactic)
oheimb@4649
  2334
  setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
oheimb@4824
  2335
  addWrapper, addSWrapper: claset * (string * wrapper) -> claset
oheimb@4824
  2336
  delWrapper, delSWrapper: claset *  string            -> claset
oheimb@4649
  2337
  getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
oheimb@4649
  2338
wenzelm@5705
  2339
* Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
wenzelm@5726
  2340
semantics; addbefore now affects only the unsafe part of step_tac
wenzelm@5726
  2341
etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
wenzelm@5726
  2342
FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
wenzelm@5726
  2343
by Force_tac;
oheimb@5524
  2344
wenzelm@5726
  2345
* Classical reasoner: setwrapper to setWrapper and compwrapper to
wenzelm@5726
  2346
compWrapper; added safe wrapper (and access functions for it);
oheimb@5524
  2347
wenzelm@5127
  2348
* HOL/split_all_tac is now much faster and fails if there is nothing
wenzelm@5726
  2349
to split.  Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
wenzelm@5726
  2350
and the names of the automatically generated variables have changed.
wenzelm@5726
  2351
split_all_tac has moved within claset() from unsafe wrappers to safe
wenzelm@5726
  2352
wrappers, which means that !!-bound variables are split much more
wenzelm@5726
  2353
aggressively, and safe_tac and clarify_tac now split such variables.
wenzelm@5726
  2354
If this splitting is not appropriate, use delSWrapper "split_all_tac".
wenzelm@5726
  2355
Note: the same holds for record_split_tac, which does the job of
wenzelm@5726
  2356
split_all_tac for record fields.
wenzelm@5127
  2357
wenzelm@5726
  2358
* HOL/Simplifier: Rewrite rules for case distinctions can now be added
wenzelm@5726
  2359
permanently to the default simpset using Addsplits just like
wenzelm@5726
  2360
Addsimps. They can be removed via Delsplits just like
wenzelm@5726
  2361
Delsimps. Lower-case versions are also available.
wenzelm@5127
  2362
wenzelm@5726
  2363
* HOL/Simplifier: The rule split_if is now part of the default
wenzelm@5726
  2364
simpset. This means that the simplifier will eliminate all occurrences
wenzelm@5726
  2365
of if-then-else in the conclusion of a goal. To prevent this, you can
wenzelm@5726
  2366
either remove split_if completely from the default simpset by
wenzelm@5726
  2367
`Delsplits [split_if]' or remove it in a specific call of the
wenzelm@5726
  2368
simplifier using `... delsplits [split_if]'.  You can also add/delete
wenzelm@5726
  2369
other case splitting rules to/from the default simpset: every datatype
wenzelm@5726
  2370
generates suitable rules `split_t_case' and `split_t_case_asm' (where
wenzelm@5726
  2371
t is the name of the datatype).
wenzelm@5127
  2372
wenzelm@5726
  2373
* Classical reasoner / Simplifier combination: new force_tac (and
wenzelm@5127
  2374
derivatives Force_tac, force) combines rewriting and classical
wenzelm@5127
  2375
reasoning (and whatever other tools) similarly to auto_tac, but is
wenzelm@5726
  2376
aimed to solve the given subgoal completely.
wenzelm@5127
  2377
wenzelm@5127
  2378
wenzelm@5127
  2379
*** General ***
wenzelm@5127
  2380
wenzelm@5217
  2381
* new top-level commands `Goal' and `Goalw' that improve upon `goal'
wenzelm@5127
  2382
and `goalw': the theory is no longer needed as an explicit argument -
wenzelm@5127
  2383
the current theory context is used; assumptions are no longer returned
wenzelm@5127
  2384
at the ML-level unless one of them starts with ==> or !!; it is
wenzelm@5217
  2385
recommended to convert to these new commands using isatool fixgoal
wenzelm@5217
  2386
(backup your sources first!);
wenzelm@4842
  2387
wenzelm@5217
  2388
* new top-level commands 'thm' and 'thms' for retrieving theorems from
wenzelm@5207
  2389
the current theory context, and 'theory' to lookup stored theories;
paulson@4806
  2390
paulson@5722
  2391
* new theory section 'locale' for declaring constants, assumptions and
paulson@5722
  2392
definitions that have local scope;
paulson@5722
  2393
wenzelm@5127
  2394
* new theory section 'nonterminals' for purely syntactic types;
wenzelm@4858
  2395
wenzelm@5127
  2396
* new theory section 'setup' for generic ML setup functions
wenzelm@5127
  2397
(e.g. package initialization);
wenzelm@4869
  2398
wenzelm@5131
  2399
* the distribution now includes Isabelle icons: see
wenzelm@5131
  2400
lib/logo/isabelle-{small,tiny}.xpm;
wenzelm@5131
  2401
wenzelm@5363
  2402
* isatool install - install binaries with absolute references to
wenzelm@5363
  2403
ISABELLE_HOME/bin;
wenzelm@5363
  2404
wenzelm@5572
  2405
* isatool logo -- create instances of the Isabelle logo (as EPS);
wenzelm@5572
  2406
wenzelm@5407
  2407
* print mode 'emacs' reserved for Isamode;
wenzelm@5407
  2408
wenzelm@5726
  2409
* support multiple print (ast) translations per constant name;
wenzelm@5726
  2410
wenzelm@6925
  2411
* theorems involving oracles are now printed with a suffixed [!];
wenzelm@6925
  2412
wenzelm@4711
  2413
paulson@4661
  2414
*** HOL ***
paulson@4661
  2415
wenzelm@5710
  2416
* there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
nipkow@5709
  2417
wenzelm@5217
  2418
* HOL/inductive package reorganized and improved: now supports mutual
paulson@5267
  2419
definitions such as
wenzelm@5217
  2420
wenzelm@5217
  2421
  inductive EVEN ODD
wenzelm@5217
  2422
    intrs
wenzelm@5217
  2423
      null "0 : EVEN"
wenzelm@5217
  2424
      oddI "n : EVEN ==> Suc n : ODD"
wenzelm@5217
  2425
      evenI "n : ODD ==> Suc n : EVEN"
wenzelm@5217
  2426
wenzelm@5217
  2427
new theorem list "elims" contains an elimination rule for each of the
wenzelm@5217
  2428
recursive sets; inductive definitions now handle disjunctive premises
wenzelm@5217
  2429
correctly (also ZF);
berghofe@5214
  2430
wenzelm@5217
  2431
INCOMPATIBILITIES: requires Inductive as an ancestor; component
wenzelm@5217
  2432
"mutual_induct" no longer exists - the induction rule is always
wenzelm@5217
  2433
contained in "induct";
wenzelm@5217
  2434
wenzelm@5217
  2435
wenzelm@5217
  2436
* HOL/datatype package re-implemented and greatly improved: now
paulson@5267
  2437
supports mutually recursive datatypes such as
wenzelm@5217
  2438
wenzelm@5217
  2439
  datatype
wenzelm@5217
  2440
    'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
wenzelm@5217
  2441
            | SUM ('a aexp) ('a aexp)
wenzelm@5217
  2442
            | DIFF ('a aexp) ('a aexp)
wenzelm@5217
  2443
            | NUM 'a
wenzelm@5217
  2444
  and
wenzelm@5217
  2445
    'a bexp = LESS ('a aexp) ('a aexp)
wenzelm@5217
  2446
            | AND ('a bexp) ('a bexp)
wenzelm@5217
  2447
            | OR ('a bexp) ('a bexp)
wenzelm@5217
  2448
paulson@5267
  2449
as well as indirectly recursive datatypes such as
berghofe@5214
  2450
wenzelm@5217
  2451
  datatype
wenzelm@5217
  2452
    ('a, 'b) term = Var 'a
wenzelm@5217
  2453
                  | App 'b ((('a, 'b) term) list)
berghofe@5214
  2454
wenzelm@5217
  2455
The new tactic  mutual_induct_tac [<var_1>, ..., <var_n>] i  performs
wenzelm@5217
  2456
induction on mutually / indirectly recursive datatypes.
wenzelm@5217
  2457
wenzelm@5217
  2458
Primrec equations are now stored in theory and can be accessed via
wenzelm@5217
  2459
<function_name>.simps.
wenzelm@5217
  2460
wenzelm@5217
  2461
INCOMPATIBILITIES:
berghofe@5214
  2462
wenzelm@5217
  2463
  - Theories using datatypes must now have theory Datatype as an
wenzelm@5217
  2464
    ancestor.
wenzelm@5217
  2465
  - The specific <typename>.induct_tac no longer exists - use the
wenzelm@5217
  2466
    generic induct_tac instead.
berghofe@5226
  2467
  - natE has been renamed to nat.exhaust - use exhaust_tac
wenzelm@5217
  2468
    instead of res_inst_tac ... natE. Note that the variable
berghofe@5226
  2469
    names in nat.exhaust differ from the names in natE, this
wenzelm@5217
  2470
    may cause some "fragile" proofs to fail.
wenzelm@5217
  2471
  - The theorems split_<typename>_case and split_<typename>_case_asm
wenzelm@5217
  2472
    have been renamed to <typename>.split and <typename>.split_asm.
wenzelm@5217
  2473
  - Since default sorts of type variables are now handled correctly,
wenzelm@5217
  2474
    some datatype definitions may have to be annotated with explicit
wenzelm@5217
  2475
    sort constraints.
wenzelm@5217
  2476
  - Primrec definitions no longer require function name and type
wenzelm@5217
  2477
    of recursive argument.
berghofe@5214
  2478
wenzelm@5217
  2479
Consider using isatool fixdatatype to adapt your theories and proof
wenzelm@5217
  2480
scripts to the new package (backup your sources first!).
wenzelm@5217
  2481
wenzelm@5217
  2482
wenzelm@5726
  2483
* HOL/record package: considerably improved implementation; now
wenzelm@5726
  2484
includes concrete syntax for record types, terms, updates; theorems
wenzelm@5726
  2485
for surjective pairing and splitting !!-bound record variables; proof
wenzelm@5726
  2486
support is as follows:
wenzelm@5726
  2487
wenzelm@5726
  2488
  1) standard conversions (selectors or updates applied to record
wenzelm@5726
  2489
constructor terms) are part of the standard simpset;
wenzelm@5726
  2490
wenzelm@5726
  2491
  2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
wenzelm@5726
  2492
made part of standard simpset and claset via addIffs;
wenzelm@5726
  2493
wenzelm@5726
  2494
  3) a tactic for record field splitting (record_split_tac) is part of
wenzelm@5726
  2495
the standard claset (addSWrapper);
wenzelm@5726
  2496
wenzelm@5726
  2497
To get a better idea about these rules you may retrieve them via
wenzelm@5726
  2498
something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
wenzelm@5726
  2499
the name of your record type.
wenzelm@5726
  2500
wenzelm@5726
  2501
The split tactic 3) conceptually simplifies by the following rule:
wenzelm@5726
  2502
wenzelm@5726
  2503
  "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
wenzelm@5726
  2504
wenzelm@5726
  2505
Thus any record variable that is bound by meta-all will automatically
wenzelm@5726
  2506
blow up into some record constructor term, consequently the
wenzelm@5726
  2507
simplifications of 1), 2) apply.  Thus force_tac, auto_tac etc. shall
wenzelm@5726
  2508
solve record problems automatically.
wenzelm@5726
  2509
berghofe@5214
  2510
wenzelm@5125
  2511
* reorganized the main HOL image: HOL/Integ and String loaded by
wenzelm@5125
  2512
default; theory Main includes everything;
wenzelm@5125
  2513
paulson@5650
  2514
* automatic simplification of integer sums and comparisons, using cancellation;
paulson@5650
  2515
oheimb@5526
  2516
* added option_map_eq_Some and not_Some_eq to the default simpset and claset;
wenzelm@5127
  2517
wenzelm@5127
  2518
* added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
wenzelm@5127
  2519
wenzelm@5127
  2520
* many new identities for unions, intersections, set difference, etc.;
wenzelm@5127
  2521
wenzelm@5127
  2522
* expand_if, expand_split, expand_sum_case and expand_nat_case are now
wenzelm@5127
  2523
called split_if, split_split, split_sum_case and split_nat_case (to go
wenzelm@5127
  2524
with add/delsplits);
wenzelm@5125
  2525
wenzelm@5127
  2526
* HOL/Prod introduces simplification procedure unit_eq_proc rewriting
wenzelm@5127
  2527
(?x::unit) = (); this is made part of the default simpset, which COULD
wenzelm@5127
  2528
MAKE EXISTING PROOFS FAIL under rare circumstances (consider
wenzelm@5207
  2529
'Delsimprocs [unit_eq_proc];' as last resort); also note that
wenzelm@5207
  2530
unit_abs_eta_conv is added in order to counter the effect of
wenzelm@5207
  2531
unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
wenzelm@5207
  2532
%u.f();
wenzelm@5125
  2533
wenzelm@5217
  2534
* HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
wenzelm@5217
  2535
makes more sense);
berghofe@5109
  2536
paulson@5475
  2537
* HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
paulson@5475
  2538
  It and 'sym RS equals0D' are now in the default  claset, giving automatic
paulson@5475
  2539
  disjointness reasoning but breaking a few old proofs.
paulson@5267
  2540
wenzelm@5217
  2541
* HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
wenzelm@5217
  2542
to 'converse' from 'inverse' (for compatibility with ZF and some
wenzelm@5217
  2543
literature);
wenzelm@5085
  2544
wenzelm@5127
  2545
* HOL/recdef can now declare non-recursive functions, with {} supplied as
wenzelm@5127
  2546
the well-founded relation;
oheimb@4838
  2547
paulson@5490
  2548
* HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
paulson@5490
  2549
    Compl A.  The "Compl" syntax remains available as input syntax for this
paulson@5490
  2550
    release ONLY.
paulson@5490
  2551
wenzelm@5127
  2552
* HOL/Update: new theory of function updates:
wenzelm@5127
  2553
    f(a:=b) == %x. if x=a then b else f x
wenzelm@5127
  2554
may also be iterated as in f(a:=b,c:=d,...);
nipkow@5077
  2555
wenzelm@5127
  2556
* HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
paulson@4899
  2557
nipkow@5282
  2558
* HOL/List:
nipkow@5282
  2559
  - new function list_update written xs[i:=v] that updates the i-th
nipkow@5282
  2560
    list position. May also be iterated as in xs[i:=a,j:=b,...].
nipkow@5428
  2561
  - new function `upt' written [i..j(] which generates the list
nipkow@5428
  2562
    [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
nipkow@5428
  2563
    bound write [i..j], which is a shorthand for [i..j+1(].
nipkow@5282
  2564
  - new lexicographic orderings and corresponding wellfoundedness theorems.
paulson@4779
  2565
wenzelm@5127
  2566
* HOL/Arith:
wenzelm@5127
  2567
  - removed 'pred' (predecessor) function;
wenzelm@5127
  2568
  - generalized some theorems about n-1;
wenzelm@5127
  2569
  - many new laws about "div" and "mod";
wenzelm@5127
  2570
  - new laws about greatest common divisors (see theory ex/Primes);
oheimb@4766
  2571
wenzelm@5127
  2572
* HOL/Relation: renamed the relational operator r^-1 "converse"
wenzelm@4842
  2573
instead of "inverse";
wenzelm@4711
  2574
nipkow@5651
  2575
* HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
nipkow@5651
  2576
  of the multiset ordering;
nipkow@5651
  2577
wenzelm@5127
  2578
* directory HOL/Real: a construction of the reals using Dedekind cuts
nipkow@5651
  2579
  (not included by default);
nipkow@4835
  2580
wenzelm@5127
  2581
* directory HOL/UNITY: Chandy and Misra's UNITY formalism;
wenzelm@4711
  2582
nipkow@5651
  2583
* directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
nipkow@5651
  2584
  programs, i.e. different program variables may have different types.
nipkow@5651
  2585
paulson@5142
  2586
* calling (stac rew i) now fails if "rew" has no effect on the goal
paulson@5142
  2587
  [previously, this check worked only if the rewrite rule was unconditional]
paulson@5308
  2588
  Now rew can involve either definitions or equalities (either == or =).
wenzelm@5002
  2589
wenzelm@5363
  2590
paulson@4879
  2591
*** ZF ***
paulson@4879
  2592
paulson@5332
  2593
* theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
paulson@5332
  2594
  only the theorems proved on ZF.ML;
paulson@5160
  2595
paulson@5475
  2596
* ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
paulson@5475
  2597
  It and 'sym RS equals0D' are now in the default  claset, giving automatic
paulson@5475
  2598
  disjointness reasoning but breaking a few old proofs.
paulson@5267
  2599
paulson@5160
  2600
* ZF/Update: new theory of function updates
paulson@5160
  2601
    with default rewrite rule  f(x:=y) ` z = if(z=x, y, f`z)
paulson@5160
  2602
  may also be iterated as in f(a:=b,c:=d,...);
paulson@5160
  2603
paulson@4879
  2604
* in  let x=t in u(x), neither t nor u(x) has to be an FOL term.
oheimb@4649
  2605
paulson@5142
  2606
* calling (stac rew i) now fails if "rew" has no effect on the goal
paulson@5142
  2607
  [previously, this check worked only if the rewrite rule was unconditional]
paulson@5308
  2608
  Now rew can involve either definitions or equalities (either == or =).
paulson@5142
  2609
paulson@5160
  2610
* case_tac provided for compatibility with HOL
paulson@5160
  2611
    (like the old excluded_middle_tac, but with subgoals swapped)
paulson@5160
  2612
wenzelm@4842
  2613
wenzelm@5127
  2614
*** Internal programming interfaces ***
wenzelm@5002
  2615
wenzelm@5251
  2616
* Pure: several new basic modules made available for general use, see
wenzelm@5251
  2617
also src/Pure/README;
wenzelm@5207
  2618
wenzelm@5008
  2619
* improved the theory data mechanism to support encapsulation (data
wenzelm@5008
  2620
kind name replaced by private Object.kind, acting as authorization
wenzelm@5373
  2621
key); new type-safe user interface via functor TheoryDataFun; generic
wenzelm@5373
  2622
print_data function becomes basically useless;
wenzelm@5002
  2623
wenzelm@5251
  2624
* removed global_names compatibility flag -- all theory declarations