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