NEWS
author wenzelm
Mon Nov 21 23:29:53 2011 +0100 (2011-11-21)
changeset 45614 e19788cb0a1a
parent 45600 1bbbac9a0cb0
child 45620 f2a587696afb
permissions -rw-r--r--
NEWS;
wenzelm@5363
     1
Isabelle NEWS -- history user-relevant changes
wenzelm@5363
     2
==============================================
wenzelm@2553
     3
wenzelm@45109
     4
New in this Isabelle version
wenzelm@45109
     5
----------------------------
wenzelm@45109
     6
wenzelm@45593
     7
*** General ***
wenzelm@45593
     8
wenzelm@45614
     9
* Prover IDE (PIDE) improvements:
wenzelm@45614
    10
wenzelm@45614
    11
  - markup for bound variables
wenzelm@45614
    12
  - markup for types of term variables (e.g. displayed as tooltips)
wenzelm@45614
    13
wenzelm@45593
    14
* Rule attributes in local theory declarations (e.g. locale or class)
wenzelm@45593
    15
are now statically evaluated: the resulting theorem is stored instead
wenzelm@45593
    16
of the original expression.  INCOMPATIBILITY in rare situations, where
wenzelm@45593
    17
the historic accident of dynamic re-evaluation in interpretations
wenzelm@45593
    18
etc. was exploited.
wenzelm@45593
    19
wenzelm@45600
    20
* Commands 'lemmas' and 'theorems' allow local variables using 'for'
wenzelm@45600
    21
declaration, and results are standardized before being stored.  Thus
wenzelm@45600
    22
old-style "standard" after instantiation or composition of facts
wenzelm@45600
    23
becomes obsolete.  Minor INCOMPATIBILITY, due to potential change of
wenzelm@45600
    24
indices of schematic variables.
wenzelm@45600
    25
wenzelm@45593
    26
wenzelm@45134
    27
*** Pure ***
wenzelm@45134
    28
wenzelm@45134
    29
* Obsolete command 'types' has been discontinued.  Use 'type_synonym'
wenzelm@45134
    30
instead.  INCOMPATIBILITY.
wenzelm@45134
    31
bulwahn@45191
    32
* Ancient code generator for SML and its commands 'code_module',
wenzelm@45383
    33
'code_library', 'consts_code', 'types_code' have been discontinued.
wenzelm@45383
    34
Use commands of the generic code generator instead. INCOMPATIBILITY.
wenzelm@45383
    35
wenzelm@45383
    36
* Redundant attribute 'code_inline' has been discontinued. Use
wenzelm@45383
    37
'code_unfold' instead. INCOMPATIBILITY.
wenzelm@45383
    38
wenzelm@45427
    39
* Sort constraints are now propagated in simultaneous statements, just
wenzelm@45427
    40
like type constraints.  INCOMPATIBILITY in rare situations, where
wenzelm@45427
    41
distinct sorts used to be assigned accidentally.  For example:
wenzelm@45427
    42
wenzelm@45427
    43
  lemma "P (x::'a::foo)" and "Q (y::'a::bar)"  -- "now illegal"
wenzelm@45427
    44
wenzelm@45427
    45
  lemma "P (x::'a)" and "Q (y::'a::bar)"
wenzelm@45427
    46
    -- "now uniform 'a::bar instead of default sort for first occurence (!)"
wenzelm@45427
    47
wenzelm@45427
    48
huffman@45122
    49
*** HOL ***
huffman@45122
    50
huffman@45546
    51
* Session HOL-Word: Discontinued many redundant theorems specific to type
huffman@45546
    52
'a word. INCOMPATIBILITY, use the corresponding generic theorems instead.
huffman@45546
    53
huffman@45546
    54
  word_sub_alt ~> word_sub_wi
huffman@45546
    55
  word_add_alt ~> word_add_def
huffman@45546
    56
  word_mult_alt ~> word_mult_def
huffman@45546
    57
  word_minus_alt ~> word_minus_def
huffman@45546
    58
  word_0_alt ~> word_0_wi
huffman@45546
    59
  word_1_alt ~> word_1_wi
huffman@45546
    60
  word_add_0 ~> add_0_left
huffman@45546
    61
  word_add_0_right ~> add_0_right
huffman@45546
    62
  word_mult_1 ~> mult_1_left
huffman@45546
    63
  word_mult_1_right ~> mult_1_right
huffman@45546
    64
  word_add_commute ~> add_commute
huffman@45546
    65
  word_add_assoc ~> add_assoc
huffman@45546
    66
  word_add_left_commute ~> add_left_commute
huffman@45546
    67
  word_mult_commute ~> mult_commute
huffman@45546
    68
  word_mult_assoc ~> mult_assoc
huffman@45546
    69
  word_mult_left_commute ~> mult_left_commute
huffman@45546
    70
  word_left_distrib ~> left_distrib
huffman@45546
    71
  word_right_distrib ~> right_distrib
huffman@45546
    72
  word_left_minus ~> left_minus
huffman@45546
    73
  word_diff_0_right ~> diff_0_right
huffman@45546
    74
  word_diff_self ~> diff_self
huffman@45546
    75
  word_add_ac ~> add_ac
huffman@45546
    76
  word_mult_ac ~> mult_ac
huffman@45546
    77
  word_plus_ac0 ~> add_0_left add_0_right add_ac
huffman@45546
    78
  word_times_ac1 ~> mult_1_left mult_1_right mult_ac
huffman@45547
    79
  word_order_trans ~> order_trans
huffman@45547
    80
  word_order_refl ~> order_refl
huffman@45547
    81
  word_order_antisym ~> order_antisym
huffman@45547
    82
  word_order_linear ~> linorder_linear
huffman@45546
    83
wenzelm@45384
    84
* Clarified attribute "mono_set": pure declararation without modifying
wenzelm@45384
    85
the result of the fact expression.
wenzelm@45384
    86
wenzelm@45383
    87
* "Transitive_Closure.ntrancl": bounded transitive closure on
wenzelm@45383
    88
relations.
wenzelm@45383
    89
wenzelm@45383
    90
* Constant "Set.not_member" now qualifed.  INCOMPATIBILITY.
wenzelm@45383
    91
wenzelm@45383
    92
* "sublists" moved to theory More_List.  INCOMPATIBILITY.
haftmann@45143
    93
huffman@45122
    94
* Theory Int: Discontinued many legacy theorems specific to type int.
wenzelm@45383
    95
INCOMPATIBILITY, use the corresponding generic theorems instead.
huffman@45122
    96
huffman@45122
    97
  zminus_zminus ~> minus_minus
huffman@45122
    98
  zminus_0 ~> minus_zero
huffman@45122
    99
  zminus_zadd_distrib ~> minus_add_distrib
huffman@45122
   100
  zadd_commute ~> add_commute
huffman@45122
   101
  zadd_assoc ~> add_assoc
huffman@45122
   102
  zadd_left_commute ~> add_left_commute
wenzelm@45196
   103
  zadd_ac ~> add_ac
huffman@45122
   104
  zmult_ac ~> mult_ac
huffman@45122
   105
  zadd_0 ~> add_0_left
huffman@45122
   106
  zadd_0_right ~> add_0_right
huffman@45122
   107
  zadd_zminus_inverse2 ~> left_minus
huffman@45122
   108
  zmult_zminus ~> mult_minus_left
huffman@45122
   109
  zmult_commute ~> mult_commute
huffman@45122
   110
  zmult_assoc ~> mult_assoc
huffman@45122
   111
  zadd_zmult_distrib ~> left_distrib
huffman@45122
   112
  zadd_zmult_distrib2 ~> right_distrib
huffman@45122
   113
  zdiff_zmult_distrib ~> left_diff_distrib
huffman@45122
   114
  zdiff_zmult_distrib2 ~> right_diff_distrib
huffman@45122
   115
  zmult_1 ~> mult_1_left
huffman@45122
   116
  zmult_1_right ~> mult_1_right
huffman@45122
   117
  zle_refl ~> order_refl
huffman@45122
   118
  zle_trans ~> order_trans
huffman@45122
   119
  zle_antisym ~> order_antisym
huffman@45122
   120
  zle_linear ~> linorder_linear
huffman@45122
   121
  zless_linear ~> linorder_less_linear
huffman@45122
   122
  zadd_left_mono ~> add_left_mono
huffman@45122
   123
  zadd_strict_right_mono ~> add_strict_right_mono
huffman@45122
   124
  zadd_zless_mono ~> add_less_le_mono
huffman@45122
   125
  int_0_less_1 ~> zero_less_one
huffman@45122
   126
  int_0_neq_1 ~> zero_neq_one
huffman@45122
   127
  zless_le ~> less_le
huffman@45122
   128
  zpower_zadd_distrib ~> power_add
huffman@45122
   129
  zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
huffman@45122
   130
  zero_le_zpower_abs ~> zero_le_power_abs
huffman@45122
   131
wenzelm@45383
   132
* New "case_product" attribute to generate a case rule doing multiple
wenzelm@45383
   133
case distinctions at the same time.  E.g.
wenzelm@45383
   134
wenzelm@45383
   135
  list.exhaust [case_product nat.exhaust]
wenzelm@45383
   136
wenzelm@45383
   137
produces a rule which can be used to perform case distinction on both
wenzelm@45383
   138
a list and a nat.
wenzelm@45383
   139
blanchet@45398
   140
* Nitpick:
blanchet@45516
   141
  - Fixed infinite loop caused by the 'peephole_optim' option and
blanchet@45516
   142
    affecting 'rat' and 'real'.
blanchet@45516
   143
blanchet@45516
   144
* Sledgehammer:
blanchet@45516
   145
  - Added "lam_trans" option.
blanchet@45516
   146
blanchet@45516
   147
* Metis:
blanchet@45516
   148
  - Added possibility to specify lambda translations scheme as a
blanchet@45516
   149
    parenthesized argument (e.g., "by (metis (lam_lifting) ...)").
blanchet@45398
   150
blanchet@45398
   151
noschinl@45160
   152
*** FOL ***
noschinl@45160
   153
wenzelm@45383
   154
* New "case_product" attribute (see HOL).
noschinl@45160
   155
wenzelm@45109
   156
wenzelm@45128
   157
*** ML ***
wenzelm@45128
   158
wenzelm@45592
   159
* Antiquotation @{attributes [...]} embeds attribute source
wenzelm@45592
   160
representation into the ML text, which is particularly useful with
wenzelm@45592
   161
declarations like Local_Theory.note.
wenzelm@45592
   162
wenzelm@45128
   163
* Structure Proof_Context follows standard naming scheme.  Old
wenzelm@45128
   164
ProofContext has been discontinued.  INCOMPATIBILITY.
wenzelm@45128
   165
wenzelm@45293
   166
* Refined Local_Theory.declaration {syntax, pervasive}, with subtle
wenzelm@45298
   167
change of semantics: update is applied to auxiliary local theory
wenzelm@45293
   168
context as well.
wenzelm@45293
   169
wenzelm@45128
   170
wenzelm@45109
   171
wenzelm@44801
   172
New in Isabelle2011-1 (October 2011)
wenzelm@44801
   173
------------------------------------
wenzelm@41651
   174
wenzelm@41703
   175
*** General ***
wenzelm@41703
   176
wenzelm@44760
   177
* Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
wenzelm@44968
   178
"isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
wenzelm@44760
   179
wenzelm@44777
   180
  - Management of multiple theory files directly from the editor
wenzelm@44760
   181
    buffer store -- bypassing the file-system (no requirement to save
wenzelm@44760
   182
    files for checking).
wenzelm@44760
   183
wenzelm@44777
   184
  - Markup of formal entities within the text buffer, with semantic
wenzelm@44760
   185
    highlighting, tooltips and hyperlinks to jump to defining source
wenzelm@44760
   186
    positions.
wenzelm@44760
   187
wenzelm@44777
   188
  - Improved text rendering, with sub/superscripts in the source
wenzelm@44777
   189
    buffer (including support for copy/paste wrt. output panel, HTML
wenzelm@44777
   190
    theory output and other non-Isabelle text boxes).
wenzelm@44777
   191
wenzelm@44777
   192
  - Refined scheduling of proof checking and printing of results,
wenzelm@44760
   193
    based on interactive editor view.  (Note: jEdit folding and
wenzelm@44760
   194
    narrowing allows to restrict buffer perspectives explicitly.)
wenzelm@44760
   195
wenzelm@44777
   196
  - Reduced CPU performance requirements, usable on machines with few
wenzelm@44760
   197
    cores.
wenzelm@44760
   198
wenzelm@44777
   199
  - Reduced memory requirements due to pruning of unused document
wenzelm@44760
   200
    versions (garbage collection).
wenzelm@44760
   201
wenzelm@44760
   202
See also ~~/src/Tools/jEdit/README.html for further information,
wenzelm@44760
   203
including some remaining limitations.
wenzelm@44760
   204
wenzelm@44800
   205
* Theory loader: source files are exclusively located via the master
wenzelm@44800
   206
directory of each theory node (where the .thy file itself resides).
wenzelm@44800
   207
The global load path (such as src/HOL/Library) has been discontinued.
wenzelm@44800
   208
Note that the path element ~~ may be used to reference theories in the
wenzelm@44800
   209
Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
wenzelm@44800
   210
INCOMPATIBILITY.
wenzelm@44800
   211
wenzelm@41955
   212
* Theory loader: source files are identified by content via SHA1
wenzelm@41955
   213
digests.  Discontinued former path/modtime identification and optional
wenzelm@41955
   214
ISABELLE_FILE_IDENT plugin scripts.
wenzelm@41955
   215
wenzelm@41703
   216
* Parallelization of nested Isar proofs is subject to
wenzelm@41703
   217
Goal.parallel_proofs_threshold (default 100).  See also isabelle
wenzelm@41703
   218
usedir option -Q.
wenzelm@41703
   219
wenzelm@42669
   220
* Name space: former unsynchronized references are now proper
wenzelm@42669
   221
configuration options, with more conventional names:
wenzelm@42669
   222
wenzelm@42669
   223
  long_names   ~> names_long
wenzelm@42669
   224
  short_names  ~> names_short
wenzelm@42669
   225
  unique_names ~> names_unique
wenzelm@42669
   226
wenzelm@42669
   227
Minor INCOMPATIBILITY, need to declare options in context like this:
wenzelm@42669
   228
wenzelm@42669
   229
  declare [[names_unique = false]]
wenzelm@42358
   230
wenzelm@42502
   231
* Literal facts `prop` may contain dummy patterns, e.g. `_ = _`.  Note
wenzelm@42502
   232
that the result needs to be unique, which means fact specifications
wenzelm@42502
   233
may have to be refined after enriching a proof context.
wenzelm@42502
   234
wenzelm@44800
   235
* Attribute "case_names" has been refined: the assumptions in each case
wenzelm@44800
   236
can be named now by following the case name with [name1 name2 ...].
wenzelm@44800
   237
wenzelm@44968
   238
* Isabelle/Isar reference manual has been updated and extended:
wenzelm@44968
   239
  - "Synopsis" provides a catalog of main Isar language concepts.
wenzelm@44968
   240
  - Formal references in syntax diagrams, via @{rail} antiquotation.
wenzelm@44968
   241
  - Updated material from classic "ref" manual, notably about
wenzelm@44968
   242
    "Classical Reasoner".
wenzelm@42633
   243
wenzelm@41703
   244
blanchet@41727
   245
*** HOL ***
blanchet@41727
   246
wenzelm@44968
   247
* Class bot and top require underlying partial order rather than
wenzelm@44800
   248
preorder: uniqueness of bot and top is guaranteed.  INCOMPATIBILITY.
haftmann@43815
   249
haftmann@43940
   250
* Class complete_lattice: generalized a couple of lemmas from sets;
wenzelm@44800
   251
generalized theorems INF_cong and SUP_cong.  New type classes for
wenzelm@44800
   252
complete boolean algebras and complete linear orders.  Lemmas
wenzelm@44800
   253
Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
wenzelm@44800
   254
class complete_linorder.
wenzelm@44800
   255
wenzelm@44800
   256
Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
wenzelm@44800
   257
Sup_fun_def, Inf_apply, Sup_apply.
wenzelm@44800
   258
wenzelm@45088
   259
Removed redundant lemmas (the right hand side gives hints how to
wenzelm@45088
   260
replace them for (metis ...), or (simp only: ...) proofs):
hoelzl@45041
   261
hoelzl@45041
   262
  Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
hoelzl@45041
   263
  Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
hoelzl@45041
   264
  Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
hoelzl@45041
   265
  Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
hoelzl@45041
   266
  Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
hoelzl@45041
   267
  Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
hoelzl@45041
   268
  Inter_def ~> INF_def, image_def
hoelzl@45041
   269
  Union_def ~> SUP_def, image_def
hoelzl@45041
   270
  INT_eq ~> INF_def, and image_def
hoelzl@45041
   271
  UN_eq ~> SUP_def, and image_def
hoelzl@45041
   272
  INF_subset ~> INF_superset_mono [OF _ order_refl]
wenzelm@44800
   273
wenzelm@44800
   274
More consistent and comprehensive names:
wenzelm@44800
   275
hoelzl@45041
   276
  INTER_eq_Inter_image ~> INF_def
hoelzl@45041
   277
  UNION_eq_Union_image ~> SUP_def
haftmann@43872
   278
  INFI_def ~> INF_def
haftmann@43872
   279
  SUPR_def ~> SUP_def
haftmann@44103
   280
  INF_leI ~> INF_lower
haftmann@44103
   281
  INF_leI2 ~> INF_lower2
haftmann@44103
   282
  le_INFI ~> INF_greatest
haftmann@44103
   283
  le_SUPI ~> SUP_upper
haftmann@44103
   284
  le_SUPI2 ~> SUP_upper2
haftmann@44103
   285
  SUP_leI ~> SUP_least
haftmann@43873
   286
  INFI_bool_eq ~> INF_bool_eq
haftmann@43873
   287
  SUPR_bool_eq ~> SUP_bool_eq
haftmann@43873
   288
  INFI_apply ~> INF_apply
haftmann@43873
   289
  SUPR_apply ~> SUP_apply
haftmann@44103
   290
  INTER_def ~> INTER_eq
haftmann@44103
   291
  UNION_def ~> UNION_eq
haftmann@44103
   292
haftmann@43865
   293
INCOMPATIBILITY.
haftmann@43865
   294
wenzelm@44973
   295
* Renamed theory Complete_Lattice to Complete_Lattices.
wenzelm@44973
   296
INCOMPATIBILITY.
wenzelm@44973
   297
wenzelm@44973
   298
* Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
wenzelm@44973
   299
INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
wenzelm@44973
   300
Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
wenzelm@44973
   301
Sup_insert are now declared as [simp].  INCOMPATIBILITY.
wenzelm@44973
   302
wenzelm@44973
   303
* Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
wenzelm@44973
   304
compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
wenzelm@44973
   305
sup_inf_absob, sup_left_idem are now declared as [simp].  Minor
wenzelm@44973
   306
INCOMPATIBILITY.
wenzelm@44973
   307
krauss@44845
   308
* Added syntactic classes "inf" and "sup" for the respective
krauss@44845
   309
constants.  INCOMPATIBILITY: Changes in the argument order of the
krauss@44845
   310
(mostly internal) locale predicates for some derived classes.
krauss@44845
   311
wenzelm@44800
   312
* Theorem collections ball_simps and bex_simps do not contain theorems
wenzelm@44800
   313
referring to UNION any longer; these have been moved to collection
wenzelm@44800
   314
UN_ball_bex_simps.  INCOMPATIBILITY.
wenzelm@44800
   315
wenzelm@44800
   316
* Theory Archimedean_Field: floor now is defined as parameter of a
wenzelm@44800
   317
separate type class floor_ceiling.
wenzelm@44800
   318
wenzelm@44800
   319
* Theory Finite_Set: more coherent development of fold_set locales:
haftmann@42874
   320
haftmann@42874
   321
    locale fun_left_comm ~> locale comp_fun_commute
haftmann@42874
   322
    locale fun_left_comm_idem ~> locale comp_fun_idem
wenzelm@44800
   323
wenzelm@44800
   324
Both use point-free characterization; interpretation proofs may need
wenzelm@44800
   325
adjustment.  INCOMPATIBILITY.
haftmann@42874
   326
wenzelm@44800
   327
* Theory Limits: Type "'a net" has been renamed to "'a filter", in
huffman@44081
   328
accordance with standard mathematical terminology. INCOMPATIBILITY.
huffman@44081
   329
wenzelm@44800
   330
* Theory Complex_Main: The locale interpretations for the
wenzelm@44800
   331
bounded_linear and bounded_bilinear locales have been removed, in
wenzelm@44800
   332
order to reduce the number of duplicate lemmas. Users must use the
wenzelm@44800
   333
original names for distributivity theorems, potential INCOMPATIBILITY.
huffman@44282
   334
huffman@44282
   335
  divide.add ~> add_divide_distrib
huffman@44282
   336
  divide.diff ~> diff_divide_distrib
huffman@44282
   337
  divide.setsum ~> setsum_divide_distrib
huffman@44282
   338
  mult.add_right ~> right_distrib
huffman@44282
   339
  mult.diff_right ~> right_diff_distrib
huffman@44282
   340
  mult_right.setsum ~> setsum_right_distrib
huffman@44282
   341
  mult_left.diff ~> left_diff_distrib
huffman@44282
   342
wenzelm@44800
   343
* Theory Complex_Main: Several redundant theorems have been removed or
huffman@44568
   344
replaced by more general versions. INCOMPATIBILITY.
huffman@44522
   345
huffman@45051
   346
  real_diff_def ~> minus_real_def
huffman@45051
   347
  real_divide_def ~> divide_real_def
huffman@45051
   348
  real_less_def ~> less_le
huffman@45051
   349
  real_abs_def ~> abs_real_def
huffman@45051
   350
  real_sgn_def ~> sgn_real_def
huffman@45051
   351
  real_mult_commute ~> mult_commute
huffman@45051
   352
  real_mult_assoc ~> mult_assoc
huffman@45051
   353
  real_mult_1 ~> mult_1_left
huffman@45051
   354
  real_add_mult_distrib ~> left_distrib
