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