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