huffman@45051
   355
  real_zero_not_eq_one ~> zero_neq_one
huffman@45051
   356
  real_mult_inverse_left ~> left_inverse
huffman@45051
   357
  INVERSE_ZERO ~> inverse_zero
huffman@45051
   358
  real_le_refl ~> order_refl
huffman@45051
   359
  real_le_antisym ~> order_antisym
huffman@45051
   360
  real_le_trans ~> order_trans
huffman@45051
   361
  real_le_linear ~> linear
huffman@45051
   362
  real_le_eq_diff ~> le_iff_diff_le_0
huffman@45051
   363
  real_add_left_mono ~> add_left_mono
huffman@45051
   364
  real_mult_order ~> mult_pos_pos
huffman@45051
   365
  real_mult_less_mono2 ~> mult_strict_left_mono
huffman@44822
   366
  real_of_int_real_of_nat ~> real_of_int_of_nat_eq
huffman@44522
   367
  real_0_le_divide_iff ~> zero_le_divide_iff
huffman@44522
   368
  realpow_two_disj ~> power2_eq_iff
huffman@44522
   369
  real_squared_diff_one_factored ~> square_diff_one_factored
huffman@44522
   370
  realpow_two_diff ~> square_diff_square_factored
huffman@44669
   371
  reals_complete2 ~> complete_real
huffman@44749
   372
  real_sum_squared_expand ~> power2_sum
huffman@44522
   373
  exp_ln_eq ~> ln_unique
huffman@44711
   374
  expi_add ~> exp_add
huffman@44711
   375
  expi_zero ~> exp_zero
huffman@44522
   376
  lemma_DERIV_subst ~> DERIV_cong
huffman@44568
   377
  LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
huffman@44568
   378
  LIMSEQ_const ~> tendsto_const
huffman@44568
   379
  LIMSEQ_norm ~> tendsto_norm
huffman@44568
   380
  LIMSEQ_add ~> tendsto_add
huffman@44568
   381
  LIMSEQ_minus ~> tendsto_minus
huffman@44568
   382
  LIMSEQ_minus_cancel ~> tendsto_minus_cancel
huffman@44568
   383
  LIMSEQ_diff ~> tendsto_diff
huffman@44568
   384
  bounded_linear.LIMSEQ ~> bounded_linear.tendsto
huffman@44568
   385
  bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
huffman@44568
   386
  LIMSEQ_mult ~> tendsto_mult
huffman@44568
   387
  LIMSEQ_inverse ~> tendsto_inverse
huffman@44568
   388
  LIMSEQ_divide ~> tendsto_divide
huffman@44568
   389
  LIMSEQ_pow ~> tendsto_power
huffman@44568
   390
  LIMSEQ_setsum ~> tendsto_setsum
huffman@44568
   391
  LIMSEQ_setprod ~> tendsto_setprod
huffman@44568
   392
  LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
huffman@44568
   393
  LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
huffman@44568
   394
  LIMSEQ_imp_rabs ~> tendsto_rabs
huffman@44710
   395
  LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
huffman@44710
   396
  LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
huffman@44710
   397
  LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
huffman@44748
   398
  LIMSEQ_Complex ~> tendsto_Complex
huffman@44568
   399
  LIM_ident ~> tendsto_ident_at
huffman@44568
   400
  LIM_const ~> tendsto_const
huffman@44568
   401
  LIM_add ~> tendsto_add
huffman@44568
   402
  LIM_add_zero ~> tendsto_add_zero
huffman@44568
   403
  LIM_minus ~> tendsto_minus
huffman@44568
   404
  LIM_diff ~> tendsto_diff
huffman@44568
   405
  LIM_norm ~> tendsto_norm
huffman@44568
   406
  LIM_norm_zero ~> tendsto_norm_zero
huffman@44568
   407
  LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
huffman@44568
   408
  LIM_norm_zero_iff ~> tendsto_norm_zero_iff
huffman@44568
   409
  LIM_rabs ~> tendsto_rabs
huffman@44568
   410
  LIM_rabs_zero ~> tendsto_rabs_zero
huffman@44568
   411
  LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
huffman@44568
   412
  LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
huffman@44568
   413
  LIM_compose ~> tendsto_compose
huffman@44568
   414
  LIM_mult ~> tendsto_mult
huffman@44568
   415
  LIM_scaleR ~> tendsto_scaleR
huffman@44568
   416
  LIM_of_real ~> tendsto_of_real
huffman@44568
   417
  LIM_power ~> tendsto_power
huffman@44568
   418
  LIM_inverse ~> tendsto_inverse
huffman@44568
   419
  LIM_sgn ~> tendsto_sgn
huffman@44568
   420
  isCont_LIM_compose ~> isCont_tendsto_compose
huffman@44568
   421
  bounded_linear.LIM ~> bounded_linear.tendsto
huffman@44568
   422
  bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
huffman@44568
   423
  bounded_bilinear.LIM ~> bounded_bilinear.tendsto
huffman@44568
   424
  bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
huffman@44568
   425
  bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
huffman@44568
   426
  bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
huffman@44568
   427
  LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
huffman@44522
   428
wenzelm@44967
   429
* Theory Complex_Main: The definition of infinite series was
wenzelm@44967
   430
generalized.  Now it is defined on the type class {topological_space,
wenzelm@44967
   431
comm_monoid_add}.  Hence it is useable also for extended real numbers.
wenzelm@42484
   432
huffman@44908
   433
* Theory Complex_Main: The complex exponential function "expi" is now
huffman@44908
   434
a type-constrained abbreviation for "exp :: complex => complex"; thus
huffman@44908
   435
several polymorphic lemmas about "exp" are now applicable to "expi".
huffman@44908
   436
wenzelm@44968
   437
* Code generation:
wenzelm@44968
   438
wenzelm@44968
   439
  - Theory Library/Code_Char_ord provides native ordering of
wenzelm@44968
   440
    characters in the target language.
wenzelm@44968
   441
wenzelm@44968
   442
  - Commands code_module and code_library are legacy, use export_code
wenzelm@44968
   443
    instead.
wenzelm@44968
   444
wenzelm@44968
   445
  - Method "evaluation" is legacy, use method "eval" instead.
wenzelm@44968
   446
wenzelm@44968
   447
  - Legacy evaluator "SML" is deactivated by default.  May be
wenzelm@44968
   448
    reactivated by the following theory command:
wenzelm@44968
   449
wenzelm@44968
   450
      setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
wenzelm@44968
   451
wenzelm@44968
   452
* Declare ext [intro] by default.  Rare INCOMPATIBILITY.
wenzelm@44968
   453
wenzelm@45088
   454
* New proof method "induction" that gives induction hypotheses the
wenzelm@45088
   455
name "IH", thus distinguishing them from further hypotheses that come
wenzelm@45088
   456
from rule induction.  The latter are still called "hyps".  Method
wenzelm@45088
   457
"induction" is a thin wrapper around "induct" and follows the same
wenzelm@45088
   458
syntax.
wenzelm@45088
   459
wenzelm@44968
   460
* Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
wenzelm@44968
   461
still available as a legacy feature for some time.
wenzelm@44968
   462
wenzelm@44968
   463
* Nitpick:
wenzelm@44968
   464
  - Added "need" and "total_consts" options.
wenzelm@44968
   465
  - Reintroduced "show_skolems" option by popular demand.
wenzelm@44968
   466
  - Renamed attribute: nitpick_def ~> nitpick_unfold.
wenzelm@44968
   467
    INCOMPATIBILITY.
wenzelm@44968
   468
wenzelm@44968
   469
* Sledgehammer:
wenzelm@44968
   470
  - Use quasi-sound (and efficient) translations by default.
wenzelm@44968
   471
  - Added support for the following provers: E-ToFoF, LEO-II,
wenzelm@44968
   472
    Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
wenzelm@44968
   473
  - Automatically preplay and minimize proofs before showing them if
wenzelm@44968
   474
    this can be done within reasonable time.
wenzelm@44968
   475
  - sledgehammer available_provers ~> sledgehammer supported_provers.
wenzelm@44968
   476
    INCOMPATIBILITY.
wenzelm@44968
   477
  - Added "preplay_timeout", "slicing", "type_enc", "sound",
wenzelm@44968
   478
    "max_mono_iters", and "max_new_mono_instances" options.
wenzelm@44968
   479
  - Removed "explicit_apply" and "full_types" options as well as "Full
wenzelm@44968
   480
    Types" Proof General menu item. INCOMPATIBILITY.
wenzelm@44968
   481
wenzelm@44968
   482
* Metis:
wenzelm@44968
   483
  - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
wenzelm@44968
   484
  - Obsoleted "metisFT" -- use "metis (full_types)" instead.
wenzelm@44968
   485
    INCOMPATIBILITY.
wenzelm@44968
   486
wenzelm@44968
   487
* Command 'try':
wenzelm@44968
   488
  - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
wenzelm@44968
   489
    "elim:" options. INCOMPATIBILITY.
wenzelm@44968
   490
  - Introduced 'try' that not only runs 'try_methods' but also
wenzelm@44968
   491
    'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
wenzelm@44968
   492
wenzelm@44968
   493
* Quickcheck:
wenzelm@44968
   494
  - Added "eval" option to evaluate terms for the found counterexample
wenzelm@44968
   495
    (currently only supported by the default (exhaustive) tester).
wenzelm@44968
   496
  - Added post-processing of terms to obtain readable counterexamples
wenzelm@44968
   497
    (currently only supported by the default (exhaustive) tester).
wenzelm@44968
   498
  - New counterexample generator quickcheck[narrowing] enables
wenzelm@44968
   499
    narrowing-based testing.  Requires the Glasgow Haskell compiler
wenzelm@44968
   500
    with its installation location defined in the Isabelle settings
wenzelm@44968
   501
    environment as ISABELLE_GHC.
wenzelm@44968
   502
  - Removed quickcheck tester "SML" based on the SML code generator
wenzelm@44968
   503
    (formly in HOL/Library).
wenzelm@44968
   504
wenzelm@44968
   505
* Function package: discontinued option "tailrec".  INCOMPATIBILITY,
wenzelm@44968
   506
use 'partial_function' instead.
wenzelm@44968
   507
wenzelm@44968
   508
* Theory Library/Extended_Reals replaces now the positive extended
wenzelm@44968
   509
reals found in probability theory. This file is extended by
wenzelm@44968
   510
Multivariate_Analysis/Extended_Real_Limits.
wenzelm@44968
   511
wenzelm@44974
   512
* Theory Library/Old_Recdef: old 'recdef' package has been moved here,
wenzelm@44974
   513
from where it must be imported explicitly if it is really required.
wenzelm@44974
   514
INCOMPATIBILITY.
wenzelm@44968
   515
wenzelm@44968
   516
* Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
wenzelm@44968
   517
been moved here.  INCOMPATIBILITY.
wenzelm@44968
   518
wenzelm@44968
   519
* Theory Library/Saturated provides type of numbers with saturated
wenzelm@44968
   520
arithmetic.
wenzelm@44968
   521
wenzelm@44968
   522
* Theory Library/Product_Lattice defines a pointwise ordering for the
wenzelm@44968
   523
product type 'a * 'b, and provides instance proofs for various order
wenzelm@44968
   524
and lattice type classes.
wenzelm@44968
   525
wenzelm@44968
   526
* Theory Library/Countable now provides the "countable_datatype" proof
wenzelm@44968
   527
method for proving "countable" class instances for datatypes.
wenzelm@44968
   528
wenzelm@44968
   529
* Theory Library/Cset_Monad allows do notation for computable sets
wenzelm@44968
   530
(cset) via the generic monad ad-hoc overloading facility.
wenzelm@44968
   531
wenzelm@44968
   532
* Library: Theories of common data structures are split into theories
wenzelm@44968
   533
for implementation, an invariant-ensuring type, and connection to an
wenzelm@44968
   534
abstract type. INCOMPATIBILITY.
wenzelm@44968
   535
wenzelm@44968
   536
  - RBT is split into RBT and RBT_Mapping.
wenzelm@44968
   537
  - AssocList is split and renamed into AList and AList_Mapping.
wenzelm@44968
   538
  - DList is split into DList_Impl, DList, and DList_Cset.
wenzelm@44968
   539
  - Cset is split into Cset and List_Cset.
wenzelm@44968
   540
wenzelm@44968
   541
* Theory Library/Nat_Infinity has been renamed to
wenzelm@44968
   542
Library/Extended_Nat, with name changes of the following types and
wenzelm@44968
   543
constants:
wenzelm@44968
   544
wenzelm@44968
   545
  type inat   ~> type enat
wenzelm@44968
   546
  Fin         ~> enat
wenzelm@44968
   547
  Infty       ~> infinity (overloaded)
wenzelm@44968
   548
  iSuc        ~> eSuc
wenzelm@44968
   549
  the_Fin     ~> the_enat
wenzelm@44968
   550
wenzelm@44968
   551
Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
wenzelm@44968
   552
been renamed accordingly. INCOMPATIBILITY.
wenzelm@44968
   553
wenzelm@44968
   554
* Session Multivariate_Analysis: The euclidean_space type class now
wenzelm@44968
   555
fixes a constant "Basis :: 'a set" consisting of the standard
wenzelm@44968
   556
orthonormal basis for the type. Users now have the option of
wenzelm@44968
   557
quantifying over this set instead of using the "basis" function, e.g.
wenzelm@44968
   558
"ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
wenzelm@44968
   559
wenzelm@44968
   560
* Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
wenzelm@44968
   561
to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
wenzelm@44968
   562
"Cart_nth" and "Cart_lambda" have been respectively renamed to
wenzelm@44968
   563
"vec_nth" and "vec_lambda"; theorems mentioning those names have
wenzelm@44968
   564
changed to match. Definition theorems for overloaded constants now use
wenzelm@44968
   565
the standard "foo_vec_def" naming scheme. A few other theorems have
wenzelm@44968
   566
been renamed as follows (INCOMPATIBILITY):
wenzelm@44968
   567
wenzelm@44968
   568
  Cart_eq          ~> vec_eq_iff
wenzelm@44968
   569
  dist_nth_le_cart ~> dist_vec_nth_le
wenzelm@44968
   570
  tendsto_vector   ~> vec_tendstoI
wenzelm@44968
   571
  Cauchy_vector    ~> vec_CauchyI
wenzelm@44968
   572
wenzelm@44968
   573
* Session Multivariate_Analysis: Several duplicate theorems have been
wenzelm@44968
   574
removed, and other theorems have been renamed or replaced with more
wenzelm@44968
   575
general versions. INCOMPATIBILITY.
wenzelm@44968
   576
wenzelm@44968
   577
  finite_choice ~> finite_set_choice
wenzelm@44968
   578
  eventually_conjI ~> eventually_conj
wenzelm@44968
   579
  eventually_and ~> eventually_conj_iff
wenzelm@44968
   580
  eventually_false ~> eventually_False
wenzelm@44968
   581
  setsum_norm ~> norm_setsum
wenzelm@44968
   582
  Lim_sequentially ~> LIMSEQ_def
wenzelm@44968
   583
  Lim_ident_at ~> LIM_ident
wenzelm@44968
   584
  Lim_const ~> tendsto_const
wenzelm@44968
   585
  Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
wenzelm@44968
   586
  Lim_neg ~> tendsto_minus
wenzelm@44968
   587
  Lim_add ~> tendsto_add
wenzelm@44968
   588
  Lim_sub ~> tendsto_diff
wenzelm@44968
   589
  Lim_mul ~> tendsto_scaleR
wenzelm@44968
   590
  Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
wenzelm@44968
   591
  Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
wenzelm@44968
   592
  Lim_linear ~> bounded_linear.tendsto
wenzelm@44968
   593
  Lim_component ~> tendsto_euclidean_component
wenzelm@44968
   594
  Lim_component_cart ~> tendsto_vec_nth
wenzelm@44968
   595
  Lim_inner ~> tendsto_inner [OF tendsto_const]
wenzelm@44968
   596
  dot_lsum ~> inner_setsum_left
wenzelm@44968
   597
  dot_rsum ~> inner_setsum_right
wenzelm@44968
   598
  continuous_cmul ~> continuous_scaleR [OF continuous_const]
wenzelm@44968
   599
  continuous_neg ~> continuous_minus
wenzelm@44968
   600
  continuous_sub ~> continuous_diff
wenzelm@44968
   601
  continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
wenzelm@44968
   602
  continuous_mul ~> continuous_scaleR
wenzelm@44968
   603
  continuous_inv ~> continuous_inverse
wenzelm@44968
   604
  continuous_at_within_inv ~> continuous_at_within_inverse
wenzelm@44968
   605
  continuous_at_inv ~> continuous_at_inverse
wenzelm@44968
   606
  continuous_at_norm ~> continuous_norm [OF continuous_at_id]
wenzelm@44968
   607
  continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
wenzelm@44968
   608
  continuous_at_component ~> continuous_component [OF continuous_at_id]
wenzelm@44968
   609
  continuous_on_neg ~> continuous_on_minus
wenzelm@44968
   610
  continuous_on_sub ~> continuous_on_diff
wenzelm@44968
   611
  continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
wenzelm@44968
   612
  continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
wenzelm@44968
   613
  continuous_on_mul ~> continuous_on_scaleR
wenzelm@44968
   614
  continuous_on_mul_real ~> continuous_on_mult
wenzelm@44968
   615
  continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
wenzelm@44968
   616
  continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
wenzelm@44968
   617
  continuous_on_inverse ~> continuous_on_inv
wenzelm@44968
   618
  uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
wenzelm@44968
   619
  uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
wenzelm@44968
   620
  subset_interior ~> interior_mono
wenzelm@44968
   621
  subset_closure ~> closure_mono
wenzelm@44968
   622
  closure_univ ~> closure_UNIV
wenzelm@44968
   623
  real_arch_lt ~> reals_Archimedean2
wenzelm@44968
   624
  real_arch ~> reals_Archimedean3
wenzelm@44968
   625
  real_abs_norm ~> abs_norm_cancel
wenzelm@44968
   626
  real_abs_sub_norm ~> norm_triangle_ineq3
wenzelm@44968
   627
  norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
wenzelm@44968
   628
wenzelm@44968
   629
* Session HOL-Probability:
wenzelm@44968
   630
  - Caratheodory's extension lemma is now proved for ring_of_sets.
wenzelm@44968
   631
  - Infinite products of probability measures are now available.
wenzelm@44968
   632
  - Sigma closure is independent, if the generator is independent
wenzelm@44968
   633
  - Use extended reals instead of positive extended
wenzelm@44968
   634
    reals. INCOMPATIBILITY.
wenzelm@44968
   635
huffman@45049
   636
* Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
huffman@45049
   637
huffman@45049
   638
  expand_fun_below ~> fun_below_iff
huffman@45049
   639
  below_fun_ext ~> fun_belowI
huffman@45049
   640
  expand_cfun_eq ~> cfun_eq_iff
huffman@45049
   641
  ext_cfun ~> cfun_eqI
huffman@45049
   642
  expand_cfun_below ~> cfun_below_iff
huffman@45049
   643
  below_cfun_ext ~> cfun_belowI
huffman@45049
   644
  monofun_fun_fun ~> fun_belowD
huffman@45049
   645
  monofun_fun_arg ~> monofunE
huffman@45049
   646
  monofun_lub_fun ~> adm_monofun [THEN admD]
huffman@45049
   647
  cont_lub_fun ~> adm_cont [THEN admD]
huffman@45049
   648
  cont2cont_Rep_CFun ~> cont2cont_APP
huffman@45049
   649
  cont_Rep_CFun_app ~> cont_APP_app
huffman@45049
   650
  cont_Rep_CFun_app_app ~> cont_APP_app_app
huffman@45049
   651
  cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
huffman@45049
   652
  cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
huffman@45049
   653
  contlub_cfun ~> lub_APP [symmetric]
huffman@45049
   654
  contlub_LAM ~> lub_LAM [symmetric]
huffman@45049
   655
  thelubI ~> lub_eqI
huffman@45049
   656
  UU_I ~> bottomI
huffman@45049
   657
  lift_distinct1 ~> lift.distinct(1)
huffman@45049
   658
  lift_distinct2 ~> lift.distinct(2)
huffman@45049
   659
  Def_not_UU ~> lift.distinct(2)
huffman@45049
   660
  Def_inject ~> lift.inject
huffman@45049
   661
  below_UU_iff ~> below_bottom_iff
huffman@45049
   662
  eq_UU_iff ~> eq_bottom_iff
huffman@45049
   663
huffman@44903
   664
krauss@41685
   665
*** Document preparation ***
krauss@41685
   666
wenzelm@44800
   667
* Antiquotation @{rail} layouts railroad syntax diagrams, see also
wenzelm@44800
   668
isar-ref manual, both for description and actual application of the
wenzelm@44800
   669
same.
wenzelm@44800
   670
wenzelm@44800
   671
* Antiquotation @{value} evaluates the given term and presents its
wenzelm@44800
   672
result.
wenzelm@44800
   673
wenzelm@44800
   674
* Antiquotations: term style "isub" provides ad-hoc conversion of
wenzelm@44800
   675
variables x1, y23 into subscripted form x\<^isub>1,
wenzelm@44800
   676
y\<^isub>2\<^isub>3.
wenzelm@41651
   677
wenzelm@42484
   678
* Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
wenzelm@42484
   679
