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