NEWS
author haftmann
Thu Apr 16 10:11:34 2009 +0200 (2009-04-16)
changeset 30930 11010e5f18f0
parent 30855 c22436e6d350
child 30949 37f887b55e7f
permissions -rw-r--r--
tightended specification of class semiring_div
wenzelm@5363
     1
Isabelle NEWS -- history user-relevant changes
wenzelm@5363
     2
==============================================
wenzelm@2553
     3
haftmann@30930
     4
*** HOL ***
haftmann@30930
     5
haftmann@30930
     6
* Class semiring_div now requires no_zero_divisors and proof of div_mult_mult1;
haftmann@30930
     7
theorems div_mult_mult1, div_mult_mult2, div_mult_mult1_if, div_mult_mult1 and
haftmann@30930
     8
div_mult_mult2 have been generalized to class semiring_div, subsuming former
haftmann@30930
     9
theorems zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and zdiv_zmult_zmult2.
haftmann@30930
    10
div_mult_mult1 is now [simp] by default.  INCOMPATIBILITY.
haftmann@30930
    11
wenzelm@30845
    12
New in Isabelle2009 (April 2009)
wenzelm@30845
    13
--------------------------------
haftmann@27104
    14
wenzelm@27599
    15
*** General ***
wenzelm@27599
    16
wenzelm@28504
    17
* Simplified main Isabelle executables, with less surprises on
wenzelm@28504
    18
case-insensitive file-systems (such as Mac OS).
wenzelm@28504
    19
wenzelm@28504
    20
  - The main Isabelle tool wrapper is now called "isabelle" instead of
wenzelm@28504
    21
    "isatool."
wenzelm@28504
    22
wenzelm@28504
    23
  - The former "isabelle" alias for "isabelle-process" has been
wenzelm@28504
    24
    removed (should rarely occur to regular users).
wenzelm@28504
    25
wenzelm@28915
    26
  - The former "isabelle-interface" and its alias "Isabelle" have been
wenzelm@28915
    27
    removed (interfaces are now regular Isabelle tools).
wenzelm@28504
    28
wenzelm@28504
    29
Within scripts and make files, the Isabelle environment variables
wenzelm@28504
    30
ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
wenzelm@28504
    31
respectively.  (The latter are still available as legacy feature.)
wenzelm@28504
    32
wenzelm@28915
    33
The old isabelle-interface wrapper could react in confusing ways if
wenzelm@28915
    34
the interface was uninstalled or changed otherwise.  Individual
wenzelm@28915
    35
interface tool configuration is now more explicit, see also the
wenzelm@28915
    36
Isabelle system manual.  In particular, Proof General is now available
wenzelm@28915
    37
via "isabelle emacs".
wenzelm@28504
    38
wenzelm@28504
    39
INCOMPATIBILITY, need to adapt derivative scripts.  Users may need to
wenzelm@28504
    40
purge installed copies of Isabelle executables and re-run "isabelle
wenzelm@28504
    41
install -p ...", or use symlinks.
wenzelm@28504
    42
wenzelm@28914
    43
* The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
wenzelm@30845
    44
old ~/isabelle, which was slightly non-standard and apt to cause
wenzelm@30845
    45
surprises on case-insensitive file-systems (such as Mac OS).
wenzelm@28914
    46
wenzelm@28914
    47
INCOMPATIBILITY, need to move existing ~/isabelle/etc,
wenzelm@28914
    48
~/isabelle/heaps, ~/isabelle/browser_info to the new place.  Special
wenzelm@28914
    49
care is required when using older releases of Isabelle.  Note that
wenzelm@28914
    50
ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
wenzelm@30845
    51
Isabelle distribution, in order to use the new ~/.isabelle uniformly.
wenzelm@28914
    52
wenzelm@29161
    53
* Proofs of fully specified statements are run in parallel on
wenzelm@30845
    54
multi-core systems.  A speedup factor of 2.5 to 3.2 can be expected on
wenzelm@30845
    55
a regular 4-core machine, if the initial heap space is made reasonably
wenzelm@30845
    56
large (cf. Poly/ML option -H).  (Requires Poly/ML 5.2.1 or later.)
wenzelm@30845
    57
wenzelm@30845
    58
* The main reference manuals ("isar-ref", "implementation", and
wenzelm@30845
    59
"system") have been updated and extended.  Formally checked references
wenzelm@30845
    60
as hyperlinks are now available uniformly.
wenzelm@30845
    61
wenzelm@30163
    62
wenzelm@27599
    63
*** Pure ***
wenzelm@27599
    64
wenzelm@30845
    65
* Complete re-implementation of locales.  INCOMPATIBILITY in several
wenzelm@30845
    66
respects.  The most important changes are listed below.  See the
wenzelm@30845
    67
Tutorial on Locales ("locales" manual) for details.
ballarin@29253
    68
ballarin@29253
    69
- In locale expressions, instantiation replaces renaming.  Parameters
ballarin@29253
    70
must be declared in a for clause.  To aid compatibility with previous
ballarin@29253
    71
parameter inheritance, in locale declarations, parameters that are not
ballarin@29253
    72
'touched' (instantiation position "_" or omitted) are implicitly added
ballarin@29253
    73
with their syntax at the beginning of the for clause.
ballarin@29253
    74
ballarin@29253
    75
- Syntax from abbreviations and definitions in locales is available in
ballarin@29253
    76
locale expressions and context elements.  The latter is particularly
ballarin@29253
    77
useful in locale declarations.
ballarin@29253
    78
ballarin@29253
    79
- More flexible mechanisms to qualify names generated by locale
ballarin@29253
    80
expressions.  Qualifiers (prefixes) may be specified in locale
wenzelm@30728
    81
expressions, and can be marked as mandatory (syntax: "name!:") or
wenzelm@30728
    82
optional (syntax "name?:").  The default depends for plain "name:"
wenzelm@30728
    83
depends on the situation where a locale expression is used: in
wenzelm@30728
    84
commands 'locale' and 'sublocale' prefixes are optional, in
wenzelm@30845
    85
'interpretation' and 'interpret' prefixes are mandatory.  The old
wenzelm@30728
    86
implicit qualifiers derived from the parameter names of a locale are
wenzelm@30728
    87
no longer generated.
wenzelm@30106
    88
wenzelm@30845
    89
- Command "sublocale l < e" replaces "interpretation l < e".  The
wenzelm@30106
    90
instantiation clause in "interpretation" and "interpret" (square
wenzelm@30106
    91
brackets) is no longer available.  Use locale expressions.
ballarin@29253
    92
wenzelm@30845
    93
- When converting proof scripts, mandatory qualifiers in
wenzelm@30728
    94
'interpretation' and 'interpret' should be retained by default, even
wenzelm@30845
    95
if this is an INCOMPATIBILITY compared to former behavior.  In the
wenzelm@30845
    96
worst case, use the "name?:" form for non-mandatory ones.  Qualifiers
wenzelm@30845
    97
in locale expressions range over a single locale instance only.
wenzelm@30845
    98
wenzelm@30845
    99
- Dropped locale element "includes".  This is a major INCOMPATIBILITY.
wenzelm@30845
   100
In existing theorem specifications replace the includes element by the
wenzelm@30845
   101
respective context elements of the included locale, omitting those
wenzelm@30845
   102
that are already present in the theorem specification.  Multiple
wenzelm@30845
   103
assume elements of a locale should be replaced by a single one
wenzelm@30845
   104
involving the locale predicate.  In the proof body, declarations (most
wenzelm@30845
   105
notably theorems) may be regained by interpreting the respective
wenzelm@30845
   106
locales in the proof context as required (command "interpret").
wenzelm@30845
   107
wenzelm@30845
   108
If using "includes" in replacement of a target solely because the
wenzelm@30845
   109
parameter types in the theorem are not as general as in the target,
wenzelm@30845
   110
consider declaring a new locale with additional type constraints on
wenzelm@30845
   111
the parameters (context element "constrains").
wenzelm@30845
   112
wenzelm@30845
   113
- Discontinued "locale (open)".  INCOMPATIBILITY.
wenzelm@30845
   114
wenzelm@30845
   115
- Locale interpretation commands no longer attempt to simplify goal.
wenzelm@30845
   116
INCOMPATIBILITY: in rare situations the generated goal differs.  Use
wenzelm@30845
   117
methods intro_locales and unfold_locales to clarify.
wenzelm@30845
   118
wenzelm@30845
   119
- Locale interpretation commands no longer accept interpretation
wenzelm@30845
   120
attributes.  INCOMPATIBILITY.
wenzelm@30845
   121
wenzelm@30845
   122
* Class declaration: so-called "base sort" must not be given in import
wenzelm@30845
   123
list any longer, but is inferred from the specification.  Particularly
wenzelm@30845
   124
in HOL, write
wenzelm@30845
   125
wenzelm@30845
   126
    class foo = ...
wenzelm@30845
   127
wenzelm@30845
   128
instead of
wenzelm@30845
   129
wenzelm@30845
   130
    class foo = type + ...
wenzelm@30845
   131
wenzelm@30845
   132
* Class target: global versions of theorems stemming do not carry a
wenzelm@30845
   133
parameter prefix any longer.  INCOMPATIBILITY.
wenzelm@30845
   134
wenzelm@30845
   135
* Class 'instance' command no longer accepts attached definitions.
wenzelm@30845
   136
INCOMPATIBILITY, use proper 'instantiation' target instead.
wenzelm@30845
   137
wenzelm@30845
   138
* Recovered hiding of consts, which was accidentally broken in
wenzelm@30845
   139
Isabelle2007.  Potential INCOMPATIBILITY, ``hide const c'' really
wenzelm@30845
   140
makes c inaccessible; consider using ``hide (open) const c'' instead.
wenzelm@30845
   141
wenzelm@30845
   142
* Slightly more coherent Pure syntax, with updated documentation in
wenzelm@30845
   143
isar-ref manual.  Removed locales meta_term_syntax and
wenzelm@30845
   144
meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
wenzelm@30845
   145
INCOMPATIBILITY in rare situations.  Note that &&& should not be used
wenzelm@30845
   146
directly in regular applications.
wenzelm@30845
   147
wenzelm@30845
   148
* There is a new syntactic category "float_const" for signed decimal
wenzelm@30845
   149
fractions (e.g. 123.45 or -123.45).
wenzelm@30845
   150
wenzelm@30845
   151
* Removed exotic 'token_translation' command.  INCOMPATIBILITY, use ML
wenzelm@30845
   152
interface with 'setup' command instead.
wenzelm@30845
   153
wenzelm@30845
   154
* Command 'local_setup' is similar to 'setup', but operates on a local
wenzelm@30845
   155
theory context.
haftmann@27104
   156
wenzelm@28114
   157
* The 'axiomatization' command now only works within a global theory
wenzelm@28114
   158
context.  INCOMPATIBILITY.
wenzelm@28114
   159
wenzelm@30845
   160
* Goal-directed proof now enforces strict proof irrelevance wrt. sort
wenzelm@30845
   161
hypotheses.  Sorts required in the course of reasoning need to be
wenzelm@30845
   162
covered by the constraints in the initial statement, completed by the
wenzelm@30845
   163
type instance information of the background theory.  Non-trivial sort
wenzelm@30845
   164
hypotheses, which rarely occur in practice, may be specified via
wenzelm@30845
   165
vacuous propositions of the form SORT_CONSTRAINT('a::c).  For example:
wenzelm@30845
   166
wenzelm@30845
   167
  lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
wenzelm@30845
   168
wenzelm@30845
   169
The result contains an implicit sort hypotheses as before --
wenzelm@30845
   170
SORT_CONSTRAINT premises are eliminated as part of the canonical rule
wenzelm@30845
   171
normalization.
wenzelm@30845
   172
wenzelm@30845
   173
* Generalized Isar history, with support for linear undo, direct state
wenzelm@30845
   174
addressing etc.
wenzelm@30845
   175
wenzelm@30845
   176
* Changed defaults for unify configuration options:
wenzelm@30845
   177
wenzelm@30845
   178
  unify_trace_bound = 50 (formerly 25)
wenzelm@30845
   179
  unify_search_bound = 60 (formerly 30)
wenzelm@30845
   180
wenzelm@30845
   181
* Different bookkeeping for code equations (INCOMPATIBILITY):
wenzelm@30845
   182
wenzelm@30845
   183
  a) On theory merge, the last set of code equations for a particular
wenzelm@30845
   184
     constant is taken (in accordance with the policy applied by other
wenzelm@30845
   185
     parts of the code generator framework).
wenzelm@30845
   186
wenzelm@30845
   187
  b) Code equations stemming from explicit declarations (e.g. code
wenzelm@30845
   188
     attribute) gain priority over default code equations stemming
wenzelm@30845
   189
     from definition, primrec, fun etc.
wenzelm@30845
   190
wenzelm@30845
   191
* Keyword 'code_exception' now named 'code_abort'.  INCOMPATIBILITY.
wenzelm@30845
   192
wenzelm@30845
   193
* Unified theorem tables for both code code generators.  Thus [code
wenzelm@30845
   194
func] has disappeared and only [code] remains.  INCOMPATIBILITY.
wenzelm@30577
   195
wenzelm@30577
   196
* Command 'find_consts' searches for constants based on type and name
wenzelm@30577
   197
patterns, e.g.
kleing@29883
   198
kleing@29883
   199
    find_consts "_ => bool"
kleing@29883
   200
wenzelm@30106
   201
By default, matching is against subtypes, but it may be restricted to
wenzelm@30728
   202
the whole type.  Searching by name is possible.  Multiple queries are
wenzelm@30106
   203
conjunctive and queries may be negated by prefixing them with a
wenzelm@30106
   204
hyphen:
kleing@29883
   205
kleing@29883
   206
    find_consts strict: "_ => bool" name: "Int" -"int => int"
kleing@29861
   207
wenzelm@30845
   208
* New 'find_theorems' criterion "solves" matches theorems that
wenzelm@30845
   209
directly solve the current goal (modulo higher-order unification).
wenzelm@30845
   210
wenzelm@30845
   211
* Auto solve feature for main theorem statements: whenever a new goal
wenzelm@30845
   212
is stated, "find_theorems solves" is called; any theorems that could
wenzelm@30845
   213
solve the lemma directly are listed as part of the goal state.
wenzelm@30845
   214
Cf. associated options in Proof General Isabelle settings menu,
wenzelm@30845
   215
enabled by default, with reasonable timeout for pathological cases of
wenzelm@30845
   216
higher-order unification.
webertj@30415
   217
haftmann@27104
   218
wenzelm@27381
   219
*** Document preparation ***
wenzelm@27381
   220
wenzelm@27381
   221
* Antiquotation @{lemma} now imitates a regular terminal proof,
wenzelm@27392
   222
demanding keyword 'by' and supporting the full method expression
wenzelm@27519
   223
syntax just like the Isar command 'by'.
wenzelm@27381
   224
wenzelm@27381
   225
haftmann@27104
   226
*** HOL ***
haftmann@27104
   227
wenzelm@30845
   228
* Integrated main parts of former image HOL-Complex with HOL.  Entry
wenzelm@30845
   229
points Main and Complex_Main remain as before.
wenzelm@30845
   230
wenzelm@30845
   231
* Logic image HOL-Plain provides a minimal HOL with the most important
wenzelm@30845
   232
tools available (inductive, datatype, primrec, ...).  This facilitates
wenzelm@30845
   233
experimentation and tool development.  Note that user applications
wenzelm@30845
   234
(and library theories) should never refer to anything below theory
wenzelm@30845
   235
Main, as before.
wenzelm@30845
   236
wenzelm@30845
   237
* Logic image HOL-Main stops at theory Main, and thus facilitates
wenzelm@30845
   238
experimentation due to shorter build times.
wenzelm@30845
   239
wenzelm@30845
   240
* Logic image HOL-NSA contains theories of nonstandard analysis which
wenzelm@30845
   241
were previously part of former HOL-Complex.  Entry point Hyperreal
wenzelm@30845
   242
remains valid, but theories formerly using Complex_Main should now use
wenzelm@30845
   243
new entry point Hypercomplex.
wenzelm@30845
   244
wenzelm@30845
   245
* Generic ATP manager for Sledgehammer, based on ML threads instead of
wenzelm@30845
   246
Posix processes.  Avoids potentially expensive forking of the ML
wenzelm@30845
   247
process.  New thread-based implementation also works on non-Unix
wenzelm@30845
   248
platforms (Cygwin).  Provers are no longer hardwired, but defined
wenzelm@30845
   249
within the theory via plain ML wrapper functions.  Basic Sledgehammer
wenzelm@30845
   250
commands are covered in the isar-ref manual.
wenzelm@30845
   251
wenzelm@30845
   252
* Wrapper scripts for remote SystemOnTPTP service allows to use
wenzelm@30845
   253
sledgehammer without local ATP installation (Vampire etc.). Other
wenzelm@30845
   254
provers may be included via suitable ML wrappers, see also
wenzelm@30845
   255
src/HOL/ATP_Linkup.thy.
wenzelm@30845
   256
wenzelm@30845
   257
* ATP selection (E/Vampire/Spass) is now via Proof General's settings
wenzelm@30845
   258
menu.
wenzelm@30845
   259
wenzelm@30845
   260
* The metis method no longer fails because the theorem is too trivial
wenzelm@30845
   261
(contains the empty clause).
wenzelm@30845
   262
wenzelm@30845
   263
* The metis method now fails in the usual manner, rather than raising
wenzelm@30845
   264
an exception, if it determines that it cannot prove the theorem.
wenzelm@30845
   265
wenzelm@30845
   266
* Method "coherent" implements a prover for coherent logic (see also
wenzelm@30845
   267
src/Tools/coherent.ML).
wenzelm@30845
   268
wenzelm@30845
   269
* Constants "undefined" and "default" replace "arbitrary".  Usually
wenzelm@30845
   270
"undefined" is the right choice to replace "arbitrary", though
wenzelm@30845
   271
logically there is no difference.  INCOMPATIBILITY.
wenzelm@30845
   272
wenzelm@30845
   273
* Command "value" now integrates different evaluation mechanisms.  The
wenzelm@30845
   274
result of the first successful evaluation mechanism is printed.  In
wenzelm@30845
   275
square brackets a particular named evaluation mechanisms may be
wenzelm@30845
   276
specified (currently, [SML], [code] or [nbe]).  See further
wenzelm@30845
   277
src/HOL/ex/Eval_Examples.thy.
wenzelm@30845
   278
wenzelm@30845
   279
* Normalization by evaluation now allows non-leftlinear equations.
wenzelm@30845
   280
Declare with attribute [code nbe].
wenzelm@30845
   281
wenzelm@30845
   282
* Methods "case_tac" and "induct_tac" now refer to the very same rules
wenzelm@30845
   283
as the structured Isar versions "cases" and "induct", cf. the
wenzelm@30845
   284
corresponding "cases" and "induct" attributes.  Mutual induction rules
wenzelm@30845
   285
are now presented as a list of individual projections
wenzelm@30845
   286
(e.g. foo_bar.inducts for types foo and bar); the old format with
wenzelm@30845
   287
explicit HOL conjunction is no longer supported.  INCOMPATIBILITY, in
wenzelm@30845
   288
rare situations a different rule is selected --- notably nested tuple
wenzelm@30845
   289
elimination instead of former prod.exhaust: use explicit (case_tac t
wenzelm@30845
   290
rule: prod.exhaust) here.
wenzelm@30845
   291
wenzelm@30845
   292
* Attributes "cases", "induct", "coinduct" support "del" option.
wenzelm@30845
   293
wenzelm@30845
   294
* Removed fact "case_split_thm", which duplicates "case_split".
wenzelm@30845
   295
wenzelm@30845
   296
* The option datatype has been moved to a new theory Option.  Renamed
wenzelm@30845
   297
option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
wenzelm@30845
   298
wenzelm@30845
   299
* New predicate "strict_mono" classifies strict functions on partial
wenzelm@30845
   300
orders.  With strict functions on linear orders, reasoning about
wenzelm@30845
   301
(in)equalities is facilitated by theorems "strict_mono_eq",
wenzelm@30845
   302
"strict_mono_less_eq" and "strict_mono_less".
wenzelm@30845
   303
wenzelm@30845
   304
* Some set operations are now proper qualified constants with
wenzelm@30845
   305
authentic syntax.  INCOMPATIBILITY:
haftmann@30304
   306
haftmann@30304
   307
    op Int ~>   Set.Int
haftmann@30304
   308
    op Un ~>    Set.Un
haftmann@30304
   309
    INTER ~>    Set.INTER
haftmann@30304
   310
    UNION ~>    Set.UNION
haftmann@30304
   311
    Inter ~>    Set.Inter
haftmann@30304
   312
    Union ~>    Set.Union
haftmann@30304
   313
    {} ~>       Set.empty
haftmann@30304
   314
    UNIV ~>     Set.UNIV
haftmann@30304
   315
wenzelm@30845
   316
* Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
wenzelm@30845
   317
theory Set.
wenzelm@30845
   318
wenzelm@30845
   319
* Auxiliary class "itself" has disappeared -- classes without any
wenzelm@30845
   320
parameter are treated as expected by the 'class' command.
haftmann@29797
   321
haftmann@29823
   322
* Leibnitz's Series for Pi and the arcus tangens and logarithm series.
haftmann@29823
   323
wenzelm@30845
   324
* Common decision procedures (Cooper, MIR, Ferrack, Approximation,
wenzelm@30845
   325
Dense_Linear_Order) are now in directory HOL/Decision_Procs.
wenzelm@30845
   326
wenzelm@30845
   327
* Theory src/HOL/Decision_Procs/Approximation provides the new proof
wenzelm@30845
   328
method "approximation".  It proves formulas on real values by using
wenzelm@30845
   329
interval arithmetic.  In the formulas are also the transcendental
wenzelm@30845
   330
functions sin, cos, tan, atan, ln, exp and the constant pi are
wenzelm@30845
   331
allowed. For examples see
wenzelm@30845
   332
