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