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