1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in Isabelle2012 (May 2012)
5 ------------------------------
9 * Prover IDE (PIDE) improvements:
11 - more robust Sledgehammer integration (as before the sledgehammer
12 command line needs to be typed into the source buffer)
13 - markup for bound variables
14 - markup for types of term variables (e.g. displayed as tooltips)
15 - support for user-defined Isar commands within the running session
16 - improved support for Unicode outside original 16bit range
17 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
19 * Updated and extended reference manuals ("isar-ref" and
20 "implementation"); reduced remaining material in old "ref" manual.
22 * Rule attributes in local theory declarations (e.g. locale or class)
23 are now statically evaluated: the resulting theorem is stored instead
24 of the original expression. INCOMPATIBILITY in rare situations, where
25 the historic accident of dynamic re-evaluation in interpretations
28 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
29 declaration, and results are standardized before being stored. Thus
30 old-style "standard" after instantiation or composition of facts
31 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
32 indices of schematic variables.
34 * Renamed some inner syntax categories:
40 Minor INCOMPATIBILITY. Note that in practice "num_const" or
41 "num_position" etc. are mainly used instead (which also include
42 position information via constraints).
44 * Simplified configuration options for syntax ambiguity: see
45 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
46 manual. Minor INCOMPATIBILITY.
48 * Forward declaration of outer syntax keywords within the theory
49 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
50 commands to be used in the same theory where defined.
55 * Auxiliary contexts indicate block structure for specifications with
56 additional parameters and assumptions. Such unnamed contexts may be
57 nested within other targets, like 'theory', 'locale', 'class',
58 'instantiation' etc. Results from the local context are generalized
59 accordingly and applied to the enclosing target context. Example:
63 assumes xy: "x = y" and yz: "y = z"
66 lemma my_trans: "x = z" using xy yz by simp
72 The most basic application is to factor-out context elements of
73 several fixes/assumes/shows theorem statements, e.g. see
74 ~~/src/HOL/Isar_Examples/Group_Context.thy
76 Any other local theory specification element works within the "context
77 ... begin ... end" block as well.
79 * Bundled declarations associate attributed fact expressions with a
80 given name in the context. These may be later included in other
81 contexts. This allows to manage context extensions casually, without
82 the logical dependencies of locales and locale interpretation.
84 See commands 'bundle', 'include', 'including' etc. in the isar-ref
87 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
88 tolerant against multiple unifiers, as long as the final result is
89 unique. (As before, rules are composed in canonical right-to-left
90 order to accommodate newly introduced premises.)
92 * Command 'definition' no longer exports the foundational "raw_def"
93 into the user context. Minor INCOMPATIBILITY, may use the regular
94 "def" result with attribute "abs_def" to imitate the old version.
96 * Attribute "abs_def" turns an equation of the form "f x y == t" into
97 "f == %x y. t", which ensures that "simp" or "unfold" steps always
98 expand it. This also works for object-logic equality. (Formerly
99 undocumented feature.)
101 * Discontinued old "prems" fact, which used to refer to the accidental
102 collection of foundational premises in the context (already marked as
103 legacy since Isabelle2011).
105 * Obsolete command 'types' has been discontinued. Use 'type_synonym'
106 instead. INCOMPATIBILITY.
108 * Old code generator for SML and its commands 'code_module',
109 'code_library', 'consts_code', 'types_code' have been discontinued.
110 Use commands of the generic code generator instead. INCOMPATIBILITY.
112 * Redundant attribute "code_inline" has been discontinued. Use
113 "code_unfold" instead. INCOMPATIBILITY.
115 * Dropped attribute "code_unfold_post" in favor of the its dual
116 "code_abbrev", which yields a common pattern in definitions like
118 definition [code_abbrev]: "f = t"
122 * Sort constraints are now propagated in simultaneous statements, just
123 like type constraints. INCOMPATIBILITY in rare situations, where
124 distinct sorts used to be assigned accidentally. For example:
126 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
128 lemma "P (x::'a)" and "Q (y::'a::bar)"
129 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
134 * New tutorial "Programming and Proving in Isabelle/HOL" ("prog-prove").
135 It completely supercedes "A Tutorial Introduction to Structured Isar Proofs",
136 which has been removed. It supercedes "Isabelle/HOL, A Proof Assistant
137 for Higher-Order Logic" as the recommended beginners tutorial
138 but does not cover all of the material of that old tutorial.
140 * Discontinued old Tutorial on Isar ("isar-overview");
142 * Type 'a set is now a proper type constructor (just as before
143 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
144 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
145 sets separate, it is often sufficient to rephrase sets S accidentally
146 used as predicates by "%x. x : S" and predicates P accidentally used
147 as sets by "{x. P x}". Corresponding proofs in a first step should be
148 pruned from any tinkering with former theorems mem_def and Collect_def
151 For developments which deliberately mixed predicates and sets, a
152 planning step is necessary to determine what should become a predicate
153 and what a set. It can be helpful to carry out that step in
154 Isabelle2011-1 before jumping right into the current release.
156 * The representation of numerals has changed. Datatype "num"
157 represents strictly positive binary numerals, along with functions
158 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
159 positive and negated numeric literals, respectively. (See definitions
160 in ~~/src/HOL/Num.thy.) Potential INCOMPATIBILITY, some user theories
161 may require adaptations as follows:
163 - Theorems with number_ring or number_semiring constraints: These
164 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
166 - Theories defining numeric types: Remove number, number_semiring,
167 and number_ring instances. Defer all theorems about numerals until
168 after classes one and semigroup_add have been instantiated.
170 - Numeral-only simp rules: Replace each rule having a "number_of v"
171 pattern with two copies, one for numeral and one for neg_numeral.
173 - Theorems about subclasses of semiring_1 or ring_1: These classes
174 automatically support numerals now, so more simp rules and
175 simprocs may now apply within the proof.
177 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
178 Redefine using other integer operations.
180 * Code generation by default implements sets as container type rather
181 than predicates. INCOMPATIBILITY.
183 * New proof import from HOL Light: Faster, simpler, and more scalable.
184 Requires a proof bundle, which is available as an external component.
185 Discontinued old (and mostly dead) Importer for HOL4 and HOL Light.
188 * New type synonym 'a rel = ('a * 'a) set
190 * More default pred/set conversions on a couple of relation operations
191 and predicates. Added powers of predicate relations. Consolidation
192 of some relation theorems:
194 converse_def ~> converse_unfold
195 rel_comp_def ~> relcomp_unfold
196 symp_def ~> (dropped, use symp_def and sym_def instead)
197 transp_def ~> transp_trans
198 Domain_def ~> Domain_unfold
199 Range_def ~> Domain_converse [symmetric]
201 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
203 See theory "Relation" for examples for making use of pred/set
204 conversions by means of attributes "to_set" and "to_pred".
208 * Renamed facts about the power operation on relations, i.e., relpow
209 to match the constant's name:
211 rel_pow_1 ~> relpow_1
212 rel_pow_0_I ~> relpow_0_I
213 rel_pow_Suc_I ~> relpow_Suc_I
214 rel_pow_Suc_I2 ~> relpow_Suc_I2
215 rel_pow_0_E ~> relpow_0_E
216 rel_pow_Suc_E ~> relpow_Suc_E
217 rel_pow_E ~> relpow_E
218 rel_pow_Suc_D2 ~> relpow_Suc_D2
219 rel_pow_Suc_E2 ~> relpow_Suc_E2
220 rel_pow_Suc_D2' ~> relpow_Suc_D2'
221 rel_pow_E2 ~> relpow_E2
222 rel_pow_add ~> relpow_add
223 rel_pow_commute ~> relpow
224 rel_pow_empty ~> relpow_empty:
225 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
226 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
227 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
228 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
229 rel_pow_fun_conv ~> relpow_fun_conv
230 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
231 rel_pow_finite_bounded ~> relpow_finite_bounded
232 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
233 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
234 single_valued_rel_pow ~> single_valued_relpow
238 * Theory Relation: Consolidated constant name for relation composition
239 and corresponding theorem names:
241 - Renamed constant rel_comp to relcomp.
243 - Dropped abbreviation pred_comp. Use relcompp instead.
247 rel_compI ~> relcompI
248 rel_compEpair ~> relcompEpair
249 rel_compE ~> relcompE
250 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
251 rel_comp_empty1 ~> relcomp_empty1
252 rel_comp_mono ~> relcomp_mono
253 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
254 rel_comp_distrib ~> relcomp_distrib
255 rel_comp_distrib2 ~> relcomp_distrib2
256 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
257 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
258 single_valued_rel_comp ~> single_valued_relcomp
259 rel_comp_def ~> relcomp_unfold
260 converse_rel_comp ~> converse_relcomp
261 pred_compI ~> relcomppI
262 pred_compE ~> relcomppE
263 pred_comp_bot1 ~> relcompp_bot1
264 pred_comp_bot2 ~> relcompp_bot2
265 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
266 pred_comp_mono ~> relcompp_mono
267 pred_comp_distrib ~> relcompp_distrib
268 pred_comp_distrib2 ~> relcompp_distrib2
269 converse_pred_comp ~> converse_relcompp
271 finite_rel_comp ~> finite_relcomp
273 set_rel_comp ~> set_relcomp
277 * Theory Divides: Discontinued redundant theorems about div and mod.
278 INCOMPATIBILITY, use the corresponding generic theorems instead.
280 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
281 zdiv_self ~> div_self
282 zmod_self ~> mod_self
285 zdiv_zmod_equality ~> div_mod_equality2
286 zdiv_zmod_equality2 ~> div_mod_equality
287 zmod_zdiv_trivial ~> mod_div_trivial
288 zdiv_zminus_zminus ~> div_minus_minus
289 zmod_zminus_zminus ~> mod_minus_minus
290 zdiv_zminus2 ~> div_minus_right
291 zmod_zminus2 ~> mod_minus_right
292 zdiv_minus1_right ~> div_minus1_right
293 zmod_minus1_right ~> mod_minus1_right
294 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
295 zmod_zmult1_eq ~> mod_mult_right_eq
296 zpower_zmod ~> power_mod
298 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
299 mod_mult_distrib ~> mult_mod_left
300 mod_mult_distrib2 ~> mult_mod_right
302 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
303 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
305 * Finite_Set.fold now qualified. INCOMPATIBILITY.
307 * Consolidated theorem names concerning fold combinators:
309 inf_INFI_fold_inf ~> inf_INF_fold_inf
310 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
311 INFI_fold_inf ~> INF_fold_inf
312 SUPR_fold_sup ~> SUP_fold_sup
313 union_set ~> union_set_fold
314 minus_set ~> minus_set_fold
315 INFI_set_fold ~> INF_set_fold
316 SUPR_set_fold ~> SUP_set_fold
317 INF_code ~> INF_set_foldr
318 SUP_code ~> SUP_set_foldr
319 foldr.simps ~> foldr.simps (in point-free formulation)
320 foldr_fold_rev ~> foldr_conv_fold
321 foldl_fold ~> foldl_conv_fold
322 foldr_foldr ~> foldr_conv_foldl
323 foldl_foldr ~> foldl_conv_foldr
324 fold_set_remdups ~> fold_set_fold_remdups
325 fold_set ~> fold_set_fold
326 fold1_set ~> fold1_set_fold
330 * Dropped rarely useful theorems concerning fold combinators:
331 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
332 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
333 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
334 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
335 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
336 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
337 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
338 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
339 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
340 unfolding "foldr_conv_fold" and "foldl_conv_fold".
342 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
343 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
344 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
345 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
346 lemmas over fold rather than foldr, or make use of lemmas
347 fold_conv_foldr and fold_rev.
349 * Congruence rules Option.map_cong and Option.bind_cong for recursion
350 through option types.
352 * Concrete syntax for case expressions includes constraints for source
353 positions, and thus produces Prover IDE markup for its bindings.
354 INCOMPATIBILITY for old-style syntax translations that augment the
355 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
358 * Discontinued configuration option "syntax_positions": atomic terms
359 in parse trees are always annotated by position constraints.
361 * New theory HOL/Library/DAList provides an abstract type for
362 association lists with distinct keys.
364 * 'datatype' specifications allow explicit sort constraints.
366 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
367 use theory HOL/Library/Nat_Bijection instead.
369 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
370 trees is now inside a type class context. Names of affected
371 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
372 theories working directly with raw red-black trees, adapt the names as
376 bulkload -> rbt_bulkload
377 del_from_left -> rbt_del_from_left
378 del_from_right -> rbt_del_from_right
383 insertw -> rbt_insert_with
384 insert_with_key -> rbt_insert_with_key
385 map_entry -> rbt_map_entry
388 tree_greater -> rbt_greater
389 tree_less -> rbt_less
390 tree_less_symbol -> rbt_less_symbol
392 union_with -> rbt_union_with
393 union_with_key -> rbt_union_with_key
396 balance_left_sorted -> balance_left_rbt_sorted
397 balance_left_tree_greater -> balance_left_rbt_greater
398 balance_left_tree_less -> balance_left_rbt_less
399 balance_right_sorted -> balance_right_rbt_sorted
400 balance_right_tree_greater -> balance_right_rbt_greater
401 balance_right_tree_less -> balance_right_rbt_less
402 balance_sorted -> balance_rbt_sorted
403 balance_tree_greater -> balance_rbt_greater
404 balance_tree_less -> balance_rbt_less
405 bulkload_is_rbt -> rbt_bulkload_is_rbt
406 combine_sorted -> combine_rbt_sorted
407 combine_tree_greater -> combine_rbt_greater
408 combine_tree_less -> combine_rbt_less
409 delete_in_tree -> rbt_delete_in_tree
410 delete_is_rbt -> rbt_delete_is_rbt
411 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
412 del_from_left_tree_less -> rbt_del_from_left_rbt_less
413 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
414 del_from_right_tree_less -> rbt_del_from_right_rbt_less
415 del_in_tree -> rbt_del_in_tree
416 del_inv1_inv2 -> rbt_del_inv1_inv2
417 del_sorted -> rbt_del_rbt_sorted
418 del_tree_greater -> rbt_del_rbt_greater
419 del_tree_less -> rbt_del_rbt_less
420 dom_lookup_Branch -> dom_rbt_lookup_Branch
421 entries_lookup -> entries_rbt_lookup
422 finite_dom_lookup -> finite_dom_rbt_lookup
423 insert_sorted -> rbt_insert_rbt_sorted
424 insertw_is_rbt -> rbt_insertw_is_rbt
425 insertwk_is_rbt -> rbt_insertwk_is_rbt
426 insertwk_sorted -> rbt_insertwk_rbt_sorted
427 insertw_sorted -> rbt_insertw_rbt_sorted
428 ins_sorted -> ins_rbt_sorted
429 ins_tree_greater -> ins_rbt_greater
430 ins_tree_less -> ins_rbt_less
431 is_rbt_sorted -> is_rbt_rbt_sorted
432 lookup_balance -> rbt_lookup_balance
433 lookup_bulkload -> rbt_lookup_rbt_bulkload
434 lookup_delete -> rbt_lookup_rbt_delete
435 lookup_Empty -> rbt_lookup_Empty
436 lookup_from_in_tree -> rbt_lookup_from_in_tree
437 lookup_in_tree -> rbt_lookup_in_tree
438 lookup_ins -> rbt_lookup_ins
439 lookup_insert -> rbt_lookup_rbt_insert
440 lookup_insertw -> rbt_lookup_rbt_insertw
441 lookup_insertwk -> rbt_lookup_rbt_insertwk
442 lookup_keys -> rbt_lookup_keys
443 lookup_map -> rbt_lookup_map
444 lookup_map_entry -> rbt_lookup_rbt_map_entry
445 lookup_tree_greater -> rbt_lookup_rbt_greater
446 lookup_tree_less -> rbt_lookup_rbt_less
447 lookup_union -> rbt_lookup_rbt_union
448 map_entry_color_of -> rbt_map_entry_color_of
449 map_entry_inv1 -> rbt_map_entry_inv1
450 map_entry_inv2 -> rbt_map_entry_inv2
451 map_entry_is_rbt -> rbt_map_entry_is_rbt
452 map_entry_sorted -> rbt_map_entry_rbt_sorted
453 map_entry_tree_greater -> rbt_map_entry_rbt_greater
454 map_entry_tree_less -> rbt_map_entry_rbt_less
455 map_tree_greater -> map_rbt_greater
456 map_tree_less -> map_rbt_less
457 map_sorted -> map_rbt_sorted
458 paint_sorted -> paint_rbt_sorted
459 paint_lookup -> paint_rbt_lookup
460 paint_tree_greater -> paint_rbt_greater
461 paint_tree_less -> paint_rbt_less
462 sorted_entries -> rbt_sorted_entries
463 tree_greater_eq_trans -> rbt_greater_eq_trans
464 tree_greater_nit -> rbt_greater_nit
465 tree_greater_prop -> rbt_greater_prop
466 tree_greater_simps -> rbt_greater_simps
467 tree_greater_trans -> rbt_greater_trans
468 tree_less_eq_trans -> rbt_less_eq_trans
469 tree_less_nit -> rbt_less_nit
470 tree_less_prop -> rbt_less_prop
471 tree_less_simps -> rbt_less_simps
472 tree_less_trans -> rbt_less_trans
473 tree_ord_props -> rbt_ord_props
474 union_Branch -> rbt_union_Branch
475 union_is_rbt -> rbt_union_is_rbt
476 unionw_is_rbt -> rbt_unionw_is_rbt
477 unionwk_is_rbt -> rbt_unionwk_is_rbt
478 unionwk_sorted -> rbt_unionwk_rbt_sorted
480 * Theory HOL/Library/Float: Floating point numbers are now defined as a
481 subset of the real numbers. All operations are defined using the
482 lifing-framework and proofs use the transfer method.
490 round_down -> float_round_down
491 round_up -> float_round_up
495 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
498 abs_float_def -> Float.compute_float_abs
499 bitlen_ge0 -> bitlen_nonneg
500 bitlen.simps -> Float.compute_bitlen
501 float_components -> Float_mantissa_exponent
502 float_divl.simps -> Float.compute_float_divl
503 float_divr.simps -> Float.compute_float_divr
504 float_eq_odd -> mult_powr_eq_mult_powr_iff
505 float_power -> real_of_float_power
506 lapprox_posrat_def -> Float.compute_lapprox_posrat
507 lapprox_rat.simps -> Float.compute_lapprox_rat
508 le_float_def' -> Float.compute_float_le
509 le_float_def -> less_eq_float.rep_eq
510 less_float_def' -> Float.compute_float_less
511 less_float_def -> less_float.rep_eq
512 normfloat_def -> Float.compute_normfloat
513 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
514 normfloat -> normfloat_def
515 normfloat_unique -> use normfloat_def
516 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
517 one_float_def -> Float.compute_float_one
518 plus_float_def -> Float.compute_float_plus
519 rapprox_posrat_def -> Float.compute_rapprox_posrat
520 rapprox_rat.simps -> Float.compute_rapprox_rat
521 real_of_float_0 -> zero_float.rep_eq
522 real_of_float_1 -> one_float.rep_eq
523 real_of_float_abs -> abs_float.rep_eq
524 real_of_float_add -> plus_float.rep_eq
525 real_of_float_minus -> uminus_float.rep_eq
526 real_of_float_mult -> times_float.rep_eq
527 real_of_float_simp -> Float.rep_eq
528 real_of_float_sub -> minus_float.rep_eq
529 round_down.simps -> Float.compute_float_round_down
530 round_up.simps -> Float.compute_float_round_up
531 times_float_def -> Float.compute_float_times
532 uminus_float_def -> Float.compute_float_uminus
533 zero_float_def -> Float.compute_float_zero
535 Lemmas not necessary anymore, use the transfer method:
536 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
537 float_divr, float_le_simp, float_less1_mantissa_bound,
538 float_less_simp, float_less_zero, float_le_zero,
539 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
540 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
541 lapprox_rat_bottom, normalized_float, rapprox_posrat,
542 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
543 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
544 round_up, zero_le_float, zero_less_float
546 * Session HOL-Word: Discontinued many redundant theorems specific to
547 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
550 word_sub_alt ~> word_sub_wi
551 word_add_alt ~> word_add_def
552 word_mult_alt ~> word_mult_def
553 word_minus_alt ~> word_minus_def
554 word_0_alt ~> word_0_wi
555 word_1_alt ~> word_1_wi
556 word_add_0 ~> add_0_left
557 word_add_0_right ~> add_0_right
558 word_mult_1 ~> mult_1_left
559 word_mult_1_right ~> mult_1_right
560 word_add_commute ~> add_commute
561 word_add_assoc ~> add_assoc
562 word_add_left_commute ~> add_left_commute
563 word_mult_commute ~> mult_commute
564 word_mult_assoc ~> mult_assoc
565 word_mult_left_commute ~> mult_left_commute
566 word_left_distrib ~> left_distrib
567 word_right_distrib ~> right_distrib
568 word_left_minus ~> left_minus
569 word_diff_0_right ~> diff_0_right
570 word_diff_self ~> diff_self
571 word_sub_def ~> diff_minus
572 word_diff_minus ~> diff_minus
573 word_add_ac ~> add_ac
574 word_mult_ac ~> mult_ac
575 word_plus_ac0 ~> add_0_left add_0_right add_ac
576 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
577 word_order_trans ~> order_trans
578 word_order_refl ~> order_refl
579 word_order_antisym ~> order_antisym
580 word_order_linear ~> linorder_linear
581 lenw1_zero_neq_one ~> zero_neq_one
582 word_number_of_eq ~> number_of_eq
583 word_of_int_add_hom ~> wi_hom_add
584 word_of_int_sub_hom ~> wi_hom_sub
585 word_of_int_mult_hom ~> wi_hom_mult
586 word_of_int_minus_hom ~> wi_hom_neg
587 word_of_int_succ_hom ~> wi_hom_succ
588 word_of_int_pred_hom ~> wi_hom_pred
589 word_of_int_0_hom ~> word_0_wi
590 word_of_int_1_hom ~> word_1_wi
592 * New tactic "word_bitwise" for splitting machine word equalities and
593 inequalities into logical circuits. Requires theory "WordBitwise" from HOL-Word
594 session. Supports addition, subtraction, multiplication, shifting by
595 constants, bitwise operators and numeric constants. Requires fixed-length word
596 types, cannot operate on 'a word. Solves many standard word identies outright
597 and converts more into first order problems amenable to blast or similar. See
598 HOL/Word/WordBitwise.thy and examples in HOL/Word/Examples/WordExamples.thy.
600 * Clarified attribute "mono_set": pure declaration without modifying
601 the result of the fact expression.
603 * "Transitive_Closure.ntrancl": bounded transitive closure on
606 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
608 * Theory Int: Discontinued many legacy theorems specific to type int.
609 INCOMPATIBILITY, use the corresponding generic theorems instead.
611 zminus_zminus ~> minus_minus
612 zminus_0 ~> minus_zero
613 zminus_zadd_distrib ~> minus_add_distrib
614 zadd_commute ~> add_commute
615 zadd_assoc ~> add_assoc
616 zadd_left_commute ~> add_left_commute
620 zadd_0_right ~> add_0_right
621 zadd_zminus_inverse2 ~> left_minus
622 zmult_zminus ~> mult_minus_left
623 zmult_commute ~> mult_commute
624 zmult_assoc ~> mult_assoc
625 zadd_zmult_distrib ~> left_distrib
626 zadd_zmult_distrib2 ~> right_distrib
627 zdiff_zmult_distrib ~> left_diff_distrib
628 zdiff_zmult_distrib2 ~> right_diff_distrib
629 zmult_1 ~> mult_1_left
630 zmult_1_right ~> mult_1_right
631 zle_refl ~> order_refl
632 zle_trans ~> order_trans
633 zle_antisym ~> order_antisym
634 zle_linear ~> linorder_linear
635 zless_linear ~> linorder_less_linear
636 zadd_left_mono ~> add_left_mono
637 zadd_strict_right_mono ~> add_strict_right_mono
638 zadd_zless_mono ~> add_less_le_mono
639 int_0_less_1 ~> zero_less_one
640 int_0_neq_1 ~> zero_neq_one
642 zpower_zadd_distrib ~> power_add
643 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
644 zero_le_zpower_abs ~> zero_le_power_abs
646 * Theory Deriv: Renamed
648 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
650 * Theory Library/Multiset: Improved code generation of multisets.
652 * Session HOL-Probability: Introduced the type "'a measure" to represent
653 measures, this replaces the records 'a algebra and 'a measure_space. The
654 locales based on subset_class now have two locale-parameters the space
655 \<Omega> and the set of measurables sets M. The product of probability spaces
656 uses now the same constant as the finite product of sigma-finite measure
657 spaces "PiM :: ('i => 'a) measure". Most constants are defined now
658 outside of locales and gain an additional parameter, like null_sets,
659 almost_eventually or \<mu>'. Measure space constructions for distributions
660 and densities now got their own constants distr and density. Instead of
661 using locales to describe measure spaces with a finite space, the
662 measure count_space and point_measure is introduced. INCOMPATIBILITY.
666 finite_measure.\<mu>' -> measure
667 product_algebra_generator -> prod_algebra
668 product_prob_space.emb -> prod_emb
669 product_prob_space.infprod_algebra -> PiM
672 completeable_measure_space
675 finite_product_finite_prob_space
676 finite_product_sigma_algebra
679 pair_finite_prob_space
680 pair_finite_sigma_algebra
683 product_sigma_algebra
686 distribution -> use distr measure, or distributed predicate
687 joint_distribution -> use distr measure, or distributed predicate
688 product_prob_space.infprod_algebra -> use PiM
692 pair_measure_generator
694 Replacement theorems:
695 sigma_algebra.measurable_sigma -> measurable_measure_of
696 measure_space.additive -> emeasure_additive
697 measure_space.measure_additive -> plus_emeasure
698 measure_space.measure_mono -> emeasure_mono
699 measure_space.measure_top -> emeasure_space
700 measure_space.measure_compl -> emeasure_compl
701 measure_space.measure_Diff -> emeasure_Diff
702 measure_space.measure_countable_increasing -> emeasure_countable_increasing
703 measure_space.continuity_from_below -> SUP_emeasure_incseq
704 measure_space.measure_incseq -> incseq_emeasure
705 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
706 measure_space.measure_decseq -> decseq_emeasure
707 measure_space.continuity_from_above -> INF_emeasure_decseq
708 measure_space.measure_insert -> emeasure_insert
709 measure_space.measure_setsum -> setsum_emeasure
710 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
711 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
712 measure_space.measure_setsum_split -> setsum_emeasure_cover
713 measure_space.measure_subadditive -> subadditive
714 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
715 measure_space.measure_eq_0 -> emeasure_eq_0
716 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
717 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
718 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
719 measure_unique_Int_stable -> measure_eqI_generator_eq
720 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
721 measure_space.measure_Un_null_set -> emeasure_Un_null_set
722 measure_space.almost_everywhere_def -> eventually_ae_filter
723 measure_space.almost_everywhere_vimage -> AE_distrD
724 measure_space.measure_space_vimage -> emeasure_distr
725 measure_space.AE_iff_null_set -> AE_iff_null
726 measure_space.real_measure_Union -> measure_Union
727 measure_space.real_measure_finite_Union -> measure_finite_Union
728 measure_space.real_measure_Diff -> measure_Diff
729 measure_space.real_measure_UNION -> measure_UNION
730 measure_space.real_measure_subadditive -> measure_subadditive
731 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
732 measure_space.real_continuity_from_below -> Lim_measure_incseq
733 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
734 measure_space.real_continuity_from_above -> Lim_measure_decseq
735 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
736 finite_measure.finite_measure -> finite_measure.emeasure_finite
737 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
738 finite_measure.positive_measure' -> measure_nonneg
739 finite_measure.real_measure -> finite_measure.emeasure_real
740 finite_measure.empty_measure -> measure_empty
741 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
742 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
743 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
744 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
745 measure_space.simple_integral_vimage -> simple_integral_distr
746 measure_space.integrable_vimage -> integrable_distr
747 measure_space.positive_integral_translated_density -> positive_integral_density
748 measure_space.integral_translated_density -> integral_density
749 measure_space.integral_vimage -> integral_distr
750 measure_space_density -> emeasure_density
751 measure_space.positive_integral_vimage -> positive_integral_distr
752 measure_space.simple_function_vimage -> simple_function_comp
753 measure_space.simple_integral_vimage -> simple_integral_distr
754 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
755 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
756 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
757 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
758 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
759 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
760 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
761 measure_space.measure_not_negative -> emeasure_not_MInf
762 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
763 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
764 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
765 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
766 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
767 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
768 pair_sigma_algebra.sets_swap -> sets_pair_swap
769 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
770 Int_stable_product_algebra_generator -> positive_integral
771 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
772 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
773 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
774 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
775 product_algebra_generator_der -> prod_algebra_eq_finite
776 product_algebra_generator_into_space -> prod_algebra_sets_into_space
777 product_sigma_algebra.product_algebra_into_space -> space_closed
778 product_algebraE -> prod_algebraE_all
779 product_algebraI -> sets_PiM_I_finite
780 product_measure_exists -> product_sigma_finite.sigma_finite
781 sets_product_algebra -> sets_PiM
782 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
783 space_product_algebra -> space_PiM
784 Int_stable_cuboids -> Int_stable_atLeastAtMost
785 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
786 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
787 prob_space_unique_Int_stable -> measure_eqI_prob_space
788 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
789 prob_space.measure_space_1 -> prob_space.emeasure_space_1
790 prob_space.prob_space_vimage -> prob_space_distr
791 prob_space.random_variable_restrict -> measurable_restrict
792 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
793 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
794 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
795 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
796 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
797 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
798 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
799 product_prob_space.measurable_component -> measurable_component_singleton
800 product_prob_space.measurable_emb -> measurable_prod_emb
801 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
802 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
803 product_prob_space.measure_emb -> emeasure_prod_emb
804 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
805 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
806 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
807 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
808 conditional_entropy_positive -> conditional_entropy_nonneg_simple
809 conditional_entropy_eq -> conditional_entropy_simple_distributed
810 conditional_mutual_information_eq_mutual_information -> conditional_mutual_information_eq_mutual_information_simple
811 conditional_mutual_information_generic_positive -> conditional_mutual_information_nonneg_simple
812 conditional_mutual_information_positive -> conditional_mutual_information_nonneg_simple
813 entropy_commute -> entropy_commute_simple
814 entropy_eq -> entropy_simple_distributed
815 entropy_generic_eq -> entropy_simple_distributed
816 entropy_positive -> entropy_nonneg_simple
817 entropy_uniform_max -> entropy_uniform
818 KL_eq_0 -> KL_same_eq_0
819 KL_eq_0_imp -> KL_eq_0_iff_eq
821 mutual_information_eq -> mutual_information_simple_distributed
822 mutual_information_positive -> mutual_information_nonneg_simple
824 * New "case_product" attribute to generate a case rule doing multiple
825 case distinctions at the same time. E.g.
827 list.exhaust [case_product nat.exhaust]
829 produces a rule which can be used to perform case distinction on both
832 * New Transfer package:
834 - transfer_rule attribute: Maintains a collection of transfer rules,
835 which relate constants at two different types. Transfer rules may
836 relate different type instances of the same polymorphic constant,
837 or they may relate an operation on a raw type to a corresponding
838 operation on an abstract type (quotient or subtype). For example:
840 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
841 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
843 - transfer method: Replaces a subgoal on abstract types with an
844 equivalent subgoal on the corresponding raw types. Constants are
845 replaced with corresponding ones according to the transfer rules.
846 Goals are generalized over all free variables by default; this is
847 necessary for variables whose types changes, but can be overridden
848 for specific variables with e.g. 'transfer fixing: x y z'.
849 The variant transfer' method allows replacing a subgoal with
850 one that is logically stronger (rather than equivalent).
852 - relator_eq attribute: Collects identity laws for relators of
853 various type constructors, e.g. "list_all2 (op =) = (op =)". The
854 transfer method uses these lemmas to infer transfer rules for
855 non-polymorphic constants on the fly.
857 - transfer_prover method: Assists with proving a transfer rule for a
858 new constant, provided the constant is defined in terms of other
859 constants that already have transfer rules. It should be applied
860 after unfolding the constant definitions.
862 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
863 from type nat to type int.
865 * New Lifting package:
867 - lift_definition command: Defines operations on an abstract type in
868 terms of a corresponding operation on a representation type. Example
871 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
874 Users must discharge a respectfulness proof obligation when each
875 constant is defined. (For a type copy, i.e. a typedef with UNIV,
876 the proof is discharged automatically.) The obligation is
877 presented in a user-friendly, readable form; a respectfulness
878 theorem in the standard format and a transfer rule are generated
881 - Integration with code_abstype: For typedefs (e.g. subtypes
882 corresponding to a datatype invariant, such as dlist),
883 lift_definition generates a code certificate theorem and sets up
884 code generation for each constant.
886 - setup_lifting command: Sets up the Lifting package to work with
887 a user-defined type. The user must provide either a quotient
888 theorem or a type_definition theorem. The package configures
889 transfer rules for equality and quantifiers on the type, and sets
890 up the lift_definition command to work with the type.
892 - Usage examples: See Quotient_Examples/Lift_DList.thy,
893 Quotient_Examples/Lift_RBT.thy, Word/Word.thy and
898 - The 'quotient_type' command now supports a 'morphisms' option with
899 rep and abs functions, similar to typedef.
901 - 'quotient_type' sets up new types to work with the Lifting and
902 Transfer packages, as with 'setup_lifting'.
904 - The 'quotient_definition' command now requires the user to prove a
905 respectfulness property at the point where the constant is
906 defined, similar to lift_definition; INCOMPATIBILITY.
908 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
909 accordingly, INCOMPATIBILITY.
911 * New diagnostic command 'find_unused_assms' to find potentially
912 superfluous assumptions in theorems using Quickcheck.
916 - Quickcheck returns variable assignments as counterexamples, which
917 allows to reveal the underspecification of functions under test.
918 For example, refuting "hd xs = x", it presents the variable
919 assignment xs = [] and x = a1 as a counterexample, assuming that
920 any property is false whenever "hd []" occurs in it.
922 These counterexample are marked as potentially spurious, as
923 Quickcheck also returns "xs = []" as a counterexample to the
924 obvious theorem "hd xs = hd xs".
926 After finding a potentially spurious counterexample, Quickcheck
927 continues searching for genuine ones.
929 By default, Quickcheck shows potentially spurious and genuine
930 counterexamples. The option "genuine_only" sets quickcheck to only
931 show genuine counterexamples.
933 - The command 'quickcheck_generator' creates random and exhaustive
934 value generators for a given type and operations.
936 It generates values by using the operations as if they were
937 constructors of that type.
939 - Support for multisets.
941 - Added "use_subtype" options.
943 - Added "quickcheck_locale" configuration to specify how to process
944 conjectures in a locale context.
947 - Fixed infinite loop caused by the 'peephole_optim' option and
948 affecting 'rat' and 'real'.
951 - Integrated more tightly with SPASS, as described in the ITP 2012 paper "More
952 SPASS with Isabelle".
953 - Made it try "smt" as a fallback if "metis" fails or times out.
954 - Added support for the following provers: Alt-Ergo (via Why3 and TFF1),
956 - Replaced remote E-SInE with remote Satallax in the default setup.
957 - Sped up the minimizer.
958 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
959 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
960 - Renamed "sound" option to "strict".
963 - Added possibility to specify lambda translations scheme as a
964 parenthesized argument (e.g., "by (metis (lifting) ...)").
967 - Renamed "smt_fixed" option to "smt_read_only_certificates".
970 - Renamed from 'try_methods'. INCOMPATIBILITY.
972 * New "eventually_elim" method as a generalized variant of the
973 eventually_elim* rules. Supports structured proofs.
975 * HOL/TPTP: support to parse and import TPTP problems (all languages)
981 * New "case_product" attribute (see HOL).
986 * Greater support for structured proofs involving induction or case
989 * Much greater use of mathematical symbols.
991 * Removal of many ML theorem bindings. INCOMPATIBILITY.
996 * Antiquotation @{keyword "name"} produces a parser for outer syntax
997 from a minor keyword introduced via theory header declaration.
999 * Antiquotation @{command_spec "name"} produces the
1000 Outer_Syntax.command_spec from a major keyword introduced via theory
1001 header declaration; it can be passed to Outer_Syntax.command etc.
1003 * Local_Theory.define no longer hard-wires default theorem name
1004 "foo_def", but retains the binding as given. If that is Binding.empty
1005 / Attrib.empty_binding, the result is not registered as user-level
1006 fact. The Local_Theory.define_internal variant allows to specify a
1007 non-empty name (used for the foundation in the background theory),
1008 while omitting the fact binding in the user-context. Potential
1009 INCOMPATIBILITY for derived definitional packages: need to specify
1010 naming policy for primitive definitions more explicitly.
1012 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
1013 conformance with similar operations in structure Term and Logic.
1015 * Antiquotation @{attributes [...]} embeds attribute source
1016 representation into the ML text, which is particularly useful with
1017 declarations like Local_Theory.note.
1019 * Structure Proof_Context follows standard naming scheme. Old
1020 ProofContext has been discontinued. INCOMPATIBILITY.
1022 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
1023 change of semantics: update is applied to auxiliary local theory
1026 * Modernized some old-style infix operations:
1028 addeqcongs ~> Simplifier.add_eqcong
1029 deleqcongs ~> Simplifier.del_eqcong
1030 addcongs ~> Simplifier.add_cong
1031 delcongs ~> Simplifier.del_cong
1032 setmksimps ~> Simplifier.set_mksimps
1033 setmkcong ~> Simplifier.set_mkcong
1034 setmksym ~> Simplifier.set_mksym
1035 setmkeqTrue ~> Simplifier.set_mkeqTrue
1036 settermless ~> Simplifier.set_termless
1037 setsubgoaler ~> Simplifier.set_subgoaler
1038 addsplits ~> Splitter.add_split
1039 delsplits ~> Splitter.del_split
1044 * USER_HOME settings variable points to cross-platform user home
1045 directory, which coincides with HOME on POSIX systems only. Likewise,
1046 the Isabelle path specification "~" now expands to $USER_HOME, instead
1047 of former $HOME. A different default for USER_HOME may be set
1048 explicitly in shell environment, before Isabelle settings are
1049 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
1050 the generic user home was intended.
1052 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
1055 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
1056 notation, which is useful for the jEdit file browser, for example.
1060 New in Isabelle2011-1 (October 2011)
1061 ------------------------------------
1065 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
1066 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
1068 - Management of multiple theory files directly from the editor
1069 buffer store -- bypassing the file-system (no requirement to save
1070 files for checking).
1072 - Markup of formal entities within the text buffer, with semantic
1073 highlighting, tooltips and hyperlinks to jump to defining source
1076 - Improved text rendering, with sub/superscripts in the source
1077 buffer (including support for copy/paste wrt. output panel, HTML
1078 theory output and other non-Isabelle text boxes).
1080 - Refined scheduling of proof checking and printing of results,
1081 based on interactive editor view. (Note: jEdit folding and
1082 narrowing allows to restrict buffer perspectives explicitly.)
1084 - Reduced CPU performance requirements, usable on machines with few
1087 - Reduced memory requirements due to pruning of unused document
1088 versions (garbage collection).
1090 See also ~~/src/Tools/jEdit/README.html for further information,
1091 including some remaining limitations.
1093 * Theory loader: source files are exclusively located via the master
1094 directory of each theory node (where the .thy file itself resides).
1095 The global load path (such as src/HOL/Library) has been discontinued.
1096 Note that the path element ~~ may be used to reference theories in the
1097 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
1100 * Theory loader: source files are identified by content via SHA1
1101 digests. Discontinued former path/modtime identification and optional
1102 ISABELLE_FILE_IDENT plugin scripts.
1104 * Parallelization of nested Isar proofs is subject to
1105 Goal.parallel_proofs_threshold (default 100). See also isabelle
1108 * Name space: former unsynchronized references are now proper
1109 configuration options, with more conventional names:
1111 long_names ~> names_long
1112 short_names ~> names_short
1113 unique_names ~> names_unique
1115 Minor INCOMPATIBILITY, need to declare options in context like this:
1117 declare [[names_unique = false]]
1119 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
1120 that the result needs to be unique, which means fact specifications
1121 may have to be refined after enriching a proof context.
1123 * Attribute "case_names" has been refined: the assumptions in each case
1124 can be named now by following the case name with [name1 name2 ...].
1126 * Isabelle/Isar reference manual has been updated and extended:
1127 - "Synopsis" provides a catalog of main Isar language concepts.
1128 - Formal references in syntax diagrams, via @{rail} antiquotation.
1129 - Updated material from classic "ref" manual, notably about
1130 "Classical Reasoner".
1135 * Class bot and top require underlying partial order rather than
1136 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
1138 * Class complete_lattice: generalized a couple of lemmas from sets;
1139 generalized theorems INF_cong and SUP_cong. New type classes for
1140 complete boolean algebras and complete linear orders. Lemmas
1141 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
1142 class complete_linorder.
1144 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
1145 Sup_fun_def, Inf_apply, Sup_apply.
1147 Removed redundant lemmas (the right hand side gives hints how to
1148 replace them for (metis ...), or (simp only: ...) proofs):
1150 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
1151 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
1152 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
1153 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
1154 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
1155 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
1156 Inter_def ~> INF_def, image_def
1157 Union_def ~> SUP_def, image_def
1158 INT_eq ~> INF_def, and image_def
1159 UN_eq ~> SUP_def, and image_def
1160 INF_subset ~> INF_superset_mono [OF _ order_refl]
1162 More consistent and comprehensive names:
1164 INTER_eq_Inter_image ~> INF_def
1165 UNION_eq_Union_image ~> SUP_def
1168 INF_leI ~> INF_lower
1169 INF_leI2 ~> INF_lower2
1170 le_INFI ~> INF_greatest
1171 le_SUPI ~> SUP_upper
1172 le_SUPI2 ~> SUP_upper2
1173 SUP_leI ~> SUP_least
1174 INFI_bool_eq ~> INF_bool_eq
1175 SUPR_bool_eq ~> SUP_bool_eq
1176 INFI_apply ~> INF_apply
1177 SUPR_apply ~> SUP_apply
1178 INTER_def ~> INTER_eq
1179 UNION_def ~> UNION_eq
1183 * Renamed theory Complete_Lattice to Complete_Lattices.
1186 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
1187 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
1188 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
1189 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
1191 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
1192 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
1193 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
1196 * Added syntactic classes "inf" and "sup" for the respective
1197 constants. INCOMPATIBILITY: Changes in the argument order of the
1198 (mostly internal) locale predicates for some derived classes.
1200 * Theorem collections ball_simps and bex_simps do not contain theorems
1201 referring to UNION any longer; these have been moved to collection
1202 UN_ball_bex_simps. INCOMPATIBILITY.
1204 * Theory Archimedean_Field: floor now is defined as parameter of a
1205 separate type class floor_ceiling.
1207 * Theory Finite_Set: more coherent development of fold_set locales:
1209 locale fun_left_comm ~> locale comp_fun_commute
1210 locale fun_left_comm_idem ~> locale comp_fun_idem
1212 Both use point-free characterization; interpretation proofs may need
1213 adjustment. INCOMPATIBILITY.
1215 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
1216 accordance with standard mathematical terminology. INCOMPATIBILITY.
1218 * Theory Complex_Main: The locale interpretations for the
1219 bounded_linear and bounded_bilinear locales have been removed, in
1220 order to reduce the number of duplicate lemmas. Users must use the
1221 original names for distributivity theorems, potential INCOMPATIBILITY.
1223 divide.add ~> add_divide_distrib
1224 divide.diff ~> diff_divide_distrib
1225 divide.setsum ~> setsum_divide_distrib
1226 mult.add_right ~> right_distrib
1227 mult.diff_right ~> right_diff_distrib
1228 mult_right.setsum ~> setsum_right_distrib
1229 mult_left.diff ~> left_diff_distrib
1231 * Theory Complex_Main: Several redundant theorems have been removed or
1232 replaced by more general versions. INCOMPATIBILITY.
1234 real_diff_def ~> minus_real_def
1235 real_divide_def ~> divide_real_def
1236 real_less_def ~> less_le
1237 real_abs_def ~> abs_real_def
1238 real_sgn_def ~> sgn_real_def
1239 real_mult_commute ~> mult_commute
1240 real_mult_assoc ~> mult_assoc
1241 real_mult_1 ~> mult_1_left
1242 real_add_mult_distrib ~> left_distrib
1243 real_zero_not_eq_one ~> zero_neq_one
1244 real_mult_inverse_left ~> left_inverse
1245 INVERSE_ZERO ~> inverse_zero
1246 real_le_refl ~> order_refl
1247 real_le_antisym ~> order_antisym
1248 real_le_trans ~> order_trans
1249 real_le_linear ~> linear
1250 real_le_eq_diff ~> le_iff_diff_le_0
1251 real_add_left_mono ~> add_left_mono
1252 real_mult_order ~> mult_pos_pos
1253 real_mult_less_mono2 ~> mult_strict_left_mono
1254 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
1255 real_0_le_divide_iff ~> zero_le_divide_iff
1256 realpow_two_disj ~> power2_eq_iff
1257 real_squared_diff_one_factored ~> square_diff_one_factored
1258 realpow_two_diff ~> square_diff_square_factored
1259 reals_complete2 ~> complete_real
1260 real_sum_squared_expand ~> power2_sum
1261 exp_ln_eq ~> ln_unique
1263 expi_zero ~> exp_zero
1264 lemma_DERIV_subst ~> DERIV_cong
1265 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
1266 LIMSEQ_const ~> tendsto_const
1267 LIMSEQ_norm ~> tendsto_norm
1268 LIMSEQ_add ~> tendsto_add
1269 LIMSEQ_minus ~> tendsto_minus
1270 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
1271 LIMSEQ_diff ~> tendsto_diff
1272 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
1273 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
1274 LIMSEQ_mult ~> tendsto_mult
1275 LIMSEQ_inverse ~> tendsto_inverse
1276 LIMSEQ_divide ~> tendsto_divide
1277 LIMSEQ_pow ~> tendsto_power
1278 LIMSEQ_setsum ~> tendsto_setsum
1279 LIMSEQ_setprod ~> tendsto_setprod
1280 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
1281 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
1282 LIMSEQ_imp_rabs ~> tendsto_rabs
1283 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
1284 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
1285 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
1286 LIMSEQ_Complex ~> tendsto_Complex
1287 LIM_ident ~> tendsto_ident_at
1288 LIM_const ~> tendsto_const
1289 LIM_add ~> tendsto_add
1290 LIM_add_zero ~> tendsto_add_zero
1291 LIM_minus ~> tendsto_minus
1292 LIM_diff ~> tendsto_diff
1293 LIM_norm ~> tendsto_norm
1294 LIM_norm_zero ~> tendsto_norm_zero
1295 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
1296 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
1297 LIM_rabs ~> tendsto_rabs
1298 LIM_rabs_zero ~> tendsto_rabs_zero
1299 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
1300 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
1301 LIM_compose ~> tendsto_compose
1302 LIM_mult ~> tendsto_mult
1303 LIM_scaleR ~> tendsto_scaleR
1304 LIM_of_real ~> tendsto_of_real
1305 LIM_power ~> tendsto_power
1306 LIM_inverse ~> tendsto_inverse
1307 LIM_sgn ~> tendsto_sgn
1308 isCont_LIM_compose ~> isCont_tendsto_compose
1309 bounded_linear.LIM ~> bounded_linear.tendsto
1310 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
1311 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
1312 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
1313 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
1314 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
1315 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
1317 * Theory Complex_Main: The definition of infinite series was
1318 generalized. Now it is defined on the type class {topological_space,
1319 comm_monoid_add}. Hence it is useable also for extended real numbers.
1321 * Theory Complex_Main: The complex exponential function "expi" is now
1322 a type-constrained abbreviation for "exp :: complex => complex"; thus
1323 several polymorphic lemmas about "exp" are now applicable to "expi".
1327 - Theory Library/Code_Char_ord provides native ordering of
1328 characters in the target language.
1330 - Commands code_module and code_library are legacy, use export_code
1333 - Method "evaluation" is legacy, use method "eval" instead.
1335 - Legacy evaluator "SML" is deactivated by default. May be
1336 reactivated by the following theory command:
1338 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
1340 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
1342 * New proof method "induction" that gives induction hypotheses the
1343 name "IH", thus distinguishing them from further hypotheses that come
1344 from rule induction. The latter are still called "hyps". Method
1345 "induction" is a thin wrapper around "induct" and follows the same
1348 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
1349 still available as a legacy feature for some time.
1352 - Added "need" and "total_consts" options.
1353 - Reintroduced "show_skolems" option by popular demand.
1354 - Renamed attribute: nitpick_def ~> nitpick_unfold.
1358 - Use quasi-sound (and efficient) translations by default.
1359 - Added support for the following provers: E-ToFoF, LEO-II,
1360 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
1361 - Automatically preplay and minimize proofs before showing them if
1362 this can be done within reasonable time.
1363 - sledgehammer available_provers ~> sledgehammer supported_provers.
1365 - Added "preplay_timeout", "slicing", "type_enc", "sound",
1366 "max_mono_iters", and "max_new_mono_instances" options.
1367 - Removed "explicit_apply" and "full_types" options as well as "Full
1368 Types" Proof General menu item. INCOMPATIBILITY.
1371 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
1372 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
1376 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
1377 "elim:" options. INCOMPATIBILITY.
1378 - Introduced 'try' that not only runs 'try_methods' but also
1379 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
1382 - Added "eval" option to evaluate terms for the found counterexample
1383 (currently only supported by the default (exhaustive) tester).
1384 - Added post-processing of terms to obtain readable counterexamples
1385 (currently only supported by the default (exhaustive) tester).
1386 - New counterexample generator quickcheck[narrowing] enables
1387 narrowing-based testing. Requires the Glasgow Haskell compiler
1388 with its installation location defined in the Isabelle settings
1389 environment as ISABELLE_GHC.
1390 - Removed quickcheck tester "SML" based on the SML code generator
1391 (formly in HOL/Library).
1393 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
1394 use 'partial_function' instead.
1396 * Theory Library/Extended_Reals replaces now the positive extended
1397 reals found in probability theory. This file is extended by
1398 Multivariate_Analysis/Extended_Real_Limits.
1400 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
1401 from where it must be imported explicitly if it is really required.
1404 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
1405 been moved here. INCOMPATIBILITY.
1407 * Theory Library/Saturated provides type of numbers with saturated
1410 * Theory Library/Product_Lattice defines a pointwise ordering for the
1411 product type 'a * 'b, and provides instance proofs for various order
1412 and lattice type classes.
1414 * Theory Library/Countable now provides the "countable_datatype" proof
1415 method for proving "countable" class instances for datatypes.
1417 * Theory Library/Cset_Monad allows do notation for computable sets
1418 (cset) via the generic monad ad-hoc overloading facility.
1420 * Library: Theories of common data structures are split into theories
1421 for implementation, an invariant-ensuring type, and connection to an
1422 abstract type. INCOMPATIBILITY.
1424 - RBT is split into RBT and RBT_Mapping.
1425 - AssocList is split and renamed into AList and AList_Mapping.
1426 - DList is split into DList_Impl, DList, and DList_Cset.
1427 - Cset is split into Cset and List_Cset.
1429 * Theory Library/Nat_Infinity has been renamed to
1430 Library/Extended_Nat, with name changes of the following types and
1433 type inat ~> type enat
1435 Infty ~> infinity (overloaded)
1439 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
1440 been renamed accordingly. INCOMPATIBILITY.
1442 * Session Multivariate_Analysis: The euclidean_space type class now
1443 fixes a constant "Basis :: 'a set" consisting of the standard
1444 orthonormal basis for the type. Users now have the option of
1445 quantifying over this set instead of using the "basis" function, e.g.
1446 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
1448 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
1449 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
1450 "Cart_nth" and "Cart_lambda" have been respectively renamed to
1451 "vec_nth" and "vec_lambda"; theorems mentioning those names have
1452 changed to match. Definition theorems for overloaded constants now use
1453 the standard "foo_vec_def" naming scheme. A few other theorems have
1454 been renamed as follows (INCOMPATIBILITY):
1456 Cart_eq ~> vec_eq_iff
1457 dist_nth_le_cart ~> dist_vec_nth_le
1458 tendsto_vector ~> vec_tendstoI
1459 Cauchy_vector ~> vec_CauchyI
1461 * Session Multivariate_Analysis: Several duplicate theorems have been
1462 removed, and other theorems have been renamed or replaced with more
1463 general versions. INCOMPATIBILITY.
1465 finite_choice ~> finite_set_choice
1466 eventually_conjI ~> eventually_conj
1467 eventually_and ~> eventually_conj_iff
1468 eventually_false ~> eventually_False
1469 setsum_norm ~> norm_setsum
1470 Lim_sequentially ~> LIMSEQ_def
1471 Lim_ident_at ~> LIM_ident
1472 Lim_const ~> tendsto_const
1473 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
1474 Lim_neg ~> tendsto_minus
1475 Lim_add ~> tendsto_add
1476 Lim_sub ~> tendsto_diff
1477 Lim_mul ~> tendsto_scaleR
1478 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
1479 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
1480 Lim_linear ~> bounded_linear.tendsto
1481 Lim_component ~> tendsto_euclidean_component
1482 Lim_component_cart ~> tendsto_vec_nth
1483 Lim_inner ~> tendsto_inner [OF tendsto_const]
1484 dot_lsum ~> inner_setsum_left
1485 dot_rsum ~> inner_setsum_right
1486 continuous_cmul ~> continuous_scaleR [OF continuous_const]
1487 continuous_neg ~> continuous_minus
1488 continuous_sub ~> continuous_diff
1489 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
1490 continuous_mul ~> continuous_scaleR
1491 continuous_inv ~> continuous_inverse
1492 continuous_at_within_inv ~> continuous_at_within_inverse
1493 continuous_at_inv ~> continuous_at_inverse
1494 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
1495 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
1496 continuous_at_component ~> continuous_component [OF continuous_at_id]
1497 continuous_on_neg ~> continuous_on_minus
1498 continuous_on_sub ~> continuous_on_diff
1499 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
1500 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
1501 continuous_on_mul ~> continuous_on_scaleR
1502 continuous_on_mul_real ~> continuous_on_mult
1503 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
1504 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
1505 continuous_on_inverse ~> continuous_on_inv
1506 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
1507 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
1508 subset_interior ~> interior_mono
1509 subset_closure ~> closure_mono
1510 closure_univ ~> closure_UNIV
1511 real_arch_lt ~> reals_Archimedean2
1512 real_arch ~> reals_Archimedean3
1513 real_abs_norm ~> abs_norm_cancel
1514 real_abs_sub_norm ~> norm_triangle_ineq3
1515 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
1517 * Session HOL-Probability:
1518 - Caratheodory's extension lemma is now proved for ring_of_sets.
1519 - Infinite products of probability measures are now available.
1520 - Sigma closure is independent, if the generator is independent
1521 - Use extended reals instead of positive extended
1522 reals. INCOMPATIBILITY.
1524 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
1526 expand_fun_below ~> fun_below_iff
1527 below_fun_ext ~> fun_belowI
1528 expand_cfun_eq ~> cfun_eq_iff
1529 ext_cfun ~> cfun_eqI
1530 expand_cfun_below ~> cfun_below_iff
1531 below_cfun_ext ~> cfun_belowI
1532 monofun_fun_fun ~> fun_belowD
1533 monofun_fun_arg ~> monofunE
1534 monofun_lub_fun ~> adm_monofun [THEN admD]
1535 cont_lub_fun ~> adm_cont [THEN admD]
1536 cont2cont_Rep_CFun ~> cont2cont_APP
1537 cont_Rep_CFun_app ~> cont_APP_app
1538 cont_Rep_CFun_app_app ~> cont_APP_app_app
1539 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
1540 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
1541 contlub_cfun ~> lub_APP [symmetric]
1542 contlub_LAM ~> lub_LAM [symmetric]
1545 lift_distinct1 ~> lift.distinct(1)
1546 lift_distinct2 ~> lift.distinct(2)
1547 Def_not_UU ~> lift.distinct(2)
1548 Def_inject ~> lift.inject
1549 below_UU_iff ~> below_bottom_iff
1550 eq_UU_iff ~> eq_bottom_iff
1553 *** Document preparation ***
1555 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
1556 isar-ref manual, both for description and actual application of the
1559 * Antiquotation @{value} evaluates the given term and presents its
1562 * Antiquotations: term style "isub" provides ad-hoc conversion of
1563 variables x1, y23 into subscripted form x\<^isub>1,
1564 y\<^isub>2\<^isub>3.
1566 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
1567 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
1569 * Localized \isabellestyle switch can be used within blocks or groups
1572 \isabellestyle{it} %preferred default
1573 {\isabellestylett @{text "typewriter stuff"}}
1575 * Discontinued special treatment of hard tabulators. Implicit
1576 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
1582 * The inner syntax of sort/type/term/prop supports inlined YXML
1583 representations within quoted string tokens. By encoding logical
1584 entities via Term_XML (in ML or Scala) concrete syntax can be
1585 bypassed, which is particularly useful for producing bits of text
1586 under external program control.
1588 * Antiquotations for ML and document preparation are managed as theory
1589 data, which requires explicit setup.
1591 * Isabelle_Process.is_active allows tools to check if the official
1592 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
1593 (better known as Proof General).
1595 * Structure Proof_Context follows standard naming scheme. Old
1596 ProofContext is still available for some time as legacy alias.
1598 * Structure Timing provides various operations for timing; supersedes
1599 former start_timing/end_timing etc.
1601 * Path.print is the official way to show file-system paths to users
1602 (including quotes etc.).
1604 * Inner syntax: identifiers in parse trees of generic categories
1605 "logic", "aprop", "idt" etc. carry position information (disguised as
1606 type constraints). Occasional INCOMPATIBILITY with non-compliant
1607 translations that choke on unexpected type constraints. Positions can
1608 be stripped in ML translations via Syntax.strip_positions /
1609 Syntax.strip_positions_ast, or via the syntax constant
1610 "_strip_positions" within parse trees. As last resort, positions can
1611 be disabled via the configuration option Syntax.positions, which is
1612 called "syntax_positions" in Isar attribute syntax.
1614 * Discontinued special status of various ML structures that contribute
1615 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
1616 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
1617 refer directly to Ast.Constant, Lexicon.is_identifier,
1618 Syntax_Trans.mk_binder_tr etc.
1620 * Typed print translation: discontinued show_sorts argument, which is
1621 already available via context of "advanced" translation.
1623 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
1624 goal states; body tactic needs to address all subgoals uniformly.
1626 * Slightly more special eq_list/eq_set, with shortcut involving
1627 pointer equality (assumes that eq relation is reflexive).
1629 * Classical tactics use proper Proof.context instead of historic types
1630 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
1631 operate directly on Proof.context. Raw type claset retains its use as
1632 snapshot of the classical context, which can be recovered via
1633 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
1634 INCOMPATIBILITY, classical tactics and derived proof methods require
1635 proper Proof.context.
1640 * Discontinued support for Poly/ML 5.2, which was the last version
1641 without proper multithreading and TimeLimit implementation.
1643 * Discontinued old lib/scripts/polyml-platform, which has been
1644 obsolete since Isabelle2009-2.
1646 * Various optional external tools are referenced more robustly and
1647 uniformly by explicit Isabelle settings as follows:
1649 ISABELLE_CSDP (formerly CSDP_EXE)
1650 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
1651 ISABELLE_OCAML (formerly EXEC_OCAML)
1652 ISABELLE_SWIPL (formerly EXEC_SWIPL)
1653 ISABELLE_YAP (formerly EXEC_YAP)
1655 Note that automated detection from the file-system or search path has
1656 been discontinued. INCOMPATIBILITY.
1658 * Scala layer provides JVM method invocation service for static
1659 methods of type (String)String, see Invoke_Scala.method in ML. For
1662 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
1664 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
1665 this allows to pass structured values between ML and Scala.
1667 * The IsabelleText fonts includes some further glyphs to support the
1668 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
1669 installed a local copy (which is normally *not* required) need to
1670 delete or update it from ~~/lib/fonts/.
1674 New in Isabelle2011 (January 2011)
1675 ----------------------------------
1679 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
1680 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
1681 useful tooltips and hyperlinks produced from its static analysis. The
1682 bundled component provides an executable Isabelle tool that can be run
1685 Isabelle2011/bin/isabelle jedit
1687 * Significantly improved Isabelle/Isar implementation manual.
1689 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
1690 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
1691 while the default heap location within that directory lacks that extra
1692 suffix. This isolates multiple Isabelle installations from each
1693 other, avoiding problems with old settings in new versions.
1694 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
1696 * Source files are always encoded as UTF-8, instead of old-fashioned
1697 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
1698 the following package declarations:
1700 \usepackage[utf8]{inputenc}
1701 \usepackage{textcomp}
1703 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
1704 a Unicode character is treated as a single symbol, not a sequence of
1705 non-ASCII bytes as before. Since Isabelle/ML string literals may
1706 contain symbols without further backslash escapes, Unicode can now be
1707 used here as well. Recall that Symbol.explode in ML provides a
1708 consistent view on symbols, while raw explode (or String.explode)
1709 merely give a byte-oriented representation.
1711 * Theory loader: source files are primarily located via the master
1712 directory of each theory node (where the .thy file itself resides).
1713 The global load path is still partially available as legacy feature.
1714 Minor INCOMPATIBILITY due to subtle change in file lookup: use
1715 explicit paths, relatively to the theory.
1717 * Special treatment of ML file names has been discontinued.
1718 Historically, optional extensions .ML or .sml were added on demand --
1719 at the cost of clarity of file dependencies. Recall that Isabelle/ML
1720 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
1722 * Various options that affect pretty printing etc. are now properly
1723 handled within the context via configuration options, instead of
1724 unsynchronized references or print modes. There are both ML Config.T
1725 entities and Isar declaration attributes to access these.
1727 ML (Config.T) Isar (attribute)
1729 eta_contract eta_contract
1730 show_brackets show_brackets
1731 show_sorts show_sorts
1732 show_types show_types
1733 show_question_marks show_question_marks
1734 show_consts show_consts
1735 show_abbrevs show_abbrevs
1737 Syntax.ast_trace syntax_ast_trace
1738 Syntax.ast_stat syntax_ast_stat
1739 Syntax.ambiguity_level syntax_ambiguity_level
1741 Goal_Display.goals_limit goals_limit
1742 Goal_Display.show_main_goal show_main_goal
1744 Method.rule_trace rule_trace
1746 Thy_Output.display thy_output_display
1747 Thy_Output.quotes thy_output_quotes
1748 Thy_Output.indent thy_output_indent
1749 Thy_Output.source thy_output_source
1750 Thy_Output.break thy_output_break
1752 Note that corresponding "..._default" references in ML may only be
1753 changed globally at the ROOT session setup, but *not* within a theory.
1754 The option "show_abbrevs" supersedes the former print mode
1755 "no_abbrevs" with inverted meaning.
1757 * More systematic naming of some configuration options.
1760 trace_simp ~> simp_trace
1761 debug_simp ~> simp_debug
1763 * Support for real valued configuration options, using simplistic
1764 floating-point notation that coincides with the inner syntax for
1767 * Support for real valued preferences (with approximative PGIP type):
1768 front-ends need to accept "pgint" values in float notation.
1771 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
1774 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
1779 * Command 'type_synonym' (with single argument) replaces somewhat
1780 outdated 'types', which is still available as legacy feature for some
1783 * Command 'nonterminal' (with 'and' separated list of arguments)
1784 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
1786 * Command 'notepad' replaces former 'example_proof' for
1787 experimentation in Isar without any result. INCOMPATIBILITY.
1789 * Locale interpretation commands 'interpret' and 'sublocale' accept
1790 lists of equations to map definitions in a locale to appropriate
1791 entities in the context of the interpretation. The 'interpretation'
1792 command already provided this functionality.
1794 * Diagnostic command 'print_dependencies' prints the locale instances
1795 that would be activated if the specified expression was interpreted in
1796 the current context. Variant "print_dependencies!" assumes a context
1797 without interpretations.
1799 * Diagnostic command 'print_interps' prints interpretations in proofs
1800 in addition to interpretations in theories.
1802 * Discontinued obsolete 'global' and 'local' commands to manipulate
1803 the theory name space. Rare INCOMPATIBILITY. The ML functions
1804 Sign.root_path and Sign.local_path may be applied directly where this
1805 feature is still required for historical reasons.
1807 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
1808 'definition' instead.
1810 * The "prems" fact, which refers to the accidental collection of
1811 foundational premises in the context, is now explicitly marked as
1812 legacy feature and will be discontinued soon. Consider using "assms"
1813 of the head statement or reference facts by explicit names.
1815 * Document antiquotations @{class} and @{type} print classes and type
1818 * Document antiquotation @{file} checks file/directory entries within
1819 the local file system.
1824 * Coercive subtyping: functions can be declared as coercions and type
1825 inference will add them as necessary upon input of a term. Theory
1826 Complex_Main declares real :: nat => real and real :: int => real as
1827 coercions. A coercion function f is declared like this:
1829 declare [[coercion f]]
1831 To lift coercions through type constructors (e.g. from nat => real to
1832 nat list => real list), map functions can be declared, e.g.
1834 declare [[coercion_map map]]
1836 Currently coercion inference is activated only in theories including
1837 real numbers, i.e. descendants of Complex_Main. This is controlled by
1838 the configuration option "coercion_enabled", e.g. it can be enabled in
1839 other theories like this:
1841 declare [[coercion_enabled]]
1843 * Command 'partial_function' provides basic support for recursive
1844 function definitions over complete partial orders. Concrete instances
1845 are provided for i) the option type, ii) tail recursion on arbitrary
1846 types, and iii) the heap monad of Imperative_HOL. See
1847 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
1850 * Function package: f.psimps rules are no longer implicitly declared
1851 as [simp]. INCOMPATIBILITY.
1853 * Datatype package: theorems generated for executable equality (class
1854 "eq") carry proper names and are treated as default code equations.
1856 * Inductive package: now offers command 'inductive_simps' to
1857 automatically derive instantiated and simplified equations for
1858 inductive predicates, similar to 'inductive_cases'.
1860 * Command 'enriched_type' allows to register properties of the
1861 functorial structure of types.
1863 * Improved infrastructure for term evaluation using code generator
1864 techniques, in particular static evaluation conversions.
1866 * Code generator: Scala (2.8 or higher) has been added to the target
1869 * Code generator: globbing constant expressions "*" and "Theory.*"
1870 have been replaced by the more idiomatic "_" and "Theory._".
1873 * Code generator: export_code without explicit file declaration prints
1874 to standard output. INCOMPATIBILITY.
1876 * Code generator: do not print function definitions for case
1877 combinators any longer.
1879 * Code generator: simplification with rules determined with
1880 src/Tools/Code/code_simp.ML and method "code_simp".
1882 * Code generator for records: more idiomatic representation of record
1883 types. Warning: records are not covered by ancient SML code
1884 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
1885 rep_datatype declaration helps to succeed then:
1889 rep_datatype foo_ext ...
1891 * Records: logical foundation type for records does not carry a
1892 '_type' suffix any longer (obsolete due to authentic syntax).
1895 * Quickcheck now by default uses exhaustive testing instead of random
1896 testing. Random testing can be invoked by "quickcheck [random]",
1897 exhaustive testing by "quickcheck [exhaustive]".
1899 * Quickcheck instantiates polymorphic types with small finite
1900 datatypes by default. This enables a simple execution mechanism to
1901 handle quantifiers and function equality over the finite datatypes.
1903 * Quickcheck random generator has been renamed from "code" to
1904 "random". INCOMPATIBILITY.
1906 * Quickcheck now has a configurable time limit which is set to 30
1907 seconds by default. This can be changed by adding [timeout = n] to the
1908 quickcheck command. The time limit for Auto Quickcheck is still set
1911 * Quickcheck in locales considers interpretations of that locale for
1912 counter example search.
1915 - Added "smt" and "remote_smt" provers based on the "smt" proof
1916 method. See the Sledgehammer manual for details ("isabelle doc
1919 sledgehammer atp_info ~> sledgehammer running_provers
1920 sledgehammer atp_kill ~> sledgehammer kill_provers
1921 sledgehammer available_atps ~> sledgehammer available_provers
1924 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
1925 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
1926 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
1927 (and "ms" and "min" are no longer supported)
1932 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
1933 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
1935 - Added support for partial quotient types.
1936 - Added local versions of the "Nitpick.register_xxx" functions.
1937 - Added "whack" option.
1938 - Allow registration of quotient types as codatatypes.
1939 - Improved "merge_type_vars" option to merge more types.
1940 - Removed unsound "fast_descrs" option.
1941 - Added custom symmetry breaking for datatypes, making it possible to reach
1942 higher cardinalities.
1943 - Prevent the expansion of too large definitions.
1945 * Proof methods "metis" and "meson" now have configuration options
1946 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
1947 to diagnose these tools. E.g.
1949 using [[metis_trace = true]]
1951 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
1952 manually as command 'solve_direct'.
1954 * The default SMT solver Z3 must be enabled explicitly (due to
1955 licensing issues) by setting the environment variable
1956 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
1957 commercial applications, the SMT solver CVC3 is provided as fall-back;
1958 changing the SMT solver is done via the configuration option
1961 * Remote SMT solvers need to be referred to by the "remote_" prefix,
1962 i.e. "remote_cvc3" and "remote_z3".
1964 * Added basic SMT support for datatypes, records, and typedefs using
1965 the oracle mode (no proofs). Direct support of pairs has been dropped
1966 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
1967 support for a similar behavior). Minor INCOMPATIBILITY.
1969 * Changed SMT configuration options:
1971 z3_proofs ~> smt_oracle (with inverted meaning)
1972 z3_trace_assms ~> smt_trace_used_facts
1985 * Boogie output files (.b2i files) need to be declared in the theory
1988 * Simplification procedure "list_to_set_comprehension" rewrites list
1989 comprehensions applied to List.set to set comprehensions. Occasional
1990 INCOMPATIBILITY, may be deactivated like this:
1992 declare [[simproc del: list_to_set_comprehension]]
1994 * Removed old version of primrec package. INCOMPATIBILITY.
1996 * Removed simplifier congruence rule of "prod_case", as has for long
1997 been the case with "split". INCOMPATIBILITY.
1999 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
2001 * Removed [split_format ... and ... and ...] version of
2002 [split_format]. Potential INCOMPATIBILITY.
2004 * Predicate "sorted" now defined inductively, with nice induction
2005 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
2007 * Constant "contents" renamed to "the_elem", to free the generic name
2008 contents for other uses. INCOMPATIBILITY.
2010 * Renamed class eq and constant eq (for code generation) to class
2011 equal and constant equal, plus renaming of related facts and various
2012 tuning. INCOMPATIBILITY.
2014 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
2016 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
2019 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
2020 avoid confusion with finite sets. INCOMPATIBILITY.
2022 * Abandoned locales equiv, congruent and congruent2 for equivalence
2023 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
2026 * Some previously unqualified names have been qualified:
2033 Trueprop ~> HOL.Trueprop
2038 op --> ~> HOL.implies
2050 Pair ~> Product_Type.Pair
2051 fst ~> Product_Type.fst
2052 snd ~> Product_Type.snd
2053 curry ~> Product_Type.curry
2055 Collect ~> Set.Collect
2059 * More canonical naming convention for some fundamental definitions:
2061 bot_bool_eq ~> bot_bool_def
2062 top_bool_eq ~> top_bool_def
2063 inf_bool_eq ~> inf_bool_def
2064 sup_bool_eq ~> sup_bool_def
2065 bot_fun_eq ~> bot_fun_def
2066 top_fun_eq ~> top_fun_def
2067 inf_fun_eq ~> inf_fun_def
2068 sup_fun_eq ~> sup_fun_def
2072 * More stylized fact names:
2074 expand_fun_eq ~> fun_eq_iff
2075 expand_set_eq ~> set_eq_iff
2077 nat_number ~> eval_nat_numeral
2081 * Refactoring of code-generation specific operations in theory List:
2087 mem_iff ~> member_def
2088 null_empty ~> null_def
2090 INCOMPATIBILITY. Note that these were not supposed to be used
2091 regularly unless for striking reasons; their main purpose was code
2094 Various operations from the Haskell prelude are used for generating
2097 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
2098 "surj f" is now an abbreviation of "range f = UNIV". The theorems
2099 bij_def and surj_def are unchanged. INCOMPATIBILITY.
2101 * Abolished some non-alphabetic type names: "prod" and "sum" replace
2102 "*" and "+" respectively. INCOMPATIBILITY.
2104 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
2105 "Sum_Type.Plus" instead.
2107 * Constant "split" has been merged with constant "prod_case"; names of
2108 ML functions, facts etc. involving split have been retained so far,
2109 though. INCOMPATIBILITY.
2111 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
2112 instead. INCOMPATIBILITY.
2114 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
2117 * Former theory Library/Enum is now part of the HOL-Main image.
2118 INCOMPATIBILITY: all constants of the Enum theory now have to be
2119 referred to by its qualified name.
2122 nlists ~> Enum.nlists
2123 product ~> Enum.product
2125 * Theory Library/Monad_Syntax provides do-syntax for monad types.
2126 Syntax in Library/State_Monad has been changed to avoid ambiguities.
2129 * Theory Library/SetsAndFunctions has been split into
2130 Library/Function_Algebras and Library/Set_Algebras; canonical names
2131 for instance definitions for functions; various improvements.
2134 * Theory Library/Multiset provides stable quicksort implementation of
2137 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
2140 * Session Multivariate_Analysis: introduced a type class for euclidean
2141 space. Most theorems are now stated in terms of euclidean spaces
2142 instead of finite cartesian products.
2145 real ^ 'n ~> 'a::real_vector
2146 ~> 'a::euclidean_space
2147 ~> 'a::ordered_euclidean_space
2148 (depends on your needs)
2152 \<chi> x. _ ~> \<chi>\<chi> x. _
2155 Also note that the indices are now natural numbers and not from some
2156 finite type. Finite cartesian products of euclidean spaces, products
2157 of euclidean spaces the real and complex numbers are instantiated to
2158 be euclidean_spaces. INCOMPATIBILITY.
2160 * Session Probability: introduced pextreal as positive extended real
2161 numbers. Use pextreal as value for measures. Introduce the
2162 Radon-Nikodym derivative, product spaces and Fubini's theorem for
2163 arbitrary sigma finite measures. Introduces Lebesgue measure based on
2164 the integral in Multivariate Analysis. INCOMPATIBILITY.
2166 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
2169 * Session SPARK (with image HOL-SPARK) provides commands to load and
2170 prove verification conditions generated by the SPARK Ada program
2171 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
2176 * Theorems for additive ring operations (locale abelian_monoid and
2177 descendants) are generated by interpretation from their multiplicative
2178 counterparts. Names (in particular theorem names) have the mandatory
2179 qualifier 'add'. Previous theorem names are redeclared for
2182 * Structure "int_ring" is now an abbreviation (previously a
2183 definition). This fits more natural with advanced interpretations.
2188 * The domain package now runs in definitional mode by default: The
2189 former command 'new_domain' is now called 'domain'. To use the domain
2190 package in its original axiomatic mode, use 'domain (unsafe)'.
2193 * The new class "domain" is now the default sort. Class "predomain"
2194 is an unpointed version of "domain". Theories can be updated by
2195 replacing sort annotations as shown below. INCOMPATIBILITY.
2197 'a::type ~> 'a::countable
2198 'a::cpo ~> 'a::predomain
2199 'a::pcpo ~> 'a::domain
2201 * The old type class "rep" has been superseded by class "domain".
2202 Accordingly, users of the definitional package must remove any
2203 "default_sort rep" declarations. INCOMPATIBILITY.
2205 * The domain package (definitional mode) now supports unpointed
2206 predomain argument types, as long as they are marked 'lazy'. (Strict
2207 arguments must be in class "domain".) For example, the following
2208 domain definition now works:
2210 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
2212 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
2213 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
2214 'a option, and 'a list. Additionally, it configures fixrec and the
2215 domain package to work with these types. For example:
2217 fixrec isInl :: "('a + 'b) u -> tr"
2218 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
2220 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
2222 * The "(permissive)" option of fixrec has been replaced with a
2223 per-equation "(unchecked)" option. See
2224 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
2226 * The "bifinite" class no longer fixes a constant "approx"; the class
2227 now just asserts that such a function exists. INCOMPATIBILITY.
2229 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
2230 defines an embedding of type 'a defl into udom by default; instances
2231 of "bifinite" and "domain" classes are available in
2232 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
2234 * The syntax "REP('a)" has been replaced with "DEFL('a)".
2236 * The predicate "directed" has been removed. INCOMPATIBILITY.
2238 * The type class "finite_po" has been removed. INCOMPATIBILITY.
2240 * The function "cprod_map" has been renamed to "prod_map".
2243 * The monadic bind operator on each powerdomain has new binder syntax
2244 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
2245 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
2247 * The infix syntax for binary union on each powerdomain has changed
2248 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
2249 syntax. INCOMPATIBILITY.
2251 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
2252 still supported as an input translation.
2254 * Renamed some theorems (the original names are also still available).
2256 expand_fun_below ~> fun_below_iff
2257 below_fun_ext ~> fun_belowI
2258 expand_cfun_eq ~> cfun_eq_iff
2259 ext_cfun ~> cfun_eqI
2260 expand_cfun_below ~> cfun_below_iff
2261 below_cfun_ext ~> cfun_belowI
2262 cont2cont_Rep_CFun ~> cont2cont_APP
2264 * The Abs and Rep functions for various types have changed names.
2265 Related theorem names have also changed to match. INCOMPATIBILITY.
2267 Rep_CFun ~> Rep_cfun
2268 Abs_CFun ~> Abs_cfun
2269 Rep_Sprod ~> Rep_sprod
2270 Abs_Sprod ~> Abs_sprod
2271 Rep_Ssum ~> Rep_ssum
2272 Abs_Ssum ~> Abs_ssum
2274 * Lemmas with names of the form *_defined_iff or *_strict_iff have
2275 been renamed to *_bottom_iff. INCOMPATIBILITY.
2277 * Various changes to bisimulation/coinduction with domain package:
2279 - Definitions of "bisim" constants no longer mention definedness.
2280 - With mutual recursion, "bisim" predicate is now curried.
2281 - With mutual recursion, each type gets a separate coind theorem.
2282 - Variable names in bisim_def and coinduct rules have changed.
2286 * Case combinators generated by the domain package for type "foo" are
2287 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
2289 * Several theorems have been renamed to more accurately reflect the
2290 names of constants and types involved. INCOMPATIBILITY.
2292 thelub_const ~> lub_const
2293 lub_const ~> is_lub_const
2295 is_lub_lub ~> is_lubD2
2297 unique_lub ~> is_lub_unique
2298 is_ub_lub ~> is_lub_rangeD1
2299 lub_bin_chain ~> is_lub_bin_chain
2300 lub_fun ~> is_lub_fun
2301 thelub_fun ~> lub_fun
2302 thelub_cfun ~> lub_cfun
2303 thelub_Pair ~> lub_Pair
2304 lub_cprod ~> is_lub_prod
2305 thelub_cprod ~> lub_prod
2306 minimal_cprod ~> minimal_prod
2307 inst_cprod_pcpo ~> inst_prod_pcpo
2309 compact_UU ~> compact_bottom
2310 deflation_UU ~> deflation_bottom
2311 finite_deflation_UU ~> finite_deflation_bottom
2313 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
2315 sq_ord_less_eq_trans ~> below_eq_trans
2316 sq_ord_eq_less_trans ~> eq_below_trans
2317 refl_less ~> below_refl
2318 trans_less ~> below_trans
2319 antisym_less ~> below_antisym
2320 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
2321 box_less ~> box_below
2322 rev_trans_less ~> rev_below_trans
2323 not_less2not_eq ~> not_below2not_eq
2324 less_UU_iff ~> below_UU_iff
2325 flat_less_iff ~> flat_below_iff
2326 adm_less ~> adm_below
2327 adm_not_less ~> adm_not_below
2328 adm_compact_not_less ~> adm_compact_not_below
2329 less_fun_def ~> below_fun_def
2330 expand_fun_less ~> fun_below_iff
2331 less_fun_ext ~> fun_belowI
2332 less_discr_def ~> below_discr_def
2333 discr_less_eq ~> discr_below_eq
2334 less_unit_def ~> below_unit_def
2335 less_cprod_def ~> below_prod_def
2336 prod_lessI ~> prod_belowI
2337 Pair_less_iff ~> Pair_below_iff
2338 fst_less_iff ~> fst_below_iff
2339 snd_less_iff ~> snd_below_iff
2340 expand_cfun_less ~> cfun_below_iff
2341 less_cfun_ext ~> cfun_belowI
2342 injection_less ~> injection_below
2343 less_up_def ~> below_up_def
2344 not_Iup_less ~> not_Iup_below
2345 Iup_less ~> Iup_below
2347 Def_inject_less_eq ~> Def_below_Def
2348 Def_less_is_eq ~> Def_below_iff
2349 spair_less_iff ~> spair_below_iff
2350 less_sprod ~> below_sprod
2351 spair_less ~> spair_below
2352 sfst_less_iff ~> sfst_below_iff
2353 ssnd_less_iff ~> ssnd_below_iff
2354 fix_least_less ~> fix_least_below
2355 dist_less_one ~> dist_below_one
2356 less_ONE ~> below_ONE
2357 ONE_less_iff ~> ONE_below_iff
2358 less_sinlD ~> below_sinlD
2359 less_sinrD ~> below_sinrD
2364 * All constant names are now qualified internally and use proper
2365 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
2370 * Antiquotation @{assert} inlines a function bool -> unit that raises
2371 Fail if the argument is false. Due to inlining the source position of
2372 failed assertions is included in the error output.
2374 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
2375 text is in practice always evaluated with a stable theory checkpoint.
2376 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
2378 * Antiquotation @{theory A} refers to theory A from the ancestry of
2379 the current context, not any accidental theory loader state as before.
2380 Potential INCOMPATIBILITY, subtle change in semantics.
2382 * Syntax.pretty_priority (default 0) configures the required priority
2383 of pretty-printed output and thus affects insertion of parentheses.
2385 * Syntax.default_root (default "any") configures the inner syntax
2386 category (nonterminal symbol) for parsing of terms.
2388 * Former exception Library.UnequalLengths now coincides with
2389 ListPair.UnequalLengths.
2391 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
2392 main functionality is provided by structure Simplifier.
2394 * Renamed raw "explode" function to "raw_explode" to emphasize its
2395 meaning. Note that internally to Isabelle, Symbol.explode is used in
2396 almost all situations.
2398 * Discontinued obsolete function sys_error and exception SYS_ERROR.
2399 See implementation manual for further details on exceptions in
2402 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
2405 * Renamed structure PureThy to Pure_Thy and moved most of its
2406 operations to structure Global_Theory, to emphasize that this is
2407 rarely-used global-only stuff.
2409 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
2410 instead (or tracing for high-volume output).
2412 * Configuration option show_question_marks only affects regular pretty
2413 printing of types and terms, not raw Term.string_of_vname.
2415 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
2416 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
2417 @{thms} for most purposes.
2419 * ML structure Unsynchronized is never opened, not even in Isar
2420 interaction mode as before. Old Unsynchronized.set etc. have been
2421 discontinued -- use plain := instead. This should be *rare* anyway,
2422 since modern tools always work via official context data, notably
2423 configuration options.
2425 * Parallel and asynchronous execution requires special care concerning
2426 interrupts. Structure Exn provides some convenience functions that
2427 avoid working directly with raw Interrupt. User code must not absorb
2428 interrupts -- intermediate handling (for cleanup etc.) needs to be
2429 followed by re-raising of the original exception. Another common
2430 source of mistakes are "handle _" patterns, which make the meaning of
2431 the program subject to physical effects of the environment.
2435 New in Isabelle2009-2 (June 2010)
2436 ---------------------------------
2440 * Authentic syntax for *all* logical entities (type classes, type
2441 constructors, term constants): provides simple and robust
2442 correspondence between formal entities and concrete syntax. Within
2443 the parse tree / AST representations, "constants" are decorated by
2444 their category (class, type, const) and spelled out explicitly with
2445 their full internal name.
2447 Substantial INCOMPATIBILITY concerning low-level syntax declarations
2448 and translations (translation rules and translation functions in ML).
2449 Some hints on upgrading:
2451 - Many existing uses of 'syntax' and 'translations' can be replaced
2452 by more modern 'type_notation', 'notation' and 'abbreviation',
2453 which are independent of this issue.
2455 - 'translations' require markup within the AST; the term syntax
2456 provides the following special forms:
2458 CONST c -- produces syntax version of constant c from context
2459 XCONST c -- literally c, checked as constant from context
2460 c -- literally c, if declared by 'syntax'
2462 Plain identifiers are treated as AST variables -- occasionally the
2463 system indicates accidental variables via the error "rhs contains
2466 Type classes and type constructors are marked according to their
2467 concrete syntax. Some old translations rules need to be written
2468 for the "type" category, using type constructor application
2469 instead of pseudo-term application of the default category
2472 - 'parse_translation' etc. in ML may use the following
2475 @{class_syntax c} -- type class c within parse tree / AST
2476 @{term_syntax c} -- type constructor c within parse tree / AST
2477 @{const_syntax c} -- ML version of "CONST c" above
2478 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
2480 - Literal types within 'typed_print_translations', i.e. those *not*
2481 represented as pseudo-terms are represented verbatim. Use @{class
2482 c} or @{type_name c} here instead of the above syntax
2485 Note that old non-authentic syntax was based on unqualified base
2486 names, so all of the above "constant" names would coincide. Recall
2487 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
2488 diagnose syntax problems.
2490 * Type constructors admit general mixfix syntax, not just infix.
2492 * Concrete syntax may be attached to local entities without a proof
2493 body, too. This works via regular mixfix annotations for 'fix',
2494 'def', 'obtain' etc. or via the explicit 'write' command, which is
2495 similar to the 'notation' command in theory specifications.
2497 * Discontinued unnamed infix syntax (legacy feature for many years) --
2498 need to specify constant name and syntax separately. Internal ML
2499 datatype constructors have been renamed from InfixName to Infix etc.
2500 Minor INCOMPATIBILITY.
2502 * Schematic theorem statements need to be explicitly markup as such,
2503 via commands 'schematic_lemma', 'schematic_theorem',
2504 'schematic_corollary'. Thus the relevance of the proof is made
2505 syntactically clear, which impacts performance in a parallel or
2506 asynchronous interactive environment. Minor INCOMPATIBILITY.
2508 * Use of cumulative prems via "!" in some proof methods has been
2509 discontinued (old legacy feature).
2511 * References 'trace_simp' and 'debug_simp' have been replaced by
2512 configuration options stored in the context. Enabling tracing (the
2513 case of debugging is similar) in proofs works via
2515 using [[trace_simp = true]]
2517 Tracing is then active for all invocations of the simplifier in
2518 subsequent goal refinement steps. Tracing may also still be enabled or
2519 disabled via the ProofGeneral settings menu.
2521 * Separate commands 'hide_class', 'hide_type', 'hide_const',
2522 'hide_fact' replace the former 'hide' KIND command. Minor
2525 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
2526 more efficient than combinations with -q1 or -q2.
2531 * Proofterms record type-class reasoning explicitly, using the
2532 "unconstrain" operation internally. This eliminates all sort
2533 constraints from a theorem and proof, introducing explicit
2534 OFCLASS-premises. On the proof term level, this operation is
2535 automatically applied at theorem boundaries, such that closed proofs
2536 are always free of sort constraints. INCOMPATIBILITY for tools that
2537 inspect proof terms.
2539 * Local theory specifications may depend on extra type variables that
2540 are not present in the result type -- arguments TYPE('a) :: 'a itself
2541 are added internally. For example:
2543 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
2545 * Predicates of locales introduced by classes carry a mandatory
2546 "class" prefix. INCOMPATIBILITY.
2548 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
2550 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
2553 * Command 'code_reflect' allows to incorporate generated ML code into
2554 runtime environment; replaces immature code_datatype antiquotation.
2557 * Code generator: simple concept for abstract datatypes obeying
2560 * Code generator: details of internal data cache have no impact on the
2561 user space functionality any longer.
2563 * Methods "unfold_locales" and "intro_locales" ignore non-locale
2564 subgoals. This is more appropriate for interpretations with 'where'.
2567 * Command 'example_proof' opens an empty proof body. This allows to
2568 experiment with Isar, without producing any persistent result.
2570 * Commands 'type_notation' and 'no_type_notation' declare type syntax
2571 within a local theory context, with explicit checking of the
2572 constructors involved (in contrast to the raw 'syntax' versions).
2574 * Commands 'types' and 'typedecl' now work within a local theory
2575 context -- without introducing dependencies on parameters or
2576 assumptions, which is not possible in Isabelle/Pure.
2578 * Command 'defaultsort' has been renamed to 'default_sort', it works
2579 within a local theory context. Minor INCOMPATIBILITY.
2584 * Command 'typedef' now works within a local theory context -- without
2585 introducing dependencies on parameters or assumptions, which is not
2586 possible in Isabelle/Pure/HOL. Note that the logical environment may
2587 contain multiple interpretations of local typedefs (with different
2588 non-emptiness proofs), even in a global theory context.
2590 * New package for quotient types. Commands 'quotient_type' and
2591 'quotient_definition' may be used for defining types and constants by
2592 quotient constructions. An example is the type of integers created by
2593 quotienting pairs of natural numbers:
2596 intrel :: "(nat * nat) => (nat * nat) => bool"
2598 "intrel (x, y) (u, v) = (x + v = u + y)"
2600 quotient_type int = "nat * nat" / intrel
2601 by (auto simp add: equivp_def expand_fun_eq)
2604 "0::int" is "(0::nat, 0::nat)"
2606 The method "lifting" can be used to lift of theorems from the
2607 underlying "raw" type to the quotient type. The example
2608 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
2609 construction and provides a reasoning infrastructure for finite sets.
2611 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
2612 clash with new theory Quotient in Main HOL.
2614 * Moved the SMT binding into the main HOL session, eliminating
2615 separate HOL-SMT session.
2617 * List membership infix mem operation is only an input abbreviation.
2620 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
2621 for future developements; former Library/Word.thy is still present in
2622 the AFP entry RSAPPS.
2624 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
2625 longer shadowed. INCOMPATIBILITY.
2627 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
2630 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
2633 * Dropped normalizing_semiring etc; use the facts in semiring classes
2634 instead. INCOMPATIBILITY.
2636 * Dropped several real-specific versions of lemmas about floor and
2637 ceiling; use the generic lemmas from theory "Archimedean_Field"
2638 instead. INCOMPATIBILITY.
2640 floor_number_of_eq ~> floor_number_of
2641 le_floor_eq_number_of ~> number_of_le_floor
2642 le_floor_eq_zero ~> zero_le_floor
2643 le_floor_eq_one ~> one_le_floor
2644 floor_less_eq_number_of ~> floor_less_number_of
2645 floor_less_eq_zero ~> floor_less_zero
2646 floor_less_eq_one ~> floor_less_one
2647 less_floor_eq_number_of ~> number_of_less_floor
2648 less_floor_eq_zero ~> zero_less_floor
2649 less_floor_eq_one ~> one_less_floor
2650 floor_le_eq_number_of ~> floor_le_number_of
2651 floor_le_eq_zero ~> floor_le_zero
2652 floor_le_eq_one ~> floor_le_one
2653 floor_subtract_number_of ~> floor_diff_number_of
2654 floor_subtract_one ~> floor_diff_one
2655 ceiling_number_of_eq ~> ceiling_number_of
2656 ceiling_le_eq_number_of ~> ceiling_le_number_of
2657 ceiling_le_zero_eq ~> ceiling_le_zero
2658 ceiling_le_eq_one ~> ceiling_le_one
2659 less_ceiling_eq_number_of ~> number_of_less_ceiling
2660 less_ceiling_eq_zero ~> zero_less_ceiling
2661 less_ceiling_eq_one ~> one_less_ceiling
2662 ceiling_less_eq_number_of ~> ceiling_less_number_of
2663 ceiling_less_eq_zero ~> ceiling_less_zero
2664 ceiling_less_eq_one ~> ceiling_less_one
2665 le_ceiling_eq_number_of ~> number_of_le_ceiling
2666 le_ceiling_eq_zero ~> zero_le_ceiling
2667 le_ceiling_eq_one ~> one_le_ceiling
2668 ceiling_subtract_number_of ~> ceiling_diff_number_of
2669 ceiling_subtract_one ~> ceiling_diff_one
2671 * Theory "Finite_Set": various folding_XXX locales facilitate the
2672 application of the various fold combinators on finite sets.
2674 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
2675 provides abstract red-black tree type which is backed by "RBT_Impl" as
2676 implementation. INCOMPATIBILTY.
2678 * Theory Library/Coinductive_List has been removed -- superseded by
2679 AFP/thys/Coinductive.
2681 * Theory PReal, including the type "preal" and related operations, has
2682 been removed. INCOMPATIBILITY.
2684 * Real: new development using Cauchy Sequences.
2686 * Split off theory "Big_Operators" containing setsum, setprod,
2687 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
2689 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
2690 "Int" etc. INCOMPATIBILITY.
2692 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
2694 * New set of rules "ac_simps" provides combined assoc / commute
2695 rewrites for all interpretations of the appropriate generic locales.
2697 * Renamed theory "OrderedGroup" to "Groups" and split theory
2698 "Ring_and_Field" into theories "Rings" and "Fields"; for more
2699 appropriate and more consistent names suitable for name prefixes
2700 within the HOL theories. INCOMPATIBILITY.
2702 * Some generic constants have been put to appropriate theories:
2703 - less_eq, less: Orderings
2704 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
2705 - inverse, divide: Rings
2708 * More consistent naming of type classes involving orderings (and
2711 lower_semilattice ~> semilattice_inf
2712 upper_semilattice ~> semilattice_sup
2714 dense_linear_order ~> dense_linorder
2716 pordered_ab_group_add ~> ordered_ab_group_add
2717 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
2718 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
2719 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
2720 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
2721 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
2722 pordered_cancel_semiring ~> ordered_cancel_semiring
2723 pordered_comm_monoid_add ~> ordered_comm_monoid_add
2724 pordered_comm_ring ~> ordered_comm_ring
2725 pordered_comm_semiring ~> ordered_comm_semiring
2726 pordered_ring ~> ordered_ring
2727 pordered_ring_abs ~> ordered_ring_abs
2728 pordered_semiring ~> ordered_semiring
2730 ordered_ab_group_add ~> linordered_ab_group_add
2731 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
2732 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
2733 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
2734 ordered_field ~> linordered_field
2735 ordered_field_no_lb ~> linordered_field_no_lb
2736 ordered_field_no_ub ~> linordered_field_no_ub
2737 ordered_field_dense_linear_order ~> dense_linordered_field
2738 ordered_idom ~> linordered_idom
2739 ordered_ring ~> linordered_ring
2740 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
2741 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
2742 ordered_ring_strict ~> linordered_ring_strict
2743 ordered_semidom ~> linordered_semidom
2744 ordered_semiring ~> linordered_semiring
2745 ordered_semiring_1 ~> linordered_semiring_1
2746 ordered_semiring_1_strict ~> linordered_semiring_1_strict
2747 ordered_semiring_strict ~> linordered_semiring_strict
2749 The following slightly odd type classes have been moved to a
2750 separate theory Library/Lattice_Algebras:
2752 lordered_ab_group_add ~> lattice_ab_group_add
2753 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
2754 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
2755 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
2756 lordered_ring ~> lattice_ring
2760 * Refined field classes:
2761 - classes division_ring_inverse_zero, field_inverse_zero,
2762 linordered_field_inverse_zero include rule inverse 0 = 0 --
2763 subsumes former division_by_zero class;
2764 - numerous lemmas have been ported from field to division_ring.
2767 * Refined algebra theorem collections:
2768 - dropped theorem group group_simps, use algebra_simps instead;
2769 - dropped theorem group ring_simps, use field_simps instead;
2770 - proper theorem collection field_simps subsumes former theorem
2771 groups field_eq_simps and field_simps;
2772 - dropped lemma eq_minus_self_iff which is a duplicate for
2776 * Theory Finite_Set and List: some lemmas have been generalized from
2779 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
2780 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
2781 inter_Inter_fold_inter ~> inf_Inf_fold_inf
2782 union_Union_fold_union ~> sup_Sup_fold_sup
2783 Inter_fold_inter ~> Inf_fold_inf
2784 Union_fold_union ~> Sup_fold_sup
2785 inter_INTER_fold_inter ~> inf_INFI_fold_inf
2786 union_UNION_fold_union ~> sup_SUPR_fold_sup
2787 INTER_fold_inter ~> INFI_fold_inf
2788 UNION_fold_union ~> SUPR_fold_sup
2790 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
2791 replaced by the more convenient lemmas Inf_empty and Sup_empty.
2792 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
2793 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
2794 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
2795 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
2797 * Reorganized theory Multiset: swapped notation of pointwise and
2800 - pointwise ordering is instance of class order with standard syntax
2802 - multiset ordering has syntax <=# and <#; partial order properties
2803 are provided by means of interpretation with prefix
2805 - less duplication, less historical organization of sections,
2806 conversion from associations lists to multisets, rudimentary code
2808 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
2813 multiset_eq_conv_count_eq ~> multiset_ext_iff
2814 multi_count_ext ~> multiset_ext
2815 diff_union_inverse2 ~> diff_union_cancelR
2819 * Theory Permutation: replaced local "remove" by List.remove1.
2821 * Code generation: ML and OCaml code is decorated with signatures.
2823 * Theory List: added transpose.
2825 * Library/Nat_Bijection.thy is a collection of bijective functions
2826 between nat and other types, which supersedes the older libraries
2827 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
2830 Nat_Int_Bij.nat2_to_nat ~> prod_encode
2831 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
2832 Nat_Int_Bij.int_to_nat_bij ~> int_encode
2833 Nat_Int_Bij.nat_to_int_bij ~> int_decode
2834 Countable.pair_encode ~> prod_encode
2835 NatIso.prod2nat ~> prod_encode
2836 NatIso.nat2prod ~> prod_decode
2837 NatIso.sum2nat ~> sum_encode
2838 NatIso.nat2sum ~> sum_decode
2839 NatIso.list2nat ~> list_encode
2840 NatIso.nat2list ~> list_decode
2841 NatIso.set2nat ~> set_encode
2842 NatIso.nat2set ~> set_decode
2845 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
2846 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
2847 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
2848 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
2849 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
2850 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
2851 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
2852 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
2853 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
2854 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
2855 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
2856 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
2857 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
2860 - Renamed ATP commands:
2861 atp_info ~> sledgehammer running_atps
2862 atp_kill ~> sledgehammer kill_atps
2863 atp_messages ~> sledgehammer messages
2864 atp_minimize ~> sledgehammer minimize
2865 print_atps ~> sledgehammer available_atps
2867 - Added user's manual ("isabelle doc sledgehammer").
2868 - Added option syntax and "sledgehammer_params" to customize
2869 Sledgehammer's behavior. See the manual for details.
2870 - Modified the Isar proof reconstruction code so that it produces
2871 direct proofs rather than proofs by contradiction. (This feature
2872 is still experimental.)
2873 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
2875 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
2878 - Added and implemented "binary_ints" and "bits" options.
2879 - Added "std" option and implemented support for nonstandard models.
2880 - Added and implemented "finitize" option to improve the precision
2881 of infinite datatypes based on a monotonicity analysis.
2882 - Added support for quotient types.
2883 - Added support for "specification" and "ax_specification"
2885 - Added support for local definitions (for "function" and
2886 "termination" proofs).
2887 - Added support for term postprocessors.
2888 - Optimized "Multiset.multiset" and "FinFun.finfun".
2889 - Improved efficiency of "destroy_constrs" optimization.
2890 - Fixed soundness bugs related to "destroy_constrs" optimization and
2892 - Fixed soundness bug related to higher-order constructors.
2893 - Fixed soundness bug when "full_descrs" is enabled.
2894 - Improved precision of set constructs.
2895 - Added "atoms" option.
2896 - Added cache to speed up repeated Kodkod invocations on the same
2898 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
2899 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
2900 "SAT4J_Light". INCOMPATIBILITY.
2901 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
2902 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
2903 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
2905 * Method "induct" now takes instantiations of the form t, where t is not
2906 a variable, as a shorthand for "x == t", where x is a fresh variable.
2907 If this is not intended, t has to be enclosed in parentheses.
2908 By default, the equalities generated by definitional instantiations
2909 are pre-simplified, which may cause parameters of inductive cases
2910 to disappear, or may even delete some of the inductive cases.
2911 Use "induct (no_simp)" instead of "induct" to restore the old
2912 behaviour. The (no_simp) option is also understood by the "cases"
2913 and "nominal_induct" methods, which now perform pre-simplification, too.
2919 * Variable names in lemmas generated by the domain package have
2920 changed; the naming scheme is now consistent with the HOL datatype
2921 package. Some proof scripts may be affected, INCOMPATIBILITY.
2923 * The domain package no longer defines the function "foo_copy" for
2924 recursive domain "foo". The reach lemma is now stated directly in
2925 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
2926 be reformulated in terms of "foo_take", INCOMPATIBILITY.
2928 * Most definedness lemmas generated by the domain package (previously
2929 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
2930 like "foo$x = UU <-> x = UU", which works better as a simp rule.
2931 Proofs that used definedness lemmas as intro rules may break,
2932 potential INCOMPATIBILITY.
2934 * Induction and casedist rules generated by the domain package now
2935 declare proper case_names (one called "bottom", and one named for each
2936 constructor). INCOMPATIBILITY.
2938 * For mutually-recursive domains, separate "reach" and "take_lemma"
2939 rules are generated for each domain, INCOMPATIBILITY.
2941 foo_bar.reach ~> foo.reach bar.reach
2942 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
2944 * Some lemmas generated by the domain package have been renamed for
2945 consistency with the datatype package, INCOMPATIBILITY.
2947 foo.ind ~> foo.induct
2948 foo.finite_ind ~> foo.finite_induct
2949 foo.coind ~> foo.coinduct
2950 foo.casedist ~> foo.exhaust
2951 foo.exhaust ~> foo.nchotomy
2953 * For consistency with other definition packages, the fixrec package
2954 now generates qualified theorem names, INCOMPATIBILITY.
2956 foo_simps ~> foo.simps
2957 foo_unfold ~> foo.unfold
2958 foo_induct ~> foo.induct
2960 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
2961 method and internal fixrec proofs now use the default simpset instead.
2964 * The "contlub" predicate has been removed. Proof scripts should use
2965 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
2967 * The "admw" predicate has been removed, INCOMPATIBILITY.
2969 * The constants cpair, cfst, and csnd have been removed in favor of
2970 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
2975 * Antiquotations for basic formal entities:
2977 @{class NAME} -- type class
2978 @{class_syntax NAME} -- syntax representation of the above
2980 @{type_name NAME} -- logical type
2981 @{type_abbrev NAME} -- type abbreviation
2982 @{nonterminal NAME} -- type of concrete syntactic category
2983 @{type_syntax NAME} -- syntax representation of any of the above
2985 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
2986 @{const_abbrev NAME} -- abbreviated constant
2987 @{const_syntax NAME} -- syntax representation of any of the above
2989 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
2990 syntax constant (cf. 'syntax' command).
2992 * Antiquotation @{make_string} inlines a function to print arbitrary
2993 values similar to the ML toplevel. The result is compiler dependent
2994 and may fall back on "?" in certain situations.
2996 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
2997 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
2998 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
2999 not work with the asynchronous Isar document model.
3001 * Configuration options now admit dynamic default values, depending on
3002 the context or even global references.
3004 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
3005 uses an efficient external library if available (for Poly/ML).
3007 * Renamed some important ML structures, while keeping the old names
3008 for some time as aliases within the structure Legacy:
3010 OuterKeyword ~> Keyword
3013 OuterSyntax ~> Outer_Syntax
3014 PrintMode ~> Print_Mode
3015 SpecParse ~> Parse_Spec
3018 ThyOutput ~> Thy_Output
3019 TypeInfer ~> Type_Infer
3021 Note that "open Legacy" simplifies porting of sources, but forgetting
3022 to remove it again will complicate porting again in the future.
3024 * Most operations that refer to a global context are named
3025 accordingly, e.g. Simplifier.global_context or
3026 ProofContext.init_global. There are some situations where a global
3027 context actually works, but under normal circumstances one needs to
3028 pass the proper local context through the code!
3030 * Discontinued old TheoryDataFun with its copy/init operation -- data
3031 needs to be pure. Functor Theory_Data_PP retains the traditional
3032 Pretty.pp argument to merge, which is absent in the standard
3033 Theory_Data version.
3035 * Sorts.certify_sort and derived "cert" operations for types and terms
3036 no longer minimize sorts. Thus certification at the boundary of the
3037 inference kernel becomes invariant under addition of class relations,
3038 which is an important monotonicity principle. Sorts are now minimized
3039 in the syntax layer only, at the boundary between the end-user and the
3040 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
3041 explicitly in rare situations.
3043 * Renamed old-style Drule.standard to Drule.export_without_context, to
3044 emphasize that this is in no way a standard operation.
3047 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
3048 usual for resolution. Rare INCOMPATIBILITY.
3050 * Renamed varify/unvarify operations to varify_global/unvarify_global
3051 to emphasize that these only work in a global situation (which is
3054 * Curried take and drop in library.ML; negative length is interpreted
3055 as infinity (as in chop). Subtle INCOMPATIBILITY.
3057 * Proof terms: type substitutions on proof constants now use canonical
3058 order of type variables. INCOMPATIBILITY for tools working with proof
3061 * Raw axioms/defs may no longer carry sort constraints, and raw defs
3062 may no longer carry premises. User-level specifications are
3063 transformed accordingly by Thm.add_axiom/add_def.
3068 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
3069 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
3070 proof terms are enabled unconditionally in the new HOL-Proofs image.
3072 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
3073 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
3076 * Old lib/scripts/polyml-platform is superseded by the
3077 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
3078 variant, even on a 64 bit machine. The following example setting
3079 prefers 64 bit if available:
3081 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
3083 * The preliminary Isabelle/jEdit application demonstrates the emerging
3084 Isabelle/Scala layer for advanced prover interaction and integration.
3085 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
3088 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
3089 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
3090 similar to the default assignment of the document preparation system
3091 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
3092 provides some operations for direct access to the font without asking
3093 the user for manual installation.
3097 New in Isabelle2009-1 (December 2009)
3098 -------------------------------------
3102 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
3103 one backslash should be used, even in ML sources.
3108 * Locale interpretation propagates mixins along the locale hierarchy.
3109 The currently only available mixins are the equations used to map
3110 local definitions to terms of the target domain of an interpretation.
3112 * Reactivated diagnostic command 'print_interps'. Use "print_interps
3113 loc" to print all interpretations of locale "loc" in the theory.
3114 Interpretations in proofs are not shown.
3116 * Thoroughly revised locales tutorial. New section on conditional
3119 * On instantiation of classes, remaining undefined class parameters
3120 are formally declared. INCOMPATIBILITY.
3123 *** Document preparation ***
3125 * New generalized style concept for printing terms: @{foo (style) ...}
3126 instead of @{foo_style style ...} (old form is still retained for
3127 backward compatibility). Styles can be also applied for
3128 antiquotations prop, term_type and typeof.
3133 * New proof method "smt" for a combination of first-order logic with
3134 equality, linear and nonlinear (natural/integer/real) arithmetic, and
3135 fixed-size bitvectors; there is also basic support for higher-order
3136 features (esp. lambda abstractions). It is an incomplete decision
3137 procedure based on external SMT solvers using the oracle mechanism;
3138 for the SMT solver Z3, this method is proof-producing. Certificates
3139 are provided to avoid calling the external solvers solely for
3140 re-checking proofs. Due to a remote SMT service there is no need for
3141 installing SMT solvers locally. See src/HOL/SMT.
3143 * New commands to load and prove verification conditions generated by
3144 the Boogie program verifier or derived systems (e.g. the Verifying C
3145 Compiler (VCC) or Spec#). See src/HOL/Boogie.
3147 * New counterexample generator tool 'nitpick' based on the Kodkod
3148 relational model finder. See src/HOL/Tools/Nitpick and
3149 src/HOL/Nitpick_Examples.
3151 * New commands 'code_pred' and 'values' to invoke the predicate
3152 compiler and to enumerate values of inductive predicates.
3154 * A tabled implementation of the reflexive transitive closure.
3156 * New implementation of quickcheck uses generic code generator;
3157 default generators are provided for all suitable HOL types, records
3158 and datatypes. Old quickcheck can be re-activated importing theory
3159 Library/SML_Quickcheck.
3161 * New testing tool Mirabelle for automated proof tools. Applies
3162 several tools and tactics like sledgehammer, metis, or quickcheck, to
3163 every proof step in a theory. To be used in batch mode via the
3164 "mirabelle" utility.
3166 * New proof method "sos" (sum of squares) for nonlinear real
3167 arithmetic (originally due to John Harison). It requires theory
3168 Library/Sum_Of_Squares. It is not a complete decision procedure but
3169 works well in practice on quantifier-free real arithmetic with +, -,
3170 *, ^, =, <= and <, i.e. boolean combinations of equalities and
3171 inequalities between polynomials. It makes use of external
3172 semidefinite programming solvers. Method "sos" generates a
3173 certificate that can be pasted into the proof thus avoiding the need
3174 to call an external tool every time the proof is checked. See
3175 src/HOL/Library/Sum_Of_Squares.
3177 * New method "linarith" invokes existing linear arithmetic decision
3180 * New command 'atp_minimal' reduces result produced by Sledgehammer.
3182 * New Sledgehammer option "Full Types" in Proof General settings menu.
3183 Causes full type information to be output to the ATPs. This slows
3184 ATPs down considerably but eliminates a source of unsound "proofs"
3187 * New method "metisFT": A version of metis that uses full type
3188 information in order to avoid failures of proof reconstruction.
3190 * New evaluator "approximate" approximates an real valued term using
3191 the same method as the approximation method.
3193 * Method "approximate" now supports arithmetic expressions as
3194 boundaries of intervals and implements interval splitting and Taylor
3197 * ML antiquotation @{code_datatype} inserts definition of a datatype
3198 generated by the code generator; e.g. see src/HOL/Predicate.thy.
3200 * New theory SupInf of the supremum and infimum operators for sets of
3203 * New theory Probability, which contains a development of measure
3204 theory, eventually leading to Lebesgue integration and probability.
3206 * Extended Multivariate Analysis to include derivation and Brouwer's
3209 * Reorganization of number theory, INCOMPATIBILITY:
3210 - new number theory development for nat and int, in theories Divides
3211 and GCD as well as in new session Number_Theory
3212 - some constants and facts now suffixed with _nat and _int
3214 - former session NumberTheory now named Old_Number_Theory, including
3215 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
3216 - moved theory Pocklington from src/HOL/Library to
3217 src/HOL/Old_Number_Theory
3219 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
3220 lcm of finite and infinite sets. It is shown that they form a complete
3223 * Class semiring_div requires superclass no_zero_divisors and proof of
3224 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
3225 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
3226 generalized to class semiring_div, subsuming former theorems
3227 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
3228 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
3231 * Refinements to lattice classes and sets:
3232 - less default intro/elim rules in locale variant, more default
3233 intro/elim rules in class variant: more uniformity
3234 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
3236 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
3238 - renamed ACI to inf_sup_aci
3239 - new class "boolean_algebra"
3240 - class "complete_lattice" moved to separate theory
3241 "Complete_Lattice"; corresponding constants (and abbreviations)
3242 renamed and with authentic syntax:
3243 Set.Inf ~> Complete_Lattice.Inf
3244 Set.Sup ~> Complete_Lattice.Sup
3245 Set.INFI ~> Complete_Lattice.INFI
3246 Set.SUPR ~> Complete_Lattice.SUPR
3247 Set.Inter ~> Complete_Lattice.Inter
3248 Set.Union ~> Complete_Lattice.Union
3249 Set.INTER ~> Complete_Lattice.INTER
3250 Set.UNION ~> Complete_Lattice.UNION
3251 - authentic syntax for
3254 - mere abbreviations:
3257 Set.inter (for inf, formerly Set.Int)
3258 Set.union (for sup, formerly Set.Un)
3259 Complete_Lattice.Inter (for Inf)
3260 Complete_Lattice.Union (for Sup)
3261 Complete_Lattice.INTER (for INFI)
3262 Complete_Lattice.UNION (for SUPR)
3263 - object-logic definitions as far as appropriate
3265 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
3266 Un_subset_iff are explicitly deleted as default simp rules; then also
3267 their lattice counterparts le_inf_iff and le_sup_iff have to be
3268 deleted to achieve the desired effect.
3270 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
3271 rules by default any longer; the same applies to min_max.inf_absorb1
3272 etc. INCOMPATIBILITY.
3274 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
3275 pred_set_conv by default. INCOMPATIBILITY.
3277 * Power operations on relations and functions are now one dedicated
3278 constant "compow" with infix syntax "^^". Power operation on
3279 multiplicative monoids retains syntax "^" and is now defined generic
3280 in class power. INCOMPATIBILITY.
3282 * Relation composition "R O S" now has a more standard argument order:
3283 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
3284 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
3285 break, since the O_assoc rule was not rewritten like this. Fix using
3286 O_assoc[symmetric]. The same applies to the curried version "R OO S".
3288 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
3289 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
3292 * Most rules produced by inductive and datatype package have mandatory
3293 prefixes. INCOMPATIBILITY.
3295 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
3296 the attribute of the same name. Each of the theorems in the list
3297 DERIV_intros assumes composition with an additional function and
3298 matches a variable to the derivative, which has to be solved by the
3299 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
3300 of most elementary terms. Former Maclauren.DERIV_tac and
3301 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
3304 * Code generator attributes follow the usual underscore convention:
3305 code_unfold replaces code unfold
3306 code_post replaces code post
3311 sizechange -> size_change
3312 induct_scheme -> induction_schema
3315 * Discontinued abbreviation "arbitrary" of constant "undefined".
3316 INCOMPATIBILITY, use "undefined" directly.
3319 Suc_eq_add_numeral_1 -> Suc_eq_plus1
3320 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
3321 Suc_plus1 -> Suc_eq_plus1
3322 *anti_sym -> *antisym*
3323 vector_less_eq_def -> vector_le_def
3326 * Added theorem List.map_map as [simp]. Removed List.map_compose.
3329 * Removed predicate "M hassize n" (<--> card M = n & finite M).
3335 * Theory Representable defines a class "rep" of domains that are
3336 representable (via an ep-pair) in the universal domain type "udom".
3337 Instances are provided for all type constructors defined in HOLCF.
3339 * The 'new_domain' command is a purely definitional version of the
3340 domain package, for representable domains. Syntax is identical to the
3341 old domain package. The 'new_domain' package also supports indirect
3342 recursion using previously-defined type constructors. See
3343 src/HOLCF/ex/New_Domain.thy for examples.
3345 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
3346 on the left-hand side of an equation, and then performs
3347 simplification. Rewriting is done using rules declared with the
3348 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
3349 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
3351 * The pattern-match compiler in 'fixrec' can now handle constructors
3352 with HOL function types. Pattern-match combinators for the Pair
3353 constructor are pre-configured.
3355 * The 'fixrec' package now produces better fixed-point induction rules
3356 for mutually-recursive definitions: Induction rules have conclusions
3357 of the form "P foo bar" instead of "P <foo, bar>".
3359 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
3360 been renamed to "below". The name "below" now replaces "less" in many
3361 theorem names. (Legacy theorem names using "less" are still supported
3364 * The 'fixrec' package now supports "bottom patterns". Bottom
3365 patterns can be used to generate strictness rules, or to make
3366 functions more strict (much like the bang-patterns supported by the
3367 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
3373 * Support for Poly/ML 5.3.0, with improved reporting of compiler
3374 errors and run-time exceptions, including detailed source positions.
3376 * Structure Name_Space (formerly NameSpace) now manages uniquely
3377 identified entries, with some additional information such as source
3378 position, logical grouping etc.
3380 * Theory and context data is now introduced by the simplified and
3381 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
3382 to be pure, but the old TheoryDataFun for mutable data (with explicit
3383 copy operation) is still available for some time.
3385 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
3386 provides a high-level programming interface to synchronized state
3387 variables with atomic update. This works via pure function
3388 application within a critical section -- its runtime should be as
3389 short as possible; beware of deadlocks if critical code is nested,
3390 either directly or indirectly via other synchronized variables!
3392 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
3393 wraps raw ML references, explicitly indicating their non-thread-safe
3394 behaviour. The Isar toplevel keeps this structure open, to
3395 accommodate Proof General as well as quick and dirty interactive
3396 experiments with references.
3398 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
3399 parallel tactical reasoning.
3401 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
3402 are similar to SUBPROOF, but are slightly more flexible: only the
3403 specified parts of the subgoal are imported into the context, and the
3404 body tactic may introduce new subgoals and schematic variables.
3406 * Old tactical METAHYPS, which does not observe the proof context, has
3407 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
3408 or Subgoal.FOCUS etc.
3410 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
3411 functors have their own ML name space there is no point to mark them
3412 separately.) Minor INCOMPATIBILITY.
3414 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
3416 * Renamed several structures FooBar to Foo_Bar. Occasional,
3419 * Operations of structure Skip_Proof no longer require quick_and_dirty
3420 mode, which avoids critical setmp.
3422 * Eliminated old Attrib.add_attributes, Method.add_methods and related
3423 combinators for "args". INCOMPATIBILITY, need to use simplified
3424 Attrib/Method.setup introduced in Isabelle2009.
3426 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
3427 back on global_simpset_of, global_claset_of, global_clasimpset_of as
3428 last resort. INCOMPATIBILITY.
3430 * Display.pretty_thm now requires a proper context (cf. former
3431 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
3432 or even Display.pretty_thm_without_context as last resort.
3435 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
3436 Syntax.pretty_typ/term directly, preferably with proper context
3437 instead of global theory.
3442 * Further fine tuning of parallel proof checking, scales up to 8 cores
3443 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
3446 * Support for additional "Isabelle components" via etc/components, see
3447 also the system manual.
3449 * The isabelle makeall tool now operates on all components with
3450 IsaMakefile, not just hardwired "logics".
3452 * Removed "compress" option from isabelle-process and isabelle usedir;
3453 this is always enabled.
3455 * Discontinued support for Poly/ML 4.x versions.
3457 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
3458 on a given logic image. This requires the lighttpd webserver and is
3459 currently supported on Linux only.
3463 New in Isabelle2009 (April 2009)
3464 --------------------------------
3468 * Simplified main Isabelle executables, with less surprises on
3469 case-insensitive file-systems (such as Mac OS).
3471 - The main Isabelle tool wrapper is now called "isabelle" instead of
3474 - The former "isabelle" alias for "isabelle-process" has been
3475 removed (should rarely occur to regular users).
3477 - The former "isabelle-interface" and its alias "Isabelle" have been
3478 removed (interfaces are now regular Isabelle tools).
3480 Within scripts and make files, the Isabelle environment variables
3481 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
3482 respectively. (The latter are still available as legacy feature.)
3484 The old isabelle-interface wrapper could react in confusing ways if
3485 the interface was uninstalled or changed otherwise. Individual
3486 interface tool configuration is now more explicit, see also the
3487 Isabelle system manual. In particular, Proof General is now available
3488 via "isabelle emacs".
3490 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
3491 purge installed copies of Isabelle executables and re-run "isabelle
3492 install -p ...", or use symlinks.
3494 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
3495 old ~/isabelle, which was slightly non-standard and apt to cause
3496 surprises on case-insensitive file-systems (such as Mac OS).
3498 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
3499 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
3500 care is required when using older releases of Isabelle. Note that
3501 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
3502 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
3504 * Proofs of fully specified statements are run in parallel on
3505 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
3506 a regular 4-core machine, if the initial heap space is made reasonably
3507 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
3509 * The main reference manuals ("isar-ref", "implementation", and
3510 "system") have been updated and extended. Formally checked references
3511 as hyperlinks are now available uniformly.
3516 * Complete re-implementation of locales. INCOMPATIBILITY in several
3517 respects. The most important changes are listed below. See the
3518 Tutorial on Locales ("locales" manual) for details.
3520 - In locale expressions, instantiation replaces renaming. Parameters
3521 must be declared in a for clause. To aid compatibility with previous
3522 parameter inheritance, in locale declarations, parameters that are not
3523 'touched' (instantiation position "_" or omitted) are implicitly added
3524 with their syntax at the beginning of the for clause.
3526 - Syntax from abbreviations and definitions in locales is available in
3527 locale expressions and context elements. The latter is particularly
3528 useful in locale declarations.
3530 - More flexible mechanisms to qualify names generated by locale
3531 expressions. Qualifiers (prefixes) may be specified in locale
3532 expressions, and can be marked as mandatory (syntax: "name!:") or
3533 optional (syntax "name?:"). The default depends for plain "name:"
3534 depends on the situation where a locale expression is used: in
3535 commands 'locale' and 'sublocale' prefixes are optional, in
3536 'interpretation' and 'interpret' prefixes are mandatory. The old
3537 implicit qualifiers derived from the parameter names of a locale are
3538 no longer generated.
3540 - Command "sublocale l < e" replaces "interpretation l < e". The
3541 instantiation clause in "interpretation" and "interpret" (square
3542 brackets) is no longer available. Use locale expressions.
3544 - When converting proof scripts, mandatory qualifiers in
3545 'interpretation' and 'interpret' should be retained by default, even
3546 if this is an INCOMPATIBILITY compared to former behavior. In the
3547 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
3548 in locale expressions range over a single locale instance only.
3550 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
3551 In existing theorem specifications replace the includes element by the
3552 respective context elements of the included locale, omitting those
3553 that are already present in the theorem specification. Multiple
3554 assume elements of a locale should be replaced by a single one
3555 involving the locale predicate. In the proof body, declarations (most
3556 notably theorems) may be regained by interpreting the respective
3557 locales in the proof context as required (command "interpret").
3559 If using "includes" in replacement of a target solely because the
3560 parameter types in the theorem are not as general as in the target,
3561 consider declaring a new locale with additional type constraints on
3562 the parameters (context element "constrains").
3564 - Discontinued "locale (open)". INCOMPATIBILITY.
3566 - Locale interpretation commands no longer attempt to simplify goal.
3567 INCOMPATIBILITY: in rare situations the generated goal differs. Use
3568 methods intro_locales and unfold_locales to clarify.
3570 - Locale interpretation commands no longer accept interpretation
3571 attributes. INCOMPATIBILITY.
3573 * Class declaration: so-called "base sort" must not be given in import
3574 list any longer, but is inferred from the specification. Particularly
3581 class foo = type + ...
3583 * Class target: global versions of theorems stemming do not carry a
3584 parameter prefix any longer. INCOMPATIBILITY.
3586 * Class 'instance' command no longer accepts attached definitions.
3587 INCOMPATIBILITY, use proper 'instantiation' target instead.
3589 * Recovered hiding of consts, which was accidentally broken in
3590 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
3591 makes c inaccessible; consider using ``hide (open) const c'' instead.
3593 * Slightly more coherent Pure syntax, with updated documentation in
3594 isar-ref manual. Removed locales meta_term_syntax and
3595 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
3596 INCOMPATIBILITY in rare situations. Note that &&& should not be used
3597 directly in regular applications.
3599 * There is a new syntactic category "float_const" for signed decimal
3600 fractions (e.g. 123.45 or -123.45).
3602 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
3603 interface with 'setup' command instead.
3605 * Command 'local_setup' is similar to 'setup', but operates on a local
3608 * The 'axiomatization' command now only works within a global theory
3609 context. INCOMPATIBILITY.
3611 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
3612 hypotheses. Sorts required in the course of reasoning need to be
3613 covered by the constraints in the initial statement, completed by the
3614 type instance information of the background theory. Non-trivial sort
3615 hypotheses, which rarely occur in practice, may be specified via
3616 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
3618 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
3620 The result contains an implicit sort hypotheses as before --
3621 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
3624 * Generalized Isar history, with support for linear undo, direct state
3627 * Changed defaults for unify configuration options:
3629 unify_trace_bound = 50 (formerly 25)
3630 unify_search_bound = 60 (formerly 30)
3632 * Different bookkeeping for code equations (INCOMPATIBILITY):
3634 a) On theory merge, the last set of code equations for a particular
3635 constant is taken (in accordance with the policy applied by other
3636 parts of the code generator framework).
3638 b) Code equations stemming from explicit declarations (e.g. code
3639 attribute) gain priority over default code equations stemming
3640 from definition, primrec, fun etc.
3642 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
3644 * Unified theorem tables for both code generators. Thus [code
3645 func] has disappeared and only [code] remains. INCOMPATIBILITY.
3647 * Command 'find_consts' searches for constants based on type and name
3650 find_consts "_ => bool"
3652 By default, matching is against subtypes, but it may be restricted to
3653 the whole type. Searching by name is possible. Multiple queries are
3654 conjunctive and queries may be negated by prefixing them with a
3657 find_consts strict: "_ => bool" name: "Int" -"int => int"
3659 * New 'find_theorems' criterion "solves" matches theorems that
3660 directly solve the current goal (modulo higher-order unification).
3662 * Auto solve feature for main theorem statements: whenever a new goal
3663 is stated, "find_theorems solves" is called; any theorems that could
3664 solve the lemma directly are listed as part of the goal state.
3665 Cf. associated options in Proof General Isabelle settings menu,
3666 enabled by default, with reasonable timeout for pathological cases of
3667 higher-order unification.
3670 *** Document preparation ***
3672 * Antiquotation @{lemma} now imitates a regular terminal proof,
3673 demanding keyword 'by' and supporting the full method expression
3674 syntax just like the Isar command 'by'.
3679 * Integrated main parts of former image HOL-Complex with HOL. Entry
3680 points Main and Complex_Main remain as before.
3682 * Logic image HOL-Plain provides a minimal HOL with the most important
3683 tools available (inductive, datatype, primrec, ...). This facilitates
3684 experimentation and tool development. Note that user applications
3685 (and library theories) should never refer to anything below theory
3688 * Logic image HOL-Main stops at theory Main, and thus facilitates
3689 experimentation due to shorter build times.
3691 * Logic image HOL-NSA contains theories of nonstandard analysis which
3692 were previously part of former HOL-Complex. Entry point Hyperreal
3693 remains valid, but theories formerly using Complex_Main should now use
3694 new entry point Hypercomplex.
3696 * Generic ATP manager for Sledgehammer, based on ML threads instead of
3697 Posix processes. Avoids potentially expensive forking of the ML
3698 process. New thread-based implementation also works on non-Unix
3699 platforms (Cygwin). Provers are no longer hardwired, but defined
3700 within the theory via plain ML wrapper functions. Basic Sledgehammer
3701 commands are covered in the isar-ref manual.
3703 * Wrapper scripts for remote SystemOnTPTP service allows to use
3704 sledgehammer without local ATP installation (Vampire etc.). Other
3705 provers may be included via suitable ML wrappers, see also
3706 src/HOL/ATP_Linkup.thy.
3708 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
3711 * The metis method no longer fails because the theorem is too trivial
3712 (contains the empty clause).
3714 * The metis method now fails in the usual manner, rather than raising
3715 an exception, if it determines that it cannot prove the theorem.
3717 * Method "coherent" implements a prover for coherent logic (see also
3718 src/Tools/coherent.ML).
3720 * Constants "undefined" and "default" replace "arbitrary". Usually
3721 "undefined" is the right choice to replace "arbitrary", though
3722 logically there is no difference. INCOMPATIBILITY.
3724 * Command "value" now integrates different evaluation mechanisms. The
3725 result of the first successful evaluation mechanism is printed. In
3726 square brackets a particular named evaluation mechanisms may be
3727 specified (currently, [SML], [code] or [nbe]). See further
3728 src/HOL/ex/Eval_Examples.thy.
3730 * Normalization by evaluation now allows non-leftlinear equations.
3731 Declare with attribute [code nbe].
3733 * Methods "case_tac" and "induct_tac" now refer to the very same rules
3734 as the structured Isar versions "cases" and "induct", cf. the
3735 corresponding "cases" and "induct" attributes. Mutual induction rules
3736 are now presented as a list of individual projections
3737 (e.g. foo_bar.inducts for types foo and bar); the old format with
3738 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
3739 rare situations a different rule is selected --- notably nested tuple
3740 elimination instead of former prod.exhaust: use explicit (case_tac t
3741 rule: prod.exhaust) here.
3743 * Attributes "cases", "induct", "coinduct" support "del" option.
3745 * Removed fact "case_split_thm", which duplicates "case_split".
3747 * The option datatype has been moved to a new theory Option. Renamed
3748 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
3750 * New predicate "strict_mono" classifies strict functions on partial
3751 orders. With strict functions on linear orders, reasoning about
3752 (in)equalities is facilitated by theorems "strict_mono_eq",
3753 "strict_mono_less_eq" and "strict_mono_less".
3755 * Some set operations are now proper qualified constants with
3756 authentic syntax. INCOMPATIBILITY:
3767 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
3770 * Auxiliary class "itself" has disappeared -- classes without any
3771 parameter are treated as expected by the 'class' command.
3773 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
3775 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
3776 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
3778 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
3779 method "approximation". It proves formulas on real values by using
3780 interval arithmetic. In the formulas are also the transcendental
3781 functions sin, cos, tan, atan, ln, exp and the constant pi are
3782 allowed. For examples see
3783 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
3785 * Theory "Reflection" now resides in HOL/Library.
3787 * Entry point to Word library now simply named "Word".
3790 * Made source layout more coherent with logical distribution
3793 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
3794 src/HOL/Library/Code_Message.thy ~> src/HOL/
3795 src/HOL/Library/GCD.thy ~> src/HOL/
3796 src/HOL/Library/Order_Relation.thy ~> src/HOL/
3797 src/HOL/Library/Parity.thy ~> src/HOL/
3798 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
3799 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
3800 src/HOL/Real/Lubs.thy ~> src/HOL/
3801 src/HOL/Real/PReal.thy ~> src/HOL/
3802 src/HOL/Real/Rational.thy ~> src/HOL/
3803 src/HOL/Real/RComplete.thy ~> src/HOL/
3804 src/HOL/Real/RealDef.thy ~> src/HOL/
3805 src/HOL/Real/RealPow.thy ~> src/HOL/
3806 src/HOL/Real/Real.thy ~> src/HOL/
3807 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
3808 src/HOL/Complex/Complex.thy ~> src/HOL/
3809 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
3810 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
3811 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
3812 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
3813 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
3814 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
3815 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
3816 src/HOL/Hyperreal/Log.thy ~> src/HOL/
3817 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
3818 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
3819 src/HOL/Hyperreal/Series.thy ~> src/HOL/
3820 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
3821 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
3822 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
3823 src/HOL/Real/Float ~> src/HOL/Library/
3824 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
3825 src/HOL/Real/RealVector.thy ~> src/HOL/
3827 src/HOL/arith_data.ML ~> src/HOL/Tools
3828 src/HOL/hologic.ML ~> src/HOL/Tools
3829 src/HOL/simpdata.ML ~> src/HOL/Tools
3830 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
3831 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
3832 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
3833 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
3834 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
3835 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
3836 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
3838 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
3839 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
3840 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
3841 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
3842 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
3843 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
3845 * If methods "eval" and "evaluation" encounter a structured proof
3846 state with !!/==>, only the conclusion is evaluated to True (if
3847 possible), avoiding strange error messages.
3849 * Method "sizechange" automates termination proofs using (a
3850 modification of) the size-change principle. Requires SAT solver. See
3851 src/HOL/ex/Termination.thy for examples.
3853 * Simplifier: simproc for let expressions now unfolds if bound
3854 variable occurs at most once in let expression body. INCOMPATIBILITY.
3856 * Method "arith": Linear arithmetic now ignores all inequalities when
3857 fast_arith_neq_limit is exceeded, instead of giving up entirely.
3859 * New attribute "arith" for facts that should always be used
3860 automatically by arithmetic. It is intended to be used locally in
3863 assumes [arith]: "x > 0"
3865 Global usage is discouraged because of possible performance impact.
3867 * New classes "top" and "bot" with corresponding operations "top" and
3868 "bot" in theory Orderings; instantiation of class "complete_lattice"
3869 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
3871 * Changed definition lemma "less_fun_def" in order to provide an
3872 instance for preorders on functions; use lemma "less_le" instead.
3875 * Theory Orderings: class "wellorder" moved here, with explicit
3876 induction rule "less_induct" as assumption. For instantiation of
3877 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
3880 * Theory Orderings: added class "preorder" as superclass of "order".
3881 INCOMPATIBILITY: Instantiation proofs for order, linorder
3882 etc. slightly changed. Some theorems named order_class.* now named
3885 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
3888 * Theory Finite_Set: added a new fold combinator of type
3890 ('a => 'b => 'b) => 'b => 'a set => 'b
3892 Occasionally this is more convenient than the old fold combinator
3893 which is now defined in terms of the new one and renamed to
3896 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
3897 and "ring_simps" have been replaced by "algebra_simps" (which can be
3898 extended with further lemmas!). At the moment both still exist but
3899 the former will disappear at some point.
3901 * Theory Power: Lemma power_Suc is now declared as a simp rule in
3902 class recpower. Type-specific simp rules for various recpower types
3903 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
3905 rat_power_0 -> power_0
3906 rat_power_Suc -> power_Suc
3907 realpow_0 -> power_0
3908 realpow_Suc -> power_Suc
3909 complexpow_0 -> power_0
3910 complexpow_Suc -> power_Suc
3911 power_poly_0 -> power_0
3912 power_poly_Suc -> power_Suc
3914 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
3915 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
3916 dvd has been generalized to class comm_semiring_1. Likewise a bunch
3917 of lemmas from Divides has been generalized from nat to class
3918 semiring_div. INCOMPATIBILITY. This involves the following theorem
3919 renames resulting from duplicate elimination:
3921 dvd_def_mod ~> dvd_eq_mod_eq_0
3922 zero_dvd_iff ~> dvd_0_left_iff
3923 dvd_0 ~> dvd_0_right
3924 DIVISION_BY_ZERO_DIV ~> div_by_0
3925 DIVISION_BY_ZERO_MOD ~> mod_by_0
3926 mult_div ~> div_mult_self2_is_id
3927 mult_mod ~> mod_mult_self2_is_0
3929 * Theory IntDiv: removed many lemmas that are instances of class-based
3930 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
3931 rename old lemmas as follows:
3933 dvd_diff -> nat_dvd_diff
3934 dvd_zminus_iff -> dvd_minus_iff
3935 mod_add1_eq -> mod_add_eq
3936 mod_mult1_eq -> mod_mult_right_eq
3937 mod_mult1_eq' -> mod_mult_left_eq
3938 mod_mult_distrib_mod -> mod_mult_eq
3939 nat_mod_add_left_eq -> mod_add_left_eq
3940 nat_mod_add_right_eq -> mod_add_right_eq
3941 nat_mod_div_trivial -> mod_div_trivial
3942 nat_mod_mod_trivial -> mod_mod_trivial
3943 zdiv_zadd_self1 -> div_add_self1
3944 zdiv_zadd_self2 -> div_add_self2
3945 zdiv_zmult_self1 -> div_mult_self2_is_id
3946 zdiv_zmult_self2 -> div_mult_self1_is_id
3947 zdvd_triv_left -> dvd_triv_left
3948 zdvd_triv_right -> dvd_triv_right
3949 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
3950 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
3951 zmod_zadd_left_eq -> mod_add_left_eq
3952 zmod_zadd_right_eq -> mod_add_right_eq
3953 zmod_zadd_self1 -> mod_add_self1
3954 zmod_zadd_self2 -> mod_add_self2
3955 zmod_zadd1_eq -> mod_add_eq
3956 zmod_zdiff1_eq -> mod_diff_eq
3957 zmod_zdvd_zmod -> mod_mod_cancel
3958 zmod_zmod_cancel -> mod_mod_cancel
3959 zmod_zmult_self1 -> mod_mult_self2_is_0
3960 zmod_zmult_self2 -> mod_mult_self1_is_0
3963 zdvd_abs1 -> abs_dvd_iff
3964 zdvd_abs2 -> dvd_abs_iff
3965 zdvd_refl -> dvd_refl
3966 zdvd_trans -> dvd_trans
3967 zdvd_zadd -> dvd_add
3968 zdvd_zdiff -> dvd_diff
3969 zdvd_zminus_iff -> dvd_minus_iff
3970 zdvd_zminus2_iff -> minus_dvd_iff
3971 zdvd_zmultD -> dvd_mult_right
3972 zdvd_zmultD2 -> dvd_mult_left
3973 zdvd_zmult_mono -> mult_dvd_mono
3974 zdvd_0_right -> dvd_0_right
3975 zdvd_0_left -> dvd_0_left_iff
3976 zdvd_1_left -> one_dvd
3977 zminus_dvd_iff -> minus_dvd_iff
3979 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
3981 * The real numbers offer decimal input syntax: 12.34 is translated
3982 into 1234/10^2. This translation is not reversed upon output.
3984 * Theory Library/Polynomial defines an abstract type 'a poly of
3985 univariate polynomials with coefficients of type 'a. In addition to
3986 the standard ring operations, it also supports div and mod. Code
3987 generation is also supported, using list-style constructors.
3989 * Theory Library/Inner_Product defines a class of real_inner for real
3990 inner product spaces, with an overloaded operation inner :: 'a => 'a
3991 => real. Class real_inner is a subclass of real_normed_vector from
3994 * Theory Library/Product_Vector provides instances for the product
3995 type 'a * 'b of several classes from RealVector and Inner_Product.
3996 Definitions of addition, subtraction, scalar multiplication, norms,
3997 and inner products are included.
3999 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
4000 addition to the field operations, numerals and case syntax are also
4003 * Theory Library/Diagonalize provides constructive version of Cantor's
4004 first diagonalization argument.
4006 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
4007 zlcm (for int); carried together from various gcd/lcm developements in
4008 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
4009 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
4010 may recover tupled syntax as follows:
4012 hide (open) const gcd
4013 abbreviation gcd where
4014 "gcd == (%(a, b). GCD.gcd a b)"
4016 GCD.gcd ("gcd '(_, _')")
4018 The same works for lcm, zgcd, zlcm.
4020 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
4021 instantiations for algebraic structures. Removed some duplicate
4022 theorems. Changes in simp rules. INCOMPATIBILITY.
4024 * ML antiquotation @{code} takes a constant as argument and generates
4025 corresponding code in background and inserts name of the corresponding
4026 resulting ML value/function/datatype constructor binding in place.
4027 All occurrences of @{code} with a single ML block are generated
4028 simultaneously. Provides a generic and safe interface for
4029 instrumentalizing code generation. See
4030 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
4031 In future you ought to refrain from ad-hoc compiling generated SML
4032 code on the ML toplevel. Note that (for technical reasons) @{code}
4033 cannot refer to constants for which user-defined serializations are
4034 set. Refer to the corresponding ML counterpart directly in that
4037 * Command 'rep_datatype': instead of theorem names the command now
4038 takes a list of terms denoting the constructors of the type to be
4039 represented as datatype. The characteristic theorems have to be
4040 proven. INCOMPATIBILITY. Also observe that the following theorems
4041 have disappeared in favour of existing ones:
4043 unit_induct ~> unit.induct
4044 prod_induct ~> prod.induct
4045 sum_induct ~> sum.induct
4046 Suc_Suc_eq ~> nat.inject
4047 Suc_not_Zero Zero_not_Suc ~> nat.distinct
4052 * New locales for orders and lattices where the equivalence relation
4053 is not restricted to equality. INCOMPATIBILITY: all order and lattice
4054 locales use a record structure with field eq for the equivalence.
4056 * New theory of factorial domains.
4058 * Units_l_inv and Units_r_inv are now simp rules by default.
4059 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
4060 and/or r_inv will now also require deletion of these lemmas.
4062 * Renamed the following theorems, INCOMPATIBILITY:
4064 UpperD ~> Upper_memD
4065 LowerD ~> Lower_memD
4066 least_carrier ~> least_closed
4067 greatest_carrier ~> greatest_closed
4068 greatest_Lower_above ~> greatest_Lower_below
4069 one_zero ~> carrier_one_zero
4070 one_not_zero ~> carrier_one_not_zero (collision with assumption)
4075 * Nominal datatypes can now contain type-variables.
4077 * Commands 'nominal_inductive' and 'equivariance' work with local
4080 * Nominal primrec can now works with local theory targets and its
4081 specification syntax now conforms to the general format as seen in
4084 * Method "perm_simp" honours the standard simplifier attributes
4085 (no_asm), (no_asm_use) etc.
4087 * The new predicate #* is defined like freshness, except that on the
4088 left hand side can be a set or list of atoms.
4090 * Experimental command 'nominal_inductive2' derives strong induction
4091 principles for inductive definitions. In contrast to
4092 'nominal_inductive', which can only deal with a fixed number of
4093 binders, it can deal with arbitrary expressions standing for sets of
4094 atoms to be avoided. The only inductive definition we have at the
4095 moment that needs this generalisation is the typing rule for Lets in
4098 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
4099 -----------------------------------------------------------------
4100 Gamma |- Let x be t1 in t2 : T2
4102 In this rule one wants to avoid all the binders that are introduced by
4103 "close Gamma T1". We are looking for other examples where this
4104 feature might be useful. Please let us know.
4109 * Reimplemented the simplification procedure for proving continuity
4110 subgoals. The new simproc is extensible; users can declare additional
4111 continuity introduction rules with the attribute [cont2cont].
4113 * The continuity simproc now uses a different introduction rule for
4114 solving continuity subgoals on terms with lambda abstractions. In
4115 some rare cases the new simproc may fail to solve subgoals that the
4116 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
4117 Potential INCOMPATIBILITY.
4119 * Command 'fixrec': specification syntax now conforms to the general
4120 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
4121 examples. INCOMPATIBILITY.
4126 * Proof of Zorn's Lemma for partial orders.
4131 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
4132 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
4133 depends on multithreading, so timouts will not work before Poly/ML
4136 * High-level support for concurrent ML programming, see
4137 src/Pure/Cuncurrent. The data-oriented model of "future values" is
4138 particularly convenient to organize independent functional
4139 computations. The concept of "synchronized variables" provides a
4140 higher-order interface for components with shared state, avoiding the
4141 delicate details of mutexes and condition variables. (Requires
4142 Poly/ML 5.2.1 or later.)
4144 * ML bindings produced via Isar commands are stored within the Isar
4145 context (theory or proof). Consequently, commands like 'use' and 'ML'
4146 become thread-safe and work with undo as expected (concerning
4147 top-level bindings, not side-effects on global references).
4148 INCOMPATIBILITY, need to provide proper Isar context when invoking the
4149 compiler at runtime; really global bindings need to be given outside a
4150 theory. (Requires Poly/ML 5.2 or later.)
4152 * Command 'ML_prf' is analogous to 'ML' but works within a proof
4153 context. Top-level ML bindings are stored within the proof context in
4154 a purely sequential fashion, disregarding the nested proof structure.
4155 ML bindings introduced by 'ML_prf' are discarded at the end of the
4156 proof. (Requires Poly/ML 5.2 or later.)
4158 * Simplified ML attribute and method setup, cf. functions Attrib.setup
4159 and Method.setup, as well as Isar commands 'attribute_setup' and
4160 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
4161 existing code accordingly, or use plain 'setup' together with old
4164 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
4165 to 'a -> thm, while results are always tagged with an authentic oracle
4166 name. The Isar command 'oracle' is now polymorphic, no argument type
4167 is specified. INCOMPATIBILITY, need to simplify existing oracle code
4168 accordingly. Note that extra performance may be gained by producing
4169 the cterm carefully, avoiding slow Thm.cterm_of.
4171 * Simplified interface for defining document antiquotations via
4172 ThyOutput.antiquotation, ThyOutput.output, and optionally
4173 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
4174 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
4177 * More systematic treatment of long names, abstract name bindings, and
4178 name space operations. Basic operations on qualified names have been
4179 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
4180 Long_Name.append. Old type bstring has been mostly replaced by
4181 abstract type binding (see structure Binding), which supports precise
4182 qualification by packages and local theory targets, as well as proper
4183 tracking of source positions. INCOMPATIBILITY, need to wrap old
4184 bstring values into Binding.name, or better pass through abstract
4185 bindings everywhere. See further src/Pure/General/long_name.ML,
4186 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
4188 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
4189 LocalTheory.note etc.) now refer to the *full* internal name, not the
4190 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
4192 * Disposed old type and term read functions (Sign.read_def_typ,
4193 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
4194 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
4195 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
4196 Syntax.read_term_global etc.; see also OldGoals.read_term as last
4197 resort for legacy applications.
4199 * Disposed old declarations, tactics, tactic combinators that refer to
4200 the simpset or claset of an implicit theory (such as Addsimps,
4201 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
4202 embedded ML text, or local_simpset_of with a proper context passed as
4203 explicit runtime argument.
4205 * Rules and tactics that read instantiations (read_instantiate,
4206 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
4207 context, which is required for parsing and type-checking. Moreover,
4208 the variables are specified as plain indexnames, not string encodings
4209 thereof. INCOMPATIBILITY.
4211 * Generic Toplevel.add_hook interface allows to analyze the result of
4212 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
4213 for theorem dependency output of transactions resulting in a new
4216 * ML antiquotations: block-structured compilation context indicated by
4217 \<lbrace> ... \<rbrace>; additional antiquotation forms:
4219 @{binding name} - basic name binding
4220 @{let ?pat = term} - term abbreviation (HO matching)
4221 @{note name = fact} - fact abbreviation
4222 @{thm fact} - singleton fact (with attributes)
4223 @{thms fact} - general fact (with attributes)
4224 @{lemma prop by method} - singleton goal
4225 @{lemma prop by meth1 meth2} - singleton goal
4226 @{lemma prop1 ... propN by method} - general goal
4227 @{lemma prop1 ... propN by meth1 meth2} - general goal
4228 @{lemma (open) ...} - open derivation
4233 * The Isabelle "emacs" tool provides a specific interface to invoke
4234 Proof General / Emacs, with more explicit failure if that is not
4235 installed (the old isabelle-interface script silently falls back on
4236 isabelle-process). The PROOFGENERAL_HOME setting determines the
4237 installation location of the Proof General distribution.
4239 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
4240 the Isabelle process into a JVM/Scala application. See
4241 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
4242 process wrapper has been discontinued.)
4244 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
4246 * Various status messages (with exact source position information) are
4247 emitted, if proper markup print mode is enabled. This allows
4248 user-interface components to provide detailed feedback on internal
4253 New in Isabelle2008 (June 2008)
4254 -------------------------------
4258 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
4259 and updated, with formally checked references as hyperlinks.
4261 * Theory loader: use_thy (and similar operations) no longer set the
4262 implicit ML context, which was occasionally hard to predict and in
4263 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
4264 provides a proper context already.
4266 * Theory loader: old-style ML proof scripts being *attached* to a thy
4267 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
4268 'use' within a theory file will do the job.
4270 * Name space merge now observes canonical order, i.e. the second space
4271 is inserted into the first one, while existing entries in the first
4272 space take precedence. INCOMPATIBILITY in rare situations, may try to
4273 swap theory imports.
4275 * Syntax: symbol \<chi> is now considered a letter. Potential
4276 INCOMPATIBILITY in identifier syntax etc.
4278 * Outer syntax: string tokens no longer admit escaped white space,
4279 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
4280 white space without escapes.
4282 * Outer syntax: string tokens may contain arbitrary character codes
4283 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
4289 * Context-dependent token translations. Default setup reverts locally
4290 fixed variables, and adds hilite markup for undeclared frees.
4292 * Unused theorems can be found using the new command 'unused_thms'.
4293 There are three ways of invoking it:
4296 Only finds unused theorems in the current theory.
4298 (2) unused_thms thy_1 ... thy_n -
4299 Finds unused theorems in the current theory and all of its ancestors,
4300 excluding the theories thy_1 ... thy_n and all of their ancestors.
4302 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
4303 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
4304 their ancestors, excluding the theories thy_1 ... thy_n and all of
4307 In order to increase the readability of the list produced by
4308 unused_thms, theorems that have been created by a particular instance
4309 of a theory command such as 'inductive' or 'function' are considered
4310 to belong to the same "group", meaning that if at least one theorem in
4311 this group is used, the other theorems in the same group are no longer
4312 reported as unused. Moreover, if all theorems in the group are
4313 unused, only one theorem in the group is displayed.
4315 Note that proof objects have to be switched on in order for
4316 unused_thms to work properly (i.e. !proofs must be >= 1, which is
4317 usually the case when using Proof General with the default settings).
4319 * Authentic naming of facts disallows ad-hoc overwriting of previous
4320 theorems within the same name space. INCOMPATIBILITY, need to remove
4321 duplicate fact bindings, or even accidental fact duplications. Note
4322 that tools may maintain dynamically scoped facts systematically, using
4323 PureThy.add_thms_dynamic.
4325 * Command 'hide' now allows to hide from "fact" name space as well.
4327 * Eliminated destructive theorem database, simpset, claset, and
4328 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
4329 update of theories within ML code.
4331 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
4332 INCOMPATIBILITY, object-logics depending on former Pure require
4333 additional setup PureThy.old_appl_syntax_setup; object-logics
4334 depending on former CPure need to refer to Pure.
4336 * Commands 'use' and 'ML' are now purely functional, operating on
4337 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
4338 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
4341 * Command 'setup': discontinued implicit version with ML reference.
4343 * Instantiation target allows for simultaneous specification of class
4344 instance operations together with an instantiation proof.
4345 Type-checking phase allows to refer to class operations uniformly.
4346 See src/HOL/Complex/Complex.thy for an Isar example and
4347 src/HOL/Library/Eval.thy for an ML example.
4349 * Indexing of literal facts: be more serious about including only
4350 facts from the visible specification/proof context, but not the
4351 background context (locale etc.). Affects `prop` notation and method
4352 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
4355 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
4356 "(open)" option, which used to expose internal bound variables to the
4359 * Isar statements: removed obsolete case "rule_context".
4360 INCOMPATIBILITY, better use explicit fixes/assumes.
4362 * Locale proofs: default proof step now includes 'unfold_locales';
4363 hence 'proof' without argument may be used to unfold locale
4367 *** Document preparation ***
4369 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
4370 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
4371 obsolete thumbpdf setup (contemporary PDF viewers do this on the
4372 spot); renamed link color from "darkblue" to "linkcolor" (default
4373 value unchanged, can be redefined via \definecolor); no longer sets
4374 "a4paper" option (unnecessary or even intrusive).
4376 * Antiquotation @{lemma A method} proves proposition A by the given
4377 method (either a method name or a method name plus (optional) method
4378 arguments in parentheses) and prints A just like @{prop A}.
4383 * New primrec package. Specification syntax conforms in style to
4384 definition/function/.... No separate induction rule is provided. The
4385 "primrec" command distinguishes old-style and new-style specifications
4386 by syntax. The former primrec package is now named OldPrimrecPackage.
4387 When adjusting theories, beware: constants stemming from new-style
4388 primrec specifications have authentic syntax.
4390 * Metis prover is now an order of magnitude faster, and also works
4391 with multithreading.
4393 * Metis: the maximum number of clauses that can be produced from a
4394 theorem is now given by the attribute max_clauses. Theorems that
4395 exceed this number are ignored, with a warning printed.
4397 * Sledgehammer no longer produces structured proofs by default. To
4398 enable, declare [[sledgehammer_full = true]]. Attributes
4399 reconstruction_modulus, reconstruction_sorts renamed
4400 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
4402 * Method "induct_scheme" derives user-specified induction rules
4403 from well-founded induction and completeness of patterns. This factors
4404 out some operations that are done internally by the function package
4405 and makes them available separately. See
4406 src/HOL/ex/Induction_Scheme.thy for examples.
4408 * More flexible generation of measure functions for termination
4409 proofs: Measure functions can be declared by proving a rule of the
4410 form "is_measure f" and giving it the [measure_function] attribute.
4411 The "is_measure" predicate is logically meaningless (always true), and
4412 just guides the heuristic. To find suitable measure functions, the
4413 termination prover sets up the goal "is_measure ?f" of the appropriate
4414 type and generates all solutions by prolog-style backwards proof using
4417 This setup also deals with rules like
4419 "is_measure f ==> is_measure (list_size f)"
4421 which accommodates nested datatypes that recurse through lists.
4422 Similar rules are predeclared for products and option types.
4424 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
4428 - Definitions of overloaded constants on sets have to be replaced by
4429 definitions on => and bool.
4431 - Some definitions of overloaded operators on sets can now be proved
4432 using the definitions of the operators on => and bool. Therefore,
4433 the following theorems have been renamed:
4435 subset_def -> subset_eq
4436 psubset_def -> psubset_eq
4437 set_diff_def -> set_diff_eq
4438 Compl_def -> Compl_eq
4439 Sup_set_def -> Sup_set_eq
4440 Inf_set_def -> Inf_set_eq
4441 sup_set_def -> sup_set_eq
4442 inf_set_def -> inf_set_eq
4444 - Due to the incompleteness of the HO unification algorithm, some
4445 rules such as subst may require manual instantiation, if some of
4446 the unknowns in the rule is a set.
4448 - Higher order unification and forward proofs:
4451 have "P (S::'a set)" <...>
4452 then have "EX S. P S" ..
4454 no longer works (due to the incompleteness of the HO unification
4455 algorithm) and must be replaced by the pattern
4462 - Calculational reasoning with subst (or similar rules):
4465 have "P (S::'a set)" <...>
4466 also have "S = T" <...>
4467 finally have "P T" .
4469 no longer works (for similar reasons as the previous example) and
4470 must be replaced by something like
4472 have "P (S::'a set)" <...>
4473 moreover have "S = T" <...>
4474 ultimately have "P T" by simp
4476 - Tactics or packages written in ML code:
4477 Code performing pattern matching on types via
4479 Type ("set", [T]) => ...
4481 must be rewritten. Moreover, functions like strip_type or
4482 binder_types no longer return the right value when applied to a
4485 T1 => ... => Tn => U => bool
4489 T1 => ... => Tn => U set
4491 * Merged theories Wellfounded_Recursion, Accessible_Part and
4492 Wellfounded_Relations to theory Wellfounded.
4494 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
4496 * Class finite no longer treats UNIV as class parameter. Use class
4497 enum from theory Library/Enum instead to achieve a similar effect.
4500 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
4501 and "Cons". INCOMPATIBILITY.
4503 * HOL (and FOL): renamed variables in rules imp_elim and swap.
4504 Potential INCOMPATIBILITY.
4506 * Theory Product_Type: duplicated lemmas split_Pair_apply and
4507 injective_fst_snd removed, use split_eta and prod_eqI instead.
4508 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
4510 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
4511 the same name in theory Orderings:
4521 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
4522 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
4523 and different variable names.
4525 * Library/Option_ord.thy: Canonical order on option type.
4527 * Library/RBT.thy: Red-black trees, an efficient implementation of
4530 * Library/Countable.thy: Type class for countable types.
4532 * Theory Int: The representation of numerals has changed. The infix
4533 operator BIT and the bit datatype with constructors B0 and B1 have
4534 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
4535 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
4536 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
4539 * Theory Nat: definition of <= and < on natural numbers no longer
4540 depend on well-founded relations. INCOMPATIBILITY. Definitions
4541 le_def and less_def have disappeared. Consider lemmas not_less
4542 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
4544 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
4545 (whose purpose mainly is for various fold_set functionals) have been
4546 abandoned in favor of the existing algebraic classes
4547 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
4548 lower_semilattice (resp. upper_semilattice) and linorder.
4551 * Theory Transitive_Closure: induct and cases rules now declare proper
4552 case_names ("base" and "step"). INCOMPATIBILITY.
4554 * Theorem Inductive.lfp_ordinal_induct generalized to complete
4555 lattices. The form set-specific version is available as
4556 Inductive.lfp_ordinal_induct_set.
4558 * Renamed theorems "power.simps" to "power_int.simps".
4561 * Class semiring_div provides basic abstract properties of semirings
4562 with division and modulo operations. Subsumes former class dvd_mod.
4564 * Merged theories IntDef, Numeral and IntArith into unified theory
4565 Int. INCOMPATIBILITY.
4567 * Theory Library/Code_Index: type "index" now represents natural
4568 numbers rather than integers. INCOMPATIBILITY.
4570 * New class "uminus" with operation "uminus" (split of from class
4571 "minus" which now only has operation "minus", binary).
4574 * Constants "card", "internal_split", "option_map" now with authentic
4575 syntax. INCOMPATIBILITY.
4577 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
4578 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
4579 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
4580 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
4581 Sup_set_def, le_def, less_def, option_map_def now with object
4582 equality. INCOMPATIBILITY.
4584 * Records. Removed K_record, and replaced it by pure lambda term
4585 %x. c. The simplifier setup is now more robust against eta expansion.
4586 INCOMPATIBILITY: in cases explicitly referring to K_record.
4588 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
4590 * Library/ListVector: new theory of arithmetic vector operations.
4592 * Library/Order_Relation: new theory of various orderings as sets of
4593 pairs. Defines preorders, partial orders, linear orders and
4594 well-orders on sets and on types.
4599 * Renamed some theories to allow to loading both ZF and HOL in the
4602 Datatype -> Datatype_ZF
4603 Inductive -> Inductive_ZF
4610 INCOMPATIBILITY: ZF theories that import individual theories below
4611 Main might need to be adapted. Regular theory Main is still
4612 available, as trivial extension of Main_ZF.
4617 * ML within Isar: antiquotation @{const name} or @{const
4618 name(typargs)} produces statically-checked Const term.
4620 * Functor NamedThmsFun: data is available to the user as dynamic fact
4621 (of the same name). Removed obsolete print command.
4623 * Removed obsolete "use_legacy_bindings" function.
4625 * The ``print mode'' is now a thread-local value derived from a global
4626 template (the former print_mode reference), thus access becomes
4627 non-critical. The global print_mode reference is for session
4628 management only; user-code should use print_mode_value,
4629 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
4631 * Functions system/system_out provide a robust way to invoke external
4632 shell commands, with propagation of interrupts (requires Poly/ML
4633 5.2.1). Do not use OS.Process.system etc. from the basis library!
4638 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
4639 in accordance with Proof General 3.7, which prefers GNU emacs.
4641 * isatool tty runs Isabelle process with plain tty interaction;
4642 optional line editor may be specified via ISABELLE_LINE_EDITOR
4643 setting, the default settings attempt to locate "ledit" and "rlwrap".
4645 * isatool browser now works with Cygwin as well, using general
4646 "javapath" function defined in Isabelle process environment.
4648 * YXML notation provides a simple and efficient alternative to
4649 standard XML transfer syntax. See src/Pure/General/yxml.ML and
4650 isatool yxml as described in the Isabelle system manual.
4652 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
4653 provides general wrapper for managing an Isabelle process in a robust
4654 fashion, with ``cooked'' output from stdin/stderr.
4656 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
4657 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
4659 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
4660 way of changing the user's settings is via
4661 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
4664 * Multithreading.max_threads := 0 refers to the number of actual CPU
4665 cores of the underlying machine, which is a good starting point for
4666 optimal performance tuning. The corresponding usedir option -M allows
4667 "max" as an alias for "0". WARNING: does not work on certain versions
4668 of Mac OS (with Poly/ML 5.1).
4670 * isabelle-process: non-ML sessions are run with "nice", to reduce the
4671 adverse effect of Isabelle flooding interactive front-ends (notably
4672 ProofGeneral / XEmacs).
4676 New in Isabelle2007 (November 2007)
4677 -----------------------------------
4681 * More uniform information about legacy features, notably a
4682 warning/error of "Legacy feature: ...", depending on the state of the
4683 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
4684 legacy features will disappear eventually.
4686 * Theory syntax: the header format ``theory A = B + C:'' has been
4687 discontinued in favour of ``theory A imports B C begin''. Use isatool
4688 fixheaders to convert existing theory files. INCOMPATIBILITY.
4690 * Theory syntax: the old non-Isar theory file format has been
4691 discontinued altogether. Note that ML proof scripts may still be used
4692 with Isar theories; migration is usually quite simple with the ML
4693 function use_legacy_bindings. INCOMPATIBILITY.
4695 * Theory syntax: some popular names (e.g. 'class', 'declaration',
4696 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
4699 * Theory loader: be more serious about observing the static theory
4700 header specifications (including optional directories), but not the
4701 accidental file locations of previously successful loads. The strict
4702 update policy of former update_thy is now already performed by
4703 use_thy, so the former has been removed; use_thys updates several
4704 theories simultaneously, just as 'imports' within a theory header
4705 specification, but without merging the results. Potential
4706 INCOMPATIBILITY: may need to refine theory headers and commands
4707 ROOT.ML which depend on load order.
4709 * Theory loader: optional support for content-based file
4710 identification, instead of the traditional scheme of full physical
4711 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
4712 (cf. the system manual). The new scheme allows to work with
4713 non-finished theories in persistent session images, such that source
4714 files may be moved later on without requiring reloads.
4716 * Theory loader: old-style ML proof scripts being *attached* to a thy
4717 file (with the same base name as the theory) are considered a legacy
4718 feature, which will disappear eventually. Even now, the theory loader
4719 no longer maintains dependencies on such files.
4721 * Syntax: the scope for resolving ambiguities via type-inference is
4722 now limited to individual terms, instead of whole simultaneous
4723 specifications as before. This greatly reduces the complexity of the
4724 syntax module and improves flexibility by separating parsing and
4725 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
4726 'fixes' etc.) are required in rare situations.
4728 * Syntax: constants introduced by new-style packages ('definition',
4729 'abbreviation' etc.) are passed through the syntax module in
4730 ``authentic mode''. This means that associated mixfix annotations
4731 really stick to such constants, independently of potential name space
4732 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
4733 trees are represented slightly differently, may need to adapt syntax
4734 translations accordingly. Use CONST marker in 'translations' and
4735 @{const_syntax} antiquotation in 'parse_translation' etc.
4737 * Legacy goal package: reduced interface to the bare minimum required
4738 to keep existing proof scripts running. Most other user-level
4739 functions are now part of the OldGoals structure, which is *not* open
4740 by default (consider isatool expandshort before open OldGoals).
4741 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
4742 these tend to cause confusion about the actual goal (!) context being
4743 used here, which is not necessarily the same as the_context().
4745 * Command 'find_theorems': supports "*" wild-card in "name:"
4746 criterion; "with_dups" option. Certain ProofGeneral versions might
4747 support a specific search form (see ProofGeneral/CHANGES).
4749 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
4750 by default, which means that "prems" (and also "fixed variables") are
4751 suppressed from proof state output. Note that the ProofGeneral
4752 settings mechanism allows to change and save options persistently, but
4753 older versions of Isabelle will fail to start up if a negative prems
4756 * Local theory targets may be specified by non-nested blocks of
4757 ``context/locale/class ... begin'' followed by ``end''. The body may
4758 contain definitions, theorems etc., including any derived mechanism
4759 that has been implemented on top of these primitives. This concept
4760 generalizes the existing ``theorem (in ...)'' towards more versatility
4763 * Proof General interface: proper undo of final 'end' command;
4764 discontinued Isabelle/classic mode (ML proof scripts).
4767 *** Document preparation ***
4769 * Added antiquotation @{theory name} which prints the given name,
4770 after checking that it refers to a valid ancestor theory in the
4773 * Added antiquotations @{ML_type text} and @{ML_struct text} which
4774 check the given source text as ML type/structure, printing verbatim.
4776 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
4777 "c args == rhs" given in the current context. (Any number of
4778 arguments may be given on the LHS.)
4783 * The 'class' package offers a combination of axclass and locale to
4784 achieve Haskell-like type classes in Isabelle. Definitions and
4785 theorems within a class context produce both relative results (with
4786 implicit parameters according to the locale context), and polymorphic
4787 constants with qualified polymorphism (according to the class
4788 context). Within the body context of a 'class' target, a separate
4789 syntax layer ("user space type system") takes care of converting
4790 between global polymorphic consts and internal locale representation.
4791 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
4792 "isatool doc classes" provides a tutorial.
4794 * Generic code generator framework allows to generate executable
4795 code for ML and Haskell (including Isabelle classes). A short usage
4798 internal compilation:
4799 export_code <list of constants (term syntax)> in SML
4800 writing SML code to a file:
4801 export_code <list of constants (term syntax)> in SML <filename>
4802 writing OCaml code to a file:
4803 export_code <list of constants (term syntax)> in OCaml <filename>
4804 writing Haskell code to a bunch of files:
4805 export_code <list of constants (term syntax)> in Haskell <filename>
4807 evaluating closed propositions to True/False using code generation:
4810 Reasonable default setup of framework in HOL.
4812 Theorem attributs for selecting and transforming function equations theorems:
4814 [code fun]: select a theorem as function equation for a specific constant
4815 [code fun del]: deselect a theorem as function equation for a specific constant
4816 [code inline]: select an equation theorem for unfolding (inlining) in place
4817 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
4819 User-defined serializations (target in {SML, OCaml, Haskell}):
4821 code_const <and-list of constants (term syntax)>
4822 {(target) <and-list of const target syntax>}+
4824 code_type <and-list of type constructors>
4825 {(target) <and-list of type target syntax>}+
4827 code_instance <and-list of instances>
4829 where instance ::= <type constructor> :: <class>
4831 code_class <and_list of classes>
4832 {(target) <and-list of class target syntax>}+
4833 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
4835 code_instance and code_class only are effective to target Haskell.
4837 For example usage see src/HOL/ex/Codegenerator.thy and
4838 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
4839 generation from Isabelle/HOL theories is available via "isatool doc
4842 * Code generator: consts in 'consts_code' Isar commands are now
4843 referred to by usual term syntax (including optional type
4846 * Command 'no_translations' removes translation rules from theory
4849 * Overloaded definitions are now actually checked for acyclic
4850 dependencies. The overloading scheme is slightly more general than
4851 that of Haskell98, although Isabelle does not demand an exact
4852 correspondence to type class and instance declarations.
4853 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
4854 exotic versions of overloading -- at the discretion of the user!
4856 Polymorphic constants are represented via type arguments, i.e. the
4857 instantiation that matches an instance against the most general
4858 declaration given in the signature. For example, with the declaration
4859 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
4860 as c(nat). Overloading is essentially simultaneous structural
4861 recursion over such type arguments. Incomplete specification patterns
4862 impose global constraints on all occurrences, e.g. c('a * 'a) on the
4863 LHS means that more general c('a * 'b) will be disallowed on any RHS.
4864 Command 'print_theory' outputs the normalized system of recursive
4865 equations, see section "definitions".
4867 * Configuration options are maintained within the theory or proof
4868 context (with name and type bool/int/string), providing a very simple
4869 interface to a poor-man's version of general context data. Tools may
4870 declare options in ML (e.g. using Attrib.config_int) and then refer to
4871 these values using Config.get etc. Users may change options via an
4872 associated attribute of the same name. This form of context
4873 declaration works particularly well with commands 'declare' or
4874 'using', for example ``declare [[foo = 42]]''. Thus it has become
4875 very easy to avoid global references, which would not observe Isar
4876 toplevel undo/redo and fail to work with multithreading.
4878 Various global ML references of Pure and HOL have been turned into
4879 configuration options:
4881 Unify.search_bound unify_search_bound
4882 Unify.trace_bound unify_trace_bound
4883 Unify.trace_simp unify_trace_simp
4884 Unify.trace_types unify_trace_types
4885 Simplifier.simp_depth_limit simp_depth_limit
4886 Blast.depth_limit blast_depth_limit
4887 DatatypeProp.dtK datatype_distinctness_limit
4888 fast_arith_neq_limit fast_arith_neq_limit
4889 fast_arith_split_limit fast_arith_split_limit
4891 * Named collections of theorems may be easily installed as context
4892 data using the functor NamedThmsFun (see also
4893 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
4894 attributes; there is also a toplevel print command. This facility is
4895 just a common case of general context data, which is the preferred way
4896 for anything more complex than just a list of facts in canonical
4899 * Isar: command 'declaration' augments a local theory by generic
4900 declaration functions written in ML. This enables arbitrary content
4901 being added to the context, depending on a morphism that tells the
4902 difference of the original declaration context wrt. the application
4903 context encountered later on.
4905 * Isar: proper interfaces for simplification procedures. Command
4906 'simproc_setup' declares named simprocs (with match patterns, and body
4907 text in ML). Attribute "simproc" adds/deletes simprocs in the current
4908 context. ML antiquotation @{simproc name} retrieves named simprocs.
4910 * Isar: an extra pair of brackets around attribute declarations
4911 abbreviates a theorem reference involving an internal dummy fact,
4912 which will be ignored later --- only the effect of the attribute on
4913 the background context will persist. This form of in-place
4914 declarations is particularly useful with commands like 'declare' and
4915 'using', for example ``have A using [[simproc a]] by simp''.
4917 * Isar: method "assumption" (and implicit closing of subproofs) now
4918 takes simple non-atomic goal assumptions into account: after applying
4919 an assumption as a rule the resulting subgoals are solved by atomic
4920 assumption steps. This is particularly useful to finish 'obtain'
4921 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
4922 without referring to the original premise "!!x. P x ==> thesis" in the
4923 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
4926 * Isar: implicit use of prems from the Isar proof context is
4927 considered a legacy feature. Common applications like ``have A .''
4928 may be replaced by ``have A by fact'' or ``note `A`''. In general,
4929 referencing facts explicitly here improves readability and
4930 maintainability of proof texts.
4932 * Isar: improper proof element 'guess' is like 'obtain', but derives
4933 the obtained context from the course of reasoning! For example:
4935 assume "EX x y. A x & B y" -- "any previous fact"
4936 then guess x and y by clarify
4938 This technique is potentially adventurous, depending on the facts and
4939 proof tools being involved here.
4941 * Isar: known facts from the proof context may be specified as literal
4942 propositions, using ASCII back-quote syntax. This works wherever
4943 named facts used to be allowed so far, in proof commands, proof
4944 methods, attributes etc. Literal facts are retrieved from the context
4945 according to unification of type and term parameters. For example,
4946 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
4947 theorems in the current context, then these are valid literal facts:
4948 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
4950 There is also a proof method "fact" which does the same composition
4951 for explicit goal states, e.g. the following proof texts coincide with
4952 certain special cases of literal facts:
4954 have "A" by fact == note `A`
4955 have "A ==> B" by fact == note `A ==> B`
4956 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
4957 have "P a ==> Q a" by fact == note `P a ==> Q a`
4959 * Isar: ":" (colon) is no longer a symbolic identifier character in
4960 outer syntax. Thus symbolic identifiers may be used without
4961 additional white space in declarations like this: ``assume *: A''.
4963 * Isar: 'print_facts' prints all local facts of the current context,
4964 both named and unnamed ones.
4966 * Isar: 'def' now admits simultaneous definitions, e.g.:
4968 def x == "t" and y == "u"
4970 * Isar: added command 'unfolding', which is structurally similar to
4971 'using', but affects both the goal state and facts by unfolding given
4972 rewrite rules. Thus many occurrences of the 'unfold' method or
4973 'unfolded' attribute may be replaced by first-class proof text.
4975 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
4976 and command 'unfolding' now all support object-level equalities
4977 (potentially conditional). The underlying notion of rewrite rule is
4978 analogous to the 'rule_format' attribute, but *not* that of the
4979 Simplifier (which is usually more generous).
4981 * Isar: the new attribute [rotated n] (default n = 1) rotates the
4982 premises of a theorem by n. Useful in conjunction with drule.
4984 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
4985 method expression within a sandbox consisting of the first N
4986 sub-goals, which need to exist. For example, ``simp_all [3]''
4987 simplifies the first three sub-goals, while (rule foo, simp_all)[]
4988 simplifies all new goals that emerge from applying rule foo to the
4989 originally first one.
4991 * Isar: schematic goals are no longer restricted to higher-order
4992 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
4995 * Isar: the conclusion of a long theorem statement is now either
4996 'shows' (a simultaneous conjunction, as before), or 'obtains'
4997 (essentially a disjunction of cases with local parameters and
4998 assumptions). The latter allows to express general elimination rules
4999 adequately; in this notation common elimination rules look like this:
5001 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
5003 obtains x where "P x"
5005 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
5009 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
5015 The subsequent classical rules even refer to the formal "thesis"
5018 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
5021 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
5022 obtains "thesis ==> something"
5024 The actual proof of an 'obtains' statement is analogous to that of the
5025 Isar proof element 'obtain', only that there may be several cases.
5026 Optional case names may be specified in parentheses; these will be
5027 available both in the present proof and as annotations in the
5028 resulting rule, for later use with the 'cases' method (cf. attribute
5031 * Isar: the assumptions of a long theorem statement are available as
5032 "assms" fact in the proof context. This is more appropriate than the
5033 (historical) "prems", which refers to all assumptions of the current
5034 context, including those from the target locale, proof body etc.
5036 * Isar: 'print_statement' prints theorems from the current theory or
5037 proof context in long statement form, according to the syntax of a
5040 * Isar: 'obtain' takes an optional case name for the local context
5041 introduction rule (default "that").
5043 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
5044 explicit (is "_ ==> ?foo") in the rare cases where this still happens
5047 * Pure: syntax "CONST name" produces a fully internalized constant
5048 according to the current context. This is particularly useful for
5049 syntax translations that should refer to internal constant
5050 representations independently of name spaces.
5052 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
5053 instead of "FOO ". This allows multiple binder declarations to coexist
5054 in the same context. INCOMPATIBILITY.
5056 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
5057 primitive that also works in a locale context (both for constants and
5058 fixed variables). Type declaration and internal syntactic representation
5059 of given constants retrieved from the context. Likewise, the
5060 'no_notation' command allows to remove given syntax annotations from the
5063 * Isar/locales: new derived specification elements 'axiomatization',
5064 'definition', 'abbreviation', which support type-inference, admit
5065 object-level specifications (equality, equivalence). See also the
5066 isar-ref manual. Examples:
5069 eq (infix "===" 50) where
5070 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
5072 definition "f x y = x + y + 1"
5073 definition g where "g x = f x x"
5076 neq (infix "=!=" 50) where
5077 "x =!= y == ~ (x === y)"
5079 These specifications may be also used in a locale context. Then the
5080 constants being introduced depend on certain fixed parameters, and the
5081 constant name is qualified by the locale base name. An internal
5082 abbreviation takes care for convenient input and output, making the
5083 parameters implicit and using the original short name. See also
5084 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
5085 entities from a monomorphic theory.
5087 Presently, abbreviations are only available 'in' a target locale, but
5088 not inherited by general import expressions. Also note that
5089 'abbreviation' may be used as a type-safe replacement for 'syntax' +
5090 'translations' in common applications. The "no_abbrevs" print mode
5091 prevents folding of abbreviations in term output.
5093 Concrete syntax is attached to specified constants in internal form,
5094 independently of name spaces. The parse tree representation is
5095 slightly different -- use 'notation' instead of raw 'syntax', and
5096 'translations' with explicit "CONST" markup to accommodate this.
5098 * Pure/Isar: unified syntax for new-style specification mechanisms
5099 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
5100 full type inference and dummy patterns ("_"). For example:
5102 definition "K x _ = x"
5104 inductive conj for A B
5105 where "A ==> B ==> conj A B"
5107 * Pure: command 'print_abbrevs' prints all constant abbreviations of
5108 the current context. Print mode "no_abbrevs" prevents inversion of
5109 abbreviations on output.
5111 * Isar/locales: improved parameter handling: use of locales "var" and
5112 "struct" no longer necessary; - parameter renamings are no longer
5113 required to be injective. For example, this allows to define
5114 endomorphisms as locale endom = homom mult mult h.
5116 * Isar/locales: changed the way locales with predicates are defined.
5117 Instead of accumulating the specification, the imported expression is
5118 now an interpretation. INCOMPATIBILITY: different normal form of
5119 locale expressions. In particular, in interpretations of locales with
5120 predicates, goals repesenting already interpreted fragments are not
5121 removed automatically. Use methods `intro_locales' and
5122 `unfold_locales'; see below.
5124 * Isar/locales: new methods `intro_locales' and `unfold_locales'
5125 provide backward reasoning on locales predicates. The methods are
5126 aware of interpretations and discharge corresponding goals.
5127 `intro_locales' is less aggressive then `unfold_locales' and does not
5128 unfold predicates to assumptions.
5130 * Isar/locales: the order in which locale fragments are accumulated
5131 has changed. This enables to override declarations from fragments due
5132 to interpretations -- for example, unwanted simp rules.
5134 * Isar/locales: interpretation in theories and proof contexts has been
5135 extended. One may now specify (and prove) equations, which are
5136 unfolded in interpreted theorems. This is useful for replacing
5137 defined concepts (constants depending on locale parameters) by
5138 concepts already existing in the target context. Example:
5140 interpretation partial_order ["op <= :: [int, int] => bool"]
5141 where "partial_order.less (op <=) (x::int) y = (x < y)"
5143 Typically, the constant `partial_order.less' is created by a
5144 definition specification element in the context of locale
5147 * Method "induct": improved internal context management to support
5148 local fixes and defines on-the-fly. Thus explicit meta-level
5149 connectives !! and ==> are rarely required anymore in inductive goals
5150 (using object-logic connectives for this purpose has been long
5151 obsolete anyway). Common proof patterns are explained in
5152 src/HOL/Induct/Common_Patterns.thy, see also
5153 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
5156 * Method "induct": improved handling of simultaneous goals. Instead of
5157 introducing object-level conjunction, the statement is now split into
5158 several conclusions, while the corresponding symbolic cases are nested
5159 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
5160 see src/HOL/Induct/Common_Patterns.thy, for example.
5162 * Method "induct": mutual induction rules are now specified as a list
5163 of rule sharing the same induction cases. HOL packages usually provide
5164 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
5165 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
5166 mutual induction rules differently, i.e. like this:
5168 (induct rule: foo_bar.inducts)
5169 (induct set: foo bar)
5170 (induct pred: foo bar)
5171 (induct type: foo bar)
5173 The ML function ProjectRule.projections turns old-style rules into the
5176 * Method "coinduct": dual of induction, see
5177 src/HOL/Library/Coinductive_List.thy for various examples.
5179 * Method "cases", "induct", "coinduct": the ``(open)'' option is
5180 considered a legacy feature.
5182 * Attribute "symmetric" produces result with standardized schematic
5183 variables (index 0). Potential INCOMPATIBILITY.
5185 * Simplifier: by default the simplifier trace only shows top level
5186 rewrites now. That is, trace_simp_depth_limit is set to 1 by
5187 default. Thus there is less danger of being flooded by the trace. The
5188 trace indicates where parts have been suppressed.
5190 * Provers/classical: removed obsolete classical version of elim_format
5191 attribute; classical elim/dest rules are now treated uniformly when
5192 manipulating the claset.
5194 * Provers/classical: stricter checks to ensure that supplied intro,
5195 dest and elim rules are well-formed; dest and elim rules must have at
5198 * Provers/classical: attributes dest/elim/intro take an optional
5199 weight argument for the rule (just as the Pure versions). Weights are
5200 ignored by automated tools, but determine the search order of single
5203 * Syntax: input syntax now supports dummy variable binding "%_. b",
5204 where the body does not mention the bound variable. Note that dummy
5205 patterns implicitly depend on their context of bounds, which makes
5206 "{_. _}" match any set comprehension as expected. Potential
5207 INCOMPATIBILITY -- parse translations need to cope with syntactic
5208 constant "_idtdummy" in the binding position.
5210 * Syntax: removed obsolete syntactic constant "_K" and its associated
5211 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
5212 for example "A -> B" => "Pi A (%_. B)".
5214 * Pure: 'class_deps' command visualizes the subclass relation, using
5215 the graph browser tool.
5217 * Pure: 'print_theory' now suppresses certain internal declarations by
5218 default; use '!' option for full details.
5223 * Method "metis" proves goals by applying the Metis general-purpose
5224 resolution prover (see also http://gilith.com/software/metis/).
5225 Examples are in the directory MetisExamples. WARNING: the
5226 Isabelle/HOL-Metis integration does not yet work properly with
5229 * Command 'sledgehammer' invokes external automatic theorem provers as
5230 background processes. It generates calls to the "metis" method if
5231 successful. These can be pasted into the proof. Users do not have to
5232 wait for the automatic provers to return. WARNING: does not really
5233 work with multi-threading.
5235 * New "auto_quickcheck" feature tests outermost goal statements for
5236 potential counter-examples. Controlled by ML references
5237 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
5238 5000 milliseconds). Fails silently if statements is outside of
5239 executable fragment, or any other codgenerator problem occurs.
5241 * New constant "undefined" with axiom "undefined x = undefined".
5243 * Added class "HOL.eq", allowing for code generation with polymorphic
5246 * Some renaming of class constants due to canonical name prefixing in
5247 the new 'class' package:
5249 HOL.abs ~> HOL.abs_class.abs
5250 HOL.divide ~> HOL.divide_class.divide
5251 0 ~> HOL.zero_class.zero
5252 1 ~> HOL.one_class.one
5253 op + ~> HOL.plus_class.plus
5254 op - ~> HOL.minus_class.minus
5255 uminus ~> HOL.minus_class.uminus
5256 op * ~> HOL.times_class.times
5257 op < ~> HOL.ord_class.less
5258 op <= > HOL.ord_class.less_eq
5259 Nat.power ~> Power.power_class.power
5260 Nat.size ~> Nat.size_class.size
5261 Numeral.number_of ~> Numeral.number_class.number_of
5262 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
5263 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
5264 Orderings.min ~> Orderings.ord_class.min
5265 Orderings.max ~> Orderings.ord_class.max
5266 Divides.op div ~> Divides.div_class.div
5267 Divides.op mod ~> Divides.div_class.mod
5268 Divides.op dvd ~> Divides.div_class.dvd
5270 INCOMPATIBILITY. Adaptions may be required in the following cases:
5272 a) User-defined constants using any of the names "plus", "minus",
5273 "times", "less" or "less_eq". The standard syntax translations for
5274 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
5277 b) Variables named "plus", "minus", "times", "less", "less_eq"
5278 INCOMPATIBILITY: use more specific names.
5280 c) Permutative equations (e.g. "a + b = b + a")
5281 Since the change of names also changes the order of terms, permutative
5282 rewrite rules may get applied in a different order. Experience shows
5283 that this is rarely the case (only two adaptions in the whole Isabelle
5284 distribution). INCOMPATIBILITY: rewrite proofs
5286 d) ML code directly refering to constant names
5287 This in general only affects hand-written proof tactics, simprocs and
5288 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
5289 Consider using @{const_name} antiquotation.
5291 * New class "default" with associated constant "default".
5293 * Function "sgn" is now overloaded and available on int, real, complex
5294 (and other numeric types), using class "sgn". Two possible defs of
5295 sgn are given as equational assumptions in the classes sgn_if and
5296 sgn_div_norm; ordered_idom now also inherits from sgn_if.
5299 * Locale "partial_order" now unified with class "order" (cf. theory
5300 Orderings), added parameter "less". INCOMPATIBILITY.
5302 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
5303 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
5304 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
5306 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
5307 changed order of proof goals in instance proofs.
5309 * The transitivity reasoner for partial and linear orders is set up
5310 for classes "order" and "linorder". Instances of the reasoner are available
5311 in all contexts importing or interpreting the corresponding locales.
5312 Method "order" invokes the reasoner separately; the reasoner
5313 is also integrated with the Simplifier as a solver. Diagnostic
5314 command 'print_orders' shows the available instances of the reasoner
5315 in the current context.
5317 * Localized monotonicity predicate in theory "Orderings"; integrated
5318 lemmas max_of_mono and min_of_mono with this predicate.
5321 * Formulation of theorem "dense" changed slightly due to integration
5322 with new class dense_linear_order.
5324 * Uniform lattice theory development in HOL.
5326 constants "meet" and "join" now named "inf" and "sup"
5327 constant "Meet" now named "Inf"
5329 classes "meet_semilorder" and "join_semilorder" now named
5330 "lower_semilattice" and "upper_semilattice"
5331 class "lorder" now named "lattice"
5332 class "comp_lat" now named "complete_lattice"
5334 Instantiation of lattice classes allows explicit definitions
5335 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
5337 INCOMPATIBILITY. Theorem renames:
5339 meet_left_le ~> inf_le1
5340 meet_right_le ~> inf_le2
5341 join_left_le ~> sup_ge1
5342 join_right_le ~> sup_ge2
5343 meet_join_le ~> inf_sup_ord
5346 le_meet ~> le_inf_iff
5347 le_join ~> ge_sup_conv
5348 meet_idempotent ~> inf_idem
5349 join_idempotent ~> sup_idem
5350 meet_comm ~> inf_commute
5351 join_comm ~> sup_commute
5352 meet_leI1 ~> le_infI1
5353 meet_leI2 ~> le_infI2
5354 le_joinI1 ~> le_supI1
5355 le_joinI2 ~> le_supI2
5356 meet_assoc ~> inf_assoc
5357 join_assoc ~> sup_assoc
5358 meet_left_comm ~> inf_left_commute
5359 meet_left_idempotent ~> inf_left_idem
5360 join_left_comm ~> sup_left_commute
5361 join_left_idempotent ~> sup_left_idem
5364 le_def_meet ~> le_iff_inf
5365 le_def_join ~> le_iff_sup
5366 join_absorp2 ~> sup_absorb2
5367 join_absorp1 ~> sup_absorb1
5368 meet_absorp1 ~> inf_absorb1
5369 meet_absorp2 ~> inf_absorb2
5370 meet_join_absorp ~> inf_sup_absorb
5371 join_meet_absorp ~> sup_inf_absorb
5372 distrib_join_le ~> distrib_sup_le
5373 distrib_meet_le ~> distrib_inf_le
5375 add_meet_distrib_left ~> add_inf_distrib_left
5376 add_join_distrib_left ~> add_sup_distrib_left
5377 is_join_neg_meet ~> is_join_neg_inf
5378 is_meet_neg_join ~> is_meet_neg_sup
5379 add_meet_distrib_right ~> add_inf_distrib_right
5380 add_join_distrib_right ~> add_sup_distrib_right
5381 add_meet_join_distribs ~> add_sup_inf_distribs
5382 join_eq_neg_meet ~> sup_eq_neg_inf
5383 meet_eq_neg_join ~> inf_eq_neg_sup
5384 add_eq_meet_join ~> add_eq_inf_sup
5385 meet_0_imp_0 ~> inf_0_imp_0
5386 join_0_imp_0 ~> sup_0_imp_0
5387 meet_0_eq_0 ~> inf_0_eq_0
5388 join_0_eq_0 ~> sup_0_eq_0
5389 neg_meet_eq_join ~> neg_inf_eq_sup
5390 neg_join_eq_meet ~> neg_sup_eq_inf
5391 join_eq_if ~> sup_eq_if
5393 mono_meet ~> mono_inf
5394 mono_join ~> mono_sup
5395 meet_bool_eq ~> inf_bool_eq
5396 join_bool_eq ~> sup_bool_eq
5397 meet_fun_eq ~> inf_fun_eq
5398 join_fun_eq ~> sup_fun_eq
5399 meet_set_eq ~> inf_set_eq
5400 join_set_eq ~> sup_set_eq
5401 meet1_iff ~> inf1_iff
5402 meet2_iff ~> inf2_iff
5411 join1_iff ~> sup1_iff
5412 join2_iff ~> sup2_iff
5422 is_meet_Meet ~> is_meet_Inf
5423 Meet_bool_def ~> Inf_bool_def
5424 Meet_fun_def ~> Inf_fun_def
5425 Meet_greatest ~> Inf_greatest
5426 Meet_lower ~> Inf_lower
5427 Meet_set_def ~> Inf_set_def
5430 Sup_bool_eq ~> Sup_bool_def
5431 Sup_fun_eq ~> Sup_fun_def
5432 Sup_set_eq ~> Sup_set_def
5434 listsp_meetI ~> listsp_infI
5435 listsp_meet_eq ~> listsp_inf_eq
5440 * Added syntactic class "size"; overloaded constant "size" now has
5441 type "'a::size ==> bool"
5443 * Internal reorganisation of `size' of datatypes: size theorems
5444 "foo.size" are no longer subsumed by "foo.simps" (but are still
5445 simplification rules by default!); theorems "prod.size" now named
5448 * Class "div" now inherits from class "times" rather than "type".
5451 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
5452 Linorder etc. have disappeared; operations defined in terms of
5453 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
5455 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
5457 * HOL-Word: New extensive library and type for generic, fixed size
5458 machine words, with arithmetic, bit-wise, shifting and rotating
5459 operations, reflection into int, nat, and bool lists, automation for
5460 linear arithmetic (by automatic reflection into nat or int), including
5461 lemmas on overflow and monotonicity. Instantiated to all appropriate
5462 arithmetic type classes, supporting automatic simplification of
5463 numerals on all operations.
5465 * Library/Boolean_Algebra: locales for abstract boolean algebras.
5467 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
5469 * Code generator library theories:
5470 - Code_Integer represents HOL integers by big integer literals in target
5472 - Code_Char represents HOL characters by character literals in target
5474 - Code_Char_chr like Code_Char, but also offers treatment of character
5475 codes; includes Code_Integer.
5476 - Executable_Set allows to generate code for finite sets using lists.
5477 - Executable_Rat implements rational numbers as triples (sign, enumerator,
5479 - Executable_Real implements a subset of real numbers, namly those
5480 representable by rational numbers.
5481 - Efficient_Nat implements natural numbers by integers, which in general will
5482 result in higher efficency; pattern matching with 0/Suc is eliminated;
5483 includes Code_Integer.
5484 - Code_Index provides an additional datatype index which is mapped to
5485 target-language built-in integers.
5486 - Code_Message provides an additional datatype message_string which is isomorphic to
5487 strings; messages are mapped to target-language strings.
5489 * New package for inductive predicates
5491 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
5494 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5495 for z_1 :: U_1 and ... and z_n :: U_m
5497 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5500 with full support for type-inference, rather than
5502 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5504 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5505 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5507 inductive "s z_1 ... z_m"
5509 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5512 For backward compatibility, there is a wrapper allowing inductive
5513 sets to be defined with the new package via
5516 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5517 for z_1 :: U_1 and ... and z_n :: U_m
5519 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5525 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5526 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5527 for z_1 :: U_1 and ... and z_n :: U_m
5529 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5530 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5533 if the additional syntax "p ..." is required.
5535 Numerous examples can be found in the subdirectories src/HOL/Auth,
5536 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
5540 - Since declaration and definition of inductive sets or predicates
5541 is no longer separated, abbreviations involving the newly
5542 introduced sets or predicates must be specified together with the
5543 introduction rules after the 'where' keyword (see above), rather
5544 than before the actual inductive definition.
5546 - The variables in induction and elimination rules are now
5547 quantified in the order of their occurrence in the introduction
5548 rules, rather than in alphabetical order. Since this may break
5549 some proofs, these proofs either have to be repaired, e.g. by
5550 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
5551 statements of the form
5553 case (rule_i a_i_1 ... a_i_{k_i})
5555 or the old order of quantification has to be restored by explicitly adding
5556 meta-level quantifiers in the introduction rules, i.e.
5558 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
5560 - The format of the elimination rules is now
5562 p z_1 ... z_m x_1 ... x_n ==>
5563 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5568 (x_1, ..., x_n) : s z_1 ... z_m ==>
5569 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5572 for sets rather than
5574 x : s z_1 ... z_m ==>
5575 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
5578 This may require terms in goals to be expanded to n-tuples
5579 (e.g. using case_tac or simplification with the split_paired_all
5580 rule) before the above elimination rule is applicable.
5582 - The elimination or case analysis rules for (mutually) inductive
5583 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
5584 list of rules "p_1_..._p_k.elims" is no longer available.
5586 * New package "function"/"fun" for general recursive functions,
5587 supporting mutual and nested recursion, definitions in local contexts,
5588 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
5589 for small examples, and the separate tutorial on the function
5590 package. The old recdef "package" is still available as before, but
5591 users are encouraged to use the new package.
5593 * Method "lexicographic_order" automatically synthesizes termination
5594 relations as lexicographic combinations of size measures.
5596 * Case-expressions allow arbitrary constructor-patterns (including
5597 "_") and take their order into account, like in functional
5598 programming. Internally, this is translated into nested
5599 case-expressions; missing cases are added and mapped to the predefined
5600 constant "undefined". In complicated cases printing may no longer show
5601 the original input but the internal form. Lambda-abstractions allow
5602 the same form of pattern matching: "% pat1 => e1 | ..." is an
5603 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
5606 * IntDef: The constant "int :: nat => int" has been removed; now "int"
5607 is an abbreviation for "of_nat :: nat => int". The simplification
5608 rules for "of_nat" have been changed to work like "int" did
5609 previously. Potential INCOMPATIBILITY:
5610 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
5611 - of_nat_diff and of_nat_mult are no longer default simp rules
5613 * Method "algebra" solves polynomial equations over (semi)rings using
5614 Groebner bases. The (semi)ring structure is defined by locales and the
5615 tool setup depends on that generic context. Installing the method for
5616 a specific type involves instantiating the locale and possibly adding
5617 declarations for computation on the coefficients. The method is
5618 already instantiated for natural numbers and for the axiomatic class
5619 of idoms with numerals. See also the paper by Chaieb and Wenzel at
5620 CALCULEMUS 2007 for the general principles underlying this
5621 architecture of context-aware proof-tools.
5623 * Method "ferrack" implements quantifier elimination over
5624 special-purpose dense linear orders using locales (analogous to
5625 "algebra"). The method is already installed for class
5626 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
5629 * Former constant "List.op @" now named "List.append". Use ML
5630 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
5631 circumvent possible incompatibilities when working on ML level.
5633 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
5635 * New function listsum :: 'a list => 'a for arbitrary monoids.
5636 Special syntax: "SUM x <- xs. f x" (and latex variants)
5638 * New syntax for Haskell-like list comprehension (input only), eg.
5639 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
5641 * The special syntax for function "filter" has changed from [x :
5642 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
5643 comprehension syntax, and for uniformity. INCOMPATIBILITY.
5645 * [a..b] is now defined for arbitrary linear orders. It used to be
5646 defined on nat only, as an abbreviation for [a..<Suc b]
5649 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
5651 * New functions "sorted" and "sort" in src/HOL/List.thy.
5653 * New lemma collection field_simps (an extension of ring_simps) for
5654 manipulating (in)equations involving division. Multiplies with all
5655 denominators that can be proved to be non-zero (in equations) or
5656 positive/negative (in inequations).
5658 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
5659 have been improved and renamed to ring_simps, group_simps and
5660 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
5661 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
5663 * Theory Library/Commutative_Ring: switched from recdef to function
5664 package; constants add, mul, pow now curried. Infix syntax for
5665 algebraic operations.
5667 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
5670 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
5673 * HOL/records: generalised field-update to take a function on the
5674 field rather than the new value: r(|A := x|) is translated to A_update
5675 (K x) r The K-combinator that is internally used is called K_record.
5676 INCOMPATIBILITY: Usage of the plain update functions has to be
5679 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
5680 * x = 0, which are required for a semiring. Richer structures do not
5681 inherit from semiring_0 anymore, because this property is a theorem
5682 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
5683 there is more to prove, but this is mostly trivial.
5685 * Class "recpower" is generalized to arbitrary monoids, not just
5686 commutative semirings. INCOMPATIBILITY: may need to incorporate
5687 commutativity or semiring properties additionally.
5689 * Constant "List.list_all2" in List.thy now uses authentic syntax.
5690 INCOMPATIBILITY: translations containing list_all2 may go wrong,
5691 better use 'abbreviation'.
5693 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
5695 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
5696 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
5697 significant changes for setting up numeral syntax for types:
5698 - New constants Numeral.pred and Numeral.succ instead
5699 of former Numeral.bin_pred and Numeral.bin_succ.
5700 - Use integer operations instead of bin_add, bin_mult and so on.
5701 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
5702 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
5704 See src/HOL/Integ/IntArith.thy for an example setup.
5706 * Command 'normal_form' computes the normal form of a term that may
5707 contain free variables. For example ``normal_form "rev [a, b, c]"''
5708 produces ``[b, c, a]'' (without proof). This command is suitable for
5709 heavy-duty computations because the functions are compiled to ML
5710 first. Correspondingly, a method "normalization" is provided. See
5711 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
5713 * Alternative iff syntax "A <-> B" for equality on bool (with priority
5714 25 like -->); output depends on the "iff" print_mode, the default is
5715 "A = B" (with priority 50).
5717 * Relations less (<) and less_eq (<=) are also available on type bool.
5718 Modified syntax to disallow nesting without explicit parentheses,
5719 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
5722 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
5724 * Relation composition operator "op O" now has precedence 75 and binds
5725 stronger than union and intersection. INCOMPATIBILITY.
5727 * The old set interval syntax "{m..n(}" (and relatives) has been
5728 removed. Use "{m..<n}" (and relatives) instead.
5730 * In the context of the assumption "~(s = t)" the Simplifier rewrites
5731 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
5732 ``declare [[simproc del: neq]]''.
5734 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
5737 * Theorem Cons_eq_map_conv no longer declared as "simp".
5739 * Theorem setsum_mult renamed to setsum_right_distrib.
5741 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
5744 * Reimplemented methods "sat" and "satx", with several improvements:
5745 goals no longer need to be stated as "<prems> ==> False", equivalences
5746 (i.e. "=" on type bool) are handled, variable names of the form
5747 "lit_<n>" are no longer reserved, significant speedup.
5749 * Methods "sat" and "satx" can now replay MiniSat proof traces.
5750 zChaff is still supported as well.
5752 * 'inductive' and 'datatype': provide projections of mutual rules,
5753 bundled as foo_bar.inducts;
5755 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
5758 * Library: moved theory Accessible_Part to main HOL.
5760 * Library: added theory Coinductive_List of potentially infinite lists
5761 as greatest fixed-point.
5763 * Library: added theory AssocList which implements (finite) maps as
5766 * Method "evaluation" solves goals (i.e. a boolean expression)
5767 efficiently by compiling it to ML. The goal is "proved" (via an
5768 oracle) if it evaluates to True.
5770 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
5771 also when invoked by the simplifier. This results in the Simplifier
5772 being more powerful on arithmetic goals. INCOMPATIBILITY.
5773 Configuration option fast_arith_split_limit=0 recovers the old
5776 * Support for hex (0x20) and binary (0b1001) numerals.
5778 * New method: reify eqs (t), where eqs are equations for an
5779 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
5780 parameter, computes a term s::'b and a list xs::'a list and proves the
5781 theorem I xs s = t. This is also known as reification or quoting. The
5782 resulting theorem is applied to the subgoal to substitute t with I xs
5783 s. If t is omitted, the subgoal itself is reified.
5785 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
5786 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
5787 where f is supposed to be a computable function (in the sense of code
5788 generattion). The method uses reify to compute s and xs as above then
5789 applies corr_thm and uses normalization by evaluation to "prove" f s =
5790 r and finally gets the theorem t = r, which is again applied to the
5791 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
5793 * Reflection: Automatic reification now handels binding, an example is
5794 available in src/HOL/ex/ReflectionEx.thy
5796 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
5797 command 'statespace' that is similar to 'record', but introduces an
5798 abstract specification based on the locale infrastructure instead of
5799 HOL types. This leads to extra flexibility in composing state spaces,
5800 in particular multiple inheritance and renaming of components.
5805 * Hyperreal: Functions root and sqrt are now defined on negative real
5806 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
5807 Nonnegativity side conditions have been removed from many lemmas, so
5808 that more subgoals may now be solved by simplification; potential
5811 * Real: new type classes formalize real normed vector spaces and
5812 algebras, using new overloaded constants scaleR :: real => 'a => 'a
5813 and norm :: 'a => real.
5815 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
5816 reals into other types. The overloaded constant Reals :: 'a set is now
5817 defined as range of_real; potential INCOMPATIBILITY.
5819 * Real: proper support for ML code generation, including 'quickcheck'.
5820 Reals are implemented as arbitrary precision rationals.
5822 * Hyperreal: Several constants that previously worked only for the
5823 reals have been generalized, so they now work over arbitrary vector
5824 spaces. Type annotations may need to be added in some cases; potential
5827 Infinitesimal :: ('a::real_normed_vector) star set
5828 HFinite :: ('a::real_normed_vector) star set
5829 HInfinite :: ('a::real_normed_vector) star set
5830 approx :: ('a::real_normed_vector) star => 'a star => bool
5831 monad :: ('a::real_normed_vector) star => 'a star set
5832 galaxy :: ('a::real_normed_vector) star => 'a star set
5833 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
5834 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
5835 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
5836 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
5837 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
5838 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
5839 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
5840 sgn :: 'a::real_normed_vector => 'a
5841 exp :: 'a::{recpower,real_normed_field,banach} => 'a
5843 * Complex: Some complex-specific constants are now abbreviations for
5844 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
5845 hnorm. Other constants have been entirely removed in favor of the
5846 polymorphic versions (INCOMPATIBILITY):
5850 HInfinite <-- CInfinite
5851 Infinitesimal <-- CInfinitesimal
5854 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
5855 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
5856 (ns)deriv <-- (ns)cderiv
5861 * Formalisation of ideals and the quotient construction over rings.
5863 * Order and lattice theory no longer based on records.
5866 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
5867 greatest_closed. INCOMPATIBILITY.
5869 * Method algebra is now set up via an attribute. For examples see
5870 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
5871 of algebraic structures.
5873 * Renamed theory CRing to Ring.
5878 * Substantial, yet incomplete support for nominal datatypes (binding
5879 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
5880 src/HOL/Nominal/Examples. Prospective users should consult
5881 http://isabelle.in.tum.de/nominal/
5886 * ML basics: just one true type int, which coincides with IntInf.int
5889 * ML within Isar: antiquotations allow to embed statically-checked
5890 formal entities in the source, referring to the context available at
5891 compile-time. For example:
5893 ML {* @{sort "{zero,one}"} *}
5894 ML {* @{typ "'a => 'b"} *}
5895 ML {* @{term "%x. x"} *}
5896 ML {* @{prop "x == y"} *}
5897 ML {* @{ctyp "'a => 'b"} *}
5898 ML {* @{cterm "%x. x"} *}
5899 ML {* @{cprop "x == y"} *}
5900 ML {* @{thm asm_rl} *}
5901 ML {* @{thms asm_rl} *}
5902 ML {* @{type_name c} *}
5903 ML {* @{type_syntax c} *}
5904 ML {* @{const_name c} *}
5905 ML {* @{const_syntax c} *}
5908 ML {* @{theory Pure} *}
5909 ML {* @{theory_ref} *}
5910 ML {* @{theory_ref Pure} *}
5913 ML {* @{clasimpset} *}
5915 The same works for sources being ``used'' within an Isar context.
5917 * ML in Isar: improved error reporting; extra verbosity with
5918 ML_Context.trace enabled.
5920 * Pure/General/table.ML: the join operations now works via exceptions
5921 DUP/SAME instead of type option. This is simpler in simple cases, and
5922 admits slightly more efficient complex applications.
5924 * Pure: 'advanced' translation functions (parse_translation etc.) now
5925 use Context.generic instead of just theory.
5927 * Pure: datatype Context.generic joins theory/Proof.context and
5928 provides some facilities for code that works in either kind of
5929 context, notably GenericDataFun for uniform theory and proof data.
5931 * Pure: simplified internal attribute type, which is now always
5932 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
5933 local (Proof.context) attributes have been discontinued, while
5934 minimizing code duplication. Thm.rule_attribute and
5935 Thm.declaration_attribute build canonical attributes; see also structure
5936 Context for further operations on Context.generic, notably
5937 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
5938 declarations and definitions.
5940 * Context data interfaces (Theory/Proof/GenericDataFun): removed
5941 name/print, uninitialized data defaults to ad-hoc copy of empty value,
5942 init only required for impure data. INCOMPATIBILITY: empty really need
5943 to be empty (no dependencies on theory content!)
5945 * Pure/kernel: consts certification ignores sort constraints given in
5946 signature declarations. (This information is not relevant to the
5947 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
5948 potential INCOMPATIBILITY.
5950 * Pure: axiomatic type classes are now purely definitional, with
5951 explicit proofs of class axioms and super class relations performed
5952 internally. See Pure/axclass.ML for the main internal interfaces --
5953 notably AxClass.define_class supercedes AxClass.add_axclass, and
5954 AxClass.axiomatize_class/classrel/arity supersede
5955 Sign.add_classes/classrel/arities.
5957 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
5958 global/local versions on theory vs. Proof.context have been
5959 discontinued; Attrib.syntax and Method.syntax have been adapted
5960 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
5961 attributes, methods, etc.
5963 * Pure: several functions of signature "... -> theory -> theory * ..."
5964 have been reoriented to "... -> theory -> ... * theory" in order to
5965 allow natural usage in combination with the ||>, ||>>, |-> and
5966 fold_map combinators.
5968 * Pure: official theorem names (closed derivations) and additional
5969 comments (tags) are now strictly separate. Name hints -- which are
5970 maintained as tags -- may be attached any time without affecting the
5973 * Pure: primitive rule lift_rule now takes goal cterm instead of an
5974 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
5975 achieve the old behaviour.
5977 * Pure: the "Goal" constant is now called "prop", supporting a
5978 slightly more general idea of ``protecting'' meta-level rule
5981 * Pure: Logic.(un)varify only works in a global context, which is now
5982 enforced instead of silently assumed. INCOMPATIBILITY, may use
5983 Logic.legacy_(un)varify as temporary workaround.
5985 * Pure: structure Name provides scalable operations for generating
5986 internal variable names, notably Name.variants etc. This replaces
5987 some popular functions from term.ML:
5989 Term.variant -> Name.variant
5990 Term.variantlist -> Name.variant_list
5991 Term.invent_names -> Name.invent_list
5993 Note that low-level renaming rarely occurs in new code -- operations
5994 from structure Variable are used instead (see below).
5996 * Pure: structure Variable provides fundamental operations for proper
5997 treatment of fixed/schematic variables in a context. For example,
5998 Variable.import introduces fixes for schematics of given facts and
5999 Variable.export reverses the effect (up to renaming) -- this replaces
6000 various freeze_thaw operations.
6002 * Pure: structure Goal provides simple interfaces for
6003 init/conclude/finish and tactical prove operations (replacing former
6004 Tactic.prove). Goal.prove is the canonical way to prove results
6005 within a given context; Goal.prove_global is a degraded version for
6006 theory level goals, including a global Drule.standard. Note that
6007 OldGoals.prove_goalw_cterm has long been obsolete, since it is
6008 ill-behaved in a local proof context (e.g. with local fixes/assumes or
6009 in a locale context).
6011 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
6012 and type checking (Syntax.check_term etc.), with common combinations
6013 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
6014 which are considered legacy and await removal.
6016 * Pure/Syntax: generic interfaces for type unchecking
6017 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
6018 with common combinations (Syntax.pretty_term, Syntax.string_of_term
6019 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
6020 available for convenience, but refer to the very same operations using
6021 a mere theory instead of a full context.
6023 * Isar: simplified treatment of user-level errors, using exception
6024 ERROR of string uniformly. Function error now merely raises ERROR,
6025 without any side effect on output channels. The Isar toplevel takes
6026 care of proper display of ERROR exceptions. ML code may use plain
6027 handle/can/try; cat_error may be used to concatenate errors like this:
6029 ... handle ERROR msg => cat_error msg "..."
6031 Toplevel ML code (run directly or through the Isar toplevel) may be
6032 embedded into the Isar toplevel with exception display/debug like
6035 Isar.toplevel (fn () => ...)
6037 INCOMPATIBILITY, removed special transform_error facilities, removed
6038 obsolete variants of user-level exceptions (ERROR_MESSAGE,
6039 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
6040 -- use plain ERROR instead.
6042 * Isar: theory setup now has type (theory -> theory), instead of a
6043 list. INCOMPATIBILITY, may use #> to compose setup functions.
6045 * Isar: ML toplevel pretty printer for type Proof.context, subject to
6046 ProofContext.debug/verbose flags.
6048 * Isar: Toplevel.theory_to_proof admits transactions that modify the
6049 theory before entering a proof state. Transactions now always see a
6050 quasi-functional intermediate checkpoint, both in interactive and
6053 * Isar: simplified interfaces for outer syntax. Renamed
6054 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
6055 OuterSyntax.add_parsers -- this functionality is now included in
6056 OuterSyntax.command etc. INCOMPATIBILITY.
6058 * Simplifier: the simpset of a running simplification process now
6059 contains a proof context (cf. Simplifier.the_context), which is the
6060 very context that the initial simpset has been retrieved from (by
6061 simpset_of/local_simpset_of). Consequently, all plug-in components
6062 (solver, looper etc.) may depend on arbitrary proof data.
6064 * Simplifier.inherit_context inherits the proof context (plus the
6065 local bounds) of the current simplification process; any simproc
6066 etc. that calls the Simplifier recursively should do this! Removed
6067 former Simplifier.inherit_bounds, which is already included here --
6068 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
6069 specify an explicit context using Simplifier.context/theory_context.
6071 * Simplifier/Classical Reasoner: more abstract interfaces
6072 change_simpset/claset for modifying the simpset/claset reference of a
6073 theory; raw versions simpset/claset_ref etc. have been discontinued --
6076 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
6082 * settings: the default heap location within ISABELLE_HOME_USER now
6083 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
6084 Isabelle installations.
6086 * isabelle-process: option -S (secure mode) disables some critical
6087 operations, notably runtime compilation and evaluation of ML source
6090 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
6092 * Support for parallel execution, using native multicore support of
6093 Poly/ML 5.1. The theory loader exploits parallelism when processing
6094 independent theories, according to the given theory header
6095 specifications. The maximum number of worker threads is specified via
6096 usedir option -M or the "max-threads" setting in Proof General. A
6097 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
6098 to 6 on a 8-core machine. User-code needs to observe certain
6099 guidelines for thread-safe programming, see appendix A in the Isar
6100 Implementation manual.
6104 New in Isabelle2005 (October 2005)
6105 ----------------------------------
6109 * Theory headers: the new header syntax for Isar theories is
6112 imports <theory1> ... <theoryN>
6113 uses <file1> ... <fileM>
6116 where the 'uses' part is optional. The previous syntax
6118 theory <name> = <theory1> + ... + <theoryN>:
6120 will disappear in the next release. Use isatool fixheaders to convert
6121 existing theory files. Note that there is no change in ancient
6122 non-Isar theories now, but these will disappear soon.
6124 * Theory loader: parent theories can now also be referred to via
6125 relative and absolute paths.
6127 * Command 'find_theorems' searches for a list of criteria instead of a
6128 list of constants. Known criteria are: intro, elim, dest, name:string,
6129 simp:term, and any term. Criteria can be preceded by '-' to select
6130 theorems that do not match. Intro, elim, dest select theorems that
6131 match the current goal, name:s selects theorems whose fully qualified
6132 name contain s, and simp:term selects all simplification rules whose
6133 lhs match term. Any other term is interpreted as pattern and selects
6134 all theorems matching the pattern. Available in ProofGeneral under
6135 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
6137 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
6139 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
6140 matching the current goal as introduction rule and not having "HOL."
6141 in their name (i.e. not being defined in theory HOL).
6143 * Command 'thms_containing' has been discontinued in favour of
6144 'find_theorems'; INCOMPATIBILITY.
6146 * Communication with Proof General is now 8bit clean, which means that
6147 Unicode text in UTF-8 encoding may be used within theory texts (both
6148 formal and informal parts). Cf. option -U of the Isabelle Proof
6149 General interface. Here are some simple examples (cf. src/HOL/ex):
6151 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
6152 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
6154 * Improved efficiency of the Simplifier and, to a lesser degree, the
6155 Classical Reasoner. Typical big applications run around 2 times
6159 *** Document preparation ***
6161 * Commands 'display_drafts' and 'print_drafts' perform simple output
6162 of raw sources. Only those symbols that do not require additional
6163 LaTeX packages (depending on comments in isabellesym.sty) are
6164 displayed properly, everything else is left verbatim. isatool display
6165 and isatool print are used as front ends (these are subject to the
6166 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
6168 * Command tags control specific markup of certain regions of text,
6169 notably folding and hiding. Predefined tags include "theory" (for
6170 theory begin and end), "proof" for proof commands, and "ML" for
6171 commands involving ML code; the additional tags "visible" and
6172 "invisible" are unused by default. Users may give explicit tag
6173 specifications in the text, e.g. ''by %invisible (auto)''. The
6174 interpretation of tags is determined by the LaTeX job during document
6175 preparation: see option -V of isatool usedir, or options -n and -t of
6176 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
6179 Several document versions may be produced at the same time via isatool
6180 usedir (the generated index.html will link all of them). Typical
6181 specifications include ''-V document=theory,proof,ML'' to present
6182 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
6183 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
6184 these parts without any formal replacement text. The Isabelle site
6185 default settings produce ''document'' and ''outline'' versions as
6188 * Several new antiquotations:
6190 @{term_type term} prints a term with its type annotated;
6192 @{typeof term} prints the type of a term;
6194 @{const const} is the same as @{term const}, but checks that the
6195 argument is a known logical constant;
6197 @{term_style style term} and @{thm_style style thm} print a term or
6198 theorem applying a "style" to it
6202 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
6203 definitions, equations, inequations etc., 'concl' printing only the
6204 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
6205 to print the specified premise. TermStyle.add_style provides an ML
6206 interface for introducing further styles. See also the "LaTeX Sugar"
6207 document practical applications. The ML antiquotation prints
6208 type-checked ML expressions verbatim.
6210 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
6211 and 'text' support optional locale specification '(in loc)', which
6212 specifies the default context for interpreting antiquotations. For
6213 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
6215 * Option 'locale=NAME' of antiquotations specifies an alternative
6216 context interpreting the subsequent argument. For example: @{thm
6217 [locale=lattice] inf_assoc}.
6219 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
6222 * Proper output of antiquotations for theory commands involving a
6223 proof context (such as 'locale' or 'theorem (in loc) ...').
6225 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
6226 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
6228 * isatool usedir: new option -C (default true) controls whether option
6229 -D should include a copy of the original document directory; -C false
6230 prevents unwanted effects such as copying of administrative CVS data.
6235 * Considerably improved version of 'constdefs' command. Now performs
6236 automatic type-inference of declared constants; additional support for
6237 local structure declarations (cf. locales and HOL records), see also
6238 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
6239 sequential dependencies of definitions within a single 'constdefs'
6240 section; moreover, the declared name needs to be an identifier. If
6241 all fails, consider to fall back on 'consts' and 'defs' separately.
6243 * Improved indexed syntax and implicit structures. First of all,
6244 indexed syntax provides a notational device for subscripted
6245 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
6246 expressions. Secondly, in a local context with structure
6247 declarations, number indexes \<^sub>n or the empty index (default
6248 number 1) refer to a certain fixed variable implicitly; option
6249 show_structs controls printing of implicit structures. Typical
6250 applications of these concepts involve record types and locales.
6252 * New command 'no_syntax' removes grammar declarations (and
6253 translations) resulting from the given syntax specification, which is
6254 interpreted in the same manner as for the 'syntax' command.
6256 * 'Advanced' translation functions (parse_translation etc.) may depend
6257 on the signature of the theory context being presently used for
6258 parsing/printing, see also isar-ref manual.
6260 * Improved 'oracle' command provides a type-safe interface to turn an
6261 ML expression of type theory -> T -> term into a primitive rule of
6262 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
6263 is already included here); see also FOL/ex/IffExample.thy;
6266 * axclass: name space prefix for class "c" is now "c_class" (was "c"
6267 before); "cI" is no longer bound, use "c.intro" instead.
6268 INCOMPATIBILITY. This change avoids clashes of fact bindings for
6269 axclasses vs. locales.
6271 * Improved internal renaming of symbolic identifiers -- attach primes
6272 instead of base 26 numbers.
6274 * New flag show_question_marks controls printing of leading question
6275 marks in schematic variable names.
6277 * In schematic variable names, *any* symbol following \<^isub> or
6278 \<^isup> is now treated as part of the base name. For example, the
6279 following works without printing of awkward ".0" indexes:
6281 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
6284 * Inner syntax includes (*(*nested*) comments*).
6286 * Pretty printer now supports unbreakable blocks, specified in mixfix
6287 annotations as "(00...)".
6289 * Clear separation of logical types and nonterminals, where the latter
6290 may only occur in 'syntax' specifications or type abbreviations.
6291 Before that distinction was only partially implemented via type class
6292 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
6293 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
6294 exotic syntax specifications may require further adaption
6295 (e.g. Cube/Cube.thy).
6297 * Removed obsolete type class "logic", use the top sort {} instead.
6298 Note that non-logical types should be declared as 'nonterminals'
6299 rather than 'types'. INCOMPATIBILITY for new object-logic
6302 * Attributes 'induct' and 'cases': type or set names may now be
6303 locally fixed variables as well.
6305 * Simplifier: can now control the depth to which conditional rewriting
6306 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
6309 * Simplifier: simplification procedures may now take the current
6310 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
6311 interface), which is very useful for calling the Simplifier
6312 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
6313 is gone -- use prems_of_ss on the simpset instead. Moreover, the
6314 low-level mk_simproc no longer applies Logic.varify internally, to
6315 allow for use in a context of fixed variables.
6317 * thin_tac now works even if the assumption being deleted contains !!
6318 or ==>. More generally, erule now works even if the major premise of
6319 the elimination rule contains !! or ==>.
6321 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
6323 * Reorganized bootstrapping of the Pure theories; CPure is now derived
6324 from Pure, which contains all common declarations already. Both
6325 theories are defined via plain Isabelle/Isar .thy files.
6326 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
6327 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
6328 use isatool fixcpure to adapt your theory and ML sources.
6330 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
6331 selections of theorems in named facts via index ranges.
6333 * 'print_theorems': in theory mode, really print the difference
6334 wrt. the last state (works for interactive theory development only),
6335 in proof mode print all local facts (cf. 'print_facts');
6337 * 'hide': option '(open)' hides only base names.
6339 * More efficient treatment of intermediate checkpoints in interactive
6342 * Code generator is now invoked via code_module (incremental code
6343 generation) and code_library (modular code generation, ML structures
6344 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
6345 must be quoted when used as identifiers.
6347 * New 'value' command for reading, evaluating and printing terms using
6348 the code generator. INCOMPATIBILITY: command keyword 'value' must be
6349 quoted when used as identifier.
6354 * New commands for the interpretation of locale expressions in
6355 theories (1), locales (2) and proof contexts (3). These generate
6356 proof obligations from the expression specification. After the
6357 obligations have been discharged, theorems of the expression are added
6358 to the theory, target locale or proof context. The synopsis of the
6359 commands is a follows:
6361 (1) interpretation expr inst
6362 (2) interpretation target < expr
6363 (3) interpret expr inst
6365 Interpretation in theories and proof contexts require a parameter
6366 instantiation of terms from the current context. This is applied to
6367 specifications and theorems of the interpreted expression.
6368 Interpretation in locales only permits parameter renaming through the
6369 locale expression. Interpretation is smart in that interpretations
6370 that are active already do not occur in proof obligations, neither are
6371 instantiated theorems stored in duplicate. Use 'print_interps' to
6372 inspect active interpretations of a particular locale. For details,
6373 see the Isar Reference manual. Examples can be found in
6374 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
6376 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
6377 'interpret' instead.
6379 * New context element 'constrains' for adding type constraints to
6382 * Context expressions: renaming of parameters with syntax
6385 * Locale declaration: 'includes' disallowed.
6387 * Proper static binding of attribute syntax -- i.e. types / terms /
6388 facts mentioned as arguments are always those of the locale definition
6389 context, independently of the context of later invocations. Moreover,
6390 locale operations (renaming and type / term instantiation) are applied
6391 to attribute arguments as expected.
6393 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
6394 actual attributes; rare situations may require Attrib.attribute to
6395 embed those attributes into Attrib.src that lack concrete syntax.
6396 Attribute implementations need to cooperate properly with the static
6397 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
6398 Attrib.XXX_thm etc. already do the right thing without further
6399 intervention. Only unusual applications -- such as "where" or "of"
6400 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
6401 on the context and the facts involved -- may have to assign parsed
6402 values to argument tokens explicitly.
6404 * Changed parameter management in theorem generation for long goal
6405 statements with 'includes'. INCOMPATIBILITY: produces a different
6406 theorem statement in rare situations.
6408 * Locale inspection command 'print_locale' omits notes elements. Use
6409 'print_locale!' to have them included in the output.
6414 * Provers/hypsubst.ML: improved version of the subst method, for
6415 single-step rewriting: it now works in bound variable contexts. New is
6416 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
6417 rewrite a different subterm than the original subst method, which is
6418 still available as 'simplesubst'.
6420 * Provers/quasi.ML: new transitivity reasoners for transitivity only
6423 * Provers/trancl.ML: new transitivity reasoner for transitive and
6424 reflexive-transitive closure of relations.
6426 * Provers/blast.ML: new reference depth_limit to make blast's depth
6427 limit (previously hard-coded with a value of 20) user-definable.
6429 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
6430 is peformed already. Object-logics merely need to finish their
6431 initial simpset configuration as before. INCOMPATIBILITY.
6436 * Symbolic syntax of Hilbert Choice Operator is now as follows:
6439 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
6441 The symbol \<some> is displayed as the alternative epsilon of LaTeX
6442 and x-symbol; use option '-m epsilon' to get it actually printed.
6443 Moreover, the mathematically important symbolic identifier \<epsilon>
6444 becomes available as variable, constant etc. INCOMPATIBILITY,
6446 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
6447 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
6448 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
6449 support corresponding Isar calculations.
6451 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
6454 * theory SetInterval: changed the syntax for open intervals:
6463 The old syntax is still supported but will disappear in the next
6464 release. For conversion use the following Emacs search and replace
6465 patterns (these are not perfect but work quite well):
6467 {)\([^\.]*\)\.\. -> {\1<\.\.}
6468 \.\.\([^(}]*\)(} -> \.\.<\1}
6470 * Theory Commutative_Ring (in Library): method comm_ring for proving
6471 equalities in commutative rings; method 'algebra' provides a generic
6474 * Theory Finite_Set: changed the syntax for 'setsum', summation over
6475 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
6476 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
6479 Some new syntax forms are available:
6481 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
6482 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
6483 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
6484 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
6486 The latter form "\<Sum>x < k. e" used to be based on a separate
6487 function "Summation", which has been discontinued.
6489 * theory Finite_Set: in structured induction proofs, the insert case
6490 is now 'case (insert x F)' instead of the old counterintuitive 'case
6493 * The 'refute' command has been extended to support a much larger
6494 fragment of HOL, including axiomatic type classes, constdefs and
6495 typedefs, inductive datatypes and recursion.
6497 * New tactics 'sat' and 'satx' to prove propositional tautologies.
6498 Requires zChaff with proof generation to be installed. See
6499 HOL/ex/SAT_Examples.thy for examples.
6501 * Datatype induction via method 'induct' now preserves the name of the
6502 induction variable. For example, when proving P(xs::'a list) by
6503 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
6504 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
6505 in unstructured proof scripts.
6507 * Reworked implementation of records. Improved scalability for
6508 records with many fields, avoiding performance problems for type
6509 inference. Records are no longer composed of nested field types, but
6510 of nested extension types. Therefore the record type only grows linear
6511 in the number of extensions and not in the number of fields. The
6512 top-level (users) view on records is preserved. Potential
6513 INCOMPATIBILITY only in strange cases, where the theory depends on the
6514 old record representation. The type generated for a record is called
6515 <record_name>_ext_type.
6517 Flag record_quick_and_dirty_sensitive can be enabled to skip the
6518 proofs triggered by a record definition or a simproc (if
6519 quick_and_dirty is enabled). Definitions of large records can take
6522 New simproc record_upd_simproc for simplification of multiple record
6523 updates enabled by default. Moreover, trivial updates are also
6524 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
6525 occasionally, since simplification is more powerful by default.
6527 * typedef: proper support for polymorphic sets, which contain extra
6528 type-variables in the term.
6530 * Simplifier: automatically reasons about transitivity chains
6531 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
6532 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
6533 old proofs break occasionally as simplification may now solve more
6534 goals than previously.
6536 * Simplifier: converts x <= y into x = y if assumption y <= x is
6537 present. Works for all partial orders (class "order"), in particular
6538 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
6541 * Simplifier: new simproc for "let x = a in f x". If a is a free or
6542 bound variable or a constant then the let is unfolded. Otherwise
6543 first a is simplified to b, and then f b is simplified to g. If
6544 possible we abstract b from g arriving at "let x = b in h x",
6545 otherwise we unfold the let and arrive at g. The simproc can be
6546 enabled/disabled by the reference use_let_simproc. Potential
6547 INCOMPATIBILITY since simplification is more powerful by default.
6549 * Classical reasoning: the meson method now accepts theorems as arguments.
6551 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
6552 jobs to provide advice on the provability of subgoals.
6554 * Theory OrderedGroup and Ring_and_Field: various additions and
6555 improvements to faciliate calculations involving equalities and
6558 The following theorems have been eliminated or modified
6561 abs_eq now named abs_of_nonneg
6562 abs_of_ge_0 now named abs_of_nonneg
6563 abs_minus_eq now named abs_of_nonpos
6564 imp_abs_id now named abs_of_nonneg
6565 imp_abs_neg_id now named abs_of_nonpos
6566 mult_pos now named mult_pos_pos
6567 mult_pos_le now named mult_nonneg_nonneg
6568 mult_pos_neg_le now named mult_nonneg_nonpos
6569 mult_pos_neg2_le now named mult_nonneg_nonpos2
6570 mult_neg now named mult_neg_neg
6571 mult_neg_le now named mult_nonpos_nonpos
6573 * The following lemmas in Ring_and_Field have been added to the simplifier:
6576 not_square_less_zero
6578 The following lemmas have been deleted from Real/RealPow:
6588 * Theory Parity: added rules for simplifying exponents.
6592 The following theorems have been eliminated or modified
6595 list_all_Nil now named list_all.simps(1)
6596 list_all_Cons now named list_all.simps(2)
6597 list_all_conv now named list_all_iff
6598 set_mem_eq now named mem_iff
6600 * Theories SetsAndFunctions and BigO (see HOL/Library) support
6601 asymptotic "big O" calculations. See the notes in BigO.thy.
6606 * Theory RealDef: better support for embedding natural numbers and
6607 integers in the reals.
6609 The following theorems have been eliminated or modified
6612 exp_ge_add_one_self now requires no hypotheses
6613 real_of_int_add reversed direction of equality (use [symmetric])
6614 real_of_int_minus reversed direction of equality (use [symmetric])
6615 real_of_int_diff reversed direction of equality (use [symmetric])
6616 real_of_int_mult reversed direction of equality (use [symmetric])
6618 * Theory RComplete: expanded support for floor and ceiling functions.
6620 * Theory Ln is new, with properties of the natural logarithm
6622 * Hyperreal: There is a new type constructor "star" for making
6623 nonstandard types. The old type names are now type synonyms:
6627 hcomplex = complex star
6629 * Hyperreal: Many groups of similarly-defined constants have been
6630 replaced by polymorphic versions (INCOMPATIBILITY):
6632 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
6634 starset <-- starsetNat, starsetC
6635 *s* <-- *sNat*, *sc*
6636 starset_n <-- starsetNat_n, starsetC_n
6637 *sn* <-- *sNatn*, *scn*
6638 InternalSets <-- InternalNatSets, InternalCSets
6640 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6641 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
6642 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
6643 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
6644 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
6646 * Hyperreal: Many type-specific theorems have been removed in favor of
6647 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
6649 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
6650 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
6651 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
6652 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
6653 right_minus <-- hypreal_add_minus
6654 left_minus <-- {hypreal,hcomplex}_add_minus_left
6655 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
6656 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
6657 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
6658 mult_1_right <-- hcomplex_mult_one_right
6659 mult_zero_left <-- hcomplex_mult_zero_left
6660 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
6661 right_distrib <-- hypnat_add_mult_distrib2
6662 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
6663 right_inverse <-- hypreal_mult_inverse
6664 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
6665 order_refl <-- {hypreal,hypnat}_le_refl
6666 order_trans <-- {hypreal,hypnat}_le_trans
6667 order_antisym <-- {hypreal,hypnat}_le_anti_sym
6668 order_less_le <-- {hypreal,hypnat}_less_le
6669 linorder_linear <-- {hypreal,hypnat}_le_linear
6670 add_left_mono <-- {hypreal,hypnat}_add_left_mono
6671 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
6672 add_nonneg_nonneg <-- hypreal_le_add_order
6674 * Hyperreal: Separate theorems having to do with type-specific
6675 versions of constants have been merged into theorems that apply to the
6676 new polymorphic constants (INCOMPATIBILITY):
6678 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
6679 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
6680 STAR_Un <-- {STAR,NatStar,STARC}_Un
6681 STAR_Int <-- {STAR,NatStar,STARC}_Int
6682 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
6683 STAR_subset <-- {STAR,NatStar,STARC}_subset
6684 STAR_mem <-- {STAR,NatStar,STARC}_mem
6685 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
6686 STAR_diff <-- {STAR,STARC}_diff
6687 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
6688 STARC_hcomplex_of_complex}_image_subset
6689 starset_n_Un <-- starset{Nat,C}_n_Un
6690 starset_n_Int <-- starset{Nat,C}_n_Int
6691 starset_n_Compl <-- starset{Nat,C}_n_Compl
6692 starset_n_diff <-- starset{Nat,C}_n_diff
6693 InternalSets_Un <-- Internal{Nat,C}Sets_Un
6694 InternalSets_Int <-- Internal{Nat,C}Sets_Int
6695 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
6696 InternalSets_diff <-- Internal{Nat,C}Sets_diff
6697 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
6698 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
6699 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
6700 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
6701 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
6702 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6703 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
6704 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
6705 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
6706 starfun_diff <-- starfun{C,RC,CR}_diff
6707 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
6708 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
6709 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
6710 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
6711 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
6712 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
6713 starfun_Id <-- starfunC_Id
6714 starfun_approx <-- starfun{Nat,CR}_approx
6715 starfun_capprox <-- starfun{C,RC}_capprox
6716 starfun_abs <-- starfunNat_rabs
6717 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
6718 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
6719 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
6720 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
6721 starfun_add_capprox <-- starfun{C,RC}_add_capprox
6722 starfun_add_approx <-- starfunCR_add_approx
6723 starfun_inverse_inverse <-- starfunC_inverse_inverse
6724 starfun_divide <-- starfun{C,CR,RC}_divide
6725 starfun_n <-- starfun{Nat,C}_n
6726 starfun_n_mult <-- starfun{Nat,C}_n_mult
6727 starfun_n_add <-- starfun{Nat,C}_n_add
6728 starfun_n_add_minus <-- starfunNat_n_add_minus
6729 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
6730 starfun_n_minus <-- starfun{Nat,C}_n_minus
6731 starfun_n_eq <-- starfun{Nat,C}_n_eq
6733 star_n_add <-- {hypreal,hypnat,hcomplex}_add
6734 star_n_minus <-- {hypreal,hcomplex}_minus
6735 star_n_diff <-- {hypreal,hcomplex}_diff
6736 star_n_mult <-- {hypreal,hcomplex}_mult
6737 star_n_inverse <-- {hypreal,hcomplex}_inverse
6738 star_n_le <-- {hypreal,hypnat}_le
6739 star_n_less <-- {hypreal,hypnat}_less
6740 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
6741 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
6742 star_n_abs <-- hypreal_hrabs
6743 star_n_divide <-- hcomplex_divide
6745 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
6746 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
6747 star_of_diff <-- hypreal_of_real_diff
6748 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
6749 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
6750 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
6751 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
6752 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
6753 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
6754 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
6755 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
6756 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
6757 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
6758 star_of_number_of <-- {hypreal,hcomplex}_number_of
6759 star_of_number_less <-- number_of_less_hypreal_of_real_iff
6760 star_of_number_le <-- number_of_le_hypreal_of_real_iff
6761 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
6762 star_of_less_number <-- hypreal_of_real_less_number_of_iff
6763 star_of_le_number <-- hypreal_of_real_le_number_of_iff
6764 star_of_power <-- hypreal_of_real_power
6765 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
6767 * Hyperreal: new method "transfer" that implements the transfer
6768 principle of nonstandard analysis. With a subgoal that mentions
6769 nonstandard types like "'a star", the command "apply transfer"
6770 replaces it with an equivalent one that mentions only standard types.
6771 To be successful, all free variables must have standard types; non-
6772 standard variables must have explicit universal quantifiers.
6774 * Hyperreal: A theory of Taylor series.
6779 * Discontinued special version of 'constdefs' (which used to support
6780 continuous functions) in favor of the general Pure one with full
6783 * New simplification procedure for solving continuity conditions; it
6784 is much faster on terms with many nested lambda abstractions (cubic
6785 instead of exponential time).
6787 * New syntax for domain package: selector names are now optional.
6788 Parentheses should be omitted unless argument is lazy, for example:
6790 domain 'a stream = cons "'a" (lazy "'a stream")
6792 * New command 'fixrec' for defining recursive functions with pattern
6793 matching; defining multiple functions with mutual recursion is also
6794 supported. Patterns may include the constants cpair, spair, up, sinl,
6795 sinr, or any data constructor defined by the domain package. The given
6796 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
6797 syntax and examples.
6799 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
6800 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
6801 but the proof obligation additionally includes an admissibility
6802 requirement. The packages generate instances of class cpo or pcpo,
6803 with continuity and strictness theorems for Rep and Abs.
6805 * HOLCF: Many theorems have been renamed according to a more standard naming
6806 scheme (INCOMPATIBILITY):
6808 foo_inject: "foo$x = foo$y ==> x = y"
6809 foo_eq: "(foo$x = foo$y) = (x = y)"
6810 foo_less: "(foo$x << foo$y) = (x << y)"
6811 foo_strict: "foo$UU = UU"
6812 foo_defined: "... ==> foo$x ~= UU"
6813 foo_defined_iff: "(foo$x = UU) = (x = UU)"
6818 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
6819 including the First Isomorphism Theorem (on quotienting by the kernel
6822 * ZF/Simplifier: install second copy of type solver that actually
6823 makes use of TC rules declared to Isar proof contexts (or locales);
6824 the old version is still required for ML proof scripts.
6829 * Converted to Isar theory format; use locales instead of axiomatic
6835 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
6838 * Pure/library.ML no longer defines its own option datatype, but uses
6839 that of the SML basis, which has constructors NONE and SOME instead of
6840 None and Some, as well as exception Option.Option instead of OPTION.
6841 The functions the, if_none, is_some, is_none have been adapted
6842 accordingly, while Option.map replaces apsome.
6844 * Pure/library.ML: the exception LIST has been given up in favour of
6845 the standard exceptions Empty and Subscript, as well as
6846 Library.UnequalLengths. Function like Library.hd and Library.tl are
6847 superceded by the standard hd and tl functions etc.
6849 A number of basic list functions are no longer exported to the ML
6850 toplevel, as they are variants of predefined functions. The following
6851 suggests how one can translate existing code:
6853 rev_append xs ys = List.revAppend (xs, ys)
6854 nth_elem (i, xs) = List.nth (xs, i)
6855 last_elem xs = List.last xs
6856 flat xss = List.concat xss
6857 seq fs = List.app fs
6858 partition P xs = List.partition P xs
6859 mapfilter f xs = List.mapPartial f xs
6861 * Pure/library.ML: several combinators for linear functional
6862 transformations, notably reverse application and composition:
6865 (x, y) |-> f f #-> g
6867 * Pure/library.ML: introduced/changed precedence of infix operators:
6869 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
6871 infix 3 o oo ooo oooo;
6872 infix 4 ~~ upto downto;
6874 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
6877 * Pure/library.ML: natural list combinators fold, fold_rev, and
6878 fold_map support linear functional transformations and nesting. For
6881 fold f [x1, ..., xN] y =
6882 y |> f x1 |> ... |> f xN
6884 (fold o fold) f [xs1, ..., xsN] y =
6885 y |> fold f xs1 |> ... |> fold f xsN
6887 fold f [x1, ..., xN] =
6890 (fold o fold) f [xs1, ..., xsN] =
6891 fold f xs1 #> ... #> fold f xsN
6893 * Pure/library.ML: the following selectors on type 'a option are
6896 the: 'a option -> 'a (*partial*)
6897 these: 'a option -> 'a where 'a = 'b list
6898 the_default: 'a -> 'a option -> 'a
6899 the_list: 'a option -> 'a list
6901 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6902 basic operations for association lists, following natural argument
6903 order; moreover the explicit equality predicate passed here avoids
6904 potentially expensive polymorphic runtime equality checks.
6905 The old functions may be expressed as follows:
6907 assoc = uncurry (AList.lookup (op =))
6908 assocs = these oo AList.lookup (op =)
6909 overwrite = uncurry (AList.update (op =)) o swap
6911 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6913 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
6914 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
6916 replacing make_keylist and keyfilter (occassionally used)
6919 make_keylist = AList.make
6920 keyfilter = AList.find (op =)
6922 * eq_fst and eq_snd now take explicit equality parameter, thus
6923 avoiding eqtypes. Naive rewrites:
6925 eq_fst = eq_fst (op =)
6926 eq_snd = eq_snd (op =)
6928 * Removed deprecated apl and apr (rarely used).
6931 apl (n, op) =>>= curry op n
6932 apr (op, m) =>>= fn n => op (n, m)
6934 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
6935 provides a reasonably efficient light-weight implementation of sets as
6938 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
6939 few new operations; existing lookup and update are now curried to
6940 follow natural argument order (for use with fold etc.);
6941 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
6943 * Pure/General: output via the Isabelle channels of
6944 writeln/warning/error etc. is now passed through Output.output, with a
6945 hook for arbitrary transformations depending on the print_mode
6946 (cf. Output.add_mode -- the first active mode that provides a output
6947 function wins). Already formatted output may be embedded into further
6948 text via Output.raw; the result of Pretty.string_of/str_of and derived
6949 functions (string_of_term/cterm/thm etc.) is already marked raw to
6950 accommodate easy composition of diagnostic messages etc. Programmers
6951 rarely need to care about Output.output or Output.raw at all, with
6952 some notable exceptions: Output.output is required when bypassing the
6953 standard channels (writeln etc.), or in token translations to produce
6954 properly formatted results; Output.raw is required when capturing
6955 already output material that will eventually be presented to the user
6956 a second time. For the default print mode, both Output.output and
6957 Output.raw have no effect.
6959 * Pure/General: Output.time_accumulator NAME creates an operator ('a
6960 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
6961 cumulative results are displayed at the end of a batch session.
6963 * Pure/General: File.sysify_path and File.quote_sysify path have been
6964 replaced by File.platform_path and File.shell_path (with appropriate
6965 hooks). This provides a clean interface for unusual systems where the
6966 internal and external process view of file names are different.
6968 * Pure: more efficient orders for basic syntactic entities: added
6969 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
6970 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
6971 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
6972 orders now -- potential INCOMPATIBILITY for code that depends on a
6973 particular order for Symtab.keys, Symtab.dest, etc. (consider using
6974 Library.sort_strings on result).
6976 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
6977 fold_types traverse types/terms from left to right, observing natural
6978 argument order. Supercedes previous foldl_XXX versions, add_frees,
6979 add_vars etc. have been adapted as well: INCOMPATIBILITY.
6981 * Pure: name spaces have been refined, with significant changes of the
6982 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
6983 to extern(_table). The plain name entry path is superceded by a
6984 general 'naming' context, which also includes the 'policy' to produce
6985 a fully qualified name and external accesses of a fully qualified
6986 name; NameSpace.extend is superceded by context dependent
6987 Sign.declare_name. Several theory and proof context operations modify
6988 the naming context. Especially note Theory.restore_naming and
6989 ProofContext.restore_naming to get back to a sane state; note that
6990 Theory.add_path is no longer sufficient to recover from
6991 Theory.absolute_path in particular.
6993 * Pure: new flags short_names (default false) and unique_names
6994 (default true) for controlling output of qualified names. If
6995 short_names is set, names are printed unqualified. If unique_names is
6996 reset, the name prefix is reduced to the minimum required to achieve
6997 the original result when interning again, even if there is an overlap
6998 with earlier declarations.
7000 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
7001 now 'extend', and 'merge' gets an additional Pretty.pp argument
7002 (useful for printing error messages). INCOMPATIBILITY.
7004 * Pure: major reorganization of the theory context. Type Sign.sg and
7005 Theory.theory are now identified, referring to the universal
7006 Context.theory (see Pure/context.ML). Actual signature and theory
7007 content is managed as theory data. The old code and interfaces were
7008 spread over many files and structures; the new arrangement introduces
7009 considerable INCOMPATIBILITY to gain more clarity:
7011 Context -- theory management operations (name, identity, inclusion,
7012 parents, ancestors, merge, etc.), plus generic theory data;
7014 Sign -- logical signature and syntax operations (declaring consts,
7015 types, etc.), plus certify/read for common entities;
7017 Theory -- logical theory operations (stating axioms, definitions,
7018 oracles), plus a copy of logical signature operations (consts,
7019 types, etc.); also a few basic management operations (Theory.copy,
7022 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
7023 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
7024 for convenience -- they merely return the theory.
7026 * Pure: type Type.tsig is superceded by theory in most interfaces.
7028 * Pure: the Isar proof context type is already defined early in Pure
7029 as Context.proof (note that ProofContext.context and Proof.context are
7030 aliases, where the latter is the preferred name). This enables other
7031 Isabelle components to refer to that type even before Isar is present.
7033 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
7034 typeK, constK, axiomK, oracleK), but provide explicit operations for
7035 any of these kinds. For example, Sign.intern typeK is now
7036 Sign.intern_type, Theory.hide_space Sign.typeK is now
7037 Theory.hide_types. Also note that former
7038 Theory.hide_classes/types/consts are now
7039 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
7040 internalize their arguments! INCOMPATIBILITY.
7042 * Pure: get_thm interface (of PureThy and ProofContext) expects
7043 datatype thmref (with constructors Name and NameSelection) instead of
7044 plain string -- INCOMPATIBILITY;
7046 * Pure: cases produced by proof methods specify options, where NONE
7047 means to remove case bindings -- INCOMPATIBILITY in
7050 * Pure: the following operations retrieve axioms or theorems from a
7051 theory node or theory hierarchy, respectively:
7053 Theory.axioms_of: theory -> (string * term) list
7054 Theory.all_axioms_of: theory -> (string * term) list
7055 PureThy.thms_of: theory -> (string * thm) list
7056 PureThy.all_thms_of: theory -> (string * thm) list
7058 * Pure: print_tac now outputs the goal through the trace channel.
7060 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
7061 Reference Toplevel.debug (default false) controls detailed printing
7062 and tracing of low-level exceptions; Toplevel.profiling (default 0)
7063 controls execution profiling -- set to 1 for time and 2 for space
7064 (both increase the runtime).
7066 * Isar session: The initial use of ROOT.ML is now always timed,
7067 i.e. the log will show the actual process times, in contrast to the
7068 elapsed wall-clock time that the outer shell wrapper produces.
7070 * Simplifier: improved handling of bound variables (nameless
7071 representation, avoid allocating new strings). Simprocs that invoke
7072 the Simplifier recursively should use Simplifier.inherit_bounds to
7073 avoid local name clashes. Failure to do so produces warnings
7074 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
7075 for further details.
7077 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
7078 bindings for all theorems stored within a given theory; this may help
7079 in porting non-Isar theories to Isar ones, while keeping ML proof
7080 scripts for the time being.
7082 * ML operator HTML.with_charset specifies the charset begin used for
7083 generated HTML files. For example:
7085 HTML.with_charset "utf-8" use_thy "Hebrew";
7086 HTML.with_charset "utf-8" use_thy "Chinese";
7091 * Allow symlinks to all proper Isabelle executables (Isabelle,
7092 isabelle, isatool etc.).
7094 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
7095 isatool doc, isatool mkdir, display_drafts etc.).
7097 * isatool usedir: option -f allows specification of the ML file to be
7098 used by Isabelle; default is ROOT.ML.
7100 * New isatool version outputs the version identifier of the Isabelle
7101 distribution being used.
7103 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
7104 (containing Boolean satisfiability problems) into Isabelle/HOL
7109 New in Isabelle2004 (April 2004)
7110 --------------------------------
7114 * Provers/order.ML: new efficient reasoner for partial and linear orders.
7115 Replaces linorder.ML.
7117 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
7118 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
7119 (\<a>...\<z>), are now considered normal letters, and can therefore
7120 be used anywhere where an ASCII letter (a...zA...Z) has until
7121 now. COMPATIBILITY: This obviously changes the parsing of some
7122 terms, especially where a symbol has been used as a binder, say
7123 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
7124 as an identifier. Fix it by inserting a space around former
7125 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
7126 existing theory and ML files.
7128 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
7130 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
7131 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
7132 a normal (but invisible) letter. For multiple letter subscripts repeat
7133 \<^isub> like this: x\<^isub>1\<^isub>2.
7135 * Pure: There are now sub-/superscripts that can span more than one
7136 character. Text between \<^bsub> and \<^esub> is set in subscript in
7137 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
7138 superscript. The new control characters are not identifier parts.
7140 * Pure: Control-symbols of the form \<^raw:...> will literally print the
7141 content of "..." to the latex file instead of \isacntrl... . The "..."
7142 may consist of any printable characters excluding the end bracket >.
7144 * Pure: Using new Isar command "finalconsts" (or the ML functions
7145 Theory.add_finals or Theory.add_finals_i) it is now possible to
7146 declare constants "final", which prevents their being given a definition
7147 later. It is useful for constants whose behaviour is fixed axiomatically
7148 rather than definitionally, such as the meta-logic connectives.
7150 * Pure: 'instance' now handles general arities with general sorts
7151 (i.e. intersections of classes),
7153 * Presentation: generated HTML now uses a CSS style sheet to make layout
7154 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
7155 It can be changed to alter the colors/layout of generated pages.
7160 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
7161 cut_tac, subgoal_tac and thin_tac:
7162 - Now understand static (Isar) contexts. As a consequence, users of Isar
7163 locales are no longer forced to write Isar proof scripts.
7164 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
7166 - INCOMPATIBILITY: names of variables to be instantiated may no
7167 longer be enclosed in quotes. Instead, precede variable name with `?'.
7168 This is consistent with the instantiation attribute "where".
7170 * Attributes "where" and "of":
7171 - Now take type variables of instantiated theorem into account when reading
7172 the instantiation string. This fixes a bug that caused instantiated
7173 theorems to have too special types in some circumstances.
7174 - "where" permits explicit instantiations of type variables.
7176 * Calculation commands "moreover" and "also" no longer interfere with
7177 current facts ("this"), admitting arbitrary combinations with "then"
7181 - Goal statements involving the context element "includes" no longer
7182 generate theorems with internal delta predicates (those ending on
7183 "_axioms") in the premise.
7184 Resolve particular premise with <locale>.intro to obtain old form.
7185 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
7186 specification and "includes" elements in goal statement.
7187 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
7188 [intro?] and [elim?] (respectively) by default.
7189 - Experimental command for instantiation of locales in proof contexts:
7190 instantiate <label>[<attrs>]: <loc>
7191 Instantiates locale <loc> and adds all its theorems to the current context
7192 taking into account their attributes. Label and attrs are optional
7193 modifiers, like in theorem declarations. If present, names of
7194 instantiated theorems are qualified with <label>, and the attributes
7195 <attrs> are applied after any attributes these theorems might have already.
7196 If the locale has assumptions, a chained fact of the form
7197 "<loc> t1 ... tn" is expected from which instantiations of the parameters
7198 are derived. The command does not support old-style locales declared
7199 with "locale (open)".
7200 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
7202 * HOL: Tactic emulation methods induct_tac and case_tac understand static
7208 * Proof import: new image HOL4 contains the imported library from
7209 the HOL4 system with about 2500 theorems. It is imported by
7210 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
7211 can be used like any other Isabelle image. See
7212 HOL/Import/HOL/README for more information.
7215 - Much improved handling of linear and partial orders.
7216 Reasoners for linear and partial orders are set up for type classes
7217 "linorder" and "order" respectively, and are added to the default simpset
7218 as solvers. This means that the simplifier can build transitivity chains
7219 to solve goals from the assumptions.
7220 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
7221 of blast or auto after simplification become unnecessary because the goal
7222 is solved by simplification already.
7224 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
7225 all proved in axiomatic type classes for semirings, rings and fields.
7228 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
7229 now formalized using the Ring_and_Field theory mentioned above.
7230 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
7231 than before, because now they are set up once in a generic manner.
7232 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
7233 Look for the general versions in Ring_and_Field (and Power if they concern
7236 * Type "rat" of the rational numbers is now available in HOL-Complex.
7239 - Record types are now by default printed with their type abbreviation
7240 instead of the list of all field types. This can be configured via
7241 the reference "print_record_type_abbr".
7242 - Simproc "record_upd_simproc" for simplification of multiple updates added
7243 (not enabled by default).
7244 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
7245 EX x. x = sel r to True (not enabled by default).
7246 - Tactic "record_split_simp_tac" to split and simplify records added.
7248 * 'specification' command added, allowing for definition by
7249 specification. There is also an 'ax_specification' command that
7250 introduces the new constants axiomatically.
7252 * arith(_tac) is now able to generate counterexamples for reals as well.
7254 * HOL-Algebra: new locale "ring" for non-commutative rings.
7256 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
7257 definitions, thanks to Sava Krsti\'{c} and John Matthews.
7259 * HOL-Matrix: a first theory for matrices in HOL with an application of
7260 matrix theory to linear programming.
7262 * Unions and Intersections:
7263 The latex output syntax of UN and INT has been changed
7264 from "\Union x \in A. B" to "\Union_{x \in A} B"
7265 i.e. the index formulae has become a subscript.
7266 Similarly for "\Union x. B", and for \Inter instead of \Union.
7268 * Unions and Intersections over Intervals:
7269 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
7270 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
7271 like in normal math, and corresponding versions for < and for intersection.
7273 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
7274 lexicographic dictonary ordering has been added as "lexord".
7276 * ML: the legacy theory structures Int and List have been removed. They had
7277 conflicted with ML Basis Library structures having the same names.
7279 * 'refute' command added to search for (finite) countermodels. Only works
7280 for a fragment of HOL. The installation of an external SAT solver is
7281 highly recommended. See "HOL/Refute.thy" for details.
7283 * 'quickcheck' command: Allows to find counterexamples by evaluating
7284 formulae under an assignment of free variables to random values.
7285 In contrast to 'refute', it can deal with inductive datatypes,
7286 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
7292 * Streams now come with concatenation and are part of the HOLCF image
7296 New in Isabelle2003 (May 2003)
7297 ------------------------------
7301 * Provers/simplifier:
7303 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
7304 Assumptions are now subject to complete mutual simplification,
7305 not just from left to right. The simplifier now preserves
7306 the order of assumptions.
7308 Potential INCOMPATIBILITY:
7310 -- simp sometimes diverges where the old version did
7311 not, e.g. invoking simp on the goal
7313 [| P (f x); y = x; f x = f y |] ==> Q
7315 now gives rise to the infinite reduction sequence
7317 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
7319 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
7322 -- Tactics combining classical reasoner and simplification (such as auto)
7323 are also affected by this change, because many of them rely on
7324 simp. They may sometimes diverge as well or yield a different numbers
7325 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
7326 in case of problems. Sometimes subsequent calls to the classical
7327 reasoner will fail because a preceeding call to the simplifier too
7328 eagerly simplified the goal, e.g. deleted redundant premises.
7330 - The simplifier trace now shows the names of the applied rewrite rules
7332 - You can limit the number of recursive invocations of the simplifier
7333 during conditional rewriting (where the simplifie tries to solve the
7334 conditions before applying the rewrite rule):
7335 ML "simp_depth_limit := n"
7336 where n is an integer. Thus you can force termination where previously
7337 the simplifier would diverge.
7339 - Accepts free variables as head terms in congruence rules. Useful in Isar.
7341 - No longer aborts on failed congruence proof. Instead, the
7342 congruence is ignored.
7344 * Pure: New generic framework for extracting programs from constructive
7345 proofs. See HOL/Extraction.thy for an example instantiation, as well
7346 as HOL/Extraction for some case studies.
7348 * Pure: The main goal of the proof state is no longer shown by default, only
7349 the subgoals. This behaviour is controlled by a new flag.
7350 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
7351 (ML: Proof.show_main_goal).
7353 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
7354 rules whose conclusion matches subgoal 1:
7355 PG menu: Isabelle/Isar -> Show me -> matching rules
7356 The rules are ordered by how closely they match the subgoal.
7357 In particular, rules that solve a subgoal outright are displayed first
7358 (or rather last, the way they are printed).
7359 (ML: ProofGeneral.print_intros())
7361 * Pure: New flag trace_unify_fail causes unification to print
7362 diagnostic information (PG: in trace buffer) when it fails. This is
7363 useful for figuring out why single step proofs like rule, erule or
7366 * Pure: Locale specifications now produce predicate definitions
7367 according to the body of text (covering assumptions modulo local
7368 definitions); predicate "loc_axioms" covers newly introduced text,
7369 while "loc" is cumulative wrt. all included locale expressions; the
7370 latter view is presented only on export into the global theory
7371 context; potential INCOMPATIBILITY, use "(open)" option to fall back
7372 on the old view without predicates;
7374 * Pure: predefined locales "var" and "struct" are useful for sharing
7375 parameters (as in CASL, for example); just specify something like
7376 ``var x + var y + struct M'' as import;
7378 * Pure: improved thms_containing: proper indexing of facts instead of
7379 raw theorems; check validity of results wrt. current name space;
7380 include local facts of proof configuration (also covers active
7381 locales), cover fixed variables in index; may use "_" in term
7382 specification; an optional limit for the number of printed facts may
7383 be given (the default is 40);
7385 * Pure: disallow duplicate fact bindings within new-style theory files
7388 * Provers: improved induct method: assumptions introduced by case
7389 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
7390 the goal statement); "foo" still refers to all facts collectively;
7392 * Provers: the function blast.overloaded has been removed: all constants
7393 are regarded as potentially overloaded, which improves robustness in exchange
7394 for slight decrease in efficiency;
7396 * Provers/linorder: New generic prover for transitivity reasoning over
7397 linear orders. Note: this prover is not efficient!
7399 * Isar: preview of problems to finish 'show' now produce an error
7400 rather than just a warning (in interactive mode);
7407 - Produces a counter example if it cannot prove a goal.
7408 Note that the counter example may be spurious if the goal is not a formula
7409 of quantifier-free linear arithmetic.
7410 In ProofGeneral the counter example appears in the trace buffer.
7412 - Knows about div k and mod k where k is a numeral of type nat or int.
7414 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
7415 linear arithmetic fails. This takes account of quantifiers and divisibility.
7416 Presburger arithmetic can also be called explicitly via presburger(_tac).
7418 * simp's arithmetic capabilities have been enhanced a bit: it now
7419 takes ~= in premises into account (by performing a case split);
7421 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
7422 are distributed over a sum of terms;
7424 * New tactic "trans_tac" and method "trans" instantiate
7425 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
7428 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
7429 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
7431 * 'typedef' command has new option "open" to suppress the set
7434 * functions Min and Max on finite sets have been introduced (theory
7437 * attribute [symmetric] now works for relations as well; it turns
7438 (x,y) : R^-1 into (y,x) : R, and vice versa;
7440 * induct over a !!-quantified statement (say !!x1..xn):
7441 each "case" automatically performs "fix x1 .. xn" with exactly those names.
7443 * Map: `empty' is no longer a constant but a syntactic abbreviation for
7444 %x. None. Warning: empty_def now refers to the previously hidden definition
7447 * Algebra: formalization of classical algebra. Intended as base for
7448 any algebraic development in Isabelle. Currently covers group theory
7449 (up to Sylow's theorem) and ring theory (Universal Property of
7450 Univariate Polynomials). Contributions welcome;
7452 * GroupTheory: deleted, since its material has been moved to Algebra;
7454 * Complex: new directory of the complex numbers with numeric constants,
7455 nonstandard complex numbers, and some complex analysis, standard and
7456 nonstandard (Jacques Fleuriot);
7458 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
7460 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
7463 * Real/HahnBanach: updated and adapted to locales;
7465 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
7468 * UNITY: added the Meier-Sanders theory of progress sets;
7470 * MicroJava: bytecode verifier and lightweight bytecode verifier
7471 as abstract algorithms, instantiated to the JVM;
7473 * Bali: Java source language formalization. Type system, operational
7474 semantics, axiomatic semantics. Supported language features:
7475 classes, interfaces, objects,virtual methods, static methods,
7476 static/instance fields, arrays, access modifiers, definite
7477 assignment, exceptions.
7482 * ZF/Constructible: consistency proof for AC (Gdel's constructible
7485 * Main ZF: virtually all theories converted to new-style format;
7490 * Pure: Tactic.prove provides sane interface for internal proofs;
7491 omits the infamous "standard" operation, so this is more appropriate
7492 than prove_goalw_cterm in many situations (e.g. in simprocs);
7494 * Pure: improved error reporting of simprocs;
7496 * Provers: Simplifier.simproc(_i) provides sane interface for setting
7500 *** Document preparation ***
7502 * uses \par instead of \\ for line breaks in theory text. This may
7503 shift some page breaks in large documents. To get the old behaviour
7504 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
7506 * minimized dependencies of isabelle.sty and isabellesym.sty on
7509 * \<euro> now needs package babel/greek instead of marvosym (which
7512 * normal size for \<zero>...\<nine> (uses \mathbf instead of
7517 New in Isabelle2002 (March 2002)
7518 --------------------------------
7520 *** Document preparation ***
7522 * greatly simplified document preparation setup, including more
7523 graceful interpretation of isatool usedir -i/-d/-D options, and more
7524 instructive isatool mkdir; users should basically be able to get
7525 started with "isatool mkdir HOL Test && isatool make"; alternatively,
7526 users may run a separate document processing stage manually like this:
7527 "isatool usedir -D output HOL Test && isatool document Test/output";
7529 * theory dependency graph may now be incorporated into documents;
7530 isatool usedir -g true will produce session_graph.eps/.pdf for use
7531 with \includegraphics of LaTeX;
7533 * proper spacing of consecutive markup elements, especially text
7534 blocks after section headings;
7536 * support bold style (for single symbols only), input syntax is like
7537 this: "\<^bold>\<alpha>" or "\<^bold>A";
7539 * \<bullet> is now output as bold \cdot by default, which looks much
7540 better in printed text;
7542 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
7543 note that these symbols are currently unavailable in Proof General /
7544 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
7546 * isatool latex no longer depends on changed TEXINPUTS, instead
7547 isatool document copies the Isabelle style files to the target
7553 * Pure/Provers: improved proof by cases and induction;
7554 - 'case' command admits impromptu naming of parameters (such as
7556 - 'induct' method divinates rule instantiation from the inductive
7557 claim; no longer requires excessive ?P bindings for proper
7558 instantiation of cases;
7559 - 'induct' method properly enumerates all possibilities of set/type
7560 rules; as a consequence facts may be also passed through *type*
7561 rules without further ado;
7562 - 'induct' method now derives symbolic cases from the *rulified*
7563 rule (before it used to rulify cases stemming from the internal
7564 atomized version); this means that the context of a non-atomic
7565 statement becomes is included in the hypothesis, avoiding the
7566 slightly cumbersome show "PROP ?case" form;
7567 - 'induct' may now use elim-style induction rules without chaining
7568 facts, using ``missing'' premises from the goal state; this allows
7569 rules stemming from inductive sets to be applied in unstructured
7570 scripts, while still benefitting from proper handling of non-atomic
7571 statements; NB: major inductive premises need to be put first, all
7572 the rest of the goal is passed through the induction;
7573 - 'induct' proper support for mutual induction involving non-atomic
7574 rule statements (uses the new concept of simultaneous goals, see
7576 - append all possible rule selections, but only use the first
7577 success (no backtracking);
7578 - removed obsolete "(simplified)" and "(stripped)" options of methods;
7579 - undeclared rule case names default to numbers 1, 2, 3, ...;
7580 - added 'print_induct_rules' (covered by help item in recent Proof
7582 - moved induct/cases attributes to Pure, methods to Provers;
7583 - generic method setup instantiated for FOL and HOL;
7585 * Pure: support multiple simultaneous goal statements, for example
7586 "have a: A and b: B" (same for 'theorem' etc.); being a pure
7587 meta-level mechanism, this acts as if several individual goals had
7588 been stated separately; in particular common proof methods need to be
7589 repeated in order to cover all claims; note that a single elimination
7590 step is *not* sufficient to establish the two conjunctions, so this
7593 assume "A & B" then have A and B .. (*".." fails*)
7595 better use "obtain" in situations as above; alternative refer to
7596 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
7598 * Pure: proper integration with ``locales''; unlike the original
7599 version by Florian Kammller, Isar locales package high-level proof
7600 contexts rather than raw logical ones (e.g. we admit to include
7601 attributes everywhere); operations on locales include merge and
7602 rename; support for implicit arguments (``structures''); simultaneous
7603 type-inference over imports and text; see also HOL/ex/Locales.thy for
7606 * Pure: the following commands have been ``localized'', supporting a
7607 target locale specification "(in name)": 'lemma', 'theorem',
7608 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
7609 stored both within the locale and at the theory level (exported and
7610 qualified by the locale name);
7612 * Pure: theory goals may now be specified in ``long'' form, with
7613 ad-hoc contexts consisting of arbitrary locale elements. for example
7614 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
7615 definitions may be given, too); the result is a meta-level rule with
7616 the context elements being discharged in the obvious way;
7618 * Pure: new proof command 'using' allows to augment currently used
7619 facts after a goal statement ('using' is syntactically analogous to
7620 'apply', but acts on the goal's facts only); this allows chained facts
7621 to be separated into parts given before and after a claim, as in
7622 ``from a and b have C using d and e <proof>'';
7624 * Pure: renamed "antecedent" case to "rule_context";
7626 * Pure: new 'judgment' command records explicit information about the
7627 object-logic embedding (used by several tools internally); no longer
7628 use hard-wired "Trueprop";
7630 * Pure: added 'corollary' command;
7632 * Pure: fixed 'token_translation' command;
7634 * Pure: removed obsolete 'exported' attribute;
7636 * Pure: dummy pattern "_" in is/let is now automatically lifted over
7637 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
7638 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
7640 * Pure: method 'atomize' presents local goal premises as object-level
7641 statements (atomic meta-level propositions); setup controlled via
7642 rewrite rules declarations of 'atomize' attribute; example
7643 application: 'induct' method with proper rule statements in improper
7646 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
7647 now consider the syntactic context of assumptions, giving a better
7648 chance to get type-inference of the arguments right (this is
7649 especially important for locales);
7651 * Pure: "sorry" no longer requires quick_and_dirty in interactive
7654 * Pure/obtain: the formal conclusion "thesis", being marked as
7655 ``internal'', may no longer be reference directly in the text;
7656 potential INCOMPATIBILITY, may need to use "?thesis" in rare
7659 * Pure: generic 'sym' attribute which declares a rule both as pure
7660 'elim?' and for the 'symmetric' operation;
7662 * Pure: marginal comments ``--'' may now occur just anywhere in the
7663 text; the fixed correlation with particular command syntax has been
7666 * Pure: new method 'rules' is particularly well-suited for proof
7667 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
7668 but often produces more compact proof terms with less detours;
7670 * Pure/Provers/classical: simplified integration with pure rule
7671 attributes and methods; the classical "intro?/elim?/dest?"
7672 declarations coincide with the pure ones; the "rule" method no longer
7673 includes classically swapped intros; "intro" and "elim" methods no
7674 longer pick rules from the context; also got rid of ML declarations
7675 AddXIs/AddXEs/AddXDs; all of this has some potential for
7678 * Provers/classical: attribute 'swapped' produces classical inversions
7679 of introduction rules;
7681 * Provers/simplifier: 'simplified' attribute may refer to explicit
7682 rules instead of full simplifier context; 'iff' attribute handles
7685 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
7687 * HOL: 'recdef' now fails on unfinished automated proofs, use
7688 "(permissive)" option to recover old behavior;
7690 * HOL: 'inductive' no longer features separate (collective) attributes
7691 for 'intros' (was found too confusing);
7693 * HOL: properly declared induction rules less_induct and
7699 * HOL: moved over to sane numeral syntax; the new policy is as
7702 - 0 and 1 are polymorphic constants, which are defined on any
7703 numeric type (nat, int, real etc.);
7705 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
7706 binary representation internally;
7708 - type nat has special constructor Suc, and generally prefers Suc 0
7709 over 1::nat and Suc (Suc 0) over 2::nat;
7711 This change may cause significant problems of INCOMPATIBILITY; here
7712 are some hints on converting existing sources:
7714 - due to the new "num" token, "-0" and "-1" etc. are now atomic
7715 entities, so expressions involving "-" (unary or binary minus) need
7716 to be spaced properly;
7718 - existing occurrences of "1" may need to be constraint "1::nat" or
7719 even replaced by Suc 0; similar for old "2";
7721 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
7723 - remove all special provisions on numerals in proofs;
7725 * HOL: simp rules nat_number expand numerals on nat to Suc/0
7726 representation (depends on bin_arith_simps in the default context);
7728 * HOL: symbolic syntax for x^2 (numeral 2);
7730 * HOL: the class of all HOL types is now called "type" rather than
7731 "term"; INCOMPATIBILITY, need to adapt references to this type class
7732 in axclass/classes, instance/arities, and (usually rare) occurrences
7733 in typings (of consts etc.); internally the class is called
7734 "HOL.type", ML programs should refer to HOLogic.typeS;
7736 * HOL/record package improvements:
7737 - new derived operations "fields" to build a partial record section,
7738 "extend" to promote a fixed record to a record scheme, and
7739 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
7740 declared as simp by default;
7741 - shared operations ("more", "fields", etc.) now need to be always
7742 qualified) --- potential INCOMPATIBILITY;
7743 - removed "make_scheme" operations (use "make" with "extend") --
7745 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
7746 - provides cases/induct rules for use with corresponding Isar
7747 methods (for concrete records, record schemes, concrete more
7748 parts, and schematic more parts -- in that order);
7749 - internal definitions directly based on a light-weight abstract
7750 theory of product types over typedef rather than datatype;
7752 * HOL: generic code generator for generating executable ML code from
7753 specifications; specific support for HOL constructs such as inductive
7754 datatypes and sets, as well as recursive functions; can be invoked
7755 via 'generate_code' theory section;
7757 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
7759 * HOL: consolidated and renamed several theories. In particular:
7760 Ord.thy has been absorbed into HOL.thy
7761 String.thy has been absorbed into List.thy
7763 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
7764 (beware of argument permutation!);
7766 * HOL: linorder_less_split superseded by linorder_cases;
7768 * HOL/List: "nodups" renamed to "distinct";
7770 * HOL: added "The" definite description operator; move Hilbert's "Eps"
7771 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
7772 - Ex_def has changed, now need to use some_eq_ex
7774 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
7775 in this (rare) case use:
7777 delSWrapper "split_all_tac"
7778 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
7780 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
7783 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
7784 Isabelle's type classes, ^ on functions and relations has too general
7785 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
7786 necessary to attach explicit type constraints;
7788 * HOL/Relation: the prefix name of the infix "O" has been changed from
7789 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
7790 renamed accordingly (eg "compI" -> "rel_compI").
7792 * HOL: syntax translations now work properly with numerals and records
7795 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
7796 of "lam" -- INCOMPATIBILITY;
7798 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
7799 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
7800 renamed "Product_Type.unit";
7802 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
7804 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
7805 the "cases" method);
7807 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
7810 * HOL/IMP: updated and converted to new-style theory format; several
7811 parts turned into readable document, with proper Isar proof texts and
7812 some explanations (by Gerwin Klein);
7814 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
7816 * HOL-Hyperreal is now a logic image;
7821 * Isar: consts/constdefs supports mixfix syntax for continuous
7824 * Isar: domain package adapted to new-style theory format, e.g. see
7827 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
7828 potential INCOMPATIBILITY; now use plain induct_tac instead of former
7829 lift.induct_tac, always use UU instead of Undef;
7831 * HOLCF/IMP: updated and converted to new-style theory;
7836 * Isar: proper integration of logic-specific tools and packages,
7837 including theory commands '(co)inductive', '(co)datatype',
7838 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
7839 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
7841 * theory Main no longer includes AC; for the Axiom of Choice, base
7842 your theory on Main_ZFC;
7844 * the integer library now covers quotients and remainders, with many
7845 laws relating division to addition, multiplication, etc.;
7847 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
7848 typeless version of the formalism;
7850 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
7853 * ZF/Induct: new directory for examples of inductive definitions,
7854 including theory Multiset for multiset orderings; converted to
7855 new-style theory format;
7857 * ZF: many new theorems about lists, ordinals, etc.;
7862 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
7863 variable proof controls level of detail: 0 = no proofs (only oracle
7864 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
7865 also ref manual for further ML interfaces;
7867 * Pure/axclass: removed obsolete ML interface
7868 goal_subclass/goal_arity;
7870 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
7871 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
7872 separate tokens, so expressions involving minus need to be spaced
7875 * Pure/syntax: support non-oriented infixes, using keyword "infix"
7876 rather than "infixl" or "infixr";
7878 * Pure/syntax: concrete syntax for dummy type variables admits genuine
7879 sort constraint specifications in type inference; e.g. "x::_::foo"
7880 ensures that the type of "x" is of sort "foo" (but not necessarily a
7883 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
7884 control output of nested => (types); the default behavior is
7887 * Pure/syntax: builtin parse translation for "_constify" turns valued
7888 tokens into AST constants;
7890 * Pure/syntax: prefer later declarations of translations and print
7891 translation functions; potential INCOMPATIBILITY: need to reverse
7892 multiple declarations for same syntax element constant;
7894 * Pure/show_hyps reset by default (in accordance to existing Isar
7897 * Provers/classical: renamed addaltern to addafter, addSaltern to
7900 * Provers/clasimp: ``iff'' declarations now handle conditional rules
7903 * system: tested support for MacOS X; should be able to get Isabelle +
7904 Proof General to work in a plain Terminal after installing Poly/ML
7905 (e.g. from the Isabelle distribution area) and GNU bash alone
7906 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
7907 support requires further installations, e.g. from
7908 http://fink.sourceforge.net/);
7910 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
7912 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
7913 of 40 MB), cf. ML_OPTIONS;
7915 * system: Proof General keywords specification is now part of the
7916 Isabelle distribution (see etc/isar-keywords.el);
7918 * system: support for persistent Proof General sessions (refrain from
7919 outdating all loaded theories on startup); user may create writable
7920 logic images like this: ``isabelle -q HOL Test'';
7922 * system: smart selection of Isabelle process versus Isabelle
7923 interface, accommodates case-insensitive file systems (e.g. HFS+); may
7924 run both "isabelle" and "Isabelle" even if file names are badly
7925 damaged (executable inspects the case of the first letter of its own
7926 name); added separate "isabelle-process" and "isabelle-interface";
7928 * system: refrain from any attempt at filtering input streams; no
7929 longer support ``8bit'' encoding of old isabelle font, instead proper
7930 iso-latin characters may now be used; the related isatools
7931 "symbolinput" and "nonascii" have disappeared as well;
7933 * system: removed old "xterm" interface (the print modes "xterm" and
7934 "xterm_color" are still available for direct use in a suitable
7939 New in Isabelle99-2 (February 2001)
7940 -----------------------------------
7942 *** Overview of INCOMPATIBILITIES ***
7944 * HOL: please note that theories in the Library and elsewhere often use the
7945 new-style (Isar) format; to refer to their theorems in an ML script you must
7946 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
7948 * HOL: inductive package no longer splits induction rule aggressively,
7949 but only as far as specified by the introductions given; the old
7950 format may be recovered via ML function complete_split_rule or attribute
7951 'split_rule (complete)';
7953 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
7954 gfp_Tarski to gfp_unfold;
7956 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
7958 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
7959 relation); infix "^^" has been renamed "``"; infix "``" has been
7960 renamed "`"; "univalent" has been renamed "single_valued";
7962 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
7965 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
7967 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
7969 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
7970 consequence, it is no longer monotonic wrt. the local goal context
7971 (which is now passed through the inductive cases);
7973 * Document preparation: renamed standard symbols \<ll> to \<lless> and
7974 \<gg> to \<ggreater>;
7977 *** Document preparation ***
7979 * \isabellestyle{NAME} selects version of Isabelle output (currently
7980 available: are "it" for near math-mode best-style output, "sl" for
7981 slanted text style, and "tt" for plain type-writer; if no
7982 \isabellestyle command is given, output is according to slanted
7985 * support sub/super scripts (for single symbols only), input syntax is
7986 like this: "A\<^sup>*" or "A\<^sup>\<star>";
7988 * some more standard symbols; see Appendix A of the system manual for
7989 the complete list of symbols defined in isabellesym.sty;
7991 * improved isabelle style files; more abstract symbol implementation
7992 (should now use \isamath{...} and \isatext{...} in custom symbol
7995 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
7996 state; Note that presentation of goal states does not conform to
7997 actual human-readable proof documents. Please do not include goal
7998 states into document output unless you really know what you are doing!
8000 * proper indentation of antiquoted output with proportional LaTeX
8003 * no_document ML operator temporarily disables LaTeX document
8006 * isatool unsymbolize tunes sources for plain ASCII communication;
8011 * Pure: Isar now suffers initial goal statements to contain unbound
8012 schematic variables (this does not conform to actual readable proof
8013 documents, due to unpredictable outcome and non-compositional proof
8014 checking); users who know what they are doing may use schematic goals
8015 for Prolog-style synthesis of proven results;
8017 * Pure: assumption method (an implicit finishing) now handles actual
8020 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
8021 initial goal, declare "that" only as Pure intro (only for single
8022 steps); the "that" rule assumption may now be involved in implicit
8023 finishing, thus ".." becomes a feasible for trivial obtains;
8025 * Pure: default proof step now includes 'intro_classes'; thus trivial
8026 instance proofs may be performed by "..";
8028 * Pure: ?thesis / ?this / "..." now work for pure meta-level
8031 * Pure: more robust selection of calculational rules;
8033 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
8034 rule (as well as the assumption rule);
8036 * Pure: 'thm_deps' command visualizes dependencies of theorems and
8037 lemmas, using the graph browser tool;
8039 * Pure: predict failure of "show" in interactive mode;
8041 * Pure: 'thms_containing' now takes actual terms as arguments;
8043 * HOL: improved method 'induct' --- now handles non-atomic goals
8044 (potential INCOMPATIBILITY); tuned error handling;
8046 * HOL: cases and induct rules now provide explicit hints about the
8047 number of facts to be consumed (0 for "type" and 1 for "set" rules);
8048 any remaining facts are inserted into the goal verbatim;
8050 * HOL: local contexts (aka cases) may now contain term bindings as
8051 well; the 'cases' and 'induct' methods new provide a ?case binding for
8052 the result to be shown in each case;
8054 * HOL: added 'recdef_tc' command;
8056 * isatool convert assists in eliminating legacy ML scripts;
8061 * HOL/Library: a collection of generic theories to be used together
8062 with main HOL; the theory loader path already includes this directory
8063 by default; the following existing theories have been moved here:
8064 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
8065 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
8067 * HOL/Unix: "Some aspects of Unix file-system security", a typical
8068 modelling and verification task performed in Isabelle/HOL +
8069 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
8071 * HOL/Algebra: special summation operator SUM no longer exists, it has
8072 been replaced by setsum; infix 'assoc' now has priority 50 (like
8073 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
8074 'domain', this makes the theory consistent with mathematical
8077 * HOL basics: added overloaded operations "inverse" and "divide"
8078 (infix "/"), syntax for generic "abs" operation, generic summation
8081 * HOL/typedef: simplified package, provide more useful rules (see also
8084 * HOL/datatype: induction rule for arbitrarily branching datatypes is
8085 now expressed as a proper nested rule (old-style tactic scripts may
8086 require atomize_strip_tac to cope with non-atomic premises);
8088 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
8089 to "split_conv" (old name still available for compatibility);
8091 * HOL: improved concrete syntax for strings (e.g. allows translation
8092 rules with string literals);
8094 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
8095 and Fleuriot's mechanization of analysis, including the transcendental
8096 functions for the reals;
8098 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
8103 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
8104 "lam" is displayed as TWO lambda-symbols
8106 * CTT: theory Main now available, containing everything (that is, Bool
8112 * Pure: the Simplifier has been implemented properly as a derived rule
8113 outside of the actual kernel (at last!); the overall performance
8114 penalty in practical applications is about 50%, while reliability of
8115 the Isabelle inference kernel has been greatly improved;
8117 * print modes "brackets" and "no_brackets" control output of nested =>
8118 (types) and ==> (props); the default behaviour is "brackets";
8120 * Provers: fast_tac (and friends) now handle actual object-logic rules
8121 as assumptions as well;
8123 * system: support Poly/ML 4.0;
8125 * system: isatool install handles KDE version 1 or 2;
8129 New in Isabelle99-1 (October 2000)
8130 ----------------------------------
8132 *** Overview of INCOMPATIBILITIES ***
8134 * HOL: simplification of natural numbers is much changed; to partly
8135 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
8136 issue the following ML commands:
8138 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
8139 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
8141 * HOL: simplification no longer dives into case-expressions; this is
8142 controlled by "t.weak_case_cong" for each datatype t;
8144 * HOL: nat_less_induct renamed to less_induct;
8146 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
8147 fixsome to patch .thy and .ML sources automatically;
8149 select_equality -> some_equality
8150 select_eq_Ex -> some_eq_ex
8151 selectI2EX -> someI2_ex
8154 select1_equality -> some1_equality
8155 Eps_sym_eq -> some_sym_eq_trivial
8156 Eps_eq -> some_eq_trivial
8158 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
8160 * HOL: removed obsolete theorem binding expand_if (refer to split_if
8163 * HOL: the recursion equations generated by 'recdef' are now called
8164 f.simps instead of f.rules;
8166 * HOL: qed_spec_mp now also handles bounded ALL as well;
8168 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
8169 sometimes be needed;
8171 * HOL: the constant for "f``x" is now "image" rather than "op ``";
8173 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
8175 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
8176 product is now "<*>" instead of "Times"; the lexicographic product is
8177 now "<*lex*>" instead of "**";
8179 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
8180 of main HOL, but was unused); better use HOL's datatype package;
8182 * HOL: removed "symbols" syntax for constant "override" of theory Map;
8183 the old syntax may be recovered as follows:
8186 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
8187 (infixl "\\<oplus>" 100)
8189 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8191 * HOL/ML: even fewer consts are declared as global (see theories Ord,
8192 Lfp, Gfp, WF); this only affects ML packages that refer to const names
8195 * HOL and ZF: syntax for quotienting wrt an equivalence relation
8196 changed from A/r to A//r;
8198 * ZF: new treatment of arithmetic (nat & int) may break some old
8201 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
8202 rulify -> rule_format, elimify -> elim_format, ...);
8204 * Isar/Provers: intro/elim/dest attributes changed; renamed
8205 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
8206 should have to change intro!! to intro? only); replaced "delrule" by
8209 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
8211 * Provers: strengthened force_tac by using new first_best_tac;
8213 * LaTeX document preparation: several changes of isabelle.sty (see
8217 *** Document preparation ***
8219 * formal comments (text blocks etc.) in new-style theories may now
8220 contain antiquotations of thm/prop/term/typ/text to be presented
8221 according to latex print mode; concrete syntax is like this:
8222 @{term[show_types] "f(x) = a + x"};
8224 * isatool mkdir provides easy setup of Isabelle session directories,
8225 including proper document sources;
8227 * generated LaTeX sources are now deleted after successful run
8228 (isatool document -c); may retain a copy somewhere else via -D option
8231 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
8232 style files, achieving self-contained LaTeX sources and simplifying
8235 * old-style theories now produce (crude) LaTeX output as well;
8237 * browser info session directories are now self-contained (may be put
8238 on WWW server seperately); improved graphs of nested sessions; removed
8239 graph for 'all sessions';
8241 * several improvements in isabelle style files; \isabellestyle{it}
8242 produces fake math mode output; \isamarkupheader is now \section by
8243 default; see lib/texinputs/isabelle.sty etc.;
8248 * Isar/Pure: local results and corresponding term bindings are now
8249 subject to Hindley-Milner polymorphism (similar to ML); this
8250 accommodates incremental type-inference very nicely;
8252 * Isar/Pure: new derived language element 'obtain' supports
8253 generalized existence reasoning;
8255 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
8256 support accumulation of results, without applying any rules yet;
8257 useful to collect intermediate results without explicit name
8258 references, and for use with transitivity rules with more than 2
8261 * Isar/Pure: scalable support for case-analysis type proofs: new
8262 'case' language element refers to local contexts symbolically, as
8263 produced by certain proof methods; internally, case names are attached
8264 to theorems as "tags";
8266 * Isar/Pure: theory command 'hide' removes declarations from
8267 class/type/const name spaces;
8269 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
8270 indicate potential overloading;
8272 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
8274 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
8275 "{a,b,c}" instead of {a,b,c};
8277 * Isar/Pure now provides its own version of intro/elim/dest
8278 attributes; useful for building new logics, but beware of confusion
8279 with the version in Provers/classical;
8281 * Isar/Pure: the local context of (non-atomic) goals is provided via
8282 case name 'antecedent';
8284 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
8285 to the current context is now done automatically);
8287 * Isar/Pure: theory command 'method_setup' provides a simple interface
8288 for definining proof methods in ML;
8290 * Isar/Provers: intro/elim/dest attributes changed; renamed
8291 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
8292 most cases, one should have to change intro!! to intro? only);
8293 replaced "delrule" by "rule del";
8295 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
8296 'symmetric' attribute (the latter supercedes [RS sym]);
8298 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
8299 method modifier); 'simp' method: 'only:' modifier removes loopers as
8300 well (including splits);
8302 * Isar/Provers: Simplifier and Classical methods now support all kind
8303 of modifiers used in the past, including 'cong', 'iff', etc.
8305 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
8306 of Simplifier and Classical reasoner);
8308 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
8309 now support named cases; major packages (inductive, datatype, primrec,
8310 recdef) support case names and properly name parameters;
8312 * Isar/HOL: new transitivity rules for substitution in inequalities --
8313 monotonicity conditions are extracted to be proven at end of
8316 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
8319 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
8320 split_if split_if_asm; datatype package provides theorems foo.splits =
8321 foo.split foo.split_asm for each datatype;
8323 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
8324 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
8325 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
8326 use "(cases (simplified))" method in proper proof texts);
8328 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
8330 * Isar: names of theorems etc. may be natural numbers as well;
8332 * Isar: 'pr' command: optional arguments for goals_limit and
8333 ProofContext.prems_limit; no longer prints theory contexts, but only
8336 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
8337 additional print modes to be specified; e.g. "pr(latex)" will print
8338 proof state according to the Isabelle LaTeX style;
8340 * Isar: improved support for emulating tactic scripts, including proof
8341 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
8342 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
8343 (for HOL datatypes);
8345 * Isar: simplified (more robust) goal selection of proof methods: 1st
8346 goal, all goals, or explicit goal specifier (tactic emulation); thus
8347 'proof method scripts' have to be in depth-first order;
8349 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
8351 * Isar: removed 'help' command, which hasn't been too helpful anyway;
8352 should instead use individual commands for printing items
8353 (print_commands, print_methods etc.);
8355 * Isar: added 'nothing' --- the empty list of theorems;
8360 * HOL/MicroJava: formalization of a fragment of Java, together with a
8361 corresponding virtual machine and a specification of its bytecode
8362 verifier and a lightweight bytecode verifier, including proofs of
8363 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
8364 Cornelia Pusch (see also the homepage of project Bali at
8365 http://isabelle.in.tum.de/Bali/);
8367 * HOL/Algebra: new theory of rings and univariate polynomials, by
8370 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
8371 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
8374 * HOL/Lattice: fundamental concepts of lattice theory and order
8375 structures, including duals, properties of bounds versus algebraic
8376 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
8377 Theorem for complete lattices etc.; may also serve as a demonstration
8378 for abstract algebraic reasoning using axiomatic type classes, and
8379 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
8381 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
8384 * HOL/IMPP: extension of IMP with local variables and mutually
8385 recursive procedures, by David von Oheimb;
8387 * HOL/Lambda: converted into new-style theory and document;
8389 * HOL/ex/Multiquote: example of multiple nested quotations and
8390 anti-quotations -- basically a generalized version of de-Bruijn
8391 representation; very useful in avoiding lifting of operations;
8393 * HOL/record: added general record equality rule to simpset; fixed
8394 select-update simplification procedure to handle extended records as
8395 well; admit "r" as field name;
8397 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
8398 other numeric types and also as the identity of groups, rings, etc.;
8400 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
8401 Types nat and int belong to this axclass;
8403 * HOL: greatly improved simplification involving numerals of type nat, int, real:
8404 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
8405 i*j + k + j*#3*i simplifies to #4*(i*j) + k
8406 two terms #m*u and #n*u are replaced by #(m+n)*u
8407 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
8408 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
8409 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
8411 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
8412 powerful prover for predicate logic but knows nothing of clasets; see
8413 ex/mesontest.ML and ex/mesontest2.ML for example applications;
8415 * HOL: new version of "case_tac" subsumes both boolean case split and
8416 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
8417 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
8419 * HOL: simplification no longer dives into case-expressions: only the
8420 selector expression is simplified, but not the remaining arms; to
8421 enable full simplification of case-expressions for datatype t, you may
8422 remove t.weak_case_cong from the simpset, either globally (Delcongs
8423 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
8425 * HOL/recdef: the recursion equations generated by 'recdef' for
8426 function 'f' are now called f.simps instead of f.rules; if all
8427 termination conditions are proved automatically, these simplification
8428 rules are added to the simpset, as in primrec; rules may be named
8429 individually as well, resulting in a separate list of theorems for
8432 * HOL/While is a new theory that provides a while-combinator. It
8433 permits the definition of tail-recursive functions without the
8434 provision of a termination measure. The latter is necessary once the
8435 invariant proof rule for while is applied.
8437 * HOL: new (overloaded) notation for the set of elements below/above
8438 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
8440 * HOL: theorems impI, allI, ballI bound as "strip";
8442 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
8443 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
8444 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
8446 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8448 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
8449 main HOL, but was unused);
8451 * HOL: fewer consts declared as global (e.g. have to refer to
8452 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
8454 * HOL: tuned AST representation of nested pairs, avoiding bogus output
8455 in case of overlap with user translations (e.g. judgements over
8456 tuples); (note that the underlying logical represenation is still
8462 * ZF: simplification automatically cancels common terms in arithmetic
8463 expressions over nat and int;
8465 * ZF: new treatment of nat to minimize type-checking: all operators
8466 coerce their operands to a natural number using the function natify,
8467 making the algebraic laws unconditional;
8469 * ZF: as above, for int: operators coerce their operands to an integer
8470 using the function intify;
8472 * ZF: the integer library now contains many of the usual laws for the
8473 orderings, including $<=, and monotonicity laws for $+ and $*;
8475 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
8478 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
8479 to the simplifier and classical reasoner simultaneously;
8484 * Provers: blast_tac now handles actual object-logic rules as
8485 assumptions; note that auto_tac uses blast_tac internally as well;
8487 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
8488 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
8490 * Provers: delrules now handles destruct rules as well (no longer need
8491 explicit make_elim);
8493 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
8494 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8495 use instead the strong form,
8496 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8497 in HOL, FOL and ZF the function cla_make_elim will create such rules
8498 from destruct-rules;
8500 * Provers: Simplifier.easy_setup provides a fast path to basic
8501 Simplifier setup for new object-logics;
8503 * Pure: AST translation rules no longer require constant head on LHS;
8505 * Pure: improved name spaces: ambiguous output is qualified; support
8506 for hiding of names;
8508 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
8509 XSYMBOL_HOME; no longer need to do manual configuration in most
8512 * system: compression of ML heaps images may now be controlled via -c
8513 option of isabelle and isatool usedir (currently only observed by
8516 * system: isatool installfonts may handle X-Symbol fonts as well (very
8517 useful for remote X11);
8519 * system: provide TAGS file for Isabelle sources;
8521 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
8524 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
8525 timing flag supersedes proof_timing and Toplevel.trace;
8527 * ML: new combinators |>> and |>>> for incremental transformations
8528 with secondary results (e.g. certain theory extensions):
8530 * ML: PureThy.add_defs gets additional argument to indicate potential
8531 overloading (usually false);
8533 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
8538 New in Isabelle99 (October 1999)
8539 --------------------------------
8541 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8543 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
8544 are no longer simplified. (This allows the simplifier to unfold recursive
8545 functional programs.) To restore the old behaviour, declare
8547 Delcongs [if_weak_cong];
8549 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
8552 * HOL: the predicate "inj" is now defined by translation to "inj_on";
8554 * HOL/datatype: mutual_induct_tac no longer exists --
8555 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
8557 * HOL/typedef: fixed type inference for representing set; type
8558 arguments now have to occur explicitly on the rhs as type constraints;
8560 * ZF: The con_defs part of an inductive definition may no longer refer
8561 to constants declared in the same theory;
8563 * HOL, ZF: the function mk_cases, generated by the inductive
8564 definition package, has lost an argument. To simplify its result, it
8565 uses the default simpset instead of a supplied list of theorems.
8567 * HOL/List: the constructors of type list are now Nil and Cons;
8569 * Simplifier: the type of the infix ML functions
8570 setSSolver addSSolver setSolver addSolver
8571 is now simpset * solver -> simpset where `solver' is a new abstract type
8572 for packaging solvers. A solver is created via
8573 mk_solver: string -> (thm list -> int -> tactic) -> solver
8574 where the string argument is only a comment.
8579 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
8580 decision procedure for linear arithmetic. Currently it is used for
8581 types `nat', `int', and `real' in HOL (see below); it can, should and
8582 will be instantiated for other types and logics as well.
8584 * The simplifier now accepts rewrite rules with flexible heads, eg
8585 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
8586 They are applied like any rule with a non-pattern lhs, i.e. by first-order
8592 * New Isabelle/Isar subsystem provides an alternative to traditional
8593 tactical theorem proving; together with the ProofGeneral/isar user
8594 interface it offers an interactive environment for developing human
8595 readable proof documents (Isar == Intelligible semi-automated
8596 reasoning); for further information see isatool doc isar-ref,
8597 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
8599 * improved and simplified presentation of theories: better HTML markup
8600 (including colors), graph views in several sizes; isatool usedir now
8601 provides a proper interface for user theories (via -P option); actual
8602 document preparation based on (PDF)LaTeX is available as well (for
8603 new-style theories only); see isatool doc system for more information;
8605 * native support for Proof General, both for classic Isabelle and
8608 * ML function thm_deps visualizes dependencies of theorems and lemmas,
8609 using the graph browser tool;
8611 * Isabelle manuals now also available as PDF;
8613 * theory loader rewritten from scratch (may not be fully
8614 bug-compatible); old loadpath variable has been replaced by show_path,
8615 add_path, del_path, reset_path functions; new operations such as
8616 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
8619 * improved isatool install: option -k creates KDE application icon,
8620 option -p DIR installs standalone binaries;
8622 * added ML_PLATFORM setting (useful for cross-platform installations);
8623 more robust handling of platform specific ML images for SML/NJ;
8625 * the settings environment is now statically scoped, i.e. it is never
8626 created again in sub-processes invoked from isabelle, isatool, or
8629 * path element specification '~~' refers to '$ISABELLE_HOME';
8631 * in locales, the "assumes" and "defines" parts may be omitted if
8634 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
8637 * new print_mode "HTML";
8639 * new flag show_tags controls display of tags of theorems (which are
8640 basically just comments that may be attached by some tools);
8642 * Isamode 2.6 requires patch to accomodate change of Isabelle font
8643 mode and goal output format:
8645 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
8647 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
8649 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
8650 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
8652 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
8654 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
8656 * function bind_thms stores lists of theorems (cf. bind_thm);
8658 * new shorthand tactics ftac, eatac, datac, fatac;
8660 * qed (and friends) now accept "" as result name; in that case the
8661 theorem is not stored, but proper checks and presentation of the
8664 * theorem database now also indexes constants "Trueprop", "all",
8665 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
8670 ** HOL arithmetic **
8672 * There are now decision procedures for linear arithmetic over nat and
8675 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
8676 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
8677 are treated as atomic; subformulae not involving type `nat' or `int'
8678 are ignored; quantified subformulae are ignored unless they are
8679 positive universal or negative existential. The tactic has to be
8680 invoked by hand and can be a little bit slow. In particular, the
8681 running time is exponential in the number of occurrences of `min' and
8682 `max', and `-' on `nat'.
8684 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
8685 (negated) (in)equalities among the premises and the conclusion into
8686 account (i.e. no compound formulae) and does not know about `min' and
8687 `max', and `-' on `nat'. It is fast and is used automatically by the
8690 NB: At the moment, these decision procedures do not cope with mixed
8691 nat/int formulae where the two parts interact, such as `m < n ==>
8694 * HOL/Numeral provides a generic theory of numerals (encoded
8695 efficiently as bit strings); setup for types nat/int/real is in place;
8696 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
8697 int, existing theories and proof scripts may require a few additional
8700 * integer division and remainder can now be performed on constant
8703 * many properties of integer multiplication, division and remainder
8706 * An interface to the Stanford Validity Checker (SVC) is available through the
8707 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
8708 are proved automatically. SVC must be installed separately, and its results
8709 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
8710 invocation of the underlying oracle). For SVC see
8711 http://verify.stanford.edu/SVC
8713 * IsaMakefile: the HOL-Real target now builds an actual image;
8718 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
8719 (in Isabelle/Isar) -- by Gertrud Bauer;
8721 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
8722 analysis for assembly languages with subtypes;
8724 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
8725 -- avoids syntactic ambiguities and treats state, transition, and
8726 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
8727 changed syntax and (many) tactics;
8729 * HOL/inductive: Now also handles more general introduction rules such
8730 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
8731 theorems are now maintained within the theory (maintained via the
8734 * HOL/datatype: Now also handles arbitrarily branching datatypes
8735 (using function types) such as
8737 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
8739 * HOL/record: record_simproc (part of the default simpset) takes care
8740 of selectors applied to updated records; record_split_tac is no longer
8741 part of the default claset; update_defs may now be removed from the
8742 simpset in many cases; COMPATIBILITY: old behavior achieved by
8744 claset_ref () := claset() addSWrapper record_split_wrapper;
8745 Delsimprocs [record_simproc]
8747 * HOL/typedef: fixed type inference for representing set; type
8748 arguments now have to occur explicitly on the rhs as type constraints;
8750 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
8751 names rather than an ML expression;
8753 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
8754 supplied later. Program schemes can be defined, such as
8755 "While B C s = (if B s then While B C (C s) else s)"
8756 where the well-founded relation can be chosen after B and C have been given.
8758 * HOL/List: the constructors of type list are now Nil and Cons;
8759 INCOMPATIBILITY: while [] and infix # syntax is still there, of
8760 course, ML tools referring to List.list.op # etc. have to be adapted;
8762 * HOL_quantifiers flag superseded by "HOL" print mode, which is
8763 disabled by default; run isabelle with option -m HOL to get back to
8764 the original Gordon/HOL-style output;
8766 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
8767 ALL x<=y. P, EX x<y. P, EX x<=y. P;
8769 * HOL basic syntax simplified (more orthogonal): all variants of
8770 All/Ex now support plain / symbolic / HOL notation; plain syntax for
8771 Eps operator is provided as well: "SOME x. P[x]";
8773 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
8775 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
8776 thus available for user theories;
8778 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
8779 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
8782 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
8783 several times and then mp;
8788 * the notation <<...>> is now available as a notation for sequences of
8791 * the simplifier is now installed
8793 * the axiom system has been generalized (thanks to Soren Heilmann)
8795 * the classical reasoner now has a default rule database
8800 * new primrec section allows primitive recursive functions to be given
8801 directly (as in HOL) over datatypes and the natural numbers;
8803 * new tactics induct_tac and exhaust_tac for induction (or case
8804 analysis) over datatypes and the natural numbers;
8806 * the datatype declaration of type T now defines the recursor T_rec;
8808 * simplification automatically does freeness reasoning for datatype
8811 * automatic type-inference, with AddTCs command to insert new
8812 type-checking rules;
8814 * datatype introduction rules are now added as Safe Introduction rules
8817 * the syntax "if P then x else y" is now available in addition to
8821 *** Internal programming interfaces ***
8823 * tuned simplifier trace output; new flag debug_simp;
8825 * structures Vartab / Termtab (instances of TableFun) offer efficient
8826 tables indexed by indexname_ord / term_ord (compatible with aconv);
8828 * AxClass.axclass_tac lost the theory argument;
8830 * tuned current_goals_markers semantics: begin / end goal avoids
8831 printing empty lines;
8833 * removed prs and prs_fn hook, which was broken because it did not
8834 include \n in its semantics, forcing writeln to add one
8835 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
8836 string -> unit if you really want to output text without newline;
8838 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
8839 plain output, interface builders may have to enable 'isabelle_font'
8840 mode to get Isabelle font glyphs as before;
8842 * refined token_translation interface; INCOMPATIBILITY: output length
8843 now of type real instead of int;
8845 * theory loader actions may be traced via new ThyInfo.add_hook
8846 interface (see src/Pure/Thy/thy_info.ML); example application: keep
8847 your own database of information attached to *whole* theories -- as
8848 opposed to intra-theory data slots offered via TheoryDataFun;
8850 * proper handling of dangling sort hypotheses (at last!);
8851 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
8852 extra sort hypotheses that can be witnessed from the type signature;
8853 the force_strip_shyps flag is gone, any remaining shyps are simply
8854 left in the theorem (with a warning issued by strip_shyps_warning);
8858 New in Isabelle98-1 (October 1998)
8859 ----------------------------------
8861 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8863 * several changes of automated proof tools;
8865 * HOL: major changes to the inductive and datatype packages, including
8866 some minor incompatibilities of theory syntax;
8868 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
8871 * HOL: removed duplicate thms in Arith:
8872 less_imp_add_less should be replaced by trans_less_add1
8873 le_imp_add_le should be replaced by trans_le_add1
8875 * HOL: unary minus is now overloaded (new type constraints may be
8878 * HOL and ZF: unary minus for integers is now #- instead of #~. In
8879 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
8880 now taken as an integer constant.
8882 * Pure: ML function 'theory_of' renamed to 'theory';
8888 1. Asm_full_simp_tac is now more aggressive.
8889 1. It will sometimes reorient premises if that increases their power to
8891 2. It does no longer proceed strictly from left to right but may also
8892 rotate premises to achieve further simplification.
8893 For compatibility reasons there is now Asm_lr_simp_tac which is like the
8894 old Asm_full_simp_tac in that it does not rotate premises.
8895 2. The simplifier now knows a little bit about nat-arithmetic.
8897 * Classical reasoner: wrapper mechanism for the classical reasoner now
8898 allows for selected deletion of wrappers, by introduction of names for
8899 wrapper functionals. This implies that addbefore, addSbefore,
8900 addaltern, and addSaltern now take a pair (name, tactic) as argument,
8901 and that adding two tactics with the same name overwrites the first
8902 one (emitting a warning).
8903 type wrapper = (int -> tactic) -> (int -> tactic)
8904 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
8905 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
8906 delWrapper, delSWrapper: claset * string -> claset
8907 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
8909 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
8910 semantics; addbefore now affects only the unsafe part of step_tac
8911 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
8912 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
8915 * Classical reasoner: setwrapper to setWrapper and compwrapper to
8916 compWrapper; added safe wrapper (and access functions for it);
8918 * HOL/split_all_tac is now much faster and fails if there is nothing
8919 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
8920 and the names of the automatically generated variables have changed.
8921 split_all_tac has moved within claset() from unsafe wrappers to safe
8922 wrappers, which means that !!-bound variables are split much more
8923 aggressively, and safe_tac and clarify_tac now split such variables.
8924 If this splitting is not appropriate, use delSWrapper "split_all_tac".
8925 Note: the same holds for record_split_tac, which does the job of
8926 split_all_tac for record fields.
8928 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
8929 permanently to the default simpset using Addsplits just like
8930 Addsimps. They can be removed via Delsplits just like
8931 Delsimps. Lower-case versions are also available.
8933 * HOL/Simplifier: The rule split_if is now part of the default
8934 simpset. This means that the simplifier will eliminate all occurrences
8935 of if-then-else in the conclusion of a goal. To prevent this, you can
8936 either remove split_if completely from the default simpset by
8937 `Delsplits [split_if]' or remove it in a specific call of the
8938 simplifier using `... delsplits [split_if]'. You can also add/delete
8939 other case splitting rules to/from the default simpset: every datatype
8940 generates suitable rules `split_t_case' and `split_t_case_asm' (where
8941 t is the name of the datatype).
8943 * Classical reasoner / Simplifier combination: new force_tac (and
8944 derivatives Force_tac, force) combines rewriting and classical
8945 reasoning (and whatever other tools) similarly to auto_tac, but is
8946 aimed to solve the given subgoal completely.
8951 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
8952 and `goalw': the theory is no longer needed as an explicit argument -
8953 the current theory context is used; assumptions are no longer returned
8954 at the ML-level unless one of them starts with ==> or !!; it is
8955 recommended to convert to these new commands using isatool fixgoal
8956 (backup your sources first!);
8958 * new top-level commands 'thm' and 'thms' for retrieving theorems from
8959 the current theory context, and 'theory' to lookup stored theories;
8961 * new theory section 'locale' for declaring constants, assumptions and
8962 definitions that have local scope;
8964 * new theory section 'nonterminals' for purely syntactic types;
8966 * new theory section 'setup' for generic ML setup functions
8967 (e.g. package initialization);
8969 * the distribution now includes Isabelle icons: see
8970 lib/logo/isabelle-{small,tiny}.xpm;
8972 * isatool install - install binaries with absolute references to
8975 * isatool logo -- create instances of the Isabelle logo (as EPS);
8977 * print mode 'emacs' reserved for Isamode;
8979 * support multiple print (ast) translations per constant name;
8981 * theorems involving oracles are now printed with a suffixed [!];
8986 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
8988 * HOL/inductive package reorganized and improved: now supports mutual
8994 oddI "n : EVEN ==> Suc n : ODD"
8995 evenI "n : ODD ==> Suc n : EVEN"
8997 new theorem list "elims" contains an elimination rule for each of the
8998 recursive sets; inductive definitions now handle disjunctive premises
8999 correctly (also ZF);
9001 INCOMPATIBILITIES: requires Inductive as an ancestor; component
9002 "mutual_induct" no longer exists - the induction rule is always
9003 contained in "induct";
9006 * HOL/datatype package re-implemented and greatly improved: now
9007 supports mutually recursive datatypes such as
9010 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
9011 | SUM ('a aexp) ('a aexp)
9012 | DIFF ('a aexp) ('a aexp)
9015 'a bexp = LESS ('a aexp) ('a aexp)
9016 | AND ('a bexp) ('a bexp)
9017 | OR ('a bexp) ('a bexp)
9019 as well as indirectly recursive datatypes such as
9022 ('a, 'b) term = Var 'a
9023 | App 'b ((('a, 'b) term) list)
9025 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
9026 induction on mutually / indirectly recursive datatypes.
9028 Primrec equations are now stored in theory and can be accessed via
9029 <function_name>.simps.
9033 - Theories using datatypes must now have theory Datatype as an
9035 - The specific <typename>.induct_tac no longer exists - use the
9036 generic induct_tac instead.
9037 - natE has been renamed to nat.exhaust - use exhaust_tac
9038 instead of res_inst_tac ... natE. Note that the variable
9039 names in nat.exhaust differ from the names in natE, this
9040 may cause some "fragile" proofs to fail.
9041 - The theorems split_<typename>_case and split_<typename>_case_asm
9042 have been renamed to <typename>.split and <typename>.split_asm.
9043 - Since default sorts of type variables are now handled correctly,
9044 some datatype definitions may have to be annotated with explicit
9046 - Primrec definitions no longer require function name and type
9047 of recursive argument.
9049 Consider using isatool fixdatatype to adapt your theories and proof
9050 scripts to the new package (backup your sources first!).
9053 * HOL/record package: considerably improved implementation; now
9054 includes concrete syntax for record types, terms, updates; theorems
9055 for surjective pairing and splitting !!-bound record variables; proof
9056 support is as follows:
9058 1) standard conversions (selectors or updates applied to record
9059 constructor terms) are part of the standard simpset;
9061 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
9062 made part of standard simpset and claset via addIffs;
9064 3) a tactic for record field splitting (record_split_tac) is part of
9065 the standard claset (addSWrapper);
9067 To get a better idea about these rules you may retrieve them via
9068 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
9069 the name of your record type.
9071 The split tactic 3) conceptually simplifies by the following rule:
9073 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
9075 Thus any record variable that is bound by meta-all will automatically
9076 blow up into some record constructor term, consequently the
9077 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
9078 solve record problems automatically.
9081 * reorganized the main HOL image: HOL/Integ and String loaded by
9082 default; theory Main includes everything;
9084 * automatic simplification of integer sums and comparisons, using cancellation;
9086 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
9088 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
9090 * many new identities for unions, intersections, set difference, etc.;
9092 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
9093 called split_if, split_split, split_sum_case and split_nat_case (to go
9094 with add/delsplits);
9096 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
9097 (?x::unit) = (); this is made part of the default simpset, which COULD
9098 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
9099 'Delsimprocs [unit_eq_proc];' as last resort); also note that
9100 unit_abs_eta_conv is added in order to counter the effect of
9101 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
9104 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
9107 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9108 It and 'sym RS equals0D' are now in the default claset, giving automatic
9109 disjointness reasoning but breaking a few old proofs.
9111 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
9112 to 'converse' from 'inverse' (for compatibility with ZF and some
9115 * HOL/recdef can now declare non-recursive functions, with {} supplied as
9116 the well-founded relation;
9118 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
9119 Compl A. The "Compl" syntax remains available as input syntax for this
9122 * HOL/Update: new theory of function updates:
9123 f(a:=b) == %x. if x=a then b else f x
9124 may also be iterated as in f(a:=b,c:=d,...);
9126 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
9129 - new function list_update written xs[i:=v] that updates the i-th
9130 list position. May also be iterated as in xs[i:=a,j:=b,...].
9131 - new function `upt' written [i..j(] which generates the list
9132 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
9133 bound write [i..j], which is a shorthand for [i..j+1(].
9134 - new lexicographic orderings and corresponding wellfoundedness theorems.
9137 - removed 'pred' (predecessor) function;
9138 - generalized some theorems about n-1;
9139 - many new laws about "div" and "mod";
9140 - new laws about greatest common divisors (see theory ex/Primes);
9142 * HOL/Relation: renamed the relational operator r^-1 "converse"
9143 instead of "inverse";
9145 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
9146 of the multiset ordering;
9148 * directory HOL/Real: a construction of the reals using Dedekind cuts
9149 (not included by default);
9151 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
9153 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
9154 programs, i.e. different program variables may have different types.
9156 * calling (stac rew i) now fails if "rew" has no effect on the goal
9157 [previously, this check worked only if the rewrite rule was unconditional]
9158 Now rew can involve either definitions or equalities (either == or =).
9163 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
9164 only the theorems proved on ZF.ML;
9166 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9167 It and 'sym RS equals0D' are now in the default claset, giving automatic
9168 disjointness reasoning but breaking a few old proofs.
9170 * ZF/Update: new theory of function updates
9171 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
9172 may also be iterated as in f(a:=b,c:=d,...);
9174 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
9176 * calling (stac rew i) now fails if "rew" has no effect on the goal
9177 [previously, this check worked only if the rewrite rule was unconditional]
9178 Now rew can involve either definitions or equalities (either == or =).
9180 * case_tac provided for compatibility with HOL
9181 (like the old excluded_middle_tac, but with subgoals swapped)
9184 *** Internal programming interfaces ***
9186 * Pure: several new basic modules made available for general use, see
9187 also src/Pure/README;
9189 * improved the theory data mechanism to support encapsulation (data
9190 kind name replaced by private Object.kind, acting as authorization
9191 key); new type-safe user interface via functor TheoryDataFun; generic
9192 print_data function becomes basically useless;
9194 * removed global_names compatibility flag -- all theory declarations
9195 are qualified by default;
9197 * module Pure/Syntax now offers quote / antiquote translation
9198 functions (useful for Hoare logic etc. with implicit dependencies);
9199 see HOL/ex/Antiquote for an example use;
9201 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
9204 * new tactical CHANGED_GOAL for checking that a tactic modifies a
9207 * Display.print_goals function moved to Locale.print_goals;
9209 * standard print function for goals supports current_goals_markers
9210 variable for marking begin of proof, end of proof, start of goal; the
9211 default is ("", "", ""); setting current_goals_markers := ("<proof>",
9212 "</proof>", "<goal>") causes SGML like tagged proof state printing,
9217 New in Isabelle98 (January 1998)
9218 --------------------------------
9220 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9222 * changed lexical syntax of terms / types: dots made part of long
9223 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
9225 * simpset (and claset) reference variable replaced by functions
9226 simpset / simpset_ref;
9228 * no longer supports theory aliases (via merge) and non-trivial
9229 implicit merge of thms' signatures;
9231 * most internal names of constants changed due to qualified names;
9233 * changed Pure/Sequence interface (see Pure/seq.ML);
9236 *** General Changes ***
9238 * hierachically structured name spaces (for consts, types, axms, thms
9239 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
9240 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
9241 isatool fixdots ensures space after dots (e.g. "%x. x"); set
9242 long_names for fully qualified output names; NOTE: ML programs
9243 (special tactics, packages etc.) referring to internal names may have
9244 to be adapted to cope with fully qualified names; in case of severe
9245 backward campatibility problems try setting 'global_names' at compile
9246 time to have enrything declared within a flat name space; one may also
9247 fine tune name declarations in theories via the 'global' and 'local'
9250 * reimplemented the implicit simpset and claset using the new anytype
9251 data filed in signatures; references simpset:simpset ref etc. are
9252 replaced by functions simpset:unit->simpset and
9253 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
9254 to patch your ML files accordingly;
9256 * HTML output now includes theory graph data for display with Java
9257 applet or isatool browser; data generated automatically via isatool
9258 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
9260 * defs may now be conditional; improved rewrite_goals_tac to handle
9261 conditional equations;
9263 * defs now admits additional type arguments, using TYPE('a) syntax;
9265 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
9266 creates a new theory node; implicit merge of thms' signatures is
9267 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
9268 transfer:theory->thm->thm in (rare) cases;
9270 * improved handling of draft signatures / theories; draft thms (and
9271 ctyps, cterms) are automatically promoted to real ones;
9273 * slightly changed interfaces for oracles: admit many per theory, named
9274 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
9276 * print_goals: optional output of const types (set show_consts and
9279 * improved output of warnings (###) and errors (***);
9281 * subgoal_tac displays a warning if the new subgoal has type variables;
9283 * removed old README and Makefiles;
9285 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
9287 * removed obsolete init_pps and init_database;
9289 * deleted the obsolete tactical STATE, which was declared by
9290 fun STATE tacfun st = tacfun st st;
9292 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
9293 (which abbreviates $HOME);
9295 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
9296 use isatool fixseq to adapt your ML programs (this works for fully
9297 qualified references to the Sequence structure only!);
9299 * use_thy no longer requires writable current directory; it always
9300 reloads .ML *and* .thy file, if either one is out of date;
9303 *** Classical Reasoner ***
9305 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
9306 tactics that use classical reasoning to simplify a subgoal without
9307 splitting it into several subgoals;
9309 * Safe_tac: like safe_tac but uses the default claset;
9314 * added simplification meta rules:
9315 (asm_)(full_)simplify: simpset -> thm -> thm;
9317 * simplifier.ML no longer part of Pure -- has to be loaded by object
9320 * added prems argument to simplification procedures;
9322 * HOL, FOL, ZF: added infix function `addsplits':
9323 instead of `<simpset> setloop (split_tac <thms>)'
9324 you can simply write `<simpset> addsplits <thms>'
9329 * TYPE('a) syntax for type reflection terms;
9331 * no longer handles consts with name "" -- declare as 'syntax' instead;
9333 * pretty printer: changed order of mixfix annotation preference (again!);
9335 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
9340 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
9341 with `addloop' of the simplifier to faciliate case splitting in premises.
9343 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
9345 * HOL/Auth: new protocol proofs including some for the Internet
9348 * HOL/Map: new theory of `maps' a la VDM;
9350 * HOL/simplifier: simplification procedures nat_cancel_sums for
9351 cancelling out common nat summands from =, <, <= (in)equalities, or
9352 differences; simplification procedures nat_cancel_factor for
9353 cancelling common factor from =, <, <= (in)equalities over natural
9354 sums; nat_cancel contains both kinds of procedures, it is installed by
9355 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
9357 * HOL/simplifier: terms of the form
9358 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
9360 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
9361 and those of the form
9362 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
9364 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
9367 Each datatype `t' now comes with a theorem `split_t_case' of the form
9369 P(t_case f1 ... fn x) =
9370 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
9372 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
9375 and a theorem `split_t_case_asm' of the form
9377 P(t_case f1 ... fn x) =
9378 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
9380 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
9382 which can be added to a simpset via `addsplits'. The existing theorems
9383 expand_list_case and expand_option_case have been renamed to
9384 split_list_case and split_option_case.
9387 - `pred n' is automatically converted to `n-1'.
9388 Users are strongly encouraged not to use `pred' any longer,
9389 because it will disappear altogether at some point.
9390 - Users are strongly encouraged to write "0 < n" rather than
9391 "n ~= 0". Theorems and proof tools have been modified towards this
9395 the function "set_of_list" has been renamed "set" (and its theorems too);
9396 the function "nth" now takes its arguments in the reverse order and
9397 has acquired the infix notation "!" as in "xs!n".
9399 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
9401 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
9402 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
9404 * HOL/record: extensible records with schematic structural subtyping
9405 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
9406 still lacks various theorems and concrete record syntax;
9411 * removed "axioms" and "generated by" sections;
9413 * replaced "ops" section by extended "consts" section, which is capable of
9414 handling the continuous function space "->" directly;
9417 . proves theorems immediately and stores them in the theory,
9418 . creates hierachical name space,
9419 . now uses normal mixfix annotations (instead of cinfix...),
9420 . minor changes to some names and values (for consistency),
9421 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
9422 . separator between mutual domain defs: changed "," to "and",
9423 . improved handling of sort constraints; now they have to
9424 appear on the left-hand side of the equations only;
9426 * fixed LAM <x,y,zs>.b syntax;
9428 * added extended adm_tac to simplifier in HOLCF -- can now discharge
9429 adm (%x. P (t x)), where P is chainfinite and t continuous;
9434 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
9435 with `addloop' of the simplifier to faciliate case splitting in premises.
9437 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
9438 in HOL, they strip ALL and --> from proved theorems;
9442 New in Isabelle94-8 (May 1997)
9443 ------------------------------
9445 *** General Changes ***
9447 * new utilities to build / run / maintain Isabelle etc. (in parts
9448 still somewhat experimental); old Makefiles etc. still functional;
9450 * new 'Isabelle System Manual';
9452 * INSTALL text, together with ./configure and ./build scripts;
9454 * reimplemented type inference for greater efficiency, better error
9455 messages and clean internal interface;
9457 * prlim command for dealing with lots of subgoals (an easier way of
9458 setting goals_limit);
9463 * supports alternative (named) syntax tables (parser and pretty
9464 printer); internal interface is provided by add_modesyntax(_i);
9466 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
9467 be used in conjunction with the Isabelle symbol font; uses the
9468 "symbols" syntax table;
9470 * added token_translation interface (may translate name tokens in
9471 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
9472 the current print_mode); IMPORTANT: user print translation functions
9473 are responsible for marking newly introduced bounds
9474 (Syntax.mark_boundT);
9476 * token translations for modes "xterm" and "xterm_color" that display
9477 names in bold, underline etc. or colors (which requires a color
9480 * infixes may now be declared with names independent of their syntax;
9482 * added typed_print_translation (like print_translation, but may
9483 access type of constant);
9486 *** Classical Reasoner ***
9488 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
9489 some limitations. Blast_tac...
9490 + ignores addss, addbefore, addafter; this restriction is intrinsic
9491 + ignores elimination rules that don't have the correct format
9492 (the conclusion MUST be a formula variable)
9493 + ignores types, which can make HOL proofs fail
9494 + rules must not require higher-order unification, e.g. apply_type in ZF
9495 [message "Function Var's argument not a bound variable" relates to this]
9496 + its proof strategy is more general but can actually be slower
9498 * substitution with equality assumptions no longer permutes other
9501 * minor changes in semantics of addafter (now called addaltern); renamed
9502 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
9503 (and access functions for it);
9505 * improved combination of classical reasoner and simplifier:
9506 + functions for handling clasimpsets
9507 + improvement of addss: now the simplifier is called _after_ the
9509 + safe variant of addss called addSss: uses safe simplifications
9510 _during_ the safe steps. It is more complete as it allows multiple
9511 instantiations of unknowns (e.g. with slow_tac).
9515 * added interface for simplification procedures (functions that
9516 produce *proven* rewrite rules on the fly, depending on current
9519 * ordering on terms as parameter (used for ordered rewriting);
9521 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
9523 * the solver is now split into a safe and an unsafe part.
9524 This should be invisible for the normal user, except that the
9525 functions setsolver and addsolver have been renamed to setSolver and
9526 addSolver; added safe_asm_full_simp_tac;
9531 * a generic induction tactic `induct_tac' which works for all datatypes and
9532 also for type `nat';
9534 * a generic case distinction tactic `exhaust_tac' which works for all
9535 datatypes and also for type `nat';
9537 * each datatype comes with a function `size';
9539 * patterns in case expressions allow tuple patterns as arguments to
9540 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
9542 * primrec now also works with type nat;
9544 * recdef: a new declaration form, allows general recursive functions to be
9545 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
9547 * the constant for negation has been renamed from "not" to "Not" to
9548 harmonize with FOL, ZF, LK, etc.;
9550 * HOL/ex/LFilter theory of a corecursive "filter" functional for
9553 * HOL/Modelcheck demonstrates invocation of model checker oracle;
9555 * HOL/ex/Ring.thy declares cring_simp, which solves equational
9556 problems in commutative rings, using axiomatic type classes for + and *;
9558 * more examples in HOL/MiniML and HOL/Auth;
9560 * more default rewrite rules for quantifiers, union/intersection;
9562 * a new constant `arbitrary == @x.False';
9564 * HOLCF/IOA replaces old HOL/IOA;
9566 * HOLCF changes: derived all rules and arities
9567 + axiomatic type classes instead of classes
9568 + typedef instead of faking type definitions
9569 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
9570 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
9571 + eliminated the types void, one, tr
9572 + use unit lift and bool lift (with translations) instead of one and tr
9573 + eliminated blift from Lift3.thy (use Def instead of blift)
9574 all eliminated rules are derived as theorems --> no visible changes ;
9579 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
9580 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
9581 as ZF_cs addSIs [equalityI];
9585 New in Isabelle94-7 (November 96)
9586 ---------------------------------
9588 * allowing negative levels (as offsets) in prlev and choplev;
9590 * super-linear speedup for large simplifications;
9592 * FOL, ZF and HOL now use miniscoping: rewriting pushes
9593 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
9594 FAIL); can suppress it using the command Delsimps (ex_simps @
9595 all_simps); De Morgan laws are also now included, by default;
9597 * improved printing of ==> : ~:
9599 * new object-logic "Sequents" adds linear logic, while replacing LK
9600 and Modal (thanks to Sara Kalvala);
9602 * HOL/Auth: correctness proofs for authentication protocols;
9604 * HOL: new auto_tac combines rewriting and classical reasoning (many
9605 examples on HOL/Auth);
9607 * HOL: new command AddIffs for declaring theorems of the form P=Q to
9608 the rewriter and classical reasoner simultaneously;
9610 * function uresult no longer returns theorems in "standard" format;
9611 regain previous version by: val uresult = standard o uresult;
9618 * oracles -- these establish an interface between Isabelle and trusted
9619 external reasoners, which may deliver results as theorems;
9621 * proof objects (in particular record all uses of oracles);
9623 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
9625 * "constdefs" section in theory files;
9627 * "primrec" section (HOL) no longer requires names;
9629 * internal type "tactic" now simply "thm -> thm Sequence.seq";
9636 * reduced space requirements;
9638 * automatic HTML generation from theories;
9640 * theory files no longer require "..." (quotes) around most types;
9642 * new examples, including two proofs of the Church-Rosser theorem;
9644 * non-curried (1994) version of HOL is no longer distributed;
9651 * greatly reduced space requirements;
9653 * theory files (.thy) no longer require \...\ escapes at line breaks;
9655 * searchable theorem database (see the section "Retrieving theorems" on
9656 page 8 of the Reference Manual);
9658 * new examples, including Grabczewski's monumental case study of the
9661 * The previous version of HOL renamed to Old_HOL;
9663 * The new version of HOL (previously called CHOL) uses a curried syntax
9664 for functions. Application looks like f a b instead of f(a,b);
9666 * Mutually recursive inductive definitions finally work in HOL;
9668 * In ZF, pattern-matching on tuples is now available in all abstractions and
9669 translates to the operator "split";
9676 * new infix operator, addss, allowing the classical reasoner to
9677 perform simplification at each step of its search. Example:
9678 fast_tac (cs addss ss)
9680 * a new logic, CHOL, the same as HOL, but with a curried syntax
9681 for functions. Application looks like f a b instead of f(a,b). Also pairs
9682 look like (a,b) instead of <a,b>;
9684 * PLEASE NOTE: CHOL will eventually replace HOL!
9686 * In CHOL, pattern-matching on tuples is now available in all abstractions.
9687 It translates to the operator "split". A new theory of integers is available;
9689 * In ZF, integer numerals now denote two's-complement binary integers.
9690 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
9692 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
9693 of the Axiom of Choice;
9700 * Significantly faster resolution;
9702 * the different sections in a .thy file can now be mixed and repeated
9705 * Database of theorems for FOL, HOL and ZF. New
9706 commands including qed, qed_goal and bind_thm store theorems in the database.
9708 * Simple database queries: return a named theorem (get_thm) or all theorems of
9709 a given theory (thms_of), or find out what theory a theorem was proved in
9712 * Bugs fixed in the inductive definition and datatype packages;
9714 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
9715 and HOL_dup_cs obsolete;
9717 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
9720 * Simpler definition of function space in ZF;
9722 * new results about cardinal and ordinal arithmetic in ZF;
9724 * 'subtype' facility in HOL for introducing new types as subsets of existing
9727 :mode=text:wrap=hard:maxLineLen=72: