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