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