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