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