src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
haftmann@29823
   333
haftmann@29823
   334
* Theory "Reflection" now resides in HOL/Library.
haftmann@29650
   335
wenzelm@30845
   336
* Entry point to Word library now simply named "Word".
wenzelm@30845
   337
INCOMPATIBILITY.
haftmann@29628
   338
haftmann@29197
   339
* Made source layout more coherent with logical distribution
haftmann@29197
   340
structure:
haftmann@28952
   341
haftmann@28952
   342
    src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
haftmann@28952
   343
    src/HOL/Library/Code_Message.thy ~> src/HOL/
haftmann@28952
   344
    src/HOL/Library/GCD.thy ~> src/HOL/
haftmann@28952
   345
    src/HOL/Library/Order_Relation.thy ~> src/HOL/
haftmann@28952
   346
    src/HOL/Library/Parity.thy ~> src/HOL/
haftmann@28952
   347
    src/HOL/Library/Univ_Poly.thy ~> src/HOL/
huffman@30176
   348
    src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
haftmann@28952
   349
    src/HOL/Real/Lubs.thy ~> src/HOL/
haftmann@28952
   350
    src/HOL/Real/PReal.thy ~> src/HOL/
haftmann@28952
   351
    src/HOL/Real/Rational.thy ~> src/HOL/
haftmann@28952
   352
    src/HOL/Real/RComplete.thy ~> src/HOL/
haftmann@28952
   353
    src/HOL/Real/RealDef.thy ~> src/HOL/
haftmann@28952
   354
    src/HOL/Real/RealPow.thy ~> src/HOL/
haftmann@28952
   355
    src/HOL/Real/Real.thy ~> src/HOL/
haftmann@28952
   356
    src/HOL/Complex/Complex_Main.thy ~> src/HOL/
haftmann@28952
   357
    src/HOL/Complex/Complex.thy ~> src/HOL/
huffman@30176
   358
    src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
huffman@30176
   359
    src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
haftmann@28952
   360
    src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
haftmann@28952
   361
    src/HOL/Hyperreal/Fact.thy ~> src/HOL/
haftmann@28952
   362
    src/HOL/Hyperreal/Integration.thy ~> src/HOL/
haftmann@28952
   363
    src/HOL/Hyperreal/Lim.thy ~> src/HOL/
haftmann@28952
   364
    src/HOL/Hyperreal/Ln.thy ~> src/HOL/
haftmann@28952
   365
    src/HOL/Hyperreal/Log.thy ~> src/HOL/
haftmann@28952
   366
    src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
haftmann@28952
   367
    src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
haftmann@28952
   368
    src/HOL/Hyperreal/Series.thy ~> src/HOL/
haftmann@29197
   369
    src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
haftmann@28952
   370
    src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
haftmann@28952
   371
    src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
haftmann@28952
   372
    src/HOL/Real/Float ~> src/HOL/Library/
haftmann@29197
   373
    src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
haftmann@29197
   374
    src/HOL/Real/RealVector.thy ~> src/HOL/
haftmann@28952
   375
haftmann@28952
   376
    src/HOL/arith_data.ML ~> src/HOL/Tools
haftmann@28952
   377
    src/HOL/hologic.ML ~> src/HOL/Tools
haftmann@28952
   378
    src/HOL/simpdata.ML ~> src/HOL/Tools
haftmann@28952
   379
    src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
haftmann@28952
   380
    src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
haftmann@28952
   381
    src/HOL/nat_simprocs.ML ~> src/HOL/Tools
haftmann@28952
   382
    src/HOL/Real/float_arith.ML ~> src/HOL/Tools
haftmann@28952
   383
    src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
haftmann@28952
   384
    src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
haftmann@28952
   385
    src/HOL/Real/real_arith.ML ~> src/HOL/Tools
haftmann@28952
   386
haftmann@29398
   387
    src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
haftmann@29398
   388
    src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
haftmann@29398
   389
    src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
haftmann@29398
   390
    src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
haftmann@29398
   391
    src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
haftmann@29398
   392
    src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
haftmann@29398
   393
wenzelm@30845
   394
* If methods "eval" and "evaluation" encounter a structured proof
wenzelm@30845
   395
state with !!/==>, only the conclusion is evaluated to True (if
wenzelm@30845
   396
possible), avoiding strange error messages.
wenzelm@30845
   397
wenzelm@30845
   398
* Method "sizechange" automates termination proofs using (a
wenzelm@30845
   399
modification of) the size-change principle.  Requires SAT solver.  See
wenzelm@30845
   400
src/HOL/ex/Termination.thy for examples.
wenzelm@30845
   401
wenzelm@30845
   402
* Simplifier: simproc for let expressions now unfolds if bound
wenzelm@30845
   403
variable occurs at most once in let expression body.  INCOMPATIBILITY.
wenzelm@30845
   404
wenzelm@30845
   405
* Method "arith": Linear arithmetic now ignores all inequalities when
wenzelm@30845
   406
fast_arith_neq_limit is exceeded, instead of giving up entirely.
wenzelm@30845
   407
wenzelm@30845
   408
* New attribute "arith" for facts that should always be used
wenzelm@30845
   409
automatically by arithmetic. It is intended to be used locally in
wenzelm@30845
   410
proofs, e.g.
wenzelm@30845
   411
wenzelm@30845
   412
  assumes [arith]: "x > 0"
wenzelm@30845
   413
nipkow@30706
   414
Global usage is discouraged because of possible performance impact.
nipkow@30706
   415
wenzelm@30845
   416
* New classes "top" and "bot" with corresponding operations "top" and
wenzelm@30845
   417
"bot" in theory Orderings; instantiation of class "complete_lattice"
wenzelm@30845
   418
requires instantiation of classes "top" and "bot".  INCOMPATIBILITY.
wenzelm@30845
   419
wenzelm@30845
   420
* Changed definition lemma "less_fun_def" in order to provide an
wenzelm@30845
   421
instance for preorders on functions; use lemma "less_le" instead.
wenzelm@30845
   422
INCOMPATIBILITY.
wenzelm@30845
   423
wenzelm@30845
   424
* Theory Orderings: class "wellorder" moved here, with explicit
wenzelm@30845
   425
induction rule "less_induct" as assumption.  For instantiation of
wenzelm@30845
   426
"wellorder" by means of predicate "wf", use rule wf_wellorderI.
wenzelm@30845
   427
INCOMPATIBILITY.
wenzelm@30845
   428
wenzelm@30845
   429
* Theory Orderings: added class "preorder" as superclass of "order".
wenzelm@27793
   430
INCOMPATIBILITY: Instantiation proofs for order, linorder
wenzelm@27793
   431
etc. slightly changed.  Some theorems named order_class.* now named
wenzelm@27793
   432
preorder_class.*.
wenzelm@27793
   433
wenzelm@30845
   434
* Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
wenzelm@30845
   435
"diag" to "Id_on".
wenzelm@30845
   436
wenzelm@30845
   437
* Theory Finite_Set: added a new fold combinator of type
wenzelm@30845
   438
