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