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