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