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