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