NEWS
author wenzelm
Wed Apr 09 17:54:09 2014 +0200 (2014-04-09)
changeset 56499 7e0178c84994
parent 56450 16d4213d4cbc
child 56505 aed94b61f65b
permissions -rw-r--r--
allow text cartouches in regular outer syntax categories "text" and "altstring";
wenzelm@5363
     1
Isabelle NEWS -- history user-relevant changes
wenzelm@5363
     2
==============================================
wenzelm@2553
     3
wenzelm@54055
     4
New in this Isabelle version
wenzelm@54055
     5
----------------------------
wenzelm@54055
     6
wenzelm@54702
     7
*** General ***
wenzelm@54702
     8
wenzelm@54702
     9
* Document antiquotation @{url} produces markup for the given URL,
wenzelm@54702
    10
which results in an active hyperlink within the text.
wenzelm@54702
    11
wenzelm@54705
    12
* Document antiquotation @{file_unchecked} is like @{file}, but does
wenzelm@54705
    13
not check existence within the file-system.
wenzelm@54705
    14
wenzelm@54732
    15
* Discontinued legacy_isub_isup, which was a temporary Isabelle/ML
wenzelm@54732
    16
workaround in Isabelle2013-1.  The prover process no longer accepts
wenzelm@54732
    17
old identifier syntax with \<^isub> or \<^isup>.
wenzelm@54732
    18
wenzelm@55029
    19
* Syntax of document antiquotation @{rail} now uses \<newline> instead
wenzelm@55029
    20
of "\\", to avoid the optical illusion of escaped backslash within
wenzelm@55029
    21
string token.  Minor INCOMPATIBILITY.
wenzelm@55029
    22
wenzelm@55122
    23
* Lexical syntax (inner and outer) supports text cartouches with
wenzelm@55668
    24
arbitrary nesting, and without escapes of quotes etc.  The Prover IDE
wenzelm@55668
    25
