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