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