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