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