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