supports input methods via ` (backquote), or << and >> (double angle
wenzelm@55668
    26
brackets).
wenzelm@55122
    27
wenzelm@56499
    28
* The outer syntax categories "text" (for formal comments and document
wenzelm@56499
    29
markup commands) and "altstring" (for literal fact references) allow
wenzelm@56499
    30
cartouches as well, in addition to the traditional mix of quotations.
wenzelm@56499
    31
wenzelm@56232
    32
* More static checking of proof methods, which allows the system to
wenzelm@56232
    33
form a closure over the concrete syntax.  Method arguments should be
wenzelm@56232
    34
processed in the original proof context as far as possible, before
wenzelm@56232
    35
operating on the goal state.  In any case, the standard discipline for
wenzelm@56232
    36
subgoal-addressing needs to be observed: no subgoals or a subgoal
wenzelm@56232
    37
number that is out of range produces an empty result sequence, not an
wenzelm@56232
    38
exception.  Potential INCOMPATIBILITY for non-conformant tactical
wenzelm@56232
    39
proof tools.
wenzelm@56232
    40
wenzelm@56275
    41
* Command 'SML_file' reads and evaluates the given Standard ML file.
wenzelm@56275
    42
Toplevel bindings are stored within the theory context; the initial
wenzelm@56275
    43
environment is restricted to the Standard ML implementation of
wenzelm@56276
    44
Poly/ML, without the add-ons of Isabelle/ML.  See also
wenzelm@56276
    45
~~/src/Tools/SML/Examples.thy for some basic examples.
wenzelm@56275
    46
wenzelm@54702
    47
wenzelm@54533
    48
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@54533
    49
wenzelm@56342
    50
* Improved syntactic and semantic completion mechanism:
wenzelm@56342
    51
wenzelm@56342
    52
  - No completion for Isar keywords that have already been recognized
wenzelm@56342
    53
    by the prover, e.g. ":" within accepted Isar syntax looses its
wenzelm@56342
    54
    meaning as abbreviation for symbol "\<in>".
wenzelm@56342
    55
wenzelm@56342
    56
  - Completion context provides information about embedded languages
wenzelm@56342
    57
    of Isabelle: keywords are only completed for outer syntax, symbols
wenzelm@56342
    58
    or antiquotations for languages that support them.  E.g. no symbol
wenzelm@56342
    59
    completion for ML source, but within ML strings, comments,
wenzelm@56342
    60
    antiquotations.
wenzelm@56342
    61
wenzelm@56342
    62
  - Support for semantic completion based on failed name space lookup.
wenzelm@56342
    63
    The error produced by the prover contains information about
wenzelm@56342
    64
    alternative names that are accessible in a particular position.
wenzelm@56342
    65
    This may be used with explicit completion (C+b) or implicit
wenzelm@56342
    66
    completion after some delay.
wenzelm@56342
    67
wenzelm@56342
    68
  - Semantic completions may get extended by appending a suffix of
wenzelm@56342
    69
    underscores to an already recognized name, e.g. "foo_" to complete
wenzelm@56342
    70
    "foo" or "foobar" if these are known in the context.  The special
wenzelm@56342
    71
    identifier "__" serves as a wild-card in this respect: it
wenzelm@56342
    72
    completes to the full collection of names from the name space
wenzelm@56342
    73
    (truncated according to the system option "completion_limit").
wenzelm@56342
    74
wenzelm@56342
    75
  - Syntax completion of the editor and semantic completion of the
wenzelm@56342
    76
    prover are merged.  Since the latter requires a full round-trip of
wenzelm@56342
    77
    document update to arrive, the default for option
wenzelm@56342
    78
    jedit_completion_delay has been changed to 0.5s to improve the
wenzelm@56342
    79
    user experience.
wenzelm@56342
    80
wenzelm@56342
    81
  - Option jedit_completion_immediate may now get used with
wenzelm@56342
    82
    jedit_completion_delay > 0, to complete symbol abbreviations
wenzelm@56342
    83
    aggressively while benefiting from combined syntactic and semantic
wenzelm@56342
    84
    completion.
wenzelm@56342
    85
wenzelm@56342
    86
  - Support for simple completion templates (with single
wenzelm@56342
    87
    place-holder), e.g. "`" for text cartouche, or "@{" for
wenzelm@56342
    88
    antiquotation.
wenzelm@56342
    89
wenzelm@56342
    90
  - Improved treatment of completion vs. various forms of jEdit text
wenzelm@56342
    91
    selection (multiple selections, rectangular selections,
wenzelm@56342
    92
    rectangular selection as "tall caret").
wenzelm@56342
    93
wenzelm@56342
    94
  - More reliable treatment of GUI events vs. completion popups: avoid
wenzelm@56342
    95
    loosing keystrokes with slow / remote graphics displays.
wenzelm@56342
    96
wenzelm@54533
    97
* Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.
wenzelm@54533
    98
Open text buffers take precedence over copies within the file-system.
wenzelm@54533
    99
wenzelm@55536
   100
* Improved support for Isabelle/ML, with jEdit mode "isabelle-ml" for
wenzelm@55536
   101
auxiliary ML files.
wenzelm@55536
   102
wenzelm@54688
   103
* Document panel: simplied interaction where every single mouse click
wenzelm@54688
   104
(re)opens document via desktop environment or as jEdit buffer.
wenzelm@54688
   105
wenzelm@54881
   106
* Option "jedit_print_mode" (see also "Plugin Options / Isabelle /
wenzelm@54881
   107
General") allows to specify additional print modes for the prover
wenzelm@54881
   108
process, without requiring old-fashioned command-line invocation of
wenzelm@54881
   109
"isabelle jedit -m MODE".
wenzelm@54881
   110
lars@55316
   111
* New panel: Simplifier trace.  Provides an interactive view of the
lars@55316
   112
simplification process, enabled by the newly-introduced
lars@55316
   113
"simplifier_trace" declaration.
lars@55316
   114
wenzelm@56450
   115
* Support for Navigator plugin (with toolbar buttons).
wenzelm@56413
   116
wenzelm@54533
   117
wenzelm@55001
   118
*** Pure ***
wenzelm@55001
   119
wenzelm@56245
   120
* Basic constants of Pure use more conventional names and are always
wenzelm@56245
   121
qualified.  Rare INCOMPATIBILITY, but with potentially serious
wenzelm@56245
   122
consequences, notably for tools in Isabelle/ML.  The following
wenzelm@56245
   123
renaming needs to be applied:
wenzelm@56245
   124
wenzelm@56245
   125
  ==             ~>  Pure.eq
wenzelm@56245
   126
  ==>            ~>  Pure.imp
wenzelm@56245
   127
  all            ~>  Pure.all
wenzelm@56245
   128
  TYPE           ~>  Pure.type
wenzelm@56245
   129
  dummy_pattern  ~>  Pure.dummy_pattern
wenzelm@56245
   130
wenzelm@56245
   131
Systematic porting works by using the following theory setup on a
wenzelm@56245
   132
*previous* Isabelle version to introduce the new name accesses for the
wenzelm@56245
   133
old constants:
wenzelm@56245
   134
wenzelm@56245
   135
setup {*
wenzelm@56245
   136
  fn thy => thy
wenzelm@56245
   137
    |> Sign.root_path
wenzelm@56245
   138
    |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="
wenzelm@56245
   139
    |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"
wenzelm@56245
   140
    |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"
wenzelm@56245
   141
    |> Sign.restore_naming thy
wenzelm@56245
   142
*}
wenzelm@56245
   143
wenzelm@56245
   144
Thus ML antiquotations like @{const_name Pure.eq} may be used already.
wenzelm@56245
   145
Later the application is moved to the current Isabelle version, and
wenzelm@56245
   146
the auxiliary aliases are deleted.
wenzelm@56245
   147
wenzelm@55385
   148
* Low-level type-class commands 'classes', 'classrel', 'arities' have
wenzelm@55385
   149
been discontinued to avoid the danger of non-trivial axiomatization
wenzelm@55385
   150
that is not immediately visible.  INCOMPATIBILITY, use regular
wenzelm@55385
   151
'instance' with proof.  The required OFCLASS(...) theorem might be
wenzelm@55385
   152
postulated via 'axiomatization' beforehand, or the proof finished
wenzelm@55385
   153
trivially if the underlying class definition is made vacuous (without
wenzelm@55385
   154
any assumptions).  See also Isabelle/ML operations
wenzelm@55385
   155
Axclass.axiomatize_class, Axclass.axiomatize_classrel,
wenzelm@55385
   156
Axclass.axiomatize_arity.
wenzelm@55385
   157
wenzelm@55143
   158
* Attributes "where" and "of" allow an optional context of local
wenzelm@55143
   159
variables ('for' declaration): these variables become schematic in the
wenzelm@55143
   160
instantiated theorem.
wenzelm@55143
   161
wenzelm@55152
   162
* Obsolete attribute "standard" has been discontinued (legacy since
wenzelm@55152
   163
Isabelle2012).  Potential INCOMPATIBILITY, use explicit 'for' context
wenzelm@55152
   164
where instantiations with schematic variables are intended (for
wenzelm@55152
   165
declaration commands like 'lemmas' or attributes like "of").  The
wenzelm@55152
   166
following temporary definition may help to port old applications:
wenzelm@55152
   167
wenzelm@55152
   168
  attribute_setup standard =
wenzelm@55152
   169
    "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"
wenzelm@55152
   170
wenzelm@55001
   171
* More thorough check of proof context for goal statements and
wenzelm@55006
   172
attributed fact expressions (concerning background theory, declared
wenzelm@55006
   173
hyps).  Potential INCOMPATIBILITY, tools need to observe standard
wenzelm@55006
   174
context discipline.  See also Assumption.add_assumes and the more
wenzelm@55006
   175
primitive Thm.assume_hyps.
wenzelm@55001
   176
wenzelm@55108
   177
* Inner syntax token language allows regular quoted strings "..."
wenzelm@55108
   178
(only makes sense in practice, if outer syntax is delimited
wenzelm@55108
   179
differently).
wenzelm@55108
   180
wenzelm@55001
   181
haftmann@54227
   182
*** HOL ***
haftmann@54227
   183
haftmann@56218
   184
* Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.
haftmann@56218
   185
INCOMPATIBILITY.
haftmann@56218
   186
haftmann@56248
   187
* Default congruence rules strong_INF_cong and strong_SUP_cong,
haftmann@56248
   188
with simplifier implication in premises.  Generalized and replace
haftmann@56248
   189
former INT_cong, SUP_cong.  INCOMPATIBILITY.
haftmann@56248
   190
haftmann@56212
   191
* Consolidated theorem names containing INFI and SUPR: have INF
haftmann@56212
   192
and SUP instead uniformly.  INCOMPATIBILITY.
haftmann@56212
   193
haftmann@56166
   194
* More aggressive normalization of expressions involving INF and Inf
haftmann@56212
   195
or SUP and Sup.  INCOMPATIBILITY.
haftmann@56166
   196
haftmann@56166
   197
* INF_image and SUP_image do not unfold composition.
haftmann@56166
   198
INCOMPATIBILITY.
haftmann@56166
   199
haftmann@56154
   200
* Swapped orientation of facts image_comp and vimage_comp:
haftmann@56154
   201
  image_compose ~> image_comp [symmetric]
haftmann@56154
   202
  image_comp ~> image_comp [symmetric]
haftmann@56154
   203
  vimage_compose ~> vimage_comp [symmetric]
haftmann@56154
   204
  vimage_comp ~> vimage_comp [symmetric]
haftmann@56154
   205
  INCOMPATIBILITY.
haftmann@56154
   206
nipkow@56073
   207
* Simplifier: Enhanced solver of preconditions of rewrite rules
nipkow@56073
   208
  can now deal with conjunctions.
nipkow@56073
   209
  For help with converting proofs, the old behaviour of the simplifier
nipkow@56073
   210
  can be restored like this:  declare/using [[simp_legacy_precond]]
nipkow@56073
   211
  This configuration option will disappear again in the future.
nipkow@56073
   212
haftmann@56076
   213
* Dropped facts INF_comp, SUP_comp.  INCOMPATIBILITY.
haftmann@56076
   214
haftmann@55818
   215
* HOL-Word:
haftmann@55818
   216
  * Abandoned fact collection "word_arith_alts", which is a
haftmann@55818
   217
  duplicate of "word_arith_wis".
haftmann@55818
   218
  * Dropped first (duplicated) element in fact collections
haftmann@55818
   219
  "sint_word_ariths", "word_arith_alts", "uint_word_ariths",
haftmann@55818
   220
  "uint_word_arith_bintrs".
haftmann@55818
   221
haftmann@55757
   222
* Code generator: explicit proof contexts in many ML interfaces.
haftmann@55757
   223
INCOMPATIBILITY.
haftmann@55757
   224
haftmann@55686
   225
* Code generator: minimize exported identifiers by default.
haftmann@55757
   226
Minor INCOMPATIBILITY.
haftmann@55686
   227
haftmann@55677
   228
* Code generation for SML and OCaml: dropped arcane "no_signatures" option.
haftmann@55757
   229
Minor INCOMPATIBILITY.
haftmann@55677
   230
wenzelm@55139
   231
* Simproc "finite_Collect" is no longer enabled by default, due to
wenzelm@55139
   232
spurious crashes and other surprises.  Potential INCOMPATIBILITY.
wenzelm@55139
   233
blanchet@55098
   234
* Moved new (co)datatype package and its dependencies from "HOL-BNF" to "HOL".
blanchet@55098
   235
  The "bnf", "wrap_free_constructors", "datatype_new", "codatatype",
blanchet@55875
   236
  "primcorec", and "primcorecursive" commands are now part of "Main".
blanchet@55098
   237
  Theory renamings:
blanchet@55098
   238
    FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)
blanchet@55098
   239
    Library/Wfrec.thy ~> Wfrec.thy
blanchet@55098
   240
    Library/Zorn.thy ~> Zorn.thy
blanchet@55098
   241
    Cardinals/Order_Relation.thy ~> Order_Relation.thy
blanchet@55098
   242
    Library/Order_Union.thy ~> Cardinals/Order_Union.thy
blanchet@55098
   243
    Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy
blanchet@55098
   244
    Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy
blanchet@55098
   245
    Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy
blanchet@55098
   246
    Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy
blanchet@55098
   247
    Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy
blanchet@55098
   248
    BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy
blanchet@55098
   249
    BNF/Basic_BNFs.thy ~> Basic_BNFs.thy
blanchet@55098
   250
    BNF/BNF_Comp.thy ~> BNF_Comp.thy
blanchet@55098
   251
    BNF/BNF_Def.thy ~> BNF_Def.thy
blanchet@55098
   252
    BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy
blanchet@55098
   253
    BNF/BNF_GFP.thy ~> BNF_GFP.thy
blanchet@55098
   254
    BNF/BNF_LFP.thy ~> BNF_LFP.thy
blanchet@55098
   255
    BNF/BNF_Util.thy ~> BNF_Util.thy
blanchet@55098
   256
    BNF/Coinduction.thy ~> Coinduction.thy
blanchet@55098
   257
    BNF/More_BNFs.thy ~> Library/More_BNFs.thy
blanchet@55098
   258
    BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy
blanchet@55098
   259
    BNF/Examples/* ~> BNF_Examples/*
blanchet@55098
   260
  New theories:
blanchet@55098
   261
    Wellorder_Extension.thy (split from Zorn.thy)
blanchet@55098
   262
    Library/Cardinal_Notations.thy
blanchet@55098
   263
    Library/BNF_Decl.thy
blanchet@55098
   264
    BNF_Examples/Misc_Primcorec.thy
blanchet@55098
   265
    BNF_Examples/Stream_Processor.thy
blanchet@55519
   266
  Discontinued theories:
blanchet@55098
   267
    BNF/BNF.thy
blanchet@55098
   268
    BNF/Equiv_Relations_More.thy
blanchet@55519
   269
  INCOMPATIBILITY.
blanchet@55098
   270
blanchet@56118
   271
* New (co)datatype package:
blanchet@55875
   272
  * "primcorec" is fully implemented.
blanchet@55875
   273
  * Renamed commands:
blanchet@55875
   274
      datatype_new_compat ~> datatype_compat
blanchet@55875
   275
      primrec_new ~> primrec
blanchet@55875
   276
      wrap_free_constructors ~> free_constructors
blanchet@55875
   277
    INCOMPATIBILITY.
blanchet@55875
   278
  * The generated constants "xxx_case" and "xxx_rec" have been renamed
blanchet@55875
   279
    "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").
blanchet@55875
   280
    INCOMPATIBILITY.
blanchet@55875
   281
  * The constant "xxx_(un)fold" and related theorems are no longer generated.
blanchet@55875
   282
    Use "xxx_(co)rec" or define "xxx_(un)fold" manually using "prim(co)rec".
blanchet@55875
   283
    INCOMPATIBILITY.
blanchet@55875
   284
blanchet@55643
   285
* Old datatype package:
blanchet@55643
   286
  * The generated theorems "xxx.cases" and "xxx.recs" have been renamed
blanchet@55643
   287
    "xxx.case" and "xxx.rec" (e.g., "sum.cases" -> "sum.case").
blanchet@55643
   288
    INCOMPATIBILITY.
blanchet@55643
   289
  * The generated constants "xxx_case" and "xxx_rec" have been renamed
blanchet@55643
   290
    "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").
blanchet@55425
   291
    INCOMPATIBILITY.
blanchet@55425
   292
blanchet@55524
   293
* The types "'a list" and "'a option", their set and map functions, their
blanchet@55585
   294
  relators, and their selectors are now produced using the new BNF-based
blanchet@55585
   295
  datatype package.
blanchet@55519
   296
  Renamed constants:
blanchet@55519
   297
    Option.set ~> set_option
blanchet@55519
   298
    Option.map ~> map_option
blanchet@55525
   299
    option_rel ~> rel_option
blanchet@55867
   300
    option_rec ~> case_option
blanchet@55519
   301
  Renamed theorems:
blanchet@55585
   302
    set_def ~> set_rec[abs_def]
blanchet@55519
   303
    map_def ~> map_rec[abs_def]
blanchet@55519
   304
    Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")
blanchet@55867
   305
    option.recs ~> option.case
blanchet@55524
   306
    list_all2_def ~> list_all2_iff
blanchet@55585
   307
    set.simps ~> set_simps (or the slightly different "list.set")
blanchet@55519
   308
    map.simps ~> list.map
blanchet@55519
   309
    hd.simps ~> list.sel(1)
blanchet@55519
   310
    tl.simps ~> list.sel(2-3)
blanchet@55519
   311
    the.simps ~> option.sel
blanchet@55519
   312
  INCOMPATIBILITY.
blanchet@55519
   313
blanchet@55933
   314
* The following map functions and relators have been renamed:
blanchet@55939
   315
    sum_map ~> map_sum
blanchet@55939
   316
    map_pair ~> map_prod
blanchet@55944
   317
    prod_rel ~> rel_prod
blanchet@55943
   318
    sum_rel ~> rel_sum
blanchet@55945
   319
    fun_rel ~> rel_fun
blanchet@55942
   320
    set_rel ~> rel_set
blanchet@55942
   321
    filter_rel ~> rel_filter
blanchet@55940
   322
    fset_rel ~> rel_fset (in "Library/FSet.thy")
blanchet@55940
   323
    cset_rel ~> rel_cset (in "Library/Countable_Set_Type.thy")
blanchet@55942
   324
    vset ~> rel_vset (in "Library/Quotient_Set.thy")
blanchet@55931
   325
blanchet@55098
   326
* New theory:
blanchet@55098
   327
    Cardinals/Ordinal_Arithmetic.thy
blanchet@55098
   328
blanchet@55098
   329
* Theory reorganizations:
blanchet@55098
   330
  * Big_Operators.thy ~> Groups_Big.thy and Lattices_Big.thy
blanchet@55098
   331
blanchet@56118
   332
* SMT module:
blanchet@56118
   333
  * A new version of the SMT module, temporarily called "SMT2", uses SMT-LIB 2
blanchet@56118
   334
    and supports recent versions of Z3 (e.g., 4.3). The new proof method is
blanchet@56118
   335
    called "smt2", and the new Z3 is called "z3_new" in Sledgehammer and
blanchet@56118
   336
    elsewhere.
blanchet@56118
   337
blanchet@55183
   338
* Sledgehammer:
blanchet@56118
   339
  - New prover "z3_new" with support for Isar proofs
blanchet@55289
   340
  - New option:
blanchet@55297
   341
      smt_proofs
blanchet@55183
   342
  - Renamed options:
blanchet@55183
   343
      isar_compress ~> compress_isar
blanchet@55183
   344
      isar_try0 ~> try0_isar
blanchet@55183
   345
    INCOMPATIBILITY.
blanchet@55183
   346
blanchet@55315
   347
* Metis:
blanchet@55315
   348
  - Removed legacy proof method 'metisFT'. Use 'metis (full_types)' instead.
blanchet@55315
   349
    INCOMPATIBILITY.
blanchet@55315
   350
blanchet@55183
   351
* Try0: Added 'algebra' and 'meson' to the set of proof methods.
blanchet@55183
   352
blanchet@55519
   353
* Command renaming: enriched_type ~> functor. INCOMPATIBILITY.
blanchet@55519
   354
wenzelm@55015
   355
* The symbol "\<newline>" may be used within char or string literals
wenzelm@55015
   356
to represent (Char Nibble0 NibbleA), i.e. ASCII newline.
wenzelm@55015
   357
wenzelm@55007
   358
* Activation of Z3 now works via "z3_non_commercial" system option
wenzelm@55007
   359
(without requiring restart), instead of former settings variable
wenzelm@55007
   360
"Z3_NON_COMMERCIAL".  The option can be edited in Isabelle/jEdit menu
wenzelm@55007
   361
Plugin Options / Isabelle / General.
wenzelm@55007
   362
wenzelm@54893
   363
* "declare [[code abort: ...]]" replaces "code_abort ...".
wenzelm@54893
   364
INCOMPATIBILITY.
wenzelm@54893
   365
wenzelm@54893
   366
* "declare [[code drop: ...]]" drops all code equations associated
haftmann@54890
   367
with the given constants.
haftmann@54890
   368
haftmann@54864
   369
* Abolished slightly odd global lattice interpretation for min/max.
haftmann@54864
   370
haftmann@54864
   371
Fact consolidations:
haftmann@54864
   372
    min_max.inf_assoc ~> min.assoc
haftmann@54864
   373
    min_max.inf_commute ~> min.commute
haftmann@54864
   374
    min_max.inf_left_commute ~> min.left_commute
haftmann@54864
   375
    min_max.inf_idem ~> min.idem
haftmann@54864
   376
    min_max.inf_left_idem ~> min.left_idem
haftmann@54864
   377
    min_max.inf_right_idem ~> min.right_idem
haftmann@54864
   378
    min_max.sup_assoc ~> max.assoc
haftmann@54864
   379
    min_max.sup_commute ~> max.commute
haftmann@54864
   380
    min_max.sup_left_commute ~> max.left_commute
haftmann@54864
   381
    min_max.sup_idem ~> max.idem
haftmann@54864
   382
    min_max.sup_left_idem ~> max.left_idem
haftmann@54864
   383
    min_max.sup_inf_distrib1 ~> max_min_distrib2
haftmann@54864
   384
    min_max.sup_inf_distrib2 ~> max_min_distrib1
haftmann@54864
   385
    min_max.inf_sup_distrib1 ~> min_max_distrib2
haftmann@54864
   386
    min_max.inf_sup_distrib2 ~> min_max_distrib1
haftmann@54864
   387
    min_max.distrib ~> min_max_distribs
haftmann@54864
   388
    min_max.inf_absorb1 ~> min.absorb1
haftmann@54864
   389
    min_max.inf_absorb2 ~> min.absorb2
haftmann@54864
   390
    min_max.sup_absorb1 ~> max.absorb1
haftmann@54864
   391
    min_max.sup_absorb2 ~> max.absorb2
haftmann@54864
   392
    min_max.le_iff_inf ~> min.absorb_iff1
haftmann@54864
   393
    min_max.le_iff_sup ~> max.absorb_iff2
haftmann@54864
   394
    min_max.inf_le1 ~> min.cobounded1
haftmann@54864
   395
    min_max.inf_le2 ~> min.cobounded2
haftmann@54864
   396
    le_maxI1, min_max.sup_ge1 ~> max.cobounded1
haftmann@54864
   397
    le_maxI2, min_max.sup_ge2 ~> max.cobounded2
haftmann@54864
   398
    min_max.le_infI1 ~> min.coboundedI1
haftmann@54864
   399
    min_max.le_infI2 ~> min.coboundedI2
haftmann@54864
   400
    min_max.le_supI1 ~> max.coboundedI1
haftmann@54864
   401
    min_max.le_supI2 ~> max.coboundedI2
haftmann@54864
   402
    min_max.less_infI1 ~> min.strict_coboundedI1
haftmann@54864
   403
    min_max.less_infI2 ~> min.strict_coboundedI2
haftmann@54864
   404
    min_max.less_supI1 ~> max.strict_coboundedI1
haftmann@54864
   405
    min_max.less_supI2 ~> max.strict_coboundedI2
haftmann@54864
   406
    min_max.inf_mono ~> min.mono
haftmann@54864
   407
    min_max.sup_mono ~> max.mono
haftmann@54864
   408
    min_max.le_infI, min_max.inf_greatest ~> min.boundedI
haftmann@54864
   409
    min_max.le_supI, min_max.sup_least ~> max.boundedI
haftmann@54864
   410
    min_max.le_inf_iff ~> min.bounded_iff
haftmann@54864
   411
    min_max.le_sup_iff ~> max.bounded_iff
haftmann@54864
   412
haftmann@54864
   413
For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,
haftmann@54864
   414
min.left_commute, min.left_idem, max.commute, max.assoc,
haftmann@54864
   415
max.left_commute, max.left_idem directly.
haftmann@54864
   416
haftmann@54864
   417
For min_max.inf_sup_ord, prefer (one of) min.cobounded1, min.cobounded2,
haftmann@54864
   418
max.cobounded1m max.cobounded2 directly.
haftmann@54864
   419
haftmann@54864
   420
For min_ac or max_ac, prefor more general collection ac_simps.
haftmann@54864
   421
haftmann@54864
   422
INCOMPATBILITY. 
haftmann@54864
   423
haftmann@54850
   424
* Word library: bit representations prefer type bool over type bit.
haftmann@54850
   425
INCOMPATIBILITY.
haftmann@54850
   426
haftmann@54745
   427
* Theorem disambiguation Inf_le_Sup (on finite sets) ~> Inf_fin_le_Sup_fin.
haftmann@54850
   428
INCOMPATIBILITY.
haftmann@54745
   429
haftmann@54708
   430
* Code generations are provided for make, fields, extend and truncate
haftmann@54708
   431
operations on records.
haftmann@54708
   432
haftmann@54295
   433
* Qualified constant names Wellfounded.acc, Wellfounded.accp.
haftmann@54295
   434
INCOMPATIBILITY.
haftmann@54295
   435
haftmann@54228
   436
* Fact generalization and consolidation:
haftmann@54228
   437
    neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
haftmann@54228
   438
INCOMPATIBILITY.
haftmann@54228
   439
haftmann@54228
   440
* Purely algebraic definition of even.  Fact generalization and consolidation:
haftmann@54228
   441
    nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
haftmann@54228
   442
    even_zero_(nat|int) ~> even_zero
haftmann@54228
   443
INCOMPATIBILITY.
wenzelm@54055
   444
haftmann@54489
   445
* Abolished neg_numeral.
haftmann@54489
   446
  * Canonical representation for minus one is "- 1".
haftmann@54489
   447
  * Canonical representation for other negative numbers is "- (numeral _)".
haftmann@54502
   448
  * When devising rule sets for number calculation, consider the
haftmann@54587
   449
    following canonical cases: 0, 1, numeral _, - 1, - numeral _.
haftmann@54587
   450
  * HOLogic.dest_number also recognizes numerals in non-canonical forms
wenzelm@54893
   451
    like "numeral One", "- numeral One", "- 0" and even "- ... - _".
haftmann@54489
   452
  * Syntax for negative numerals is mere input syntax.
haftmann@54489
   453
INCOMPATBILITY.
haftmann@54489
   454
haftmann@54230
   455
* Elimination of fact duplicates:
haftmann@54230
   456
    equals_zero_I ~> minus_unique
haftmann@54230
   457
    diff_eq_0_iff_eq ~> right_minus_eq
traytel@54588
   458
    nat_infinite ~> infinite_UNIV_nat
traytel@54588
   459
    int_infinite ~> infinite_UNIV_int
haftmann@54230
   460
INCOMPATIBILITY.
haftmann@54230
   461
haftmann@54230
   462
* Fact name consolidation:
haftmann@54230
   463
    diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
haftmann@54250
   464
    minus_le_self_iff ~> neg_less_eq_nonneg
haftmann@54250
   465
    le_minus_self_iff ~> less_eq_neg_nonpos
haftmann@54250
   466
    neg_less_nonneg ~> neg_less_pos
haftmann@54250
   467
    less_minus_self_iff ~> less_neg_neg [simp]
haftmann@54230
   468
INCOMPATIBILITY.
haftmann@54230
   469
haftmann@54230
   470
* More simplification rules on unary and binary minus:
haftmann@54230
   471
add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
haftmann@54230
   472
add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
haftmann@54230
   473
add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
haftmann@54230
   474
le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
haftmann@54230
   475
minus_add_cancel, uminus_add_conv_diff.  These correspondingly
haftmann@54230
   476
have been taken away from fact collections algebra_simps and
haftmann@54230
   477
field_simps.  INCOMPATIBILITY.
haftmann@54230
   478
haftmann@54230
   479
To restore proofs, the following patterns are helpful:
haftmann@54230
   480
haftmann@54230
   481
a) Arbitrary failing proof not involving "diff_def":
haftmann@54230
   482
Consider simplification with algebra_simps or field_simps.
haftmann@54230
   483
haftmann@54230
   484
b) Lifting rules from addition to subtraction:
wenzelm@54893
   485
Try with "using <rule for addition> of [... "- _" ...]" by simp".
haftmann@54230
   486
haftmann@54230
   487
c) Simplification with "diff_def": just drop "diff_def".
haftmann@54230
   488
Consider simplification with algebra_simps or field_simps;
haftmann@54230
   489
or the brute way with
haftmann@54230
   490
"simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
haftmann@54230
   491
hoelzl@54264
   492
* SUP and INF generalized to conditionally_complete_lattice
hoelzl@54264
   493
hoelzl@54264
   494
* Theory Lubs moved HOL image to HOL-Library. It is replaced by
hoelzl@54264
   495
Conditionally_Complete_Lattices.   INCOMPATIBILITY.
hoelzl@54264
   496
hoelzl@54264
   497
* Introduce bdd_above and bdd_below in Conditionally_Complete_Lattices, use them
hoelzl@54264
   498
instead of explicitly stating boundedness of sets.
hoelzl@54264
   499
Andreas@54631
   500
* ccpo.admissible quantifies only over non-empty chains to allow
Andreas@54631
   501
more syntax-directed proof rules; the case of the empty chain
Andreas@54631
   502
shows up as additional case in fixpoint induction proofs.
Andreas@54631
   503
INCOMPATIBILITY
hoelzl@54264
   504
hoelzl@56214
   505
* Removed and renamed theorems in Series:
hoelzl@56214
   506
  summable_le         ~>  suminf_le
hoelzl@56214
   507
  suminf_le           ~>  suminf_le_const
hoelzl@56214
   508
  series_pos_le       ~>  setsum_le_suminf
hoelzl@56214
   509
  series_pos_less     ~>  setsum_less_suminf
hoelzl@56214
   510
  suminf_ge_zero      ~>  suminf_nonneg
hoelzl@56214
   511
  suminf_gt_zero      ~>  suminf_pos
hoelzl@56214
   512
  suminf_gt_zero_iff  ~>  suminf_pos_iff
hoelzl@56214
   513
  summable_sumr_LIMSEQ_suminf  ~>  summable_LIMSEQ
hoelzl@56214
   514
  suminf_0_le         ~>  suminf_nonneg [rotate]
hoelzl@56214
   515
  pos_summable        ~>  summableI_nonneg_bounded
hoelzl@56214
   516
  ratio_test          ~>  summable_ratio_test
hoelzl@56214
   517
hoelzl@56214
   518
  removed series_zero, replaced by sums_finite
hoelzl@56214
   519
hoelzl@56214
   520
  removed auxiliary lemmas:
hoelzl@56214
   521
    sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,
hoelzl@56214
   522
    half, le_Suc_ex_iff, lemma_realpow_diff_sumr, real_setsum_nat_ivl_bounded,
hoelzl@56214
   523
    summable_le2, ratio_test_lemma2, sumr_minus_one_realpow_zerom,
hoelzl@56214
   524
    sumr_one_lb_realpow_zero, summable_convergent_sumr_iff, sumr_diff_mult_const
hoelzl@56214
   525
INCOMPATIBILITY.
hoelzl@56214
   526
hoelzl@56214
   527
* Replace (F)DERIV syntax by has_derivative:
hoelzl@56214
   528
  - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"
hoelzl@56214
   529
hoelzl@56214
   530
  - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"
hoelzl@56214
   531
hoelzl@56214
   532
  - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax
hoelzl@56214
   533
hoelzl@56214
   534
  - removed constant isDiff
hoelzl@56214
   535
hoelzl@56214
   536
  - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as input
hoelzl@56214
   537
    syntax.
hoelzl@56214
   538
hoelzl@56214
   539
  - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed
hoelzl@56214
   540
hoelzl@56214
   541
  - Renamed FDERIV_... lemmas to has_derivative_...
hoelzl@56214
   542
hoelzl@56381
   543
  - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV
hoelzl@56381
   544
hoelzl@56381
   545
  - removed DERIV_intros, has_derivative_eq_intros
hoelzl@56381
   546
hoelzl@56381
   547
  - introduced derivative_intros and deriative_eq_intros which includes now rules for
hoelzl@56381
   548
    DERIV, has_derivative and has_vector_derivative.
hoelzl@56381
   549
hoelzl@56214
   550
  - Other renamings:
hoelzl@56214
   551
    differentiable_def        ~>  real_differentiable_def
hoelzl@56214
   552
    differentiableE           ~>  real_differentiableE
hoelzl@56214
   553
    fderiv_def                ~>  has_derivative_at
hoelzl@56214
   554
    field_fderiv_def          ~>  field_has_derivative_at
hoelzl@56214
   555
    isDiff_der                ~>  differentiable_def
hoelzl@56214
   556
    deriv_fderiv              ~>  has_field_derivative_def
hoelzl@56381
   557
    deriv_def                 ~>  DERIV_def
hoelzl@56214
   558
INCOMPATIBILITY.
hoelzl@56214
   559
hoelzl@56371
   560
* Include more theorems in continuous_intros. Remove the continuous_on_intros,
hoelzl@56371
   561
  isCont_intros collections, these facts are now in continuous_intros.
hoelzl@56371
   562
boehmes@55049
   563
* Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.
boehmes@55049
   564
wenzelm@54672
   565
* Nitpick:
wenzelm@54672
   566
  - Fixed soundness bug whereby mutually recursive datatypes could take
wenzelm@54672
   567
    infinite values.
blanchet@55889
   568
  - Fixed soundness bug with low-level number functions such as "Abs_Integ" and
blanchet@55889
   569
    "Rep_Integ".
blanchet@55889
   570
  - Removed "std" option.
blanchet@55889
   571
  - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to
blanchet@55889
   572
    "hide_types".
wenzelm@54672
   573
immler@54787
   574
* HOL-Multivariate_Analysis:
immler@54787
   575
  - type class ordered_real_vector for ordered vector spaces
immler@54787
   576
  - changed order of ordered_euclidean_space to be compatible with
immler@54787
   577
    pointwise ordering on products. Therefore instance of
immler@54787
   578
    conditionally_complete_lattice and ordered_real_vector.
immler@54787
   579
    INCOMPATIBILITY: use box instead of greaterThanLessThan or
immler@54787
   580
    explicit set-comprehensions with eucl_less for other (half-) open
immler@54787
   581
    intervals.
immler@54787
   582
hoelzl@56369
   583
  - renamed theorems:
hoelzl@56369
   584
    derivative_linear         ~>  has_derivative_bounded_linear
hoelzl@56369
   585
    derivative_is_linear      ~>  has_derivative_linear
hoelzl@56369
   586
    bounded_linear_imp_linear ~>  bounded_linear.linear
hoelzl@56369
   587
wenzelm@54672
   588
wenzelm@55622
   589
*** Scala ***
wenzelm@55622
   590
wenzelm@55622
   591
* The signature and semantics of Document.Snapshot.cumulate_markup /
wenzelm@55622
   592
select_markup have been clarified.  Markup is now traversed in the
wenzelm@55622
   593
order of reports given by the prover: later markup is usually more
wenzelm@55622
   594
specific and may override results accumulated so far.  The elements
wenzelm@55622
   595
guard is mandatory and checked precisely.  Subtle INCOMPATIBILITY.
wenzelm@55622
   596
wenzelm@55622
   597
wenzelm@54449
   598
*** ML ***
wenzelm@54449
   599
wenzelm@56303
   600
* Moved ML_Compiler.exn_trace and other operations on exceptions to
wenzelm@56303
   601
structure Runtime.  Minor INCOMPATIBILITY.
wenzelm@56303
   602
wenzelm@56279
   603
* Discontinued old Toplevel.debug in favour of system option
wenzelm@56279
   604
"ML_exception_trace", which may be also declared within the context via
wenzelm@56279
   605
"declare [[ML_exception_trace = true]]".  Minor INCOMPATIBILITY.
wenzelm@56279
   606
wenzelm@56281
   607
* Renamed configuration option "ML_trace" to "ML_source_trace". Minor
wenzelm@56281
   608
INCOMPATIBILITY.
wenzelm@56281
   609
wenzelm@56281
   610
* Configuration option "ML_print_depth" controls the pretty-printing
wenzelm@56281
   611
depth of the ML compiler within the context.  The old print_depth in
wenzelm@56285
   612
ML is still available as default_print_depth, but rarely used.  Minor
wenzelm@56285
   613
INCOMPATIBILITY.
wenzelm@56279
   614
wenzelm@55143
   615
* Proper context discipline for read_instantiate and instantiate_tac:
wenzelm@55143
   616
variables that are meant to become schematic need to be given as
wenzelm@55143
   617
fixed, and are generalized by the explicit context of local variables.
wenzelm@55143
   618
This corresponds to Isar attributes "where" and "of" with 'for'
wenzelm@55143
   619
declaration.  INCOMPATIBILITY, also due to potential change of indices
wenzelm@55143
   620
of schematic variables.
wenzelm@55143
   621
wenzelm@54449
   622
* Toplevel function "use" refers to raw ML bootstrap environment,
wenzelm@54449
   623
without Isar context nor antiquotations.  Potential INCOMPATIBILITY.
wenzelm@54449
   624
Note that 'ML_file' is the canonical command to load ML files into the
wenzelm@54449
   625
formal context.
wenzelm@54449
   626
wenzelm@54742
   627
* Proper context for basic Simplifier operations: rewrite_rule,
wenzelm@54742
   628
rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to
wenzelm@54742
   629
pass runtime Proof.context (and ensure that the simplified entity
wenzelm@54742
   630
actually belongs to it).
wenzelm@54742
   631
wenzelm@55547
   632
* Subtle change of semantics of Thm.eq_thm: theory stamps are not
wenzelm@55547
   633
compared (according to Thm.thm_ord), but assumed to be covered by the
wenzelm@55547
   634
current background theory.  Thus equivalent data produced in different
wenzelm@55547
   635
branches of the theory graph usually coincides (e.g. relevant for
wenzelm@55547
   636
theory merge).  Note that the softer Thm.eq_thm_prop is often more
wenzelm@55547
   637
appropriate than Thm.eq_thm.
wenzelm@55547
   638
wenzelm@56205
   639
* Simplified programming interface to define ML antiquotations, see
wenzelm@56205
   640
structure ML_Antiquotation.  Minor INCOMPATIBILITY.
wenzelm@56069
   641
wenzelm@56071
   642
* ML antiquotation @{here} refers to its source position, which is
wenzelm@56071
   643
occasionally useful for experimentation and diagnostic purposes.
wenzelm@56071
   644
wenzelm@56135
   645
* ML antiquotation @{path} produces a Path.T value, similarly to
wenzelm@56135
   646
Path.explode, but with compile-time check against the file-system and
wenzelm@56135
   647
some PIDE markup.  Note that unlike theory source, ML does not have a
wenzelm@56135
   648
well-defined master directory, so an absolute symbolic path
wenzelm@56135
   649
specification is usually required, e.g. "~~/src/HOL".
wenzelm@56135
   650
wenzelm@56399
   651
* ML antiquotation @{print} inlines a function to print an arbitrary
wenzelm@56399
   652
ML value, which is occasionally useful for diagnostic or demonstration
wenzelm@56399
   653
purposes.
wenzelm@56399
   654
wenzelm@54449
   655
wenzelm@54683
   656
*** System ***
wenzelm@54683
   657
wenzelm@54683
   658
* Simplified "isabelle display" tool.  Settings variables DVI_VIEWER
wenzelm@54683
   659
and PDF_VIEWER now refer to the actual programs, not shell
wenzelm@54683
   660
command-lines.  Discontinued option -c: invocation may be asynchronous
wenzelm@54683
   661
via desktop environment, without any special precautions.  Potential
wenzelm@54683
   662
INCOMPATIBILITY with ambitious private settings.
wenzelm@54683
   663
wenzelm@54683
   664
* Improved 'display_drafts' concerning desktop integration and
wenzelm@54683
   665
repeated invocation in PIDE front-end: re-use single file
wenzelm@54683
   666
$ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.
wenzelm@54683
   667
wenzelm@56439
   668
* The raw Isabelle process executable has been renamed from
wenzelm@56439
   669
"isabelle-process" to "isabelle_process", which conforms to common
wenzelm@56439
   670
shell naming conventions, and allows to define a shell function within
wenzelm@56439
   671
the Isabelle environment to avoid dynamic path lookup.  Rare
wenzelm@56439
   672
incompatibility for old tools that do not use the $ISABELLE_PROCESS
wenzelm@56439
   673
settings variable yet.
wenzelm@56439
   674
wenzelm@54683
   675
wenzelm@54449
   676
wenzelm@54639
   677
New in Isabelle2013-2 (December 2013)
wenzelm@54639
   678
-------------------------------------
wenzelm@54639
   679
wenzelm@54639
   680
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@54639
   681
wenzelm@54639
   682
* More robust editing of running commands with internal forks,
wenzelm@54639
   683
e.g. non-terminating 'by' steps.
wenzelm@54639
   684
wenzelm@54641
   685
* More relaxed Sledgehammer panel: avoid repeated application of query
wenzelm@54641
   686
after edits surrounding the command location.
wenzelm@54641
   687
wenzelm@54648
   688
* More status information about commands that are interrupted
wenzelm@54648
   689
accidentally (via physical event or Poly/ML runtime system signal,
wenzelm@54648
   690
e.g. out-of-memory).
wenzelm@54648
   691
wenzelm@54653
   692
wenzelm@54653
   693
*** System ***
wenzelm@54653
   694
wenzelm@54653
   695
* More robust termination of external processes managed by
wenzelm@54664
   696
Isabelle/ML: support cancellation of tasks within the range of
wenzelm@54664
   697
milliseconds, as required for PIDE document editing with automatically
wenzelm@54664
   698
tried tools (e.g. Sledgehammer).
wenzelm@54653
   699
wenzelm@54648
   700
* Reactivated Isabelle/Scala kill command for external processes on
wenzelm@54648
   701
Mac OS X, which was accidentally broken in Isabelle2013-1 due to a
wenzelm@54648
   702
workaround for some Debian/Ubuntu Linux versions from 2013.
wenzelm@54648
   703
wenzelm@54639
   704
wenzelm@54639
   705
wenzelm@53971
   706
New in Isabelle2013-1 (November 2013)
wenzelm@53971
   707
-------------------------------------
wenzelm@50994
   708
wenzelm@51293
   709
*** General ***
wenzelm@51293
   710
wenzelm@53971
   711
* Discontinued obsolete 'uses' within theory header.  Note that
wenzelm@53971
   712
commands like 'ML_file' work without separate declaration of file
wenzelm@53971
   713
dependencies.  Minor INCOMPATIBILITY.
wenzelm@53971
   714
wenzelm@53971
   715
* Discontinued redundant 'use' command, which was superseded by
wenzelm@53971
   716
'ML_file' in Isabelle2013.  Minor INCOMPATIBILITY.
wenzelm@53971
   717
wenzelm@53016
   718
* Simplified subscripts within identifiers, using plain \<^sub>
wenzelm@53016
   719
instead of the second copy \<^isub> and \<^isup>.  Superscripts are
wenzelm@53016
   720
only for literal tokens within notation; explicit mixfix annotations
wenzelm@53016
   721
for consts or fixed variables may be used as fall-back for unusual
wenzelm@53016
   722
names.  Obsolete \<twosuperior> has been expanded to \<^sup>2 in
wenzelm@53016
   723
Isabelle/HOL.  INCOMPATIBILITY, use "isabelle update_sub_sup" to
wenzelm@53016
   724
standardize symbols as a starting point for further manual cleanup.
wenzelm@53016
   725
The ML reference variable "legacy_isub_isup" may be set as temporary
wenzelm@53016
   726
workaround, to make the prover accept a subset of the old identifier
wenzelm@53016
   727
syntax.
wenzelm@53016
   728
wenzelm@53021
   729
* Document antiquotations: term style "isub" has been renamed to
wenzelm@53021
   730
"sub".  Minor INCOMPATIBILITY.
wenzelm@53021
   731
wenzelm@52487
   732
* Uniform management of "quick_and_dirty" as system option (see also
wenzelm@52487
   733
"isabelle options"), configuration option within the context (see also
wenzelm@52487
   734
Config.get in Isabelle/ML), and attribute in Isabelle/Isar.  Minor
wenzelm@52487
   735
INCOMPATIBILITY, need to use more official Isabelle means to access
wenzelm@52487
   736
quick_and_dirty, instead of historical poking into mutable reference.
wenzelm@52059
   737
wenzelm@52060
   738
* Renamed command 'print_configs' to 'print_options'.  Minor
wenzelm@52060
   739
INCOMPATIBILITY.
wenzelm@52060
   740
wenzelm@52430
   741
* Proper diagnostic command 'print_state'.  Old 'pr' (with its
wenzelm@52430
   742
implicit change of some global references) is retained for now as
wenzelm@52430
   743
control command, e.g. for ProofGeneral 3.7.x.
wenzelm@52430
   744
wenzelm@52549
   745
* Discontinued 'print_drafts' command with its old-fashioned PS output
wenzelm@52549
   746
and Unix command-line print spooling.  Minor INCOMPATIBILITY: use
wenzelm@52549
   747
'display_drafts' instead and print via the regular document viewer.
wenzelm@52549
   748
wenzelm@53971
   749
* Updated and extended "isar-ref" and "implementation" manual,
wenzelm@53971
   750
eliminated old "ref" manual.
wenzelm@53971
   751
wenzelm@51293
   752
wenzelm@51533
   753
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@51533
   754
wenzelm@53971
   755
* New manual "jedit" for Isabelle/jEdit, see isabelle doc or
wenzelm@53852
   756
Documentation panel.
wenzelm@53852
   757
wenzelm@53971
   758
* Dockable window "Documentation" provides access to Isabelle
wenzelm@53971
   759
documentation.
wenzelm@52646
   760
wenzelm@52949
   761
* Dockable window "Find" provides query operations for formal entities
wenzelm@52949
   762
(GUI front-end to 'find_theorems' command).
wenzelm@52949
   763
wenzelm@53050
   764
* Dockable window "Sledgehammer" manages asynchronous / parallel
wenzelm@53050
   765
sledgehammer runs over existing document sources, independently of
wenzelm@53050
   766
normal editing and checking process.
wenzelm@53050
   767
wenzelm@51533
   768
* Dockable window "Timing" provides an overview of relevant command
wenzelm@54332
   769
timing information, depending on option jedit_timing_threshold.  The
wenzelm@54332
   770
same timing information is shown in the extended tooltip of the
wenzelm@54332
   771
command keyword, when hovering the mouse over it while the CONTROL or
wenzelm@54332
   772
COMMAND modifier is pressed.
wenzelm@51533
   773
wenzelm@53971
   774
* Improved dockable window "Theories": Continuous checking of proof
wenzelm@53971
   775
document (visible and required parts) may be controlled explicitly,
wenzelm@53971
   776
using check box or shortcut "C+e ENTER".  Individual theory nodes may
wenzelm@53971
   777
be marked explicitly as required and checked in full, using check box
wenzelm@53971
   778
or shortcut "C+e SPACE".
wenzelm@53971
   779
wenzelm@54305
   780
* Improved completion mechanism, which is now managed by the
wenzelm@54305
   781
Isabelle/jEdit plugin instead of SideKick.  Refined table of Isabelle
wenzelm@54305
   782
symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
wenzelm@54305
   783
wenzelm@54319
   784
* Standard jEdit keyboard shortcut C+b complete-word is remapped to
wenzelm@54319
   785
isabelle.complete for explicit completion in Isabelle sources.
wenzelm@54319
   786
INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
wenzelm@54319
   787
to resolve conflict.
wenzelm@54319
   788
wenzelm@54305
   789
* Improved support of various "minor modes" for Isabelle NEWS,
wenzelm@54305
   790
options, session ROOT etc., with completion and SideKick tree view.
wenzelm@54305
   791
wenzelm@53971
   792
* Strictly monotonic document update, without premature cancellation of
wenzelm@53971
   793
running transactions that are still needed: avoid reset/restart of
wenzelm@53971
   794
such command executions while editing.
wenzelm@53271
   795
wenzelm@53971
   796
* Support for asynchronous print functions, as overlay to existing
wenzelm@53971
   797
document content.
wenzelm@53971
   798
wenzelm@53971
   799
* Support for automatic tools in HOL, which try to prove or disprove
wenzelm@53971
   800
toplevel theorem statements.
wenzelm@53971
   801
wenzelm@53971
   802
* Action isabelle.reset-font-size resets main text area font size
wenzelm@54365
   803
according to Isabelle/Scala plugin option "jedit_font_reset_size" (see
wenzelm@54365
   804
also "Plugin Options / Isabelle / General").  It can be bound to some
wenzelm@54365
   805
keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).
wenzelm@53971
   806
wenzelm@53971
   807
* File specifications in jEdit (e.g. file browser) may refer to
wenzelm@54351
   808
$ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms.  Discontinued
wenzelm@54351
   809
obsolete $ISABELLE_HOME_WINDOWS variable.
wenzelm@53971
   810
wenzelm@53971
   811
* Improved support for Linux look-and-feel "GTK+", see also "Utilities
wenzelm@53971
   812
/ Global Options / Appearance".
wenzelm@53971
   813
wenzelm@53971
   814
* Improved support of native Mac OS X functionality via "MacOSX"
wenzelm@53971
   815
plugin, which is now enabled by default.
wenzelm@53971
   816
wenzelm@51533
   817
wenzelm@51313
   818
*** Pure ***
wenzelm@51313
   819
ballarin@54049
   820
* Commands 'interpretation' and 'sublocale' are now target-sensitive.
ballarin@54049
   821
In particular, 'interpretation' allows for non-persistent
ballarin@54049
   822
interpretation within "context ... begin ... end" blocks offering a
ballarin@54049
   823
light-weight alternative to 'sublocale'.  See "isar-ref" manual for
ballarin@54049
   824
details.
haftmann@51747
   825
ballarin@51565
   826
* Improved locales diagnostic command 'print_dependencies'.
ballarin@51565
   827
wenzelm@51313
   828
* Discontinued obsolete 'axioms' command, which has been marked as
wenzelm@51313
   829
legacy since Isabelle2009-2.  INCOMPATIBILITY, use 'axiomatization'
wenzelm@51313
   830
instead, while observing its uniform scope for polymorphism.
wenzelm@51313
   831
wenzelm@51316
   832
* Discontinued empty name bindings in 'axiomatization'.
wenzelm@51316
   833
INCOMPATIBILITY.
wenzelm@51316
   834
wenzelm@53971
   835
* System option "proofs" has been discontinued.  Instead the global
wenzelm@53971
   836
state of Proofterm.proofs is persistently compiled into logic images
wenzelm@53971
   837
as required, notably HOL-Proofs.  Users no longer need to change
wenzelm@53971
   838
Proofterm.proofs dynamically.  Minor INCOMPATIBILITY.
wenzelm@53971
   839
wenzelm@53971
   840
* Syntax translation functions (print_translation etc.) always depend
wenzelm@53971
   841
on Proof.context.  Discontinued former "(advanced)" option -- this is
wenzelm@53971
   842
now the default.  Minor INCOMPATIBILITY.
wenzelm@53971
   843
wenzelm@53971
   844
* Former global reference trace_unify_fail is now available as
wenzelm@53971
   845
configuration option "unify_trace_failure" (global context only).
wenzelm@53971
   846
wenzelm@52463
   847
* SELECT_GOAL now retains the syntactic context of the overall goal
wenzelm@52463
   848
state (schematic variables etc.).  Potential INCOMPATIBILITY in rare
wenzelm@52463
   849
situations.
wenzelm@52463
   850
wenzelm@51313
   851
hoelzl@51002
   852
*** HOL ***
hoelzl@51002
   853
wenzelm@54032
   854
* Stronger precedence of syntax for big intersection and union on
wenzelm@54032
   855
sets, in accordance with corresponding lattice operations.
wenzelm@54032
   856
INCOMPATIBILITY.
wenzelm@54032
   857
wenzelm@54032
   858
* Notation "{p:A. P}" now allows tuple patterns as well.
wenzelm@54032
   859
wenzelm@54032
   860
* Nested case expressions are now translated in a separate check phase
wenzelm@54032
   861
rather than during parsing. The data for case combinators is separated
wenzelm@54032
   862
from the datatype package. The declaration attribute
wenzelm@54032
   863
"case_translation" can be used to register new case combinators:
wenzelm@54032
   864
wenzelm@54032
   865
  declare [[case_translation case_combinator constructor1 ... constructorN]]
haftmann@52637
   866
haftmann@52435
   867
* Code generator:
wenzelm@53160
   868
  - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
wenzelm@53160
   869
    'code_instance'.
wenzelm@53160
   870
  - 'code_identifier' declares name hints for arbitrary identifiers in
wenzelm@53160
   871
    generated code, subsuming 'code_modulename'.
wenzelm@53983
   872
wenzelm@53983
   873
See the isar-ref manual for syntax diagrams, and the HOL theories for
wenzelm@53983
   874
examples.
haftmann@52435
   875
wenzelm@54032
   876
* Attibute 'code': 'code' now declares concrete and abstract code
wenzelm@54032
   877
equations uniformly.  Use explicit 'code equation' and 'code abstract'
wenzelm@54032
   878
to distinguish both when desired.
wenzelm@54032
   879
wenzelm@54032
   880
* Discontinued theories Code_Integer and Efficient_Nat by a more
wenzelm@54032
   881
fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
wenzelm@54032
   882
Code_Target_Nat and Code_Target_Numeral.  See the tutorial on code
wenzelm@54032
   883
generation for details.  INCOMPATIBILITY.
wenzelm@54032
   884
wenzelm@54032
   885
* Numeric types are mapped by default to target language numerals:
wenzelm@54032
   886
natural (replaces former code_numeral) and integer (replaces former
wenzelm@54032
   887
code_int).  Conversions are available as integer_of_natural /
wenzelm@54032
   888
natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
wenzelm@54032
   889
Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
wenzelm@54032
   890
ML).  INCOMPATIBILITY.
wenzelm@54032
   891
wenzelm@54032
   892
* Function package: For mutually recursive functions f and g, separate
wenzelm@54032
   893
cases rules f.cases and g.cases are generated instead of unusable
wenzelm@54032
   894
f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
wenzelm@54032
   895
in the case that the unusable rule was used nevertheless.
wenzelm@54032
   896
wenzelm@54032
   897
* Function package: For each function f, new rules f.elims are
wenzelm@54032
   898
generated, which eliminate equalities of the form "f x = t".
wenzelm@54032
   899
wenzelm@54032
   900
* New command 'fun_cases' derives ad-hoc elimination rules for
wenzelm@54032
   901
function equations as simplified instances of f.elims, analogous to
wenzelm@54032
   902
inductive_cases.  See ~~/src/HOL/ex/Fundefs.thy for some examples.
blanchet@53307
   903
kuncar@54021
   904
* Lifting:
kuncar@54021
   905
  - parametrized correspondence relations are now supported:
wenzelm@54378
   906
    + parametricity theorems for the raw term can be specified in
kuncar@54021
   907
      the command lift_definition, which allow us to generate stronger
kuncar@54021
   908
      transfer rules
kuncar@54021
   909
    + setup_lifting generates stronger transfer rules if parametric
kuncar@54021
   910
      correspondence relation can be generated
kuncar@54021
   911
    + various new properties of the relator must be specified to support
kuncar@54021
   912
      parametricity
kuncar@54021
   913
    + parametricity theorem for the Quotient relation can be specified
kuncar@54021
   914
  - setup_lifting generates domain rules for the Transfer package
kuncar@54021
   915
  - stronger reflexivity prover of respectfulness theorems for type
kuncar@54021
   916
    copies
kuncar@54021
   917
  - ===> and --> are now local. The symbols can be introduced
kuncar@54021
   918
    by interpreting the locale lifting_syntax (typically in an
kuncar@54021
   919
    anonymous context)
wenzelm@54378
   920
  - Lifting/Transfer relevant parts of Library/Quotient_* are now in
kuncar@54021
   921
    Main. Potential INCOMPATIBILITY
kuncar@54021
   922
  - new commands for restoring and deleting Lifting/Transfer context:
kuncar@54021
   923
    lifting_forget, lifting_update
wenzelm@54378
   924
  - the command print_quotmaps was renamed to print_quot_maps.
kuncar@54021
   925
    INCOMPATIBILITY
kuncar@54021
   926
kuncar@54021
   927
* Transfer:
wenzelm@54378
   928
  - better support for domains in Transfer: replace Domainp T
kuncar@54021
   929
    by the actual invariant in a transferred goal
kuncar@54021
   930
  - transfer rules can have as assumptions other transfer rules
kuncar@54021
   931
  - Experimental support for transferring from the raw level to the
kuncar@54021
   932
    abstract level: Transfer.transferred attribute
kuncar@54021
   933
  - Attribute version of the transfer method: untransferred attribute
kuncar@54021
   934
haftmann@52286
   935
* Reification and reflection:
wenzelm@53160
   936
  - Reification is now directly available in HOL-Main in structure
wenzelm@53160
   937
    "Reification".
wenzelm@53160
   938
  - Reflection now handles multiple lists with variables also.
wenzelm@53160
   939
  - The whole reflection stack has been decomposed into conversions.
haftmann@52286
   940
INCOMPATIBILITY.
haftmann@52286
   941
haftmann@51489
   942
* Revised devices for recursive definitions over finite sets:
haftmann@51489
   943
  - Only one fundamental fold combinator on finite set remains:
haftmann@51489
   944
    Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
haftmann@51489
   945
    This is now identity on infinite sets.
wenzelm@52745
   946
  - Locales ("mini packages") for fundamental definitions with
haftmann@51489
   947
    Finite_Set.fold: folding, folding_idem.
haftmann@51489
   948
  - Locales comm_monoid_set, semilattice_order_set and
haftmann@51489
   949
    semilattice_neutr_order_set for big operators on sets.
haftmann@51489
   950
    See theory Big_Operators for canonical examples.
haftmann@51489
   951
    Note that foundational constants comm_monoid_set.F and
haftmann@51489
   952
    semilattice_set.F correspond to former combinators fold_image
haftmann@51489
   953
    and fold1 respectively.  These are now gone.  You may use
haftmann@51490
   954
    those foundational constants as substitutes, but it is
wenzelm@53983
   955
    preferable to interpret the above locales accordingly.
haftmann@51489
   956
  - Dropped class ab_semigroup_idem_mult (special case of lattice,
haftmann@51489
   957
    no longer needed in connection with Finite_Set.fold etc.)
haftmann@51489
   958
  - Fact renames:
haftmann@51489
   959
      card.union_inter ~> card_Un_Int [symmetric]
haftmann@51489
   960
      card.union_disjoint ~> card_Un_disjoint
haftmann@51489
   961
INCOMPATIBILITY.
haftmann@51489
   962
haftmann@51487
   963
* Locale hierarchy for abstract orderings and (semi)lattices.
haftmann@51487
   964
wenzelm@53526
   965
* Complete_Partial_Order.admissible is defined outside the type class
wenzelm@53526
   966
ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
wenzelm@53526
   967
class predicate assumption or sort constraint when possible.
Andreas@53362
   968
INCOMPATIBILITY.
Andreas@53362
   969
wenzelm@53160
   970
* Introduce type class "conditionally_complete_lattice": Like a
wenzelm@53160
   971
complete lattice but does not assume the existence of the top and
wenzelm@53160
   972
bottom elements.  Allows to generalize some lemmas about reals and
wenzelm@53160
   973
extended reals.  Removed SupInf and replaced it by the instantiation
wenzelm@53160
   974
of conditionally_complete_lattice for real. Renamed lemmas about
wenzelm@53160
   975
conditionally-complete lattice from Sup_... to cSup_... and from
wenzelm@53160
   976
Inf_...  to cInf_... to avoid hidding of similar complete lattice
wenzelm@53160
   977
lemmas.
wenzelm@53160
   978
wenzelm@53160
   979
* Introduce type class linear_continuum as combination of
wenzelm@53160
   980
conditionally-complete lattices and inner dense linorders which have
wenzelm@53160
   981
more than one element.  INCOMPATIBILITY.
wenzelm@53160
   982
wenzelm@53983
   983
* Introduced type classes order_top and order_bot. The old classes top
wenzelm@53983
   984
and bot only contain the syntax without assumptions.  INCOMPATIBILITY:
wenzelm@53983
   985
Rename bot -> order_bot, top -> order_top
lammich@53683
   986
wenzelm@53160
   987
* Introduce type classes "no_top" and "no_bot" for orderings without
wenzelm@53160
   988
top and bottom elements.
hoelzl@51732
   989
hoelzl@51732
   990
* Split dense_linorder into inner_dense_order and no_top, no_bot.
hoelzl@51732
   991
hoelzl@51732
   992
* Complex_Main: Unify and move various concepts from
wenzelm@53160
   993
HOL-Multivariate_Analysis to HOL-Complex_Main.
hoelzl@51732
   994
wenzelm@53983
   995
 - Introduce type class (lin)order_topology and
wenzelm@53983
   996
   linear_continuum_topology.  Allows to generalize theorems about
wenzelm@53983
   997
   limits and order.  Instances are reals and extended reals.
hoelzl@51732
   998
hoelzl@51732
   999
 - continuous and continuos_on from Multivariate_Analysis:
wenzelm@53983
  1000
   "continuous" is the continuity of a function at a filter.  "isCont"
wenzelm@53983
  1001
   is now an abbrevitation: "isCont x f == continuous (at _) f".
wenzelm@53983
  1002
wenzelm@53983
  1003
   Generalized continuity lemmas from isCont to continuous on an
wenzelm@53983
  1004
   arbitrary filter.
wenzelm@53983
  1005
wenzelm@53983
  1006
 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
wenzelm@53983
  1007
   compactness of closed intervals on reals. Continuous functions
wenzelm@53983
  1008
   attain infimum and supremum on compact sets. The inverse of a
wenzelm@53983
  1009
   continuous function is continuous, when the function is continuous
wenzelm@53983
  1010
   on a compact set.
hoelzl@51732
  1011
hoelzl@51732
  1012
 - connected from Multivariate_Analysis. Use it to prove the
hoelzl@51775
  1013
   intermediate value theorem. Show connectedness of intervals on
hoelzl@51775
  1014
   linear_continuum_topology).
hoelzl@51732
  1015
hoelzl@51732
  1016
 - first_countable_topology from Multivariate_Analysis. Is used to
wenzelm@53983
  1017
   show equivalence of properties on the neighbourhood filter of x and
wenzelm@53983
  1018
   on all sequences converging to x.
wenzelm@53983
  1019
wenzelm@53983
  1020
 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
wenzelm@53983
  1021
   theorems from Library/FDERIV.thy to Deriv.thy and base the
wenzelm@53983
  1022
   definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
wenzelm@53983
  1023
   which are restricted to sets, i.e. to represent derivatives from
wenzelm@53983
  1024
   left or right.
hoelzl@51732
  1025
hoelzl@51732
  1026
 - Removed the within-filter. It is replaced by the principal filter:
hoelzl@51732
  1027
hoelzl@51732
  1028
     F within X = inf F (principal X)
hoelzl@51732
  1029
hoelzl@51732
  1030
 - Introduce "at x within U" as a single constant, "at x" is now an
hoelzl@51732
  1031
   abbreviation for "at x within UNIV"
hoelzl@51732
  1032
wenzelm@53983
  1033
 - Introduce named theorem collections tendsto_intros,
wenzelm@53983
  1034
   continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
wenzelm@53983
  1035
   in tendsto_intros (or FDERIV_intros) are also available as
wenzelm@53983
  1036
   tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
wenzelm@53983
  1037
   is replaced by a congruence rule. This allows to apply them as
wenzelm@53983
  1038
   intro rules and then proving equivalence by the simplifier.
hoelzl@51732
  1039
hoelzl@51732
  1040
 - Restructured theories in HOL-Complex_Main:
hoelzl@51732
  1041
hoelzl@51732
  1042
   + Moved RealDef and RComplete into Real
hoelzl@51732
  1043
hoelzl@51732
  1044
   + Introduced Topological_Spaces and moved theorems about
hoelzl@51732
  1045
     topological spaces, filters, limits and continuity to it
hoelzl@51732
  1046
hoelzl@51732
  1047
   + Renamed RealVector to Real_Vector_Spaces
hoelzl@51732
  1048
wenzelm@53983
  1049
   + Split Lim, SEQ, Series into Topological_Spaces,
wenzelm@53983
  1050
     Real_Vector_Spaces, and Limits
hoelzl@51732
  1051
hoelzl@51732
  1052
   + Moved Ln and Log to Transcendental
hoelzl@51732
  1053
hoelzl@51732
  1054
   + Moved theorems about continuity from Deriv to Topological_Spaces
hoelzl@51732
  1055
hoelzl@51732
  1056
 - Remove various auxiliary lemmas.
hoelzl@51732
  1057
hoelzl@51732
  1058
INCOMPATIBILITY.
hoelzl@51002
  1059
blanchet@53738
  1060
* Nitpick:
blanchet@55889
  1061
  - Added option "spy".
blanchet@55889
  1062
  - Reduce incidence of "too high arity" errors.
blanchet@53738
  1063
blanchet@51137
  1064
* Sledgehammer:
blanchet@51137
  1065
  - Renamed option:
blanchet@51137
  1066
      isar_shrink ~> isar_compress
blanchet@53738
  1067
    INCOMPATIBILITY.
blanchet@55889
  1068
  - Added options "isar_try0", "spy".
blanchet@55889
  1069
  - Better support for "isar_proofs".
blanchet@55889
  1070
  - MaSh has been fined-tuned and now runs as a local server.
blanchet@51137
  1071
wenzelm@54032
  1072
* Improved support for ad hoc overloading of constants (see also
wenzelm@54032
  1073
isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
wenzelm@54032
  1074
wenzelm@54032
  1075
* Library/Polynomial.thy:
wenzelm@54032
  1076
  - Use lifting for primitive definitions.
wenzelm@54032
  1077
  - Explicit conversions from and to lists of coefficients, used for
wenzelm@54032
  1078
    generated code.
wenzelm@54032
  1079
  - Replaced recursion operator poly_rec by fold_coeffs.
wenzelm@54032
  1080
  - Prefer pre-existing gcd operation for gcd.
wenzelm@54032
  1081
  - Fact renames:
wenzelm@54032
  1082
    poly_eq_iff ~> poly_eq_poly_eq_iff
wenzelm@54032
  1083
    poly_ext ~> poly_eqI
wenzelm@54032
  1084
    expand_poly_eq ~> poly_eq_iff
wenzelm@54032
  1085
IMCOMPATIBILITY.
wenzelm@54032
  1086
wenzelm@54032
  1087
* New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
wenzelm@54032
  1088
case_of_simps to convert function definitions between a list of
wenzelm@54032
  1089
equations with patterns on the lhs and a single equation with case
wenzelm@54032
  1090
expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
wenzelm@54032
  1091
wenzelm@54032
  1092
* New Library/FSet.thy: type of finite sets defined as a subtype of
wenzelm@54032
  1093
sets defined by Lifting/Transfer.
wenzelm@54032
  1094
wenzelm@54032
  1095
* Discontinued theory src/HOL/Library/Eval_Witness.  INCOMPATIBILITY.
wenzelm@54032
  1096
wenzelm@54032
  1097
* Consolidation of library theories on product orders:
wenzelm@54032
  1098
wenzelm@54032
  1099
    Product_Lattice ~> Product_Order -- pointwise order on products
wenzelm@54032
  1100
    Product_ord ~> Product_Lexorder -- lexicographic order on products
wenzelm@54032
  1101
wenzelm@54032
  1102
INCOMPATIBILITY.
wenzelm@54032
  1103
wenzelm@53160
  1104
* Imperative-HOL: The MREC combinator is considered legacy and no
wenzelm@53160
  1105
longer included by default. INCOMPATIBILITY, use partial_function
wenzelm@53160
  1106
instead, or import theory Legacy_Mrec as a fallback.
wenzelm@53160
  1107
wenzelm@53983
  1108
* HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
wenzelm@53983
  1109
~~/src/HOL/Algebra/poly.  Existing theories should be based on
wenzelm@53983
  1110
~~/src/HOL/Library/Polynomial instead.  The latter provides
wenzelm@53983
  1111
integration with HOL's type classes for rings.  INCOMPATIBILITY.
ballarin@51517
  1112
wenzelm@54033
  1113
* HOL-BNF:
wenzelm@54032
  1114
  - Various improvements to BNF-based (co)datatype package, including
wenzelm@54032
  1115
    new commands "primrec_new", "primcorec", and
wenzelm@54032
  1116
    "datatype_new_compat", as well as documentation. See
wenzelm@54032
  1117
    "datatypes.pdf" for details.
wenzelm@54032
  1118
  - New "coinduction" method to avoid some boilerplate (compared to
wenzelm@54032
  1119
    coinduct).
wenzelm@54032
  1120
  - Renamed keywords:
wenzelm@54032
  1121
    data ~> datatype_new
wenzelm@54032
  1122
    codata ~> codatatype
wenzelm@54032
  1123
    bnf_def ~> bnf
wenzelm@54032
  1124
  - Renamed many generated theorems, including
wenzelm@54032
  1125
    discs ~> disc
wenzelm@54032
  1126
    map_comp' ~> map_comp
wenzelm@54032
  1127
    map_id' ~> map_id
wenzelm@54032
  1128
    sels ~> sel
wenzelm@54032
  1129
    set_map' ~> set_map
wenzelm@54032
  1130
    sets ~> set
wenzelm@54032
  1131
IMCOMPATIBILITY.
wenzelm@54032
  1132
ballarin@51517
  1133
wenzelm@51551
  1134
*** ML ***
wenzelm@51551
  1135
wenzelm@53971
  1136
* Spec_Check is a Quickcheck tool for Isabelle/ML.  The ML function
wenzelm@53971
  1137
"check_property" allows to check specifications of the form "ALL x y
wenzelm@53971
  1138
z. prop x y z".  See also ~~/src/Tools/Spec_Check/ with its
wenzelm@53971
  1139
Examples.thy in particular.
wenzelm@53971
  1140
wenzelm@53709
  1141
* Improved printing of exception trace in Poly/ML 5.5.1, with regular
wenzelm@53709
  1142
tracing output in the command transaction context instead of physical
wenzelm@53709
  1143
stdout.  See also Toplevel.debug, Toplevel.debugging and
wenzelm@53709
  1144
ML_Compiler.exn_trace.
wenzelm@53709
  1145
wenzelm@53971
  1146
* ML type "theory" is now immutable, without any special treatment of
wenzelm@53971
  1147
drafts or linear updates (which could lead to "stale theory" errors in
wenzelm@53971
  1148
the past).  Discontinued obsolete operations like Theory.copy,
wenzelm@53971
  1149
Theory.checkpoint, and the auxiliary type theory_ref.  Minor
wenzelm@53971
  1150
INCOMPATIBILITY.
wenzelm@53164
  1151
wenzelm@51551
  1152
* More uniform naming of goal functions for skipped proofs:
wenzelm@51551
  1153
wenzelm@51551
  1154
    Skip_Proof.prove  ~>  Goal.prove_sorry
wenzelm@51551
  1155
    Skip_Proof.prove_global  ~>  Goal.prove_sorry_global
wenzelm@51551
  1156
wenzelm@53971
  1157
Minor INCOMPATIBILITY.
wenzelm@51703
  1158
wenzelm@51717
  1159
* Simplifier tactics and tools use proper Proof.context instead of
wenzelm@51717
  1160
historic type simpset.  Old-style declarations like addsimps,
wenzelm@51717
  1161
addsimprocs etc. operate directly on Proof.context.  Raw type simpset
wenzelm@51717
  1162
retains its use as snapshot of the main Simplifier context, using
wenzelm@51717
  1163
simpset_of and put_simpset on Proof.context.  INCOMPATIBILITY -- port
wenzelm@51717
  1164
old tools by making them depend on (ctxt : Proof.context) instead of
wenzelm@51717
  1165
(ss : simpset), then turn (simpset_of ctxt) into ctxt.
wenzelm@51717
  1166
wenzelm@53971
  1167
* Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
wenzelm@53971
  1168
operate on Proof.context instead of claset, for uniformity with addIs,
wenzelm@53971
  1169
addEs, addDs etc. Note that claset_of and put_claset allow to manage
wenzelm@53971
  1170
clasets separately from the context.
wenzelm@53971
  1171
wenzelm@51717
  1172
* Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
wenzelm@51717
  1173
INCOMPATIBILITY, use @{context} instead.
wenzelm@51717
  1174
wenzelm@53971
  1175
* Antiquotation @{theory_context A} is similar to @{theory A}, but
wenzelm@53971
  1176
presents the result as initial Proof.context.
wenzelm@53971
  1177
wenzelm@51551
  1178
wenzelm@51398
  1179
*** System ***
wenzelm@51398
  1180
wenzelm@52052
  1181
* Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
wenzelm@52052
  1182
"isabelle build" in Isabelle2013.  INCOMPATIBILITY.
wenzelm@51398
  1183
wenzelm@52054
  1184
* Discontinued obsolete isabelle-process options -f and -u (former
wenzelm@52054
  1185
administrative aliases of option -e).  Minor INCOMPATIBILITY.
wenzelm@52054
  1186
wenzelm@52550
  1187
* Discontinued obsolete isabelle print tool, and PRINT_COMMAND
wenzelm@52550
  1188
settings variable.
wenzelm@52550
  1189
wenzelm@52746
  1190
* Discontinued ISABELLE_DOC_FORMAT settings variable and historic
wenzelm@52746
  1191
document formats: dvi.gz, ps, ps.gz -- the default document format is
wenzelm@52746
  1192
always pdf.
wenzelm@52743
  1193
wenzelm@52053
  1194
* Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
wenzelm@52053
  1195
specify global resources of the JVM process run by isabelle build.
wenzelm@52053
  1196
wenzelm@52116
  1197
* Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
wenzelm@52116
  1198
to run Isabelle/Scala source files as standalone programs.
wenzelm@52116
  1199
wenzelm@52439
  1200
* Improved "isabelle keywords" tool (for old-style ProofGeneral
wenzelm@52439
  1201
keyword tables): use Isabelle/Scala operations, which inspect outer
wenzelm@52439
  1202
syntax without requiring to build sessions first.
wenzelm@52439
  1203
wenzelm@53971
  1204
* Sessions may be organized via 'chapter' specifications in the ROOT
wenzelm@53971
  1205
file, which determines a two-level hierarchy of browser info.  The old
wenzelm@53971
  1206
tree-like organization via implicit sub-session relation (with its
wenzelm@53971
  1207
tendency towards erratic fluctuation of URLs) has been discontinued.
wenzelm@53971
  1208
The default chapter is called "Unsorted".  Potential INCOMPATIBILITY
wenzelm@53971
  1209
for HTML presentation of theories.
wenzelm@53971
  1210
wenzelm@51398
  1211
wenzelm@51398
  1212
wenzelm@50993
  1213
New in Isabelle2013 (February 2013)
wenzelm@50993
  1214
-----------------------------------
wenzelm@47887
  1215
wenzelm@47967
  1216
*** General ***
wenzelm@47967
  1217
wenzelm@50126
  1218
* Theorem status about oracles and unfinished/failed future proofs is
wenzelm@50126
  1219
no longer printed by default, since it is incompatible with
wenzelm@50126
  1220
incremental / parallel checking of the persistent document model.  ML
wenzelm@50126
  1221
function Thm.peek_status may be used to inspect a snapshot of the
wenzelm@50126
  1222
ongoing evaluation process.  Note that in batch mode --- notably
wenzelm@50126
  1223
isabelle build --- the system ensures that future proofs of all
wenzelm@50126
  1224
accessible theorems in the theory context are finished (as before).
wenzelm@50126
  1225
wenzelm@49699
  1226
* Configuration option show_markup controls direct inlining of markup
wenzelm@49699
  1227
into the printed representation of formal entities --- notably type
wenzelm@49699
  1228
and sort constraints.  This enables Prover IDE users to retrieve that
wenzelm@49699
  1229
information via tooltips in the output window, for example.
wenzelm@49699
  1230
wenzelm@48890
  1231
* Command 'ML_file' evaluates ML text from a file directly within the
wenzelm@48890
  1232
theory, without any predeclaration via 'uses' in the theory header.
wenzelm@48890
  1233
wenzelm@49243
  1234
* Old command 'use' command and corresponding keyword 'uses' in the
wenzelm@49243
  1235
theory header are legacy features and will be discontinued soon.
wenzelm@49243
  1236
Tools that load their additional source files may imitate the
wenzelm@49243
  1237
'ML_file' implementation, such that the system can take care of
wenzelm@49243
  1238
dependencies properly.
wenzelm@49243
  1239
wenzelm@47967
  1240
* Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
wenzelm@47967
  1241
is called fastforce / fast_force_tac already since Isabelle2011-1.
wenzelm@47967
  1242
wenzelm@50110
  1243
* Updated and extended "isar-ref" and "implementation" manual, reduced
wenzelm@50110
  1244
remaining material in old "ref" manual.
wenzelm@48120
  1245
wenzelm@51050
  1246
* Improved support for auxiliary contexts that indicate block structure
wenzelm@51050
  1247
for specifications.  Nesting of "context fixes ... context assumes ..."
wenzelm@49841
  1248
and "class ... context ...".
wenzelm@49841
  1249
wenzelm@50772
  1250
* Attribute "consumes" allows a negative value as well, which is
wenzelm@50778
  1251
interpreted relatively to the total number of premises of the rule in
wenzelm@50772
  1252
the target context.  This form of declaration is stable when exported
wenzelm@50772
  1253
from a nested 'context' with additional assumptions.  It is the
wenzelm@50772
  1254
preferred form for definitional packages, notably cases/rules produced
wenzelm@50772
  1255
in HOL/inductive and HOL/function.
wenzelm@50772
  1256
wenzelm@49869
  1257
* More informative error messages for Isar proof commands involving
wenzelm@49869
  1258
lazy enumerations (method applications etc.).
wenzelm@49869
  1259
wenzelm@50213
  1260
* Refined 'help' command to retrieve outer syntax commands according
wenzelm@50213
  1261
to name patterns (with clickable results).
wenzelm@50213
  1262
wenzelm@47967
  1263
wenzelm@49968
  1264
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@49968
  1265
wenzelm@49968
  1266
* Parallel terminal proofs ('by') are enabled by default, likewise
wenzelm@49968
  1267
proofs that are built into packages like 'datatype', 'function'.  This
wenzelm@49968
  1268
allows to "run ahead" checking the theory specifications on the
wenzelm@49968
  1269
surface, while the prover is still crunching on internal
wenzelm@49968
  1270
justifications.  Unfinished / cancelled proofs are restarted as
wenzelm@49968
  1271
required to complete full proof checking eventually.
wenzelm@49968
  1272
wenzelm@49968
  1273
* Improved output panel with tooltips, hyperlinks etc. based on the
wenzelm@49968
  1274
same Rich_Text_Area as regular Isabelle/jEdit buffers.  Activation of
wenzelm@49968
  1275
tooltips leads to some window that supports the same recursively,
wenzelm@49968
  1276
which can lead to stacks of tooltips as the semantic document content
wenzelm@49968
  1277
is explored.  ESCAPE closes the whole stack, individual windows may be
wenzelm@49968
  1278
closed separately, or detached to become independent jEdit dockables.
wenzelm@49968
  1279
wenzelm@50717
  1280
* Improved support for commands that produce graph output: the text
wenzelm@50717
  1281
message contains a clickable area to open a new instance of the graph
wenzelm@50717
  1282
browser on demand.
wenzelm@50717
  1283
wenzelm@49968
  1284
* More robust incremental parsing of outer syntax (partial comments,
wenzelm@49968
  1285
malformed symbols).  Changing the balance of open/close quotes and
wenzelm@49968
  1286
comment delimiters works more conveniently with unfinished situations
wenzelm@49968
  1287
that frequently occur in user interaction.
wenzelm@49968
  1288
wenzelm@49968
  1289
* More efficient painting and improved reactivity when editing large
wenzelm@49968
  1290
files.  More scalable management of formal document content.
wenzelm@49968
  1291
wenzelm@50505
  1292
* Smarter handling of tracing messages: prover process pauses after
wenzelm@50505
  1293
certain number of messages per command transaction, with some user
wenzelm@50505
  1294
dialog to stop or continue.  This avoids swamping the front-end with
wenzelm@50119
  1295
potentially infinite message streams.
wenzelm@49968
  1296
wenzelm@49968
  1297
* More plugin options and preferences, based on Isabelle/Scala.  The
wenzelm@49968
  1298
jEdit plugin option panel provides access to some Isabelle/Scala
wenzelm@49968
  1299
options, including tuning parameters for editor reactivity and color
wenzelm@49968
  1300
schemes.
wenzelm@49968
  1301
wenzelm@50184
  1302
* Dockable window "Symbols" provides some editing support for Isabelle
wenzelm@50184
  1303
symbols.
wenzelm@50184
  1304
wenzelm@51082
  1305
* Dockable window "Monitor" shows ML runtime statistics.  Note that
wenzelm@51082
  1306
continuous display of the chart slows down the system.
wenzelm@50701
  1307
wenzelm@50183
  1308
* Improved editing support for control styles: subscript, superscript,
wenzelm@50183
  1309
bold, reset of style -- operating on single symbols or text
wenzelm@50198
  1310
selections.  Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
wenzelm@50198
  1311
wenzelm@50198
  1312
* Actions isabelle.increase-font-size and isabelle.decrease-font-size
wenzelm@50198
  1313
adjust the main text area font size, and its derivatives for output,
wenzelm@50836
  1314
tooltips etc.  Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
wenzelm@50836
  1315
need to be adapted to local keyboard layouts.
wenzelm@50183
  1316
wenzelm@50730
  1317
* More reactive completion popup by default: use \t (TAB) instead of
wenzelm@50730
  1318
\n (NEWLINE) to minimize intrusion into regular flow of editing.  See
wenzelm@50730
  1319
also "Plugin Options / SideKick / General / Code Completion Options".
wenzelm@50730
  1320
wenzelm@50406
  1321
* Implicit check and build dialog of the specified logic session
wenzelm@50406
  1322
image.  For example, HOL, HOLCF, HOL-Nominal can be produced on
wenzelm@50406
  1323
demand, without bundling big platform-dependent heap images in the
wenzelm@50406
  1324
Isabelle distribution.
wenzelm@50406
  1325
wenzelm@49968
  1326
* Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
wenzelm@49968
  1327
from Oracle provide better multi-platform experience.  This version is
wenzelm@49968
  1328
now bundled exclusively with Isabelle.
wenzelm@49968
  1329
wenzelm@49968
  1330
wenzelm@48205
  1331
*** Pure ***
wenzelm@48205
  1332
haftmann@48431
  1333
* Code generation for Haskell: restrict unqualified imports from
haftmann@48431
  1334
Haskell Prelude to a small set of fundamental operations.
haftmann@48431
  1335
wenzelm@50646
  1336
* Command 'export_code': relative file names are interpreted
wenzelm@50646
  1337
relatively to master directory of current theory rather than the
wenzelm@50646
  1338
rather arbitrary current working directory.  INCOMPATIBILITY.
haftmann@48371
  1339
wenzelm@48205
  1340
* Discontinued obsolete attribute "COMP".  Potential INCOMPATIBILITY,
wenzelm@48205
  1341
use regular rule composition via "OF" / "THEN", or explicit proof
wenzelm@48205
  1342
structure instead.  Note that Isabelle/ML provides a variety of
wenzelm@48205
  1343
operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
wenzelm@48205
  1344
with some care where this is really required.
wenzelm@48205
  1345
wenzelm@48792
  1346
* Command 'typ' supports an additional variant with explicit sort
wenzelm@48792
  1347
constraint, to infer and check the most general type conforming to a
wenzelm@51063
  1348
given sort.  Example (in HOL):
wenzelm@48792
  1349
wenzelm@48792
  1350
  typ "_ * _ * bool * unit" :: finite
wenzelm@48792
  1351
wenzelm@50716
  1352
* Command 'locale_deps' visualizes all locales and their relations as
wenzelm@50716
  1353
a Hasse diagram.
wenzelm@50716
  1354
wenzelm@48205
  1355
bulwahn@48013
  1356
*** HOL ***
bulwahn@48013
  1357
wenzelm@50646
  1358
* Sledgehammer:
wenzelm@50646
  1359
wenzelm@50646
  1360
  - Added MaSh relevance filter based on machine-learning; see the
wenzelm@50646
  1361
    Sledgehammer manual for details.
wenzelm@50646
  1362
  - Polished Isar proofs generated with "isar_proofs" option.
wenzelm@50646
  1363
  - Rationalized type encodings ("type_enc" option).
blanchet@50720
  1364
  - Renamed "kill_provers" subcommand to "kill_all".
wenzelm@50646
  1365
  - Renamed options:
wenzelm@50646
  1366
      isar_proof ~> isar_proofs
wenzelm@50646
  1367
      isar_shrink_factor ~> isar_shrink
wenzelm@50646
  1368
      max_relevant ~> max_facts
wenzelm@50646
  1369
      relevance_thresholds ~> fact_thresholds
wenzelm@50646
  1370
wenzelm@50646
  1371
* Quickcheck: added an optimisation for equality premises.  It is
wenzelm@50646
  1372
switched on by default, and can be switched off by setting the
wenzelm@50646
  1373
configuration quickcheck_optimise_equality to false.
wenzelm@50646
  1374
kuncar@50878
  1375
* Quotient: only one quotient can be defined by quotient_type
kuncar@50878
  1376
INCOMPATIBILITY.
kuncar@50878
  1377
kuncar@50878
  1378
* Lifting:
kuncar@50878
  1379
  - generation of an abstraction function equation in lift_definition
kuncar@50878
  1380
  - quot_del attribute
kuncar@50878
  1381
  - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
kuncar@50878
  1382
wenzelm@50646
  1383
* Simproc "finite_Collect" rewrites set comprehensions into pointfree
wenzelm@50646
  1384
expressions.
wenzelm@50646
  1385
wenzelm@50646
  1386
* Preprocessing of the code generator rewrites set comprehensions into
wenzelm@50646
  1387
pointfree expressions.
wenzelm@50646
  1388
wenzelm@50646
  1389
* The SMT solver Z3 has now by default a restricted set of directly
wenzelm@50646
  1390
supported features. For the full set of features (div/mod, nonlinear
wenzelm@50646
  1391
arithmetic, datatypes/records) with potential proof reconstruction
wenzelm@50646
  1392
failures, enable the configuration option "z3_with_extensions".  Minor
wenzelm@50646
  1393
INCOMPATIBILITY.
haftmann@49948
  1394
wenzelm@49836
  1395
* Simplified 'typedef' specifications: historical options for implicit
wenzelm@49836
  1396
set definition and alternative name have been discontinued.  The
wenzelm@49836
  1397
former behavior of "typedef (open) t = A" is now the default, but
wenzelm@49836
  1398
written just "typedef t = A".  INCOMPATIBILITY, need to adapt theories
wenzelm@49836
  1399
accordingly.
wenzelm@49836
  1400
wenzelm@50646
  1401
* Removed constant "chars"; prefer "Enum.enum" on type "char"
wenzelm@50646
  1402
directly.  INCOMPATIBILITY.
wenzelm@50646
  1403
wenzelm@50646
  1404
* Moved operation product, sublists and n_lists from theory Enum to
wenzelm@50646
  1405
List.  INCOMPATIBILITY.
haftmann@49822
  1406
haftmann@49739
  1407
* Theorem UN_o generalized to SUP_comp.  INCOMPATIBILITY.
haftmann@49739
  1408
haftmann@49738
  1409
* Class "comm_monoid_diff" formalises properties of bounded
haftmann@49388
  1410
subtraction, with natural numbers and multisets as typical instances.
haftmann@49388
  1411
wenzelm@50646
  1412
* Added combinator "Option.these" with type "'a option set => 'a set".
wenzelm@50646
  1413
wenzelm@50646
  1414
* Theory "Transitive_Closure": renamed lemmas
wenzelm@50646
  1415
wenzelm@50646
  1416
  reflcl_tranclp -> reflclp_tranclp
wenzelm@50646
  1417
  rtranclp_reflcl -> rtranclp_reflclp
wenzelm@50646
  1418
wenzelm@50646
  1419
INCOMPATIBILITY.
wenzelm@50646
  1420
wenzelm@50646
  1421
* Theory "Rings": renamed lemmas (in class semiring)
wenzelm@50646
  1422
wenzelm@50646
  1423
  left_distrib ~> distrib_right
wenzelm@50646
  1424
  right_distrib ~> distrib_left
wenzelm@50646
  1425
wenzelm@50646
  1426
INCOMPATIBILITY.
wenzelm@50646
  1427
wenzelm@50646
  1428
* Generalized the definition of limits:
wenzelm@50646
  1429
wenzelm@50646
  1430
  - Introduced the predicate filterlim (LIM x F. f x :> G) which
wenzelm@50646
  1431
    expresses that when the input values x converge to F then the
wenzelm@50646
  1432
    output f x converges to G.
wenzelm@50646
  1433
wenzelm@50646
  1434
  - Added filters for convergence to positive (at_top) and negative
wenzelm@50646
  1435
    infinity (at_bot).
wenzelm@50646
  1436
wenzelm@50646
  1437
  - Moved infinity in the norm (at_infinity) from
wenzelm@50646
  1438
    Multivariate_Analysis to Complex_Main.
wenzelm@50646
  1439
wenzelm@50646
  1440
  - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
wenzelm@50646
  1441
    at_top".
wenzelm@50646
  1442
wenzelm@50646
  1443
INCOMPATIBILITY.
wenzelm@50646
  1444
wenzelm@50646
  1445
* Theory "Library/Option_ord" provides instantiation of option type to
wenzelm@50646
  1446
lattice type classes.
wenzelm@50646
  1447
wenzelm@50646
  1448
* Theory "Library/Multiset": renamed
wenzelm@50646
  1449
wenzelm@50646
  1450
    constant fold_mset ~> Multiset.fold
wenzelm@50646
  1451
    fact fold_mset_commute ~> fold_mset_comm
wenzelm@50646
  1452
wenzelm@50646
  1453
INCOMPATIBILITY.
wenzelm@50646
  1454
wenzelm@50646
  1455
* Renamed theory Library/List_Prefix to Library/Sublist, with related
wenzelm@50646
  1456
changes as follows.
wenzelm@50646
  1457
wenzelm@50646
  1458
  - Renamed constants (and related lemmas)
Christian@49145
  1459
Christian@49145
  1460
      prefix ~> prefixeq
Christian@49145
  1461
      strict_prefix ~> prefix
Christian@49145
  1462
wenzelm@50646
  1463
  - Replaced constant "postfix" by "suffixeq" with swapped argument
wenzelm@50646
  1464
    order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
wenzelm@50646
  1465
    old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
wenzelm@50646
  1466
    Renamed lemmas accordingly.
wenzelm@50646
  1467
wenzelm@50646
  1468
  - Added constant "list_hembeq" for homeomorphic embedding on
wenzelm@50646
  1469
    lists. Added abbreviation "sublisteq" for special case
wenzelm@50646
  1470
    "list_hembeq (op =)".
wenzelm@50646
  1471
wenzelm@50646
  1472
  - Theory Library/Sublist no longer provides "order" and "bot" type
wenzelm@50646
  1473
    class instances for the prefix order (merely corresponding locale
wenzelm@50646
  1474
    interpretations). The type class instances are now in theory
wenzelm@50646
  1475
    Library/Prefix_Order.
wenzelm@50646
  1476
wenzelm@50646
  1477
  - The sublist relation of theory Library/Sublist_Order is now based
wenzelm@50646
  1478
    on "Sublist.sublisteq".  Renamed lemmas accordingly:
Christian@50516
  1479
Christian@50516
  1480
      le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
Christian@50516
  1481
      le_list_append_mono ~> Sublist.list_hembeq_append_mono
Christian@50516
  1482
      le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
Christian@50516
  1483
      le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
Christian@50516
  1484
      le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
Christian@50516
  1485
      le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
Christian@50516
  1486
      le_list_drop_Cons ~> Sublist.sublisteq_Cons'
Christian@50516
  1487
      le_list_drop_many ~> Sublist.sublisteq_drop_many
Christian@50516
  1488
      le_list_filter_left ~> Sublist.sublisteq_filter_left
Christian@50516
  1489
      le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
Christian@50516
  1490
      le_list_rev_take_iff ~> Sublist.sublisteq_append
Christian@50516
  1491
      le_list_same_length ~> Sublist.sublisteq_same_length
Christian@50516
  1492
      le_list_take_many_iff ~> Sublist.sublisteq_append'
Christian@49145
  1493
      less_eq_list.drop ~> less_eq_list_drop
Christian@49145
  1494
      less_eq_list.induct ~> less_eq_list_induct
Christian@50516
  1495
      not_le_list_length ~> Sublist.not_sublisteq_length
Christian@49145
  1496
wenzelm@50646
  1497
INCOMPATIBILITY.
wenzelm@50646
  1498
wenzelm@50646
  1499
* New theory Library/Countable_Set.
wenzelm@50646
  1500
wenzelm@50646
  1501
* Theory Library/Debug and Library/Parallel provide debugging and
wenzelm@50646
  1502
parallel execution for code generated towards Isabelle/ML.
wenzelm@50646
  1503
wenzelm@50646
  1504
* Theory Library/FuncSet: Extended support for Pi and extensional and
wenzelm@50646
  1505
introduce the extensional dependent function space "PiE". Replaced
wenzelm@50646
  1506
extensional_funcset by an abbreviation, and renamed lemmas from
wenzelm@50646
  1507
extensional_funcset to PiE as follows:
wenzelm@50646
  1508
wenzelm@50646
  1509
  extensional_empty  ~>  PiE_empty
wenzelm@50646
  1510
  extensional_funcset_empty_domain  ~>  PiE_empty_domain
wenzelm@50646
  1511
  extensional_funcset_empty_range  ~>  PiE_empty_range
wenzelm@50646
  1512
  extensional_funcset_arb  ~>  PiE_arb
wenzelm@50646
  1513
  extensional_funcset_mem  ~>  PiE_mem
wenzelm@50646
  1514
  extensional_funcset_extend_domainI  ~>  PiE_fun_upd
wenzelm@50646
  1515
  extensional_funcset_restrict_domain  ~>  fun_upd_in_PiE
wenzelm@50646
  1516
  extensional_funcset_extend_domain_eq  ~>  PiE_insert_eq
wenzelm@50646
  1517
  card_extensional_funcset  ~>  card_PiE
wenzelm@50646
  1518
  finite_extensional_funcset  ~>  finite_PiE
wenzelm@50646
  1519
wenzelm@50646
  1520
INCOMPATIBILITY.
wenzelm@50646
  1521
wenzelm@50646
  1522
* Theory Library/FinFun: theory of almost everywhere constant
wenzelm@50646
  1523
functions (supersedes the AFP entry "Code Generation for Functions as
wenzelm@50646
  1524
Data").
wenzelm@50646
  1525
wenzelm@50646
  1526
* Theory Library/Phantom: generic phantom type to make a type
wenzelm@50646
  1527
parameter appear in a constant's type.  This alternative to adding
wenzelm@50646
  1528
TYPE('a) as another parameter avoids unnecessary closures in generated
wenzelm@50646
  1529
code.
wenzelm@50646
  1530
wenzelm@50646
  1531
* Theory Library/RBT_Impl: efficient construction of red-black trees
wenzelm@50646
  1532
from sorted associative lists. Merging two trees with rbt_union may
wenzelm@50646
  1533
return a structurally different tree than before.  Potential
wenzelm@50646
  1534
INCOMPATIBILITY.
wenzelm@50646
  1535
wenzelm@50646
  1536
* Theory Library/IArray: immutable arrays with code generation.
wenzelm@50646
  1537
wenzelm@50646
  1538
* Theory Library/Finite_Lattice: theory of finite lattices.
wenzelm@50646
  1539
wenzelm@50646
  1540
* HOL/Multivariate_Analysis: replaced
wenzelm@50646
  1541
wenzelm@50646
  1542
  "basis :: 'a::euclidean_space => nat => real"
wenzelm@50646
  1543
  "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
wenzelm@50646
  1544
wenzelm@50646
  1545
on euclidean spaces by using the inner product "_ \<bullet> _" with
wenzelm@50646
  1546
vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
wenzelm@50646
  1547
"SUM i : Basis. f i * r i".
wenzelm@50646
  1548
wenzelm@50646
  1549
  With this change the following constants are also changed or removed:
wenzelm@50646
  1550
wenzelm@50646
  1551
    DIM('a) :: nat  ~>  card (Basis :: 'a set)   (is an abbreviation)
wenzelm@50646
  1552
    a $$ i  ~>  inner a i  (where i : Basis)
wenzelm@50646
  1553
    cart_base i  removed
wenzelm@50646
  1554
    \<pi>, \<pi>'  removed
hoelzl@50526
  1555
hoelzl@50526
  1556
  Theorems about these constants where removed.
hoelzl@50526
  1557
hoelzl@50526
  1558
  Renamed lemmas:
hoelzl@50526
  1559
wenzelm@50646
  1560
    component_le_norm  ~>  Basis_le_norm
wenzelm@50646
  1561
    euclidean_eq  ~>  euclidean_eq_iff
wenzelm@50646
  1562
    differential_zero_maxmin_component  ~>  differential_zero_maxmin_cart
wenzelm@50646
  1563
    euclidean_simps  ~>  inner_simps
wenzelm@50646
  1564
    independent_basis  ~>  independent_Basis
wenzelm@50646
  1565
    span_basis  ~>  span_Basis
wenzelm@50646
  1566
    in_span_basis  ~>  in_span_Basis
wenzelm@50646
  1567
    norm_bound_component_le  ~>  norm_boound_Basis_le
wenzelm@50646
  1568
    norm_bound_component_lt  ~>  norm_boound_Basis_lt
wenzelm@50646
  1569
    component_le_infnorm  ~>  Basis_le_infnorm
wenzelm@50646
  1570
wenzelm@50646
  1571
INCOMPATIBILITY.
hoelzl@50526
  1572
hoelzl@50141
  1573
* HOL/Probability:
wenzelm@50646
  1574
wenzelm@50646
  1575
  - Added simproc "measurable" to automatically prove measurability.
wenzelm@50646
  1576
wenzelm@50646
  1577
  - Added induction rules for sigma sets with disjoint union
wenzelm@50646
  1578
    (sigma_sets_induct_disjoint) and for Borel-measurable functions
wenzelm@50646
  1579
    (borel_measurable_induct).
wenzelm@50646
  1580
wenzelm@50646
  1581
  - Added the Daniell-Kolmogorov theorem (the existence the limit of a
wenzelm@50646
  1582
    projective family).
wenzelm@50646
  1583
wenzelm@50646
  1584
* HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
wenzelm@50646
  1585
AFP entry "Ordinals_and_Cardinals").
wenzelm@50646
  1586
wenzelm@50646
  1587
* HOL/BNF: New (co)datatype package based on bounded natural functors
wenzelm@50646
  1588
with support for mixed, nested recursion and interesting non-free
wenzelm@50646
  1589
datatypes.
blanchet@48094
  1590
wenzelm@50991
  1591
* HOL/Finite_Set and Relation: added new set and relation operations
kuncar@50878
  1592
expressed by Finite_Set.fold.
kuncar@50878
  1593
kuncar@50878
  1594
* New theory HOL/Library/RBT_Set: implementation of sets by red-black
kuncar@50878
  1595
trees for the code generator.
kuncar@50878
  1596
kuncar@50878
  1597
* HOL/Library/RBT and HOL/Library/Mapping have been converted to
kuncar@50878
  1598
Lifting/Transfer.
kuncar@50878
  1599
possible INCOMPATIBILITY.
kuncar@50878
  1600
kuncar@50878
  1601
* HOL/Set: renamed Set.project -> Set.filter
kuncar@50878
  1602
INCOMPATIBILITY.
kuncar@50878
  1603
wenzelm@48120
  1604
wenzelm@48206
  1605
*** Document preparation ***
wenzelm@48206
  1606
wenzelm@50646
  1607
* Dropped legacy antiquotations "term_style" and "thm_style", since
wenzelm@50646
  1608
styles may be given as arguments to "term" and "thm" already.
wenzelm@50646
  1609
Discontinued legacy styles "prem1" .. "prem19".
wenzelm@50646
  1610
wenzelm@50646
  1611
* Default LaTeX rendering for \<euro> is now based on eurosym package,
wenzelm@50646
  1612
instead of slightly exotic babel/greek.
wenzelm@48206
  1613
wenzelm@48616
  1614
* Document variant NAME may use different LaTeX entry point
wenzelm@48616
  1615
document/root_NAME.tex if that file exists, instead of the common
wenzelm@48616
  1616
document/root.tex.
wenzelm@48616
  1617
wenzelm@48657
  1618
* Simplified custom document/build script, instead of old-style
wenzelm@48657
  1619
document/IsaMakefile.  Minor INCOMPATIBILITY.
wenzelm@48657
  1620
wenzelm@48206
  1621
wenzelm@48992
  1622
*** ML ***
wenzelm@48992
  1623
wenzelm@50646
  1624
* The default limit for maximum number of worker threads is now 8,
wenzelm@50646
  1625
instead of 4, in correspondence to capabilities of contemporary
wenzelm@50646
  1626
hardware and Poly/ML runtime system.
wenzelm@50646
  1627
wenzelm@49869
  1628
* Type Seq.results and related operations support embedded error
wenzelm@49869
  1629
messages within lazy enumerations, and thus allow to provide
wenzelm@49869
  1630
informative errors in the absence of any usable results.
wenzelm@49869
  1631
wenzelm@48992
  1632
* Renamed Position.str_of to Position.here to emphasize that this is a
wenzelm@48992
  1633
formal device to inline positions into message text, but not
wenzelm@48992
  1634
necessarily printing visible text.
wenzelm@48992
  1635
wenzelm@48992
  1636
wenzelm@48206
  1637
*** System ***
wenzelm@48206
  1638
wenzelm@48585
  1639
* Advanced support for Isabelle sessions and build management, see
wenzelm@48585
  1640
"system" manual for the chapter of that name, especially the "isabelle
wenzelm@51056
  1641
build" tool and its examples.  The "isabelle mkroot" tool prepares
wenzelm@51056
  1642
session root directories for use with "isabelle build", similar to
wenzelm@51056
  1643
former "isabelle mkdir" for "isabelle usedir".  Note that this affects
wenzelm@51056
  1644
document preparation as well.  INCOMPATIBILITY, isabelle usedir /
wenzelm@48736
  1645
mkdir / make are rendered obsolete.
wenzelm@48736
  1646
wenzelm@51056
  1647
* Discontinued obsolete Isabelle/build script, it is superseded by the
wenzelm@51056
  1648
regular isabelle build tool.  For example:
wenzelm@51056
  1649
wenzelm@51056
  1650
  isabelle build -s -b HOL
wenzelm@51056
  1651
wenzelm@48736
  1652
* Discontinued obsolete "isabelle makeall".
wenzelm@48585
  1653
wenzelm@48722
  1654
* Discontinued obsolete IsaMakefile and ROOT.ML files from the
wenzelm@48722
  1655
Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
wenzelm@48722
  1656
provides some traditional targets that invoke "isabelle build".  Note
wenzelm@48722
  1657
that this is inefficient!  Applications of Isabelle/HOL involving
wenzelm@48722
  1658
"isabelle make" should be upgraded to use "isabelle build" directly.
wenzelm@48722
  1659
wenzelm@48693
  1660
* The "isabelle options" tool prints Isabelle system options, as
wenzelm@48693
  1661
required for "isabelle build", for example.
wenzelm@48693
  1662
wenzelm@50646
  1663
* The "isabelle logo" tool produces EPS and PDF format simultaneously.
wenzelm@50646
  1664
Minor INCOMPATIBILITY in command-line options.
wenzelm@50646
  1665
wenzelm@50646
  1666
* The "isabelle install" tool has now a simpler command-line.  Minor
wenzelm@50646
  1667
INCOMPATIBILITY.
wenzelm@50646
  1668
wenzelm@48844
  1669
* The "isabelle components" tool helps to resolve add-on components
wenzelm@48844
  1670
that are not bundled, or referenced from a bare-bones repository
wenzelm@48844
  1671
version of Isabelle.
wenzelm@48844
  1672
wenzelm@50646
  1673
* Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
wenzelm@50646
  1674
platform family: "linux", "macos", "windows".
wenzelm@50646
  1675
wenzelm@50646
  1676
* The ML system is configured as regular component, and no longer
wenzelm@50646
  1677
picked up from some surrounding directory.  Potential INCOMPATIBILITY
wenzelm@50646
  1678
for home-made settings.
wenzelm@50132
  1679
wenzelm@50701
  1680
* Improved ML runtime statistics (heap, threads, future tasks etc.).
wenzelm@50701
  1681
wenzelm@48206
  1682
* Discontinued support for Poly/ML 5.2.1, which was the last version
wenzelm@48206
  1683
without exception positions and advanced ML compiler/toplevel
wenzelm@48206
  1684
configuration.
wenzelm@48206
  1685
wenzelm@48574
  1686
* Discontinued special treatment of Proof General -- no longer guess
wenzelm@48574
  1687
PROOFGENERAL_HOME based on accidental file-system layout.  Minor
wenzelm@48574
  1688
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
wenzelm@48574
  1689
settings manually, or use a Proof General version that has been
wenzelm@48574
  1690
bundled as Isabelle component.
wenzelm@48206
  1691
wenzelm@50182
  1692
wenzelm@48120
  1693
wenzelm@47462
  1694
New in Isabelle2012 (May 2012)
wenzelm@47462
  1695
------------------------------
wenzelm@45109
  1696
wenzelm@45593
  1697
*** General ***
wenzelm@45593
  1698
wenzelm@45614
  1699
* Prover IDE (PIDE) improvements:
wenzelm@45614
  1700
wenzelm@47585
  1701
  - more robust Sledgehammer integration (as before the sledgehammer
wenzelm@47806
  1702
    command-line needs to be typed into the source buffer)
wenzelm@45614
  1703
  - markup for bound variables
wenzelm@47806
  1704
  - markup for types of term variables (displayed as tooltips)
wenzelm@46956
  1705
  - support for user-defined Isar commands within the running session
wenzelm@47158
  1706
  - improved support for Unicode outside original 16bit range
wenzelm@47158
  1707
    e.g. glyph for \<A> (thanks to jEdit 4.5.1)
wenzelm@45614
  1708
wenzelm@47806
  1709
* Forward declaration of outer syntax keywords within the theory
wenzelm@47806
  1710
header -- minor INCOMPATIBILITY for user-defined commands.  Allow new
wenzelm@47806
  1711
commands to be used in the same theory where defined.
wenzelm@46485
  1712
wenzelm@47482
  1713
* Auxiliary contexts indicate block structure for specifications with
wenzelm@47482
  1714
additional parameters and assumptions.  Such unnamed contexts may be
wenzelm@47482
  1715
nested within other targets, like 'theory', 'locale', 'class',
wenzelm@47482
  1716
'instantiation' etc.  Results from the local context are generalized
wenzelm@47482
  1717
accordingly and applied to the enclosing target context.  Example:
wenzelm@47482
  1718
wenzelm@47482
  1719
  context
wenzelm@47482
  1720
    fixes x y z :: 'a
wenzelm@47482
  1721
    assumes xy: "x = y" and yz: "y = z"
wenzelm@47482
  1722
  begin
wenzelm@47482
  1723
wenzelm@47482
  1724
  lemma my_trans: "x = z" using xy yz by simp
wenzelm@47482
  1725
wenzelm@47482
  1726
  end
wenzelm@47482
  1727
wenzelm@47482
  1728
  thm my_trans
wenzelm@47482
  1729
wenzelm@47482
  1730
The most basic application is to factor-out context elements of
wenzelm@47482
  1731
several fixes/assumes/shows theorem statements, e.g. see
wenzelm@47482
  1732
~~/src/HOL/Isar_Examples/Group_Context.thy
wenzelm@47482
  1733
wenzelm@47482
  1734
Any other local theory specification element works within the "context
wenzelm@47482
  1735
... begin ... end" block as well.
wenzelm@47482
  1736
wenzelm@47484
  1737
* Bundled declarations associate attributed fact expressions with a
wenzelm@47484
  1738
given name in the context.  These may be later included in other
wenzelm@47484
  1739
contexts.  This allows to manage context extensions casually, without
wenzelm@47855
  1740
the logical dependencies of locales and locale interpretation.  See
wenzelm@47855
  1741
commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
wenzelm@47484
  1742
wenzelm@47829
  1743
* Commands 'lemmas' and 'theorems' allow local variables using 'for'
wenzelm@47829
  1744
declaration, and results are standardized before being stored.  Thus
wenzelm@47829
  1745
old-style "standard" after instantiation or composition of facts
wenzelm@47829
  1746
becomes obsolete.  Minor INCOMPATIBILITY, due to potential change of
wenzelm@47829
  1747
indices of schematic variables.
wenzelm@47829
  1748
wenzelm@47829
  1749
* Rule attributes in local theory declarations (e.g. locale or class)
wenzelm@47829
  1750
are now statically evaluated: the resulting theorem is stored instead
wenzelm@47829
  1751
of the original expression.  INCOMPATIBILITY in rare situations, where
wenzelm@47829
  1752
the historic accident of dynamic re-evaluation in interpretations
wenzelm@47829
  1753
etc. was exploited.
wenzelm@47829
  1754
wenzelm@47829
  1755
* New tutorial "Programming and Proving in Isabelle/HOL"
wenzelm@47829
  1756
("prog-prove").  It completely supersedes "A Tutorial Introduction to
wenzelm@47829
  1757
Structured Isar Proofs" ("isar-overview"), which has been removed.  It
wenzelm@47829
  1758
also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
wenzelm@47829
  1759
Logic" as the recommended beginners tutorial, but does not cover all
wenzelm@47829
  1760
of the material of that old tutorial.
wenzelm@47829
  1761
wenzelm@47829
  1762
* Updated and extended reference manuals: "isar-ref",
wenzelm@47829
  1763
"implementation", "system"; reduced remaining material in old "ref"
wenzelm@47829
  1764
manual.
wenzelm@47829
  1765
wenzelm@47829
  1766
wenzelm@47829
  1767
*** Pure ***
wenzelm@47829
  1768
wenzelm@46976
  1769
* Command 'definition' no longer exports the foundational "raw_def"
wenzelm@46976
  1770
into the user context.  Minor INCOMPATIBILITY, may use the regular
wenzelm@46976
  1771
"def" result with attribute "abs_def" to imitate the old version.
wenzelm@46976
  1772
wenzelm@47855
  1773
* Attribute "abs_def" turns an equation of the form "f x y == t" into
wenzelm@47855
  1774
"f == %x y. t", which ensures that "simp" or "unfold" steps always
wenzelm@47855
  1775
expand it.  This also works for object-logic equality.  (Formerly
wenzelm@47855
  1776
undocumented feature.)
wenzelm@47855
  1777
wenzelm@47856
  1778
* Sort constraints are now propagated in simultaneous statements, just
wenzelm@47856
  1779
like type constraints.  INCOMPATIBILITY in rare situations, where
wenzelm@47856
  1780
distinct sorts used to be assigned accidentally.  For example:
wenzelm@47856
  1781
wenzelm@47856
  1782
  lemma "P (x::'a::foo)" and "Q (y::'a::bar)"  -- "now illegal"
wenzelm@47856
  1783
wenzelm@47856
  1784
  lemma "P (x::'a)" and "Q (y::'a::bar)"
wenzelm@47856
  1785
    -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
wenzelm@47856
  1786
wenzelm@47856
  1787
* Rule composition via attribute "OF" (or ML functions OF/MRS) is more
wenzelm@47856
  1788
tolerant against multiple unifiers, as long as the final result is
wenzelm@47856
  1789
unique.  (As before, rules are composed in canonical right-to-left
wenzelm@47856
  1790
order to accommodate newly introduced premises.)
wenzelm@47856
  1791
wenzelm@47806
  1792
* Renamed some inner syntax categories:
wenzelm@47806
  1793
wenzelm@47806
  1794
    num ~> num_token
wenzelm@47806
  1795
    xnum ~> xnum_token
wenzelm@47806
  1796
    xstr ~> str_token
wenzelm@47806
  1797
wenzelm@47806
  1798
Minor INCOMPATIBILITY.  Note that in practice "num_const" or
wenzelm@47806
  1799
"num_position" etc. are mainly used instead (which also include
wenzelm@47806
  1800
position information via constraints).
wenzelm@47806
  1801
wenzelm@47829
  1802
* Simplified configuration options for syntax ambiguity: see
wenzelm@47829
  1803
"syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
wenzelm@47829
  1804
manual.  Minor INCOMPATIBILITY.
wenzelm@47829
  1805
wenzelm@47856
  1806
* Discontinued configuration option "syntax_positions": atomic terms
wenzelm@47856
  1807
in parse trees are always annotated by position constraints.
wenzelm@45134
  1808
wenzelm@47464
  1809
* Old code generator for SML and its commands 'code_module',
wenzelm@45383
  1810
'code_library', 'consts_code', 'types_code' have been discontinued.
haftmann@46028
  1811
Use commands of the generic code generator instead.  INCOMPATIBILITY.
wenzelm@45383
  1812
wenzelm@47464
  1813
* Redundant attribute "code_inline" has been discontinued. Use
wenzelm@47464
  1814
"code_unfold" instead.  INCOMPATIBILITY.
wenzelm@47464
  1815
wenzelm@47464
  1816
* Dropped attribute "code_unfold_post" in favor of the its dual
wenzelm@47464
  1817
"code_abbrev", which yields a common pattern in definitions like
haftmann@46028
  1818
haftmann@46028
  1819
  definition [code_abbrev]: "f = t"
haftmann@46028
  1820
haftmann@46028
  1821
INCOMPATIBILITY.
wenzelm@45383
  1822
wenzelm@47856
  1823
* Obsolete 'types' command has been discontinued.  Use 'type_synonym'
wenzelm@47856
  1824
instead.  INCOMPATIBILITY.
wenzelm@47856
  1825
wenzelm@47856
  1826
* Discontinued old "prems" fact, which used to refer to the accidental
wenzelm@47856
  1827
collection of foundational premises in the context (already marked as
wenzelm@47856
  1828
legacy since Isabelle2011).
wenzelm@47855
  1829
wenzelm@45427
  1830
huffman@45122
  1831
*** HOL ***
huffman@45122
  1832
wenzelm@47464
  1833
* Type 'a set is now a proper type constructor (just as before
wenzelm@47464
  1834
Isabelle2008).  Definitions mem_def and Collect_def have disappeared.
wenzelm@47464
  1835
Non-trivial INCOMPATIBILITY.  For developments keeping predicates and
wenzelm@47855
  1836
sets separate, it is often sufficient to rephrase some set S that has
wenzelm@47855
  1837
been accidentally used as predicates by "%x. x : S", and some
wenzelm@47855
  1838
predicate P that has been accidentally used as set by "{x. P x}".
wenzelm@47855
  1839
Corresponding proofs in a first step should be pruned from any
wenzelm@47855
  1840
tinkering with former theorems mem_def and Collect_def as far as
wenzelm@47855
  1841
possible.
wenzelm@47855
  1842
wenzelm@47855
  1843
For developments which deliberately mix predicates and sets, a
wenzelm@47464
  1844
planning step is necessary to determine what should become a predicate
wenzelm@47464
  1845
and what a set.  It can be helpful to carry out that step in
wenzelm@47464
  1846
Isabelle2011-1 before jumping right into the current release.
wenzelm@47464
  1847
wenzelm@47855
  1848
* Code generation by default implements sets as container type rather
wenzelm@47855
  1849
than predicates.  INCOMPATIBILITY.
wenzelm@47855
  1850
wenzelm@47855
  1851
* New type synonym 'a rel = ('a * 'a) set
wenzelm@47855
  1852
wenzelm@47464
  1853
* The representation of numerals has changed.  Datatype "num"
wenzelm@47464
  1854
represents strictly positive binary numerals, along with functions
wenzelm@47464
  1855
"numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
wenzelm@47855
  1856
positive and negated numeric literals, respectively.  See also
wenzelm@47855
  1857
definitions in ~~/src/HOL/Num.thy.  Potential INCOMPATIBILITY, some
wenzelm@47855
  1858
user theories may require adaptations as follows:
huffman@47108
  1859
huffman@47108
  1860
  - Theorems with number_ring or number_semiring constraints: These
huffman@47108
  1861
    classes are gone; use comm_ring_1 or comm_semiring_1 instead.
huffman@47108
  1862
huffman@47108
  1863
  - Theories defining numeric types: Remove number, number_semiring,
huffman@47108
  1864
    and number_ring instances. Defer all theorems about numerals until
huffman@47108
  1865
    after classes one and semigroup_add have been instantiated.
huffman@47108
  1866
huffman@47108
  1867
  - Numeral-only simp rules: Replace each rule having a "number_of v"
huffman@47108
  1868
    pattern with two copies, one for numeral and one for neg_numeral.
huffman@47108
  1869
huffman@47108
  1870
  - Theorems about subclasses of semiring_1 or ring_1: These classes
huffman@47108
  1871
    automatically support numerals now, so more simp rules and
huffman@47108
  1872
    simprocs may now apply within the proof.
huffman@47108
  1873
huffman@47108
  1874
  - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
huffman@47108
  1875
    Redefine using other integer operations.
huffman@47108
  1876
wenzelm@47855
  1877
* Transfer: New package intended to generalize the existing
wenzelm@47855
  1878
"descending" method and related theorem attributes from the Quotient
wenzelm@47855
  1879
package.  (Not all functionality is implemented yet, but future
wenzelm@47855
  1880
development will focus on Transfer as an eventual replacement for the
wenzelm@47855
  1881
corresponding parts of the Quotient package.)
wenzelm@47809
  1882
wenzelm@47809
  1883
  - transfer_rule attribute: Maintains a collection of transfer rules,
wenzelm@47809
  1884
    which relate constants at two different types. Transfer rules may
wenzelm@47809
  1885
    relate different type instances of the same polymorphic constant,
wenzelm@47809
  1886
    or they may relate an operation on a raw type to a corresponding
wenzelm@47809
  1887
    operation on an abstract type (quotient or subtype). For example:
wenzelm@47809
  1888
wenzelm@47809
  1889
    ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
wenzelm@47809
  1890
    (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
wenzelm@47809
  1891
wenzelm@47809
  1892
  - transfer method: Replaces a subgoal on abstract types with an
wenzelm@47809
  1893
    equivalent subgoal on the corresponding raw types. Constants are
wenzelm@47809
  1894
    replaced with corresponding ones according to the transfer rules.
wenzelm@47809
  1895
    Goals are generalized over all free variables by default; this is
huffman@47851
  1896
    necessary for variables whose types change, but can be overridden
wenzelm@47855
  1897
    for specific variables with e.g. "transfer fixing: x y z".  The
wenzelm@47809
  1898
    variant transfer' method allows replacing a subgoal with one that
wenzelm@47809
  1899
    is logically stronger (rather than equivalent).
wenzelm@47809
  1900
wenzelm@47809
  1901
  - relator_eq attribute: Collects identity laws for relators of
wenzelm@47809
  1902
    various type constructors, e.g. "list_all2 (op =) = (op =)".  The
wenzelm@47809
  1903
    transfer method uses these lemmas to infer transfer rules for
wenzelm@47809
  1904
    non-polymorphic constants on the fly.
wenzelm@47809
  1905
wenzelm@47809
  1906
  - transfer_prover method: Assists with proving a transfer rule for a
wenzelm@47809
  1907
    new constant, provided the constant is defined in terms of other
wenzelm@47809
  1908
    constants that already have transfer rules. It should be applied
wenzelm@47809
  1909
    after unfolding the constant definitions.
wenzelm@47809
  1910
wenzelm@47809
  1911
  - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
wenzelm@47809
  1912
    from type nat to type int.
wenzelm@47809
  1913
huffman@47851
  1914
* Lifting: New package intended to generalize the quotient_definition
huffman@47851
  1915
facility of the Quotient package; designed to work with Transfer.
wenzelm@47809
  1916
wenzelm@47809
  1917
  - lift_definition command: Defines operations on an abstract type in
wenzelm@47809
  1918
    terms of a corresponding operation on a representation
wenzelm@47809
  1919
    type.  Example syntax:
wenzelm@47809
  1920
wenzelm@47809
  1921
    lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
wenzelm@47809
  1922
      is List.insert
wenzelm@47809
  1923
wenzelm@47809
  1924
    Users must discharge a respectfulness proof obligation when each
wenzelm@47809
  1925
    constant is defined. (For a type copy, i.e. a typedef with UNIV,
wenzelm@47809
  1926
    the proof is discharged automatically.) The obligation is
wenzelm@47809
  1927
    presented in a user-friendly, readable form; a respectfulness
wenzelm@47809
  1928
    theorem in the standard format and a transfer rule are generated
wenzelm@47809
  1929
    by the package.
wenzelm@47809
  1930
wenzelm@47809
  1931
  - Integration with code_abstype: For typedefs (e.g. subtypes
wenzelm@47809
  1932
    corresponding to a datatype invariant, such as dlist),
wenzelm@47809
  1933
    lift_definition generates a code certificate theorem and sets up
wenzelm@47809
  1934
    code generation for each constant.
wenzelm@47809
  1935
wenzelm@47809
  1936
  - setup_lifting command: Sets up the Lifting package to work with a
wenzelm@47809
  1937
    user-defined type. The user must provide either a quotient theorem
wenzelm@47809
  1938
    or a type_definition theorem.  The package configures transfer
wenzelm@47809
  1939
    rules for equality and quantifiers on the type, and sets up the
wenzelm@47809
  1940
    lift_definition command to work with the type.
wenzelm@47809
  1941
wenzelm@47809
  1942
  - Usage examples: See Quotient_Examples/Lift_DList.thy,
huffman@47851
  1943
    Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
huffman@47851
  1944
    Word/Word.thy and Library/Float.thy.
wenzelm@47809
  1945
wenzelm@47809
  1946
* Quotient package:
wenzelm@47809
  1947
wenzelm@47809
  1948
  - The 'quotient_type' command now supports a 'morphisms' option with
wenzelm@47809
  1949
    rep and abs functions, similar to typedef.
wenzelm@47809
  1950
wenzelm@47809
  1951
  - 'quotient_type' sets up new types to work with the Lifting and
wenzelm@47809
  1952
    Transfer packages, as with 'setup_lifting'.
wenzelm@47809
  1953
wenzelm@47809
  1954
  - The 'quotient_definition' command now requires the user to prove a
wenzelm@47809
  1955
    respectfulness property at the point where the constant is
wenzelm@47809
  1956
    defined, similar to lift_definition; INCOMPATIBILITY.
wenzelm@47809
  1957
wenzelm@47809
  1958
  - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
wenzelm@47809
  1959
    accordingly, INCOMPATIBILITY.
wenzelm@47809
  1960
wenzelm@47809
  1961
* New diagnostic command 'find_unused_assms' to find potentially
wenzelm@47809
  1962
superfluous assumptions in theorems using Quickcheck.
wenzelm@47809
  1963
wenzelm@47809
  1964
* Quickcheck:
wenzelm@47809
  1965
wenzelm@47809
  1966
  - Quickcheck returns variable assignments as counterexamples, which
wenzelm@47809
  1967
    allows to reveal the underspecification of functions under test.
wenzelm@47809
  1968
    For example, refuting "hd xs = x", it presents the variable
wenzelm@47809
  1969
    assignment xs = [] and x = a1 as a counterexample, assuming that
wenzelm@47809
  1970
    any property is false whenever "hd []" occurs in it.
wenzelm@47809
  1971
wenzelm@47809
  1972
    These counterexample are marked as potentially spurious, as
wenzelm@47809
  1973
    Quickcheck also returns "xs = []" as a counterexample to the
wenzelm@47809
  1974
    obvious theorem "hd xs = hd xs".
wenzelm@47809
  1975
wenzelm@47809
  1976
    After finding a potentially spurious counterexample, Quickcheck
wenzelm@47809
  1977
    continues searching for genuine ones.
wenzelm@47809
  1978
wenzelm@47809
  1979
    By default, Quickcheck shows potentially spurious and genuine
wenzelm@47809
  1980
    counterexamples. The option "genuine_only" sets quickcheck to only
wenzelm@47809
  1981
    show genuine counterexamples.
wenzelm@47809
  1982
wenzelm@47809
  1983
  - The command 'quickcheck_generator' creates random and exhaustive
wenzelm@47809
  1984
    value generators for a given type and operations.
wenzelm@47809
  1985
wenzelm@47809
  1986
    It generates values by using the operations as if they were
wenzelm@47809
  1987
    constructors of that type.
wenzelm@47809
  1988
wenzelm@47809
  1989
  - Support for multisets.
wenzelm@47809
  1990
wenzelm@47809
  1991
  - Added "use_subtype" options.
wenzelm@47809
  1992
wenzelm@47809
  1993
  - Added "quickcheck_locale" configuration to specify how to process
wenzelm@47809
  1994
    conjectures in a locale context.
wenzelm@47809
  1995
wenzelm@47855
  1996
* Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
wenzelm@47855
  1997
and affecting 'rat' and 'real'.
wenzelm@47809
  1998
wenzelm@47809
  1999
* Sledgehammer:
wenzelm@47809
  2000
  - Integrated more tightly with SPASS, as described in the ITP 2012
wenzelm@47809
  2001
    paper "More SPASS with Isabelle".
wenzelm@47809
  2002
  - Made it try "smt" as a fallback if "metis" fails or times out.
wenzelm@47809
  2003
  - Added support for the following provers: Alt-Ergo (via Why3 and
wenzelm@47809
  2004
    TFF1), iProver, iProver-Eq.
wenzelm@47809
  2005
  - Sped up the minimizer.
wenzelm@47809
  2006
  - Added "lam_trans", "uncurry_aliases", and "minimize" options.
wenzelm@47809
  2007
  - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
wenzelm@47809
  2008
  - Renamed "sound" option to "strict".
wenzelm@47809
  2009
wenzelm@47855
  2010
* Metis: Added possibility to specify lambda translations scheme as a
wenzelm@47855
  2011
parenthesized argument (e.g., "by (metis (lifting) ...)").
wenzelm@47855
  2012
wenzelm@47855
  2013
* SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
wenzelm@47855
  2014
wenzelm@47855
  2015
* Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
wenzelm@47809
  2016
wenzelm@47856
  2017
* New "case_product" attribute to generate a case rule doing multiple
wenzelm@47856
  2018
case distinctions at the same time.  E.g.
wenzelm@47856
  2019
wenzelm@47856
  2020
  list.exhaust [case_product nat.exhaust]
wenzelm@47856
  2021
wenzelm@47856
  2022
produces a rule which can be used to perform case distinction on both
wenzelm@47856
  2023
a list and a nat.
wenzelm@47856
  2024
wenzelm@47809
  2025
* New "eventually_elim" method as a generalized variant of the
wenzelm@47855
  2026
eventually_elim* rules.  Supports structured proofs.
wenzelm@47855
  2027
wenzelm@47702
  2028
* Typedef with implicit set definition is considered legacy.  Use
wenzelm@47702
  2029
"typedef (open)" form instead, which will eventually become the
wenzelm@47702
  2030
default.
wenzelm@47702
  2031
wenzelm@47856
  2032
* Record: code generation can be switched off manually with
wenzelm@47856
  2033
wenzelm@47856
  2034
  declare [[record_coden = false]]  -- "default true"
wenzelm@47856
  2035
wenzelm@47856
  2036
* Datatype: type parameters allow explicit sort constraints.
wenzelm@47856
  2037
wenzelm@47855
  2038
* Concrete syntax for case expressions includes constraints for source
wenzelm@47855
  2039
positions, and thus produces Prover IDE markup for its bindings.
wenzelm@47855
  2040
INCOMPATIBILITY for old-style syntax translations that augment the
wenzelm@47855
  2041
pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
wenzelm@47855
  2042
one_case.
wenzelm@47855
  2043
wenzelm@47855
  2044
* Clarified attribute "mono_set": pure declaration without modifying
wenzelm@47855
  2045
the result of the fact expression.
wenzelm@47855
  2046
haftmann@46752
  2047
* More default pred/set conversions on a couple of relation operations
wenzelm@47464
  2048
and predicates.  Added powers of predicate relations.  Consolidation
wenzelm@47464
  2049
of some relation theorems:
haftmann@46752
  2050
haftmann@46752
  2051
  converse_def ~> converse_unfold
haftmann@47549
  2052
  rel_comp_def ~> relcomp_unfold
haftmann@47820
  2053
  symp_def ~> (modified, use symp_def and sym_def instead)
haftmann@46752
  2054
  transp_def ~> transp_trans
haftmann@46752
  2055
  Domain_def ~> Domain_unfold
haftmann@46752
  2056
  Range_def ~> Domain_converse [symmetric]
haftmann@46752
  2057
haftmann@46981
  2058
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
haftmann@46981
  2059
wenzelm@47464
  2060
See theory "Relation" for examples for making use of pred/set
wenzelm@47464
  2061
conversions by means of attributes "to_set" and "to_pred".
haftmann@47086
  2062
haftmann@46752
  2063
INCOMPATIBILITY.
haftmann@46752
  2064
bulwahn@46363
  2065
* Renamed facts about the power operation on relations, i.e., relpow
wenzelm@47464
  2066
to match the constant's name:
wenzelm@47463
  2067
wenzelm@46458
  2068
  rel_pow_1 ~> relpow_1
bulwahn@46363
  2069
  rel_pow_0_I ~> relpow_0_I
bulwahn@46363
  2070
  rel_pow_Suc_I ~> relpow_Suc_I
bulwahn@46363
  2071
  rel_pow_Suc_I2 ~> relpow_Suc_I2
bulwahn@46363
  2072
  rel_pow_0_E ~> relpow_0_E
bulwahn@46363
  2073
  rel_pow_Suc_E ~> relpow_Suc_E
bulwahn@46363
  2074
  rel_pow_E ~> relpow_E
wenzelm@46458
  2075
  rel_pow_Suc_D2 ~> relpow_Suc_D2
wenzelm@47463
  2076
  rel_pow_Suc_E2 ~> relpow_Suc_E2
bulwahn@46363
  2077
  rel_pow_Suc_D2' ~> relpow_Suc_D2'
bulwahn@46363
  2078
  rel_pow_E2 ~> relpow_E2
bulwahn@46363
  2079
  rel_pow_add ~> relpow_add
bulwahn@46363
  2080
  rel_pow_commute ~> relpow
bulwahn@46363
  2081
  rel_pow_empty ~> relpow_empty:
bulwahn@46363
  2082
  rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
bulwahn@46363
  2083
  rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
bulwahn@46363
  2084
  rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
bulwahn@46363
  2085
  rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
bulwahn@46363
  2086
  rel_pow_fun_conv ~> relpow_fun_conv
bulwahn@46363
  2087
  rel_pow_finite_bounded1 ~> relpow_finite_bounded1
bulwahn@46363
  2088
  rel_pow_finite_bounded ~> relpow_finite_bounded
bulwahn@46363
  2089
  rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
bulwahn@46363
  2090
  trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
bulwahn@46363
  2091
  single_valued_rel_pow ~> single_valued_relpow
wenzelm@47463
  2092
bulwahn@46363
  2093
INCOMPATIBILITY.
bulwahn@46363
  2094
bulwahn@47448
  2095
* Theory Relation: Consolidated constant name for relation composition
wenzelm@47464
  2096
and corresponding theorem names:
wenzelm@47464
  2097
haftmann@47549
  2098
  - Renamed constant rel_comp to relcomp.
wenzelm@47464
  2099
bulwahn@47448
  2100
  - Dropped abbreviation pred_comp. Use relcompp instead.
wenzelm@47464
  2101
bulwahn@47448
  2102
  - Renamed theorems:
wenzelm@47464
  2103
bulwahn@47448
  2104
    rel_compI ~> relcompI
bulwahn@47448
  2105
    rel_compEpair ~> relcompEpair
bulwahn@47448
  2106
    rel_compE ~> relcompE
bulwahn@47448
  2107
    pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
bulwahn@47448
  2108
    rel_comp_empty1 ~> relcomp_empty1
bulwahn@47448
  2109
    rel_comp_mono ~> relcomp_mono
bulwahn@47448
  2110
    rel_comp_subset_Sigma ~> relcomp_subset_Sigma
bulwahn@47448
  2111
    rel_comp_distrib ~> relcomp_distrib
bulwahn@47448
  2112
    rel_comp_distrib2 ~> relcomp_distrib2
bulwahn@47448
  2113
    rel_comp_UNION_distrib ~> relcomp_UNION_distrib
bulwahn@47448
  2114
    rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
bulwahn@47448
  2115
    single_valued_rel_comp ~> single_valued_relcomp
haftmann@47549
  2116
    rel_comp_def ~> relcomp_unfold
bulwahn@47448
  2117
    converse_rel_comp ~> converse_relcomp
bulwahn@47448
  2118
    pred_compI ~> relcomppI
bulwahn@47448
  2119
    pred_compE ~> relcomppE
bulwahn@47448
  2120
    pred_comp_bot1 ~> relcompp_bot1
bulwahn@47448
  2121
    pred_comp_bot2 ~> relcompp_bot2
bulwahn@47448
  2122
    transp_pred_comp_less_eq ~> transp_relcompp_less_eq
bulwahn@47448
  2123
    pred_comp_mono ~> relcompp_mono
bulwahn@47448
  2124
    pred_comp_distrib ~> relcompp_distrib
bulwahn@47448
  2125
    pred_comp_distrib2 ~> relcompp_distrib2
bulwahn@47448
  2126
    converse_pred_comp ~> converse_relcompp
wenzelm@47464
  2127
bulwahn@47448
  2128
    finite_rel_comp ~> finite_relcomp
wenzelm@47464
  2129
bulwahn@47448
  2130
    set_rel_comp ~> set_relcomp
bulwahn@47448
  2131
bulwahn@47448
  2132
INCOMPATIBILITY.
bulwahn@47448
  2133
haftmann@47550
  2134
* Theory Divides: Discontinued redundant theorems about div and mod.
haftmann@47550
  2135
INCOMPATIBILITY, use the corresponding generic theorems instead.
haftmann@47550
  2136
haftmann@47550
  2137
  DIVISION_BY_ZERO ~> div_by_0, mod_by_0
haftmann@47550
  2138
  zdiv_self ~> div_self
haftmann@47550
  2139
  zmod_self ~> mod_self
haftmann@47550
  2140
  zdiv_zero ~> div_0
haftmann@47550
  2141
  zmod_zero ~> mod_0
haftmann@47550
  2142
  zdiv_zmod_equality ~> div_mod_equality2
haftmann@47550
  2143
  zdiv_zmod_equality2 ~> div_mod_equality
haftmann@47550
  2144
  zmod_zdiv_trivial ~> mod_div_trivial
haftmann@47550
  2145
  zdiv_zminus_zminus ~> div_minus_minus
haftmann@47550
  2146
  zmod_zminus_zminus ~> mod_minus_minus
haftmann@47550
  2147
  zdiv_zminus2 ~> div_minus_right
haftmann@47550
  2148
  zmod_zminus2 ~> mod_minus_right
haftmann@47550
  2149
  zdiv_minus1_right ~> div_minus1_right
haftmann@47550
  2150
  zmod_minus1_right ~> mod_minus1_right
haftmann@47550
  2151
  zdvd_mult_div_cancel ~> dvd_mult_div_cancel
haftmann@47550
  2152
  zmod_zmult1_eq ~> mod_mult_right_eq
haftmann@47550
  2153
  zpower_zmod ~> power_mod
haftmann@47550
  2154
  zdvd_zmod ~> dvd_mod
haftmann@47550
  2155
  zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
haftmann@47550
  2156
  mod_mult_distrib ~> mult_mod_left
haftmann@47550
  2157
  mod_mult_distrib2 ~> mult_mod_right
haftmann@47550
  2158
haftmann@47550
  2159
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
haftmann@47550
  2160
generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
haftmann@47550
  2161
haftmann@47551
  2162
* Finite_Set.fold now qualified.  INCOMPATIBILITY.
haftmann@47551
  2163
haftmann@47552
  2164
* Consolidated theorem names concerning fold combinators:
haftmann@47550
  2165
haftmann@47550
  2166
  inf_INFI_fold_inf ~> inf_INF_fold_inf
haftmann@47550
  2167
  sup_SUPR_fold_sup ~> sup_SUP_fold_sup
haftmann@47550
  2168
  INFI_fold_inf ~> INF_fold_inf
haftmann@47550
  2169
  SUPR_fold_sup ~> SUP_fold_sup
haftmann@47550
  2170
  union_set ~> union_set_fold
haftmann@47550
  2171
  minus_set ~> minus_set_fold
haftmann@47550
  2172
  INFI_set_fold ~> INF_set_fold
haftmann@47550
  2173
  SUPR_set_fold ~> SUP_set_fold
haftmann@47550
  2174
  INF_code ~> INF_set_foldr
haftmann@47550
  2175
  SUP_code ~> SUP_set_foldr
haftmann@47550
  2176
  foldr.simps ~> foldr.simps (in point-free formulation)
haftmann@47550
  2177
  foldr_fold_rev ~> foldr_conv_fold
haftmann@47550
  2178
  foldl_fold ~> foldl_conv_fold
haftmann@47550
  2179
  foldr_foldr ~> foldr_conv_foldl
haftmann@47550
  2180
  foldl_foldr ~> foldl_conv_foldr
haftmann@47552
  2181
  fold_set_remdups ~> fold_set_fold_remdups
haftmann@47552
  2182
  fold_set ~> fold_set_fold
haftmann@47552
  2183
  fold1_set ~> fold1_set_fold
haftmann@47550
  2184
haftmann@47550
  2185
INCOMPATIBILITY.
haftmann@47550
  2186
haftmann@47550
  2187
* Dropped rarely useful theorems concerning fold combinators:
haftmann@47550
  2188
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
haftmann@47550
  2189
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
haftmann@47550
  2190
concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
haftmann@47550
  2191
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
haftmann@47550
  2192
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
haftmann@47550
  2193
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
haftmann@47550
  2194
INCOMPATIBILITY.  For the common phrases "%xs. List.foldr plus xs 0"
haftmann@47550
  2195
and "List.foldl plus 0", prefer "List.listsum".  Otherwise it can be
haftmann@47550
  2196
useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
haftmann@47550
  2197
unfolding "foldr_conv_fold" and "foldl_conv_fold".
haftmann@47550
  2198
haftmann@47550
  2199
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
haftmann@47550
  2200
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
haftmann@47550
  2201
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
haftmann@47550
  2202
INF_set_foldr, SUP_set_foldr.  INCOMPATIBILITY.  Prefer corresponding
haftmann@47550
  2203
lemmas over fold rather than foldr, or make use of lemmas
haftmann@47550
  2204
fold_conv_foldr and fold_rev.
haftmann@47550
  2205
haftmann@47550
  2206
* Congruence rules Option.map_cong and Option.bind_cong for recursion
haftmann@47550
  2207
through option types.
haftmann@47550
  2208
wenzelm@47856
  2209
* "Transitive_Closure.ntrancl": bounded transitive closure on
wenzelm@47856
  2210
relations.
wenzelm@47856
  2211
wenzelm@47856
  2212
* Constant "Set.not_member" now qualified.  INCOMPATIBILITY.
wenzelm@47856
  2213
wenzelm@47856
  2214
* Theory Int: Discontinued many legacy theorems specific to type int.
wenzelm@47856
  2215
INCOMPATIBILITY, use the corresponding generic theorems instead.
wenzelm@47856
  2216
wenzelm@47856
  2217
  zminus_zminus ~> minus_minus
wenzelm@47856
  2218
  zminus_0 ~> minus_zero
wenzelm@47856
  2219
  zminus_zadd_distrib ~> minus_add_distrib
wenzelm@47856
  2220
  zadd_commute ~> add_commute
wenzelm@47856
  2221
  zadd_assoc ~> add_assoc
wenzelm@47856
  2222
  zadd_left_commute ~> add_left_commute
wenzelm@47856
  2223
  zadd_ac ~> add_ac
wenzelm@47856
  2224
  zmult_ac ~> mult_ac
wenzelm@47856
  2225
  zadd_0 ~> add_0_left
wenzelm@47856
  2226
  zadd_0_right ~> add_0_right
wenzelm@47856
  2227
  zadd_zminus_inverse2 ~> left_minus
wenzelm@47856
  2228
  zmult_zminus ~> mult_minus_left
wenzelm@47856
  2229
  zmult_commute ~> mult_commute
wenzelm@47856
  2230
  zmult_assoc ~> mult_assoc
wenzelm@47856
  2231
  zadd_zmult_distrib ~> left_distrib
wenzelm@47856
  2232
  zadd_zmult_distrib2 ~> right_distrib
wenzelm@47856
  2233
  zdiff_zmult_distrib ~> left_diff_distrib
wenzelm@47856
  2234
  zdiff_zmult_distrib2 ~> right_diff_distrib
wenzelm@47856
  2235
  zmult_1 ~> mult_1_left
wenzelm@47856
  2236
  zmult_1_right ~> mult_1_right
wenzelm@47856
  2237
  zle_refl ~> order_refl
wenzelm@47856
  2238
  zle_trans ~> order_trans
wenzelm@47856
  2239
  zle_antisym ~> order_antisym
wenzelm@47856
  2240
  zle_linear ~> linorder_linear
wenzelm@47856
  2241
  zless_linear ~> linorder_less_linear
wenzelm@47856
  2242
  zadd_left_mono ~> add_left_mono
wenzelm@47856
  2243
  zadd_strict_right_mono ~> add_strict_right_mono
wenzelm@47856
  2244
  zadd_zless_mono ~> add_less_le_mono
wenzelm@47856
  2245
  int_0_less_1 ~> zero_less_one
wenzelm@47856
  2246
  int_0_neq_1 ~> zero_neq_one
wenzelm@47856
  2247
  zless_le ~> less_le
wenzelm@47856
  2248
  zpower_zadd_distrib ~> power_add
wenzelm@47856
  2249
  zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
wenzelm@47856
  2250
  zero_le_zpower_abs ~> zero_le_power_abs
wenzelm@47856
  2251
wenzelm@47856
  2252
* Theory Deriv: Renamed
wenzelm@47856
  2253
wenzelm@47856
  2254
  DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
wenzelm@47856
  2255
wenzelm@47856
  2256
* Theory Library/Multiset: Improved code generation of multisets.
wenzelm@47856
  2257
wenzelm@47855
  2258
* Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
krauss@47703
  2259
are expressed via type classes again. The special syntax
krauss@47703
  2260
\<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
krauss@47703
  2261
setsum_set, which is now subsumed by Big_Operators.setsum.
krauss@47703
  2262
INCOMPATIBILITY.
krauss@47703
  2263
wenzelm@46160
  2264
* Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
wenzelm@46160
  2265
use theory HOL/Library/Nat_Bijection instead.
wenzelm@46160
  2266
wenzelm@47464
  2267
* Theory HOL/Library/RBT_Impl: Backing implementation of red-black
wenzelm@47464
  2268
trees is now inside a type class context.  Names of affected
wenzelm@47464
  2269
operations and lemmas have been prefixed by rbt_.  INCOMPATIBILITY for
wenzelm@47464
  2270
theories working directly with raw red-black trees, adapt the names as
wenzelm@47464
  2271
follows:
Andreas@47452
  2272
Andreas@47452
  2273
  Operations:
Andreas@47452
  2274
  bulkload -> rbt_bulkload
Andreas@47452
  2275
  del_from_left -> rbt_del_from_left
Andreas@47452
  2276
  del_from_right -> rbt_del_from_right
Andreas@47452
  2277
  del -> rbt_del
Andreas@47452
  2278
  delete -> rbt_delete
Andreas@47452
  2279
  ins -> rbt_ins
Andreas@47452
  2280
  insert -> rbt_insert
Andreas@47452
  2281
  insertw -> rbt_insert_with
Andreas@47452
  2282
  insert_with_key -> rbt_insert_with_key
Andreas@47452
  2283
  map_entry -> rbt_map_entry
Andreas@47452
  2284
  lookup -> rbt_lookup
Andreas@47452
  2285
  sorted -> rbt_sorted
Andreas@47452
  2286
  tree_greater -> rbt_greater
Andreas@47452
  2287
  tree_less -> rbt_less
Andreas@47452
  2288
  tree_less_symbol -> rbt_less_symbol
Andreas@47452
  2289
  union -> rbt_union
Andreas@47452
  2290
  union_with -> rbt_union_with
Andreas@47452
  2291
  union_with_key -> rbt_union_with_key
Andreas@47452
  2292
Andreas@47452
  2293
  Lemmas:
Andreas@47452
  2294
  balance_left_sorted -> balance_left_rbt_sorted
Andreas@47452
  2295
  balance_left_tree_greater -> balance_left_rbt_greater
Andreas@47452
  2296
  balance_left_tree_less -> balance_left_rbt_less
Andreas@47452
  2297
  balance_right_sorted -> balance_right_rbt_sorted
Andreas@47452
  2298
  balance_right_tree_greater -> balance_right_rbt_greater
Andreas@47452
  2299
  balance_right_tree_less -> balance_right_rbt_less
Andreas@47452
  2300
  balance_sorted -> balance_rbt_sorted
Andreas@47452
  2301
  balance_tree_greater -> balance_rbt_greater
Andreas@47452
  2302
  balance_tree_less -> balance_rbt_less
Andreas@47452
  2303
  bulkload_is_rbt -> rbt_bulkload_is_rbt
Andreas@47452
  2304
  combine_sorted -> combine_rbt_sorted
Andreas@47452
  2305
  combine_tree_greater -> combine_rbt_greater
Andreas@47452
  2306
  combine_tree_less -> combine_rbt_less
Andreas@47452
  2307
  delete_in_tree -> rbt_delete_in_tree
Andreas@47452
  2308
  delete_is_rbt -> rbt_delete_is_rbt
Andreas@47452
  2309
  del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
Andreas@47452
  2310
  del_from_left_tree_less -> rbt_del_from_left_rbt_less
Andreas@47452
  2311
  del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
Andreas@47452
  2312
  del_from_right_tree_less -> rbt_del_from_right_rbt_less
Andreas@47452
  2313
  del_in_tree -> rbt_del_in_tree
Andreas@47452
  2314
  del_inv1_inv2 -> rbt_del_inv1_inv2
Andreas@47452
  2315
  del_sorted -> rbt_del_rbt_sorted
Andreas@47452
  2316
  del_tree_greater -> rbt_del_rbt_greater
Andreas@47452
  2317
  del_tree_less -> rbt_del_rbt_less
Andreas@47452
  2318
  dom_lookup_Branch -> dom_rbt_lookup_Branch
Andreas@47452
  2319
  entries_lookup -> entries_rbt_lookup
Andreas@47452
  2320
  finite_dom_lookup -> finite_dom_rbt_lookup
Andreas@47452
  2321
  insert_sorted -> rbt_insert_rbt_sorted
Andreas@47452
  2322
  insertw_is_rbt -> rbt_insertw_is_rbt
Andreas@47452
  2323
  insertwk_is_rbt -> rbt_insertwk_is_rbt
Andreas@47452
  2324
  insertwk_sorted -> rbt_insertwk_rbt_sorted
Andreas@47452
  2325
  insertw_sorted -> rbt_insertw_rbt_sorted
Andreas@47452
  2326
  ins_sorted -> ins_rbt_sorted
Andreas@47452
  2327
  ins_tree_greater -> ins_rbt_greater
Andreas@47452
  2328
  ins_tree_less -> ins_rbt_less
Andreas@47452
  2329
  is_rbt_sorted -> is_rbt_rbt_sorted
Andreas@47452
  2330
  lookup_balance -> rbt_lookup_balance
Andreas@47452
  2331
  lookup_bulkload -> rbt_lookup_rbt_bulkload
Andreas@47452
  2332
  lookup_delete -> rbt_lookup_rbt_delete
Andreas@47452
  2333
  lookup_Empty -> rbt_lookup_Empty
Andreas@47452
  2334
  lookup_from_in_tree -> rbt_lookup_from_in_tree
Andreas@47452
  2335
  lookup_in_tree -> rbt_lookup_in_tree
Andreas@47452
  2336
  lookup_ins -> rbt_lookup_ins
Andreas@47452
  2337
  lookup_insert -> rbt_lookup_rbt_insert
Andreas@47452
  2338
  lookup_insertw -> rbt_lookup_rbt_insertw
Andreas@47452
  2339
  lookup_insertwk -> rbt_lookup_rbt_insertwk
Andreas@47452
  2340
  lookup_keys -> rbt_lookup_keys
Andreas@47452
  2341
  lookup_map -> rbt_lookup_map
Andreas@47452
  2342
  lookup_map_entry -> rbt_lookup_rbt_map_entry
Andreas@47452
  2343
  lookup_tree_greater -> rbt_lookup_rbt_greater
Andreas@47452
  2344
  lookup_tree_less -> rbt_lookup_rbt_less
Andreas@47452
  2345
  lookup_union -> rbt_lookup_rbt_union
Andreas@47452
  2346
  map_entry_color_of -> rbt_map_entry_color_of
Andreas@47452
  2347
  map_entry_inv1 -> rbt_map_entry_inv1
Andreas@47452
  2348
  map_entry_inv2 -> rbt_map_entry_inv2
Andreas@47452
  2349
  map_entry_is_rbt -> rbt_map_entry_is_rbt
Andreas@47452
  2350
  map_entry_sorted -> rbt_map_entry_rbt_sorted
Andreas@47452
  2351
  map_entry_tree_greater -> rbt_map_entry_rbt_greater
Andreas@47452
  2352
  map_entry_tree_less -> rbt_map_entry_rbt_less
Andreas@47452
  2353
  map_tree_greater -> map_rbt_greater
Andreas@47452
  2354
  map_tree_less -> map_rbt_less
Andreas@47452
  2355
  map_sorted -> map_rbt_sorted
Andreas@47452
  2356
  paint_sorted -> paint_rbt_sorted
Andreas@47452
  2357
  paint_lookup -> paint_rbt_lookup
Andreas@47452
  2358
  paint_tree_greater -> paint_rbt_greater
Andreas@47452
  2359
  paint_tree_less -> paint_rbt_less
Andreas@47452
  2360
  sorted_entries -> rbt_sorted_entries
Andreas@47452
  2361
  tree_greater_eq_trans -> rbt_greater_eq_trans
Andreas@47452
  2362
  tree_greater_nit -> rbt_greater_nit
Andreas@47452
  2363
  tree_greater_prop -> rbt_greater_prop
Andreas@47452
  2364
  tree_greater_simps -> rbt_greater_simps
Andreas@47452
  2365
  tree_greater_trans -> rbt_greater_trans
Andreas@47452
  2366
  tree_less_eq_trans -> rbt_less_eq_trans
Andreas@47452
  2367
  tree_less_nit -> rbt_less_nit
Andreas@47452
  2368
  tree_less_prop -> rbt_less_prop
Andreas@47452
  2369
  tree_less_simps -> rbt_less_simps
Andreas@47452
  2370
  tree_less_trans -> rbt_less_trans
Andreas@47452
  2371
  tree_ord_props -> rbt_ord_props
Andreas@47452
  2372
  union_Branch -> rbt_union_Branch
Andreas@47452
  2373
  union_is_rbt -> rbt_union_is_rbt
Andreas@47452
  2374
  unionw_is_rbt -> rbt_unionw_is_rbt
Andreas@47452
  2375
  unionwk_is_rbt -> rbt_unionwk_is_rbt
Andreas@47452
  2376
  unionwk_sorted -> rbt_unionwk_rbt_sorted
Andreas@47452
  2377
wenzelm@47807
  2378
* Theory HOL/Library/Float: Floating point numbers are now defined as
wenzelm@47807
  2379
a subset of the real numbers.  All operations are defined using the
wenzelm@47807
  2380
lifing-framework and proofs use the transfer method.  INCOMPATIBILITY.
hoelzl@47616
  2381
hoelzl@47616
  2382
  Changed Operations:
hoelzl@47622
  2383
  float_abs -> abs
hoelzl@47622
  2384
  float_nprt -> nprt
hoelzl@47622
  2385
  float_pprt -> pprt
hoelzl@47622
  2386
  pow2 -> use powr
hoelzl@47622
  2387
  round_down -> float_round_down
hoelzl@47622
  2388
  round_up -> float_round_up
hoelzl@47622
  2389
  scale -> exponent
hoelzl@47622
  2390
hoelzl@47622
  2391
  Removed Operations:
hoelzl@47622
  2392
  ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
hoelzl@47622
  2393
hoelzl@47622
  2394
  Renamed Lemmas:
hoelzl@47622
  2395
  abs_float_def -> Float.compute_float_abs
hoelzl@47622
  2396
  bitlen_ge0 -> bitlen_nonneg
hoelzl@47622
  2397
  bitlen.simps -> Float.compute_bitlen
hoelzl@47622
  2398
  float_components -> Float_mantissa_exponent
hoelzl@47622
  2399
  float_divl.simps -> Float.compute_float_divl
hoelzl@47622
  2400
  float_divr.simps -> Float.compute_float_divr
hoelzl@47622
  2401
  float_eq_odd -> mult_powr_eq_mult_powr_iff
hoelzl@47622
  2402
  float_power -> real_of_float_power
hoelzl@47622
  2403
  lapprox_posrat_def -> Float.compute_lapprox_posrat
hoelzl@47622
  2404
  lapprox_rat.simps -> Float.compute_lapprox_rat
hoelzl@47622
  2405
  le_float_def' -> Float.compute_float_le
hoelzl@47622
  2406
  le_float_def -> less_eq_float.rep_eq
hoelzl@47622
  2407
  less_float_def' -> Float.compute_float_less
hoelzl@47622
  2408
  less_float_def -> less_float.rep_eq
hoelzl@47622
  2409
  normfloat_def -> Float.compute_normfloat
hoelzl@47622
  2410
  normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
hoelzl@47622
  2411
  normfloat -> normfloat_def
hoelzl@47622
  2412
  normfloat_unique -> use normfloat_def
hoelzl@47622
  2413
  number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
hoelzl@47622
  2414
  one_float_def -> Float.compute_float_one
hoelzl@47622
  2415
  plus_float_def -> Float.compute_float_plus
hoelzl@47622
  2416
  rapprox_posrat_def -> Float.compute_rapprox_posrat
hoelzl@47622
  2417
  rapprox_rat.simps -> Float.compute_rapprox_rat
hoelzl@47622
  2418
  real_of_float_0 -> zero_float.rep_eq
hoelzl@47622
  2419
  real_of_float_1 -> one_float.rep_eq
hoelzl@47622
  2420
  real_of_float_abs -> abs_float.rep_eq
hoelzl@47622
  2421
  real_of_float_add -> plus_float.rep_eq
hoelzl@47622
  2422
  real_of_float_minus -> uminus_float.rep_eq
hoelzl@47622
  2423
  real_of_float_mult -> times_float.rep_eq
hoelzl@47622
  2424
  real_of_float_simp -> Float.rep_eq
hoelzl@47622
  2425
  real_of_float_sub -> minus_float.rep_eq
hoelzl@47622
  2426
  round_down.simps -> Float.compute_float_round_down
hoelzl@47622
  2427
  round_up.simps -> Float.compute_float_round_up
hoelzl@47622
  2428
  times_float_def -> Float.compute_float_times
hoelzl@47622
  2429
  uminus_float_def -> Float.compute_float_uminus
hoelzl@47622
  2430
  zero_float_def -> Float.compute_float_zero
hoelzl@47622
  2431
hoelzl@47622
  2432
  Lemmas not necessary anymore, use the transfer method:
hoelzl@47622
  2433
  bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
hoelzl@47622
  2434
  float_divr, float_le_simp, float_less1_mantissa_bound,
hoelzl@47622
  2435
  float_less_simp, float_less_zero, float_le_zero,
hoelzl@47622
  2436
  float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
hoelzl@47622
  2437
  floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
hoelzl@47622
  2438
  lapprox_rat_bottom, normalized_float, rapprox_posrat,
hoelzl@47622
  2439
  rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
hoelzl@47622
  2440
  real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
hoelzl@47622
  2441
  round_up, zero_le_float, zero_less_float
hoelzl@47616
  2442
wenzelm@47856
  2443
* New theory HOL/Library/DAList provides an abstract type for
wenzelm@47856
  2444
association lists with distinct keys.
noschinl@45791
  2445
wenzelm@47866
  2446
* Session HOL/IMP: Added new theory of abstract interpretation of
wenzelm@47866
  2447
annotated commands.
wenzelm@47866
  2448
wenzelm@47855
  2449
* Session HOL-Import: Re-implementation from scratch is faster,
wenzelm@47855
  2450
simpler, and more scalable.  Requires a proof bundle, which is
wenzelm@47855
  2451
available as an external component.  Discontinued old (and mostly
wenzelm@47855
  2452
dead) Importer for HOL4 and HOL Light.  INCOMPATIBILITY.
wenzelm@47855
  2453
wenzelm@47855
  2454
* Session HOL-Word: Discontinued many redundant theorems specific to
wenzelm@47855
  2455
type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
wenzelm@47855
  2456
instead.
wenzelm@47855
  2457
wenzelm@47855
  2458
  word_sub_alt ~> word_sub_wi
wenzelm@47855
  2459
  word_add_alt ~> word_add_def
wenzelm@47855
  2460
  word_mult_alt ~> word_mult_def
wenzelm@47855
  2461
  word_minus_alt ~> word_minus_def
wenzelm@47855
  2462
  word_0_alt ~> word_0_wi
wenzelm@47855
  2463
  word_1_alt ~> word_1_wi
wenzelm@47855
  2464
  word_add_0 ~> add_0_left
wenzelm@47855
  2465
  word_add_0_right ~> add_0_right
wenzelm@47855
  2466
  word_mult_1 ~> mult_1_left
wenzelm@47855
  2467
  word_mult_1_right ~> mult_1_right
wenzelm@47855
  2468
  word_add_commute ~> add_commute
wenzelm@47855
  2469
  word_add_assoc ~> add_assoc
wenzelm@47855
  2470
  word_add_left_commute ~> add_left_commute
wenzelm@47855
  2471
  word_mult_commute ~> mult_commute
wenzelm@47855
  2472
  word_mult_assoc ~> mult_assoc
wenzelm@47855
  2473
  word_mult_left_commute ~> mult_left_commute
wenzelm@47855
  2474
  word_left_distrib ~> left_distrib
wenzelm@47855
  2475
  word_right_distrib ~> right_distrib
wenzelm@47855
  2476
  word_left_minus ~> left_minus
wenzelm@47855
  2477
  word_diff_0_right ~> diff_0_right
wenzelm@47855
  2478
  word_diff_self ~> diff_self
wenzelm@47855
  2479
  word_sub_def ~> diff_minus
wenzelm@47855
  2480
  word_diff_minus ~> diff_minus
wenzelm@47855
  2481
  word_add_ac ~> add_ac
wenzelm@47855
  2482
  word_mult_ac ~> mult_ac
wenzelm@47855
  2483
  word_plus_ac0 ~> add_0_left add_0_right add_ac
wenzelm@47855
  2484
  word_times_ac1 ~> mult_1_left mult_1_right mult_ac
wenzelm@47855
  2485
  word_order_trans ~> order_trans
wenzelm@47855
  2486
  word_order_refl ~> order_refl
wenzelm@47855
  2487
  word_order_antisym ~> order_antisym
wenzelm@47855
  2488
  word_order_linear ~> linorder_linear
wenzelm@47855
  2489
  lenw1_zero_neq_one ~> zero_neq_one
wenzelm@47855
  2490
  word_number_of_eq ~> number_of_eq
wenzelm@47855
  2491
  word_of_int_add_hom ~> wi_hom_add
wenzelm@47855
  2492
  word_of_int_sub_hom ~> wi_hom_sub
wenzelm@47855
  2493
  word_of_int_mult_hom ~> wi_hom_mult
wenzelm@47855
  2494
  word_of_int_minus_hom ~> wi_hom_neg
wenzelm@47855
  2495
  word_of_int_succ_hom ~> wi_hom_succ
wenzelm@47855
  2496
  word_of_int_pred_hom ~> wi_hom_pred
wenzelm@47855
  2497
  word_of_int_0_hom ~> word_0_wi
wenzelm@47855
  2498
  word_of_int_1_hom ~> word_1_wi
wenzelm@47855
  2499
wenzelm@47809
  2500
* Session HOL-Word: New proof method "word_bitwise" for splitting
wenzelm@47809
  2501
machine word equalities and inequalities into logical circuits,
wenzelm@47809
  2502
defined in HOL/Word/WordBitwise.thy.  Supports addition, subtraction,
wenzelm@47809
  2503
multiplication, shifting by constants, bitwise operators and numeric
wenzelm@47809
  2504
constants.  Requires fixed-length word types, not 'a word.  Solves
wenzelm@47854
  2505
many standard word identities outright and converts more into first
wenzelm@47809
  2506
order problems amenable to blast or similar.  See also examples in
wenzelm@47809
  2507
HOL/Word/Examples/WordExamples.thy.
wenzelm@47809
  2508
wenzelm@47807
  2509
* Session HOL-Probability: Introduced the type "'a measure" to
wenzelm@47807
  2510
represent measures, this replaces the records 'a algebra and 'a
wenzelm@47807
  2511
measure_space.  The locales based on subset_class now have two
wenzelm@47856
  2512
locale-parameters the space \<Omega> and the set of measurable sets M.
wenzelm@47856
  2513
The product of probability spaces uses now the same constant as the
wenzelm@47856
  2514
finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
wenzelm@47807
  2515
measure".  Most constants are defined now outside of locales and gain
wenzelm@47807
  2516
an additional parameter, like null_sets, almost_eventually or \<mu>'.
wenzelm@47807
  2517
Measure space constructions for distributions and densities now got
wenzelm@47807
  2518
their own constants distr and density.  Instead of using locales to
wenzelm@47807
  2519
describe measure spaces with a finite space, the measure count_space
wenzelm@47807
  2520
and point_measure is introduced.  INCOMPATIBILITY.
hoelzl@47694
  2521
hoelzl@47694
  2522
  Renamed constants:
hoelzl@47694
  2523
  measure -> emeasure
hoelzl@47694
  2524
  finite_measure.\<mu>' -> measure
hoelzl@47694
  2525
  product_algebra_generator -> prod_algebra
hoelzl@47694
  2526
  product_prob_space.emb -> prod_emb
hoelzl@47694
  2527
  product_prob_space.infprod_algebra -> PiM
hoelzl@47694
  2528
hoelzl@47694
  2529
  Removed locales:
hoelzl@47694
  2530
  completeable_measure_space
hoelzl@47694
  2531
  finite_measure_space
hoelzl@47694
  2532
  finite_prob_space
hoelzl@47694
  2533
  finite_product_finite_prob_space
hoelzl@47694
  2534
  finite_product_sigma_algebra
hoelzl@47694
  2535
  finite_sigma_algebra
hoelzl@47694
  2536
  measure_space
hoelzl@47694
  2537
  pair_finite_prob_space
hoelzl@47694
  2538
  pair_finite_sigma_algebra
hoelzl@47694
  2539
  pair_finite_space
hoelzl@47694
  2540
  pair_sigma_algebra
hoelzl@47694
  2541
  product_sigma_algebra
hoelzl@47694
  2542
hoelzl@47694
  2543
  Removed constants:
hoelzl@47751
  2544
  conditional_space
hoelzl@47694
  2545
  distribution -> use distr measure, or distributed predicate
hoelzl@47751
  2546
  image_space
hoelzl@47694
  2547
  joint_distribution -> use distr measure, or distributed predicate
hoelzl@47751
  2548
  pair_measure_generator
hoelzl@47694
  2549
  product_prob_space.infprod_algebra -> use PiM
hoelzl@47694
  2550
  subvimage
hoelzl@47694
  2551
hoelzl@47694
  2552
  Replacement theorems:
hoelzl@47751
  2553
  finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
hoelzl@47751
  2554
  finite_measure.empty_measure -> measure_empty
hoelzl@47751
  2555
  finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
hoelzl@47751
  2556
  finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
hoelzl@47751
  2557
  finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
hoelzl@47751
  2558
  finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
hoelzl@47751
  2559
  finite_measure.finite_measure -> finite_measure.emeasure_finite
hoelzl@47751
  2560
  finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
hoelzl@47751
  2561
  finite_measure.positive_measure' -> measure_nonneg
hoelzl@47751
  2562
  finite_measure.real_measure -> finite_measure.emeasure_real
hoelzl@47751
  2563
  finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
hoelzl@47751
  2564
  finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
hoelzl@47751
  2565
  finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
hoelzl@47751
  2566
  information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
hoelzl@47751
  2567
  information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
hoelzl@47751
  2568
  information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
hoelzl@47751
  2569
  information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
hoelzl@47751
  2570
  information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
hoelzl@47751
  2571
  information_space.entropy_commute -> information_space.entropy_commute_simple
hoelzl@47751
  2572
  information_space.entropy_eq -> information_space.entropy_simple_distributed
hoelzl@47751
  2573
  information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
hoelzl@47751
  2574
  information_space.entropy_positive -> information_space.entropy_nonneg_simple
hoelzl@47751
  2575
  information_space.entropy_uniform_max -> information_space.entropy_uniform
hoelzl@47751
  2576
  information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
hoelzl@47751
  2577
  information_space.KL_eq_0 -> information_space.KL_same_eq_0
hoelzl@47751
  2578
  information_space.KL_ge_0 -> information_space.KL_nonneg
hoelzl@47751
  2579
  information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
hoelzl@47751
  2580
  information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
hoelzl@47751
  2581
  Int_stable_cuboids -> Int_stable_atLeastAtMost
hoelzl@47751
  2582
  Int_stable_product_algebra_generator -> positive_integral
hoelzl@47751
  2583
  measure_preserving -> equality "distr M N f = N" "f : measurable M N"
hoelzl@47694
  2584
  measure_space.additive -> emeasure_additive
hoelzl@47751
  2585
  measure_space.AE_iff_null_set -> AE_iff_null
hoelzl@47751
  2586
  measure_space.almost_everywhere_def -> eventually_ae_filter
hoelzl@47751
  2587
  measure_space.almost_everywhere_vimage -> AE_distrD
hoelzl@47751
  2588
  measure_space.continuity_from_above -> INF_emeasure_decseq
hoelzl@47751
  2589
  measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
hoelzl@47751
  2590
  measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
hoelzl@47694
  2591
  measure_space.continuity_from_below -> SUP_emeasure_incseq
hoelzl@47751
  2592
  measure_space_density -> emeasure_density
hoelzl@47751
  2593
  measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
hoelzl@47751
  2594
  measure_space.integrable_vimage -> integrable_distr
hoelzl@47751
  2595
  measure_space.integral_translated_density -> integral_density
hoelzl@47751
  2596
  measure_space.integral_vimage -> integral_distr
hoelzl@47751
  2597
  measure_space.measure_additive -> plus_emeasure
hoelzl@47751
  2598
  measure_space.measure_compl -> emeasure_compl
hoelzl@47751
  2599
  measure_space.measure_countable_increasing -> emeasure_countable_increasing
hoelzl@47751
  2600
  measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
hoelzl@47694
  2601
  measure_space.measure_decseq -> decseq_emeasure
hoelzl@47751
  2602
  measure_space.measure_Diff -> emeasure_Diff
hoelzl@47751
  2603
  measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
hoelzl@47694
  2604
  measure_space.measure_eq_0 -> emeasure_eq_0
hoelzl@47694
  2605
  measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
hoelzl@47751
  2606
  measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
hoelzl@47751
  2607
  measure_space.measure_incseq -> incseq_emeasure
hoelzl@47751
  2608
  measure_space.measure_insert -> emeasure_insert
hoelzl@47751
  2609
  measure_space.measure_mono -> emeasure_mono
hoelzl@47751
  2610
  measure_space.measure_not_negative -> emeasure_not_MInf
hoelzl@47751
  2611
  measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
hoelzl@47751
  2612
  measure_space.measure_setsum -> setsum_emeasure
hoelzl@47751
  2613
  measure_space.measure_setsum_split -> setsum_emeasure_cover
hoelzl@47694
  2614
  measure_space.measure_space_vimage -> emeasure_distr
hoelzl@47751
  2615
  measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
hoelzl@47751
  2616
  measure_space.measure_subadditive -> subadditive
hoelzl@47751
  2617
  measure_space.measure_top -> emeasure_space
hoelzl@47751
  2618
  measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
hoelzl@47751
  2619
  measure_space.measure_Un_null_set -> emeasure_Un_null_set
hoelzl@47751
  2620
  measure_space.positive_integral_translated_density -> positive_integral_density
hoelzl@47751
  2621
  measure_space.positive_integral_vimage -> positive_integral_distr
hoelzl@47694
  2622
  measure_space.real_continuity_from_above -> Lim_measure_decseq
hoelzl@47751
  2623
  measure_space.real_continuity_from_below -> Lim_measure_incseq
hoelzl@47694
  2624
  measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
hoelzl@47751
  2625
  measure_space.real_measure_Diff -> measure_Diff
hoelzl@47751
  2626
  measure_space.real_measure_finite_Union -> measure_finite_Union
hoelzl@47751
  2627
  measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
hoelzl@47751
  2628
  measure_space.real_measure_subadditive -> measure_subadditive
hoelzl@47751
  2629
  measure_space.real_measure_Union -> measure_Union
hoelzl@47751
  2630
  measure_space.real_measure_UNION -> measure_UNION
hoelzl@47694
  2631
  measure_space.simple_function_vimage -> simple_function_comp
hoelzl@47694
  2632
  measure_space.simple_integral_vimage -> simple_integral_distr
hoelzl@47751
  2633
  measure_space.simple_integral_vimage -> simple_integral_distr
hoelzl@47751
  2634
  measure_unique_Int_stable -> measure_eqI_generator_eq
hoelzl@47751
  2635
  measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
hoelzl@47694
  2636
  pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
hoelzl@47694
  2637
  pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
hoelzl@47694
  2638
  pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
hoelzl@47694
  2639
  pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
hoelzl@47694
  2640
  pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
hoelzl@47694
  2641
  pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
hoelzl@47694
  2642
  pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
hoelzl@47694
  2643
  pair_sigma_algebra.sets_swap -> sets_pair_swap
hoelzl@47751
  2644
  pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
hoelzl@47751
  2645
  pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
hoelzl@47751
  2646
  pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
hoelzl@47751
  2647
  pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
hoelzl@47751
  2648
  pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
hoelzl@47751
  2649
  pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
hoelzl@47751
  2650
  prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
hoelzl@47751
  2651
  prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
hoelzl@47694
  2652
  prob_space.measure_space_1 -> prob_space.emeasure_space_1
hoelzl@47694
  2653
  prob_space.prob_space_vimage -> prob_space_distr
hoelzl@47694
  2654
  prob_space.random_variable_restrict -> measurable_restrict
hoelzl@47751
  2655
  prob_space_unique_Int_stable -> measure_eqI_prob_space
hoelzl@47751
  2656
  product_algebraE -> prod_algebraE_all
hoelzl@47751
  2657
  product_algebra_generator_der -> prod_algebra_eq_finite
hoelzl@47751
  2658
  product_algebra_generator_into_space -> prod_algebra_sets_into_space
hoelzl@47751
  2659
  product_algebraI -> sets_PiM_I_finite
hoelzl@47751
  2660
  product_measure_exists -> product_sigma_finite.sigma_finite
hoelzl@47694
  2661
  product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
hoelzl@47694
  2662
  product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
hoelzl@47694
  2663
  product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
hoelzl@47694
  2664
  product_prob_space.measurable_component -> measurable_component_singleton
hoelzl@47694
  2665
  product_prob_space.measurable_emb -> measurable_prod_emb
hoelzl@47694
  2666
  product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
hoelzl@47694
  2667
  product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
hoelzl@47694
  2668
  product_prob_space.measure_emb -> emeasure_prod_emb
hoelzl@47751
  2669
  product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
hoelzl@47751
  2670
  product_sigma_algebra.product_algebra_into_space -> space_closed
hoelzl@47751
  2671
  product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
hoelzl@47751
  2672
  product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
hoelzl@47751
  2673
  product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
hoelzl@47694
  2674
  sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
hoelzl@47751
  2675
  sets_product_algebra -> sets_PiM
hoelzl@47751
  2676
  sigma_algebra.measurable_sigma -> measurable_measure_of
hoelzl@47751
  2677
  sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
hoelzl@47751
  2678
  sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
hoelzl@47751
  2679
  sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
hoelzl@47751
  2680
  space_product_algebra -> space_PiM
hoelzl@47694
  2681
wenzelm@47855
  2682
* Session HOL-TPTP: support to parse and import TPTP problems (all
wenzelm@47855
  2683
languages) into Isabelle/HOL.
wenzelm@47413
  2684
blanchet@45398
  2685
noschinl@45160
  2686
*** FOL ***
noschinl@45160
  2687
wenzelm@45383
  2688
* New "case_product" attribute (see HOL).
noschinl@45160
  2689
wenzelm@45109
  2690
wenzelm@47463
  2691
*** ZF ***
wenzelm@47463
  2692
wenzelm@47463
  2693
* Greater support for structured proofs involving induction or case
wenzelm@47463
  2694
analysis.
wenzelm@47463
  2695
wenzelm@47463
  2696
* Much greater use of mathematical symbols.
wenzelm@47463
  2697
wenzelm@47463
  2698
* Removal of many ML theorem bindings.  INCOMPATIBILITY.
wenzelm@47463
  2699
wenzelm@47463
  2700
wenzelm@45128
  2701
*** ML ***
wenzelm@45128
  2702
wenzelm@46948
  2703
* Antiquotation @{keyword "name"} produces a parser for outer syntax
wenzelm@46948
  2704
from a minor keyword introduced via theory header declaration.
wenzelm@46948
  2705
wenzelm@46961
  2706
* Antiquotation @{command_spec "name"} produces the
wenzelm@46961
  2707
Outer_Syntax.command_spec from a major keyword introduced via theory
wenzelm@46961
  2708
header declaration; it can be passed to Outer_Syntax.command etc.
wenzelm@46961
  2709
wenzelm@46916
  2710
* Local_Theory.define no longer hard-wires default theorem name
wenzelm@46992
  2711
"foo_def", but retains the binding as given.  If that is Binding.empty
wenzelm@46992
  2712
/ Attrib.empty_binding, the result is not registered as user-level
wenzelm@46992
  2713
fact.  The Local_Theory.define_internal variant allows to specify a
wenzelm@46992
  2714
non-empty name (used for the foundation in the background theory),
wenzelm@46992
  2715
while omitting the fact binding in the user-context.  Potential
wenzelm@46992
  2716
INCOMPATIBILITY for derived definitional packages: need to specify
wenzelm@46992
  2717
naming policy for primitive definitions more explicitly.
wenzelm@46916
  2718
wenzelm@46497
  2719
* Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
wenzelm@46497
  2720
conformance with similar operations in structure Term and Logic.
wenzelm@46497
  2721
wenzelm@45592
  2722
* Antiquotation @{attributes [...]} embeds attribute source
wenzelm@45592
  2723
representation into the ML text, which is particularly useful with
wenzelm@45592
  2724
declarations like Local_Theory.note.
wenzelm@45592
  2725
wenzelm@45128
  2726
* Structure Proof_Context follows standard naming scheme.  Old
wenzelm@45128
  2727
ProofContext has been discontinued.  INCOMPATIBILITY.
wenzelm@45128
  2728
wenzelm@45293
  2729
* Refined Local_Theory.declaration {syntax, pervasive}, with subtle
wenzelm@45298
  2730
change of semantics: update is applied to auxiliary local theory
wenzelm@45293
  2731
context as well.
wenzelm@45293
  2732
wenzelm@45620
  2733
* Modernized some old-style infix operations:
wenzelm@45620
  2734
wenzelm@45620
  2735
  addeqcongs    ~> Simplifier.add_eqcong
wenzelm@45620
  2736
  deleqcongs    ~> Simplifier.del_eqcong
wenzelm@45620
  2737
  addcongs      ~> Simplifier.add_cong
wenzelm@45620
  2738