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