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