(e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
wenzelm@42484
   680
wenzelm@44967
   681
* Localized \isabellestyle switch can be used within blocks or groups
wenzelm@44967
   682
like this:
wenzelm@44967
   683
wenzelm@44967
   684
  \isabellestyle{it}  %preferred default
wenzelm@44967
   685
  {\isabellestylett @{text "typewriter stuff"}}
wenzelm@44967
   686
wenzelm@44967
   687
* Discontinued special treatment of hard tabulators.  Implicit
wenzelm@44967
   688
tab-width is now defined as 1.  Potential INCOMPATIBILITY for visual
wenzelm@44967
   689
layouts.
wenzelm@44800
   690
wenzelm@41651
   691
wenzelm@41944
   692
*** ML ***
wenzelm@41944
   693
wenzelm@43731
   694
* The inner syntax of sort/type/term/prop supports inlined YXML
wenzelm@43731
   695
representations within quoted string tokens.  By encoding logical
wenzelm@43731
   696
entities via Term_XML (in ML or Scala) concrete syntax can be
wenzelm@43731
   697
bypassed, which is particularly useful for producing bits of text
wenzelm@43731
   698
under external program control.
wenzelm@43731
   699
wenzelm@43565
   700
* Antiquotations for ML and document preparation are managed as theory
wenzelm@43565
   701
data, which requires explicit setup.
wenzelm@43565
   702
wenzelm@42897
   703
* Isabelle_Process.is_active allows tools to check if the official
wenzelm@42897
   704
process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
wenzelm@42897
   705
(better known as Proof General).
wenzelm@42897
   706
wenzelm@42360
   707
* Structure Proof_Context follows standard naming scheme.  Old
wenzelm@42360
   708
ProofContext is still available for some time as legacy alias.
wenzelm@42360
   709
wenzelm@42015
   710
* Structure Timing provides various operations for timing; supersedes
wenzelm@42015
   711
former start_timing/end_timing etc.
wenzelm@42015
   712
wenzelm@41944
   713
* Path.print is the official way to show file-system paths to users
wenzelm@41944
   714
(including quotes etc.).
wenzelm@41944
   715
wenzelm@42056
   716
* Inner syntax: identifiers in parse trees of generic categories
wenzelm@42056
   717
"logic", "aprop", "idt" etc. carry position information (disguised as
wenzelm@42056
   718
type constraints).  Occasional INCOMPATIBILITY with non-compliant
wenzelm@42057
   719
translations that choke on unexpected type constraints.  Positions can
wenzelm@42057
   720
be stripped in ML translations via Syntax.strip_positions /
wenzelm@42057
   721
Syntax.strip_positions_ast, or via the syntax constant
wenzelm@42057
   722
"_strip_positions" within parse trees.  As last resort, positions can
wenzelm@42057
   723
be disabled via the configuration option Syntax.positions, which is
wenzelm@42057
   724
called "syntax_positions" in Isar attribute syntax.
wenzelm@42056
   725
wenzelm@42290
   726
* Discontinued special status of various ML structures that contribute
wenzelm@42290
   727
to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
wenzelm@42290
   728
pervasive content, no inclusion in structure Syntax.  INCOMPATIBILITY,
wenzelm@42290
   729
refer directly to Ast.Constant, Lexicon.is_identifier,
wenzelm@42290
   730
Syntax_Trans.mk_binder_tr etc.
wenzelm@42224
   731
wenzelm@42247
   732
* Typed print translation: discontinued show_sorts argument, which is
wenzelm@42247
   733
already available via context of "advanced" translation.
wenzelm@42247
   734
wenzelm@42370
   735
* Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
wenzelm@42370
   736
goal states; body tactic needs to address all subgoals uniformly.
wenzelm@42370
   737
wenzelm@42403
   738
* Slightly more special eq_list/eq_set, with shortcut involving
wenzelm@42403
   739
pointer equality (assumes that eq relation is reflexive).
wenzelm@42403
   740
wenzelm@42793
   741
* Classical tactics use proper Proof.context instead of historic types
wenzelm@42793
   742
claset/clasimpset.  Old-style declarations like addIs, addEs, addDs
wenzelm@42793
   743
operate directly on Proof.context.  Raw type claset retains its use as
wenzelm@42793
   744
snapshot of the classical context, which can be recovered via
wenzelm@42793
   745
(put_claset HOL_cs) etc.  Type clasimpset has been discontinued.
wenzelm@42793
   746
INCOMPATIBILITY, classical tactics and derived proof methods require
wenzelm@42793
   747
proper Proof.context.
wenzelm@42793
   748
wenzelm@44803
   749
wenzelm@44803
   750
*** System ***
wenzelm@44803
   751
wenzelm@44968
   752
* Discontinued support for Poly/ML 5.2, which was the last version
wenzelm@44968
   753
without proper multithreading and TimeLimit implementation.
wenzelm@44968
   754
wenzelm@44968
   755
* Discontinued old lib/scripts/polyml-platform, which has been
wenzelm@44968
   756
obsolete since Isabelle2009-2.
wenzelm@44968
   757
wenzelm@44967
   758
* Various optional external tools are referenced more robustly and
wenzelm@44967
   759
uniformly by explicit Isabelle settings as follows:
wenzelm@44967
   760
wenzelm@44967
   761
  ISABELLE_CSDP   (formerly CSDP_EXE)
wenzelm@44967
   762
  ISABELLE_GHC    (formerly EXEC_GHC or GHC_PATH)
wenzelm@44967
   763
  ISABELLE_OCAML  (formerly EXEC_OCAML)
wenzelm@44967
   764
  ISABELLE_SWIPL  (formerly EXEC_SWIPL)
wenzelm@44967
   765
  ISABELLE_YAP    (formerly EXEC_YAP)
wenzelm@44967
   766
wenzelm@44967
   767
Note that automated detection from the file-system or search path has
wenzelm@44967
   768
been discontinued.  INCOMPATIBILITY.
wenzelm@44967
   769
wenzelm@43752
   770
* Scala layer provides JVM method invocation service for static
wenzelm@44800
   771
methods of type (String)String, see Invoke_Scala.method in ML.  For
wenzelm@44800
   772
example:
wenzelm@43752
   773
wenzelm@43752
   774
  Invoke_Scala.method "java.lang.System.getProperty" "java.home"
wenzelm@43752
   775
wenzelm@44967
   776
Together with YXML.string_of_body/parse_body and XML.Encode/Decode
wenzelm@44967
   777
this allows to pass structured values between ML and Scala.
wenzelm@44800
   778
wenzelm@44803
   779
* The IsabelleText fonts includes some further glyphs to support the
wenzelm@44803
   780
Prover IDE.  Potential INCOMPATIBILITY: users who happen to have
wenzelm@44803
   781
installed a local copy (which is normally *not* required) need to
wenzelm@44803
   782
delete or update it from ~~/lib/fonts/.
wenzelm@41944
   783
wenzelm@41703
   784
wenzelm@45089
   785
wenzelm@41512
   786
New in Isabelle2011 (January 2011)
wenzelm@41512
   787
----------------------------------
wenzelm@37383
   788
wenzelm@37536
   789
*** General ***
wenzelm@37536
   790
wenzelm@41573
   791
* Experimental Prover IDE based on Isabelle/Scala and jEdit (see
wenzelm@41612
   792
src/Tools/jEdit).  This also serves as IDE for Isabelle/ML, with
wenzelm@41612
   793
useful tooltips and hyperlinks produced from its static analysis.  The
wenzelm@41612
   794
bundled component provides an executable Isabelle tool that can be run
wenzelm@41612
   795
like this:
wenzelm@41612
   796
wenzelm@41612
   797
  Isabelle2011/bin/isabelle jedit
wenzelm@41573
   798
wenzelm@40948
   799
* Significantly improved Isabelle/Isar implementation manual.
wenzelm@40948
   800
wenzelm@41594
   801
* System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
wenzelm@41595
   802
(and thus refers to something like $HOME/.isabelle/Isabelle2011),
wenzelm@41594
   803
while the default heap location within that directory lacks that extra
wenzelm@41594
   804
suffix.  This isolates multiple Isabelle installations from each
wenzelm@41594
   805
other, avoiding problems with old settings in new versions.
wenzelm@41594
   806
INCOMPATIBILITY, need to copy/upgrade old user settings manually.
wenzelm@41594
   807
wenzelm@40947
   808
* Source files are always encoded as UTF-8, instead of old-fashioned
wenzelm@40947
   809
ISO-Latin-1.  INCOMPATIBILITY.  Isabelle LaTeX documents might require
wenzelm@40948
   810
the following package declarations:
wenzelm@40947
   811
wenzelm@40947
   812
  \usepackage[utf8]{inputenc}
wenzelm@40947
   813
  \usepackage{textcomp}
wenzelm@40947
   814
krauss@41440
   815
* Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
wenzelm@37536
   816
a Unicode character is treated as a single symbol, not a sequence of
wenzelm@37536
   817
non-ASCII bytes as before.  Since Isabelle/ML string literals may
wenzelm@37536
   818
contain symbols without further backslash escapes, Unicode can now be
wenzelm@37536
   819
used here as well.  Recall that Symbol.explode in ML provides a
wenzelm@37536
   820
consistent view on symbols, while raw explode (or String.explode)
wenzelm@37536
   821
merely give a byte-oriented representation.
wenzelm@37536
   822
wenzelm@41594
   823
* Theory loader: source files are primarily located via the master
wenzelm@41594
   824
directory of each theory node (where the .thy file itself resides).
wenzelm@41594
   825
The global load path is still partially available as legacy feature.
wenzelm@41594
   826
Minor INCOMPATIBILITY due to subtle change in file lookup: use
wenzelm@41594
   827
explicit paths, relatively to the theory.
wenzelm@38135
   828
wenzelm@37939
   829
* Special treatment of ML file names has been discontinued.
wenzelm@37939
   830
Historically, optional extensions .ML or .sml were added on demand --
wenzelm@37939
   831
at the cost of clarity of file dependencies.  Recall that Isabelle/ML
wenzelm@37939
   832
files exclusively use the .ML extension.  Minor INCOMPATIBILTY.
wenzelm@37939
   833
wenzelm@38980
   834
* Various options that affect pretty printing etc. are now properly
wenzelm@38767
   835
handled within the context via configuration options, instead of
wenzelm@40879
   836
unsynchronized references or print modes.  There are both ML Config.T
wenzelm@40879
   837
entities and Isar declaration attributes to access these.
wenzelm@38767
   838
wenzelm@39125
   839
  ML (Config.T)                 Isar (attribute)
wenzelm@39125
   840
wenzelm@39128
   841
  eta_contract                  eta_contract
wenzelm@39137
   842
  show_brackets                 show_brackets
wenzelm@39134
   843
  show_sorts                    show_sorts
wenzelm@39134
   844
  show_types                    show_types
wenzelm@39126
   845
  show_question_marks           show_question_marks
wenzelm@39126
   846
  show_consts                   show_consts
wenzelm@40879
   847
  show_abbrevs                  show_abbrevs
wenzelm@39126
   848
wenzelm@41379
   849
  Syntax.ast_trace              syntax_ast_trace
wenzelm@41379
   850
  Syntax.ast_stat               syntax_ast_stat
wenzelm@39126
   851
  Syntax.ambiguity_level        syntax_ambiguity_level
wenzelm@39126
   852
wenzelm@39126
   853
  Goal_Display.goals_limit      goals_limit
wenzelm@39126
   854
  Goal_Display.show_main_goal   show_main_goal
wenzelm@39126
   855
wenzelm@41379
   856
  Method.rule_trace             rule_trace
wenzelm@41379
   857
wenzelm@39125
   858
  Thy_Output.display            thy_output_display
wenzelm@39125
   859
  Thy_Output.quotes             thy_output_quotes
wenzelm@39125
   860
  Thy_Output.indent             thy_output_indent
wenzelm@39125
   861
  Thy_Output.source             thy_output_source
wenzelm@39125
   862
  Thy_Output.break              thy_output_break
wenzelm@39125
   863
krauss@41440
   864
Note that corresponding "..._default" references in ML may only be
wenzelm@38767
   865
changed globally at the ROOT session setup, but *not* within a theory.
wenzelm@40879
   866
The option "show_abbrevs" supersedes the former print mode
wenzelm@40879
   867
"no_abbrevs" with inverted meaning.
wenzelm@38767
   868
wenzelm@40878
   869
* More systematic naming of some configuration options.
huffman@41294
   870
INCOMPATIBILITY.
wenzelm@40878
   871
wenzelm@40878
   872
  trace_simp  ~>  simp_trace
wenzelm@40878
   873
  debug_simp  ~>  simp_debug
wenzelm@40878
   874
wenzelm@40291
   875
* Support for real valued configuration options, using simplistic
wenzelm@40291
   876
floating-point notation that coincides with the inner syntax for
wenzelm@40291
   877
float_token.
wenzelm@40291
   878
wenzelm@41594
   879
* Support for real valued preferences (with approximative PGIP type):
wenzelm@41594
   880
front-ends need to accept "pgint" values in float notation.
wenzelm@41594
   881
INCOMPATIBILITY.
wenzelm@41573
   882
wenzelm@41573
   883
* The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
wenzelm@41573
   884
DejaVu Sans.
wenzelm@41573
   885
wenzelm@41594
   886
* Discontinued support for Poly/ML 5.0 and 5.1 versions.
wenzelm@41594
   887
wenzelm@40948
   888
wenzelm@40948
   889
*** Pure ***
wenzelm@40948
   890
wenzelm@41249
   891
* Command 'type_synonym' (with single argument) replaces somewhat
wenzelm@41249
   892
outdated 'types', which is still available as legacy feature for some
wenzelm@41249
   893
time.
wenzelm@41249
   894
wenzelm@41249
   895
* Command 'nonterminal' (with 'and' separated list of arguments)
wenzelm@41249
   896
replaces somewhat outdated 'nonterminals'.  INCOMPATIBILITY.
wenzelm@41229
   897
wenzelm@40965
   898
* Command 'notepad' replaces former 'example_proof' for
wenzelm@41020
   899
experimentation in Isar without any result.  INCOMPATIBILITY.
wenzelm@40965
   900
ballarin@41435
   901
* Locale interpretation commands 'interpret' and 'sublocale' accept
ballarin@41435
   902
lists of equations to map definitions in a locale to appropriate
ballarin@41435
   903
entities in the context of the interpretation.  The 'interpretation'
ballarin@41435
   904
command already provided this functionality.
ballarin@41435
   905
wenzelm@41594
   906
* Diagnostic command 'print_dependencies' prints the locale instances
wenzelm@41594
   907
that would be activated if the specified expression was interpreted in
wenzelm@41594
   908
the current context.  Variant "print_dependencies!" assumes a context
wenzelm@41594
   909
without interpretations.
ballarin@38110
   910
ballarin@38110
   911
* Diagnostic command 'print_interps' prints interpretations in proofs
ballarin@38110
   912
in addition to interpretations in theories.
ballarin@38110
   913
wenzelm@38708
   914
* Discontinued obsolete 'global' and 'local' commands to manipulate
wenzelm@38708
   915
the theory name space.  Rare INCOMPATIBILITY.  The ML functions
wenzelm@38708
   916
Sign.root_path and Sign.local_path may be applied directly where this
wenzelm@38708
   917
feature is still required for historical reasons.
wenzelm@38708
   918
wenzelm@40948
   919
* Discontinued obsolete 'constdefs' command.  INCOMPATIBILITY, use
haftmann@39215
   920
'definition' instead.
haftmann@39215
   921
wenzelm@41574
   922
* The "prems" fact, which refers to the accidental collection of
wenzelm@41574
   923
foundational premises in the context, is now explicitly marked as
wenzelm@41594
   924
legacy feature and will be discontinued soon.  Consider using "assms"
wenzelm@41594
   925
of the head statement or reference facts by explicit names.
wenzelm@41574
   926
wenzelm@40801
   927
* Document antiquotations @{class} and @{type} print classes and type
wenzelm@40801
   928
constructors.
wenzelm@40801
   929
wenzelm@40801
   930
* Document antiquotation @{file} checks file/directory entries within
wenzelm@40801
   931
the local file system.
haftmann@39305
   932
ballarin@38110
   933
haftmann@37387
   934
*** HOL ***
haftmann@37387
   935
wenzelm@41594
   936
* Coercive subtyping: functions can be declared as coercions and type
wenzelm@41594
   937
inference will add them as necessary upon input of a term.  Theory
wenzelm@41594
   938
Complex_Main declares real :: nat => real and real :: int => real as
wenzelm@41594
   939
coercions. A coercion function f is declared like this:
wenzelm@40939
   940
wenzelm@40939
   941
  declare [[coercion f]]
nipkow@40866
   942
wenzelm@41571
   943
To lift coercions through type constructors (e.g. from nat => real to
nipkow@40866
   944
nat list => real list), map functions can be declared, e.g.
nipkow@40866
   945
wenzelm@40939
   946
  declare [[coercion_map map]]
wenzelm@40939
   947
wenzelm@40939
   948
Currently coercion inference is activated only in theories including
wenzelm@40939
   949
real numbers, i.e. descendants of Complex_Main.  This is controlled by
wenzelm@41020
   950
the configuration option "coercion_enabled", e.g. it can be enabled in
wenzelm@40939
   951
other theories like this:
wenzelm@40939
   952
wenzelm@40939
   953
  declare [[coercion_enabled]]
nipkow@40866
   954
wenzelm@41571
   955
* Command 'partial_function' provides basic support for recursive
wenzelm@41571
   956
function definitions over complete partial orders.  Concrete instances
krauss@40183
   957
are provided for i) the option type, ii) tail recursion on arbitrary
wenzelm@41571
   958
types, and iii) the heap monad of Imperative_HOL.  See
wenzelm@41571
   959
src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
wenzelm@41571
   960
for examples.
krauss@40183
   961
wenzelm@41571
   962
* Function package: f.psimps rules are no longer implicitly declared
wenzelm@41571
   963
as [simp].  INCOMPATIBILITY.
haftmann@41398
   964
haftmann@41398
   965
* Datatype package: theorems generated for executable equality (class
wenzelm@41571
   966
"eq") carry proper names and are treated as default code equations.
wenzelm@41571
   967
wenzelm@41594
   968
* Inductive package: now offers command 'inductive_simps' to
wenzelm@41594
   969
automatically derive instantiated and simplified equations for
wenzelm@41594
   970
inductive predicates, similar to 'inductive_cases'.
wenzelm@41594
   971
wenzelm@41571
   972
* Command 'enriched_type' allows to register properties of the
wenzelm@41571
   973
functorial structure of types.
haftmann@39771
   974
haftmann@39644
   975
* Improved infrastructure for term evaluation using code generator
haftmann@39644
   976
techniques, in particular static evaluation conversions.
haftmann@39644
   977
wenzelm@41594
   978
* Code generator: Scala (2.8 or higher) has been added to the target
wenzelm@41594
   979
languages.
wenzelm@41594
   980
haftmann@41398
   981
* Code generator: globbing constant expressions "*" and "Theory.*"
haftmann@41398
   982
have been replaced by the more idiomatic "_" and "Theory._".
haftmann@41398
   983
INCOMPATIBILITY.
haftmann@41398
   984
haftmann@41398
   985
* Code generator: export_code without explicit file declaration prints
haftmann@41398
   986
to standard output.  INCOMPATIBILITY.
haftmann@41398
   987
haftmann@41398
   988
* Code generator: do not print function definitions for case
haftmann@41398
   989
combinators any longer.
haftmann@41398
   990
wenzelm@41594
   991
* Code generator: simplification with rules determined with
wenzelm@41571
   992
src/Tools/Code/code_simp.ML and method "code_simp".
wenzelm@41571
   993
wenzelm@41594
   994
* Code generator for records: more idiomatic representation of record
wenzelm@40948
   995
types.  Warning: records are not covered by ancient SML code
wenzelm@40948
   996
generation any longer.  INCOMPATIBILITY.  In cases of need, a suitable
wenzelm@40948
   997
rep_datatype declaration helps to succeed then:
haftmann@38537
   998
haftmann@38537
   999
  record 'a foo = ...
haftmann@38537
  1000
  ...
haftmann@38537
  1001
  rep_datatype foo_ext ...
haftmann@38535
  1002
wenzelm@41594
  1003
* Records: logical foundation type for records does not carry a
wenzelm@41594
  1004
'_type' suffix any longer (obsolete due to authentic syntax).
wenzelm@41594
  1005
INCOMPATIBILITY.
wenzelm@41594
  1006
haftmann@41398
  1007
* Quickcheck now by default uses exhaustive testing instead of random
wenzelm@41571
  1008
testing.  Random testing can be invoked by "quickcheck [random]",
wenzelm@41571
  1009
exhaustive testing by "quickcheck [exhaustive]".
haftmann@41398
  1010
haftmann@41398
  1011
* Quickcheck instantiates polymorphic types with small finite
haftmann@41398
  1012
datatypes by default. This enables a simple execution mechanism to
haftmann@41398
  1013
handle quantifiers and function equality over the finite datatypes.
haftmann@41398
  1014
wenzelm@41571
  1015
* Quickcheck random generator has been renamed from "code" to
wenzelm@41571
  1016
"random".  INCOMPATIBILITY.
haftmann@41398
  1017
haftmann@41398
  1018
* Quickcheck now has a configurable time limit which is set to 30
haftmann@41398
  1019
seconds by default. This can be changed by adding [timeout = n] to the
haftmann@41398
  1020
quickcheck command. The time limit for Auto Quickcheck is still set
haftmann@41398
  1021
independently.
haftmann@38461
  1022
haftmann@38461
  1023
* Quickcheck in locales considers interpretations of that locale for
haftmann@38461
  1024
counter example search.
haftmann@38461
  1025
blanchet@40059
  1026
* Sledgehammer:
wenzelm@41571
  1027
  - Added "smt" and "remote_smt" provers based on the "smt" proof
