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