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