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