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