wenzelm@41571
  1028
    method. See the Sledgehammer manual for details ("isabelle doc
wenzelm@41571
  1029
    sledgehammer").
blanchet@40059
  1030
  - Renamed commands:
blanchet@40059
  1031
    sledgehammer atp_info ~> sledgehammer running_provers
blanchet@40059
  1032
    sledgehammer atp_kill ~> sledgehammer kill_provers
blanchet@40059
  1033
    sledgehammer available_atps ~> sledgehammer available_provers
blanchet@40059
  1034
    INCOMPATIBILITY.
blanchet@40059
  1035
  - Renamed options:
blanchet@40059
  1036
    sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
blanchet@40062
  1037
    sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
blanchet@40341
  1038
    sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
blanchet@40341
  1039
    (and "ms" and "min" are no longer supported)
blanchet@40341
  1040
    INCOMPATIBILITY.
blanchet@40341
  1041
blanchet@40341
  1042
* Nitpick:
blanchet@40341
  1043
  - Renamed options:
blanchet@40341
  1044
    nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
blanchet@40341
  1045
    nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
blanchet@40059
  1046
    INCOMPATIBILITY.
blanchet@40725
  1047
  - Added support for partial quotient types.
blanchet@40725
  1048
  - Added local versions of the "Nitpick.register_xxx" functions.
blanchet@40725
  1049
  - Added "whack" option.
blanchet@40725
  1050
  - Allow registration of quotient types as codatatypes.
blanchet@40725
  1051
  - Improved "merge_type_vars" option to merge more types.
blanchet@40725
  1052
  - Removed unsound "fast_descrs" option.
blanchet@40725
  1053
  - Added custom symmetry breaking for datatypes, making it possible to reach
blanchet@40725
  1054
    higher cardinalities.
blanchet@40725
  1055
  - Prevent the expansion of too large definitions.
blanchet@39957
  1056
wenzelm@41571
  1057
* Proof methods "metis" and "meson" now have configuration options
wenzelm@41571
  1058
"meson_trace", "metis_trace", and "metis_verbose" that can be enabled
wenzelm@41571
  1059
to diagnose these tools. E.g.
wenzelm@41571
  1060
wenzelm@41571
  1061
    using [[metis_trace = true]]
wenzelm@41571
  1062
haftmann@41398
  1063
* Auto Solve: Renamed "Auto Solve Direct".  The tool is now available
haftmann@41398
  1064
manually as command 'solve_direct'.
haftmann@41398
  1065
boehmes@41601
  1066
* The default SMT solver Z3 must be enabled explicitly (due to
boehmes@41601
  1067
licensing issues) by setting the environment variable
wenzelm@41603
  1068
Z3_NON_COMMERCIAL in etc/settings of the component, for example.  For
wenzelm@41603
  1069
commercial applications, the SMT solver CVC3 is provided as fall-back;
wenzelm@41603
  1070
changing the SMT solver is done via the configuration option
wenzelm@41603
  1071
"smt_solver".
boehmes@41432
  1072
boehmes@41432
  1073
* Remote SMT solvers need to be referred to by the "remote_" prefix,
wenzelm@41571
  1074
i.e. "remote_cvc3" and "remote_z3".
wenzelm@41571
  1075
wenzelm@41571
  1076
* Added basic SMT support for datatypes, records, and typedefs using
wenzelm@41571
  1077
the oracle mode (no proofs).  Direct support of pairs has been dropped
wenzelm@41571
  1078
in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
wenzelm@41571
  1079
support for a similar behavior).  Minor INCOMPATIBILITY.
boehmes@41432
  1080
boehmes@40162
  1081
* Changed SMT configuration options:
boehmes@40162
  1082
  - Renamed:
boehmes@41432
  1083
    z3_proofs ~> smt_oracle (with inverted meaning)
boehmes@40162
  1084
    z3_trace_assms ~> smt_trace_used_facts
boehmes@40162
  1085
    INCOMPATIBILITY.
boehmes@40162
  1086
  - Added:
boehmes@40424
  1087
    smt_verbose
boehmes@41432
  1088
    smt_random_seed
boehmes@40424
  1089
    smt_datatypes
boehmes@41432
  1090
    smt_infer_triggers
boehmes@41432
  1091
    smt_monomorph_limit
boehmes@40162
  1092
    cvc3_options
boehmes@41432
  1093
    remote_cvc3_options
boehmes@41432
  1094
    remote_z3_options
boehmes@40162
  1095
    yices_options
blanchet@39957
  1096
wenzelm@40948
  1097
* Boogie output files (.b2i files) need to be declared in the theory
wenzelm@40948
  1098
header.
boehmes@40580
  1099
wenzelm@41594
  1100
* Simplification procedure "list_to_set_comprehension" rewrites list
wenzelm@41594
  1101
comprehensions applied to List.set to set comprehensions.  Occasional
wenzelm@41594
  1102
INCOMPATIBILITY, may be deactivated like this:
wenzelm@41594
  1103
wenzelm@41594
  1104
  declare [[simproc del: list_to_set_comprehension]]
wenzelm@41594
  1105
wenzelm@41573
  1106
* Removed old version of primrec package.  INCOMPATIBILITY.
haftmann@41398
  1107
haftmann@41398
  1108
* Removed simplifier congruence rule of "prod_case", as has for long
haftmann@41398
  1109
been the case with "split".  INCOMPATIBILITY.
haftmann@41398
  1110
haftmann@41398
  1111
* String.literal is a type, but not a datatype.  INCOMPATIBILITY.
haftmann@41398
  1112
krauss@40388
  1113
* Removed [split_format ... and ... and ...] version of
krauss@40388
  1114
[split_format].  Potential INCOMPATIBILITY.
krauss@40388
  1115
wenzelm@41571
  1116
* Predicate "sorted" now defined inductively, with nice induction
wenzelm@41571
  1117
rules.  INCOMPATIBILITY: former sorted.simps now named sorted_simps.
haftmann@41398
  1118
haftmann@41398
  1119
* Constant "contents" renamed to "the_elem", to free the generic name
haftmann@41398
  1120
contents for other uses.  INCOMPATIBILITY.
haftmann@41398
  1121
haftmann@41398
  1122
* Renamed class eq and constant eq (for code generation) to class
haftmann@41398
  1123
equal and constant equal, plus renaming of related facts and various
haftmann@41398
  1124
tuning.  INCOMPATIBILITY.
haftmann@41398
  1125
haftmann@41398
  1126
* Dropped type classes mult_mono and mult_mono1.  INCOMPATIBILITY.
haftmann@41398
  1127
wenzelm@41571
  1128
* Removed output syntax "'a ~=> 'b" for "'a => 'b option".
wenzelm@41571
  1129
INCOMPATIBILITY.
haftmann@41398
  1130
haftmann@41398
  1131
* Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
haftmann@41398
  1132
avoid confusion with finite sets.  INCOMPATIBILITY.
haftmann@41398
  1133
haftmann@41398
  1134
* Abandoned locales equiv, congruent and congruent2 for equivalence
haftmann@41398
  1135
relations.  INCOMPATIBILITY: use equivI rather than equiv_intro (same
haftmann@41398
  1136
for congruent(2)).
haftmann@41398
  1137
haftmann@41398
  1138
* Some previously unqualified names have been qualified:
haftmann@41398
  1139
haftmann@41398
  1140
  types
haftmann@41398
  1141
    bool ~> HOL.bool
haftmann@41398
  1142
    nat ~> Nat.nat
haftmann@41398
  1143
haftmann@41398
  1144
  constants
haftmann@41398
  1145
    Trueprop ~> HOL.Trueprop
haftmann@41398
  1146
    True ~> HOL.True
haftmann@41398
  1147
    False ~> HOL.False
haftmann@41398
  1148
    op & ~> HOL.conj
haftmann@41398
  1149
    op | ~> HOL.disj
haftmann@41398
  1150
    op --> ~> HOL.implies
haftmann@41398
  1151
    op = ~> HOL.eq
haftmann@41398
  1152
    Not ~> HOL.Not
haftmann@41398
  1153
    The ~> HOL.The
haftmann@41398
  1154
    All ~> HOL.All
haftmann@41398
  1155
    Ex ~> HOL.Ex
haftmann@41398
  1156
    Ex1 ~> HOL.Ex1
haftmann@41398
  1157
    Let ~> HOL.Let
haftmann@41398
  1158
    If ~> HOL.If
haftmann@41398
  1159
    Ball ~> Set.Ball
haftmann@41398
  1160
    Bex ~> Set.Bex
haftmann@41398
  1161
    Suc ~> Nat.Suc
haftmann@41398
  1162
    Pair ~> Product_Type.Pair
haftmann@41398
  1163
    fst ~> Product_Type.fst
haftmann@41398
  1164
    snd ~> Product_Type.snd
haftmann@41398
  1165
    curry ~> Product_Type.curry
haftmann@41398
  1166
    op : ~> Set.member
haftmann@41398
  1167
    Collect ~> Set.Collect
haftmann@41398
  1168
haftmann@41398
  1169
INCOMPATIBILITY.
haftmann@41398
  1170
haftmann@41398
  1171
* More canonical naming convention for some fundamental definitions:
haftmann@41398
  1172
haftmann@41398
  1173
    bot_bool_eq ~> bot_bool_def
haftmann@41398
  1174
    top_bool_eq ~> top_bool_def
haftmann@41398
  1175
    inf_bool_eq ~> inf_bool_def
haftmann@41398
  1176
    sup_bool_eq ~> sup_bool_def
haftmann@41398
  1177
    bot_fun_eq  ~> bot_fun_def
haftmann@41398
  1178
    top_fun_eq  ~> top_fun_def
haftmann@41398
  1179
    inf_fun_eq  ~> inf_fun_def
haftmann@41398
  1180
    sup_fun_eq  ~> sup_fun_def
haftmann@41398
  1181
haftmann@41398
  1182
INCOMPATIBILITY.
haftmann@41398
  1183
haftmann@41398
  1184
* More stylized fact names:
haftmann@41398
  1185
haftmann@41398
  1186
  expand_fun_eq ~> fun_eq_iff
haftmann@41398
  1187
  expand_set_eq ~> set_eq_iff
haftmann@41398
  1188
  set_ext       ~> set_eqI
haftmann@41398
  1189
  nat_number    ~> eval_nat_numeral
haftmann@41398
  1190
haftmann@41398
  1191
INCOMPATIBILITY.
haftmann@41398
  1192
wenzelm@41571
  1193
* Refactoring of code-generation specific operations in theory List:
haftmann@41398
  1194
haftmann@41398
  1195
  constants
haftmann@41398
  1196
    null ~> List.null
haftmann@41398
  1197
haftmann@41398
  1198
  facts
haftmann@41398
  1199
    mem_iff ~> member_def
haftmann@41398
  1200
    null_empty ~> null_def
haftmann@41398
  1201
haftmann@41398
  1202
INCOMPATIBILITY.  Note that these were not supposed to be used
haftmann@41398
  1203
regularly unless for striking reasons; their main purpose was code
haftmann@41398
  1204
generation.
haftmann@41398
  1205
haftmann@41398
  1206
Various operations from the Haskell prelude are used for generating
haftmann@41398
  1207
Haskell code.
haftmann@41398
  1208
wenzelm@41571
  1209
* Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV".  Term
wenzelm@41571
  1210
"surj f" is now an abbreviation of "range f = UNIV".  The theorems
wenzelm@41571
  1211
bij_def and surj_def are unchanged.  INCOMPATIBILITY.
haftmann@41398
  1212
haftmann@41398
  1213
* Abolished some non-alphabetic type names: "prod" and "sum" replace
haftmann@41398
  1214
"*" and "+" respectively.  INCOMPATIBILITY.
haftmann@41398
  1215
haftmann@41398
  1216
* Name "Plus" of disjoint sum operator "<+>" is now hidden.  Write
wenzelm@41571
  1217
"Sum_Type.Plus" instead.
haftmann@41398
  1218
haftmann@41398
  1219
* Constant "split" has been merged with constant "prod_case"; names of
haftmann@41398
  1220
ML functions, facts etc. involving split have been retained so far,
haftmann@41398
  1221
though.  INCOMPATIBILITY.
haftmann@41398
  1222
haftmann@41398
  1223
* Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
haftmann@41398
  1224
instead.  INCOMPATIBILITY.
haftmann@41398
  1225
wenzelm@41571
  1226
* Removed lemma "Option.is_none_none" which duplicates "is_none_def".
haftmann@41398
  1227
INCOMPATIBILITY.
haftmann@41398
  1228
wenzelm@41594
  1229
* Former theory Library/Enum is now part of the HOL-Main image.
wenzelm@41594
  1230
INCOMPATIBILITY: all constants of the Enum theory now have to be
wenzelm@41594
  1231
referred to by its qualified name.
wenzelm@41594
  1232
wenzelm@41594
  1233
  enum    ~>  Enum.enum
wenzelm@41594
  1234
  nlists  ~>  Enum.nlists
wenzelm@41594
  1235
  product ~>  Enum.product
wenzelm@41594
  1236
wenzelm@41594
  1237
* Theory Library/Monad_Syntax provides do-syntax for monad types.
wenzelm@41594
  1238
Syntax in Library/State_Monad has been changed to avoid ambiguities.
wenzelm@41594
  1239
INCOMPATIBILITY.
wenzelm@41594
  1240
wenzelm@41594
  1241
* Theory Library/SetsAndFunctions has been split into
wenzelm@41594
  1242
Library/Function_Algebras and Library/Set_Algebras; canonical names
wenzelm@41594
  1243
for instance definitions for functions; various improvements.
wenzelm@41594
  1244
INCOMPATIBILITY.
wenzelm@41594
  1245
wenzelm@41594
  1246
* Theory Library/Multiset provides stable quicksort implementation of
wenzelm@41594
  1247
sort_key.
wenzelm@41594
  1248
wenzelm@41594
  1249
* Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
wenzelm@41594
  1250
INCOMPATIBILITY.
wenzelm@41594
  1251
wenzelm@41594
  1252
* Session Multivariate_Analysis: introduced a type class for euclidean
wenzelm@41594
  1253
space.  Most theorems are now stated in terms of euclidean spaces
wenzelm@41594
  1254
instead of finite cartesian products.
wenzelm@41594
  1255
wenzelm@41594
  1256
  types
wenzelm@41594
  1257
    real ^ 'n ~>  'a::real_vector
wenzelm@41594
  1258
              ~>  'a::euclidean_space
wenzelm@41594
  1259
              ~>  'a::ordered_euclidean_space
wenzelm@41594
  1260
        (depends on your needs)
wenzelm@41594
  1261
wenzelm@41594
  1262
  constants
wenzelm@41594
  1263
     _ $ _        ~> _ $$ _
wenzelm@41594
  1264
     \<chi> x. _  ~> \<chi>\<chi> x. _
wenzelm@41594
  1265
     CARD('n)     ~> DIM('a)
wenzelm@41594
  1266
wenzelm@41594
  1267
Also note that the indices are now natural numbers and not from some
wenzelm@41594
  1268
finite type. Finite cartesian products of euclidean spaces, products
wenzelm@41594
  1269
of euclidean spaces the real and complex numbers are instantiated to
wenzelm@41594
  1270
be euclidean_spaces.  INCOMPATIBILITY.
wenzelm@41594
  1271
wenzelm@41594
  1272
* Session Probability: introduced pextreal as positive extended real
wenzelm@41594
  1273
numbers.  Use pextreal as value for measures.  Introduce the
wenzelm@41594
  1274
Radon-Nikodym derivative, product spaces and Fubini's theorem for
wenzelm@41594
  1275
arbitrary sigma finite measures.  Introduces Lebesgue measure based on
wenzelm@41594
  1276
the integral in Multivariate Analysis.  INCOMPATIBILITY.
wenzelm@41594
  1277
wenzelm@41594
  1278
* Session Imperative_HOL: revamped, corrected dozens of inadequacies.
wenzelm@41594
  1279
INCOMPATIBILITY.
wenzelm@41594
  1280
wenzelm@41594
  1281
* Session SPARK (with image HOL-SPARK) provides commands to load and
wenzelm@41594
  1282
prove verification conditions generated by the SPARK Ada program
wenzelm@41594
  1283
verifier.  See also src/HOL/SPARK and src/HOL/SPARK/Examples.
berghofe@41567
  1284
huffman@40621
  1285
ballarin@41433
  1286
*** HOL-Algebra ***
ballarin@41433
  1287
ballarin@41433
  1288
* Theorems for additive ring operations (locale abelian_monoid and
ballarin@41433
  1289
descendants) are generated by interpretation from their multiplicative
ballarin@41434
  1290
counterparts.  Names (in particular theorem names) have the mandatory
ballarin@41434
  1291
qualifier 'add'.  Previous theorem names are redeclared for
ballarin@41434
  1292
compatibility.
ballarin@41434
  1293
wenzelm@41571
  1294
* Structure "int_ring" is now an abbreviation (previously a
ballarin@41434
  1295
definition).  This fits more natural with advanced interpretations.
ballarin@41433
  1296
ballarin@41433
  1297
huffman@40621
  1298
*** HOLCF ***
huffman@40621
  1299
huffman@40621
  1300
* The domain package now runs in definitional mode by default: The
wenzelm@41571
  1301
former command 'new_domain' is now called 'domain'.  To use the domain
huffman@40621
  1302
package in its original axiomatic mode, use 'domain (unsafe)'.
huffman@40621
  1303
INCOMPATIBILITY.
huffman@40621
  1304
wenzelm@41571
  1305
* The new class "domain" is now the default sort.  Class "predomain"
wenzelm@41571
  1306
is an unpointed version of "domain". Theories can be updated by
wenzelm@41571
  1307
replacing sort annotations as shown below.  INCOMPATIBILITY.
huffman@40621
  1308
huffman@40621
  1309
  'a::type ~> 'a::countable
huffman@40621
  1310
  'a::cpo  ~> 'a::predomain
huffman@40621
  1311
  'a::pcpo ~> 'a::domain
huffman@40621
  1312
wenzelm@41571
  1313
* The old type class "rep" has been superseded by class "domain".
huffman@40621
  1314
Accordingly, users of the definitional package must remove any
wenzelm@41571
  1315
"default_sort rep" declarations.  INCOMPATIBILITY.
huffman@40621
  1316
huffman@41401
  1317
* The domain package (definitional mode) now supports unpointed
huffman@41401
  1318
predomain argument types, as long as they are marked 'lazy'. (Strict
wenzelm@41571
  1319
arguments must be in class "domain".) For example, the following
huffman@41401
  1320
domain definition now works:
huffman@41401
  1321
huffman@41401
  1322
  domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
huffman@41401
  1323
huffman@41401
  1324
* Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
wenzelm@41571
  1325
instances for types from main HOL: bool, nat, int, char, 'a + 'b,
wenzelm@41571
  1326
'a option, and 'a list.  Additionally, it configures fixrec and the
wenzelm@41571
  1327
domain package to work with these types.  For example:
huffman@41401
  1328
huffman@41401
  1329
  fixrec isInl :: "('a + 'b) u -> tr"
huffman@41401
  1330
    where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
huffman@41401
  1331
huffman@41401
  1332
  domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
huffman@41401
  1333
wenzelm@41571
  1334
* The "(permissive)" option of fixrec has been replaced with a
wenzelm@41571
  1335
per-equation "(unchecked)" option. See
wenzelm@41571
  1336
src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
wenzelm@41571
  1337
wenzelm@41571
  1338
* The "bifinite" class no longer fixes a constant "approx"; the class
wenzelm@41571
  1339
now just asserts that such a function exists.  INCOMPATIBILITY.
wenzelm@41571
  1340
wenzelm@41571
  1341
* Former type "alg_defl" has been renamed to "defl".  HOLCF no longer
huffman@41287
  1342
defines an embedding of type 'a defl into udom by default; instances
wenzelm@41571
  1343
of "bifinite" and "domain" classes are available in
wenzelm@41571
  1344
src/HOL/HOLCF/Library/Defl_Bifinite.thy.
wenzelm@41571
  1345
wenzelm@41571
  1346
* The syntax "REP('a)" has been replaced with "DEFL('a)".
wenzelm@41571
  1347
wenzelm@41571
  1348
* The predicate "directed" has been removed.  INCOMPATIBILITY.
wenzelm@41571
  1349
wenzelm@41571
  1350
* The type class "finite_po" has been removed.  INCOMPATIBILITY.
wenzelm@41571
  1351
wenzelm@41571
  1352
* The function "cprod_map" has been renamed to "prod_map".
huffman@41401
  1353
INCOMPATIBILITY.
huffman@41401
  1354
huffman@41401
  1355
* The monadic bind operator on each powerdomain has new binder syntax
wenzelm@41571
  1356
similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
wenzelm@41571
  1357
"upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
huffman@41401
  1358
huffman@41401
  1359
* The infix syntax for binary union on each powerdomain has changed
wenzelm@41571
  1360
from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
wenzelm@41571
  1361
syntax.  INCOMPATIBILITY.
wenzelm@41571
  1362
wenzelm@41571
  1363
* The constant "UU" has been renamed to "bottom".  The syntax "UU" is
huffman@41429
  1364
still supported as an input translation.
huffman@41429
  1365
huffman@40621
  1366
* Renamed some theorems (the original names are also still available).
wenzelm@41571
  1367
huffman@40621
  1368
  expand_fun_below   ~> fun_below_iff
huffman@40621
  1369
  below_fun_ext      ~> fun_belowI
huffman@40621
  1370
  expand_cfun_eq     ~> cfun_eq_iff
huffman@40621
  1371
  ext_cfun           ~> cfun_eqI
huffman@40621
  1372
  expand_cfun_below  ~> cfun_below_iff
huffman@40621
  1373
  below_cfun_ext     ~> cfun_belowI
huffman@40621
  1374
  cont2cont_Rep_CFun ~> cont2cont_APP
huffman@40621
  1375
huffman@40621
  1376
* The Abs and Rep functions for various types have changed names.
wenzelm@40948
  1377
Related theorem names have also changed to match. INCOMPATIBILITY.
wenzelm@41571
  1378
huffman@40621
  1379
  Rep_CFun  ~> Rep_cfun
huffman@40621
  1380
  Abs_CFun  ~> Abs_cfun
huffman@40621
  1381
  Rep_Sprod ~> Rep_sprod
huffman@40621
  1382
  Abs_Sprod ~> Abs_sprod
huffman@40621
  1383
  Rep_Ssum  ~> Rep_ssum
huffman@40621
  1384
  Abs_Ssum  ~> Abs_ssum
huffman@40621
  1385
huffman@40621
  1386
* Lemmas with names of the form *_defined_iff or *_strict_iff have
wenzelm@41571
  1387
been renamed to *_bottom_iff.  INCOMPATIBILITY.
huffman@40621
  1388
huffman@40621
  1389
* Various changes to bisimulation/coinduction with domain package:
wenzelm@41571
  1390
wenzelm@41571
  1391
  - Definitions of "bisim" constants no longer mention definedness.
wenzelm@41571
  1392
  - With mutual recursion, "bisim" predicate is now curried.
huffman@40621
  1393
  - With mutual recursion, each type gets a separate coind theorem.
