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