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