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