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