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