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