nipkow@28855
   439
  ('a => 'b => 'b) => 'b => 'a set => 'b
wenzelm@30845
   440
wenzelm@30845
   441
Occasionally this is more convenient than the old fold combinator
wenzelm@30845
   442
which is now defined in terms of the new one and renamed to
wenzelm@30845
   443
fold_image.
wenzelm@30845
   444
wenzelm@30845
   445
* Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
wenzelm@30845
   446
and "ring_simps" have been replaced by "algebra_simps" (which can be
wenzelm@30845
   447
extended with further lemmas!).  At the moment both still exist but
wenzelm@30845
   448
the former will disappear at some point.
wenzelm@30845
   449
wenzelm@30845
   450
* Theory Power: Lemma power_Suc is now declared as a simp rule in
wenzelm@30845
   451
class recpower.  Type-specific simp rules for various recpower types
wenzelm@30845
   452
have been removed.  INCOMPATIBILITY, rename old lemmas as follows:
huffman@30273
   453
huffman@30273
   454
rat_power_0    -> power_0
huffman@30273
   455
rat_power_Suc  -> power_Suc
huffman@30273
   456
realpow_0      -> power_0
huffman@30273
   457
realpow_Suc    -> power_Suc
huffman@30273
   458
complexpow_0   -> power_0
huffman@30273
   459
complexpow_Suc -> power_Suc
huffman@30273
   460
power_poly_0   -> power_0
huffman@30273
   461
power_poly_Suc -> power_Suc
huffman@30273
   462
wenzelm@30845
   463
* Theories Ring_and_Field and Divides: Definition of "op dvd" has been
wenzelm@27793
   464
moved to separate class dvd in Ring_and_Field; a couple of lemmas on
wenzelm@27793
   465
dvd has been generalized to class comm_semiring_1.  Likewise a bunch
wenzelm@27793
   466
of lemmas from Divides has been generalized from nat to class
wenzelm@27793
   467
semiring_div.  INCOMPATIBILITY.  This involves the following theorem
wenzelm@27793
   468
renames resulting from duplicate elimination:
haftmann@27651
   469
haftmann@27651
   470
    dvd_def_mod ~>          dvd_eq_mod_eq_0
haftmann@27651
   471
    zero_dvd_iff ~>         dvd_0_left_iff
haftmann@28559
   472
    dvd_0 ~>                dvd_0_right
haftmann@27651
   473
    DIVISION_BY_ZERO_DIV ~> div_by_0
haftmann@27651
   474
    DIVISION_BY_ZERO_MOD ~> mod_by_0
haftmann@27651
   475
    mult_div ~>             div_mult_self2_is_id
haftmann@27651
   476
    mult_mod ~>             mod_mult_self2_is_0
haftmann@27651
   477
wenzelm@30845
   478
* Theory IntDiv: removed many lemmas that are instances of class-based
wenzelm@30845
   479
generalizations (from Divides and Ring_and_Field).  INCOMPATIBILITY,
wenzelm@30845
   480
rename old lemmas as follows:
nipkow@30044
   481
nipkow@30044
   482
dvd_diff               -> nat_dvd_diff
nipkow@30044
   483
dvd_zminus_iff         -> dvd_minus_iff
nipkow@30224
   484
mod_add1_eq            -> mod_add_eq
nipkow@30224
   485
mod_mult1_eq           -> mod_mult_right_eq
nipkow@30224
   486
mod_mult1_eq'          -> mod_mult_left_eq
nipkow@30224
   487
mod_mult_distrib_mod   -> mod_mult_eq
nipkow@30044
   488
nat_mod_add_left_eq    -> mod_add_left_eq
nipkow@30044
   489
nat_mod_add_right_eq   -> mod_add_right_eq
nipkow@30044
   490
nat_mod_div_trivial    -> mod_div_trivial
nipkow@30044
   491
nat_mod_mod_trivial    -> mod_mod_trivial
nipkow@30044
   492
zdiv_zadd_self1        -> div_add_self1
nipkow@30044
   493
zdiv_zadd_self2        -> div_add_self2
nipkow@30181
   494
zdiv_zmult_self1       -> div_mult_self2_is_id
nipkow@30044
   495
zdiv_zmult_self2       -> div_mult_self1_is_id
nipkow@30044
   496
zdvd_triv_left         -> dvd_triv_left
nipkow@30044
   497
zdvd_triv_right        -> dvd_triv_right
nipkow@30044
   498
zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
nipkow@30085
   499
zmod_eq0_zdvd_iff      -> dvd_eq_mod_eq_0[symmetric]
nipkow@30044
   500
zmod_zadd_left_eq      -> mod_add_left_eq
nipkow@30044
   501
zmod_zadd_right_eq     -> mod_add_right_eq
nipkow@30044
   502
zmod_zadd_self1        -> mod_add_self1
nipkow@30044
   503
zmod_zadd_self2        -> mod_add_self2
nipkow@30224
   504
zmod_zadd1_eq          -> mod_add_eq
nipkow@30044
   505
zmod_zdiff1_eq         -> mod_diff_eq
nipkow@30044
   506
zmod_zdvd_zmod         -> mod_mod_cancel
nipkow@30044
   507
zmod_zmod_cancel       -> mod_mod_cancel
nipkow@30044
   508
zmod_zmult_self1       -> mod_mult_self2_is_0
nipkow@30044
   509
zmod_zmult_self2       -> mod_mult_self1_is_0
nipkow@30044
   510
zmod_1                 -> mod_by_1
nipkow@30044
   511
zdiv_1                 -> div_by_1
nipkow@30044
   512
zdvd_abs1              -> abs_dvd_iff
nipkow@30044
   513
zdvd_abs2              -> dvd_abs_iff
nipkow@30044
   514
zdvd_refl              -> dvd_refl
nipkow@30044
   515
zdvd_trans             -> dvd_trans
nipkow@30044
   516
zdvd_zadd              -> dvd_add
nipkow@30044
   517
zdvd_zdiff             -> dvd_diff
nipkow@30044
   518
zdvd_zminus_iff        -> dvd_minus_iff
nipkow@30044
   519
zdvd_zminus2_iff       -> minus_dvd_iff
nipkow@30044
   520
zdvd_zmultD            -> dvd_mult_right
nipkow@30044
   521
zdvd_zmultD2           -> dvd_mult_left
nipkow@30044
   522
zdvd_zmult_mono        -> mult_dvd_mono
nipkow@30044
   523
zdvd_0_right           -> dvd_0_right
nipkow@30044
   524
zdvd_0_left            -> dvd_0_left_iff
nipkow@30044
   525
zdvd_1_left            -> one_dvd
nipkow@30044
   526
zminus_dvd_iff         -> minus_dvd_iff
nipkow@30044
   527
wenzelm@30845
   528
* Theory Rational: 'Fract k 0' now equals '0'.  INCOMPATIBILITY.
wenzelm@30845
   529
wenzelm@30845
   530
* The real numbers offer decimal input syntax: 12.34 is translated
wenzelm@30845
   531
into 1234/10^2. This translation is not reversed upon output.
wenzelm@30845
   532
wenzelm@30845
   533
* Theory Library/Polynomial defines an abstract type 'a poly of
wenzelm@30845
   534
univariate polynomials with coefficients of type 'a.  In addition to
wenzelm@30845
   535
the standard ring operations, it also supports div and mod.  Code
wenzelm@30845
   536
generation is also supported, using list-style constructors.
wenzelm@30845
   537
wenzelm@30845
   538
* Theory Library/Inner_Product defines a class of real_inner for real
wenzelm@30845
   539
inner product spaces, with an overloaded operation inner :: 'a => 'a
wenzelm@30845
   540
=> real.  Class real_inner is a subclass of real_normed_vector from
wenzelm@30845
   541
theory RealVector.
wenzelm@30845
   542
wenzelm@30845
   543
* Theory Library/Product_Vector provides instances for the product
wenzelm@30845
   544
type 'a * 'b of several classes from RealVector and Inner_Product.
wenzelm@30845
   545
Definitions of addition, subtraction, scalar multiplication, norms,
wenzelm@30845
   546
and inner products are included.
wenzelm@30845
   547
wenzelm@30845
   548
* Theory Library/Bit defines the field "bit" of integers modulo 2.  In
wenzelm@30845
   549
addition to the field operations, numerals and case syntax are also
wenzelm@30845
   550
supported.
wenzelm@30845
   551
wenzelm@30845
   552
* Theory Library/Diagonalize provides constructive version of Cantor's
wenzelm@30845
   553
first diagonalization argument.
wenzelm@30845
   554
wenzelm@30845
   555
* Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
wenzelm@27599
   556
zlcm (for int); carried together from various gcd/lcm developements in
wenzelm@30845
   557
the HOL Distribution.  Constants zgcd and zlcm replace former igcd and
wenzelm@30845
   558
ilcm; corresponding theorems renamed accordingly.  INCOMPATIBILITY,
wenzelm@30845
   559
may recover tupled syntax as follows:
haftmann@27556
   560
haftmann@27556
   561
    hide (open) const gcd
haftmann@27556
   562
    abbreviation gcd where
haftmann@27556
   563
      "gcd == (%(a, b). GCD.gcd a b)"
haftmann@27556
   564
    notation (output)
haftmann@27556
   565
      GCD.gcd ("gcd '(_, _')")
haftmann@27556
   566
wenzelm@30845
   567
The same works for lcm, zgcd, zlcm.
wenzelm@30845
   568
wenzelm@30845
   569
* Theory Library/Nat_Infinity: added addition, numeral syntax and more
wenzelm@30845
   570
instantiations for algebraic structures.  Removed some duplicate
wenzelm@30845
   571
theorems.  Changes in simp rules.  INCOMPATIBILITY.
wenzelm@30845
   572
wenzelm@30845
   573
* ML antiquotation @{code} takes a constant as argument and generates
haftmann@27651
   574
corresponding code in background and inserts name of the corresponding
haftmann@27651
   575
resulting ML value/function/datatype constructor binding in place.
haftmann@27651
   576
All occurrences of @{code} with a single ML block are generated
haftmann@27651
   577
simultaneously.  Provides a generic and safe interface for
wenzelm@30845
   578
instrumentalizing code generation.  See
wenzelm@30845
   579
src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
wenzelm@30845
   580
In future you ought to refrain from ad-hoc compiling generated SML
wenzelm@30845
   581
code on the ML toplevel.  Note that (for technical reasons) @{code}
wenzelm@30845
   582
cannot refer to constants for which user-defined serializations are
wenzelm@30845
   583
set.  Refer to the corresponding ML counterpart directly in that
wenzelm@30845
   584
cases.
wenzelm@27122
   585
wenzelm@27122
   586
* Command 'rep_datatype': instead of theorem names the command now
wenzelm@27122
   587
takes a list of terms denoting the constructors of the type to be
wenzelm@27122
   588
represented as datatype.  The characteristic theorems have to be
wenzelm@27122
   589
proven.  INCOMPATIBILITY.  Also observe that the following theorems
wenzelm@27122
   590
have disappeared in favour of existing ones:
wenzelm@27122
   591
haftmann@27104
   592
    unit_induct                 ~> unit.induct
haftmann@27104
   593
    prod_induct                 ~> prod.induct
haftmann@27104
   594
    sum_induct                  ~> sum.induct
haftmann@27104
   595
    Suc_Suc_eq                  ~> nat.inject
haftmann@27104
   596
    Suc_not_Zero Zero_not_Suc   ~> nat.distinct
haftmann@27104
   597
haftmann@27104
   598
ballarin@27696
   599
*** HOL-Algebra ***
ballarin@27696
   600
ballarin@27713
   601
* New locales for orders and lattices where the equivalence relation
wenzelm@30106
   602
is not restricted to equality.  INCOMPATIBILITY: all order and lattice
wenzelm@30106
   603
locales use a record structure with field eq for the equivalence.
ballarin@27713
   604
ballarin@27713
   605
* New theory of factorial domains.
ballarin@27713
   606
wenzelm@30845
   607
* Units_l_inv and Units_r_inv are now simp rules by default.
ballarin@27696
   608
INCOMPATIBILITY.  Simplifier proof that require deletion of l_inv
ballarin@27696
   609
and/or r_inv will now also require deletion of these lemmas.
ballarin@27696
   610
wenzelm@30845
   611
* Renamed the following theorems, INCOMPATIBILITY:
wenzelm@30845
   612
ballarin@27696
   613
UpperD ~> Upper_memD
ballarin@27696
   614
LowerD ~> Lower_memD
ballarin@27696
   615
least_carrier ~> least_closed
ballarin@27696
   616
greatest_carrier ~> greatest_closed
ballarin@27696
   617
greatest_Lower_above ~> greatest_Lower_below
ballarin@27717
   618
one_zero ~> carrier_one_zero
ballarin@27717
   619
one_not_zero ~> carrier_one_not_zero  (collision with assumption)
ballarin@27696
   620
wenzelm@27793
   621
wenzelm@30849
   622
*** HOL-Nominal ***
wenzelm@30849
   623
wenzelm@30855
   624
* Nominal datatypes can now contain type-variables.
wenzelm@30855
   625
wenzelm@30855
   626
* Commands 'nominal_inductive' and 'equivariance' work with local
wenzelm@30855
   627
theory targets.
wenzelm@30855
   628
wenzelm@30855
   629
* Nominal primrec can now works with local theory targets and its
wenzelm@30855
   630
specification syntax now conforms to the general format as seen in
wenzelm@30855
   631
'inductive' etc.
wenzelm@30855
   632
wenzelm@30855
   633
* Method "perm_simp" honours the standard simplifier attributes
wenzelm@30855
   634
(no_asm), (no_asm_use) etc.
wenzelm@30855
   635
wenzelm@30855
   636
* The new predicate #* is defined like freshness, except that on the
wenzelm@30855
   637
left hand side can be a set or list of atoms.
wenzelm@30855
   638
wenzelm@30855
   639
* Experimental command 'nominal_inductive2' derives strong induction
wenzelm@30855
   640
principles for inductive definitions.  In contrast to
wenzelm@30855
   641
'nominal_inductive', which can only deal with a fixed number of
wenzelm@30855
   642
binders, it can deal with arbitrary expressions standing for sets of
wenzelm@30855
   643
atoms to be avoided.  The only inductive definition we have at the
wenzelm@30855
   644
moment that needs this generalisation is the typing rule for Lets in
wenzelm@30855
   645
the algorithm W:
wenzelm@30855
   646
wenzelm@30855
   647
 Gamma |- t1 : T1   (x,close Gamma T1)::Gamma |- t2 : T2   x#Gamma
wenzelm@30855
   648
 -----------------------------------------------------------------
wenzelm@30855
   649
         Gamma |- Let x be t1 in t2 : T2
wenzelm@30855
   650
wenzelm@30855
   651
In this rule one wants to avoid all the binders that are introduced by
wenzelm@30855
   652
"close Gamma T1".  We are looking for other examples where this
wenzelm@30855
   653
feature might be useful.  Please let us know.
wenzelm@30849
   654
wenzelm@30849
   655
huffman@30176
   656
*** HOLCF ***
huffman@30176
   657
huffman@30176
   658
* Reimplemented the simplification procedure for proving continuity
huffman@30176
   659
subgoals.  The new simproc is extensible; users can declare additional
huffman@30176
   660
continuity introduction rules with the attribute [cont2cont].
huffman@30176
   661
huffman@30176
   662
* The continuity simproc now uses a different introduction rule for
huffman@30176
   663
solving continuity subgoals on terms with lambda abstractions.  In
huffman@30176
   664
some rare cases the new simproc may fail to solve subgoals that the
huffman@30176
   665
old one could solve, and "simp add: cont2cont_LAM" may be necessary.
huffman@30176
   666
Potential INCOMPATIBILITY.
huffman@30176
   667
wenzelm@30847
   668
* Command 'fixrec': specification syntax now conforms to the general
wenzelm@30855
   669
format as seen in 'inductive' etc.  See src/HOLCF/ex/Fixrec_ex.thy for
wenzelm@30855
   670
examples.  INCOMPATIBILITY.
wenzelm@30845
   671
wenzelm@30845
   672
wenzelm@30845
   673
*** ZF ***
wenzelm@30845
   674
wenzelm@30845
   675
* Proof of Zorn's Lemma for partial orders.
huffman@30176
   676
huffman@30176
   677
wenzelm@27246
   678
*** ML ***
wenzelm@28088
   679
wenzelm@30845
   680
* Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
wenzelm@30845
   681
Poly/ML 5.2.1 or later.  Important note: the TimeLimit facility
wenzelm@30845
   682
depends on multithreading, so timouts will not work before Poly/ML
wenzelm@30845
   683
5.2.1!
wenzelm@30845
   684
wenzelm@29161
   685
* High-level support for concurrent ML programming, see
wenzelm@29161
   686
src/Pure/Cuncurrent.  The data-oriented model of "future values" is
wenzelm@29161
   687
particularly convenient to organize independent functional
wenzelm@29161
   688
computations.  The concept of "synchronized variables" provides a
wenzelm@29161
   689
higher-order interface for components with shared state, avoiding the
wenzelm@30845
   690
delicate details of mutexes and condition variables.  (Requires
wenzelm@30845
   691
Poly/ML 5.2.1 or later.)
wenzelm@30845
   692
wenzelm@30845
   693
* ML bindings produced via Isar commands are stored within the Isar
wenzelm@30845
   694
context (theory or proof).  Consequently, commands like 'use' and 'ML'
wenzelm@30845
   695
become thread-safe and work with undo as expected (concerning
wenzelm@30845
   696
top-level bindings, not side-effects on global references).
wenzelm@30845
   697
INCOMPATIBILITY, need to provide proper Isar context when invoking the
wenzelm@30845
   698
compiler at runtime; really global bindings need to be given outside a
wenzelm@30845
   699
theory.  (Requires Poly/ML 5.2 or later.)
wenzelm@30845
   700
wenzelm@30845
   701
* Command 'ML_prf' is analogous to 'ML' but works within a proof
wenzelm@30845
   702
context.  Top-level ML bindings are stored within the proof context in
wenzelm@30845
   703
a purely sequential fashion, disregarding the nested proof structure.
wenzelm@30845
   704
ML bindings introduced by 'ML_prf' are discarded at the end of the
wenzelm@30845
   705
proof.  (Requires Poly/ML 5.2 or later.)
wenzelm@29161
   706
wenzelm@30530
   707
* Simplified ML attribute and method setup, cf. functions Attrib.setup
wenzelm@30845
   708
and Method.setup, as well as Isar commands 'attribute_setup' and
wenzelm@30547
   709
'method_setup'.  INCOMPATIBILITY for 'method_setup', need to simplify
wenzelm@30547
   710
existing code accordingly, or use plain 'setup' together with old
wenzelm@30547
   711
Method.add_method.
wenzelm@30530
   712
wenzelm@28294
   713
* Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
wenzelm@28294
   714
to 'a -> thm, while results are always tagged with an authentic oracle
wenzelm@28294
   715
name.  The Isar command 'oracle' is now polymorphic, no argument type
wenzelm@28294
   716
is specified.  INCOMPATIBILITY, need to simplify existing oracle code
wenzelm@28294
   717
accordingly.  Note that extra performance may be gained by producing
wenzelm@28294
   718
the cterm carefully, avoiding slow Thm.cterm_of.
wenzelm@28294
   719
wenzelm@30845
   720
* Simplified interface for defining document antiquotations via
wenzelm@30845
   721
ThyOutput.antiquotation, ThyOutput.output, and optionally
wenzelm@30845
   722
ThyOutput.maybe_pretty_source.  INCOMPATIBILITY, need to simplify user
wenzelm@30845
   723
antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
wenzelm@30845
   724
examples.
wenzelm@28099
   725
wenzelm@30395
   726
* More systematic treatment of long names, abstract name bindings, and
wenzelm@30395
   727
name space operations.  Basic operations on qualified names have been
wenzelm@30399
   728
move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
wenzelm@30395
   729
Long_Name.append.  Old type bstring has been mostly replaced by
wenzelm@30395
   730
abstract type binding (see structure Binding), which supports precise
wenzelm@30845
   731
qualification by packages and local theory targets, as well as proper
wenzelm@30845
   732
tracking of source positions.  INCOMPATIBILITY, need to wrap old
wenzelm@30845
   733
bstring values into Binding.name, or better pass through abstract
wenzelm@30399
   734
bindings everywhere.  See further src/Pure/General/long_name.ML,
wenzelm@30395
   735
src/Pure/General/binding.ML and src/Pure/General/name_space.ML
wenzelm@30395
   736
wenzelm@28089
   737
* Result facts (from PureThy.note_thms, ProofContext.note_thms,
wenzelm@28089
   738
LocalTheory.note etc.) now refer to the *full* internal name, not the
wenzelm@28089
   739
bstring as before.  INCOMPATIBILITY, not detected by ML type-checking!
wenzelm@28089
   740
wenzelm@27287
   741
* Disposed old type and term read functions (Sign.read_def_typ,
wenzelm@27287
   742
Sign.read_typ, Sign.read_def_terms, Sign.read_term,
wenzelm@27287
   743
Thm.read_def_cterms, Thm.read_cterm etc.).  INCOMPATIBILITY, should
wenzelm@27287
   744
use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
wenzelm@27269
   745
Syntax.read_term_global etc.; see also OldGoals.read_term as last
wenzelm@27269
   746
resort for legacy applications.
wenzelm@27269
   747
wenzelm@30609
   748
* Disposed old declarations, tactics, tactic combinators that refer to
wenzelm@30609
   749
the simpset or claset of an implicit theory (such as Addsimps,
wenzelm@30609
   750
Simp_tac, SIMPSET).  INCOMPATIBILITY, should use @{simpset} etc. in
wenzelm@30609
   751
embedded ML text, or local_simpset_of with a proper context passed as
wenzelm@30609
   752
explicit runtime argument.
wenzelm@30609
   753
wenzelm@30845
   754
* Rules and tactics that read instantiations (read_instantiate,
wenzelm@30845
   755
res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
wenzelm@30845
   756
context, which is required for parsing and type-checking.  Moreover,
wenzelm@30845
   757
the variables are specified as plain indexnames, not string encodings
wenzelm@30845
   758
thereof.  INCOMPATIBILITY.
wenzelm@30845
   759
wenzelm@30845
   760
* Generic Toplevel.add_hook interface allows to analyze the result of
wenzelm@30845
   761
transactions.  E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
wenzelm@30845
   762
for theorem dependency output of transactions resulting in a new
wenzelm@30845
   763
theory state.
wenzelm@30845
   764
wenzelm@30845
   765
* ML antiquotations: block-structured compilation context indicated by
wenzelm@27391
   766
\<lbrace> ... \<rbrace>; additional antiquotation forms:
wenzelm@27391
   767
wenzelm@30845
   768
  @{binding name}                         - basic name binding
wenzelm@27519
   769
  @{let ?pat = term}                      - term abbreviation (HO matching)
wenzelm@27519
   770
  @{note name = fact}                     - fact abbreviation
wenzelm@27519
   771
  @{thm fact}                             - singleton fact (with attributes)
wenzelm@27519
   772
  @{thms fact}                            - general fact (with attributes)
wenzelm@27519
   773
  @{lemma prop by method}                 - singleton goal
wenzelm@27519
   774
  @{lemma prop by meth1 meth2}            - singleton goal
wenzelm@27519
   775
  @{lemma prop1 ... propN by method}      - general goal
wenzelm@27519
   776
  @{lemma prop1 ... propN by meth1 meth2} - general goal
wenzelm@27519
   777
  @{lemma (open) ...}                     - open derivation
wenzelm@27380
   778
wenzelm@27246
   779
wenzelm@27979
   780
*** System ***
wenzelm@27979
   781
wenzelm@28248
   782
* The Isabelle "emacs" tool provides a specific interface to invoke
wenzelm@28248
   783
Proof General / Emacs, with more explicit failure if that is not
wenzelm@28248
   784
installed (the old isabelle-interface script silently falls back on
wenzelm@28248
   785
isabelle-process).  The PROOFGENERAL_HOME setting determines the
wenzelm@28248
   786
installation location of the Proof General distribution.
wenzelm@28248
   787
wenzelm@27979
   788
* Isabelle/lib/classes/Pure.jar provides basic support to integrate
wenzelm@27979
   789
the Isabelle process into a JVM/Scala application.  See
wenzelm@27979
   790
Isabelle/lib/jedit/plugin for a minimal example.  (The obsolete Java
wenzelm@27979
   791
process wrapper has been discontinued.)
wenzelm@27979
   792
wenzelm@30845
   793
* Added homegrown Isabelle font with unicode layout, see lib/fonts.
wenzelm@30845
   794
wenzelm@30845
   795
* Various status messages (with exact source position information) are
wenzelm@27979
   796
emitted, if proper markup print mode is enabled.  This allows
wenzelm@27979
   797
user-interface components to provide detailed feedback on internal
wenzelm@27979
   798
prover operations.
wenzelm@27979
   799
wenzelm@27979
   800
wenzelm@27143
   801
wenzelm@27008
   802
New in Isabelle2008 (June 2008)
wenzelm@27008
   803
-------------------------------
wenzelm@25464
   804
wenzelm@25522
   805
*** General ***
wenzelm@25522
   806
wenzelm@27061
   807
* The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
wenzelm@27061
   808
and updated, with formally checked references as hyperlinks.
wenzelm@27061
   809
wenzelm@25994
   810
* Theory loader: use_thy (and similar operations) no longer set the
wenzelm@25994
   811
implicit ML context, which was occasionally hard to predict and in
wenzelm@25994
   812
conflict with concurrency.  INCOMPATIBILITY, use ML within Isar which
wenzelm@25994
   813
provides a proper context already.
wenzelm@25994
   814
wenzelm@26323
   815
* Theory loader: old-style ML proof scripts being *attached* to a thy
wenzelm@26323
   816
file are no longer supported.  INCOMPATIBILITY, regular 'uses' and
wenzelm@26323
   817
'use' within a theory file will do the job.
wenzelm@26323
   818
wenzelm@26650
   819
* Name space merge now observes canonical order, i.e. the second space
wenzelm@26650
   820
is inserted into the first one, while existing entries in the first
wenzelm@26659
   821
space take precedence.  INCOMPATIBILITY in rare situations, may try to
wenzelm@26650
   822
swap theory imports.
wenzelm@26650
   823
wenzelm@27067
   824
* Syntax: symbol \<chi> is now considered a letter.  Potential
wenzelm@27067
   825
INCOMPATIBILITY in identifier syntax etc.
wenzelm@27067
   826
wenzelm@27067
   827
* Outer syntax: string tokens no longer admit escaped white space,
wenzelm@27067
   828
which was an accidental (undocumented) feature.  INCOMPATIBILITY, use
wenzelm@27067
   829
white space without escapes.
wenzelm@27067
   830
wenzelm@27067
   831
* Outer syntax: string tokens may contain arbitrary character codes
wenzelm@27067
   832
specified via 3 decimal digits (as in SML).  E.g. "foo\095bar" for
wenzelm@27067
   833
"foo_bar".
wenzelm@27067
   834
wenzelm@25522
   835
haftmann@25502
   836
*** Pure ***
haftmann@25502
   837
wenzelm@26718
   838
* Context-dependent token translations.  Default setup reverts locally
wenzelm@26718
   839
fixed variables, and adds hilite markup for undeclared frees.
wenzelm@26718
   840
berghofe@26681
   841
* Unused theorems can be found using the new command 'unused_thms'.
berghofe@26681
   842
There are three ways of invoking it:
berghofe@26681
   843
berghofe@26681
   844
(1) unused_thms
berghofe@26681
   845
     Only finds unused theorems in the current theory.
berghofe@26681
   846
berghofe@26681
   847
(2) unused_thms thy_1 ... thy_n -
berghofe@26681
   848
     Finds unused theorems in the current theory and all of its ancestors,
berghofe@26681
   849
     excluding the theories thy_1 ... thy_n and all of their ancestors.
berghofe@26681
   850
berghofe@26681
   851
(3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
berghofe@26681
   852
     Finds unused theorems in the theories thy'_1 ... thy'_m and all of
berghofe@26681
   853
     their ancestors, excluding the theories thy_1 ... thy_n and all of
berghofe@26681
   854
     their ancestors.
berghofe@26681
   855
wenzelm@26718
   856
In order to increase the readability of the list produced by
wenzelm@26718
   857
unused_thms, theorems that have been created by a particular instance
wenzelm@26874
   858
of a theory command such as 'inductive' or 'function' are considered
wenzelm@26874
   859
to belong to the same "group", meaning that if at least one theorem in
wenzelm@26718
   860
this group is used, the other theorems in the same group are no longer
wenzelm@26718
   861
reported as unused.  Moreover, if all theorems in the group are
wenzelm@26718
   862
unused, only one theorem in the group is displayed.
wenzelm@26718
   863
wenzelm@26718
   864
Note that proof objects have to be switched on in order for
wenzelm@26718
   865
unused_thms to work properly (i.e. !proofs must be >= 1, which is
wenzelm@26874
   866
usually the case when using Proof General with the default settings).
berghofe@26681
   867
wenzelm@26650
   868
* Authentic naming of facts disallows ad-hoc overwriting of previous
wenzelm@26650
   869
theorems within the same name space.  INCOMPATIBILITY, need to remove
wenzelm@26650
   870
duplicate fact bindings, or even accidental fact duplications.  Note
wenzelm@26650
   871
that tools may maintain dynamically scoped facts systematically, using
wenzelm@26650
   872
PureThy.add_thms_dynamic.
wenzelm@26650
   873
wenzelm@26660
   874
* Command 'hide' now allows to hide from "fact" name space as well.
wenzelm@26660
   875
wenzelm@26496
   876
* Eliminated destructive theorem database, simpset, claset, and
wenzelm@26496
   877
clasimpset.  Potential INCOMPATIBILITY, really need to observe linear
wenzelm@26496
   878
update of theories within ML code.
wenzelm@26479
   879
wenzelm@26955
   880
* Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
wenzelm@26955
   881
INCOMPATIBILITY, object-logics depending on former Pure require
wenzelm@26955
   882
additional setup PureThy.old_appl_syntax_setup; object-logics
wenzelm@26955
   883
depending on former CPure need to refer to Pure.
wenzelm@26650
   884
wenzelm@26495
   885
* Commands 'use' and 'ML' are now purely functional, operating on
wenzelm@26479
   886
theory/local_theory.  Removed former 'ML_setup' (on theory), use 'ML'
wenzelm@26479
   887
instead.  Added 'ML_val' as mere diagnostic replacement for 'ML'.
wenzelm@26479
   888
INCOMPATIBILITY.
wenzelm@26479
   889
wenzelm@26874
   890
* Command 'setup': discontinued implicit version with ML reference.
wenzelm@26434
   891
wenzelm@25970
   892
* Instantiation target allows for simultaneous specification of class
wenzelm@25970
   893
instance operations together with an instantiation proof.
wenzelm@25970
   894
Type-checking phase allows to refer to class operations uniformly.
wenzelm@27067
   895
See src/HOL/Complex/Complex.thy for an Isar example and
wenzelm@27067
   896
src/HOL/Library/Eval.thy for an ML example.
haftmann@25502
   897
wenzelm@26201
   898
* Indexing of literal facts: be more serious about including only
wenzelm@26201
   899
facts from the visible specification/proof context, but not the
wenzelm@26201
   900
background context (locale etc.).  Affects `prop` notation and method
wenzelm@26201
   901
"fact".  INCOMPATIBILITY: need to name facts explicitly in rare
wenzelm@26201
   902
situations.
wenzelm@26201
   903
wenzelm@26925
   904
* Method "cases", "induct", "coinduct": removed obsolete/undocumented
wenzelm@26925
   905
"(open)" option, which used to expose internal bound variables to the
wenzelm@26925
   906
proof text.
wenzelm@26925
   907
wenzelm@26925
   908
* Isar statements: removed obsolete case "rule_context".
wenzelm@26925
   909
INCOMPATIBILITY, better use explicit fixes/assumes.
wenzelm@26925
   910
wenzelm@26874
   911
* Locale proofs: default proof step now includes 'unfold_locales';
wenzelm@26874
   912
hence 'proof' without argument may be used to unfold locale
wenzelm@26874
   913
predicates.
ballarin@26765
   914
ballarin@26765
   915
haftmann@26762
   916
*** Document preparation ***
haftmann@26762
   917
wenzelm@26914
   918
* Simplified pdfsetup.sty: color/hyperref is used unconditionally for
wenzelm@26914
   919
both pdf and dvi (hyperlinks usually work in xdvi as well); removed
wenzelm@26914
   920
obsolete thumbpdf setup (contemporary PDF viewers do this on the
wenzelm@26914
   921
spot); renamed link color from "darkblue" to "linkcolor" (default
wenzelm@26920
   922
value unchanged, can be redefined via \definecolor); no longer sets
wenzelm@26920
   923
"a4paper" option (unnecessary or even intrusive).
wenzelm@26914
   924
wenzelm@27008
   925
* Antiquotation @{lemma A method} proves proposition A by the given
wenzelm@27008
   926
method (either a method name or a method name plus (optional) method
wenzelm@27008
   927
arguments in parentheses) and prints A just like @{prop A}.
haftmann@26762
   928
haftmann@26762
   929
wenzelm@25464
   930
*** HOL ***
wenzelm@25464
   931
wenzelm@27067
   932
* New primrec package.  Specification syntax conforms in style to
wenzelm@27067
   933
definition/function/....  No separate induction rule is provided.  The
wenzelm@27067
   934
"primrec" command distinguishes old-style and new-style specifications
wenzelm@27067
   935
by syntax.  The former primrec package is now named OldPrimrecPackage.
wenzelm@27067
   936
When adjusting theories, beware: constants stemming from new-style
wenzelm@27067
   937
primrec specifications have authentic syntax.
wenzelm@27067
   938
wenzelm@27067
   939
* Metis prover is now an order of magnitude faster, and also works
wenzelm@27067
   940
with multithreading.
wenzelm@27067
   941
wenzelm@27067
   942
* Metis: the maximum number of clauses that can be produced from a
wenzelm@27067
   943
theorem is now given by the attribute max_clauses.  Theorems that
wenzelm@27067
   944
exceed this number are ignored, with a warning printed.
wenzelm@27067
   945
wenzelm@27067
   946
* Sledgehammer no longer produces structured proofs by default. To
wenzelm@27067
   947
enable, declare [[sledgehammer_full = true]].  Attributes
wenzelm@27067
   948
reconstruction_modulus, reconstruction_sorts renamed
wenzelm@27067
   949
sledgehammer_modulus, sledgehammer_sorts.  INCOMPATIBILITY.
wenzelm@27067
   950
haftmann@27104
   951
* Method "induct_scheme" derives user-specified induction rules
wenzelm@27067
   952
from well-founded induction and completeness of patterns. This factors
wenzelm@27067
   953
out some operations that are done internally by the function package
wenzelm@27067
   954
and makes them available separately.  See
wenzelm@27067
   955
src/HOL/ex/Induction_Scheme.thy for examples.
wenzelm@27067
   956
wenzelm@27067
   957
* More flexible generation of measure functions for termination
wenzelm@27067
   958
proofs: Measure functions can be declared by proving a rule of the
wenzelm@27067
   959
form "is_measure f" and giving it the [measure_function] attribute.
wenzelm@27067
   960
The "is_measure" predicate is logically meaningless (always true), and
wenzelm@27067
   961
just guides the heuristic.  To find suitable measure functions, the
wenzelm@27067
   962
termination prover sets up the goal "is_measure ?f" of the appropriate
wenzelm@27067
   963
type and generates all solutions by prolog-style backwards proof using
wenzelm@27067
   964
the declared rules.
wenzelm@27067
   965
wenzelm@27067
   966
This setup also deals with rules like 
wenzelm@27067
   967
wenzelm@27067
   968
  "is_measure f ==> is_measure (list_size f)"
wenzelm@27067
   969
wenzelm@27067
   970
which accommodates nested datatypes that recurse through lists.
wenzelm@27067
   971
Similar rules are predeclared for products and option types.
wenzelm@27067
   972
berghofe@26964
   973
* Turned the type of sets "'a set" into an abbreviation for "'a => bool"
berghofe@26964
   974
berghofe@26964
   975
  INCOMPATIBILITIES:
berghofe@26964
   976
wenzelm@27008
   977
  - Definitions of overloaded constants on sets have to be replaced by
wenzelm@27008
   978
    definitions on => and bool.
berghofe@26964
   979
berghofe@26964
   980
  - Some definitions of overloaded operators on sets can now be proved
wenzelm@27008
   981
    using the definitions of the operators on => and bool.  Therefore,
wenzelm@27008
   982
    the following theorems have been renamed:
berghofe@26964
   983
berghofe@26964
   984
      subset_def   -> subset_eq
berghofe@26964
   985
      psubset_def  -> psubset_eq
berghofe@26964
   986
      set_diff_def -> set_diff_eq
berghofe@26964
   987
      Compl_def    -> Compl_eq
berghofe@26964
   988
      Sup_set_def  -> Sup_set_eq
berghofe@26964
   989
      Inf_set_def  -> Inf_set_eq
berghofe@26964
   990
      sup_set_def  -> sup_set_eq
berghofe@26964
   991
      inf_set_def  -> inf_set_eq
berghofe@26964
   992
berghofe@26964
   993
  - Due to the incompleteness of the HO unification algorithm, some
berghofe@26964
   994
    rules such as subst may require manual instantiation, if some of
berghofe@26964
   995
    the unknowns in the rule is a set.
berghofe@26964
   996
berghofe@26964
   997
  - Higher order unification and forward proofs:
berghofe@26964
   998
    The proof pattern
berghofe@26964
   999
berghofe@26964
  1000
      have "P (S::'a set)" <...>
berghofe@26964
  1001
      then have "EX S. P S" ..
berghofe@26964
  1002
wenzelm@27008
  1003
    no longer works (due to the incompleteness of the HO unification
wenzelm@27008
  1004
    algorithm) and must be replaced by the pattern
berghofe@26964
  1005
berghofe@26964
  1006
      have "EX S. P S"
berghofe@26964
  1007
      proof
berghofe@26964
  1008
        show "P S" <...>
berghofe@26964
  1009
      qed
berghofe@26964
  1010
berghofe@26964
  1011
  - Calculational reasoning with subst (or similar rules):
berghofe@26964
  1012
    The proof pattern
berghofe@26964
  1013
berghofe@26964
  1014
      have "P (S::'a set)" <...>
berghofe@26964
  1015
      also have "S = T" <...>
berghofe@26964
  1016
      finally have "P T" .
berghofe@26964
  1017
wenzelm@27008
  1018
    no longer works (for similar reasons as the previous example) and
wenzelm@27008
  1019
    must be replaced by something like
berghofe@26964
  1020
berghofe@26964
  1021
      have "P (S::'a set)" <...>
berghofe@26964
  1022
      moreover have "S = T" <...>
berghofe@26964
  1023
      ultimately have "P T" by simp
berghofe@26964
  1024
berghofe@26964
  1025
  - Tactics or packages written in ML code:
berghofe@26964
  1026
    Code performing pattern matching on types via
berghofe@26964
  1027
berghofe@26964
  1028
      Type ("set", [T]) => ...
berghofe@26964
  1029
wenzelm@27008
  1030
    must be rewritten. Moreover, functions like strip_type or
wenzelm@27008
  1031
    binder_types no longer return the right value when applied to a
wenzelm@27008
  1032
    type of the form
berghofe@26964
  1033
berghofe@26964
  1034
      T1 => ... => Tn => U => bool
berghofe@26964
  1035
berghofe@26964
  1036
    rather than
berghofe@26964
  1037
berghofe@26964
  1038
      T1 => ... => Tn => U set
berghofe@26964
  1039
wenzelm@26874
  1040
* Merged theories Wellfounded_Recursion, Accessible_Part and
wenzelm@27067
  1041
Wellfounded_Relations to theory Wellfounded.
krauss@26748
  1042
haftmann@26513
  1043
* Explicit class "eq" for executable equality.  INCOMPATIBILITY.
haftmann@26513
  1044
wenzelm@26874
  1045
* Class finite no longer treats UNIV as class parameter.  Use class
wenzelm@26874
  1046
enum from theory Library/Enum instead to achieve a similar effect.
haftmann@26445
  1047
INCOMPATIBILITY.
haftmann@26445
  1048
wenzelm@26874
  1049
* Theory List: rule list_induct2 now has explicitly named cases "Nil"
wenzelm@26874
  1050
and "Cons".  INCOMPATIBILITY.
wenzelm@26874
  1051
wenzelm@26422
  1052
* HOL (and FOL): renamed variables in rules imp_elim and swap.
wenzelm@26422
  1053
Potential INCOMPATIBILITY.
wenzelm@26422
  1054
wenzelm@26874
  1055
* Theory Product_Type: duplicated lemmas split_Pair_apply and
wenzelm@26874
  1056
injective_fst_snd removed, use split_eta and prod_eqI instead.
wenzelm@26874
  1057
Renamed upd_fst to apfst and upd_snd to apsnd.  INCOMPATIBILITY.
haftmann@26355
  1058
wenzelm@26335
  1059
* Theory Nat: removed redundant lemmas that merely duplicate lemmas of
wenzelm@26335
  1060
the same name in theory Orderings:
wenzelm@26335
  1061
wenzelm@26335
  1062
  less_trans
wenzelm@26335
  1063
  less_linear
wenzelm@26335
  1064
  le_imp_less_or_eq
wenzelm@26335
  1065
  le_less_trans
wenzelm@26335
  1066
  less_le_trans
wenzelm@26335
  1067
  less_not_sym
wenzelm@26335
  1068
  less_asym
wenzelm@26335
  1069
wenzelm@26335
  1070
Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
wenzelm@26335
  1071
less_irrefl_nat.  Potential INCOMPATIBILITY due to more general types
wenzelm@26335
  1072
and different variable names.
wenzelm@26315
  1073
haftmann@26231
  1074
* Library/Option_ord.thy: Canonical order on option type.
haftmann@26231
  1075
wenzelm@27008
  1076
* Library/RBT.thy: Red-black trees, an efficient implementation of
wenzelm@27008
  1077
finite maps.
krauss@26197
  1078
haftmann@26231
  1079
* Library/Countable.thy: Type class for countable types.
haftmann@26231
  1080
wenzelm@26180
  1081
* Theory Int: The representation of numerals has changed.  The infix
wenzelm@26180
  1082
operator BIT and the bit datatype with constructors B0 and B1 have
wenzelm@26180
  1083
disappeared.  INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
wenzelm@26180
  1084
place of "x BIT bit.B0" and "y BIT bit.B1", respectively.  Theorems
wenzelm@26180
  1085
involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
wenzelm@26180
  1086
accordingly.
wenzelm@26180
  1087
wenzelm@26180
  1088
* Theory Nat: definition of <= and < on natural numbers no longer
wenzelm@26180
  1089
depend on well-founded relations.  INCOMPATIBILITY.  Definitions
wenzelm@26180
  1090
le_def and less_def have disappeared.  Consider lemmas not_less
wenzelm@26180
  1091
[symmetric, where ?'a = nat] and less_eq [symmetric] instead.
wenzelm@26180
  1092
wenzelm@26180
  1093
* Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
wenzelm@26180
  1094
(whose purpose mainly is for various fold_set functionals) have been
wenzelm@26874
  1095
abandoned in favor of the existing algebraic classes
wenzelm@26180
  1096
ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
wenzelm@26180
  1097
lower_semilattice (resp. upper_semilattice) and linorder.
haftmann@26139
  1098
INCOMPATIBILITY.
haftmann@26041
  1099
wenzelm@26180
  1100
* Theory Transitive_Closure: induct and cases rules now declare proper
wenzelm@26180
  1101
case_names ("base" and "step").  INCOMPATIBILITY.
wenzelm@26180
  1102
wenzelm@26180
  1103
* Theorem Inductive.lfp_ordinal_induct generalized to complete
wenzelm@26180
  1104
lattices.  The form set-specific version is available as
wenzelm@26180
  1105
Inductive.lfp_ordinal_induct_set.
haftmann@26013
  1106
wenzelm@26874
  1107
* Renamed theorems "power.simps" to "power_int.simps".
wenzelm@27067
  1108
INCOMPATIBILITY.
haftmann@25961
  1109
wenzelm@26180
  1110
* Class semiring_div provides basic abstract properties of semirings
haftmann@25942
  1111
with division and modulo operations.  Subsumes former class dvd_mod.
haftmann@25942
  1112
wenzelm@26180
  1113
* Merged theories IntDef, Numeral and IntArith into unified theory
wenzelm@26180
  1114
Int.  INCOMPATIBILITY.
wenzelm@26180
  1115
wenzelm@26180
  1116
* Theory Library/Code_Index: type "index" now represents natural
wenzelm@26180
  1117
numbers rather than integers.  INCOMPATIBILITY.
wenzelm@26180
  1118
wenzelm@26180
  1119
* New class "uminus" with operation "uminus" (split of from class
wenzelm@26180
  1120
"minus" which now only has operation "minus", binary).
haftmann@25919
  1121
INCOMPATIBILITY.
haftmann@25919
  1122
wenzelm@25522
  1123
* Constants "card", "internal_split", "option_map" now with authentic
haftmann@25919
  1124
syntax.  INCOMPATIBILITY.
wenzelm@25522
  1125
wenzelm@25522
  1126
* Definitions subset_def, psubset_def, set_diff_def, Compl_def,
wenzelm@25522
  1127
le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
wenzelm@25522
  1128
sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
wenzelm@25522
  1129
Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
wenzelm@25522
  1130
Sup_set_def, le_def, less_def, option_map_def now with object
haftmann@25919
  1131
equality.  INCOMPATIBILITY.
wenzelm@25464
  1132
schirmer@25705
  1133
* Records. Removed K_record, and replaced it by pure lambda term
wenzelm@25726
  1134
%x. c. The simplifier setup is now more robust against eta expansion.
schirmer@25705
  1135
INCOMPATIBILITY: in cases explicitly referring to K_record.
wenzelm@25464
  1136
wenzelm@27067
  1137
* Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
wenzelm@27067
  1138
wenzelm@27067
  1139
* Library/ListVector: new theory of arithmetic vector operations.
wenzelm@27067
  1140
wenzelm@27067
  1141
* Library/Order_Relation: new theory of various orderings as sets of
wenzelm@27067
  1142
pairs.  Defines preorders, partial orders, linear orders and
wenzelm@27067
  1143
well-orders on sets and on types.
krauss@26877
  1144
wenzelm@25726
  1145
krauss@26197
  1146
*** ZF ***
krauss@26197
  1147
wenzelm@26874
  1148
* Renamed some theories to allow to loading both ZF and HOL in the
wenzelm@26874
  1149
same session:
wenzelm@26874
  1150
wenzelm@26874
  1151
  Datatype  -> Datatype_ZF
wenzelm@26874
  1152
  Inductive -> Inductive_ZF
wenzelm@26874
  1153
  Int       -> Int_ZF
wenzelm@26874
  1154
  IntDiv    -> IntDiv_ZF
wenzelm@26874
  1155
  Nat       -> Nat_ZF
wenzelm@26874
  1156
  List      -> List_ZF
wenzelm@26874
  1157
  Main      -> Main_ZF
wenzelm@26874
  1158
wenzelm@26874
  1159
INCOMPATIBILITY: ZF theories that import individual theories below
wenzelm@26874
  1160
Main might need to be adapted.  Regular theory Main is still
wenzelm@26874
  1161
available, as trivial extension of Main_ZF.
krauss@26197
  1162
krauss@26197
  1163
wenzelm@25737
  1164
*** ML ***
wenzelm@25737
  1165
wenzelm@27067
  1166
* ML within Isar: antiquotation @{const name} or @{const
wenzelm@27067
  1167
name(typargs)} produces statically-checked Const term.
wenzelm@27067
  1168
wenzelm@26401
  1169
* Functor NamedThmsFun: data is available to the user as dynamic fact
wenzelm@26724
  1170
(of the same name).  Removed obsolete print command.
wenzelm@26401
  1171
wenzelm@27067
  1172
* Removed obsolete "use_legacy_bindings" function.
wenzelm@26188
  1173
wenzelm@25737
  1174
* The ``print mode'' is now a thread-local value derived from a global
wenzelm@25737
  1175
template (the former print_mode reference), thus access becomes
wenzelm@25737
  1176
non-critical.  The global print_mode reference is for session
wenzelm@25737
  1177
management only; user-code should use print_mode_value,
wenzelm@25737
  1178
print_mode_active, PrintMode.setmp etc.  INCOMPATIBILITY.
wenzelm@25737
  1179
wenzelm@26874
  1180
* Functions system/system_out provide a robust way to invoke external
wenzelm@29161
  1181
shell commands, with propagation of interrupts (requires Poly/ML
wenzelm@29161
  1182
5.2.1).  Do not use OS.Process.system etc. from the basis library!
wenzelm@26222
  1183
wenzelm@25737
  1184
wenzelm@25626
  1185
*** System ***
wenzelm@25626
  1186
wenzelm@25971
  1187
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
wenzelm@25971
  1188
in accordance with Proof General 3.7, which prefers GNU emacs.
wenzelm@25970
  1189
wenzelm@25626
  1190
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm@25626
  1191
optional line editor may be specified via ISABELLE_LINE_EDITOR
wenzelm@25626
  1192
setting, the default settings attempt to locate "ledit" and "rlwrap".
wenzelm@25626
  1193
wenzelm@25651
  1194
* isatool browser now works with Cygwin as well, using general
wenzelm@25651
  1195
"javapath" function defined in Isabelle process environment.
wenzelm@25651
  1196
wenzelm@27067
  1197
* YXML notation provides a simple and efficient alternative to
wenzelm@27067
  1198
standard XML transfer syntax.  See src/Pure/General/yxml.ML and
wenzelm@27067
  1199
isatool yxml as described in the Isabelle system manual.
wenzelm@25651
  1200
wenzelm@25652
  1201
* JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
wenzelm@25651
  1202
provides general wrapper for managing an Isabelle process in a robust
wenzelm@25651
  1203
fashion, with ``cooked'' output from stdin/stderr.
wenzelm@25651
  1204
wenzelm@25855
  1205
* Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
wenzelm@25855
  1206
based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
wenzelm@25855
  1207
wenzelm@27067
  1208
* Removed obsolete THIS_IS_ISABELLE_BUILD feature.  NB: the documented
wenzelm@27067
  1209
way of changing the user's settings is via
wenzelm@27067
  1210
ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
wenzelm@27067
  1211
script.
wenzelm@27067
  1212
wenzelm@27067
  1213
* Multithreading.max_threads := 0 refers to the number of actual CPU
wenzelm@27067
  1214
cores of the underlying machine, which is a good starting point for
wenzelm@27067
  1215
optimal performance tuning.  The corresponding usedir option -M allows
wenzelm@27067
  1216
"max" as an alias for "0".  WARNING: does not work on certain versions
wenzelm@27067
  1217
of Mac OS (with Poly/ML 5.1).
wenzelm@27067
  1218
wenzelm@27067
  1219
* isabelle-process: non-ML sessions are run with "nice", to reduce the
wenzelm@27067
  1220
adverse effect of Isabelle flooding interactive front-ends (notably
wenzelm@27067
  1221
ProofGeneral / XEmacs).
wenzelm@27067
  1222
wenzelm@25626
  1223
wenzelm@25464
  1224
wenzelm@25429
  1225
New in Isabelle2007 (November 2007)
wenzelm@25429
  1226
-----------------------------------
wenzelm@17754
  1227
wenzelm@17754
  1228
*** General ***
wenzelm@17754
  1229
wenzelm@22826
  1230
* More uniform information about legacy features, notably a
wenzelm@22826
  1231
warning/error of "Legacy feature: ...", depending on the state of the
wenzelm@23367
  1232
tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
wenzelm@23367
  1233
legacy features will disappear eventually.
wenzelm@22826
  1234
wenzelm@17918
  1235
* Theory syntax: the header format ``theory A = B + C:'' has been
wenzelm@17918
  1236
discontinued in favour of ``theory A imports B C begin''.  Use isatool
wenzelm@17918
  1237
fixheaders to convert existing theory files.  INCOMPATIBILITY.
wenzelm@17918
  1238
wenzelm@17918
  1239
* Theory syntax: the old non-Isar theory file format has been
wenzelm@17918
  1240
discontinued altogether.  Note that ML proof scripts may still be used
wenzelm@17918
  1241
with Isar theories; migration is usually quite simple with the ML
wenzelm@17918
  1242
function use_legacy_bindings.  INCOMPATIBILITY.
wenzelm@17918
  1243
wenzelm@22871
  1244
* Theory syntax: some popular names (e.g. 'class', 'declaration',
wenzelm@22871
  1245
'fun', 'help', 'if') are now keywords.  INCOMPATIBILITY, use double
wenzelm@22871
  1246
quotes.
wenzelm@19814
  1247
wenzelm@23888
  1248
* Theory loader: be more serious about observing the static theory
wenzelm@23888
  1249
header specifications (including optional directories), but not the
wenzelm@24172
  1250
accidental file locations of previously successful loads.  The strict
wenzelm@24172
  1251
update policy of former update_thy is now already performed by
wenzelm@24172
  1252
use_thy, so the former has been removed; use_thys updates several
wenzelm@24172
  1253
theories simultaneously, just as 'imports' within a theory header
wenzelm@24172
  1254
specification, but without merging the results.  Potential
wenzelm@24172
  1255
INCOMPATIBILITY: may need to refine theory headers and commands
wenzelm@24172
  1256
ROOT.ML which depend on load order.
wenzelm@23888
  1257
wenzelm@23888
  1258
* Theory loader: optional support for content-based file
wenzelm@23888
  1259
identification, instead of the traditional scheme of full physical
wenzelm@23889
  1260
path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
wenzelm@23888
  1261
(cf. the system manual).  The new scheme allows to work with
wenzelm@23888
  1262
non-finished theories in persistent session images, such that source
wenzelm@23888
  1263
files may be moved later on without requiring reloads.
wenzelm@23888
  1264
wenzelm@24187
  1265
* Theory loader: old-style ML proof scripts being *attached* to a thy
wenzelm@24187
  1266
file (with the same base name as the theory) are considered a legacy
wenzelm@24800
  1267
feature, which will disappear eventually. Even now, the theory loader
wenzelm@24800
  1268
no longer maintains dependencies on such files.
wenzelm@24800
  1269
wenzelm@24800
  1270
* Syntax: the scope for resolving ambiguities via type-inference is
wenzelm@24800
  1271
now limited to individual terms, instead of whole simultaneous
wenzelm@24234
  1272
specifications as before. This greatly reduces the complexity of the
wenzelm@24234
  1273
syntax module and improves flexibility by separating parsing and
wenzelm@24234
  1274
type-checking. INCOMPATIBILITY: additional type-constraints (explicit
wenzelm@24234
  1275
'fixes' etc.) are required in rare situations.
wenzelm@24234
  1276
wenzelm@25034
  1277
* Syntax: constants introduced by new-style packages ('definition',
wenzelm@25034
  1278
'abbreviation' etc.) are passed through the syntax module in
wenzelm@25034
  1279
``authentic mode''. This means that associated mixfix annotations
wenzelm@25034
  1280
really stick to such constants, independently of potential name space
wenzelm@25034
  1281
ambiguities introduced later on. INCOMPATIBILITY: constants in parse
wenzelm@25034
  1282
trees are represented slightly differently, may need to adapt syntax
wenzelm@25034
  1283
translations accordingly. Use CONST marker in 'translations' and
wenzelm@25034
  1284
@{const_syntax} antiquotation in 'parse_translation' etc.
wenzelm@25034
  1285
wenzelm@17981
  1286
* Legacy goal package: reduced interface to the bare minimum required
wenzelm@17981
  1287
to keep existing proof scripts running.  Most other user-level
wenzelm@17981
  1288
functions are now part of the OldGoals structure, which is *not* open
wenzelm@17981
  1289
by default (consider isatool expandshort before open OldGoals).
wenzelm@17981
  1290
Removed top_sg, prin, printyp, pprint_term/typ altogether, because
wenzelm@17981
  1291
these tend to cause confusion about the actual goal (!) context being
wenzelm@17981
  1292
used here, which is not necessarily the same as the_context().
wenzelm@17918
  1293
wenzelm@23379
  1294
* Command 'find_theorems': supports "*" wild-card in "name:"
wenzelm@23379
  1295
criterion; "with_dups" option.  Certain ProofGeneral versions might
wenzelm@23379
  1296
support a specific search form (see ProofGeneral/CHANGES).
webertj@22965
  1297
wenzelm@20370
  1298
* The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
wenzelm@20370
  1299
by default, which means that "prems" (and also "fixed variables") are
wenzelm@20370
  1300
suppressed from proof state output.  Note that the ProofGeneral
wenzelm@20370
  1301
settings mechanism allows to change and save options persistently, but
wenzelm@20370
  1302
older versions of Isabelle will fail to start up if a negative prems
wenzelm@20370
  1303
limit is imposed.
wenzelm@20370
  1304
wenzelm@21308
  1305
* Local theory targets may be specified by non-nested blocks of
wenzelm@21308
  1306
``context/locale/class ... begin'' followed by ``end''.  The body may
wenzelm@21308
  1307
contain definitions, theorems etc., including any derived mechanism
wenzelm@21308
  1308
that has been implemented on top of these primitives.  This concept
wenzelm@21308
  1309
generalizes the existing ``theorem (in ...)'' towards more versatility
wenzelm@21308
  1310
and scalability.
wenzelm@21308
  1311
wenzelm@21960
  1312
* Proof General interface: proper undo of final 'end' command;
wenzelm@21960
  1313
discontinued Isabelle/classic mode (ML proof scripts).
wenzelm@21960
  1314
wenzelm@17754
  1315
wenzelm@17865
  1316
*** Document preparation ***
wenzelm@17865
  1317
wenzelm@21717
  1318
* Added antiquotation @{theory name} which prints the given name,
wenzelm@21717
  1319
after checking that it refers to a valid ancestor theory in the
wenzelm@21717
  1320
current context.
haftmann@21339
  1321
wenzelm@17869
  1322
* Added antiquotations @{ML_type text} and @{ML_struct text} which
wenzelm@17869
  1323
check the given source text as ML type/structure, printing verbatim.
wenzelm@17865
  1324
wenzelm@21717
  1325
* Added antiquotation @{abbrev "c args"} which prints the abbreviation
wenzelm@21717
  1326
"c args == rhs" given in the current context.  (Any number of
wenzelm@21735
  1327
arguments may be given on the LHS.)
wenzelm@21717
  1328
wenzelm@21717
  1329
wenzelm@17779
  1330
*** Pure ***
wenzelm@17779
  1331
wenzelm@24800
  1332
* The 'class' package offers a combination of axclass and locale to
wenzelm@25129
  1333
achieve Haskell-like type classes in Isabelle.  Definitions and
wenzelm@25129
  1334
theorems within a class context produce both relative results (with
wenzelm@25129
  1335
implicit parameters according to the locale context), and polymorphic
wenzelm@25129
  1336
constants with qualified polymorphism (according to the class
wenzelm@25129
  1337
context).  Within the body context of a 'class' target, a separate
wenzelm@25129
  1338
syntax layer ("user space type system") takes care of converting
wenzelm@25129
  1339
between global polymorphic consts and internal locale representation.
wenzelm@25177
  1340
See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
haftmann@25184
  1341
"isatool doc classes" provides a tutorial.
wenzelm@20807
  1342
haftmann@25199
  1343
* Generic code generator framework allows to generate executable
wenzelm@24800
  1344
code for ML and Haskell (including Isabelle classes).  A short usage
wenzelm@24800
  1345
sketch:
haftmann@20188
  1346
haftmann@20188
  1347
    internal compilation:
haftmann@25199
  1348
        export_code <list of constants (term syntax)> in SML
haftmann@20453
  1349
    writing SML code to a file:
haftmann@25199
  1350
        export_code <list of constants (term syntax)> in SML <filename>
haftmann@22735
  1351
    writing OCaml code to a file:
haftmann@25199
  1352
        export_code <list of constants (term syntax)> in OCaml <filename>
haftmann@20188
  1353
    writing Haskell code to a bunch of files:
haftmann@25199
  1354
        export_code <list of constants (term syntax)> in Haskell <filename>
haftmann@25199
  1355
haftmann@25199
  1356
    evaluating closed propositions to True/False using code generation:
haftmann@25184
  1357
        method ``eval''
haftmann@25184
  1358
haftmann@25184
  1359
Reasonable default setup of framework in HOL.
haftmann@20453
  1360
haftmann@20453
  1361
Theorem attributs for selecting and transforming function equations theorems:
haftmann@20453
  1362
haftmann@22845
  1363
    [code fun]:        select a theorem as function equation for a specific constant
haftmann@22845
  1364
    [code fun del]:    deselect a theorem as function equation for a specific constant
haftmann@22845
  1365
    [code inline]:     select an equation theorem for unfolding (inlining) in place
haftmann@22845
  1366
    [code inline del]: deselect an equation theorem for unfolding (inlining) in place
haftmann@20453
  1367
haftmann@22735
  1368
User-defined serializations (target in {SML, OCaml, Haskell}):
haftmann@20453
  1369
haftmann@20453
  1370
    code_const <and-list of constants (term syntax)>
haftmann@20453
  1371
      {(target) <and-list of const target syntax>}+
haftmann@20453
  1372
haftmann@20453
  1373
    code_type <and-list of type constructors>
haftmann@20453
  1374
      {(target) <and-list of type target syntax>}+
haftmann@20453
  1375
haftmann@20453
  1376
    code_instance <and-list of instances>
haftmann@20453
  1377
      {(target)}+
haftmann@20453
  1378
        where instance ::= <type constructor> :: <class>
haftmann@20453
  1379
haftmann@20453
  1380
    code_class <and_list of classes>
haftmann@20453
  1381
      {(target) <and-list of class target syntax>}+
haftmann@20453
  1382
        where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
haftmann@20453
  1383
haftmann@25199
  1384
code_instance and code_class only are effective to target Haskell.
haftmann@22735
  1385
wenzelm@25177
  1386
For example usage see src/HOL/ex/Codegenerator.thy and
wenzelm@25177
  1387
src/HOL/ex/Codegenerator_Pretty.thy.  A separate tutorial on code
wenzelm@24800
  1388
generation from Isabelle/HOL theories is available via "isatool doc
wenzelm@24800
  1389
codegen".
haftmann@20188
  1390
wenzelm@25129
  1391
* Code generator: consts in 'consts_code' Isar commands are now
wenzelm@25129
  1392
referred to by usual term syntax (including optional type
wenzelm@25129
  1393
annotations).
wenzelm@25129
  1394
wenzelm@19254
  1395
* Command 'no_translations' removes translation rules from theory
wenzelm@19254
  1396
syntax.
wenzelm@19254
  1397
wenzelm@19625
  1398
* Overloaded definitions are now actually checked for acyclic
wenzelm@19714
  1399
dependencies.  The overloading scheme is slightly more general than
wenzelm@19714
  1400
that of Haskell98, although Isabelle does not demand an exact
wenzelm@19714
  1401
correspondence to type class and instance declarations.
wenzelm@19714
  1402
INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
wenzelm@19714
  1403
exotic versions of overloading -- at the discretion of the user!
wenzelm@19711
  1404
wenzelm@19711
  1405
Polymorphic constants are represented via type arguments, i.e. the
wenzelm@19711
  1406
instantiation that matches an instance against the most general
wenzelm@19711
  1407
declaration given in the signature.  For example, with the declaration
wenzelm@19711
  1408
c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
wenzelm@19711
  1409
as c(nat).  Overloading is essentially simultaneous structural
wenzelm@19711
  1410
recursion over such type arguments.  Incomplete specification patterns
wenzelm@19714
  1411
impose global constraints on all occurrences, e.g. c('a * 'a) on the
wenzelm@19715
  1412
LHS means that more general c('a * 'b) will be disallowed on any RHS.
wenzelm@19714
  1413
Command 'print_theory' outputs the normalized system of recursive
wenzelm@19714
  1414
equations, see section "definitions".
wenzelm@19625
  1415
wenzelm@24086
  1416
* Configuration options are maintained within the theory or proof
wenzelm@24086
  1417
context (with name and type bool/int/string), providing a very simple
wenzelm@24086
  1418
interface to a poor-man's version of general context data.  Tools may
wenzelm@24110
  1419
declare options in ML (e.g. using Attrib.config_int) and then refer to
wenzelm@24110
  1420
these values using Config.get etc.  Users may change options via an
wenzelm@24110
  1421
associated attribute of the same name.  This form of context
wenzelm@24110
  1422
declaration works particularly well with commands 'declare' or
wenzelm@24110
  1423
'using', for example ``declare [[foo = 42]]''.  Thus it has become
wenzelm@24110
  1424
very easy to avoid global references, which would not observe Isar
wenzelm@24110
  1425
toplevel undo/redo and fail to work with multithreading.
wenzelm@24086
  1426
wenzelm@24172
  1427
Various global ML references of Pure and HOL have been turned into
wenzelm@24172
  1428
configuration options:
wenzelm@24172
  1429
wenzelm@24172
  1430
  Unify.search_bound		unify_search_bound
wenzelm@24172
  1431
  Unify.trace_bound		unify_trace_bound
wenzelm@24172
  1432
  Unify.trace_simp		unify_trace_simp
wenzelm@24172
  1433
  Unify.trace_types		unify_trace_types
wenzelm@24172
  1434
  Simplifier.simp_depth_limit	simp_depth_limit
wenzelm@24172
  1435
  Blast.depth_limit		blast_depth_limit
wenzelm@24172
  1436
  DatatypeProp.dtK		datatype_distinctness_limit
wenzelm@24172
  1437
  fast_arith_neq_limit  	fast_arith_neq_limit
wenzelm@24172
  1438
  fast_arith_split_limit	fast_arith_split_limit
wenzelm@24172
  1439
wenzelm@24086
  1440
* Named collections of theorems may be easily installed as context
wenzelm@24800
  1441
data using the functor NamedThmsFun (see also
wenzelm@24086
  1442
src/Pure/Tools/named_thms.ML).  The user may add or delete facts via
wenzelm@24110
  1443
attributes; there is also a toplevel print command.  This facility is
wenzelm@24110
  1444
just a common case of general context data, which is the preferred way
wenzelm@24110
  1445
for anything more complex than just a list of facts in canonical
wenzelm@24110
  1446
order.
wenzelm@24086
  1447
wenzelm@24032
  1448
* Isar: command 'declaration' augments a local theory by generic
wenzelm@24032
  1449
declaration functions written in ML.  This enables arbitrary content
wenzelm@24032
  1450
being added to the context, depending on a morphism that tells the
wenzelm@24032
  1451
difference of the original declaration context wrt. the application
wenzelm@24032
  1452
context encountered later on.
wenzelm@24032
  1453
wenzelm@24032
  1454
* Isar: proper interfaces for simplification procedures.  Command
wenzelm@24032
  1455
'simproc_setup' declares named simprocs (with match patterns, and body
wenzelm@24032
  1456
text in ML).  Attribute "simproc" adds/deletes simprocs in the current
wenzelm@24032
  1457
context.  ML antiquotation @{simproc name} retrieves named simprocs.
wenzelm@24032
  1458
wenzelm@24032
  1459
* Isar: an extra pair of brackets around attribute declarations
wenzelm@24032
  1460
abbreviates a theorem reference involving an internal dummy fact,
wenzelm@24032
  1461
which will be ignored later --- only the effect of the attribute on
wenzelm@24032
  1462
the background context will persist.  This form of in-place
wenzelm@24032
  1463
declarations is particularly useful with commands like 'declare' and
wenzelm@24032
  1464
'using', for example ``have A using [[simproc a]] by simp''.
wenzelm@24032
  1465
wenzelm@23369
  1466
* Isar: method "assumption" (and implicit closing of subproofs) now
wenzelm@23369
  1467
takes simple non-atomic goal assumptions into account: after applying
wenzelm@23369
  1468
an assumption as a rule the resulting subgoals are solved by atomic
wenzelm@23369
  1469
assumption steps.  This is particularly useful to finish 'obtain'
wenzelm@23369
  1470
goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
wenzelm@23369
  1471
without referring to the original premise "!!x. P x ==> thesis" in the
wenzelm@23369
  1472
Isar proof context.  POTENTIAL INCOMPATIBILITY: method "assumption" is
wenzelm@23369
  1473
more permissive.
wenzelm@23369
  1474
wenzelm@23369
  1475
* Isar: implicit use of prems from the Isar proof context is
wenzelm@23369
  1476
considered a legacy feature.  Common applications like ``have A .''
wenzelm@23369
  1477
may be replaced by ``have A by fact'' or ``note `A`''.  In general,
wenzelm@23369
  1478
referencing facts explicitly here improves readability and
wenzelm@23369
  1479
maintainability of proof texts.
wenzelm@23369
  1480
wenzelm@17865
  1481
* Isar: improper proof element 'guess' is like 'obtain', but derives
wenzelm@17865
  1482
the obtained context from the course of reasoning!  For example:
wenzelm@17865
  1483
wenzelm@17865
  1484
  assume "EX x y. A x & B y"   -- "any previous fact"
wenzelm@17865
  1485
  then guess x and y by clarify
wenzelm@17865
  1486
wenzelm@17865
  1487
This technique is potentially adventurous, depending on the facts and
wenzelm@17865
  1488
proof tools being involved here.
wenzelm@17865
  1489
wenzelm@18020
  1490
* Isar: known facts from the proof context may be specified as literal
wenzelm@18020
  1491
propositions, using ASCII back-quote syntax.  This works wherever
wenzelm@18020
  1492
named facts used to be allowed so far, in proof commands, proof
wenzelm@18020
  1493
methods, attributes etc.  Literal facts are retrieved from the context
wenzelm@18020
  1494
according to unification of type and term parameters.  For example,
wenzelm@18020
  1495
provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
wenzelm@18020
  1496
theorems in the current context, then these are valid literal facts:
wenzelm@18020
  1497
`A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
wenzelm@18020
  1498
wenzelm@18020
  1499
There is also a proof method "fact" which does the same composition
wenzelm@18044
  1500
for explicit goal states, e.g. the following proof texts coincide with
wenzelm@18044
  1501
certain special cases of literal facts:
wenzelm@18020
  1502
wenzelm@18020
  1503
  have "A" by fact                 ==  note `A`
wenzelm@18020
  1504
  have "A ==> B" by fact           ==  note `A ==> B`
wenzelm@18020
  1505
  have "!!x. P x ==> Q x" by fact  ==  note `!!x. P x ==> Q x`
wenzelm@18020
  1506
  have "P a ==> Q a" by fact       ==  note `P a ==> Q a`
wenzelm@18020
  1507
wenzelm@20118
  1508
* Isar: ":" (colon) is no longer a symbolic identifier character in
wenzelm@20118
  1509
outer syntax.  Thus symbolic identifiers may be used without
wenzelm@20118
  1510
additional white space in declarations like this: ``assume *: A''.
wenzelm@20118
  1511
wenzelm@20013
  1512
* Isar: 'print_facts' prints all local facts of the current context,
wenzelm@20013
  1513
both named and unnamed ones.
wenzelm@20013
  1514
wenzelm@18308
  1515
* Isar: 'def' now admits simultaneous definitions, e.g.:
wenzelm@18308
  1516
wenzelm@18308
  1517
  def x == "t" and y == "u"
wenzelm@18308
  1518
wenzelm@18540
  1519
* Isar: added command 'unfolding', which is structurally similar to
wenzelm@18540
  1520
'using', but affects both the goal state and facts by unfolding given
wenzelm@18815
  1521
rewrite rules.  Thus many occurrences of the 'unfold' method or
wenzelm@18540
  1522
'unfolded' attribute may be replaced by first-class proof text.
wenzelm@18540
  1523
wenzelm@18815
  1524
* Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
wenzelm@18815
  1525
and command 'unfolding' now all support object-level equalities
wenzelm@18815
  1526
(potentially conditional).  The underlying notion of rewrite rule is
wenzelm@18815
  1527
analogous to the 'rule_format' attribute, but *not* that of the
wenzelm@18815
  1528
Simplifier (which is usually more generous).
wenzelm@18815
  1529
kleing@24238
  1530
* Isar: the new attribute [rotated n] (default n = 1) rotates the
kleing@24238
  1531
premises of a theorem by n. Useful in conjunction with drule.
kleing@24238
  1532
wenzelm@19220
  1533
* Isar: the goal restriction operator [N] (default N = 1) evaluates a
wenzelm@19220
  1534
method expression within a sandbox consisting of the first N
wenzelm@19240
  1535
sub-goals, which need to exist.  For example, ``simp_all [3]''
wenzelm@19240
  1536
simplifies the first three sub-goals, while (rule foo, simp_all)[]
wenzelm@19240
  1537
simplifies all new goals that emerge from applying rule foo to the
wenzelm@19240
  1538
originally first one.
wenzelm@19220
  1539
wenzelm@19814
  1540
* Isar: schematic goals are no longer restricted to higher-order
wenzelm@19814
  1541
patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
wenzelm@19814
  1542
expected.
wenzelm@19814
  1543
wenzelm@18901
  1544
* Isar: the conclusion of a long theorem statement is now either
wenzelm@18901
  1545
'shows' (a simultaneous conjunction, as before), or 'obtains'
wenzelm@18901
  1546
(essentially a disjunction of cases with local parameters and
wenzelm@18901
  1547
assumptions).  The latter allows to express general elimination rules
wenzelm@18910
  1548
adequately; in this notation common elimination rules look like this:
wenzelm@18901
  1549
wenzelm@18901
  1550
  lemma exE:    -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
wenzelm@18901
  1551
    assumes "EX x. P x"
wenzelm@18901
  1552
    obtains x where "P x"
wenzelm@18901
  1553
wenzelm@18901
  1554
  lemma conjE:  -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
wenzelm@18901
  1555
    assumes "A & B"
wenzelm@18901
  1556
    obtains A and B
wenzelm@18901
  1557
wenzelm@18901
  1558
  lemma disjE:  -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
wenzelm@18901
  1559
    assumes "A | B"
wenzelm@18901
  1560
    obtains
wenzelm@18901
  1561
      A
wenzelm@18901
  1562
    | B
wenzelm@18901
  1563
wenzelm@18910
  1564
The subsequent classical rules even refer to the formal "thesis"
wenzelm@18901
  1565
explicitly:
wenzelm@18901
  1566
wenzelm@18901
  1567
  lemma classical:     -- "(~ thesis ==> thesis) ==> thesis"
wenzelm@18901
  1568
    obtains "~ thesis"
wenzelm@18901
  1569
wenzelm@18910
  1570
  lemma Peirce's_Law:  -- "((thesis ==> something) ==> thesis) ==> thesis"
wenzelm@18910
  1571
    obtains "thesis ==> something"
wenzelm@18901
  1572
wenzelm@18901
  1573
The actual proof of an 'obtains' statement is analogous to that of the
wenzelm@18910
  1574
Isar proof element 'obtain', only that there may be several cases.
wenzelm@18910
  1575
Optional case names may be specified in parentheses; these will be
wenzelm@18910
  1576
available both in the present proof and as annotations in the
wenzelm@18910
  1577
resulting rule, for later use with the 'cases' method (cf. attribute
wenzelm@18910
  1578
case_names).
wenzelm@18901
  1579
wenzelm@21447
  1580
* Isar: the assumptions of a long theorem statement are available as
wenzelm@21447
  1581
"assms" fact in the proof context.  This is more appropriate than the
wenzelm@21447
  1582
(historical) "prems", which refers to all assumptions of the current
wenzelm@21447
  1583
context, including those from the target locale, proof body etc.
wenzelm@21447
  1584
wenzelm@19263
  1585
* Isar: 'print_statement' prints theorems from the current theory or
wenzelm@19263
  1586
proof context in long statement form, according to the syntax of a
wenzelm@19263
  1587
top-level lemma.
wenzelm@19263
  1588
wenzelm@18901
  1589
* Isar: 'obtain' takes an optional case name for the local context
wenzelm@18901
  1590
introduction rule (default "that").
wenzelm@18901
  1591
wenzelm@19587
  1592
* Isar: removed obsolete 'concl is' patterns.  INCOMPATIBILITY, use
wenzelm@19587
  1593
explicit (is "_ ==> ?foo") in the rare cases where this still happens
wenzelm@19587
  1594
to occur.
wenzelm@19587
  1595
wenzelm@19682
  1596
* Pure: syntax "CONST name" produces a fully internalized constant
wenzelm@19682
  1597
according to the current context.  This is particularly useful for
wenzelm@19682
  1598
syntax translations that should refer to internal constant
wenzelm@19682
  1599
representations independently of name spaces.
wenzelm@19682
  1600
wenzelm@21537
  1601
* Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
wenzelm@21537
  1602
instead of "FOO ". This allows multiple binder declarations to coexist
wenzelm@21537
  1603
in the same context.  INCOMPATIBILITY.
wenzelm@21537
  1604
wenzelm@21209
  1605
* Isar/locales: 'notation' provides a robust interface to the 'syntax'
wenzelm@21209
  1606
primitive that also works in a locale context (both for constants and
wenzelm@24950
  1607
fixed variables). Type declaration and internal syntactic representation
wenzelm@24950
  1608
of given constants retrieved from the context. Likewise, the
wenzelm@24950
  1609
'no_notation' command allows to remove given syntax annotations from the
wenzelm@24950
  1610
current context.
wenzelm@19682
  1611
wenzelm@19665
  1612
* Isar/locales: new derived specification elements 'axiomatization',
wenzelm@19665
  1613
'definition', 'abbreviation', which support type-inference, admit
wenzelm@19083
  1614
object-level specifications (equality, equivalence).  See also the
wenzelm@19083
  1615
isar-ref manual.  Examples:
wenzelm@19081
  1616
wenzelm@19665
  1617
  axiomatization
wenzelm@21595
  1618
    eq  (infix "===" 50) where
wenzelm@21595
  1619
    eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
wenzelm@21595
  1620
wenzelm@21595
  1621
  definition "f x y = x + y + 1"
wenzelm@21595
  1622
  definition g where "g x = f x x"
wenzelm@19081
  1623
wenzelm@19363
  1624
  abbreviation
wenzelm@21595
  1625
    neq  (infix "=!=" 50) where
wenzelm@19363
  1626
    "x =!= y == ~ (x === y)"
wenzelm@19081
  1627
wenzelm@19083
  1628
These specifications may be also used in a locale context.  Then the
wenzelm@19083
  1629
constants being introduced depend on certain fixed parameters, and the
wenzelm@19083
  1630
constant name is qualified by the locale base name.  An internal
wenzelm@19083
  1631
abbreviation takes care for convenient input and output, making the
wenzelm@19088
  1632
parameters implicit and using the original short name.  See also
wenzelm@25177
  1633
src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
wenzelm@19083
  1634
entities from a monomorphic theory.
wenzelm@19083
  1635
wenzelm@19083
  1636
Presently, abbreviations are only available 'in' a target locale, but
wenzelm@19363
  1637
not inherited by general import expressions.  Also note that
wenzelm@19363
  1638
'abbreviation' may be used as a type-safe replacement for 'syntax' +
wenzelm@24735
  1639
'translations' in common applications.  The "no_abbrevs" print mode
wenzelm@24735
  1640
prevents folding of abbreviations in term output.
wenzelm@19084
  1641
wenzelm@19682
  1642
Concrete syntax is attached to specified constants in internal form,
wenzelm@19682
  1643
independently of name spaces.  The parse tree representation is
wenzelm@21209
  1644
slightly different -- use 'notation' instead of raw 'syntax', and
wenzelm@19682
  1645
'translations' with explicit "CONST" markup to accommodate this.
wenzelm@19665
  1646
wenzelm@24800
  1647
* Pure/Isar: unified syntax for new-style specification mechanisms
wenzelm@24800
  1648
(e.g.  'definition', 'abbreviation', or 'inductive' in HOL) admits
wenzelm@24800
  1649
full type inference and dummy patterns ("_").  For example:
wenzelm@24735
  1650
wenzelm@24735
  1651
  definition "K x _ = x"
wenzelm@24735
  1652
wenzelm@24738
  1653
  inductive conj for A B
wenzelm@24738
  1654
  where "A ==> B ==> conj A B"
wenzelm@24738
  1655
wenzelm@21735
  1656
* Pure: command 'print_abbrevs' prints all constant abbreviations of
wenzelm@21735
  1657
the current context.  Print mode "no_abbrevs" prevents inversion of
wenzelm@21735
  1658
abbreviations on output.
wenzelm@21735
  1659
wenzelm@24800
  1660
* Isar/locales: improved parameter handling: use of locales "var" and
wenzelm@24800
  1661
"struct" no longer necessary; - parameter renamings are no longer
wenzelm@24800
  1662
required to be injective.  For example, this allows to define
wenzelm@24800
  1663
endomorphisms as locale endom = homom mult mult h.
ballarin@19783
  1664
ballarin@19931
  1665
* Isar/locales: changed the way locales with predicates are defined.
ballarin@19931
  1666
Instead of accumulating the specification, the imported expression is
wenzelm@22126
  1667
now an interpretation.  INCOMPATIBILITY: different normal form of
wenzelm@22126
  1668
locale expressions.  In particular, in interpretations of locales with
wenzelm@22126
  1669
predicates, goals repesenting already interpreted fragments are not
wenzelm@22126
  1670
removed automatically.  Use methods `intro_locales' and
wenzelm@22126
  1671
`unfold_locales'; see below.
wenzelm@22126
  1672
wenzelm@22126
  1673
* Isar/locales: new methods `intro_locales' and `unfold_locales'
wenzelm@22126
  1674
provide backward reasoning on locales predicates.  The methods are
wenzelm@22126
  1675
aware of interpretations and discharge corresponding goals.
wenzelm@22126
  1676
`intro_locales' is less aggressive then `unfold_locales' and does not
wenzelm@22126
  1677
unfold predicates to assumptions.
ballarin@19931
  1678
ballarin@19931
  1679
* Isar/locales: the order in which locale fragments are accumulated
wenzelm@22126
  1680
has changed.  This enables to override declarations from fragments due
wenzelm@22126
  1681
to interpretations -- for example, unwanted simp rules.
ballarin@19931
  1682
ballarin@23920
  1683
* Isar/locales: interpretation in theories and proof contexts has been
ballarin@23920
  1684
extended.  One may now specify (and prove) equations, which are
ballarin@23920
  1685
unfolded in interpreted theorems.  This is useful for replacing
ballarin@23920
  1686
defined concepts (constants depending on locale parameters) by
ballarin@23920
  1687
concepts already existing in the target context.  Example:
ballarin@23920
  1688
ballarin@23920
  1689
  interpretation partial_order ["op <= :: [int, int] => bool"]
ballarin@23920
  1690
    where "partial_order.less (op <=) (x::int) y = (x < y)"
ballarin@23920
  1691
wenzelm@24800
  1692
Typically, the constant `partial_order.less' is created by a
wenzelm@24800
  1693
definition specification element in the context of locale
wenzelm@24800
  1694
partial_order.
wenzelm@24800
  1695
wenzelm@24859
  1696
* Method "induct": improved internal context management to support
wenzelm@24800
  1697
local fixes and defines on-the-fly. Thus explicit meta-level
wenzelm@24800
  1698
connectives !!  and ==> are rarely required anymore in inductive goals
wenzelm@24800
  1699
(using object-logic connectives for this purpose has been long
wenzelm@24800
  1700
obsolete anyway). Common proof patterns are explained in
wenzelm@25177
  1701
src/HOL/Induct/Common_Patterns.thy, see also
wenzelm@25177
  1702
src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
wenzelm@25177
  1703
examples.
wenzelm@24606
  1704
wenzelm@24859
  1705
* Method "induct": improved handling of simultaneous goals. Instead of
wenzelm@24606
  1706
introducing object-level conjunction, the statement is now split into
wenzelm@24606
  1707
several conclusions, while the corresponding symbolic cases are nested
wenzelm@24606
  1708
accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
wenzelm@25177
  1709
see src/HOL/Induct/Common_Patterns.thy, for example.
wenzelm@24606
  1710
wenzelm@24859
  1711
* Method "induct": mutual induction rules are now specified as a list
wenzelm@24800
  1712
of rule sharing the same induction cases. HOL packages usually provide
wenzelm@24606
  1713
foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
wenzelm@24859
  1714
predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
wenzelm@24859
  1715
mutual induction rules differently, i.e. like this:
wenzelm@18506
  1716
wenzelm@18506
  1717
  (induct rule: foo_bar.inducts)
wenzelm@18506
  1718
  (induct set: foo bar)
wenzelm@24859
  1719
  (induct pred: foo bar)
wenzelm@18506
  1720
  (induct type: foo bar)
wenzelm@18506
  1721
wenzelm@18506
  1722
The ML function ProjectRule.projections turns old-style rules into the
wenzelm@18506
  1723
new format.
wenzelm@18506
  1724
wenzelm@24859
  1725
* Method "coinduct": dual of induction, see
wenzelm@18399
  1726
src/HOL/Library/Coinductive_List.thy for various examples.
wenzelm@18399
  1727
wenzelm@24859
  1728
* Method "cases", "induct", "coinduct": the ``(open)'' option is
wenzelm@24859
  1729
considered a legacy feature.
wenzelm@24859
  1730
wenzelm@20919
  1731
* Attribute "symmetric" produces result with standardized schematic
wenzelm@20919
  1732
variables (index 0).  Potential INCOMPATIBILITY.
wenzelm@20919
  1733
wenzelm@22126
  1734
* Simplifier: by default the simplifier trace only shows top level
wenzelm@22126
  1735
rewrites now. That is, trace_simp_depth_limit is set to 1 by
wenzelm@22126
  1736
default. Thus there is less danger of being flooded by the trace. The
wenzelm@22126
  1737
trace indicates where parts have been suppressed.
nipkow@18674
  1738
  
wenzelm@18536
  1739
* Provers/classical: removed obsolete classical version of elim_format
wenzelm@18536
  1740
attribute; classical elim/dest rules are now treated uniformly when
wenzelm@18536
  1741
manipulating the claset.
wenzelm@18536
  1742
wenzelm@18694
  1743
* Provers/classical: stricter checks to ensure that supplied intro,
wenzelm@18694
  1744
dest and elim rules are well-formed; dest and elim rules must have at
wenzelm@18694
  1745
least one premise.
wenzelm@18694
  1746
wenzelm@18694
  1747
* Provers/classical: attributes dest/elim/intro take an optional
wenzelm@18695
  1748
weight argument for the rule (just as the Pure versions).  Weights are
wenzelm@18696
  1749
ignored by automated tools, but determine the search order of single
wenzelm@18694
  1750
rule steps.
paulson@18557
  1751
wenzelm@18536
  1752
* Syntax: input syntax now supports dummy variable binding "%_. b",
wenzelm@18536
  1753
where the body does not mention the bound variable.  Note that dummy
wenzelm@18536
  1754
patterns implicitly depend on their context of bounds, which makes
wenzelm@18536
  1755
"{_. _}" match any set comprehension as expected.  Potential
wenzelm@18536
  1756
INCOMPATIBILITY -- parse translations need to cope with syntactic
wenzelm@18536
  1757
constant "_idtdummy" in the binding position.
wenzelm@18536
  1758
wenzelm@18536
  1759
* Syntax: removed obsolete syntactic constant "_K" and its associated
wenzelm@18536
  1760
parse translation.  INCOMPATIBILITY -- use dummy abstraction instead,
wenzelm@18536
  1761
for example "A -> B" => "Pi A (%_. B)".
wenzelm@17779
  1762
wenzelm@20582
  1763
* Pure: 'class_deps' command visualizes the subclass relation, using
wenzelm@20582
  1764
the graph browser tool.
wenzelm@20582
  1765
wenzelm@24800
  1766
* Pure: 'print_theory' now suppresses certain internal declarations by
wenzelm@24800
  1767
default; use '!' option for full details.
wenzelm@20620
  1768
wenzelm@17865
  1769
nipkow@17806
  1770
*** HOL ***
nipkow@17806
  1771
wenzelm@25129
  1772
* Method "metis" proves goals by applying the Metis general-purpose
wenzelm@25129
  1773
resolution prover (see also http://gilith.com/software/metis/).
wenzelm@25129
  1774
Examples are in the directory MetisExamples.  WARNING: the
wenzelm@25129
  1775
Isabelle/HOL-Metis integration does not yet work properly with
wenzelm@25129
  1776
multi-threading.
wenzelm@25129
  1777
  
wenzelm@25129
  1778
* Command 'sledgehammer' invokes external automatic theorem provers as
wenzelm@25129
  1779
background processes.  It generates calls to the "metis" method if
wenzelm@25129
  1780
successful. These can be pasted into the proof.  Users do not have to
wenzelm@25129
  1781
wait for the automatic provers to return.  WARNING: does not really
wenzelm@25129
  1782
work with multi-threading.
wenzelm@25129
  1783
wenzelm@24804
  1784
* New "auto_quickcheck" feature tests outermost goal statements for
wenzelm@24804
  1785
potential counter-examples.  Controlled by ML references
wenzelm@24804
  1786
auto_quickcheck (default true) and auto_quickcheck_time_limit (default
wenzelm@25129
  1787
5000 milliseconds).  Fails silently if statements is outside of
wenzelm@25129
  1788
executable fragment, or any other codgenerator problem occurs.
wenzelm@24804
  1789
haftmann@25184
  1790
* New constant "undefined" with axiom "undefined x = undefined".
haftmann@25184
  1791
haftmann@25184
  1792
* Added class "HOL.eq", allowing for code generation with polymorphic
haftmann@25184
  1793
equality.
haftmann@25184
  1794
haftmann@25184
  1795
* Some renaming of class constants due to canonical name prefixing in
haftmann@25184
  1796
the new 'class' package:
haftmann@25184
  1797
haftmann@25184
  1798
    HOL.abs ~> HOL.abs_class.abs
haftmann@25184
  1799
    HOL.divide ~> HOL.divide_class.divide
haftmann@25184
  1800
    0 ~> HOL.zero_class.zero
haftmann@25184
  1801
    1 ~> HOL.one_class.one
haftmann@25184
  1802
    op + ~> HOL.plus_class.plus
haftmann@25184
  1803
    op - ~> HOL.minus_class.minus
haftmann@25184
  1804
    uminus ~> HOL.minus_class.uminus
haftmann@25184
  1805
    op * ~> HOL.times_class.times
haftmann@25184
  1806
    op < ~> HOL.ord_class.less
haftmann@25184
  1807
    op <= > HOL.ord_class.less_eq
haftmann@25184
  1808
    Nat.power ~> Power.power_class.power
haftmann@25184
  1809
    Nat.size ~> Nat.size_class.size
haftmann@25184
  1810
    Numeral.number_of ~> Numeral.number_class.number_of
haftmann@25184
  1811
    FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
haftmann@25184
  1812
    FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
haftmann@25184
  1813
    Orderings.min ~> Orderings.ord_class.min
haftmann@25184
  1814
    Orderings.max ~> Orderings.ord_class.max
haftmann@25184
  1815
    Divides.op div ~> Divides.div_class.div
haftmann@25184
  1816
    Divides.op mod ~> Divides.div_class.mod
haftmann@25184
  1817
    Divides.op dvd ~> Divides.div_class.dvd
haftmann@25184
  1818
haftmann@25184
  1819
INCOMPATIBILITY.  Adaptions may be required in the following cases:
haftmann@25184
  1820
haftmann@25184
  1821
a) User-defined constants using any of the names "plus", "minus",
haftmann@25184
  1822
"times", "less" or "less_eq". The standard syntax translations for
haftmann@25184
  1823
"+", "-" and "*" may go wrong.  INCOMPATIBILITY: use more specific
haftmann@25184
  1824
names.
haftmann@25184
  1825
haftmann@25184
  1826
b) Variables named "plus", "minus", "times", "less", "less_eq"
haftmann@25184
  1827
INCOMPATIBILITY: use more specific names.
haftmann@25184
  1828
haftmann@25184
  1829
c) Permutative equations (e.g. "a + b = b + a")
haftmann@25184
  1830
Since the change of names also changes the order of terms, permutative
haftmann@25184
  1831
rewrite rules may get applied in a different order. Experience shows
haftmann@25184
  1832
that this is rarely the case (only two adaptions in the whole Isabelle
haftmann@25184
  1833
distribution).  INCOMPATIBILITY: rewrite proofs
haftmann@25184
  1834
haftmann@25184
  1835
d) ML code directly refering to constant names
haftmann@25184
  1836
This in general only affects hand-written proof tactics, simprocs and
haftmann@25184
  1837
so on.  INCOMPATIBILITY: grep your sourcecode and replace names.
haftmann@25184
  1838
Consider using @{const_name} antiquotation.
haftmann@25184
  1839
haftmann@25184
  1840
* New class "default" with associated constant "default".
haftmann@25184
  1841
haftmann@25184
  1842
* Function "sgn" is now overloaded and available on int, real, complex
haftmann@25184
  1843
(and other numeric types), using class "sgn".  Two possible defs of
haftmann@25184
  1844
sgn are given as equational assumptions in the classes sgn_if and
haftmann@25184
  1845
sgn_div_norm; ordered_idom now also inherits from sgn_if.
haftmann@25184
  1846
INCOMPATIBILITY.
haftmann@25184
  1847
haftmann@25184
  1848
* Locale "partial_order" now unified with class "order" (cf. theory
haftmann@25184
  1849
Orderings), added parameter "less".  INCOMPATIBILITY.
haftmann@25184
  1850
haftmann@25184
  1851
* Renamings in classes "order" and "linorder": facts "refl", "trans" and
haftmann@25184
  1852
"cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
haftmann@25184
  1853
clashes with HOL "refl" and "trans".  INCOMPATIBILITY.
haftmann@25184
  1854
haftmann@25184
  1855
* Classes "order" and "linorder": potential INCOMPATIBILITY due to
haftmann@25184
  1856
changed order of proof goals in instance proofs.
haftmann@25184
  1857
haftmann@25184
  1858
* The transitivity reasoner for partial and linear orders is set up
haftmann@25184
  1859
for classes "order" and "linorder".  Instances of the reasoner are available
haftmann@25184
  1860
in all contexts importing or interpreting the corresponding locales.
haftmann@25184
  1861
Method "order" invokes the reasoner separately; the reasoner
haftmann@25184
  1862
is also integrated with the Simplifier as a solver.  Diagnostic
haftmann@25184
  1863
command 'print_orders' shows the available instances of the reasoner
haftmann@25184
  1864
in the current context.
haftmann@25184
  1865
haftmann@25184
  1866
* Localized monotonicity predicate in theory "Orderings"; integrated
haftmann@25184
  1867
lemmas max_of_mono and min_of_mono with this predicate.
haftmann@25184
  1868
INCOMPATIBILITY.
haftmann@25184
  1869
haftmann@25184
  1870
* Formulation of theorem "dense" changed slightly due to integration
haftmann@25184
  1871
with new class dense_linear_order.
haftmann@25184
  1872
haftmann@25184
  1873
* Uniform lattice theory development in HOL.
haftmann@25184
  1874
haftmann@25184
  1875
    constants "meet" and "join" now named "inf" and "sup"
haftmann@25184
  1876
    constant "Meet" now named "Inf"
haftmann@25184
  1877
haftmann@25184
  1878
    classes "meet_semilorder" and "join_semilorder" now named
haftmann@25184
  1879
      "lower_semilattice" and "upper_semilattice"
haftmann@25184
  1880
    class "lorder" now named "lattice"
haftmann@25184
  1881
    class "comp_lat" now named "complete_lattice"
haftmann@25184
  1882
haftmann@25184
  1883
    Instantiation of lattice classes allows explicit definitions
haftmann@25184
  1884
    for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
haftmann@25184
  1885
haftmann@25184
  1886
  INCOMPATIBILITY.  Theorem renames:
haftmann@25184
  1887
haftmann@25184
  1888
    meet_left_le            ~> inf_le1
haftmann@25184
  1889
    meet_right_le           ~> inf_le2
haftmann@25184
  1890
    join_left_le            ~> sup_ge1
haftmann@25184
  1891
    join_right_le           ~> sup_ge2
haftmann@25184
  1892
    meet_join_le            ~> inf_sup_ord
haftmann@25184
  1893
    le_meetI                ~> le_infI
haftmann@25184
  1894
    join_leI                ~> le_supI
haftmann@25184
  1895
    le_meet                 ~> le_inf_iff
haftmann@25184
  1896
    le_join                 ~> ge_sup_conv
haftmann@25184
  1897
    meet_idempotent         ~> inf_idem
haftmann@25184
  1898
    join_idempotent         ~> sup_idem
haftmann@25184
  1899
    meet_comm               ~> inf_commute
haftmann@25184
  1900
    join_comm               ~> sup_commute
haftmann@25184
  1901
    meet_leI1               ~> le_infI1
haftmann@25184
  1902
    meet_leI2               ~> le_infI2
haftmann@25184
  1903
    le_joinI1               ~> le_supI1
haftmann@25184
  1904
    le_joinI2               ~> le_supI2
haftmann@25184
  1905
    meet_assoc              ~> inf_assoc
haftmann@25184
  1906
    join_assoc              ~> sup_assoc
haftmann@25184
  1907
    meet_left_comm          ~> inf_left_commute
haftmann@25184
  1908
    meet_left_idempotent    ~> inf_left_idem
haftmann@25184
  1909
    join_left_comm          ~> sup_left_commute
haftmann@25184
  1910
    join_left_idempotent    ~> sup_left_idem
haftmann@25184
  1911
    meet_aci                ~> inf_aci
haftmann@25184
  1912
    join_aci                ~> sup_aci
haftmann@25184
  1913
    le_def_meet             ~> le_iff_inf
haftmann@25184
  1914
    le_def_join             ~> le_iff_sup
haftmann@25184
  1915
    join_absorp2            ~> sup_absorb2
haftmann@25184
  1916
    join_absorp1            ~> sup_absorb1
haftmann@25184
  1917
    meet_absorp1            ~> inf_absorb1
haftmann@25184
  1918
    meet_absorp2            ~> inf_absorb2
haftmann@25184
  1919
    meet_join_absorp        ~> inf_sup_absorb
haftmann@25184
  1920
    join_meet_absorp        ~> sup_inf_absorb
haftmann@25184
  1921
    distrib_join_le         ~> distrib_sup_le
haftmann@25184
  1922
    distrib_meet_le         ~> distrib_inf_le
haftmann@25184
  1923
haftmann@25184
  1924
    add_meet_distrib_left   ~> add_inf_distrib_left
haftmann@25184
  1925
    add_join_distrib_left   ~> add_sup_distrib_left
haftmann@25184
  1926
    is_join_neg_meet        ~> is_join_neg_inf
haftmann@25184
  1927
    is_meet_neg_join        ~> is_meet_neg_sup
haftmann@25184
  1928
    add_meet_distrib_right  ~> add_inf_distrib_right
haftmann@25184
  1929
    add_join_distrib_right  ~> add_sup_distrib_right
haftmann@25184
  1930
    add_meet_join_distribs  ~> add_sup_inf_distribs
haftmann@25184
  1931
    join_eq_neg_meet        ~> sup_eq_neg_inf
haftmann@25184
  1932
    meet_eq_neg_join        ~> inf_eq_neg_sup
haftmann@25184
  1933
    add_eq_meet_join        ~> add_eq_inf_sup
haftmann@25184
  1934
    meet_0_imp_0            ~> inf_0_imp_0
haftmann@25184
  1935
    join_0_imp_0            ~> sup_0_imp_0
haftmann@25184
  1936
    meet_0_eq_0             ~> inf_0_eq_0
haftmann@25184
  1937
    join_0_eq_0             ~> sup_0_eq_0
haftmann@25184
  1938
    neg_meet_eq_join        ~> neg_inf_eq_sup
haftmann@25184
  1939
    neg_join_eq_meet        ~> neg_sup_eq_inf
haftmann@25184
  1940
    join_eq_if              ~> sup_eq_if
haftmann@25184
  1941
haftmann@25184
  1942
    mono_meet               ~> mono_inf
haftmann@25184
  1943
    mono_join               ~> mono_sup
haftmann@25184
  1944
    meet_bool_eq            ~> inf_bool_eq
haftmann@25184
  1945
    join_bool_eq            ~> sup_bool_eq
haftmann@25184
  1946
    meet_fun_eq             ~> inf_fun_eq
haftmann@25184
  1947
    join_fun_eq             ~> sup_fun_eq
haftmann@25184
  1948
    meet_set_eq             ~> inf_set_eq
haftmann@25184
  1949
    join_set_eq             ~> sup_set_eq
haftmann@25184
  1950
    meet1_iff               ~> inf1_iff
haftmann@25184
  1951
    meet2_iff               ~> inf2_iff
haftmann@25184
  1952
    meet1I                  ~> inf1I
haftmann@25184
  1953
    meet2I                  ~> inf2I
haftmann@25184
  1954
    meet1D1                 ~> inf1D1
haftmann@25184
  1955
    meet2D1                 ~> inf2D1
haftmann@25184
  1956
    meet1D2                 ~> inf1D2
haftmann@25184
  1957
    meet2D2                 ~> inf2D2
haftmann@25184
  1958
    meet1E                  ~> inf1E
haftmann@25184
  1959
    meet2E                  ~> inf2E
haftmann@25184
  1960
    join1_iff               ~> sup1_iff
haftmann@25184
  1961
    join2_iff               ~> sup2_iff
haftmann@25184
  1962
    join1I1                 ~> sup1I1
haftmann@25184
  1963
    join2I1                 ~> sup2I1
haftmann@25184
  1964
    join1I1                 ~> sup1I1
haftmann@25184
  1965
    join2I2                 ~> sup1I2
haftmann@25184
  1966
    join1CI                 ~> sup1CI
haftmann@25184
  1967
    join2CI                 ~> sup2CI
haftmann@25184
  1968
    join1E                  ~> sup1E
haftmann@25184
  1969
    join2E                  ~> sup2E
haftmann@25184
  1970
haftmann@25184
  1971
    is_meet_Meet            ~> is_meet_Inf
haftmann@25184
  1972
    Meet_bool_def           ~> Inf_bool_def
haftmann@25184
  1973
    Meet_fun_def            ~> Inf_fun_def
haftmann@25184
  1974
    Meet_greatest           ~> Inf_greatest
haftmann@25184
  1975
    Meet_lower              ~> Inf_lower
haftmann@25184
  1976
    Meet_set_def            ~> Inf_set_def
haftmann@25184
  1977
haftmann@25184
  1978
    Sup_def                 ~> Sup_Inf
haftmann@25184
  1979
    Sup_bool_eq             ~> Sup_bool_def
haftmann@25184
  1980
    Sup_fun_eq              ~> Sup_fun_def
haftmann@25184
  1981
    Sup_set_eq              ~> Sup_set_def
haftmann@25184
  1982
haftmann@25184
  1983
    listsp_meetI            ~> listsp_infI
haftmann@25184
  1984
    listsp_meet_eq          ~> listsp_inf_eq
haftmann@25184
  1985
haftmann@25184
  1986
    meet_min                ~> inf_min
haftmann@25184
  1987
    join_max                ~> sup_max
haftmann@25184
  1988
haftmann@25184
  1989
* Added syntactic class "size"; overloaded constant "size" now has
haftmann@25184
  1990
type "'a::size ==> bool"
haftmann@25184
  1991
wenzelm@24800
  1992
* Internal reorganisation of `size' of datatypes: size theorems
wenzelm@24800
  1993
"foo.size" are no longer subsumed by "foo.simps" (but are still
wenzelm@24800
  1994
simplification rules by default!); theorems "prod.size" now named
haftmann@25184
  1995
"*.size".
haftmann@25184
  1996
haftmann@25184
  1997
* Class "div" now inherits from class "times" rather than "type".
haftmann@25184
  1998
INCOMPATIBILITY.
wenzelm@24800
  1999
wenzelm@24800
  2000
* HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
wenzelm@24800
  2001
Linorder etc.  have disappeared; operations defined in terms of
wenzelm@24800
  2002
fold_set now are named Inf_fin, Sup_fin.  INCOMPATIBILITY.
wenzelm@24800
  2003
wenzelm@25129
  2004
* HOL/Nat: neq0_conv no longer declared as iff.  INCOMPATIBILITY.
wenzelm@25129
  2005
wenzelm@24800
  2006
* HOL-Word: New extensive library and type for generic, fixed size
wenzelm@24800
  2007
machine words, with arithemtic, bit-wise, shifting and rotating
wenzelm@24800
  2008
operations, reflection into int, nat, and bool lists, automation for
wenzelm@24800
  2009
linear arithmetic (by automatic reflection into nat or int), including
wenzelm@24800
  2010
lemmas on overflow and monotonicity.  Instantiated to all appropriate
wenzelm@24800
  2011
arithmetic type classes, supporting automatic simplification of
wenzelm@24800
  2012
numerals on all operations.
kleing@24333
  2013
kleing@24333
  2014
* Library/Boolean_Algebra: locales for abstract boolean algebras.
kleing@24333
  2015
kleing@24333
  2016
* Library/Numeral_Type: numbers as types, e.g. TYPE(32).
kleing@24333
  2017
haftmann@23850
  2018
* Code generator library theories:
haftmann@24993
  2019
  - Code_Integer represents HOL integers by big integer literals in target
haftmann@23850
  2020
    languages.
haftmann@24993
  2021
  - Code_Char represents HOL characters by character literals in target
haftmann@23850
  2022
    languages.
haftmann@24993
  2023
  - Code_Char_chr like Code_Char, but also offers treatment of character
haftmann@24993
  2024
    codes; includes Code_Integer.
wenzelm@24800
  2025
  - Executable_Set allows to generate code for finite sets using lists.
wenzelm@24800
  2026
  - Executable_Rat implements rational numbers as triples (sign, enumerator,
haftmann@23850
  2027
    denominator).
wenzelm@24800
  2028
  - Executable_Real implements a subset of real numbers, namly those
haftmann@23850
  2029
    representable by rational numbers.
wenzelm@24800
  2030
  - Efficient_Nat implements natural numbers by integers, which in general will
haftmann@23850
  2031
    result in higher efficency; pattern matching with 0/Suc is eliminated;
haftmann@24993
  2032
    includes Code_Integer.
haftmann@24993
  2033
  - Code_Index provides an additional datatype index which is mapped to
haftmann@24993
  2034
    target-language built-in integers.
haftmann@26355
  2035
  - Code_Message provides an additional datatype message_string which is isomorphic to
haftmann@24993
  2036
    strings; messages are mapped to target-language strings.
haftmann@23850
  2037
berghofe@23783
  2038
* New package for inductive predicates
berghofe@23783
  2039
berghofe@23783
  2040
  An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
berghofe@23783
  2041
berghofe@23783
  2042
    inductive
berghofe@23783
  2043
      p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
berghofe@23783
  2044
      for z_1 :: U_1 and ... and z_n :: U_m
berghofe@23783
  2045
    where
berghofe@23783
  2046
      rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
berghofe@23783
  2047
    | ...
berghofe@23783
  2048
wenzelm@24800
  2049
  with full support for type-inference, rather than
berghofe@23783
  2050
berghofe@23783
  2051
    consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
berghofe@23783
  2052
berghofe@23783
  2053
    abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
berghofe@23783
  2054
    where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
berghofe@23783
  2055
berghofe@23783
  2056
    inductive "s z_1 ... z_m"
berghofe@23783
  2057
    intros
berghofe@23783
  2058
      rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
berghofe@23783
  2059
      ...
berghofe@23783
  2060
berghofe@23783
  2061
  For backward compatibility, there is a wrapper allowing inductive
berghofe@23783
  2062
  sets to be defined with the new package via
berghofe@23783
  2063
berghofe@23783
  2064
    inductive_set
berghofe@23783
  2065
      s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
berghofe@23783
  2066
      for z_1 :: U_1 and ... and z_n :: U_m
berghofe@23783
  2067
    where
berghofe@23783
  2068
      rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
berghofe@23783
  2069
    | ...
berghofe@23783
  2070
berghofe@23783
  2071
  or
berghofe@23783
  2072
berghofe@23783
  2073
    inductive_set
berghofe@23783
  2074
      s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
berghofe@23783
  2075
      and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
berghofe@23783
  2076
      for z_1 :: U_1 and ... and z_n :: U_m
berghofe@23783
  2077
    where
berghofe@23783
  2078
      "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
berghofe@23783
  2079
    | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
berghofe@23783
  2080
    | ...
berghofe@23783
  2081
berghofe@23783
  2082
  if the additional syntax "p ..." is required.
berghofe@23783
  2083
wenzelm@25177
  2084
  Numerous examples can be found in the subdirectories src/HOL/Auth,
wenzelm@25177
  2085
  src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
berghofe@23783
  2086
berghofe@23783
  2087
  INCOMPATIBILITIES:
berghofe@23783
  2088
berghofe@23783
  2089
  - Since declaration and definition of inductive sets or predicates
wenzelm@24800
  2090
    is no longer separated, abbreviations involving the newly
wenzelm@24800
  2091
    introduced sets or predicates must be specified together with the
wenzelm@24800
  2092
    introduction rules after the 'where' keyword (see above), rather
wenzelm@24800
  2093
    than before the actual inductive definition.
wenzelm@24800
  2094
wenzelm@24800
  2095
  - The variables in induction and elimination rules are now
wenzelm@24800
  2096
    quantified in the order of their occurrence in the introduction
wenzelm@24800
  2097
    rules, rather than in alphabetical order. Since this may break
wenzelm@24800
  2098
    some proofs, these proofs either have to be repaired, e.g. by
wenzelm@24800
  2099
    reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
wenzelm@24800
  2100
    statements of the form
berghofe@23783
  2101
berghofe@23783
  2102
      case (rule_i a_i_1 ... a_i_{k_i})
berghofe@23783
  2103
berghofe@23783
  2104
    or the old order of quantification has to be restored by explicitly adding
berghofe@23783
  2105
    meta-level quantifiers in the introduction rules, i.e.
berghofe@23783
  2106
berghofe@23783
  2107
      | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
berghofe@23783
  2108
berghofe@23783
  2109
  - The format of the elimination rules is now
berghofe@23783
  2110
berghofe@23783
  2111
      p z_1 ... z_m x_1 ... x_n ==>
berghofe@23783
  2112
        (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
berghofe@23783
  2113
        ==> ... ==> P
berghofe@23783
  2114
berghofe@23783
  2115
    for predicates and
berghofe@23783
  2116
berghofe@23783
  2117
      (x_1, ..., x_n) : s z_1 ... z_m ==>
berghofe@23783
  2118
        (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
berghofe@23783
  2119
        ==> ... ==> P
berghofe@23783
  2120
berghofe@23783
  2121
    for sets rather than
berghofe@23783
  2122
berghofe@23783
  2123
      x : s z_1 ... z_m ==>
berghofe@23783
  2124
        (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
berghofe@23783
  2125
        ==> ... ==> P
berghofe@23783
  2126
wenzelm@24800
  2127
    This may require terms in goals to be expanded to n-tuples
wenzelm@24800
  2128
    (e.g. using case_tac or simplification with the split_paired_all
wenzelm@24800
  2129
    rule) before the above elimination rule is applicable.
wenzelm@24800
  2130
wenzelm@24800
  2131
  - The elimination or case analysis rules for (mutually) inductive
wenzelm@24800
  2132
    sets or predicates are now called "p_1.cases" ... "p_k.cases". The
wenzelm@24800
  2133
    list of rules "p_1_..._p_k.elims" is no longer available.
berghofe@23783
  2134
krauss@25198
  2135
* New package "function"/"fun" for general recursive functions,
krauss@25198
  2136
supporting mutual and nested recursion, definitions in local contexts,
krauss@25198
  2137
more general pattern matching and partiality. See HOL/ex/Fundefs.thy
krauss@25198
  2138
for small examples, and the separate tutorial on the function
krauss@25198
  2139
package. The old recdef "package" is still available as before, but
krauss@25198
  2140
users are encouraged to use the new package.
krauss@25198
  2141
krauss@25198
  2142
* Method "lexicographic_order" automatically synthesizes termination
krauss@25198
  2143
relations as lexicographic combinations of size measures. 
krauss@25198
  2144
wenzelm@24800
  2145
* Case-expressions allow arbitrary constructor-patterns (including
wenzelm@24800
  2146
"_") and take their order into account, like in functional
wenzelm@24800
  2147
programming.  Internally, this is translated into nested
wenzelm@24800
  2148
case-expressions; missing cases are added and mapped to the predefined
wenzelm@24800
  2149
constant "undefined". In complicated cases printing may no longer show
wenzelm@24800
  2150
the original input but the internal form. Lambda-abstractions allow
wenzelm@24800
  2151
the same form of pattern matching: "% pat1 => e1 | ..." is an
wenzelm@24800
  2152
abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
wenzelm@24800
  2153
variable.
nipkow@23564
  2154
huffman@23468
  2155
* IntDef: The constant "int :: nat => int" has been removed; now "int"
wenzelm@24800
  2156
is an abbreviation for "of_nat :: nat => int". The simplification
wenzelm@24800
  2157
rules for "of_nat" have been changed to work like "int" did
wenzelm@24800
  2158
previously.  Potential INCOMPATIBILITY:
huffman@23468
  2159
  - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
huffman@23468
  2160
  - of_nat_diff and of_nat_mult are no longer default simp rules
huffman@23377
  2161
chaieb@23295
  2162
* Method "algebra" solves polynomial equations over (semi)rings using
wenzelm@24800
  2163
Groebner bases. The (semi)ring structure is defined by locales and the
wenzelm@24800
  2164
tool setup depends on that generic context. Installing the method for
wenzelm@24800
  2165
a specific type involves instantiating the locale and possibly adding
wenzelm@24800
  2166
declarations for computation on the coefficients.  The method is
wenzelm@24800
  2167
already instantiated for natural numbers and for the axiomatic class
wenzelm@24800
  2168
of idoms with numerals.  See also the paper by Chaieb and Wenzel at
wenzelm@24800
  2169
CALCULEMUS 2007 for the general principles underlying this
wenzelm@24800
  2170
architecture of context-aware proof-tools.
wenzelm@24800
  2171
wenzelm@25033
  2172
* Method "ferrack" implements quantifier elimination over
wenzelm@25033
  2173
special-purpose dense linear orders using locales (analogous to
wenzelm@25033
  2174
"algebra"). The method is already installed for class
wenzelm@25033
  2175
{ordered_field,recpower,number_ring} which subsumes real, hyperreal,
wenzelm@25033
  2176
rat, etc.
wenzelm@25033
  2177
wenzelm@24800
  2178
* Former constant "List.op @" now named "List.append".  Use ML
wenzelm@24800
  2179
antiquotations @{const_name List.append} or @{term " ... @ ... "} to
wenzelm@24800
  2180
circumvent possible incompatibilities when working on ML level.
wenzelm@24800
  2181
haftmann@24996
  2182
* primrec: missing cases mapped to "undefined" instead of "arbitrary".
haftmann@22845
  2183
wenzelm@24800
  2184
* New function listsum :: 'a list => 'a for arbitrary monoids.
wenzelm@24800
  2185
Special syntax: "SUM x <- xs. f x" (and latex variants)
wenzelm@24800
  2186
wenzelm@24800
  2187
* New syntax for Haskell-like list comprehension (input only), eg.
wenzelm@25177
  2188
[(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
wenzelm@24800
  2189
wenzelm@24800
  2190
* The special syntax for function "filter" has changed from [x :
wenzelm@24800
  2191
xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
wenzelm@24800
  2192
comprehension syntax, and for uniformity.  INCOMPATIBILITY.
wenzelm@24800
  2193
wenzelm@24800
  2194
* [a..b] is now defined for arbitrary linear orders.  It used to be
wenzelm@24800
  2195
defined on nat only, as an abbreviation for [a..<Suc b]
wenzelm@24800
  2196
INCOMPATIBILITY.
wenzelm@24800
  2197
wenzelm@24800
  2198
* Renamed lemma "set_take_whileD"  to "set_takeWhileD".
wenzelm@24800
  2199
wenzelm@25177
  2200
* New functions "sorted" and "sort" in src/HOL/List.thy.
wenzelm@24800
  2201
wenzelm@24800
  2202
* New lemma collection field_simps (an extension of ring_simps) for
wenzelm@24800
  2203
manipulating (in)equations involving division. Multiplies with all
wenzelm@24800
  2204
denominators that can be proved to be non-zero (in equations) or
wenzelm@24800
  2205
positive/negative (in inequations).
nipkow@23480
  2206
nipkow@23480
  2207
* Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
wenzelm@24800
  2208
have been improved and renamed to ring_simps, group_simps and
wenzelm@24800
  2209
ring_distribs.  Removed lemmas field_xyz in theory Ring_and_Field
wenzelm@24800
  2210
because they were subsumed by lemmas xyz.  INCOMPATIBILITY.
wenzelm@24800
  2211
wenzelm@25177
  2212
* Theory Library/Commutative_Ring: switched from recdef to function
wenzelm@24800
  2213
package; constants add, mul, pow now curried.  Infix syntax for
wenzelm@24800
  2214
algebraic operations.
haftmann@22735
  2215
wenzelm@24800
  2216
* Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
haftmann@22218
  2217
INCOMPATIBILITY.
haftmann@22218
  2218
wenzelm@24800
  2219
* Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
haftmann@22218
  2220
INCOMPATIBILITY.
haftmann@22218
  2221
wenzelm@22126
  2222
* HOL/records: generalised field-update to take a function on the
wenzelm@22126
  2223
field rather than the new value: r(|A := x|) is translated to A_update
wenzelm@22126
  2224
(K x) r The K-combinator that is internally used is called K_record.
schirmer@21226
  2225
INCOMPATIBILITY: Usage of the plain update functions has to be
schirmer@21226
  2226
adapted.
schirmer@21226
  2227
 
wenzelm@24800
  2228
* Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
wenzelm@24800
  2229
* x = 0, which are required for a semiring.  Richer structures do not
wenzelm@24800
  2230
inherit from semiring_0 anymore, because this property is a theorem
wenzelm@24800
  2231
there, not an axiom.  INCOMPATIBILITY: In instances of semiring_0,
wenzelm@24800
  2232
there is more to prove, but this is mostly trivial.
wenzelm@24800
  2233
wenzelm@24800
  2234
* Class "recpower" is generalized to arbitrary monoids, not just
wenzelm@24800
  2235
commutative semirings.  INCOMPATIBILITY: may need to incorporate
haftmann@25163
  2236
commutativity or semiring properties additionally.
haftmann@21215
  2237
haftmann@21099
  2238
* Constant "List.list_all2" in List.thy now uses authentic syntax.
wenzelm@24800
  2239
INCOMPATIBILITY: translations containing list_all2 may go wrong,
wenzelm@24800
  2240
better use 'abbreviation'.
wenzelm@24800
  2241
wenzelm@24800
  2242
* Renamed constant "List.op mem" to "List.member".  INCOMPATIBILITY.
wenzelm@24800
  2243
wenzelm@22126
  2244
* Numeral syntax: type 'bin' which was a mere type copy of 'int' has
wenzelm@24800
  2245
been abandoned in favour of plain 'int'.  INCOMPATIBILITY --
wenzelm@22126
  2246
significant changes for setting up numeral syntax for types:
wenzelm@24800
  2247
  - New constants Numeral.pred and Numeral.succ instead
haftmann@20485
  2248
      of former Numeral.bin_pred and Numeral.bin_succ.
haftmann@20485
  2249
  - Use integer operations instead of bin_add, bin_mult and so on.
haftmann@20485
  2250
  - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
haftmann@20485
  2251
  - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
haftmann@20485
  2252
wenzelm@25177
  2253
See src/HOL/Integ/IntArith.thy for an example setup.
wenzelm@25177
  2254
wenzelm@25177
  2255
* Command 'normal_form' computes the normal form of a term that may
wenzelm@25177
  2256
contain free variables.  For example ``normal_form "rev [a, b, c]"''
wenzelm@25177
  2257
produces ``[b, c, a]'' (without proof).  This command is suitable for
wenzelm@25177
  2258
heavy-duty computations because the functions are compiled to ML
wenzelm@25177
  2259
first.  Correspondingly, a method "normalization" is provided.  See
wenzelm@25177
  2260
further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
nipkow@19895
  2261
wenzelm@17996
  2262
* Alternative iff syntax "A <-> B" for equality on bool (with priority
wenzelm@17996
  2263
25 like -->); output depends on the "iff" print_mode, the default is
wenzelm@17996
  2264
"A = B" (with priority 50).
wenzelm@17996
  2265
wenzelm@21265
  2266
* Relations less (<) and less_eq (<=) are also available on type bool.
wenzelm@21265
  2267
Modified syntax to disallow nesting without explicit parentheses,
wenzelm@24800
  2268
e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z".  Potential
wenzelm@24800
  2269
INCOMPATIBILITY.
wenzelm@21265
  2270
nipkow@18674
  2271
* "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
nipkow@18674
  2272
krauss@20716
  2273
* Relation composition operator "op O" now has precedence 75 and binds
krauss@20716
  2274
stronger than union and intersection. INCOMPATIBILITY.
krauss@20716
  2275
wenzelm@22126
  2276
* The old set interval syntax "{m..n(}" (and relatives) has been
wenzelm@22126
  2277
removed.  Use "{m..<n}" (and relatives) instead.
nipkow@19377
  2278
wenzelm@17865
  2279
* In the context of the assumption "~(s = t)" the Simplifier rewrites
wenzelm@24800
  2280
"t = s" to False (by simproc "neq").  INCOMPATIBILITY, consider using
wenzelm@24800
  2281
``declare [[simproc del: neq]]''.
wenzelm@24800
  2282
wenzelm@24800
  2283
* Simplifier: "m dvd n" where m and n are numbers is evaluated to
wenzelm@24800
  2284
True/False.
wenzelm@24800
  2285
wenzelm@24800
  2286
* Theorem Cons_eq_map_conv no longer declared as "simp".
nipkow@19211
  2287
ballarin@19279
  2288
* Theorem setsum_mult renamed to setsum_right_distrib.
ballarin@19279
  2289
nipkow@19211
  2290
* Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
wenzelm@22126
  2291
``rule'' method.
wenzelm@22126
  2292
wenzelm@24800
  2293
* Reimplemented methods "sat" and "satx", with several improvements:
wenzelm@24800
  2294
goals no longer need to be stated as "<prems> ==> False", equivalences
wenzelm@24800
  2295
(i.e. "=" on type bool) are handled, variable names of the form
wenzelm@24800
  2296
"lit_<n>" are no longer reserved, significant speedup.
wenzelm@24800
  2297
wenzelm@24800
  2298
* Methods "sat" and "satx" can now replay MiniSat proof traces.
wenzelm@22126
  2299
zChaff is still supported as well.
wenzelm@22126
  2300
wenzelm@22126
  2301
* 'inductive' and 'datatype': provide projections of mutual rules,
wenzelm@22126
  2302
bundled as foo_bar.inducts;
wenzelm@22126
  2303
wenzelm@22126
  2304
* Library: moved theories Parity, GCD, Binomial, Infinite_Set to
wenzelm@22126
  2305
Library.
wenzelm@21256
  2306
wenzelm@21256
  2307
* Library: moved theory Accessible_Part to main HOL.
wenzelm@19572
  2308
wenzelm@18446
  2309
* Library: added theory Coinductive_List of potentially infinite lists
wenzelm@18446
  2310
as greatest fixed-point.
wenzelm@18399
  2311
wenzelm@19254
  2312
* Library: added theory AssocList which implements (finite) maps as
schirmer@19252
  2313
association lists.
webertj@17809
  2314
wenzelm@24800
  2315
* Method "evaluation" solves goals (i.e. a boolean expression)
wenzelm@24800
  2316
efficiently by compiling it to ML.  The goal is "proved" (via an
wenzelm@24800
  2317
oracle) if it evaluates to True.
wenzelm@20807
  2318
wenzelm@20807
  2319
* Linear arithmetic now splits certain operators (e.g. min, max, abs)
wenzelm@24800
  2320
also when invoked by the simplifier.  This results in the Simplifier
wenzelm@24800
  2321
being more powerful on arithmetic goals.  INCOMPATIBILITY.
wenzelm@24800
  2322
Configuration option fast_arith_split_limit=0 recovers the old
wenzelm@24800
  2323
behavior.
webertj@20217
  2324
wenzelm@22126
  2325
* Support for hex (0x20) and binary (0b1001) numerals.
wenzelm@19254
  2326
wenzelm@20807
  2327
* New method: reify eqs (t), where eqs are equations for an
wenzelm@20807
  2328
interpretation I :: 'a list => 'b => 'c and t::'c is an optional
wenzelm@20807
  2329
parameter, computes a term s::'b and a list xs::'a list and proves the
wenzelm@20807
  2330
theorem I xs s = t. This is also known as reification or quoting. The
wenzelm@20807
  2331
resulting theorem is applied to the subgoal to substitute t with I xs
wenzelm@20807
  2332
s.  If t is omitted, the subgoal itself is reified.
wenzelm@20807
  2333
wenzelm@20807
  2334
* New method: reflection corr_thm eqs (t). The parameters eqs and (t)
wenzelm@20807
  2335
are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
wenzelm@20807
  2336
where f is supposed to be a computable function (in the sense of code
wenzelm@20807
  2337
generattion). The method uses reify to compute s and xs as above then
wenzelm@20807
  2338
applies corr_thm and uses normalization by evaluation to "prove" f s =
wenzelm@20807
  2339
r and finally gets the theorem t = r, which is again applied to the
wenzelm@25177
  2340
subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
wenzelm@25177
  2341
wenzelm@25177
  2342
* Reflection: Automatic reification now handels binding, an example is
wenzelm@25177
  2343
available in src/HOL/ex/ReflectionEx.thy
wenzelm@20807
  2344
wenzelm@25397
  2345
* HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
schirmer@25409
  2346
command 'statespace' that is similar to 'record', but introduces an
wenzelm@25397
  2347
abstract specification based on the locale infrastructure instead of
wenzelm@25397
  2348
HOL types.  This leads to extra flexibility in composing state spaces,
wenzelm@25397
  2349
in particular multiple inheritance and renaming of components.
wenzelm@25397
  2350
wenzelm@25397
  2351
wenzelm@19653
  2352
*** HOL-Complex ***
wenzelm@19653
  2353
huffman@22971
  2354
* Hyperreal: Functions root and sqrt are now defined on negative real
huffman@22971
  2355
inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
huffman@22971
  2356
Nonnegativity side conditions have been removed from many lemmas, so
huffman@22971
  2357
that more subgoals may now be solved by simplification; potential
huffman@22971
  2358
INCOMPATIBILITY.
huffman@22971
  2359
wenzelm@24800
  2360
* Real: new type classes formalize real normed vector spaces and
huffman@21791
  2361
algebras, using new overloaded constants scaleR :: real => 'a => 'a
huffman@21791
  2362
and norm :: 'a => real.
huffman@21791
  2363
wenzelm@24800
  2364
* Real: constant of_real :: real => 'a::real_algebra_1 injects from
wenzelm@24800
  2365
reals into other types. The overloaded constant Reals :: 'a set is now
wenzelm@24800
  2366
defined as range of_real; potential INCOMPATIBILITY.
wenzelm@24800
  2367
wenzelm@24800
  2368
* Real: proper support for ML code generation, including 'quickcheck'.
nipkow@23013
  2369
Reals are implemented as arbitrary precision rationals.
nipkow@23013
  2370
wenzelm@22126
  2371
* Hyperreal: Several constants that previously worked only for the
wenzelm@22126
  2372
reals have been generalized, so they now work over arbitrary vector
wenzelm@22126
  2373
spaces. Type annotations may need to be added in some cases; potential
wenzelm@22126
  2374
INCOMPATIBILITY.
huffman@21791
  2375
huffman@22972
  2376
  Infinitesimal  :: ('a::real_normed_vector) star set
huffman@22972
  2377
  HFinite        :: ('a::real_normed_vector) star set
huffman@22972
  2378
  HInfinite      :: ('a::real_normed_vector) star set
huffman@21791
  2379
  approx         :: ('a::real_normed_vector) star => 'a star => bool
huffman@21791
  2380
  monad          :: ('a::real_normed_vector) star => 'a star set
huffman@21791
  2381
  galaxy         :: ('a::real_normed_vector) star => 'a star set
huffman@22972
  2382
  (NS)LIMSEQ     :: [nat => 'a::real_normed_vector, 'a] => bool
huffman@21791
  2383
  (NS)convergent :: (nat => 'a::real_normed_vector) => bool
huffman@21791
  2384
  (NS)Bseq       :: (nat => 'a::real_normed_vector) => bool
huffman@21791
  2385
  (NS)Cauchy     :: (nat => 'a::real_normed_vector) => bool
huffman@21791
  2386
  (NS)LIM        :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
huffman@21791
  2387
  is(NS)Cont     :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
huffman@21791
  2388
  deriv          :: ['a::real_normed_field => 'a, 'a, 'a] => bool
huffman@22972
  2389
  sgn            :: 'a::real_normed_vector => 'a
huffman@23116
  2390
  exp            :: 'a::{recpower,real_normed_field,banach} => 'a
huffman@21791
  2391
huffman@21791
  2392
* Complex: Some complex-specific constants are now abbreviations for
wenzelm@22126
  2393
overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
wenzelm@22126
  2394
hnorm.  Other constants have been entirely removed in favor of the
wenzelm@22126
  2395
polymorphic versions (INCOMPATIBILITY):
huffman@21791
  2396
huffman@21791
  2397
  approx        <-- capprox
huffman@21791
  2398
  HFinite       <-- CFinite
huffman@21791
  2399
  HInfinite     <-- CInfinite
huffman@21791
  2400
  Infinitesimal <-- CInfinitesimal
huffman@21791
  2401
  monad         <-- cmonad
huffman@21791
  2402
  galaxy        <-- cgalaxy
huffman@21791
  2403
  (NS)LIM       <-- (NS)CLIM, (NS)CRLIM
huffman@21791
  2404
  is(NS)Cont    <-- is(NS)Contc, is(NS)contCR
huffman@21791
  2405
  (ns)deriv     <-- (ns)cderiv
huffman@21791
  2406
wenzelm@19653
  2407
wenzelm@24801
  2408
*** HOL-Algebra ***
wenzelm@24801
  2409
wenzelm@24801
  2410
* Formalisation of ideals and the quotient construction over rings.
wenzelm@24801
  2411
wenzelm@24801
  2412
* Order and lattice theory no longer based on records.
wenzelm@24801
  2413
INCOMPATIBILITY.
wenzelm@24801
  2414
wenzelm@24801
  2415
* Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
wenzelm@24801
  2416
greatest_closed.  INCOMPATIBILITY.
wenzelm@24801
  2417
wenzelm@24801
  2418
* Method algebra is now set up via an attribute.  For examples see
wenzelm@24801
  2419
Ring.thy.  INCOMPATIBILITY: the method is now weaker on combinations
wenzelm@24801
  2420
of algebraic structures.
wenzelm@24801
  2421
wenzelm@24801
  2422
* Renamed theory CRing to Ring.
wenzelm@24801
  2423
wenzelm@24801
  2424
wenzelm@24801
  2425
*** HOL-Nominal ***
wenzelm@24801
  2426
wenzelm@25148
  2427
* Substantial, yet incomplete support for nominal datatypes (binding
wenzelm@25177
  2428
structures) based on HOL-Nominal logic.  See src/HOL/Nominal and
wenzelm@25177
  2429
src/HOL/Nominal/Examples.  Prospective users should consult
wenzelm@25148
  2430
http://isabelle.in.tum.de/nominal/
wenzelm@25148
  2431
wenzelm@24801
  2432
wenzelm@17878
  2433
*** ML ***
wenzelm@17878
  2434
wenzelm@24643
  2435
* ML basics: just one true type int, which coincides with IntInf.int
wenzelm@24643
  2436
(even on SML/NJ).
wenzelm@24643
  2437
wenzelm@22138
  2438
* ML within Isar: antiquotations allow to embed statically-checked
wenzelm@22138
  2439
formal entities in the source, referring to the context available at
wenzelm@22138
  2440
compile-time.  For example:
wenzelm@22138
  2441
wenzelm@25142
  2442
ML {* @{sort "{zero,one}"} *}
wenzelm@22138
  2443
ML {* @{typ "'a => 'b"} *}
wenzelm@22138
  2444
ML {* @{term "%x. x"} *}
wenzelm@22138
  2445
ML {* @{prop "x == y"} *}
wenzelm@22138
  2446
ML {* @{ctyp "'a => 'b"} *}
wenzelm@22138
  2447
ML {* @{cterm "%x. x"} *}
wenzelm@22138
  2448
ML {* @{cprop "x == y"} *}
wenzelm@22138
  2449
ML {* @{thm asm_rl} *}
wenzelm@22138
  2450
ML {* @{thms asm_rl} *}
wenzelm@24692
  2451
ML {* @{type_name c} *}
wenzelm@25142
  2452
ML {* @{type_syntax c} *}
wenzelm@22376
  2453
ML {* @{const_name c} *}
wenzelm@22376
  2454
ML {* @{const_syntax c} *}
wenzelm@22138
  2455
ML {* @{context} *}
wenzelm@22138
  2456
ML {* @{theory} *}
wenzelm@22138
  2457
ML {* @{theory Pure} *}
wenzelm@24692
  2458
ML {* @{theory_ref} *}
wenzelm@24692
  2459
ML {* @{theory_ref Pure} *}
wenzelm@22138
  2460
ML {* @{simpset} *}
wenzelm@22138
  2461
ML {* @{claset} *}
wenzelm@22138
  2462
ML {* @{clasimpset} *}
wenzelm@22138
  2463
wenzelm@22151
  2464
The same works for sources being ``used'' within an Isar context.
wenzelm@22151
  2465
wenzelm@22152
  2466
* ML in Isar: improved error reporting; extra verbosity with
wenzelm@24706
  2467
ML_Context.trace enabled.
wenzelm@22152
  2468
wenzelm@19032
  2469
* Pure/General/table.ML: the join operations now works via exceptions
wenzelm@24706
  2470
DUP/SAME instead of type option. This is simpler in simple cases, and
wenzelm@19081
  2471
admits slightly more efficient complex applications.
wenzelm@18446
  2472
wenzelm@24800
  2473
* Pure: 'advanced' translation functions (parse_translation etc.) now
wenzelm@24800
  2474
use Context.generic instead of just theory.
wenzelm@24800
  2475
wenzelm@18642
  2476
* Pure: datatype Context.generic joins theory/Proof.context and
wenzelm@18644
  2477
provides some facilities for code that works in either kind of
wenzelm@18642
  2478
context, notably GenericDataFun for uniform theory and proof data.
wenzelm@18642
  2479
wenzelm@18737
  2480
* Pure: simplified internal attribute type, which is now always
wenzelm@24706
  2481
Context.generic * thm -> Context.generic * thm. Global (theory) vs.
wenzelm@24706
  2482
local (Proof.context) attributes have been discontinued, while
wenzelm@24706
  2483
minimizing code duplication. Thm.rule_attribute and
wenzelm@24706
  2484
Thm.declaration_attribute build canonical attributes; see also structure
wenzelm@24706
  2485
Context for further operations on Context.generic, notably
wenzelm@24706
  2486
GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
wenzelm@19006
  2487
declarations and definitions.
wenzelm@19006
  2488
wenzelm@24800
  2489
* Context data interfaces (Theory/Proof/GenericDataFun): removed
wenzelm@24800
  2490
name/print, uninitialized data defaults to ad-hoc copy of empty value,
wenzelm@24800
  2491
init only required for impure data. INCOMPATIBILITY: empty really need
wenzelm@24800
  2492
to be empty (no dependencies on theory content!)
wenzelm@24800
  2493
wenzelm@19508
  2494
* Pure/kernel: consts certification ignores sort constraints given in
wenzelm@24800
  2495
signature declarations. (This information is not relevant to the
wenzelm@24800
  2496
logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
wenzelm@24800
  2497
potential INCOMPATIBILITY.
wenzelm@19508
  2498
wenzelm@19508
  2499
* Pure: axiomatic type classes are now purely definitional, with
wenzelm@19508
  2500
explicit proofs of class axioms and super class relations performed
wenzelm@24706
  2501
internally. See Pure/axclass.ML for the main internal interfaces --
wenzelm@19508
  2502
notably AxClass.define_class supercedes AxClass.add_axclass, and
wenzelm@24706
  2503
AxClass.axiomatize_class/classrel/arity supersede
wenzelm@19508
  2504
Sign.add_classes/classrel/arities.
wenzelm@19508
  2505
wenzelm@19006
  2506
* Pure/Isar: Args/Attrib parsers operate on Context.generic --
wenzelm@19006
  2507
global/local versions on theory vs. Proof.context have been
wenzelm@19006
  2508
discontinued; Attrib.syntax and Method.syntax have been adapted
wenzelm@19006
  2509
accordingly.  INCOMPATIBILITY, need to adapt parser expressions for
wenzelm@19006
  2510
attributes, methods, etc.
wenzelm@18642
  2511
wenzelm@18446
  2512
* Pure: several functions of signature "... -> theory -> theory * ..."
wenzelm@18446
  2513
have been reoriented to "... -> theory -> ... * theory" in order to
wenzelm@18446
  2514
allow natural usage in combination with the ||>, ||>>, |-> and
wenzelm@18446
  2515
fold_map combinators.
haftmann@18051
  2516
wenzelm@21647
  2517
* Pure: official theorem names (closed derivations) and additional
wenzelm@21647
  2518
comments (tags) are now strictly separate.  Name hints -- which are
wenzelm@21647
  2519
maintained as tags -- may be attached any time without affecting the
wenzelm@21647
  2520
derivation.
wenzelm@21647
  2521
wenzelm@18020
  2522
* Pure: primitive rule lift_rule now takes goal cterm instead of an
wenzelm@18145
  2523
actual goal state (thm).  Use Thm.lift_rule (Thm.cprem_of st i) to
wenzelm@18020
  2524
achieve the old behaviour.
wenzelm@18020
  2525
wenzelm@18020
  2526
* Pure: the "Goal" constant is now called "prop", supporting a
wenzelm@18020
  2527
slightly more general idea of ``protecting'' meta-level rule
wenzelm@18020
  2528
statements.
wenzelm@18020
  2529
wenzelm@20040
  2530
* Pure: Logic.(un)varify only works in a global context, which is now
wenzelm@20040
  2531
enforced instead of silently assumed.  INCOMPATIBILITY, may use
wenzelm@20040
  2532
Logic.legacy_(un)varify as temporary workaround.
wenzelm@20040
  2533
wenzelm@20090
  2534
* Pure: structure Name provides scalable operations for generating
wenzelm@20090
  2535
internal variable names, notably Name.variants etc.  This replaces
wenzelm@20090
  2536
some popular functions from term.ML:
wenzelm@20090
  2537
wenzelm@20090
  2538
  Term.variant		->  Name.variant
wenzelm@24800
  2539
  Term.variantlist	->  Name.variant_list
wenzelm@20090
  2540
  Term.invent_names	->  Name.invent_list
wenzelm@20090
  2541
wenzelm@20090
  2542
Note that low-level renaming rarely occurs in new code -- operations
wenzelm@20090
  2543
from structure Variable are used instead (see below).
wenzelm@20090
  2544
wenzelm@20040
  2545
* Pure: structure Variable provides fundamental operations for proper
wenzelm@20040
  2546
treatment of fixed/schematic variables in a context.  For example,
wenzelm@20040
  2547
Variable.import introduces fixes for schematics of given facts and
wenzelm@20040
  2548
Variable.export reverses the effect (up to renaming) -- this replaces
wenzelm@20040
  2549
various freeze_thaw operations.
wenzelm@20040
  2550
wenzelm@18567
  2551
* Pure: structure Goal provides simple interfaces for
wenzelm@17981
  2552
init/conclude/finish and tactical prove operations (replacing former
wenzelm@20040
  2553
Tactic.prove).  Goal.prove is the canonical way to prove results
wenzelm@20040
  2554
within a given context; Goal.prove_global is a degraded version for
wenzelm@20040
  2555
theory level goals, including a global Drule.standard.  Note that
wenzelm@20040
  2556
OldGoals.prove_goalw_cterm has long been obsolete, since it is
wenzelm@20040
  2557
ill-behaved in a local proof context (e.g. with local fixes/assumes or
wenzelm@20040
  2558
in a locale context).
wenzelm@17981
  2559
wenzelm@24706
  2560
* Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
wenzelm@24706
  2561
and type checking (Syntax.check_term etc.), with common combinations
wenzelm@24706
  2562
(Syntax.read_term etc.). These supersede former Sign.read_term etc.
wenzelm@24706
  2563
which are considered legacy and await removal.
wenzelm@24706
  2564
wenzelm@24920
  2565
* Pure/Syntax: generic interfaces for type unchecking
wenzelm@24920
  2566
(Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
wenzelm@24920
  2567
with common combinations (Syntax.pretty_term, Syntax.string_of_term
wenzelm@24920
  2568
etc.).  Former Sign.pretty_term, Sign.string_of_term etc. are still
wenzelm@24924
  2569
available for convenience, but refer to the very same operations using
wenzelm@24924
  2570
a mere theory instead of a full context.
wenzelm@24920
  2571
wenzelm@18815
  2572
* Isar: simplified treatment of user-level errors, using exception
wenzelm@18687
  2573
ERROR of string uniformly.  Function error now merely raises ERROR,
wenzelm@18686
  2574
without any side effect on output channels.  The Isar toplevel takes
wenzelm@18686
  2575
care of proper display of ERROR exceptions.  ML code may use plain
wenzelm@18686
  2576
handle/can/try; cat_error may be used to concatenate errors like this:
wenzelm@18686
  2577
wenzelm@18686
  2578
  ... handle ERROR msg => cat_error msg "..."
wenzelm@18686
  2579
wenzelm@18686
  2580
Toplevel ML code (run directly or through the Isar toplevel) may be
wenzelm@18687
  2581
embedded into the Isar toplevel with exception display/debug like
wenzelm@18687
  2582
this:
wenzelm@18686
  2583
wenzelm@18686
  2584
  Isar.toplevel (fn () => ...)
wenzelm@18686
  2585
wenzelm@18686
  2586
INCOMPATIBILITY, removed special transform_error facilities, removed
wenzelm@18686
  2587
obsolete variants of user-level exceptions (ERROR_MESSAGE,
wenzelm@18686
  2588
Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
wenzelm@18686
  2589
-- use plain ERROR instead.
wenzelm@18686
  2590
wenzelm@18815
  2591
* Isar: theory setup now has type (theory -> theory), instead of a
wenzelm@18722
  2592
list.  INCOMPATIBILITY, may use #> to compose setup functions.
wenzelm@18722
  2593
wenzelm@24706
  2594
* Isar: ML toplevel pretty printer for type Proof.context, subject to
wenzelm@24706
  2595
ProofContext.debug/verbose flags.
wenzelm@18815
  2596
wenzelm@18815
  2597
* Isar: Toplevel.theory_to_proof admits transactions that modify the
wenzelm@18815
  2598
theory before entering a proof state.  Transactions now always see a
wenzelm@18815
  2599
quasi-functional intermediate checkpoint, both in interactive and
wenzelm@18590
  2600
batch mode.
wenzelm@18567
  2601
wenzelm@24867
  2602
* Isar: simplified interfaces for outer syntax.  Renamed
wenzelm@24867
  2603
OuterSyntax.add_keywords to OuterSyntax.keywords.  Removed
wenzelm@24867
  2604
OuterSyntax.add_parsers -- this functionality is now included in
wenzelm@24867
  2605
OuterSyntax.command etc.  INCOMPATIBILITY.
wenzelm@24867
  2606
wenzelm@17878
  2607
* Simplifier: the simpset of a running simplification process now
wenzelm@17878
  2608
contains a proof context (cf. Simplifier.the_context), which is the
wenzelm@17878
  2609
very context that the initial simpset has been retrieved from (by
wenzelm@17890
  2610
simpset_of/local_simpset_of).  Consequently, all plug-in components
wenzelm@17878
  2611
(solver, looper etc.) may depend on arbitrary proof data.
wenzelm@17878
  2612
wenzelm@17878
  2613
* Simplifier.inherit_context inherits the proof context (plus the
wenzelm@17878
  2614
local bounds) of the current simplification process; any simproc
wenzelm@17878
  2615
etc. that calls the Simplifier recursively should do this!  Removed
wenzelm@17878
  2616
former Simplifier.inherit_bounds, which is already included here --
wenzelm@17890
  2617
INCOMPATIBILITY.  Tools based on low-level rewriting may even have to
wenzelm@17890
  2618
specify an explicit context using Simplifier.context/theory_context.
wenzelm@17878
  2619
wenzelm@17878
  2620
* Simplifier/Classical Reasoner: more abstract interfaces
wenzelm@17878
  2621
change_simpset/claset for modifying the simpset/claset reference of a
wenzelm@17878
  2622
theory; raw versions simpset/claset_ref etc. have been discontinued --
wenzelm@17878
  2623
INCOMPATIBILITY.
wenzelm@17878
  2624
wenzelm@18540
  2625
* Provers: more generic wrt. syntax of object-logics, avoid hardwired
wenzelm@18540
  2626
"Trueprop" etc.
wenzelm@18540
  2627
wenzelm@17878
  2628
wenzelm@20988
  2629
*** System ***