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