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