huffman@40621
  1394
  - Variable names in bisim_def and coinduct rules have changed.
wenzelm@41571
  1395
huffman@40621
  1396
INCOMPATIBILITY.
huffman@40621
  1397
wenzelm@41571
  1398
* Case combinators generated by the domain package for type "foo" are
wenzelm@41571
  1399
now named "foo_case" instead of "foo_when".  INCOMPATIBILITY.
huffman@40621
  1400
huffman@40771
  1401
* Several theorems have been renamed to more accurately reflect the
wenzelm@41571
  1402
names of constants and types involved.  INCOMPATIBILITY.
wenzelm@41571
  1403
huffman@40771
  1404
  thelub_const    ~> lub_const
huffman@40771
  1405
  lub_const       ~> is_lub_const
huffman@40771
  1406
  thelubI         ~> lub_eqI
huffman@40771
  1407
  is_lub_lub      ~> is_lubD2
huffman@40771
  1408
  lubI            ~> is_lub_lub
huffman@40771
  1409
  unique_lub      ~> is_lub_unique
huffman@40771
  1410
  is_ub_lub       ~> is_lub_rangeD1
huffman@40771
  1411
  lub_bin_chain   ~> is_lub_bin_chain
huffman@41030
  1412
  lub_fun         ~> is_lub_fun
huffman@41030
  1413
  thelub_fun      ~> lub_fun
huffman@41031
  1414
  thelub_cfun     ~> lub_cfun
huffman@40771
  1415
  thelub_Pair     ~> lub_Pair
huffman@40771
  1416
  lub_cprod       ~> is_lub_prod
huffman@40771
  1417
  thelub_cprod    ~> lub_prod
huffman@40771
  1418
  minimal_cprod   ~> minimal_prod
huffman@40771
  1419
  inst_cprod_pcpo ~> inst_prod_pcpo
huffman@41430
  1420
  UU_I            ~> bottomI
huffman@41430
  1421
  compact_UU      ~> compact_bottom
huffman@41430
  1422
  deflation_UU    ~> deflation_bottom
huffman@41430
  1423
  finite_deflation_UU ~> finite_deflation_bottom
huffman@40771
  1424
wenzelm@41571
  1425
* Many legacy theorem names have been discontinued.  INCOMPATIBILITY.
wenzelm@41571
  1426
huffman@40621
  1427
  sq_ord_less_eq_trans ~> below_eq_trans
huffman@40621
  1428
  sq_ord_eq_less_trans ~> eq_below_trans
huffman@40621
  1429
  refl_less            ~> below_refl
huffman@40621
  1430
  trans_less           ~> below_trans
huffman@40621
  1431
  antisym_less         ~> below_antisym
huffman@40621
  1432
  antisym_less_inverse ~> po_eq_conv [THEN iffD1]
huffman@40621
  1433
  box_less             ~> box_below
huffman@40621
  1434
  rev_trans_less       ~> rev_below_trans
huffman@40621
  1435
  not_less2not_eq      ~> not_below2not_eq
huffman@40621
  1436
  less_UU_iff          ~> below_UU_iff
huffman@40621
  1437
  flat_less_iff        ~> flat_below_iff
huffman@40621
  1438
  adm_less             ~> adm_below
huffman@40621
  1439
  adm_not_less         ~> adm_not_below
huffman@40621
  1440
  adm_compact_not_less ~> adm_compact_not_below
huffman@40621
  1441
  less_fun_def         ~> below_fun_def
huffman@40621
  1442
  expand_fun_less      ~> fun_below_iff
huffman@40621
  1443
  less_fun_ext         ~> fun_belowI
huffman@40621
  1444
  less_discr_def       ~> below_discr_def
huffman@40621
  1445
  discr_less_eq        ~> discr_below_eq
huffman@40621
  1446
  less_unit_def        ~> below_unit_def
huffman@40621
  1447
  less_cprod_def       ~> below_prod_def
huffman@40621
  1448
  prod_lessI           ~> prod_belowI
huffman@40621
  1449
  Pair_less_iff        ~> Pair_below_iff
huffman@40621
  1450
  fst_less_iff         ~> fst_below_iff
huffman@40621
  1451
  snd_less_iff         ~> snd_below_iff
huffman@40621
  1452
  expand_cfun_less     ~> cfun_below_iff
huffman@40621
  1453
  less_cfun_ext        ~> cfun_belowI
huffman@40621
  1454
  injection_less       ~> injection_below
huffman@40621
  1455
  less_up_def          ~> below_up_def
huffman@40621
  1456
  not_Iup_less         ~> not_Iup_below
huffman@40621
  1457
  Iup_less             ~> Iup_below
huffman@40621
  1458
  up_less              ~> up_below
huffman@40621
  1459
  Def_inject_less_eq   ~> Def_below_Def
huffman@40621
  1460
  Def_less_is_eq       ~> Def_below_iff
huffman@40621
  1461
  spair_less_iff       ~> spair_below_iff
huffman@40621
  1462
  less_sprod           ~> below_sprod
huffman@40621
  1463
  spair_less           ~> spair_below
huffman@40621
  1464
  sfst_less_iff        ~> sfst_below_iff
huffman@40621
  1465
  ssnd_less_iff        ~> ssnd_below_iff
huffman@40621
  1466
  fix_least_less       ~> fix_least_below
huffman@40621
  1467
  dist_less_one        ~> dist_below_one
huffman@40621
  1468
  less_ONE             ~> below_ONE
huffman@40621
  1469
  ONE_less_iff         ~> ONE_below_iff
huffman@40621
  1470
  less_sinlD           ~> below_sinlD
huffman@40621
  1471
  less_sinrD           ~> below_sinrD
huffman@40621
  1472
huffman@40621
  1473
wenzelm@40948
  1474
*** FOL and ZF ***
haftmann@38522
  1475
wenzelm@41310
  1476
* All constant names are now qualified internally and use proper
wenzelm@41310
  1477
identifiers, e.g. "IFOL.eq" instead of "op =".  INCOMPATIBILITY.
wenzelm@41310
  1478
haftmann@38522
  1479
wenzelm@37868
  1480
*** ML ***
wenzelm@37868
  1481
wenzelm@41594
  1482
* Antiquotation @{assert} inlines a function bool -> unit that raises
wenzelm@41594
  1483
Fail if the argument is false.  Due to inlining the source position of
wenzelm@41594
  1484
failed assertions is included in the error output.
wenzelm@41594
  1485
wenzelm@41594
  1486
* Discontinued antiquotation @{theory_ref}, which is obsolete since ML
wenzelm@41594
  1487
text is in practice always evaluated with a stable theory checkpoint.
wenzelm@41594
  1488
Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
wenzelm@41594
  1489
wenzelm@41594
  1490
* Antiquotation @{theory A} refers to theory A from the ancestry of
wenzelm@41594
  1491
the current context, not any accidental theory loader state as before.
wenzelm@41594
  1492
Potential INCOMPATIBILITY, subtle change in semantics.
wenzelm@41228
  1493
wenzelm@40956
  1494
* Syntax.pretty_priority (default 0) configures the required priority
wenzelm@40956
  1495
of pretty-printed output and thus affects insertion of parentheses.
wenzelm@40956
  1496
wenzelm@40959
  1497
* Syntax.default_root (default "any") configures the inner syntax
wenzelm@40959
  1498
category (nonterminal symbol) for parsing of terms.
wenzelm@40959
  1499
wenzelm@40722
  1500
* Former exception Library.UnequalLengths now coincides with
wenzelm@40722
  1501
ListPair.UnequalLengths.
wenzelm@40722
  1502
wenzelm@41594
  1503
* Renamed structure MetaSimplifier to Raw_Simplifier.  Note that the
wenzelm@41594
  1504
main functionality is provided by structure Simplifier.
wenzelm@41594
  1505
wenzelm@40627
  1506
* Renamed raw "explode" function to "raw_explode" to emphasize its
wenzelm@40627
  1507
meaning.  Note that internally to Isabelle, Symbol.explode is used in
wenzelm@40627
  1508
almost all situations.
wenzelm@40627
  1509
wenzelm@40318
  1510
* Discontinued obsolete function sys_error and exception SYS_ERROR.
wenzelm@40318
  1511
See implementation manual for further details on exceptions in
wenzelm@40318
  1512
Isabelle/ML.
wenzelm@40318
  1513
wenzelm@39616
  1514
* Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
wenzelm@39616
  1515
meaning.
wenzelm@39616
  1516
wenzelm@39557
  1517
* Renamed structure PureThy to Pure_Thy and moved most of its
wenzelm@39557
  1518
operations to structure Global_Theory, to emphasize that this is
wenzelm@39557
  1519
rarely-used global-only stuff.
wenzelm@39557
  1520
wenzelm@39513
  1521
* Discontinued Output.debug.  Minor INCOMPATIBILITY, use plain writeln
wenzelm@39513
  1522
instead (or tracing for high-volume output).
wenzelm@39513
  1523
wenzelm@38980
  1524
* Configuration option show_question_marks only affects regular pretty
wenzelm@38980
  1525
printing of types and terms, not raw Term.string_of_vname.
wenzelm@38980
  1526
wenzelm@39164
  1527
* ML_Context.thm and ML_Context.thms are no longer pervasive.  Rare
wenzelm@39164
  1528
INCOMPATIBILITY, superseded by static antiquotations @{thm} and
wenzelm@39164
  1529
@{thms} for most purposes.
wenzelm@39164
  1530
wenzelm@41594
  1531
* ML structure Unsynchronized is never opened, not even in Isar
wenzelm@38980
  1532
interaction mode as before.  Old Unsynchronized.set etc. have been
wenzelm@38980
  1533
discontinued -- use plain := instead.  This should be *rare* anyway,
wenzelm@38980
  1534
since modern tools always work via official context data, notably
wenzelm@38980
  1535
configuration options.
wenzelm@38980
  1536
wenzelm@39239
  1537
* Parallel and asynchronous execution requires special care concerning
wenzelm@39239
  1538
interrupts.  Structure Exn provides some convenience functions that
wenzelm@39239
  1539
avoid working directly with raw Interrupt.  User code must not absorb
wenzelm@39239
  1540
interrupts -- intermediate handling (for cleanup etc.) needs to be
wenzelm@39239
  1541
followed by re-raising of the original exception.  Another common
wenzelm@39239
  1542
source of mistakes are "handle _" patterns, which make the meaning of
wenzelm@39239
  1543
the program subject to physical effects of the environment.
wenzelm@39239
  1544
wenzelm@37868
  1545
wenzelm@37868
  1546
wenzelm@37144
  1547
New in Isabelle2009-2 (June 2010)
wenzelm@37144
  1548
---------------------------------
haftmann@33993
  1549
wenzelm@35260
  1550
*** General ***
wenzelm@35260
  1551
wenzelm@35436
  1552
* Authentic syntax for *all* logical entities (type classes, type
wenzelm@35436
  1553
constructors, term constants): provides simple and robust
wenzelm@35436
  1554
correspondence between formal entities and concrete syntax.  Within
wenzelm@35436
  1555
the parse tree / AST representations, "constants" are decorated by
wenzelm@35436
  1556
their category (class, type, const) and spelled out explicitly with
wenzelm@35436
  1557
their full internal name.
wenzelm@35436
  1558
wenzelm@35436
  1559
Substantial INCOMPATIBILITY concerning low-level syntax declarations
wenzelm@35436
  1560
and translations (translation rules and translation functions in ML).
wenzelm@35436
  1561
Some hints on upgrading:
wenzelm@35260
  1562
wenzelm@35260
  1563
  - Many existing uses of 'syntax' and 'translations' can be replaced
wenzelm@35436
  1564
    by more modern 'type_notation', 'notation' and 'abbreviation',
wenzelm@35436
  1565
    which are independent of this issue.
wenzelm@35260
  1566
wenzelm@35260
  1567
  - 'translations' require markup within the AST; the term syntax
wenzelm@35260
  1568
    provides the following special forms:
wenzelm@35260
  1569
wenzelm@35260
  1570
      CONST c   -- produces syntax version of constant c from context
wenzelm@35261
  1571
      XCONST c  -- literally c, checked as constant from context
wenzelm@35261
  1572
      c         -- literally c, if declared by 'syntax'
wenzelm@35261
  1573
wenzelm@35261
  1574
    Plain identifiers are treated as AST variables -- occasionally the
wenzelm@35261
  1575
    system indicates accidental variables via the error "rhs contains
wenzelm@35261
  1576
    extra variables".
wenzelm@35260
  1577
wenzelm@35436
  1578
    Type classes and type constructors are marked according to their
wenzelm@35436
  1579
    concrete syntax.  Some old translations rules need to be written
wenzelm@35436
  1580
    for the "type" category, using type constructor application
wenzelm@35436
  1581
    instead of pseudo-term application of the default category
wenzelm@35436
  1582
    "logic".
wenzelm@35436
  1583
wenzelm@35260
  1584
  - 'parse_translation' etc. in ML may use the following
wenzelm@35260
  1585
    antiquotations:
wenzelm@35260
  1586
wenzelm@35436
  1587
      @{class_syntax c}   -- type class c within parse tree / AST
wenzelm@35436
  1588
      @{term_syntax c}    -- type constructor c within parse tree / AST
wenzelm@35260
  1589
      @{const_syntax c}   -- ML version of "CONST c" above
wenzelm@35260
  1590
      @{syntax_const c}   -- literally c (checked wrt. 'syntax' declarations)
wenzelm@35260
  1591
wenzelm@35436
  1592
  - Literal types within 'typed_print_translations', i.e. those *not*
wenzelm@35436
  1593
    represented as pseudo-terms are represented verbatim.  Use @{class
wenzelm@35436
  1594
    c} or @{type_name c} here instead of the above syntax
wenzelm@35436
  1595
    antiquotations.
wenzelm@35436
  1596
wenzelm@35260
  1597
Note that old non-authentic syntax was based on unqualified base
wenzelm@35436
  1598
names, so all of the above "constant" names would coincide.  Recall
wenzelm@35436
  1599
that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
wenzelm@35436
  1600
diagnose syntax problems.
wenzelm@35260
  1601
wenzelm@35351
  1602
* Type constructors admit general mixfix syntax, not just infix.
wenzelm@35351
  1603
wenzelm@36508
  1604
* Concrete syntax may be attached to local entities without a proof
wenzelm@36508
  1605
body, too.  This works via regular mixfix annotations for 'fix',
wenzelm@36508
  1606
'def', 'obtain' etc. or via the explicit 'write' command, which is
wenzelm@36508
  1607
similar to the 'notation' command in theory specifications.
wenzelm@36508
  1608
wenzelm@37351
  1609
* Discontinued unnamed infix syntax (legacy feature for many years) --
wenzelm@37351
  1610
need to specify constant name and syntax separately.  Internal ML
wenzelm@37351
  1611
datatype constructors have been renamed from InfixName to Infix etc.
wenzelm@37351
  1612
Minor INCOMPATIBILITY.
wenzelm@37351
  1613
wenzelm@37351
  1614
* Schematic theorem statements need to be explicitly markup as such,
wenzelm@37351
  1615
via commands 'schematic_lemma', 'schematic_theorem',
wenzelm@37351
  1616
'schematic_corollary'.  Thus the relevance of the proof is made
wenzelm@37351
  1617
syntactically clear, which impacts performance in a parallel or
wenzelm@37351
  1618
asynchronous interactive environment.  Minor INCOMPATIBILITY.
wenzelm@37351
  1619
wenzelm@35613
  1620
* Use of cumulative prems via "!" in some proof methods has been
wenzelm@37351
  1621
discontinued (old legacy feature).
wenzelm@35613
  1622
boehmes@35979
  1623
* References 'trace_simp' and 'debug_simp' have been replaced by
wenzelm@36857
  1624
configuration options stored in the context. Enabling tracing (the
wenzelm@36857
  1625
case of debugging is similar) in proofs works via
wenzelm@36857
  1626
wenzelm@36857
  1627
  using [[trace_simp = true]]
wenzelm@36857
  1628
wenzelm@36857
  1629
Tracing is then active for all invocations of the simplifier in
wenzelm@36857
  1630
subsequent goal refinement steps. Tracing may also still be enabled or
wenzelm@40780
  1631
disabled via the ProofGeneral settings menu.
boehmes@35979
  1632
wenzelm@36177
  1633
* Separate commands 'hide_class', 'hide_type', 'hide_const',
wenzelm@36177
  1634
'hide_fact' replace the former 'hide' KIND command.  Minor
wenzelm@36177
  1635
INCOMPATIBILITY.
wenzelm@36177
  1636
wenzelm@37298
  1637
* Improved parallelism of proof term normalization: usedir -p2 -q0 is
wenzelm@37298
  1638
more efficient than combinations with -q1 or -q2.
wenzelm@37298
  1639
wenzelm@35260
  1640
haftmann@34170
  1641
*** Pure ***
haftmann@34170
  1642
wenzelm@37351
  1643
* Proofterms record type-class reasoning explicitly, using the
wenzelm@37351
  1644
"unconstrain" operation internally.  This eliminates all sort
wenzelm@37351
  1645
constraints from a theorem and proof, introducing explicit
wenzelm@37351
  1646
OFCLASS-premises.  On the proof term level, this operation is
wenzelm@37351
  1647
automatically applied at theorem boundaries, such that closed proofs
wenzelm@37351
  1648
are always free of sort constraints.  INCOMPATIBILITY for tools that
wenzelm@37351
  1649
inspect proof terms.
haftmann@36147
  1650
wenzelm@35765
  1651
* Local theory specifications may depend on extra type variables that
wenzelm@35765
  1652
