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