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