are not present in the result type -- arguments TYPE('a) :: 'a itself
wenzelm@35765
  1653
are added internally.  For example:
wenzelm@35765
  1654
wenzelm@35765
  1655
  definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
wenzelm@35765
  1656
wenzelm@37351
  1657
* Predicates of locales introduced by classes carry a mandatory
wenzelm@37351
  1658
"class" prefix.  INCOMPATIBILITY.
wenzelm@37351
  1659
wenzelm@37351
  1660
* Vacuous class specifications observe default sort.  INCOMPATIBILITY.
wenzelm@37351
  1661
wenzelm@37351
  1662
* Old 'axclass' command has been discontinued.  INCOMPATIBILITY, use
wenzelm@37351
  1663
'class' instead.
wenzelm@37351
  1664
wenzelm@37351
  1665
* Command 'code_reflect' allows to incorporate generated ML code into
wenzelm@37351
  1666
runtime environment; replaces immature code_datatype antiquotation.
wenzelm@37351
  1667
INCOMPATIBILITY.
wenzelm@37351
  1668
wenzelm@37351
  1669
* Code generator: simple concept for abstract datatypes obeying
wenzelm@37351
  1670
invariants.
wenzelm@37351
  1671
wenzelm@36857
  1672
* Code generator: details of internal data cache have no impact on the
wenzelm@36857
  1673
user space functionality any longer.
wenzelm@36857
  1674
wenzelm@37351
  1675
* Methods "unfold_locales" and "intro_locales" ignore non-locale
wenzelm@37351
  1676
subgoals.  This is more appropriate for interpretations with 'where'.
wenzelm@36857
  1677
INCOMPATIBILITY.
haftmann@34170
  1678
wenzelm@36356
  1679
* Command 'example_proof' opens an empty proof body.  This allows to
wenzelm@36356
  1680
experiment with Isar, without producing any persistent result.
wenzelm@36356
  1681
wenzelm@35413
  1682
* Commands 'type_notation' and 'no_type_notation' declare type syntax
wenzelm@35413
  1683
within a local theory context, with explicit checking of the
wenzelm@35413
  1684
constructors involved (in contrast to the raw 'syntax' versions).
wenzelm@35413
  1685
wenzelm@36178
  1686
* Commands 'types' and 'typedecl' now work within a local theory
wenzelm@36178
  1687
context -- without introducing dependencies on parameters or
wenzelm@36178
  1688
assumptions, which is not possible in Isabelle/Pure.
wenzelm@35681
  1689
wenzelm@36857
  1690
* Command 'defaultsort' has been renamed to 'default_sort', it works
wenzelm@36857
  1691
within a local theory context.  Minor INCOMPATIBILITY.
wenzelm@36454
  1692
haftmann@34170
  1693
haftmann@33993
  1694
*** HOL ***
haftmann@33993
  1695
wenzelm@37351
  1696
* Command 'typedef' now works within a local theory context -- without
wenzelm@37351
  1697
introducing dependencies on parameters or assumptions, which is not
wenzelm@37351
  1698
possible in Isabelle/Pure/HOL.  Note that the logical environment may
wenzelm@37351
  1699
contain multiple interpretations of local typedefs (with different
wenzelm@37351
  1700
non-emptiness proofs), even in a global theory context.
wenzelm@37351
  1701
wenzelm@37351
  1702
* New package for quotient types.  Commands 'quotient_type' and
wenzelm@37351
  1703
'quotient_definition' may be used for defining types and constants by
wenzelm@37351
  1704
quotient constructions.  An example is the type of integers created by
wenzelm@37351
  1705
quotienting pairs of natural numbers:
wenzelm@37380
  1706
wenzelm@37351
  1707
  fun
wenzelm@37380
  1708
    intrel :: "(nat * nat) => (nat * nat) => bool"
wenzelm@37351
  1709
  where
wenzelm@37351
  1710
    "intrel (x, y) (u, v) = (x + v = u + y)"
wenzelm@37351
  1711
wenzelm@37380
  1712
  quotient_type int = "nat * nat" / intrel
wenzelm@37351
  1713
    by (auto simp add: equivp_def expand_fun_eq)
wenzelm@37380
  1714
wenzelm@37351
  1715
  quotient_definition
wenzelm@37351
  1716
    "0::int" is "(0::nat, 0::nat)"
wenzelm@37351
  1717
wenzelm@37351
  1718
The method "lifting" can be used to lift of theorems from the
wenzelm@37351
  1719
underlying "raw" type to the quotient type.  The example
wenzelm@37351
  1720
src/HOL/Quotient_Examples/FSet.thy includes such a quotient
wenzelm@37351
  1721
construction and provides a reasoning infrastructure for finite sets.
wenzelm@37351
  1722
wenzelm@37351
  1723
* Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
wenzelm@37351
  1724
clash with new theory Quotient in Main HOL.
wenzelm@37351
  1725
wenzelm@37351
  1726
* Moved the SMT binding into the main HOL session, eliminating
wenzelm@37351
  1727
separate HOL-SMT session.
wenzelm@37351
  1728
haftmann@37020
  1729
* List membership infix mem operation is only an input abbreviation.
haftmann@37020
  1730
INCOMPATIBILITY.
haftmann@37020
  1731
wenzelm@37144
  1732
* Theory Library/Word.thy has been removed.  Use library Word/Word.thy
wenzelm@37144
  1733
for future developements; former Library/Word.thy is still present in
wenzelm@37144
  1734
the AFP entry RSAPPS.
haftmann@36963
  1735
wenzelm@36857
  1736
* Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
wenzelm@36857
  1737
longer shadowed.  INCOMPATIBILITY.
haftmann@36808
  1738
huffman@36836
  1739
* Dropped theorem duplicate comp_arith; use semiring_norm instead.
huffman@36836
  1740
INCOMPATIBILITY.
huffman@36836
  1741
huffman@36836
  1742
* Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
huffman@36836
  1743
INCOMPATIBILITY.
haftmann@36714
  1744
wenzelm@36857
  1745
* Dropped normalizing_semiring etc; use the facts in semiring classes
wenzelm@36857
  1746
instead.  INCOMPATIBILITY.
wenzelm@36857
  1747
huffman@36979
  1748
* Dropped several real-specific versions of lemmas about floor and
wenzelm@37351
  1749
ceiling; use the generic lemmas from theory "Archimedean_Field"
wenzelm@37351
  1750
instead.  INCOMPATIBILITY.
huffman@36979
  1751
huffman@36979
  1752
  floor_number_of_eq         ~> floor_number_of
huffman@36979
  1753
  le_floor_eq_number_of      ~> number_of_le_floor
huffman@36979
  1754
  le_floor_eq_zero           ~> zero_le_floor
huffman@36979
  1755
  le_floor_eq_one            ~> one_le_floor
huffman@36979
  1756
  floor_less_eq_number_of    ~> floor_less_number_of
huffman@36979
  1757
  floor_less_eq_zero         ~> floor_less_zero
huffman@36979
  1758
  floor_less_eq_one          ~> floor_less_one
huffman@36979
  1759
  less_floor_eq_number_of    ~> number_of_less_floor
huffman@36979
  1760
  less_floor_eq_zero         ~> zero_less_floor
huffman@36979
  1761
  less_floor_eq_one          ~> one_less_floor
huffman@36979
  1762
  floor_le_eq_number_of      ~> floor_le_number_of
huffman@36979
  1763
  floor_le_eq_zero           ~> floor_le_zero
huffman@36979
  1764
  floor_le_eq_one            ~> floor_le_one
huffman@36979
  1765
  floor_subtract_number_of   ~> floor_diff_number_of
huffman@36979
  1766
  floor_subtract_one         ~> floor_diff_one
huffman@36979
  1767
  ceiling_number_of_eq       ~> ceiling_number_of
huffman@36979
  1768
  ceiling_le_eq_number_of    ~> ceiling_le_number_of
huffman@36979
  1769
  ceiling_le_zero_eq         ~> ceiling_le_zero
huffman@36979
  1770
  ceiling_le_eq_one          ~> ceiling_le_one
huffman@36979
  1771
  less_ceiling_eq_number_of  ~> number_of_less_ceiling
huffman@36979
  1772
  less_ceiling_eq_zero       ~> zero_less_ceiling
huffman@36979
  1773
  less_ceiling_eq_one        ~> one_less_ceiling
huffman@36979
  1774
  ceiling_less_eq_number_of  ~> ceiling_less_number_of
huffman@36979
  1775
  ceiling_less_eq_zero       ~> ceiling_less_zero
huffman@36979
  1776
  ceiling_less_eq_one        ~> ceiling_less_one
huffman@36979
  1777
  le_ceiling_eq_number_of    ~> number_of_le_ceiling
huffman@36979
  1778
  le_ceiling_eq_zero         ~> zero_le_ceiling
huffman@36979
  1779
  le_ceiling_eq_one          ~> one_le_ceiling
huffman@36979
  1780
  ceiling_subtract_number_of ~> ceiling_diff_number_of
huffman@36979
  1781
  ceiling_subtract_one       ~> ceiling_diff_one
huffman@36979
  1782
wenzelm@37144
  1783
* Theory "Finite_Set": various folding_XXX locales facilitate the
wenzelm@36857
  1784
application of the various fold combinators on finite sets.
wenzelm@36857
  1785
wenzelm@36857
  1786
* Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
wenzelm@36857
  1787
provides abstract red-black tree type which is backed by "RBT_Impl" as
wenzelm@36857
  1788
implementation.  INCOMPATIBILTY.
haftmann@36147
  1789
huffman@36830
  1790
* Theory Library/Coinductive_List has been removed -- superseded by
wenzelm@35763
  1791
AFP/thys/Coinductive.
wenzelm@35763
  1792
huffman@36829
  1793
* Theory PReal, including the type "preal" and related operations, has
huffman@36829
  1794
been removed.  INCOMPATIBILITY.
huffman@36829
  1795
wenzelm@37380
  1796
* Real: new development using Cauchy Sequences.
wenzelm@37380
  1797
wenzelm@37351
  1798
* Split off theory "Big_Operators" containing setsum, setprod,
wenzelm@37351
  1799
Inf_fin, Sup_fin, Min, Max from theory Finite_Set.  INCOMPATIBILITY.
wenzelm@36857
  1800
wenzelm@36857
  1801
* Theory "Rational" renamed to "Rat", for consistency with "Nat",
wenzelm@36857
  1802
"Int" etc.  INCOMPATIBILITY.
wenzelm@36857
  1803
wenzelm@37351
  1804
* Constant Rat.normalize needs to be qualified.  INCOMPATIBILITY.
wenzelm@37143
  1805
wenzelm@36857
  1806
* New set of rules "ac_simps" provides combined assoc / commute
wenzelm@36857
  1807
rewrites for all interpretations of the appropriate generic locales.
wenzelm@36857
  1808
wenzelm@36857
  1809
* Renamed theory "OrderedGroup" to "Groups" and split theory
wenzelm@36857
  1810
"Ring_and_Field" into theories "Rings" and "Fields"; for more
wenzelm@36857
  1811
appropriate and more consistent names suitable for name prefixes
wenzelm@36857
  1812
within the HOL theories.  INCOMPATIBILITY.
haftmann@35050
  1813
haftmann@35084
  1814
* Some generic constants have been put to appropriate theories:
wenzelm@36857
  1815
  - less_eq, less: Orderings
wenzelm@36857
  1816
  - zero, one, plus, minus, uminus, times, abs, sgn: Groups
wenzelm@36857
  1817
  - inverse, divide: Rings
haftmann@35084
  1818
INCOMPATIBILITY.
haftmann@35084
  1819
wenzelm@36857
  1820
* More consistent naming of type classes involving orderings (and
wenzelm@36857
  1821
lattices):
haftmann@35027
  1822
haftmann@35027
  1823
    lower_semilattice                   ~> semilattice_inf
haftmann@35027
  1824
    upper_semilattice                   ~> semilattice_sup
haftmann@35027
  1825
haftmann@35027
  1826
    dense_linear_order                  ~> dense_linorder
haftmann@35027
  1827
haftmann@35027
  1828
    pordered_ab_group_add               ~> ordered_ab_group_add
haftmann@35027
  1829
    pordered_ab_group_add_abs           ~> ordered_ab_group_add_abs
haftmann@35027
  1830
    pordered_ab_semigroup_add           ~> ordered_ab_semigroup_add
haftmann@35027
  1831
    pordered_ab_semigroup_add_imp_le    ~> ordered_ab_semigroup_add_imp_le
haftmann@35027
  1832
    pordered_cancel_ab_semigroup_add    ~> ordered_cancel_ab_semigroup_add
haftmann@35027
  1833
    pordered_cancel_comm_semiring       ~> ordered_cancel_comm_semiring
haftmann@35027
  1834
    pordered_cancel_semiring            ~> ordered_cancel_semiring
haftmann@35027
  1835
    pordered_comm_monoid_add            ~> ordered_comm_monoid_add
haftmann@35027
  1836
    pordered_comm_ring                  ~> ordered_comm_ring
haftmann@35027
  1837
    pordered_comm_semiring              ~> ordered_comm_semiring
haftmann@35027
  1838
    pordered_ring                       ~> ordered_ring
haftmann@35027
  1839
    pordered_ring_abs                   ~> ordered_ring_abs
haftmann@35027
  1840
    pordered_semiring                   ~> ordered_semiring
haftmann@35027
  1841
haftmann@35027
  1842
    ordered_ab_group_add                ~> linordered_ab_group_add
haftmann@35027
  1843
    ordered_ab_semigroup_add            ~> linordered_ab_semigroup_add
haftmann@35027
  1844
    ordered_cancel_ab_semigroup_add     ~> linordered_cancel_ab_semigroup_add
haftmann@35027
  1845
    ordered_comm_semiring_strict        ~> linordered_comm_semiring_strict
haftmann@35027
  1846
    ordered_field                       ~> linordered_field
haftmann@35027
  1847
    ordered_field_no_lb                 ~> linordered_field_no_lb
haftmann@35027
  1848
    ordered_field_no_ub                 ~> linordered_field_no_ub
haftmann@35027
  1849
    ordered_field_dense_linear_order    ~> dense_linordered_field
haftmann@35027
  1850
    ordered_idom                        ~> linordered_idom
haftmann@35027
  1851
    ordered_ring                        ~> linordered_ring
haftmann@35027
  1852
    ordered_ring_le_cancel_factor       ~> linordered_ring_le_cancel_factor
haftmann@35027
  1853
    ordered_ring_less_cancel_factor     ~> linordered_ring_less_cancel_factor
haftmann@35027
  1854
    ordered_ring_strict                 ~> linordered_ring_strict
haftmann@35027
  1855
    ordered_semidom                     ~> linordered_semidom
haftmann@35027
  1856
    ordered_semiring                    ~> linordered_semiring
haftmann@35027
  1857
    ordered_semiring_1                  ~> linordered_semiring_1
haftmann@35027
  1858
    ordered_semiring_1_strict           ~> linordered_semiring_1_strict
haftmann@35027
  1859
    ordered_semiring_strict             ~> linordered_semiring_strict
haftmann@35027
  1860
wenzelm@36857
  1861
  The following slightly odd type classes have been moved to a
wenzelm@37351
  1862
  separate theory Library/Lattice_Algebras:
haftmann@35032
  1863
haftmann@35032
  1864
    lordered_ab_group_add               ~> lattice_ab_group_add
haftmann@35032
  1865
    lordered_ab_group_add_abs           ~> lattice_ab_group_add_abs
haftmann@35032
  1866
    lordered_ab_group_add_meet          ~> semilattice_inf_ab_group_add
haftmann@35032
  1867
    lordered_ab_group_add_join          ~> semilattice_sup_ab_group_add
haftmann@35032
  1868
    lordered_ring                       ~> lattice_ring
haftmann@35032
  1869
haftmann@35027
  1870
INCOMPATIBILITY.
haftmann@35027
  1871
haftmann@36416
  1872
* Refined field classes:
wenzelm@36857
  1873
  - classes division_ring_inverse_zero, field_inverse_zero,
wenzelm@36857
  1874
    linordered_field_inverse_zero include rule inverse 0 = 0 --
wenzelm@36857
  1875
    subsumes former division_by_zero class;
wenzelm@36857
  1876
  - numerous lemmas have been ported from field to division_ring.
wenzelm@36857
  1877
INCOMPATIBILITY.
haftmann@36416
  1878
haftmann@36416
  1879
* Refined algebra theorem collections:
wenzelm@36857
  1880
  - dropped theorem group group_simps, use algebra_simps instead;
wenzelm@36857
  1881
  - dropped theorem group ring_simps, use field_simps instead;
wenzelm@36857
  1882
  - proper theorem collection field_simps subsumes former theorem
wenzelm@36857
  1883
    groups field_eq_simps and field_simps;
wenzelm@36857
  1884
  - dropped lemma eq_minus_self_iff which is a duplicate for
wenzelm@36857
  1885
    equal_neg_zero.
wenzelm@36857
  1886
INCOMPATIBILITY.
wenzelm@35009
  1887
wenzelm@35009
  1888
* Theory Finite_Set and List: some lemmas have been generalized from
wenzelm@34076
  1889
sets to lattices:
wenzelm@34076
  1890
haftmann@34007
  1891
  fun_left_comm_idem_inter      ~> fun_left_comm_idem_inf
haftmann@34007
  1892
  fun_left_comm_idem_union      ~> fun_left_comm_idem_sup
haftmann@34007
  1893
  inter_Inter_fold_inter        ~> inf_Inf_fold_inf
haftmann@34007
  1894
  union_Union_fold_union        ~> sup_Sup_fold_sup
haftmann@34007
  1895
  Inter_fold_inter              ~> Inf_fold_inf
haftmann@34007
  1896
  Union_fold_union              ~> Sup_fold_sup
haftmann@34007
  1897
  inter_INTER_fold_inter        ~> inf_INFI_fold_inf
haftmann@34007
  1898
  union_UNION_fold_union        ~> sup_SUPR_fold_sup
haftmann@34007
  1899
  INTER_fold_inter              ~> INFI_fold_inf
haftmann@34007
  1900
  UNION_fold_union              ~> SUPR_fold_sup
haftmann@34007
  1901
wenzelm@44973
  1902
* Theory "Complete_Lattice": lemmas top_def and bot_def have been
wenzelm@44973
  1903
replaced by the more convenient lemmas Inf_empty and Sup_empty.
wenzelm@44973
  1904
Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
wenzelm@44973
  1905
by Inf_insert and Sup_insert.  Lemmas Inf_UNIV and Sup_UNIV replace
wenzelm@44973
  1906
former Inf_Univ and Sup_Univ.  Lemmas inf_top_right and sup_bot_right
wenzelm@44973
  1907
subsume inf_top and sup_bot respectively.  INCOMPATIBILITY.
haftmann@36416
  1908
wenzelm@36857
  1909
* Reorganized theory Multiset: swapped notation of pointwise and
wenzelm@36857
  1910
multiset order:
wenzelm@37351
  1911
wenzelm@36857
  1912
  - pointwise ordering is instance of class order with standard syntax
wenzelm@36857
  1913
    <= and <;
wenzelm@36857
  1914
  - multiset ordering has syntax <=# and <#; partial order properties
wenzelm@36857
  1915
    are provided by means of interpretation with prefix
wenzelm@36857
  1916
    multiset_order;
wenzelm@36857
  1917
  - less duplication, less historical organization of sections,
wenzelm@36857
  1918
    conversion from associations lists to multisets, rudimentary code
wenzelm@36857
  1919
    generation;
wenzelm@36857
  1920
  - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
wenzelm@36857
  1921
    if needed.
wenzelm@37351
  1922
nipkow@36903
  1923
Renamed:
wenzelm@37351
  1924
wenzelm@37351
  1925
  multiset_eq_conv_count_eq  ~>  multiset_ext_iff
wenzelm@37351
  1926
  multi_count_ext  ~>  multiset_ext
wenzelm@37351
  1927
  diff_union_inverse2  ~>  diff_union_cancelR
wenzelm@37351
  1928
wenzelm@36857
  1929
INCOMPATIBILITY.
haftmann@36416
  1930
nipkow@36903
  1931
* Theory Permutation: replaced local "remove" by List.remove1.
nipkow@36903
  1932
haftmann@36416
  1933
* Code generation: ML and OCaml code is decorated with signatures.
haftmann@36416
  1934
wenzelm@35009
  1935
* Theory List: added transpose.
wenzelm@35009
  1936
huffman@35810
  1937
* Library/Nat_Bijection.thy is a collection of bijective functions
huffman@35810
  1938
between nat and other types, which supersedes the older libraries
huffman@35810
  1939
Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy.  INCOMPATIBILITY.
huffman@35810
  1940
huffman@35810
  1941
  Constants:
huffman@35810
  1942
  Nat_Int_Bij.nat2_to_nat         ~> prod_encode
huffman@35810
  1943
  Nat_Int_Bij.nat_to_nat2         ~> prod_decode
huffman@35810
  1944
  Nat_Int_Bij.int_to_nat_bij      ~> int_encode
huffman@35810
  1945
  Nat_Int_Bij.nat_to_int_bij      ~> int_decode
huffman@35810
  1946
  Countable.pair_encode           ~> prod_encode
huffman@35810
  1947
  NatIso.prod2nat                 ~> prod_encode
huffman@35810
  1948
  NatIso.nat2prod                 ~> prod_decode
huffman@35810
  1949
  NatIso.sum2nat                  ~> sum_encode
huffman@35810
  1950
  NatIso.nat2sum                  ~> sum_decode
huffman@35810
  1951
  NatIso.list2nat                 ~> list_encode
huffman@35810
  1952
  NatIso.nat2list                 ~> list_decode
huffman@35810
  1953
  NatIso.set2nat                  ~> set_encode
huffman@35810
  1954
  NatIso.nat2set                  ~> set_decode
huffman@35810
  1955
huffman@35810
  1956
  Lemmas:
huffman@35810
  1957
  Nat_Int_Bij.bij_nat_to_int_bij  ~> bij_int_decode
huffman@35810
  1958
  Nat_Int_Bij.nat2_to_nat_inj     ~> inj_prod_encode
huffman@35810
  1959
  Nat_Int_Bij.nat2_to_nat_surj    ~> surj_prod_encode
huffman@35810
  1960
  Nat_Int_Bij.nat_to_nat2_inj     ~> inj_prod_decode
huffman@35810
  1961
  Nat_Int_Bij.nat_to_nat2_surj    ~> surj_prod_decode
huffman@35810
  1962
  Nat_Int_Bij.i2n_n2i_id          ~> int_encode_inverse
huffman@35810
  1963
  Nat_Int_Bij.n2i_i2n_id          ~> int_decode_inverse
huffman@35810
  1964
  Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
huffman@35810
  1965
  Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
huffman@35810
  1966
  Nat_Int_Bij.inj_nat_to_int_bij  ~> inj_int_encode
huffman@35810
  1967
  Nat_Int_Bij.inj_int_to_nat_bij  ~> inj_int_decode
huffman@35810
  1968
  Nat_Int_Bij.bij_nat_to_int_bij  ~> bij_int_encode
huffman@35810
  1969
  Nat_Int_Bij.bij_int_to_nat_bij  ~> bij_int_decode
huffman@35810
  1970
blanchet@36929
  1971
* Sledgehammer:
blanchet@36929
  1972
  - Renamed ATP commands:
blanchet@36929
  1973
    atp_info     ~> sledgehammer running_atps
blanchet@36929
  1974
    atp_kill     ~> sledgehammer kill_atps
blanchet@36929
  1975
    atp_messages ~> sledgehammer messages
blanchet@36929
  1976
    atp_minimize ~> sledgehammer minimize
blanchet@36929
  1977
    print_atps   ~> sledgehammer available_atps
blanchet@36929
  1978
    INCOMPATIBILITY.
blanchet@36929
  1979
  - Added user's manual ("isabelle doc sledgehammer").
blanchet@36929
  1980
  - Added option syntax and "sledgehammer_params" to customize
blanchet@36929
  1981
    Sledgehammer's behavior.  See the manual for details.
blanchet@36929
  1982
  - Modified the Isar proof reconstruction code so that it produces
blanchet@36929
  1983
    direct proofs rather than proofs by contradiction.  (This feature
blanchet@36929
  1984
    is still experimental.)
blanchet@36929
  1985
  - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
blanchet@36929
  1986
    full-typed mode.
blanchet@36929
  1987
  - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
blanchet@36929
  1988
blanchet@36928
  1989
* Nitpick:
blanchet@36928
  1990
  - Added and implemented "binary_ints" and "bits" options.
blanchet@36928
  1991
  - Added "std" option and implemented support for nonstandard models.
blanchet@36928
  1992
  - Added and implemented "finitize" option to improve the precision
blanchet@36928
  1993
    of infinite datatypes based on a monotonicity analysis.
blanchet@36928
  1994
  - Added support for quotient types.
blanchet@36928
  1995
  - Added support for "specification" and "ax_specification"
blanchet@36928
  1996
    constructs.
blanchet@36928
  1997
  - Added support for local definitions (for "function" and
blanchet@36928
  1998
    "termination" proofs).
blanchet@36928
  1999
  - Added support for term postprocessors.
blanchet@36928
  2000
  - Optimized "Multiset.multiset" and "FinFun.finfun".
blanchet@36928
  2001
  - Improved efficiency of "destroy_constrs" optimization.
blanchet@36928
  2002
  - Fixed soundness bugs related to "destroy_constrs" optimization and
blanchet@36928
  2003
    record getters.
blanchet@37272
  2004
  - Fixed soundness bug related to higher-order constructors.
blanchet@37272
  2005
  - Fixed soundness bug when "full_descrs" is enabled.
blanchet@36928
  2006
  - Improved precision of set constructs.
blanchet@37260
  2007
  - Added "atoms" option.
blanchet@36928
  2008
  - Added cache to speed up repeated Kodkod invocations on the same
blanchet@36928
  2009
    problems.
blanchet@36928
  2010
  - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
blanchet@36928
  2011
    "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
blanchet@36928
  2012
    "SAT4J_Light".  INCOMPATIBILITY.
blanchet@36928
  2013
  - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
blanchet@36928
  2014
    "sharing_depth", and "show_skolems" options.  INCOMPATIBILITY.
blanchet@37264
  2015
  - Removed "nitpick_intro" attribute.  INCOMPATIBILITY.
blanchet@36928
  2016
berghofe@37361
  2017
* Method "induct" now takes instantiations of the form t, where t is not
berghofe@37361
  2018
  a variable, as a shorthand for "x == t", where x is a fresh variable.
berghofe@37361
  2019
  If this is not intended, t has to be enclosed in parentheses.
berghofe@37361
  2020
  By default, the equalities generated by definitional instantiations
berghofe@37361
  2021
  are pre-simplified, which may cause parameters of inductive cases
berghofe@37361
  2022
  to disappear, or may even delete some of the inductive cases.
berghofe@37361
  2023
  Use "induct (no_simp)" instead of "induct" to restore the old
berghofe@37361
  2024
  behaviour. The (no_simp) option is also understood by the "cases"
berghofe@37361
  2025
  and "nominal_induct" methods, which now perform pre-simplification, too.
berghofe@37361
  2026
  INCOMPATIBILITY.
berghofe@37361
  2027
haftmann@33993
  2028
huffman@36828
  2029
*** HOLCF ***
huffman@36828
  2030
huffman@36828
  2031
* Variable names in lemmas generated by the domain package have
huffman@36828
  2032
changed; the naming scheme is now consistent with the HOL datatype
huffman@36828
  2033
package.  Some proof scripts may be affected, INCOMPATIBILITY.
huffman@36828
  2034
huffman@36828
  2035
* The domain package no longer defines the function "foo_copy" for
huffman@36828
  2036
recursive domain "foo".  The reach lemma is now stated directly in
huffman@36828
  2037
terms of "foo_take".  Lemmas and proofs that mention "foo_copy" must
huffman@36828
  2038
be reformulated in terms of "foo_take", INCOMPATIBILITY.
huffman@36828
  2039
huffman@36828
  2040
* Most definedness lemmas generated by the domain package (previously
huffman@36828
  2041
of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
huffman@36828
  2042
like "foo$x = UU <-> x = UU", which works better as a simp rule.
wenzelm@37351
  2043
Proofs that used definedness lemmas as intro rules may break,
huffman@36828
  2044
potential INCOMPATIBILITY.
huffman@36828
  2045
huffman@36828
  2046
* Induction and casedist rules generated by the domain package now
huffman@36828
  2047
declare proper case_names (one called "bottom", and one named for each
huffman@36828
  2048
constructor).  INCOMPATIBILITY.
huffman@36828
  2049
huffman@36828
  2050
* For mutually-recursive domains, separate "reach" and "take_lemma"
huffman@36828
  2051
rules are generated for each domain, INCOMPATIBILITY.
huffman@36828
  2052
huffman@36828
  2053
  foo_bar.reach       ~> foo.reach  bar.reach
huffman@36828
  2054
  foo_bar.take_lemmas ~> foo.take_lemma  bar.take_lemma
huffman@36828
  2055
huffman@36828
  2056
* Some lemmas generated by the domain package have been renamed for
huffman@36828
  2057
consistency with the datatype package, INCOMPATIBILITY.
huffman@36828
  2058
huffman@36828
  2059
  foo.ind        ~> foo.induct
huffman@36828
  2060
  foo.finite_ind ~> foo.finite_induct
huffman@36828
  2061
  foo.coind      ~> foo.coinduct
huffman@36828
  2062
  foo.casedist   ~> foo.exhaust
huffman@36828
  2063
  foo.exhaust    ~> foo.nchotomy
huffman@36828
  2064
huffman@36828
  2065
* For consistency with other definition packages, the fixrec package
huffman@36828
  2066
now generates qualified theorem names, INCOMPATIBILITY.
huffman@36828
  2067
huffman@36828
  2068
  foo_simps  ~> foo.simps
huffman@36828
  2069
  foo_unfold ~> foo.unfold
huffman@36828
  2070
  foo_induct ~> foo.induct
huffman@36828
  2071
huffman@37087
  2072
* The "fixrec_simp" attribute has been removed.  The "fixrec_simp"
huffman@37087
  2073
method and internal fixrec proofs now use the default simpset instead.
huffman@37087
  2074
INCOMPATIBILITY.
huffman@37087
  2075
huffman@36828
  2076
* The "contlub" predicate has been removed.  Proof scripts should use
huffman@36828
  2077
lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
huffman@36828
  2078
huffman@36828
  2079
* The "admw" predicate has been removed, INCOMPATIBILITY.
huffman@36828
  2080
huffman@36828
  2081
* The constants cpair, cfst, and csnd have been removed in favor of
huffman@36828
  2082
Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
huffman@36828
  2083
huffman@36828
  2084
haftmann@33993
  2085
*** ML ***
haftmann@33993
  2086
wenzelm@37351
  2087
* Antiquotations for basic formal entities:
wenzelm@37351
  2088
wenzelm@37351
  2089
    @{class NAME}         -- type class
wenzelm@37351
  2090
    @{class_syntax NAME}  -- syntax representation of the above
wenzelm@37351
  2091
wenzelm@37351
  2092
    @{type_name NAME}     -- logical type
wenzelm@37351
  2093
    @{type_abbrev NAME}   -- type abbreviation
wenzelm@37351
  2094
    @{nonterminal NAME}   -- type of concrete syntactic category
wenzelm@37351
  2095
    @{type_syntax NAME}   -- syntax representation of any of the above
wenzelm@37351
  2096
wenzelm@37351
  2097
    @{const_name NAME}    -- logical constant (INCOMPATIBILITY)
wenzelm@37351
  2098
    @{const_abbrev NAME}  -- abbreviated constant
wenzelm@37351
  2099
    @{const_syntax NAME}  -- syntax representation of any of the above
wenzelm@37351
  2100
wenzelm@37351
  2101
* Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
wenzelm@37351
  2102
syntax constant (cf. 'syntax' command).
wenzelm@37351
  2103
wenzelm@37351
  2104
* Antiquotation @{make_string} inlines a function to print arbitrary
wenzelm@37351
  2105
values similar to the ML toplevel.  The result is compiler dependent
wenzelm@37351
  2106
and may fall back on "?" in certain situations.
wenzelm@37351
  2107
wenzelm@37351
  2108
* Diagnostic commands 'ML_val' and 'ML_command' may refer to
wenzelm@37351
  2109
antiquotations @{Isar.state} and @{Isar.goal}.  This replaces impure
wenzelm@37351
  2110
Isar.state() and Isar.goal(), which belong to the old TTY loop and do
wenzelm@37351
  2111
not work with the asynchronous Isar document model.
wenzelm@37351
  2112
wenzelm@37351
  2113
* Configuration options now admit dynamic default values, depending on
wenzelm@37351
  2114
the context or even global references.
wenzelm@37351
  2115
wenzelm@37351
  2116
* SHA1.digest digests strings according to SHA-1 (see RFC 3174).  It
wenzelm@37351
  2117
uses an efficient external library if available (for Poly/ML).
wenzelm@37351
  2118
wenzelm@37144
  2119
* Renamed some important ML structures, while keeping the old names
wenzelm@37144
  2120
for some time as aliases within the structure Legacy:
wenzelm@37144
  2121
wenzelm@37144
  2122
  OuterKeyword  ~>  Keyword
wenzelm@37144
  2123
  OuterLex      ~>  Token
wenzelm@37144
  2124
  OuterParse    ~>  Parse
wenzelm@37144
  2125
  OuterSyntax   ~>  Outer_Syntax
wenzelm@37216
  2126
  PrintMode     ~>  Print_Mode
wenzelm@37144
  2127
  SpecParse     ~>  Parse_Spec
wenzelm@37216
  2128
  ThyInfo       ~>  Thy_Info
wenzelm@37216
  2129
  ThyLoad       ~>  Thy_Load
wenzelm@37216
  2130
  ThyOutput     ~>  Thy_Output
wenzelm@37145
  2131
  TypeInfer     ~>  Type_Infer
wenzelm@37144
  2132
wenzelm@37144
  2133
Note that "open Legacy" simplifies porting of sources, but forgetting
wenzelm@37144
  2134
to remove it again will complicate porting again in the future.
wenzelm@37144
  2135
wenzelm@37144
  2136
* Most operations that refer to a global context are named
wenzelm@37144
  2137
accordingly, e.g. Simplifier.global_context or
wenzelm@37144
  2138
ProofContext.init_global.  There are some situations where a global
wenzelm@37144
  2139
context actually works, but under normal circumstances one needs to
wenzelm@37144
  2140
pass the proper local context through the code!
wenzelm@37144
  2141
wenzelm@37144
  2142
* Discontinued old TheoryDataFun with its copy/init operation -- data
wenzelm@37144
  2143
needs to be pure.  Functor Theory_Data_PP retains the traditional
wenzelm@37144
  2144
Pretty.pp argument to merge, which is absent in the standard
wenzelm@37144
  2145
Theory_Data version.
wenzelm@36429
  2146
wenzelm@37144
  2147
* Sorts.certify_sort and derived "cert" operations for types and terms
wenzelm@37144
  2148
no longer minimize sorts.  Thus certification at the boundary of the
wenzelm@37144
  2149
inference kernel becomes invariant under addition of class relations,
wenzelm@37144
  2150
which is an important monotonicity principle.  Sorts are now minimized
wenzelm@37144
  2151
in the syntax layer only, at the boundary between the end-user and the
wenzelm@37144
  2152
system.  Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
wenzelm@37144
  2153
explicitly in rare situations.
wenzelm@37144
  2154
wenzelm@35021
  2155
* Renamed old-style Drule.standard to Drule.export_without_context, to
wenzelm@35021
  2156
emphasize that this is in no way a standard operation.
wenzelm@35021
  2157
INCOMPATIBILITY.
wenzelm@35021
  2158
wenzelm@34076
  2159
* Subgoal.FOCUS (and variants): resulting goal state is normalized as
wenzelm@34076
  2160
usual for resolution.  Rare INCOMPATIBILITY.
wenzelm@34076
  2161
wenzelm@35845
  2162
* Renamed varify/unvarify operations to varify_global/unvarify_global
wenzelm@35845
  2163
to emphasize that these only work in a global situation (which is
wenzelm@35845
  2164
quite rare).
wenzelm@35845
  2165
wenzelm@37144
  2166
* Curried take and drop in library.ML; negative length is interpreted
wenzelm@37144
  2167
as infinity (as in chop).  Subtle INCOMPATIBILITY.
wenzelm@36961
  2168
wenzelm@37351
  2169
* Proof terms: type substitutions on proof constants now use canonical
wenzelm@37351
  2170
order of type variables.  INCOMPATIBILITY for tools working with proof
wenzelm@37351
  2171
terms.
wenzelm@37351
  2172
wenzelm@37351
  2173
* Raw axioms/defs may no longer carry sort constraints, and raw defs
wenzelm@37351
  2174
may no longer carry premises.  User-level specifications are
wenzelm@37351
  2175
transformed accordingly by Thm.add_axiom/add_def.
wenzelm@37351
  2176
haftmann@33993
  2177
wenzelm@34238
  2178
*** System ***
wenzelm@34238
  2179
wenzelm@34238
  2180
* Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
wenzelm@34238
  2181
ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions.  Note that
wenzelm@34238
  2182
proof terms are enabled unconditionally in the new HOL-Proofs image.
wenzelm@34238
  2183
wenzelm@34255
  2184
* Discontinued old ISABELLE and ISATOOL environment settings (legacy
wenzelm@34255
  2185
feature since Isabelle2009).  Use ISABELLE_PROCESS and ISABELLE_TOOL,
wenzelm@34255
  2186
respectively.
wenzelm@34255
  2187
wenzelm@36201
  2188
* Old lib/scripts/polyml-platform is superseded by the
wenzelm@36201
  2189
ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
wenzelm@36201
  2190
variant, even on a 64 bit machine.  The following example setting
wenzelm@36201
  2191
prefers 64 bit if available:
wenzelm@36201
  2192
wenzelm@36201
  2193
  ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
wenzelm@36201
  2194
wenzelm@37218
  2195
* The preliminary Isabelle/jEdit application demonstrates the emerging
wenzelm@37218
  2196
Isabelle/Scala layer for advanced prover interaction and integration.
wenzelm@37218
  2197
See src/Tools/jEdit or "isabelle jedit" provided by the properly built
wenzelm@37218
  2198
component.
wenzelm@37218
  2199
wenzelm@37375
  2200
* "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
wenzelm@37375
  2201
and Bluesky TeX fonts.  It provides the usual Isabelle symbols,
wenzelm@37375
  2202
similar to the default assignment of the document preparation system
wenzelm@37375
  2203
(cf. isabellesym.sty).  The Isabelle/Scala class Isabelle_System
wenzelm@37375
  2204
provides some operations for direct access to the font without asking
wenzelm@37375
  2205
the user for manual installation.
wenzelm@37375
  2206
wenzelm@34238
  2207
haftmann@33993
  2208
wenzelm@33842
  2209
New in Isabelle2009-1 (December 2009)
wenzelm@33842
  2210
-------------------------------------
wenzelm@30904
  2211
wenzelm@31547
  2212
*** General ***
wenzelm@31547
  2213
wenzelm@31547
  2214
* Discontinued old form of "escaped symbols" such as \\<forall>.  Only
wenzelm@31547
  2215
one backslash should be used, even in ML sources.
wenzelm@31547
  2216
wenzelm@31547
  2217
haftmann@30951
  2218
*** Pure ***
haftmann@30951
  2219
ballarin@32846
  2220
* Locale interpretation propagates mixins along the locale hierarchy.
ballarin@32846
  2221
The currently only available mixins are the equations used to map
ballarin@32846
  2222
local definitions to terms of the target domain of an interpretation.
ballarin@32846
  2223
wenzelm@33842
  2224
* Reactivated diagnostic command 'print_interps'.  Use "print_interps
wenzelm@33842
  2225
loc" to print all interpretations of locale "loc" in the theory.
wenzelm@33842
  2226
Interpretations in proofs are not shown.
ballarin@32846
  2227
ballarin@32983
  2228
* Thoroughly revised locales tutorial.  New section on conditional
ballarin@32983
  2229
interpretation.
ballarin@32983
  2230
wenzelm@33843
  2231
* On instantiation of classes, remaining undefined class parameters
wenzelm@33843
  2232
are formally declared.  INCOMPATIBILITY.
wenzelm@33843
  2233
haftmann@30951
  2234
wenzelm@33842
  2235
*** Document preparation ***
wenzelm@33842
  2236
wenzelm@33842
  2237
* New generalized style concept for printing terms: @{foo (style) ...}
wenzelm@33842
  2238
instead of @{foo_style style ...}  (old form is still retained for
wenzelm@33842
  2239
backward compatibility).  Styles can be also applied for
wenzelm@33842
  2240
antiquotations prop, term_type and typeof.
haftmann@32891
  2241
haftmann@32891
  2242
haftmann@30930
  2243
*** HOL ***
haftmann@30930
  2244
wenzelm@33842
  2245
* New proof method "smt" for a combination of first-order logic with
wenzelm@33842
  2246
equality, linear and nonlinear (natural/integer/real) arithmetic, and
wenzelm@33842
  2247
fixed-size bitvectors; there is also basic support for higher-order
wenzelm@33842
  2248
features (esp. lambda abstractions).  It is an incomplete decision
wenzelm@33842
  2249
procedure based on external SMT solvers using the oracle mechanism;
wenzelm@33842
  2250
for the SMT solver Z3, this method is proof-producing.  Certificates
wenzelm@33842
  2251
are provided to avoid calling the external solvers solely for
wenzelm@33842
  2252
re-checking proofs.  Due to a remote SMT service there is no need for
wenzelm@33842
  2253
installing SMT solvers locally.  See src/HOL/SMT.
wenzelm@33842
  2254
wenzelm@33842
  2255
* New commands to load and prove verification conditions generated by
wenzelm@33842
  2256
the Boogie program verifier or derived systems (e.g. the Verifying C
wenzelm@33842
  2257
Compiler (VCC) or Spec#).  See src/HOL/Boogie.
wenzelm@33842
  2258
wenzelm@33842
  2259
* New counterexample generator tool 'nitpick' based on the Kodkod
wenzelm@33842
  2260
relational model finder.  See src/HOL/Tools/Nitpick and
wenzelm@33842
  2261
src/HOL/Nitpick_Examples.
wenzelm@33842
  2262
haftmann@33860
  2263
* New commands 'code_pred' and 'values' to invoke the predicate
haftmann@33860
  2264
compiler and to enumerate values of inductive predicates.
haftmann@33860
  2265
haftmann@33860
  2266
* A tabled implementation of the reflexive transitive closure.
haftmann@33860
  2267
haftmann@33860
  2268
* New implementation of quickcheck uses generic code generator;
haftmann@33860
  2269
default generators are provided for all suitable HOL types, records
haftmann@33860
  2270
and datatypes.  Old quickcheck can be re-activated importing theory
haftmann@33860
  2271
Library/SML_Quickcheck.
haftmann@33860
  2272
wenzelm@33843
  2273
* New testing tool Mirabelle for automated proof tools.  Applies
wenzelm@33843
  2274
several tools and tactics like sledgehammer, metis, or quickcheck, to
wenzelm@33843
  2275
every proof step in a theory.  To be used in batch mode via the
wenzelm@33843
  2276
"mirabelle" utility.
wenzelm@33843
  2277
wenzelm@33843
  2278
* New proof method "sos" (sum of squares) for nonlinear real
wenzelm@33843
  2279
arithmetic (originally due to John Harison). It requires theory
wenzelm@33843
  2280
Library/Sum_Of_Squares.  It is not a complete decision procedure but
wenzelm@33843
  2281
works well in practice on quantifier-free real arithmetic with +, -,
wenzelm@33843
  2282
*, ^, =, <= and <, i.e. boolean combinations of equalities and
wenzelm@33843
  2283
inequalities between polynomials.  It makes use of external
wenzelm@33843
  2284
semidefinite programming solvers.  Method "sos" generates a
wenzelm@33843
  2285
certificate that can be pasted into the proof thus avoiding the need
wenzelm@33843
  2286
to call an external tool every time the proof is checked.  See
wenzelm@33843
  2287
src/HOL/Library/Sum_Of_Squares.
wenzelm@33843
  2288
wenzelm@33843
  2289
* New method "linarith" invokes existing linear arithmetic decision
wenzelm@33843
  2290
procedure only.
wenzelm@33843
  2291
wenzelm@33843
  2292
* New command 'atp_minimal' reduces result produced by Sledgehammer.
wenzelm@33843
  2293
wenzelm@33843
  2294
* New Sledgehammer option "Full Types" in Proof General settings menu.
wenzelm@33843
  2295
Causes full type information to be output to the ATPs.  This slows
wenzelm@33843
  2296
ATPs down considerably but eliminates a source of unsound "proofs"
wenzelm@33843
  2297
that fail later.
wenzelm@33843
  2298
wenzelm@33843
  2299
* New method "metisFT": A version of metis that uses full type
wenzelm@33843
  2300
information in order to avoid failures of proof reconstruction.
wenzelm@33843
  2301
wenzelm@33843
  2302
* New evaluator "approximate" approximates an real valued term using
wenzelm@33843
  2303
the same method as the approximation method.
wenzelm@33843
  2304
wenzelm@33843
  2305
* Method "approximate" now supports arithmetic expressions as
wenzelm@33843
  2306
boundaries of intervals and implements interval splitting and Taylor
wenzelm@33843
  2307
series expansion.
wenzelm@33843
  2308
wenzelm@33843
  2309
* ML antiquotation @{code_datatype} inserts definition of a datatype
wenzelm@33843
  2310
generated by the code generator; e.g. see src/HOL/Predicate.thy.
wenzelm@33843
  2311
haftmann@33860
  2312
* New theory SupInf of the supremum and infimum operators for sets of
haftmann@33860
  2313
reals.
haftmann@33860
  2314
haftmann@33860
  2315
* New theory Probability, which contains a development of measure
haftmann@33860
  2316
theory, eventually leading to Lebesgue integration and probability.
haftmann@33860
  2317
haftmann@33860
  2318
* Extended Multivariate Analysis to include derivation and Brouwer's
haftmann@33860
  2319
fixpoint theorem.
wenzelm@33843
  2320
wenzelm@33842
  2321
* Reorganization of number theory, INCOMPATIBILITY:
wenzelm@33873
  2322
  - new number theory development for nat and int, in theories Divides
wenzelm@33873
  2323
    and GCD as well as in new session Number_Theory
wenzelm@33873
  2324
  - some constants and facts now suffixed with _nat and _int
wenzelm@33873
  2325
    accordingly
wenzelm@33873
  2326
  - former session NumberTheory now named Old_Number_Theory, including
wenzelm@33873
  2327
    theories Legacy_GCD and Primes (prefer Number_Theory if possible)
wenzelm@33842
  2328
  - moved theory Pocklington from src/HOL/Library to
wenzelm@33842
  2329
    src/HOL/Old_Number_Theory
haftmann@32479
  2330
wenzelm@33873
  2331
* Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
wenzelm@33873
  2332
lcm of finite and infinite sets. It is shown that they form a complete
haftmann@32600
  2333
lattice.
haftmann@32600
  2334
haftmann@32600
  2335
* Class semiring_div requires superclass no_zero_divisors and proof of
haftmann@32600
  2336
div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
haftmann@32600
  2337
div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
haftmann@32600
  2338
generalized to class semiring_div, subsuming former theorems
haftmann@32600
  2339
zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
haftmann@32600
  2340
zdiv_zmult_zmult2.  div_mult_mult1 is now [simp] by default.
haftmann@32600
  2341
INCOMPATIBILITY.
haftmann@32600
  2342
haftmann@32588
  2343
* Refinements to lattice classes and sets:
haftmann@32064
  2344
  - less default intro/elim rules in locale variant, more default
haftmann@32064
  2345
    intro/elim rules in class variant: more uniformity
wenzelm@33842
  2346
  - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
wenzelm@33842
  2347
    le_inf_iff
wenzelm@33842
  2348
  - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
wenzelm@33842
  2349
    sup_aci)
haftmann@32064
  2350
  - renamed ACI to inf_sup_aci
haftmann@32600
  2351
  - new class "boolean_algebra"
wenzelm@33842
  2352
  - class "complete_lattice" moved to separate theory
haftmann@33860
  2353
    "Complete_Lattice"; corresponding constants (and abbreviations)
wenzelm@33842
  2354
    renamed and with authentic syntax:
haftmann@33860
  2355
    Set.Inf ~>    Complete_Lattice.Inf
haftmann@33860
  2356
    Set.Sup ~>    Complete_Lattice.Sup
haftmann@33860
  2357
    Set.INFI ~>   Complete_Lattice.INFI
haftmann@33860
  2358
    Set.SUPR ~>   Complete_Lattice.SUPR
haftmann@33860
  2359
    Set.Inter ~>  Complete_Lattice.Inter
haftmann@33860
  2360
    Set.Union ~>  Complete_Lattice.Union
haftmann@33860
  2361
    Set.INTER ~>  Complete_Lattice.INTER
haftmann@33860
  2362
    Set.UNION ~>  Complete_Lattice.UNION
haftmann@32600
  2363
  - authentic syntax for
haftmann@32600
  2364
    Set.Pow
haftmann@32600
  2365
    Set.image
haftmann@32588
  2366
  - mere abbreviations:
haftmann@32588
  2367
    Set.empty               (for bot)
haftmann@32588
  2368
    Set.UNIV                (for top)
haftmann@33860
  2369
    Set.inter               (for inf, formerly Set.Int)
haftmann@33860
  2370
    Set.union               (for sup, formerly Set.Un)
haftmann@32588
  2371
    Complete_Lattice.Inter  (for Inf)
haftmann@32588
  2372
    Complete_Lattice.Union  (for Sup)
haftmann@32606
  2373
    Complete_Lattice.INTER  (for INFI)
haftmann@32606
  2374
    Complete_Lattice.UNION  (for SUPR)
haftmann@32600
  2375
  - object-logic definitions as far as appropriate
haftmann@32217
  2376
haftmann@32691
  2377
INCOMPATIBILITY.  Care is required when theorems Int_subset_iff or
wenzelm@33842
  2378
Un_subset_iff are explicitly deleted as default simp rules; then also
wenzelm@33842
  2379
their lattice counterparts le_inf_iff and le_sup_iff have to be
haftmann@32691
  2380
deleted to achieve the desired effect.
haftmann@32064
  2381
wenzelm@33842
  2382
* Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
wenzelm@33842
  2383
rules by default any longer; the same applies to min_max.inf_absorb1
wenzelm@33842
  2384
etc.  INCOMPATIBILITY.
wenzelm@33842
  2385
wenzelm@33842
  2386
* Rules sup_Int_eq and sup_Un_eq are no longer declared as
wenzelm@33842
  2387
pred_set_conv by default.  INCOMPATIBILITY.
wenzelm@33842
  2388
wenzelm@33842
  2389
* Power operations on relations and functions are now one dedicated
haftmann@32706
  2390
constant "compow" with infix syntax "^^".  Power operation on
wenzelm@31547
  2391
multiplicative monoids retains syntax "^" and is now defined generic
wenzelm@31547
  2392
in class power.  INCOMPATIBILITY.
wenzelm@31547
  2393
wenzelm@33842
  2394
* Relation composition "R O S" now has a more standard argument order:
wenzelm@33842
  2395
"R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}".  INCOMPATIBILITY,
wenzelm@33842
  2396
rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
wenzelm@33842
  2397
break, since the O_assoc rule was not rewritten like this.  Fix using
wenzelm@33842
  2398
O_assoc[symmetric].  The same applies to the curried version "R OO S".
wenzelm@32427
  2399
nipkow@33057
  2400
* Function "Inv" is renamed to "inv_into" and function "inv" is now an
wenzelm@33842
  2401
abbreviation for "inv_into UNIV".  Lemmas are renamed accordingly.
nipkow@32988
  2402
INCOMPATIBILITY.
nipkow@32988
  2403
haftmann@33860
  2404
* Most rules produced by inductive and datatype package have mandatory
haftmann@33860
  2405
prefixes.  INCOMPATIBILITY.
nipkow@31790
  2406
wenzelm@33842
  2407
* Changed "DERIV_intros" to a dynamic fact, which can be augmented by
wenzelm@33842
  2408
the attribute of the same name.  Each of the theorems in the list
wenzelm@33842
  2409
DERIV_intros assumes composition with an additional function and
wenzelm@33842
  2410
matches a variable to the derivative, which has to be solved by the
wenzelm@33842
  2411
Simplifier.  Hence (auto intro!: DERIV_intros) computes the derivative
wenzelm@33873
  2412
of most elementary terms.  Former Maclauren.DERIV_tac and
wenzelm@33873
  2413
Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
wenzelm@33873
  2414
INCOMPATIBILITY.
haftmann@33860
  2415
haftmann@33860
  2416
* Code generator attributes follow the usual underscore convention:
haftmann@33860
  2417
    code_unfold     replaces    code unfold
haftmann@33860
  2418
    code_post       replaces    code post
haftmann@33860
  2419
    etc.
haftmann@33860
  2420
  INCOMPATIBILITY.
wenzelm@31900
  2421
krauss@33471
  2422
* Renamed methods:
krauss@33471
  2423
    sizechange -> size_change
krauss@33471
  2424
    induct_scheme -> induction_schema
haftmann@33860
  2425
  INCOMPATIBILITY.
nipkow@33673
  2426
wenzelm@33843
  2427
* Discontinued abbreviation "arbitrary" of constant "undefined".
wenzelm@33843
  2428
INCOMPATIBILITY, use "undefined" directly.
wenzelm@33843
  2429
haftmann@33860
  2430
* Renamed theorems:
haftmann@33860
  2431
    Suc_eq_add_numeral_1 -> Suc_eq_plus1
haftmann@33860
  2432
    Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
haftmann@33860
  2433
    Suc_plus1 -> Suc_eq_plus1
haftmann@33860
  2434
    *anti_sym -> *antisym*
haftmann@33860
  2435
    vector_less_eq_def -> vector_le_def
haftmann@33860
  2436
  INCOMPATIBILITY.
haftmann@33860
  2437
haftmann@33860
  2438
* Added theorem List.map_map as [simp].  Removed List.map_compose.
haftmann@33860
  2439
INCOMPATIBILITY.
haftmann@33860
  2440
haftmann@33860
  2441
* Removed predicate "M hassize n" (<--> card M = n & finite M).
haftmann@33860
  2442
INCOMPATIBILITY.
haftmann@33860
  2443
hoelzl@31812
  2444
huffman@33825
  2445
*** HOLCF ***
huffman@33825
  2446
wenzelm@33842
  2447
* Theory Representable defines a class "rep" of domains that are
wenzelm@33842
  2448
representable (via an ep-pair) in the universal domain type "udom".
huffman@33825
  2449
Instances are provided for all type constructors defined in HOLCF.
huffman@33825
  2450
huffman@33825
  2451
* The 'new_domain' command is a purely definitional version of the
huffman@33825
  2452
domain package, for representable domains.  Syntax is identical to the
huffman@33825
  2453
old domain package.  The 'new_domain' package also supports indirect
huffman@33825
  2454
recursion using previously-defined type constructors.  See
wenzelm@33842
  2455
src/HOLCF/ex/New_Domain.thy for examples.
wenzelm@33842
  2456
wenzelm@33842
  2457
* Method "fixrec_simp" unfolds one step of a fixrec-defined constant
huffman@33825
  2458
on the left-hand side of an equation, and then performs
huffman@33825
  2459
simplification.  Rewriting is done using rules declared with the
wenzelm@33842
  2460
"fixrec_simp" attribute.  The "fixrec_simp" method is intended as a
wenzelm@33842
  2461
replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
huffman@33825
  2462
huffman@33825
  2463
* The pattern-match compiler in 'fixrec' can now handle constructors
huffman@33825
  2464
with HOL function types.  Pattern-match combinators for the Pair
huffman@33825
  2465
constructor are pre-configured.
huffman@33825
  2466
huffman@33825
  2467
* The 'fixrec' package now produces better fixed-point induction rules
huffman@33825
  2468
for mutually-recursive definitions:  Induction rules have conclusions
huffman@33825
  2469
of the form "P foo bar" instead of "P <foo, bar>".
huffman@33825
  2470
huffman@33825
  2471
* The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
huffman@33825
  2472
been renamed to "below".  The name "below" now replaces "less" in many
wenzelm@33842
  2473
theorem names.  (Legacy theorem names using "less" are still supported
wenzelm@33842
  2474
as well.)
huffman@33825
  2475
huffman@33825
  2476
* The 'fixrec' package now supports "bottom patterns".  Bottom
huffman@33825
  2477
patterns can be used to generate strictness rules, or to make
huffman@33825
  2478
functions more strict (much like the bang-patterns supported by the
wenzelm@33873
  2479
Glasgow Haskell Compiler).  See src/HOLCF/ex/Fixrec_ex.thy for
wenzelm@33873
  2480
examples.
huffman@33825
  2481
huffman@33825
  2482
wenzelm@31304
  2483
*** ML ***
wenzelm@31304
  2484
wenzelm@33843
  2485
* Support for Poly/ML 5.3.0, with improved reporting of compiler
wenzelm@33843
  2486
errors and run-time exceptions, including detailed source positions.
wenzelm@33843
  2487
wenzelm@33843
  2488
* Structure Name_Space (formerly NameSpace) now manages uniquely
wenzelm@33843
  2489
identified entries, with some additional information such as source
wenzelm@33843
  2490
position, logical grouping etc.
wenzelm@33843
  2491
wenzelm@33524
  2492
* Theory and context data is now introduced by the simplified and
wenzelm@33524
  2493
modernized functors Theory_Data, Proof_Data, Generic_Data.  Data needs
wenzelm@33524
  2494
to be pure, but the old TheoryDataFun for mutable data (with explicit
wenzelm@33524
  2495
copy operation) is still available for some time.
wenzelm@33524
  2496
wenzelm@32742
  2497
* Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
wenzelm@32742
  2498
provides a high-level programming interface to synchronized state
wenzelm@32742
  2499
variables with atomic update.  This works via pure function
wenzelm@32742
  2500
application within a critical section -- its runtime should be as
wenzelm@32742
  2501
short as possible; beware of deadlocks if critical code is nested,
wenzelm@32742
  2502
either directly or indirectly via other synchronized variables!
wenzelm@32742
  2503
wenzelm@32742
  2504
* Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
wenzelm@32742
  2505
wraps raw ML references, explicitly indicating their non-thread-safe
wenzelm@32742
  2506
behaviour.  The Isar toplevel keeps this structure open, to
wenzelm@32742
  2507
accommodate Proof General as well as quick and dirty interactive
wenzelm@32742
  2508
experiments with references.
wenzelm@32742
  2509
wenzelm@32365
  2510
* PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
wenzelm@32365
  2511
parallel tactical reasoning.
wenzelm@32365
  2512
wenzelm@32427
  2513
* Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
wenzelm@32427
  2514
are similar to SUBPROOF, but are slightly more flexible: only the
wenzelm@32427
  2515
specified parts of the subgoal are imported into the context, and the
wenzelm@32427
  2516
body tactic may introduce new subgoals and schematic variables.
wenzelm@32427
  2517
wenzelm@32427
  2518
* Old tactical METAHYPS, which does not observe the proof context, has
wenzelm@32427
  2519
been renamed to Old_Goals.METAHYPS and awaits deletion.  Use SUBPROOF
wenzelm@32427
  2520
or Subgoal.FOCUS etc.
wenzelm@32216
  2521
wenzelm@31971
  2522
* Renamed functor TableFun to Table, and GraphFun to Graph.  (Since
wenzelm@31971
  2523
functors have their own ML name space there is no point to mark them
wenzelm@31971
  2524
separately.)  Minor INCOMPATIBILITY.
wenzelm@31971
  2525
wenzelm@31901
  2526
* Renamed NamedThmsFun to Named_Thms.  INCOMPATIBILITY.
wenzelm@31901
  2527
wenzelm@33842
  2528
* Renamed several structures FooBar to Foo_Bar.  Occasional,
wenzelm@33842
  2529
INCOMPATIBILITY.
wenzelm@33842
  2530
wenzelm@33843
  2531
* Operations of structure Skip_Proof no longer require quick_and_dirty
wenzelm@33843
  2532
mode, which avoids critical setmp.
wenzelm@33843
  2533
wenzelm@31306
  2534
* Eliminated old Attrib.add_attributes, Method.add_methods and related
wenzelm@33842
  2535
combinators for "args".  INCOMPATIBILITY, need to use simplified
wenzelm@31306
  2536
Attrib/Method.setup introduced in Isabelle2009.
wenzelm@31304
  2537
wenzelm@32151
  2538
* Proper context for simpset_of, claset_of, clasimpset_of.  May fall
wenzelm@32151
  2539
back on global_simpset_of, global_claset_of, global_clasimpset_of as
wenzelm@32151
  2540
last resort.  INCOMPATIBILITY.
wenzelm@32151
  2541
wenzelm@32092
  2542
* Display.pretty_thm now requires a proper context (cf. former
wenzelm@32092
  2543
ProofContext.pretty_thm).  May fall back on Display.pretty_thm_global
wenzelm@32092
  2544
or even Display.pretty_thm_without_context as last resort.
wenzelm@32092
  2545
INCOMPATIBILITY.
wenzelm@32092
  2546
wenzelm@32433
  2547
* Discontinued Display.pretty_ctyp/cterm etc.  INCOMPATIBILITY, use
wenzelm@32433
  2548
Syntax.pretty_typ/term directly, preferably with proper context
wenzelm@32433
  2549
instead of global theory.
wenzelm@32433
  2550
wenzelm@31304
  2551
wenzelm@31308
  2552
*** System ***
wenzelm@31308
  2553
wenzelm@33842
  2554
* Further fine tuning of parallel proof checking, scales up to 8 cores
wenzelm@33842
  2555
(max. speedup factor 5.0).  See also Goal.parallel_proofs in ML and
wenzelm@33842
  2556
usedir option -q.
wenzelm@33842
  2557
wenzelm@32326
  2558
* Support for additional "Isabelle components" via etc/components, see
wenzelm@32326
  2559
also the system manual.
wenzelm@32326
  2560
wenzelm@32326
  2561
* The isabelle makeall tool now operates on all components with
wenzelm@32326
  2562
IsaMakefile, not just hardwired "logics".
wenzelm@32326
  2563
wenzelm@33842
  2564
* Removed "compress" option from isabelle-process and isabelle usedir;
wenzelm@33842
  2565
this is always enabled.
kleing@33818
  2566
wenzelm@31308
  2567
* Discontinued support for Poly/ML 4.x versions.
wenzelm@31308
  2568
wenzelm@33842
  2569
* Isabelle tool "wwwfind" provides web interface for 'find_theorems'
wenzelm@33842
  2570
on a given logic image.  This requires the lighttpd webserver and is
wenzelm@33842
  2571
currently supported on Linux only.
wenzelm@32061
  2572
wenzelm@31308
  2573
wenzelm@31304
  2574
wenzelm@30845
  2575
New in Isabelle2009 (April 2009)
wenzelm@30845
  2576
--------------------------------
haftmann@27104
  2577
wenzelm@27599
  2578
*** General ***
wenzelm@27599
  2579
wenzelm@28504
  2580
* Simplified main Isabelle executables, with less surprises on
wenzelm@28504
  2581
case-insensitive file-systems (such as Mac OS).
wenzelm@28504
  2582
wenzelm@28504
  2583
  - The main Isabelle tool wrapper is now called "isabelle" instead of
wenzelm@28504
  2584
    "isatool."
wenzelm@28504
  2585
wenzelm@28504
  2586
  - The former "isabelle" alias for "isabelle-process" has been
wenzelm@28504
  2587
    removed (should rarely occur to regular users).
wenzelm@28504
  2588
wenzelm@28915
  2589
  - The former "isabelle-interface" and its alias "Isabelle" have been
wenzelm@28915
  2590
    removed (interfaces are now regular Isabelle tools).
wenzelm@28504
  2591
wenzelm@28504
  2592
Within scripts and make files, the Isabelle environment variables
wenzelm@28504
  2593
ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
wenzelm@28504
  2594
respectively.  (The latter are still available as legacy feature.)
wenzelm@28504
  2595
wenzelm@28915
  2596
The old isabelle-interface wrapper could react in confusing ways if
wenzelm@28915
  2597
the interface was uninstalled or changed otherwise.  Individual
wenzelm@28915
  2598
interface tool configuration is now more explicit, see also the
wenzelm@28915
  2599
Isabelle system manual.  In particular, Proof General is now available
wenzelm@28915
  2600
via "isabelle emacs".
wenzelm@28504
  2601
wenzelm@28504
  2602
INCOMPATIBILITY, need to adapt derivative scripts.  Users may need to
wenzelm@28504
  2603
purge installed copies of Isabelle executables and re-run "isabelle
wenzelm@28504
  2604
install -p ...", or use symlinks.
wenzelm@28504
  2605
wenzelm@28914
  2606
* The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
wenzelm@30845
  2607
old ~/isabelle, which was slightly non-standard and apt to cause
wenzelm@30845
  2608
surprises on case-insensitive file-systems (such as Mac OS).
wenzelm@28914
  2609
wenzelm@28914
  2610
INCOMPATIBILITY, need to move existing ~/isabelle/etc,
wenzelm@28914
  2611
~/isabelle/heaps, ~/isabelle/browser_info to the new place.  Special
wenzelm@28914
  2612
care is required when using older releases of Isabelle.  Note that
wenzelm@28914
  2613
ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
wenzelm@30845
  2614
Isabelle distribution, in order to use the new ~/.isabelle uniformly.
wenzelm@28914
  2615
wenzelm@29161
  2616
* Proofs of fully specified statements are run in parallel on
wenzelm@30845
  2617
multi-core systems.  A speedup factor of 2.5 to 3.2 can be expected on
wenzelm@30845
  2618
a regular 4-core machine, if the initial heap space is made reasonably
wenzelm@30845
  2619
large (cf. Poly/ML option -H).  (Requires Poly/ML 5.2.1 or later.)
wenzelm@30845
  2620
wenzelm@30845
  2621
* The main reference manuals ("isar-ref", "implementation", and
wenzelm@30845
  2622
"system") have been updated and extended.  Formally checked references
wenzelm@30845
  2623
as hyperlinks are now available uniformly.
wenzelm@30845
  2624
wenzelm@30163
  2625
wenzelm@27599
  2626
*** Pure ***
wenzelm@27599
  2627
wenzelm@30845
  2628
* Complete re-implementation of locales.  INCOMPATIBILITY in several
wenzelm@30845
  2629
respects.  The most important changes are listed below.  See the
wenzelm@30845
  2630
Tutorial on Locales ("locales" manual) for details.
ballarin@29253
  2631
ballarin@29253
  2632
- In locale expressions, instantiation replaces renaming.  Parameters
ballarin@29253
  2633
must be declared in a for clause.  To aid compatibility with previous
ballarin@29253
  2634
parameter inheritance, in locale declarations, parameters that are not
ballarin@29253
  2635
'touched' (instantiation position "_" or omitted) are implicitly added
ballarin@29253
  2636
with their syntax at the beginning of the for clause.
ballarin@29253
  2637
ballarin@29253
  2638
- Syntax from abbreviations and definitions in locales is available in
ballarin@29253
  2639
locale expressions and context elements.  The latter is particularly
ballarin@29253
  2640
useful in locale declarations.
ballarin@29253
  2641
ballarin@29253
  2642
- More flexible mechanisms to qualify names generated by locale
ballarin@29253
  2643
expressions.  Qualifiers (prefixes) may be specified in locale
wenzelm@30728
  2644
expressions, and can be marked as mandatory (syntax: "name!:") or
wenzelm@30728
  2645
optional (syntax "name?:").  The default depends for plain "name:"
wenzelm@30728
  2646
depends on the situation where a locale expression is used: in
wenzelm@30728
  2647
commands 'locale' and 'sublocale' prefixes are optional, in
wenzelm@30845
  2648
'interpretation' and 'interpret' prefixes are mandatory.  The old
wenzelm@30728
  2649
implicit qualifiers derived from the parameter names of a locale are
wenzelm@30728
  2650
no longer generated.
wenzelm@30106
  2651
wenzelm@30845
  2652
- Command "sublocale l < e" replaces "interpretation l < e".  The
wenzelm@30106
  2653
instantiation clause in "interpretation" and "interpret" (square
wenzelm@30106
  2654
brackets) is no longer available.  Use locale expressions.
ballarin@29253
  2655
wenzelm@30845
  2656
- When converting proof scripts, mandatory qualifiers in
wenzelm@30728
  2657
'interpretation' and 'interpret' should be retained by default, even
wenzelm@30845
  2658
if this is an INCOMPATIBILITY compared to former behavior.  In the
wenzelm@30845
  2659
worst case, use the "name?:" form for non-mandatory ones.  Qualifiers
wenzelm@30845
  2660
in locale expressions range over a single locale instance only.
wenzelm@30845
  2661
wenzelm@30845
  2662
- Dropped locale element "includes".  This is a major INCOMPATIBILITY.
wenzelm@30845
  2663
In existing theorem specifications replace the includes element by the
wenzelm@30845
  2664
respective context elements of the included locale, omitting those
wenzelm@30845
  2665
that are already present in the theorem specification.  Multiple
wenzelm@30845
  2666
assume elements of a locale should be replaced by a single one
wenzelm@30845
  2667
involving the locale predicate.  In the proof body, declarations (most
wenzelm@30845
  2668
notably theorems) may be regained by interpreting the respective
wenzelm@30845
  2669
locales in the proof context as required (command "interpret").
wenzelm@30845
  2670
wenzelm@30845
  2671
If using "includes" in replacement of a target solely because the
wenzelm@30845
  2672
parameter types in the theorem are not as general as in the target,
wenzelm@30845
  2673
consider declaring a new locale with additional type constraints on
wenzelm@30845
  2674
the parameters (context element "constrains").
wenzelm@30845
  2675
wenzelm@30845
  2676
- Discontinued "locale (open)".  INCOMPATIBILITY.
wenzelm@30845
  2677
wenzelm@30845
  2678
- Locale interpretation commands no longer attempt to simplify goal.
wenzelm@30845
  2679
INCOMPATIBILITY: in rare situations the generated goal differs.  Use
wenzelm@30845
  2680
methods intro_locales and unfold_locales to clarify.
wenzelm@30845
  2681
wenzelm@30845
  2682
- Locale interpretation commands no longer accept interpretation