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