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 * New "case_product" attribute to generate a case rule doing multiple
651 case distinctions at the same time. E.g.
653 list.exhaust [case_product nat.exhaust]
655 produces a rule which can be used to perform case distinction on both
658 * Theory Library/Multiset: Improved code generation of multisets.
660 * New diagnostic command 'find_unused_assms' to find potentially
661 superfluous assumptions in theorems using Quickcheck.
665 - Quickcheck returns variable assignments as counterexamples, which
666 allows to reveal the underspecification of functions under test.
667 For example, refuting "hd xs = x", it presents the variable
668 assignment xs = [] and x = a1 as a counterexample, assuming that
669 any property is false whenever "hd []" occurs in it.
671 These counterexample are marked as potentially spurious, as
672 Quickcheck also returns "xs = []" as a counterexample to the
673 obvious theorem "hd xs = hd xs".
675 After finding a potentially spurious counterexample, Quickcheck
676 continues searching for genuine ones.
678 By default, Quickcheck shows potentially spurious and genuine
679 counterexamples. The option "genuine_only" sets quickcheck to only
680 show genuine counterexamples.
682 - The command 'quickcheck_generator' creates random and exhaustive
683 value generators for a given type and operations.
685 It generates values by using the operations as if they were
686 constructors of that type.
688 - Support for multisets.
690 - Added "use_subtype" options.
692 - Added "quickcheck_locale" configuration to specify how to process
693 conjectures in a locale context.
696 - Fixed infinite loop caused by the 'peephole_optim' option and
697 affecting 'rat' and 'real'.
700 - Integrated more tightly with SPASS, as described in the ITP 2012 paper "More
701 SPASS with Isabelle".
702 - Made it try "smt" as a fallback if "metis" fails or times out.
703 - Added support for the following provers: Alt-Ergo (via Why3 and TFF1),
705 - Replaced remote E-SInE with remote Satallax in the default setup.
706 - Sped up the minimizer.
707 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
708 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
709 - Renamed "sound" option to "strict".
712 - Added possibility to specify lambda translations scheme as a
713 parenthesized argument (e.g., "by (metis (lifting) ...)").
716 - Renamed "smt_fixed" option to "smt_read_only_certificates".
719 - Renamed from 'try_methods'. INCOMPATIBILITY.
721 * New "eventually_elim" method as a generalized variant of the
722 eventually_elim* rules. Supports structured proofs.
724 * HOL/TPTP: support to parse and import TPTP problems (all languages)
730 * New "case_product" attribute (see HOL).
735 * Greater support for structured proofs involving induction or case
738 * Much greater use of mathematical symbols.
740 * Removal of many ML theorem bindings. INCOMPATIBILITY.
745 * Antiquotation @{keyword "name"} produces a parser for outer syntax
746 from a minor keyword introduced via theory header declaration.
748 * Antiquotation @{command_spec "name"} produces the
749 Outer_Syntax.command_spec from a major keyword introduced via theory
750 header declaration; it can be passed to Outer_Syntax.command etc.
752 * Local_Theory.define no longer hard-wires default theorem name
753 "foo_def", but retains the binding as given. If that is Binding.empty
754 / Attrib.empty_binding, the result is not registered as user-level
755 fact. The Local_Theory.define_internal variant allows to specify a
756 non-empty name (used for the foundation in the background theory),
757 while omitting the fact binding in the user-context. Potential
758 INCOMPATIBILITY for derived definitional packages: need to specify
759 naming policy for primitive definitions more explicitly.
761 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
762 conformance with similar operations in structure Term and Logic.
764 * Antiquotation @{attributes [...]} embeds attribute source
765 representation into the ML text, which is particularly useful with
766 declarations like Local_Theory.note.
768 * Structure Proof_Context follows standard naming scheme. Old
769 ProofContext has been discontinued. INCOMPATIBILITY.
771 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
772 change of semantics: update is applied to auxiliary local theory
775 * Modernized some old-style infix operations:
777 addeqcongs ~> Simplifier.add_eqcong
778 deleqcongs ~> Simplifier.del_eqcong
779 addcongs ~> Simplifier.add_cong
780 delcongs ~> Simplifier.del_cong
781 setmksimps ~> Simplifier.set_mksimps
782 setmkcong ~> Simplifier.set_mkcong
783 setmksym ~> Simplifier.set_mksym
784 setmkeqTrue ~> Simplifier.set_mkeqTrue
785 settermless ~> Simplifier.set_termless
786 setsubgoaler ~> Simplifier.set_subgoaler
787 addsplits ~> Splitter.add_split
788 delsplits ~> Splitter.del_split
793 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
796 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
797 notation, which is useful for the jEdit file browser, for example.
801 New in Isabelle2011-1 (October 2011)
802 ------------------------------------
806 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
807 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
809 - Management of multiple theory files directly from the editor
810 buffer store -- bypassing the file-system (no requirement to save
813 - Markup of formal entities within the text buffer, with semantic
814 highlighting, tooltips and hyperlinks to jump to defining source
817 - Improved text rendering, with sub/superscripts in the source
818 buffer (including support for copy/paste wrt. output panel, HTML
819 theory output and other non-Isabelle text boxes).
821 - Refined scheduling of proof checking and printing of results,
822 based on interactive editor view. (Note: jEdit folding and
823 narrowing allows to restrict buffer perspectives explicitly.)
825 - Reduced CPU performance requirements, usable on machines with few
828 - Reduced memory requirements due to pruning of unused document
829 versions (garbage collection).
831 See also ~~/src/Tools/jEdit/README.html for further information,
832 including some remaining limitations.
834 * Theory loader: source files are exclusively located via the master
835 directory of each theory node (where the .thy file itself resides).
836 The global load path (such as src/HOL/Library) has been discontinued.
837 Note that the path element ~~ may be used to reference theories in the
838 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
841 * Theory loader: source files are identified by content via SHA1
842 digests. Discontinued former path/modtime identification and optional
843 ISABELLE_FILE_IDENT plugin scripts.
845 * Parallelization of nested Isar proofs is subject to
846 Goal.parallel_proofs_threshold (default 100). See also isabelle
849 * Name space: former unsynchronized references are now proper
850 configuration options, with more conventional names:
852 long_names ~> names_long
853 short_names ~> names_short
854 unique_names ~> names_unique
856 Minor INCOMPATIBILITY, need to declare options in context like this:
858 declare [[names_unique = false]]
860 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
861 that the result needs to be unique, which means fact specifications
862 may have to be refined after enriching a proof context.
864 * Attribute "case_names" has been refined: the assumptions in each case
865 can be named now by following the case name with [name1 name2 ...].
867 * Isabelle/Isar reference manual has been updated and extended:
868 - "Synopsis" provides a catalog of main Isar language concepts.
869 - Formal references in syntax diagrams, via @{rail} antiquotation.
870 - Updated material from classic "ref" manual, notably about
871 "Classical Reasoner".
876 * Class bot and top require underlying partial order rather than
877 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
879 * Class complete_lattice: generalized a couple of lemmas from sets;
880 generalized theorems INF_cong and SUP_cong. New type classes for
881 complete boolean algebras and complete linear orders. Lemmas
882 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
883 class complete_linorder.
885 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
886 Sup_fun_def, Inf_apply, Sup_apply.
888 Removed redundant lemmas (the right hand side gives hints how to
889 replace them for (metis ...), or (simp only: ...) proofs):
891 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
892 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
893 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
894 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
895 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
896 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
897 Inter_def ~> INF_def, image_def
898 Union_def ~> SUP_def, image_def
899 INT_eq ~> INF_def, and image_def
900 UN_eq ~> SUP_def, and image_def
901 INF_subset ~> INF_superset_mono [OF _ order_refl]
903 More consistent and comprehensive names:
905 INTER_eq_Inter_image ~> INF_def
906 UNION_eq_Union_image ~> SUP_def
910 INF_leI2 ~> INF_lower2
911 le_INFI ~> INF_greatest
913 le_SUPI2 ~> SUP_upper2
915 INFI_bool_eq ~> INF_bool_eq
916 SUPR_bool_eq ~> SUP_bool_eq
917 INFI_apply ~> INF_apply
918 SUPR_apply ~> SUP_apply
919 INTER_def ~> INTER_eq
920 UNION_def ~> UNION_eq
924 * Renamed theory Complete_Lattice to Complete_Lattices.
927 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
928 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
929 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
930 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
932 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
933 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
934 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
937 * Added syntactic classes "inf" and "sup" for the respective
938 constants. INCOMPATIBILITY: Changes in the argument order of the
939 (mostly internal) locale predicates for some derived classes.
941 * Theorem collections ball_simps and bex_simps do not contain theorems
942 referring to UNION any longer; these have been moved to collection
943 UN_ball_bex_simps. INCOMPATIBILITY.
945 * Theory Archimedean_Field: floor now is defined as parameter of a
946 separate type class floor_ceiling.
948 * Theory Finite_Set: more coherent development of fold_set locales:
950 locale fun_left_comm ~> locale comp_fun_commute
951 locale fun_left_comm_idem ~> locale comp_fun_idem
953 Both use point-free characterization; interpretation proofs may need
954 adjustment. INCOMPATIBILITY.
956 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
957 accordance with standard mathematical terminology. INCOMPATIBILITY.
959 * Theory Complex_Main: The locale interpretations for the
960 bounded_linear and bounded_bilinear locales have been removed, in
961 order to reduce the number of duplicate lemmas. Users must use the
962 original names for distributivity theorems, potential INCOMPATIBILITY.
964 divide.add ~> add_divide_distrib
965 divide.diff ~> diff_divide_distrib
966 divide.setsum ~> setsum_divide_distrib
967 mult.add_right ~> right_distrib
968 mult.diff_right ~> right_diff_distrib
969 mult_right.setsum ~> setsum_right_distrib
970 mult_left.diff ~> left_diff_distrib
972 * Theory Complex_Main: Several redundant theorems have been removed or
973 replaced by more general versions. INCOMPATIBILITY.
975 real_diff_def ~> minus_real_def
976 real_divide_def ~> divide_real_def
977 real_less_def ~> less_le
978 real_abs_def ~> abs_real_def
979 real_sgn_def ~> sgn_real_def
980 real_mult_commute ~> mult_commute
981 real_mult_assoc ~> mult_assoc
982 real_mult_1 ~> mult_1_left
983 real_add_mult_distrib ~> left_distrib
984 real_zero_not_eq_one ~> zero_neq_one
985 real_mult_inverse_left ~> left_inverse
986 INVERSE_ZERO ~> inverse_zero
987 real_le_refl ~> order_refl
988 real_le_antisym ~> order_antisym
989 real_le_trans ~> order_trans
990 real_le_linear ~> linear
991 real_le_eq_diff ~> le_iff_diff_le_0
992 real_add_left_mono ~> add_left_mono
993 real_mult_order ~> mult_pos_pos
994 real_mult_less_mono2 ~> mult_strict_left_mono
995 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
996 real_0_le_divide_iff ~> zero_le_divide_iff
997 realpow_two_disj ~> power2_eq_iff
998 real_squared_diff_one_factored ~> square_diff_one_factored
999 realpow_two_diff ~> square_diff_square_factored
1000 reals_complete2 ~> complete_real
1001 real_sum_squared_expand ~> power2_sum
1002 exp_ln_eq ~> ln_unique
1004 expi_zero ~> exp_zero
1005 lemma_DERIV_subst ~> DERIV_cong
1006 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
1007 LIMSEQ_const ~> tendsto_const
1008 LIMSEQ_norm ~> tendsto_norm
1009 LIMSEQ_add ~> tendsto_add
1010 LIMSEQ_minus ~> tendsto_minus
1011 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
1012 LIMSEQ_diff ~> tendsto_diff
1013 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
1014 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
1015 LIMSEQ_mult ~> tendsto_mult
1016 LIMSEQ_inverse ~> tendsto_inverse
1017 LIMSEQ_divide ~> tendsto_divide
1018 LIMSEQ_pow ~> tendsto_power
1019 LIMSEQ_setsum ~> tendsto_setsum
1020 LIMSEQ_setprod ~> tendsto_setprod
1021 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
1022 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
1023 LIMSEQ_imp_rabs ~> tendsto_rabs
1024 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
1025 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
1026 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
1027 LIMSEQ_Complex ~> tendsto_Complex
1028 LIM_ident ~> tendsto_ident_at
1029 LIM_const ~> tendsto_const
1030 LIM_add ~> tendsto_add
1031 LIM_add_zero ~> tendsto_add_zero
1032 LIM_minus ~> tendsto_minus
1033 LIM_diff ~> tendsto_diff
1034 LIM_norm ~> tendsto_norm
1035 LIM_norm_zero ~> tendsto_norm_zero
1036 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
1037 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
1038 LIM_rabs ~> tendsto_rabs
1039 LIM_rabs_zero ~> tendsto_rabs_zero
1040 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
1041 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
1042 LIM_compose ~> tendsto_compose
1043 LIM_mult ~> tendsto_mult
1044 LIM_scaleR ~> tendsto_scaleR
1045 LIM_of_real ~> tendsto_of_real
1046 LIM_power ~> tendsto_power
1047 LIM_inverse ~> tendsto_inverse
1048 LIM_sgn ~> tendsto_sgn
1049 isCont_LIM_compose ~> isCont_tendsto_compose
1050 bounded_linear.LIM ~> bounded_linear.tendsto
1051 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
1052 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
1053 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
1054 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
1055 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
1056 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
1058 * Theory Complex_Main: The definition of infinite series was
1059 generalized. Now it is defined on the type class {topological_space,
1060 comm_monoid_add}. Hence it is useable also for extended real numbers.
1062 * Theory Complex_Main: The complex exponential function "expi" is now
1063 a type-constrained abbreviation for "exp :: complex => complex"; thus
1064 several polymorphic lemmas about "exp" are now applicable to "expi".
1068 - Theory Library/Code_Char_ord provides native ordering of
1069 characters in the target language.
1071 - Commands code_module and code_library are legacy, use export_code
1074 - Method "evaluation" is legacy, use method "eval" instead.
1076 - Legacy evaluator "SML" is deactivated by default. May be
1077 reactivated by the following theory command:
1079 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
1081 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
1083 * New proof method "induction" that gives induction hypotheses the
1084 name "IH", thus distinguishing them from further hypotheses that come
1085 from rule induction. The latter are still called "hyps". Method
1086 "induction" is a thin wrapper around "induct" and follows the same
1089 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
1090 still available as a legacy feature for some time.
1093 - Added "need" and "total_consts" options.
1094 - Reintroduced "show_skolems" option by popular demand.
1095 - Renamed attribute: nitpick_def ~> nitpick_unfold.
1099 - Use quasi-sound (and efficient) translations by default.
1100 - Added support for the following provers: E-ToFoF, LEO-II,
1101 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
1102 - Automatically preplay and minimize proofs before showing them if
1103 this can be done within reasonable time.
1104 - sledgehammer available_provers ~> sledgehammer supported_provers.
1106 - Added "preplay_timeout", "slicing", "type_enc", "sound",
1107 "max_mono_iters", and "max_new_mono_instances" options.
1108 - Removed "explicit_apply" and "full_types" options as well as "Full
1109 Types" Proof General menu item. INCOMPATIBILITY.
1112 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
1113 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
1117 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
1118 "elim:" options. INCOMPATIBILITY.
1119 - Introduced 'try' that not only runs 'try_methods' but also
1120 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
1123 - Added "eval" option to evaluate terms for the found counterexample
1124 (currently only supported by the default (exhaustive) tester).
1125 - Added post-processing of terms to obtain readable counterexamples
1126 (currently only supported by the default (exhaustive) tester).
1127 - New counterexample generator quickcheck[narrowing] enables
1128 narrowing-based testing. Requires the Glasgow Haskell compiler
1129 with its installation location defined in the Isabelle settings
1130 environment as ISABELLE_GHC.
1131 - Removed quickcheck tester "SML" based on the SML code generator
1132 (formly in HOL/Library).
1134 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
1135 use 'partial_function' instead.
1137 * Theory Library/Extended_Reals replaces now the positive extended
1138 reals found in probability theory. This file is extended by
1139 Multivariate_Analysis/Extended_Real_Limits.
1141 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
1142 from where it must be imported explicitly if it is really required.
1145 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
1146 been moved here. INCOMPATIBILITY.
1148 * Theory Library/Saturated provides type of numbers with saturated
1151 * Theory Library/Product_Lattice defines a pointwise ordering for the
1152 product type 'a * 'b, and provides instance proofs for various order
1153 and lattice type classes.
1155 * Theory Library/Countable now provides the "countable_datatype" proof
1156 method for proving "countable" class instances for datatypes.
1158 * Theory Library/Cset_Monad allows do notation for computable sets
1159 (cset) via the generic monad ad-hoc overloading facility.
1161 * Library: Theories of common data structures are split into theories
1162 for implementation, an invariant-ensuring type, and connection to an
1163 abstract type. INCOMPATIBILITY.
1165 - RBT is split into RBT and RBT_Mapping.
1166 - AssocList is split and renamed into AList and AList_Mapping.
1167 - DList is split into DList_Impl, DList, and DList_Cset.
1168 - Cset is split into Cset and List_Cset.
1170 * Theory Library/Nat_Infinity has been renamed to
1171 Library/Extended_Nat, with name changes of the following types and
1174 type inat ~> type enat
1176 Infty ~> infinity (overloaded)
1180 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
1181 been renamed accordingly. INCOMPATIBILITY.
1183 * Session Multivariate_Analysis: The euclidean_space type class now
1184 fixes a constant "Basis :: 'a set" consisting of the standard
1185 orthonormal basis for the type. Users now have the option of
1186 quantifying over this set instead of using the "basis" function, e.g.
1187 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
1189 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
1190 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
1191 "Cart_nth" and "Cart_lambda" have been respectively renamed to
1192 "vec_nth" and "vec_lambda"; theorems mentioning those names have
1193 changed to match. Definition theorems for overloaded constants now use
1194 the standard "foo_vec_def" naming scheme. A few other theorems have
1195 been renamed as follows (INCOMPATIBILITY):
1197 Cart_eq ~> vec_eq_iff
1198 dist_nth_le_cart ~> dist_vec_nth_le
1199 tendsto_vector ~> vec_tendstoI
1200 Cauchy_vector ~> vec_CauchyI
1202 * Session Multivariate_Analysis: Several duplicate theorems have been
1203 removed, and other theorems have been renamed or replaced with more
1204 general versions. INCOMPATIBILITY.
1206 finite_choice ~> finite_set_choice
1207 eventually_conjI ~> eventually_conj
1208 eventually_and ~> eventually_conj_iff
1209 eventually_false ~> eventually_False
1210 setsum_norm ~> norm_setsum
1211 Lim_sequentially ~> LIMSEQ_def
1212 Lim_ident_at ~> LIM_ident
1213 Lim_const ~> tendsto_const
1214 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
1215 Lim_neg ~> tendsto_minus
1216 Lim_add ~> tendsto_add
1217 Lim_sub ~> tendsto_diff
1218 Lim_mul ~> tendsto_scaleR
1219 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
1220 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
1221 Lim_linear ~> bounded_linear.tendsto
1222 Lim_component ~> tendsto_euclidean_component
1223 Lim_component_cart ~> tendsto_vec_nth
1224 Lim_inner ~> tendsto_inner [OF tendsto_const]
1225 dot_lsum ~> inner_setsum_left
1226 dot_rsum ~> inner_setsum_right
1227 continuous_cmul ~> continuous_scaleR [OF continuous_const]
1228 continuous_neg ~> continuous_minus
1229 continuous_sub ~> continuous_diff
1230 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
1231 continuous_mul ~> continuous_scaleR
1232 continuous_inv ~> continuous_inverse
1233 continuous_at_within_inv ~> continuous_at_within_inverse
1234 continuous_at_inv ~> continuous_at_inverse
1235 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
1236 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
1237 continuous_at_component ~> continuous_component [OF continuous_at_id]
1238 continuous_on_neg ~> continuous_on_minus
1239 continuous_on_sub ~> continuous_on_diff
1240 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
1241 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
1242 continuous_on_mul ~> continuous_on_scaleR
1243 continuous_on_mul_real ~> continuous_on_mult
1244 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
1245 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
1246 continuous_on_inverse ~> continuous_on_inv
1247 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
1248 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
1249 subset_interior ~> interior_mono
1250 subset_closure ~> closure_mono
1251 closure_univ ~> closure_UNIV
1252 real_arch_lt ~> reals_Archimedean2
1253 real_arch ~> reals_Archimedean3
1254 real_abs_norm ~> abs_norm_cancel
1255 real_abs_sub_norm ~> norm_triangle_ineq3
1256 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
1258 * Session HOL-Probability:
1259 - Caratheodory's extension lemma is now proved for ring_of_sets.
1260 - Infinite products of probability measures are now available.
1261 - Sigma closure is independent, if the generator is independent
1262 - Use extended reals instead of positive extended
1263 reals. INCOMPATIBILITY.
1265 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
1267 expand_fun_below ~> fun_below_iff
1268 below_fun_ext ~> fun_belowI
1269 expand_cfun_eq ~> cfun_eq_iff
1270 ext_cfun ~> cfun_eqI
1271 expand_cfun_below ~> cfun_below_iff
1272 below_cfun_ext ~> cfun_belowI
1273 monofun_fun_fun ~> fun_belowD
1274 monofun_fun_arg ~> monofunE
1275 monofun_lub_fun ~> adm_monofun [THEN admD]
1276 cont_lub_fun ~> adm_cont [THEN admD]
1277 cont2cont_Rep_CFun ~> cont2cont_APP
1278 cont_Rep_CFun_app ~> cont_APP_app
1279 cont_Rep_CFun_app_app ~> cont_APP_app_app
1280 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
1281 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
1282 contlub_cfun ~> lub_APP [symmetric]
1283 contlub_LAM ~> lub_LAM [symmetric]
1286 lift_distinct1 ~> lift.distinct(1)
1287 lift_distinct2 ~> lift.distinct(2)
1288 Def_not_UU ~> lift.distinct(2)
1289 Def_inject ~> lift.inject
1290 below_UU_iff ~> below_bottom_iff
1291 eq_UU_iff ~> eq_bottom_iff
1294 *** Document preparation ***
1296 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
1297 isar-ref manual, both for description and actual application of the
1300 * Antiquotation @{value} evaluates the given term and presents its
1303 * Antiquotations: term style "isub" provides ad-hoc conversion of
1304 variables x1, y23 into subscripted form x\<^isub>1,
1305 y\<^isub>2\<^isub>3.
1307 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
1308 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
1310 * Localized \isabellestyle switch can be used within blocks or groups
1313 \isabellestyle{it} %preferred default
1314 {\isabellestylett @{text "typewriter stuff"}}
1316 * Discontinued special treatment of hard tabulators. Implicit
1317 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
1323 * The inner syntax of sort/type/term/prop supports inlined YXML
1324 representations within quoted string tokens. By encoding logical
1325 entities via Term_XML (in ML or Scala) concrete syntax can be
1326 bypassed, which is particularly useful for producing bits of text
1327 under external program control.
1329 * Antiquotations for ML and document preparation are managed as theory
1330 data, which requires explicit setup.
1332 * Isabelle_Process.is_active allows tools to check if the official
1333 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
1334 (better known as Proof General).
1336 * Structure Proof_Context follows standard naming scheme. Old
1337 ProofContext is still available for some time as legacy alias.
1339 * Structure Timing provides various operations for timing; supersedes
1340 former start_timing/end_timing etc.
1342 * Path.print is the official way to show file-system paths to users
1343 (including quotes etc.).
1345 * Inner syntax: identifiers in parse trees of generic categories
1346 "logic", "aprop", "idt" etc. carry position information (disguised as
1347 type constraints). Occasional INCOMPATIBILITY with non-compliant
1348 translations that choke on unexpected type constraints. Positions can
1349 be stripped in ML translations via Syntax.strip_positions /
1350 Syntax.strip_positions_ast, or via the syntax constant
1351 "_strip_positions" within parse trees. As last resort, positions can
1352 be disabled via the configuration option Syntax.positions, which is
1353 called "syntax_positions" in Isar attribute syntax.
1355 * Discontinued special status of various ML structures that contribute
1356 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
1357 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
1358 refer directly to Ast.Constant, Lexicon.is_identifier,
1359 Syntax_Trans.mk_binder_tr etc.
1361 * Typed print translation: discontinued show_sorts argument, which is
1362 already available via context of "advanced" translation.
1364 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
1365 goal states; body tactic needs to address all subgoals uniformly.
1367 * Slightly more special eq_list/eq_set, with shortcut involving
1368 pointer equality (assumes that eq relation is reflexive).
1370 * Classical tactics use proper Proof.context instead of historic types
1371 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
1372 operate directly on Proof.context. Raw type claset retains its use as
1373 snapshot of the classical context, which can be recovered via
1374 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
1375 INCOMPATIBILITY, classical tactics and derived proof methods require
1376 proper Proof.context.
1381 * Discontinued support for Poly/ML 5.2, which was the last version
1382 without proper multithreading and TimeLimit implementation.
1384 * Discontinued old lib/scripts/polyml-platform, which has been
1385 obsolete since Isabelle2009-2.
1387 * Various optional external tools are referenced more robustly and
1388 uniformly by explicit Isabelle settings as follows:
1390 ISABELLE_CSDP (formerly CSDP_EXE)
1391 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
1392 ISABELLE_OCAML (formerly EXEC_OCAML)
1393 ISABELLE_SWIPL (formerly EXEC_SWIPL)
1394 ISABELLE_YAP (formerly EXEC_YAP)
1396 Note that automated detection from the file-system or search path has
1397 been discontinued. INCOMPATIBILITY.
1399 * Scala layer provides JVM method invocation service for static
1400 methods of type (String)String, see Invoke_Scala.method in ML. For
1403 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
1405 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
1406 this allows to pass structured values between ML and Scala.
1408 * The IsabelleText fonts includes some further glyphs to support the
1409 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
1410 installed a local copy (which is normally *not* required) need to
1411 delete or update it from ~~/lib/fonts/.
1415 New in Isabelle2011 (January 2011)
1416 ----------------------------------
1420 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
1421 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
1422 useful tooltips and hyperlinks produced from its static analysis. The
1423 bundled component provides an executable Isabelle tool that can be run
1426 Isabelle2011/bin/isabelle jedit
1428 * Significantly improved Isabelle/Isar implementation manual.
1430 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
1431 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
1432 while the default heap location within that directory lacks that extra
1433 suffix. This isolates multiple Isabelle installations from each
1434 other, avoiding problems with old settings in new versions.
1435 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
1437 * Source files are always encoded as UTF-8, instead of old-fashioned
1438 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
1439 the following package declarations:
1441 \usepackage[utf8]{inputenc}
1442 \usepackage{textcomp}
1444 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
1445 a Unicode character is treated as a single symbol, not a sequence of
1446 non-ASCII bytes as before. Since Isabelle/ML string literals may
1447 contain symbols without further backslash escapes, Unicode can now be
1448 used here as well. Recall that Symbol.explode in ML provides a
1449 consistent view on symbols, while raw explode (or String.explode)
1450 merely give a byte-oriented representation.
1452 * Theory loader: source files are primarily located via the master
1453 directory of each theory node (where the .thy file itself resides).
1454 The global load path is still partially available as legacy feature.
1455 Minor INCOMPATIBILITY due to subtle change in file lookup: use
1456 explicit paths, relatively to the theory.
1458 * Special treatment of ML file names has been discontinued.
1459 Historically, optional extensions .ML or .sml were added on demand --
1460 at the cost of clarity of file dependencies. Recall that Isabelle/ML
1461 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
1463 * Various options that affect pretty printing etc. are now properly
1464 handled within the context via configuration options, instead of
1465 unsynchronized references or print modes. There are both ML Config.T
1466 entities and Isar declaration attributes to access these.
1468 ML (Config.T) Isar (attribute)
1470 eta_contract eta_contract
1471 show_brackets show_brackets
1472 show_sorts show_sorts
1473 show_types show_types
1474 show_question_marks show_question_marks
1475 show_consts show_consts
1476 show_abbrevs show_abbrevs
1478 Syntax.ast_trace syntax_ast_trace
1479 Syntax.ast_stat syntax_ast_stat
1480 Syntax.ambiguity_level syntax_ambiguity_level
1482 Goal_Display.goals_limit goals_limit
1483 Goal_Display.show_main_goal show_main_goal
1485 Method.rule_trace rule_trace
1487 Thy_Output.display thy_output_display
1488 Thy_Output.quotes thy_output_quotes
1489 Thy_Output.indent thy_output_indent
1490 Thy_Output.source thy_output_source
1491 Thy_Output.break thy_output_break
1493 Note that corresponding "..._default" references in ML may only be
1494 changed globally at the ROOT session setup, but *not* within a theory.
1495 The option "show_abbrevs" supersedes the former print mode
1496 "no_abbrevs" with inverted meaning.
1498 * More systematic naming of some configuration options.
1501 trace_simp ~> simp_trace
1502 debug_simp ~> simp_debug
1504 * Support for real valued configuration options, using simplistic
1505 floating-point notation that coincides with the inner syntax for
1508 * Support for real valued preferences (with approximative PGIP type):
1509 front-ends need to accept "pgint" values in float notation.
1512 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
1515 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
1520 * Command 'type_synonym' (with single argument) replaces somewhat
1521 outdated 'types', which is still available as legacy feature for some
1524 * Command 'nonterminal' (with 'and' separated list of arguments)
1525 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
1527 * Command 'notepad' replaces former 'example_proof' for
1528 experimentation in Isar without any result. INCOMPATIBILITY.
1530 * Locale interpretation commands 'interpret' and 'sublocale' accept
1531 lists of equations to map definitions in a locale to appropriate
1532 entities in the context of the interpretation. The 'interpretation'
1533 command already provided this functionality.
1535 * Diagnostic command 'print_dependencies' prints the locale instances
1536 that would be activated if the specified expression was interpreted in
1537 the current context. Variant "print_dependencies!" assumes a context
1538 without interpretations.
1540 * Diagnostic command 'print_interps' prints interpretations in proofs
1541 in addition to interpretations in theories.
1543 * Discontinued obsolete 'global' and 'local' commands to manipulate
1544 the theory name space. Rare INCOMPATIBILITY. The ML functions
1545 Sign.root_path and Sign.local_path may be applied directly where this
1546 feature is still required for historical reasons.
1548 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
1549 'definition' instead.
1551 * The "prems" fact, which refers to the accidental collection of
1552 foundational premises in the context, is now explicitly marked as
1553 legacy feature and will be discontinued soon. Consider using "assms"
1554 of the head statement or reference facts by explicit names.
1556 * Document antiquotations @{class} and @{type} print classes and type
1559 * Document antiquotation @{file} checks file/directory entries within
1560 the local file system.
1565 * Coercive subtyping: functions can be declared as coercions and type
1566 inference will add them as necessary upon input of a term. Theory
1567 Complex_Main declares real :: nat => real and real :: int => real as
1568 coercions. A coercion function f is declared like this:
1570 declare [[coercion f]]
1572 To lift coercions through type constructors (e.g. from nat => real to
1573 nat list => real list), map functions can be declared, e.g.
1575 declare [[coercion_map map]]
1577 Currently coercion inference is activated only in theories including
1578 real numbers, i.e. descendants of Complex_Main. This is controlled by
1579 the configuration option "coercion_enabled", e.g. it can be enabled in
1580 other theories like this:
1582 declare [[coercion_enabled]]
1584 * Command 'partial_function' provides basic support for recursive
1585 function definitions over complete partial orders. Concrete instances
1586 are provided for i) the option type, ii) tail recursion on arbitrary
1587 types, and iii) the heap monad of Imperative_HOL. See
1588 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
1591 * Function package: f.psimps rules are no longer implicitly declared
1592 as [simp]. INCOMPATIBILITY.
1594 * Datatype package: theorems generated for executable equality (class
1595 "eq") carry proper names and are treated as default code equations.
1597 * Inductive package: now offers command 'inductive_simps' to
1598 automatically derive instantiated and simplified equations for
1599 inductive predicates, similar to 'inductive_cases'.
1601 * Command 'enriched_type' allows to register properties of the
1602 functorial structure of types.
1604 * Improved infrastructure for term evaluation using code generator
1605 techniques, in particular static evaluation conversions.
1607 * Code generator: Scala (2.8 or higher) has been added to the target
1610 * Code generator: globbing constant expressions "*" and "Theory.*"
1611 have been replaced by the more idiomatic "_" and "Theory._".
1614 * Code generator: export_code without explicit file declaration prints
1615 to standard output. INCOMPATIBILITY.
1617 * Code generator: do not print function definitions for case
1618 combinators any longer.
1620 * Code generator: simplification with rules determined with
1621 src/Tools/Code/code_simp.ML and method "code_simp".
1623 * Code generator for records: more idiomatic representation of record
1624 types. Warning: records are not covered by ancient SML code
1625 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
1626 rep_datatype declaration helps to succeed then:
1630 rep_datatype foo_ext ...
1632 * Records: logical foundation type for records does not carry a
1633 '_type' suffix any longer (obsolete due to authentic syntax).
1636 * Quickcheck now by default uses exhaustive testing instead of random
1637 testing. Random testing can be invoked by "quickcheck [random]",
1638 exhaustive testing by "quickcheck [exhaustive]".
1640 * Quickcheck instantiates polymorphic types with small finite
1641 datatypes by default. This enables a simple execution mechanism to
1642 handle quantifiers and function equality over the finite datatypes.
1644 * Quickcheck random generator has been renamed from "code" to
1645 "random". INCOMPATIBILITY.
1647 * Quickcheck now has a configurable time limit which is set to 30
1648 seconds by default. This can be changed by adding [timeout = n] to the
1649 quickcheck command. The time limit for Auto Quickcheck is still set
1652 * Quickcheck in locales considers interpretations of that locale for
1653 counter example search.
1656 - Added "smt" and "remote_smt" provers based on the "smt" proof
1657 method. See the Sledgehammer manual for details ("isabelle doc
1660 sledgehammer atp_info ~> sledgehammer running_provers
1661 sledgehammer atp_kill ~> sledgehammer kill_provers
1662 sledgehammer available_atps ~> sledgehammer available_provers
1665 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
1666 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
1667 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
1668 (and "ms" and "min" are no longer supported)
1673 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
1674 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
1676 - Added support for partial quotient types.
1677 - Added local versions of the "Nitpick.register_xxx" functions.
1678 - Added "whack" option.
1679 - Allow registration of quotient types as codatatypes.
1680 - Improved "merge_type_vars" option to merge more types.
1681 - Removed unsound "fast_descrs" option.
1682 - Added custom symmetry breaking for datatypes, making it possible to reach
1683 higher cardinalities.
1684 - Prevent the expansion of too large definitions.
1686 * Proof methods "metis" and "meson" now have configuration options
1687 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
1688 to diagnose these tools. E.g.
1690 using [[metis_trace = true]]
1692 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
1693 manually as command 'solve_direct'.
1695 * The default SMT solver Z3 must be enabled explicitly (due to
1696 licensing issues) by setting the environment variable
1697 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
1698 commercial applications, the SMT solver CVC3 is provided as fall-back;
1699 changing the SMT solver is done via the configuration option
1702 * Remote SMT solvers need to be referred to by the "remote_" prefix,
1703 i.e. "remote_cvc3" and "remote_z3".
1705 * Added basic SMT support for datatypes, records, and typedefs using
1706 the oracle mode (no proofs). Direct support of pairs has been dropped
1707 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
1708 support for a similar behavior). Minor INCOMPATIBILITY.
1710 * Changed SMT configuration options:
1712 z3_proofs ~> smt_oracle (with inverted meaning)
1713 z3_trace_assms ~> smt_trace_used_facts
1726 * Boogie output files (.b2i files) need to be declared in the theory
1729 * Simplification procedure "list_to_set_comprehension" rewrites list
1730 comprehensions applied to List.set to set comprehensions. Occasional
1731 INCOMPATIBILITY, may be deactivated like this:
1733 declare [[simproc del: list_to_set_comprehension]]
1735 * Removed old version of primrec package. INCOMPATIBILITY.
1737 * Removed simplifier congruence rule of "prod_case", as has for long
1738 been the case with "split". INCOMPATIBILITY.
1740 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
1742 * Removed [split_format ... and ... and ...] version of
1743 [split_format]. Potential INCOMPATIBILITY.
1745 * Predicate "sorted" now defined inductively, with nice induction
1746 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
1748 * Constant "contents" renamed to "the_elem", to free the generic name
1749 contents for other uses. INCOMPATIBILITY.
1751 * Renamed class eq and constant eq (for code generation) to class
1752 equal and constant equal, plus renaming of related facts and various
1753 tuning. INCOMPATIBILITY.
1755 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
1757 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
1760 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
1761 avoid confusion with finite sets. INCOMPATIBILITY.
1763 * Abandoned locales equiv, congruent and congruent2 for equivalence
1764 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
1767 * Some previously unqualified names have been qualified:
1774 Trueprop ~> HOL.Trueprop
1779 op --> ~> HOL.implies
1791 Pair ~> Product_Type.Pair
1792 fst ~> Product_Type.fst
1793 snd ~> Product_Type.snd
1794 curry ~> Product_Type.curry
1796 Collect ~> Set.Collect
1800 * More canonical naming convention for some fundamental definitions:
1802 bot_bool_eq ~> bot_bool_def
1803 top_bool_eq ~> top_bool_def
1804 inf_bool_eq ~> inf_bool_def
1805 sup_bool_eq ~> sup_bool_def
1806 bot_fun_eq ~> bot_fun_def
1807 top_fun_eq ~> top_fun_def
1808 inf_fun_eq ~> inf_fun_def
1809 sup_fun_eq ~> sup_fun_def
1813 * More stylized fact names:
1815 expand_fun_eq ~> fun_eq_iff
1816 expand_set_eq ~> set_eq_iff
1818 nat_number ~> eval_nat_numeral
1822 * Refactoring of code-generation specific operations in theory List:
1828 mem_iff ~> member_def
1829 null_empty ~> null_def
1831 INCOMPATIBILITY. Note that these were not supposed to be used
1832 regularly unless for striking reasons; their main purpose was code
1835 Various operations from the Haskell prelude are used for generating
1838 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
1839 "surj f" is now an abbreviation of "range f = UNIV". The theorems
1840 bij_def and surj_def are unchanged. INCOMPATIBILITY.
1842 * Abolished some non-alphabetic type names: "prod" and "sum" replace
1843 "*" and "+" respectively. INCOMPATIBILITY.
1845 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
1846 "Sum_Type.Plus" instead.
1848 * Constant "split" has been merged with constant "prod_case"; names of
1849 ML functions, facts etc. involving split have been retained so far,
1850 though. INCOMPATIBILITY.
1852 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
1853 instead. INCOMPATIBILITY.
1855 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
1858 * Former theory Library/Enum is now part of the HOL-Main image.
1859 INCOMPATIBILITY: all constants of the Enum theory now have to be
1860 referred to by its qualified name.
1863 nlists ~> Enum.nlists
1864 product ~> Enum.product
1866 * Theory Library/Monad_Syntax provides do-syntax for monad types.
1867 Syntax in Library/State_Monad has been changed to avoid ambiguities.
1870 * Theory Library/SetsAndFunctions has been split into
1871 Library/Function_Algebras and Library/Set_Algebras; canonical names
1872 for instance definitions for functions; various improvements.
1875 * Theory Library/Multiset provides stable quicksort implementation of
1878 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
1881 * Session Multivariate_Analysis: introduced a type class for euclidean
1882 space. Most theorems are now stated in terms of euclidean spaces
1883 instead of finite cartesian products.
1886 real ^ 'n ~> 'a::real_vector
1887 ~> 'a::euclidean_space
1888 ~> 'a::ordered_euclidean_space
1889 (depends on your needs)
1893 \<chi> x. _ ~> \<chi>\<chi> x. _
1896 Also note that the indices are now natural numbers and not from some
1897 finite type. Finite cartesian products of euclidean spaces, products
1898 of euclidean spaces the real and complex numbers are instantiated to
1899 be euclidean_spaces. INCOMPATIBILITY.
1901 * Session Probability: introduced pextreal as positive extended real
1902 numbers. Use pextreal as value for measures. Introduce the
1903 Radon-Nikodym derivative, product spaces and Fubini's theorem for
1904 arbitrary sigma finite measures. Introduces Lebesgue measure based on
1905 the integral in Multivariate Analysis. INCOMPATIBILITY.
1907 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
1910 * Session SPARK (with image HOL-SPARK) provides commands to load and
1911 prove verification conditions generated by the SPARK Ada program
1912 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
1917 * Theorems for additive ring operations (locale abelian_monoid and
1918 descendants) are generated by interpretation from their multiplicative
1919 counterparts. Names (in particular theorem names) have the mandatory
1920 qualifier 'add'. Previous theorem names are redeclared for
1923 * Structure "int_ring" is now an abbreviation (previously a
1924 definition). This fits more natural with advanced interpretations.
1929 * The domain package now runs in definitional mode by default: The
1930 former command 'new_domain' is now called 'domain'. To use the domain
1931 package in its original axiomatic mode, use 'domain (unsafe)'.
1934 * The new class "domain" is now the default sort. Class "predomain"
1935 is an unpointed version of "domain". Theories can be updated by
1936 replacing sort annotations as shown below. INCOMPATIBILITY.
1938 'a::type ~> 'a::countable
1939 'a::cpo ~> 'a::predomain
1940 'a::pcpo ~> 'a::domain
1942 * The old type class "rep" has been superseded by class "domain".
1943 Accordingly, users of the definitional package must remove any
1944 "default_sort rep" declarations. INCOMPATIBILITY.
1946 * The domain package (definitional mode) now supports unpointed
1947 predomain argument types, as long as they are marked 'lazy'. (Strict
1948 arguments must be in class "domain".) For example, the following
1949 domain definition now works:
1951 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
1953 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
1954 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
1955 'a option, and 'a list. Additionally, it configures fixrec and the
1956 domain package to work with these types. For example:
1958 fixrec isInl :: "('a + 'b) u -> tr"
1959 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
1961 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
1963 * The "(permissive)" option of fixrec has been replaced with a
1964 per-equation "(unchecked)" option. See
1965 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
1967 * The "bifinite" class no longer fixes a constant "approx"; the class
1968 now just asserts that such a function exists. INCOMPATIBILITY.
1970 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
1971 defines an embedding of type 'a defl into udom by default; instances
1972 of "bifinite" and "domain" classes are available in
1973 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
1975 * The syntax "REP('a)" has been replaced with "DEFL('a)".
1977 * The predicate "directed" has been removed. INCOMPATIBILITY.
1979 * The type class "finite_po" has been removed. INCOMPATIBILITY.
1981 * The function "cprod_map" has been renamed to "prod_map".
1984 * The monadic bind operator on each powerdomain has new binder syntax
1985 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
1986 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
1988 * The infix syntax for binary union on each powerdomain has changed
1989 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
1990 syntax. INCOMPATIBILITY.
1992 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
1993 still supported as an input translation.
1995 * Renamed some theorems (the original names are also still available).
1997 expand_fun_below ~> fun_below_iff
1998 below_fun_ext ~> fun_belowI
1999 expand_cfun_eq ~> cfun_eq_iff
2000 ext_cfun ~> cfun_eqI
2001 expand_cfun_below ~> cfun_below_iff
2002 below_cfun_ext ~> cfun_belowI
2003 cont2cont_Rep_CFun ~> cont2cont_APP
2005 * The Abs and Rep functions for various types have changed names.
2006 Related theorem names have also changed to match. INCOMPATIBILITY.
2008 Rep_CFun ~> Rep_cfun
2009 Abs_CFun ~> Abs_cfun
2010 Rep_Sprod ~> Rep_sprod
2011 Abs_Sprod ~> Abs_sprod
2012 Rep_Ssum ~> Rep_ssum
2013 Abs_Ssum ~> Abs_ssum
2015 * Lemmas with names of the form *_defined_iff or *_strict_iff have
2016 been renamed to *_bottom_iff. INCOMPATIBILITY.
2018 * Various changes to bisimulation/coinduction with domain package:
2020 - Definitions of "bisim" constants no longer mention definedness.
2021 - With mutual recursion, "bisim" predicate is now curried.
2022 - With mutual recursion, each type gets a separate coind theorem.
2023 - Variable names in bisim_def and coinduct rules have changed.
2027 * Case combinators generated by the domain package for type "foo" are
2028 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
2030 * Several theorems have been renamed to more accurately reflect the
2031 names of constants and types involved. INCOMPATIBILITY.
2033 thelub_const ~> lub_const
2034 lub_const ~> is_lub_const
2036 is_lub_lub ~> is_lubD2
2038 unique_lub ~> is_lub_unique
2039 is_ub_lub ~> is_lub_rangeD1
2040 lub_bin_chain ~> is_lub_bin_chain
2041 lub_fun ~> is_lub_fun
2042 thelub_fun ~> lub_fun
2043 thelub_cfun ~> lub_cfun
2044 thelub_Pair ~> lub_Pair
2045 lub_cprod ~> is_lub_prod
2046 thelub_cprod ~> lub_prod
2047 minimal_cprod ~> minimal_prod
2048 inst_cprod_pcpo ~> inst_prod_pcpo
2050 compact_UU ~> compact_bottom
2051 deflation_UU ~> deflation_bottom
2052 finite_deflation_UU ~> finite_deflation_bottom
2054 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
2056 sq_ord_less_eq_trans ~> below_eq_trans
2057 sq_ord_eq_less_trans ~> eq_below_trans
2058 refl_less ~> below_refl
2059 trans_less ~> below_trans
2060 antisym_less ~> below_antisym
2061 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
2062 box_less ~> box_below
2063 rev_trans_less ~> rev_below_trans
2064 not_less2not_eq ~> not_below2not_eq
2065 less_UU_iff ~> below_UU_iff
2066 flat_less_iff ~> flat_below_iff
2067 adm_less ~> adm_below
2068 adm_not_less ~> adm_not_below
2069 adm_compact_not_less ~> adm_compact_not_below
2070 less_fun_def ~> below_fun_def
2071 expand_fun_less ~> fun_below_iff
2072 less_fun_ext ~> fun_belowI
2073 less_discr_def ~> below_discr_def
2074 discr_less_eq ~> discr_below_eq
2075 less_unit_def ~> below_unit_def
2076 less_cprod_def ~> below_prod_def
2077 prod_lessI ~> prod_belowI
2078 Pair_less_iff ~> Pair_below_iff
2079 fst_less_iff ~> fst_below_iff
2080 snd_less_iff ~> snd_below_iff
2081 expand_cfun_less ~> cfun_below_iff
2082 less_cfun_ext ~> cfun_belowI
2083 injection_less ~> injection_below
2084 less_up_def ~> below_up_def
2085 not_Iup_less ~> not_Iup_below
2086 Iup_less ~> Iup_below
2088 Def_inject_less_eq ~> Def_below_Def
2089 Def_less_is_eq ~> Def_below_iff
2090 spair_less_iff ~> spair_below_iff
2091 less_sprod ~> below_sprod
2092 spair_less ~> spair_below
2093 sfst_less_iff ~> sfst_below_iff
2094 ssnd_less_iff ~> ssnd_below_iff
2095 fix_least_less ~> fix_least_below
2096 dist_less_one ~> dist_below_one
2097 less_ONE ~> below_ONE
2098 ONE_less_iff ~> ONE_below_iff
2099 less_sinlD ~> below_sinlD
2100 less_sinrD ~> below_sinrD
2105 * All constant names are now qualified internally and use proper
2106 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
2111 * Antiquotation @{assert} inlines a function bool -> unit that raises
2112 Fail if the argument is false. Due to inlining the source position of
2113 failed assertions is included in the error output.
2115 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
2116 text is in practice always evaluated with a stable theory checkpoint.
2117 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
2119 * Antiquotation @{theory A} refers to theory A from the ancestry of
2120 the current context, not any accidental theory loader state as before.
2121 Potential INCOMPATIBILITY, subtle change in semantics.
2123 * Syntax.pretty_priority (default 0) configures the required priority
2124 of pretty-printed output and thus affects insertion of parentheses.
2126 * Syntax.default_root (default "any") configures the inner syntax
2127 category (nonterminal symbol) for parsing of terms.
2129 * Former exception Library.UnequalLengths now coincides with
2130 ListPair.UnequalLengths.
2132 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
2133 main functionality is provided by structure Simplifier.
2135 * Renamed raw "explode" function to "raw_explode" to emphasize its
2136 meaning. Note that internally to Isabelle, Symbol.explode is used in
2137 almost all situations.
2139 * Discontinued obsolete function sys_error and exception SYS_ERROR.
2140 See implementation manual for further details on exceptions in
2143 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
2146 * Renamed structure PureThy to Pure_Thy and moved most of its
2147 operations to structure Global_Theory, to emphasize that this is
2148 rarely-used global-only stuff.
2150 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
2151 instead (or tracing for high-volume output).
2153 * Configuration option show_question_marks only affects regular pretty
2154 printing of types and terms, not raw Term.string_of_vname.
2156 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
2157 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
2158 @{thms} for most purposes.
2160 * ML structure Unsynchronized is never opened, not even in Isar
2161 interaction mode as before. Old Unsynchronized.set etc. have been
2162 discontinued -- use plain := instead. This should be *rare* anyway,
2163 since modern tools always work via official context data, notably
2164 configuration options.
2166 * Parallel and asynchronous execution requires special care concerning
2167 interrupts. Structure Exn provides some convenience functions that
2168 avoid working directly with raw Interrupt. User code must not absorb
2169 interrupts -- intermediate handling (for cleanup etc.) needs to be
2170 followed by re-raising of the original exception. Another common
2171 source of mistakes are "handle _" patterns, which make the meaning of
2172 the program subject to physical effects of the environment.
2176 New in Isabelle2009-2 (June 2010)
2177 ---------------------------------
2181 * Authentic syntax for *all* logical entities (type classes, type
2182 constructors, term constants): provides simple and robust
2183 correspondence between formal entities and concrete syntax. Within
2184 the parse tree / AST representations, "constants" are decorated by
2185 their category (class, type, const) and spelled out explicitly with
2186 their full internal name.
2188 Substantial INCOMPATIBILITY concerning low-level syntax declarations
2189 and translations (translation rules and translation functions in ML).
2190 Some hints on upgrading:
2192 - Many existing uses of 'syntax' and 'translations' can be replaced
2193 by more modern 'type_notation', 'notation' and 'abbreviation',
2194 which are independent of this issue.
2196 - 'translations' require markup within the AST; the term syntax
2197 provides the following special forms:
2199 CONST c -- produces syntax version of constant c from context
2200 XCONST c -- literally c, checked as constant from context
2201 c -- literally c, if declared by 'syntax'
2203 Plain identifiers are treated as AST variables -- occasionally the
2204 system indicates accidental variables via the error "rhs contains
2207 Type classes and type constructors are marked according to their
2208 concrete syntax. Some old translations rules need to be written
2209 for the "type" category, using type constructor application
2210 instead of pseudo-term application of the default category
2213 - 'parse_translation' etc. in ML may use the following
2216 @{class_syntax c} -- type class c within parse tree / AST
2217 @{term_syntax c} -- type constructor c within parse tree / AST
2218 @{const_syntax c} -- ML version of "CONST c" above
2219 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
2221 - Literal types within 'typed_print_translations', i.e. those *not*
2222 represented as pseudo-terms are represented verbatim. Use @{class
2223 c} or @{type_name c} here instead of the above syntax
2226 Note that old non-authentic syntax was based on unqualified base
2227 names, so all of the above "constant" names would coincide. Recall
2228 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
2229 diagnose syntax problems.
2231 * Type constructors admit general mixfix syntax, not just infix.
2233 * Concrete syntax may be attached to local entities without a proof
2234 body, too. This works via regular mixfix annotations for 'fix',
2235 'def', 'obtain' etc. or via the explicit 'write' command, which is
2236 similar to the 'notation' command in theory specifications.
2238 * Discontinued unnamed infix syntax (legacy feature for many years) --
2239 need to specify constant name and syntax separately. Internal ML
2240 datatype constructors have been renamed from InfixName to Infix etc.
2241 Minor INCOMPATIBILITY.
2243 * Schematic theorem statements need to be explicitly markup as such,
2244 via commands 'schematic_lemma', 'schematic_theorem',
2245 'schematic_corollary'. Thus the relevance of the proof is made
2246 syntactically clear, which impacts performance in a parallel or
2247 asynchronous interactive environment. Minor INCOMPATIBILITY.
2249 * Use of cumulative prems via "!" in some proof methods has been
2250 discontinued (old legacy feature).
2252 * References 'trace_simp' and 'debug_simp' have been replaced by
2253 configuration options stored in the context. Enabling tracing (the
2254 case of debugging is similar) in proofs works via
2256 using [[trace_simp = true]]
2258 Tracing is then active for all invocations of the simplifier in
2259 subsequent goal refinement steps. Tracing may also still be enabled or
2260 disabled via the ProofGeneral settings menu.
2262 * Separate commands 'hide_class', 'hide_type', 'hide_const',
2263 'hide_fact' replace the former 'hide' KIND command. Minor
2266 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
2267 more efficient than combinations with -q1 or -q2.
2272 * Proofterms record type-class reasoning explicitly, using the
2273 "unconstrain" operation internally. This eliminates all sort
2274 constraints from a theorem and proof, introducing explicit
2275 OFCLASS-premises. On the proof term level, this operation is
2276 automatically applied at theorem boundaries, such that closed proofs
2277 are always free of sort constraints. INCOMPATIBILITY for tools that
2278 inspect proof terms.
2280 * Local theory specifications may depend on extra type variables that
2281 are not present in the result type -- arguments TYPE('a) :: 'a itself
2282 are added internally. For example:
2284 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
2286 * Predicates of locales introduced by classes carry a mandatory
2287 "class" prefix. INCOMPATIBILITY.
2289 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
2291 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
2294 * Command 'code_reflect' allows to incorporate generated ML code into
2295 runtime environment; replaces immature code_datatype antiquotation.
2298 * Code generator: simple concept for abstract datatypes obeying
2301 * Code generator: details of internal data cache have no impact on the
2302 user space functionality any longer.
2304 * Methods "unfold_locales" and "intro_locales" ignore non-locale
2305 subgoals. This is more appropriate for interpretations with 'where'.
2308 * Command 'example_proof' opens an empty proof body. This allows to
2309 experiment with Isar, without producing any persistent result.
2311 * Commands 'type_notation' and 'no_type_notation' declare type syntax
2312 within a local theory context, with explicit checking of the
2313 constructors involved (in contrast to the raw 'syntax' versions).
2315 * Commands 'types' and 'typedecl' now work within a local theory
2316 context -- without introducing dependencies on parameters or
2317 assumptions, which is not possible in Isabelle/Pure.
2319 * Command 'defaultsort' has been renamed to 'default_sort', it works
2320 within a local theory context. Minor INCOMPATIBILITY.
2325 * Command 'typedef' now works within a local theory context -- without
2326 introducing dependencies on parameters or assumptions, which is not
2327 possible in Isabelle/Pure/HOL. Note that the logical environment may
2328 contain multiple interpretations of local typedefs (with different
2329 non-emptiness proofs), even in a global theory context.
2331 * New package for quotient types. Commands 'quotient_type' and
2332 'quotient_definition' may be used for defining types and constants by
2333 quotient constructions. An example is the type of integers created by
2334 quotienting pairs of natural numbers:
2337 intrel :: "(nat * nat) => (nat * nat) => bool"
2339 "intrel (x, y) (u, v) = (x + v = u + y)"
2341 quotient_type int = "nat * nat" / intrel
2342 by (auto simp add: equivp_def expand_fun_eq)
2345 "0::int" is "(0::nat, 0::nat)"
2347 The method "lifting" can be used to lift of theorems from the
2348 underlying "raw" type to the quotient type. The example
2349 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
2350 construction and provides a reasoning infrastructure for finite sets.
2352 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
2353 clash with new theory Quotient in Main HOL.
2355 * Moved the SMT binding into the main HOL session, eliminating
2356 separate HOL-SMT session.
2358 * List membership infix mem operation is only an input abbreviation.
2361 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
2362 for future developements; former Library/Word.thy is still present in
2363 the AFP entry RSAPPS.
2365 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
2366 longer shadowed. INCOMPATIBILITY.
2368 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
2371 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
2374 * Dropped normalizing_semiring etc; use the facts in semiring classes
2375 instead. INCOMPATIBILITY.
2377 * Dropped several real-specific versions of lemmas about floor and
2378 ceiling; use the generic lemmas from theory "Archimedean_Field"
2379 instead. INCOMPATIBILITY.
2381 floor_number_of_eq ~> floor_number_of
2382 le_floor_eq_number_of ~> number_of_le_floor
2383 le_floor_eq_zero ~> zero_le_floor
2384 le_floor_eq_one ~> one_le_floor
2385 floor_less_eq_number_of ~> floor_less_number_of
2386 floor_less_eq_zero ~> floor_less_zero
2387 floor_less_eq_one ~> floor_less_one
2388 less_floor_eq_number_of ~> number_of_less_floor
2389 less_floor_eq_zero ~> zero_less_floor
2390 less_floor_eq_one ~> one_less_floor
2391 floor_le_eq_number_of ~> floor_le_number_of
2392 floor_le_eq_zero ~> floor_le_zero
2393 floor_le_eq_one ~> floor_le_one
2394 floor_subtract_number_of ~> floor_diff_number_of
2395 floor_subtract_one ~> floor_diff_one
2396 ceiling_number_of_eq ~> ceiling_number_of
2397 ceiling_le_eq_number_of ~> ceiling_le_number_of
2398 ceiling_le_zero_eq ~> ceiling_le_zero
2399 ceiling_le_eq_one ~> ceiling_le_one
2400 less_ceiling_eq_number_of ~> number_of_less_ceiling
2401 less_ceiling_eq_zero ~> zero_less_ceiling
2402 less_ceiling_eq_one ~> one_less_ceiling
2403 ceiling_less_eq_number_of ~> ceiling_less_number_of
2404 ceiling_less_eq_zero ~> ceiling_less_zero
2405 ceiling_less_eq_one ~> ceiling_less_one
2406 le_ceiling_eq_number_of ~> number_of_le_ceiling
2407 le_ceiling_eq_zero ~> zero_le_ceiling
2408 le_ceiling_eq_one ~> one_le_ceiling
2409 ceiling_subtract_number_of ~> ceiling_diff_number_of
2410 ceiling_subtract_one ~> ceiling_diff_one
2412 * Theory "Finite_Set": various folding_XXX locales facilitate the
2413 application of the various fold combinators on finite sets.
2415 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
2416 provides abstract red-black tree type which is backed by "RBT_Impl" as
2417 implementation. INCOMPATIBILTY.
2419 * Theory Library/Coinductive_List has been removed -- superseded by
2420 AFP/thys/Coinductive.
2422 * Theory PReal, including the type "preal" and related operations, has
2423 been removed. INCOMPATIBILITY.
2425 * Real: new development using Cauchy Sequences.
2427 * Split off theory "Big_Operators" containing setsum, setprod,
2428 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
2430 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
2431 "Int" etc. INCOMPATIBILITY.
2433 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
2435 * New set of rules "ac_simps" provides combined assoc / commute
2436 rewrites for all interpretations of the appropriate generic locales.
2438 * Renamed theory "OrderedGroup" to "Groups" and split theory
2439 "Ring_and_Field" into theories "Rings" and "Fields"; for more
2440 appropriate and more consistent names suitable for name prefixes
2441 within the HOL theories. INCOMPATIBILITY.
2443 * Some generic constants have been put to appropriate theories:
2444 - less_eq, less: Orderings
2445 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
2446 - inverse, divide: Rings
2449 * More consistent naming of type classes involving orderings (and
2452 lower_semilattice ~> semilattice_inf
2453 upper_semilattice ~> semilattice_sup
2455 dense_linear_order ~> dense_linorder
2457 pordered_ab_group_add ~> ordered_ab_group_add
2458 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
2459 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
2460 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
2461 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
2462 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
2463 pordered_cancel_semiring ~> ordered_cancel_semiring
2464 pordered_comm_monoid_add ~> ordered_comm_monoid_add
2465 pordered_comm_ring ~> ordered_comm_ring
2466 pordered_comm_semiring ~> ordered_comm_semiring
2467 pordered_ring ~> ordered_ring
2468 pordered_ring_abs ~> ordered_ring_abs
2469 pordered_semiring ~> ordered_semiring
2471 ordered_ab_group_add ~> linordered_ab_group_add
2472 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
2473 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
2474 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
2475 ordered_field ~> linordered_field
2476 ordered_field_no_lb ~> linordered_field_no_lb
2477 ordered_field_no_ub ~> linordered_field_no_ub
2478 ordered_field_dense_linear_order ~> dense_linordered_field
2479 ordered_idom ~> linordered_idom
2480 ordered_ring ~> linordered_ring
2481 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
2482 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
2483 ordered_ring_strict ~> linordered_ring_strict
2484 ordered_semidom ~> linordered_semidom
2485 ordered_semiring ~> linordered_semiring
2486 ordered_semiring_1 ~> linordered_semiring_1
2487 ordered_semiring_1_strict ~> linordered_semiring_1_strict
2488 ordered_semiring_strict ~> linordered_semiring_strict
2490 The following slightly odd type classes have been moved to a
2491 separate theory Library/Lattice_Algebras:
2493 lordered_ab_group_add ~> lattice_ab_group_add
2494 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
2495 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
2496 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
2497 lordered_ring ~> lattice_ring
2501 * Refined field classes:
2502 - classes division_ring_inverse_zero, field_inverse_zero,
2503 linordered_field_inverse_zero include rule inverse 0 = 0 --
2504 subsumes former division_by_zero class;
2505 - numerous lemmas have been ported from field to division_ring.
2508 * Refined algebra theorem collections:
2509 - dropped theorem group group_simps, use algebra_simps instead;
2510 - dropped theorem group ring_simps, use field_simps instead;
2511 - proper theorem collection field_simps subsumes former theorem
2512 groups field_eq_simps and field_simps;
2513 - dropped lemma eq_minus_self_iff which is a duplicate for
2517 * Theory Finite_Set and List: some lemmas have been generalized from
2520 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
2521 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
2522 inter_Inter_fold_inter ~> inf_Inf_fold_inf
2523 union_Union_fold_union ~> sup_Sup_fold_sup
2524 Inter_fold_inter ~> Inf_fold_inf
2525 Union_fold_union ~> Sup_fold_sup
2526 inter_INTER_fold_inter ~> inf_INFI_fold_inf
2527 union_UNION_fold_union ~> sup_SUPR_fold_sup
2528 INTER_fold_inter ~> INFI_fold_inf
2529 UNION_fold_union ~> SUPR_fold_sup
2531 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
2532 replaced by the more convenient lemmas Inf_empty and Sup_empty.
2533 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
2534 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
2535 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
2536 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
2538 * Reorganized theory Multiset: swapped notation of pointwise and
2541 - pointwise ordering is instance of class order with standard syntax
2543 - multiset ordering has syntax <=# and <#; partial order properties
2544 are provided by means of interpretation with prefix
2546 - less duplication, less historical organization of sections,
2547 conversion from associations lists to multisets, rudimentary code
2549 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
2554 multiset_eq_conv_count_eq ~> multiset_ext_iff
2555 multi_count_ext ~> multiset_ext
2556 diff_union_inverse2 ~> diff_union_cancelR
2560 * Theory Permutation: replaced local "remove" by List.remove1.
2562 * Code generation: ML and OCaml code is decorated with signatures.
2564 * Theory List: added transpose.
2566 * Library/Nat_Bijection.thy is a collection of bijective functions
2567 between nat and other types, which supersedes the older libraries
2568 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
2571 Nat_Int_Bij.nat2_to_nat ~> prod_encode
2572 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
2573 Nat_Int_Bij.int_to_nat_bij ~> int_encode
2574 Nat_Int_Bij.nat_to_int_bij ~> int_decode
2575 Countable.pair_encode ~> prod_encode
2576 NatIso.prod2nat ~> prod_encode
2577 NatIso.nat2prod ~> prod_decode
2578 NatIso.sum2nat ~> sum_encode
2579 NatIso.nat2sum ~> sum_decode
2580 NatIso.list2nat ~> list_encode
2581 NatIso.nat2list ~> list_decode
2582 NatIso.set2nat ~> set_encode
2583 NatIso.nat2set ~> set_decode
2586 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
2587 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
2588 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
2589 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
2590 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
2591 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
2592 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
2593 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
2594 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
2595 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
2596 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
2597 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
2598 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
2601 - Renamed ATP commands:
2602 atp_info ~> sledgehammer running_atps
2603 atp_kill ~> sledgehammer kill_atps
2604 atp_messages ~> sledgehammer messages
2605 atp_minimize ~> sledgehammer minimize
2606 print_atps ~> sledgehammer available_atps
2608 - Added user's manual ("isabelle doc sledgehammer").
2609 - Added option syntax and "sledgehammer_params" to customize
2610 Sledgehammer's behavior. See the manual for details.
2611 - Modified the Isar proof reconstruction code so that it produces
2612 direct proofs rather than proofs by contradiction. (This feature
2613 is still experimental.)
2614 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
2616 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
2619 - Added and implemented "binary_ints" and "bits" options.
2620 - Added "std" option and implemented support for nonstandard models.
2621 - Added and implemented "finitize" option to improve the precision
2622 of infinite datatypes based on a monotonicity analysis.
2623 - Added support for quotient types.
2624 - Added support for "specification" and "ax_specification"
2626 - Added support for local definitions (for "function" and
2627 "termination" proofs).
2628 - Added support for term postprocessors.
2629 - Optimized "Multiset.multiset" and "FinFun.finfun".
2630 - Improved efficiency of "destroy_constrs" optimization.
2631 - Fixed soundness bugs related to "destroy_constrs" optimization and
2633 - Fixed soundness bug related to higher-order constructors.
2634 - Fixed soundness bug when "full_descrs" is enabled.
2635 - Improved precision of set constructs.
2636 - Added "atoms" option.
2637 - Added cache to speed up repeated Kodkod invocations on the same
2639 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
2640 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
2641 "SAT4J_Light". INCOMPATIBILITY.
2642 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
2643 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
2644 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
2646 * Method "induct" now takes instantiations of the form t, where t is not
2647 a variable, as a shorthand for "x == t", where x is a fresh variable.
2648 If this is not intended, t has to be enclosed in parentheses.
2649 By default, the equalities generated by definitional instantiations
2650 are pre-simplified, which may cause parameters of inductive cases
2651 to disappear, or may even delete some of the inductive cases.
2652 Use "induct (no_simp)" instead of "induct" to restore the old
2653 behaviour. The (no_simp) option is also understood by the "cases"
2654 and "nominal_induct" methods, which now perform pre-simplification, too.
2660 * Variable names in lemmas generated by the domain package have
2661 changed; the naming scheme is now consistent with the HOL datatype
2662 package. Some proof scripts may be affected, INCOMPATIBILITY.
2664 * The domain package no longer defines the function "foo_copy" for
2665 recursive domain "foo". The reach lemma is now stated directly in
2666 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
2667 be reformulated in terms of "foo_take", INCOMPATIBILITY.
2669 * Most definedness lemmas generated by the domain package (previously
2670 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
2671 like "foo$x = UU <-> x = UU", which works better as a simp rule.
2672 Proofs that used definedness lemmas as intro rules may break,
2673 potential INCOMPATIBILITY.
2675 * Induction and casedist rules generated by the domain package now
2676 declare proper case_names (one called "bottom", and one named for each
2677 constructor). INCOMPATIBILITY.
2679 * For mutually-recursive domains, separate "reach" and "take_lemma"
2680 rules are generated for each domain, INCOMPATIBILITY.
2682 foo_bar.reach ~> foo.reach bar.reach
2683 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
2685 * Some lemmas generated by the domain package have been renamed for
2686 consistency with the datatype package, INCOMPATIBILITY.
2688 foo.ind ~> foo.induct
2689 foo.finite_ind ~> foo.finite_induct
2690 foo.coind ~> foo.coinduct
2691 foo.casedist ~> foo.exhaust
2692 foo.exhaust ~> foo.nchotomy
2694 * For consistency with other definition packages, the fixrec package
2695 now generates qualified theorem names, INCOMPATIBILITY.
2697 foo_simps ~> foo.simps
2698 foo_unfold ~> foo.unfold
2699 foo_induct ~> foo.induct
2701 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
2702 method and internal fixrec proofs now use the default simpset instead.
2705 * The "contlub" predicate has been removed. Proof scripts should use
2706 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
2708 * The "admw" predicate has been removed, INCOMPATIBILITY.
2710 * The constants cpair, cfst, and csnd have been removed in favor of
2711 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
2716 * Antiquotations for basic formal entities:
2718 @{class NAME} -- type class
2719 @{class_syntax NAME} -- syntax representation of the above
2721 @{type_name NAME} -- logical type
2722 @{type_abbrev NAME} -- type abbreviation
2723 @{nonterminal NAME} -- type of concrete syntactic category
2724 @{type_syntax NAME} -- syntax representation of any of the above
2726 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
2727 @{const_abbrev NAME} -- abbreviated constant
2728 @{const_syntax NAME} -- syntax representation of any of the above
2730 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
2731 syntax constant (cf. 'syntax' command).
2733 * Antiquotation @{make_string} inlines a function to print arbitrary
2734 values similar to the ML toplevel. The result is compiler dependent
2735 and may fall back on "?" in certain situations.
2737 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
2738 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
2739 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
2740 not work with the asynchronous Isar document model.
2742 * Configuration options now admit dynamic default values, depending on
2743 the context or even global references.
2745 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
2746 uses an efficient external library if available (for Poly/ML).
2748 * Renamed some important ML structures, while keeping the old names
2749 for some time as aliases within the structure Legacy:
2751 OuterKeyword ~> Keyword
2754 OuterSyntax ~> Outer_Syntax
2755 PrintMode ~> Print_Mode
2756 SpecParse ~> Parse_Spec
2759 ThyOutput ~> Thy_Output
2760 TypeInfer ~> Type_Infer
2762 Note that "open Legacy" simplifies porting of sources, but forgetting
2763 to remove it again will complicate porting again in the future.
2765 * Most operations that refer to a global context are named
2766 accordingly, e.g. Simplifier.global_context or
2767 ProofContext.init_global. There are some situations where a global
2768 context actually works, but under normal circumstances one needs to
2769 pass the proper local context through the code!
2771 * Discontinued old TheoryDataFun with its copy/init operation -- data
2772 needs to be pure. Functor Theory_Data_PP retains the traditional
2773 Pretty.pp argument to merge, which is absent in the standard
2774 Theory_Data version.
2776 * Sorts.certify_sort and derived "cert" operations for types and terms
2777 no longer minimize sorts. Thus certification at the boundary of the
2778 inference kernel becomes invariant under addition of class relations,
2779 which is an important monotonicity principle. Sorts are now minimized
2780 in the syntax layer only, at the boundary between the end-user and the
2781 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
2782 explicitly in rare situations.
2784 * Renamed old-style Drule.standard to Drule.export_without_context, to
2785 emphasize that this is in no way a standard operation.
2788 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
2789 usual for resolution. Rare INCOMPATIBILITY.
2791 * Renamed varify/unvarify operations to varify_global/unvarify_global
2792 to emphasize that these only work in a global situation (which is
2795 * Curried take and drop in library.ML; negative length is interpreted
2796 as infinity (as in chop). Subtle INCOMPATIBILITY.
2798 * Proof terms: type substitutions on proof constants now use canonical
2799 order of type variables. INCOMPATIBILITY for tools working with proof
2802 * Raw axioms/defs may no longer carry sort constraints, and raw defs
2803 may no longer carry premises. User-level specifications are
2804 transformed accordingly by Thm.add_axiom/add_def.
2809 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
2810 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
2811 proof terms are enabled unconditionally in the new HOL-Proofs image.
2813 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
2814 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
2817 * Old lib/scripts/polyml-platform is superseded by the
2818 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
2819 variant, even on a 64 bit machine. The following example setting
2820 prefers 64 bit if available:
2822 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
2824 * The preliminary Isabelle/jEdit application demonstrates the emerging
2825 Isabelle/Scala layer for advanced prover interaction and integration.
2826 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
2829 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
2830 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
2831 similar to the default assignment of the document preparation system
2832 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
2833 provides some operations for direct access to the font without asking
2834 the user for manual installation.
2838 New in Isabelle2009-1 (December 2009)
2839 -------------------------------------
2843 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
2844 one backslash should be used, even in ML sources.
2849 * Locale interpretation propagates mixins along the locale hierarchy.
2850 The currently only available mixins are the equations used to map
2851 local definitions to terms of the target domain of an interpretation.
2853 * Reactivated diagnostic command 'print_interps'. Use "print_interps
2854 loc" to print all interpretations of locale "loc" in the theory.
2855 Interpretations in proofs are not shown.
2857 * Thoroughly revised locales tutorial. New section on conditional
2860 * On instantiation of classes, remaining undefined class parameters
2861 are formally declared. INCOMPATIBILITY.
2864 *** Document preparation ***
2866 * New generalized style concept for printing terms: @{foo (style) ...}
2867 instead of @{foo_style style ...} (old form is still retained for
2868 backward compatibility). Styles can be also applied for
2869 antiquotations prop, term_type and typeof.
2874 * New proof method "smt" for a combination of first-order logic with
2875 equality, linear and nonlinear (natural/integer/real) arithmetic, and
2876 fixed-size bitvectors; there is also basic support for higher-order
2877 features (esp. lambda abstractions). It is an incomplete decision
2878 procedure based on external SMT solvers using the oracle mechanism;
2879 for the SMT solver Z3, this method is proof-producing. Certificates
2880 are provided to avoid calling the external solvers solely for
2881 re-checking proofs. Due to a remote SMT service there is no need for
2882 installing SMT solvers locally. See src/HOL/SMT.
2884 * New commands to load and prove verification conditions generated by
2885 the Boogie program verifier or derived systems (e.g. the Verifying C
2886 Compiler (VCC) or Spec#). See src/HOL/Boogie.
2888 * New counterexample generator tool 'nitpick' based on the Kodkod
2889 relational model finder. See src/HOL/Tools/Nitpick and
2890 src/HOL/Nitpick_Examples.
2892 * New commands 'code_pred' and 'values' to invoke the predicate
2893 compiler and to enumerate values of inductive predicates.
2895 * A tabled implementation of the reflexive transitive closure.
2897 * New implementation of quickcheck uses generic code generator;
2898 default generators are provided for all suitable HOL types, records
2899 and datatypes. Old quickcheck can be re-activated importing theory
2900 Library/SML_Quickcheck.
2902 * New testing tool Mirabelle for automated proof tools. Applies
2903 several tools and tactics like sledgehammer, metis, or quickcheck, to
2904 every proof step in a theory. To be used in batch mode via the
2905 "mirabelle" utility.
2907 * New proof method "sos" (sum of squares) for nonlinear real
2908 arithmetic (originally due to John Harison). It requires theory
2909 Library/Sum_Of_Squares. It is not a complete decision procedure but
2910 works well in practice on quantifier-free real arithmetic with +, -,
2911 *, ^, =, <= and <, i.e. boolean combinations of equalities and
2912 inequalities between polynomials. It makes use of external
2913 semidefinite programming solvers. Method "sos" generates a
2914 certificate that can be pasted into the proof thus avoiding the need
2915 to call an external tool every time the proof is checked. See
2916 src/HOL/Library/Sum_Of_Squares.
2918 * New method "linarith" invokes existing linear arithmetic decision
2921 * New command 'atp_minimal' reduces result produced by Sledgehammer.
2923 * New Sledgehammer option "Full Types" in Proof General settings menu.
2924 Causes full type information to be output to the ATPs. This slows
2925 ATPs down considerably but eliminates a source of unsound "proofs"
2928 * New method "metisFT": A version of metis that uses full type
2929 information in order to avoid failures of proof reconstruction.
2931 * New evaluator "approximate" approximates an real valued term using
2932 the same method as the approximation method.
2934 * Method "approximate" now supports arithmetic expressions as
2935 boundaries of intervals and implements interval splitting and Taylor
2938 * ML antiquotation @{code_datatype} inserts definition of a datatype
2939 generated by the code generator; e.g. see src/HOL/Predicate.thy.
2941 * New theory SupInf of the supremum and infimum operators for sets of
2944 * New theory Probability, which contains a development of measure
2945 theory, eventually leading to Lebesgue integration and probability.
2947 * Extended Multivariate Analysis to include derivation and Brouwer's
2950 * Reorganization of number theory, INCOMPATIBILITY:
2951 - new number theory development for nat and int, in theories Divides
2952 and GCD as well as in new session Number_Theory
2953 - some constants and facts now suffixed with _nat and _int
2955 - former session NumberTheory now named Old_Number_Theory, including
2956 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
2957 - moved theory Pocklington from src/HOL/Library to
2958 src/HOL/Old_Number_Theory
2960 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
2961 lcm of finite and infinite sets. It is shown that they form a complete
2964 * Class semiring_div requires superclass no_zero_divisors and proof of
2965 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
2966 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
2967 generalized to class semiring_div, subsuming former theorems
2968 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
2969 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
2972 * Refinements to lattice classes and sets:
2973 - less default intro/elim rules in locale variant, more default
2974 intro/elim rules in class variant: more uniformity
2975 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
2977 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
2979 - renamed ACI to inf_sup_aci
2980 - new class "boolean_algebra"
2981 - class "complete_lattice" moved to separate theory
2982 "Complete_Lattice"; corresponding constants (and abbreviations)
2983 renamed and with authentic syntax:
2984 Set.Inf ~> Complete_Lattice.Inf
2985 Set.Sup ~> Complete_Lattice.Sup
2986 Set.INFI ~> Complete_Lattice.INFI
2987 Set.SUPR ~> Complete_Lattice.SUPR
2988 Set.Inter ~> Complete_Lattice.Inter
2989 Set.Union ~> Complete_Lattice.Union
2990 Set.INTER ~> Complete_Lattice.INTER
2991 Set.UNION ~> Complete_Lattice.UNION
2992 - authentic syntax for
2995 - mere abbreviations:
2998 Set.inter (for inf, formerly Set.Int)
2999 Set.union (for sup, formerly Set.Un)
3000 Complete_Lattice.Inter (for Inf)
3001 Complete_Lattice.Union (for Sup)
3002 Complete_Lattice.INTER (for INFI)
3003 Complete_Lattice.UNION (for SUPR)
3004 - object-logic definitions as far as appropriate
3006 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
3007 Un_subset_iff are explicitly deleted as default simp rules; then also
3008 their lattice counterparts le_inf_iff and le_sup_iff have to be
3009 deleted to achieve the desired effect.
3011 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
3012 rules by default any longer; the same applies to min_max.inf_absorb1
3013 etc. INCOMPATIBILITY.
3015 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
3016 pred_set_conv by default. INCOMPATIBILITY.
3018 * Power operations on relations and functions are now one dedicated
3019 constant "compow" with infix syntax "^^". Power operation on
3020 multiplicative monoids retains syntax "^" and is now defined generic
3021 in class power. INCOMPATIBILITY.
3023 * Relation composition "R O S" now has a more standard argument order:
3024 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
3025 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
3026 break, since the O_assoc rule was not rewritten like this. Fix using
3027 O_assoc[symmetric]. The same applies to the curried version "R OO S".
3029 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
3030 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
3033 * Most rules produced by inductive and datatype package have mandatory
3034 prefixes. INCOMPATIBILITY.
3036 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
3037 the attribute of the same name. Each of the theorems in the list
3038 DERIV_intros assumes composition with an additional function and
3039 matches a variable to the derivative, which has to be solved by the
3040 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
3041 of most elementary terms. Former Maclauren.DERIV_tac and
3042 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
3045 * Code generator attributes follow the usual underscore convention:
3046 code_unfold replaces code unfold
3047 code_post replaces code post
3052 sizechange -> size_change
3053 induct_scheme -> induction_schema
3056 * Discontinued abbreviation "arbitrary" of constant "undefined".
3057 INCOMPATIBILITY, use "undefined" directly.
3060 Suc_eq_add_numeral_1 -> Suc_eq_plus1
3061 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
3062 Suc_plus1 -> Suc_eq_plus1
3063 *anti_sym -> *antisym*
3064 vector_less_eq_def -> vector_le_def
3067 * Added theorem List.map_map as [simp]. Removed List.map_compose.
3070 * Removed predicate "M hassize n" (<--> card M = n & finite M).
3076 * Theory Representable defines a class "rep" of domains that are
3077 representable (via an ep-pair) in the universal domain type "udom".
3078 Instances are provided for all type constructors defined in HOLCF.
3080 * The 'new_domain' command is a purely definitional version of the
3081 domain package, for representable domains. Syntax is identical to the
3082 old domain package. The 'new_domain' package also supports indirect
3083 recursion using previously-defined type constructors. See
3084 src/HOLCF/ex/New_Domain.thy for examples.
3086 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
3087 on the left-hand side of an equation, and then performs
3088 simplification. Rewriting is done using rules declared with the
3089 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
3090 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
3092 * The pattern-match compiler in 'fixrec' can now handle constructors
3093 with HOL function types. Pattern-match combinators for the Pair
3094 constructor are pre-configured.
3096 * The 'fixrec' package now produces better fixed-point induction rules
3097 for mutually-recursive definitions: Induction rules have conclusions
3098 of the form "P foo bar" instead of "P <foo, bar>".
3100 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
3101 been renamed to "below". The name "below" now replaces "less" in many
3102 theorem names. (Legacy theorem names using "less" are still supported
3105 * The 'fixrec' package now supports "bottom patterns". Bottom
3106 patterns can be used to generate strictness rules, or to make
3107 functions more strict (much like the bang-patterns supported by the
3108 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
3114 * Support for Poly/ML 5.3.0, with improved reporting of compiler
3115 errors and run-time exceptions, including detailed source positions.
3117 * Structure Name_Space (formerly NameSpace) now manages uniquely
3118 identified entries, with some additional information such as source
3119 position, logical grouping etc.
3121 * Theory and context data is now introduced by the simplified and
3122 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
3123 to be pure, but the old TheoryDataFun for mutable data (with explicit
3124 copy operation) is still available for some time.
3126 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
3127 provides a high-level programming interface to synchronized state
3128 variables with atomic update. This works via pure function
3129 application within a critical section -- its runtime should be as
3130 short as possible; beware of deadlocks if critical code is nested,
3131 either directly or indirectly via other synchronized variables!
3133 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
3134 wraps raw ML references, explicitly indicating their non-thread-safe
3135 behaviour. The Isar toplevel keeps this structure open, to
3136 accommodate Proof General as well as quick and dirty interactive
3137 experiments with references.
3139 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
3140 parallel tactical reasoning.
3142 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
3143 are similar to SUBPROOF, but are slightly more flexible: only the
3144 specified parts of the subgoal are imported into the context, and the
3145 body tactic may introduce new subgoals and schematic variables.
3147 * Old tactical METAHYPS, which does not observe the proof context, has
3148 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
3149 or Subgoal.FOCUS etc.
3151 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
3152 functors have their own ML name space there is no point to mark them
3153 separately.) Minor INCOMPATIBILITY.
3155 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
3157 * Renamed several structures FooBar to Foo_Bar. Occasional,
3160 * Operations of structure Skip_Proof no longer require quick_and_dirty
3161 mode, which avoids critical setmp.
3163 * Eliminated old Attrib.add_attributes, Method.add_methods and related
3164 combinators for "args". INCOMPATIBILITY, need to use simplified
3165 Attrib/Method.setup introduced in Isabelle2009.
3167 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
3168 back on global_simpset_of, global_claset_of, global_clasimpset_of as
3169 last resort. INCOMPATIBILITY.
3171 * Display.pretty_thm now requires a proper context (cf. former
3172 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
3173 or even Display.pretty_thm_without_context as last resort.
3176 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
3177 Syntax.pretty_typ/term directly, preferably with proper context
3178 instead of global theory.
3183 * Further fine tuning of parallel proof checking, scales up to 8 cores
3184 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
3187 * Support for additional "Isabelle components" via etc/components, see
3188 also the system manual.
3190 * The isabelle makeall tool now operates on all components with
3191 IsaMakefile, not just hardwired "logics".
3193 * Removed "compress" option from isabelle-process and isabelle usedir;
3194 this is always enabled.
3196 * Discontinued support for Poly/ML 4.x versions.
3198 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
3199 on a given logic image. This requires the lighttpd webserver and is
3200 currently supported on Linux only.
3204 New in Isabelle2009 (April 2009)
3205 --------------------------------
3209 * Simplified main Isabelle executables, with less surprises on
3210 case-insensitive file-systems (such as Mac OS).
3212 - The main Isabelle tool wrapper is now called "isabelle" instead of
3215 - The former "isabelle" alias for "isabelle-process" has been
3216 removed (should rarely occur to regular users).
3218 - The former "isabelle-interface" and its alias "Isabelle" have been
3219 removed (interfaces are now regular Isabelle tools).
3221 Within scripts and make files, the Isabelle environment variables
3222 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
3223 respectively. (The latter are still available as legacy feature.)
3225 The old isabelle-interface wrapper could react in confusing ways if
3226 the interface was uninstalled or changed otherwise. Individual
3227 interface tool configuration is now more explicit, see also the
3228 Isabelle system manual. In particular, Proof General is now available
3229 via "isabelle emacs".
3231 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
3232 purge installed copies of Isabelle executables and re-run "isabelle
3233 install -p ...", or use symlinks.
3235 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
3236 old ~/isabelle, which was slightly non-standard and apt to cause
3237 surprises on case-insensitive file-systems (such as Mac OS).
3239 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
3240 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
3241 care is required when using older releases of Isabelle. Note that
3242 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
3243 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
3245 * Proofs of fully specified statements are run in parallel on
3246 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
3247 a regular 4-core machine, if the initial heap space is made reasonably
3248 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
3250 * The main reference manuals ("isar-ref", "implementation", and
3251 "system") have been updated and extended. Formally checked references
3252 as hyperlinks are now available uniformly.
3257 * Complete re-implementation of locales. INCOMPATIBILITY in several
3258 respects. The most important changes are listed below. See the
3259 Tutorial on Locales ("locales" manual) for details.
3261 - In locale expressions, instantiation replaces renaming. Parameters
3262 must be declared in a for clause. To aid compatibility with previous
3263 parameter inheritance, in locale declarations, parameters that are not
3264 'touched' (instantiation position "_" or omitted) are implicitly added
3265 with their syntax at the beginning of the for clause.
3267 - Syntax from abbreviations and definitions in locales is available in
3268 locale expressions and context elements. The latter is particularly
3269 useful in locale declarations.
3271 - More flexible mechanisms to qualify names generated by locale
3272 expressions. Qualifiers (prefixes) may be specified in locale
3273 expressions, and can be marked as mandatory (syntax: "name!:") or
3274 optional (syntax "name?:"). The default depends for plain "name:"
3275 depends on the situation where a locale expression is used: in
3276 commands 'locale' and 'sublocale' prefixes are optional, in
3277 'interpretation' and 'interpret' prefixes are mandatory. The old
3278 implicit qualifiers derived from the parameter names of a locale are
3279 no longer generated.
3281 - Command "sublocale l < e" replaces "interpretation l < e". The
3282 instantiation clause in "interpretation" and "interpret" (square
3283 brackets) is no longer available. Use locale expressions.
3285 - When converting proof scripts, mandatory qualifiers in
3286 'interpretation' and 'interpret' should be retained by default, even
3287 if this is an INCOMPATIBILITY compared to former behavior. In the
3288 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
3289 in locale expressions range over a single locale instance only.
3291 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
3292 In existing theorem specifications replace the includes element by the
3293 respective context elements of the included locale, omitting those
3294 that are already present in the theorem specification. Multiple
3295 assume elements of a locale should be replaced by a single one
3296 involving the locale predicate. In the proof body, declarations (most
3297 notably theorems) may be regained by interpreting the respective
3298 locales in the proof context as required (command "interpret").
3300 If using "includes" in replacement of a target solely because the
3301 parameter types in the theorem are not as general as in the target,
3302 consider declaring a new locale with additional type constraints on
3303 the parameters (context element "constrains").
3305 - Discontinued "locale (open)". INCOMPATIBILITY.
3307 - Locale interpretation commands no longer attempt to simplify goal.
3308 INCOMPATIBILITY: in rare situations the generated goal differs. Use
3309 methods intro_locales and unfold_locales to clarify.
3311 - Locale interpretation commands no longer accept interpretation
3312 attributes. INCOMPATIBILITY.
3314 * Class declaration: so-called "base sort" must not be given in import
3315 list any longer, but is inferred from the specification. Particularly
3322 class foo = type + ...
3324 * Class target: global versions of theorems stemming do not carry a
3325 parameter prefix any longer. INCOMPATIBILITY.
3327 * Class 'instance' command no longer accepts attached definitions.
3328 INCOMPATIBILITY, use proper 'instantiation' target instead.
3330 * Recovered hiding of consts, which was accidentally broken in
3331 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
3332 makes c inaccessible; consider using ``hide (open) const c'' instead.
3334 * Slightly more coherent Pure syntax, with updated documentation in
3335 isar-ref manual. Removed locales meta_term_syntax and
3336 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
3337 INCOMPATIBILITY in rare situations. Note that &&& should not be used
3338 directly in regular applications.
3340 * There is a new syntactic category "float_const" for signed decimal
3341 fractions (e.g. 123.45 or -123.45).
3343 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
3344 interface with 'setup' command instead.
3346 * Command 'local_setup' is similar to 'setup', but operates on a local
3349 * The 'axiomatization' command now only works within a global theory
3350 context. INCOMPATIBILITY.
3352 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
3353 hypotheses. Sorts required in the course of reasoning need to be
3354 covered by the constraints in the initial statement, completed by the
3355 type instance information of the background theory. Non-trivial sort
3356 hypotheses, which rarely occur in practice, may be specified via
3357 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
3359 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
3361 The result contains an implicit sort hypotheses as before --
3362 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
3365 * Generalized Isar history, with support for linear undo, direct state
3368 * Changed defaults for unify configuration options:
3370 unify_trace_bound = 50 (formerly 25)
3371 unify_search_bound = 60 (formerly 30)
3373 * Different bookkeeping for code equations (INCOMPATIBILITY):
3375 a) On theory merge, the last set of code equations for a particular
3376 constant is taken (in accordance with the policy applied by other
3377 parts of the code generator framework).
3379 b) Code equations stemming from explicit declarations (e.g. code
3380 attribute) gain priority over default code equations stemming
3381 from definition, primrec, fun etc.
3383 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
3385 * Unified theorem tables for both code generators. Thus [code
3386 func] has disappeared and only [code] remains. INCOMPATIBILITY.
3388 * Command 'find_consts' searches for constants based on type and name
3391 find_consts "_ => bool"
3393 By default, matching is against subtypes, but it may be restricted to
3394 the whole type. Searching by name is possible. Multiple queries are
3395 conjunctive and queries may be negated by prefixing them with a
3398 find_consts strict: "_ => bool" name: "Int" -"int => int"
3400 * New 'find_theorems' criterion "solves" matches theorems that
3401 directly solve the current goal (modulo higher-order unification).
3403 * Auto solve feature for main theorem statements: whenever a new goal
3404 is stated, "find_theorems solves" is called; any theorems that could
3405 solve the lemma directly are listed as part of the goal state.
3406 Cf. associated options in Proof General Isabelle settings menu,
3407 enabled by default, with reasonable timeout for pathological cases of
3408 higher-order unification.
3411 *** Document preparation ***
3413 * Antiquotation @{lemma} now imitates a regular terminal proof,
3414 demanding keyword 'by' and supporting the full method expression
3415 syntax just like the Isar command 'by'.
3420 * Integrated main parts of former image HOL-Complex with HOL. Entry
3421 points Main and Complex_Main remain as before.
3423 * Logic image HOL-Plain provides a minimal HOL with the most important
3424 tools available (inductive, datatype, primrec, ...). This facilitates
3425 experimentation and tool development. Note that user applications
3426 (and library theories) should never refer to anything below theory
3429 * Logic image HOL-Main stops at theory Main, and thus facilitates
3430 experimentation due to shorter build times.
3432 * Logic image HOL-NSA contains theories of nonstandard analysis which
3433 were previously part of former HOL-Complex. Entry point Hyperreal
3434 remains valid, but theories formerly using Complex_Main should now use
3435 new entry point Hypercomplex.
3437 * Generic ATP manager for Sledgehammer, based on ML threads instead of
3438 Posix processes. Avoids potentially expensive forking of the ML
3439 process. New thread-based implementation also works on non-Unix
3440 platforms (Cygwin). Provers are no longer hardwired, but defined
3441 within the theory via plain ML wrapper functions. Basic Sledgehammer
3442 commands are covered in the isar-ref manual.
3444 * Wrapper scripts for remote SystemOnTPTP service allows to use
3445 sledgehammer without local ATP installation (Vampire etc.). Other
3446 provers may be included via suitable ML wrappers, see also
3447 src/HOL/ATP_Linkup.thy.
3449 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
3452 * The metis method no longer fails because the theorem is too trivial
3453 (contains the empty clause).
3455 * The metis method now fails in the usual manner, rather than raising
3456 an exception, if it determines that it cannot prove the theorem.
3458 * Method "coherent" implements a prover for coherent logic (see also
3459 src/Tools/coherent.ML).
3461 * Constants "undefined" and "default" replace "arbitrary". Usually
3462 "undefined" is the right choice to replace "arbitrary", though
3463 logically there is no difference. INCOMPATIBILITY.
3465 * Command "value" now integrates different evaluation mechanisms. The
3466 result of the first successful evaluation mechanism is printed. In
3467 square brackets a particular named evaluation mechanisms may be
3468 specified (currently, [SML], [code] or [nbe]). See further
3469 src/HOL/ex/Eval_Examples.thy.
3471 * Normalization by evaluation now allows non-leftlinear equations.
3472 Declare with attribute [code nbe].
3474 * Methods "case_tac" and "induct_tac" now refer to the very same rules
3475 as the structured Isar versions "cases" and "induct", cf. the
3476 corresponding "cases" and "induct" attributes. Mutual induction rules
3477 are now presented as a list of individual projections
3478 (e.g. foo_bar.inducts for types foo and bar); the old format with
3479 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
3480 rare situations a different rule is selected --- notably nested tuple
3481 elimination instead of former prod.exhaust: use explicit (case_tac t
3482 rule: prod.exhaust) here.
3484 * Attributes "cases", "induct", "coinduct" support "del" option.
3486 * Removed fact "case_split_thm", which duplicates "case_split".
3488 * The option datatype has been moved to a new theory Option. Renamed
3489 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
3491 * New predicate "strict_mono" classifies strict functions on partial
3492 orders. With strict functions on linear orders, reasoning about
3493 (in)equalities is facilitated by theorems "strict_mono_eq",
3494 "strict_mono_less_eq" and "strict_mono_less".
3496 * Some set operations are now proper qualified constants with
3497 authentic syntax. INCOMPATIBILITY:
3508 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
3511 * Auxiliary class "itself" has disappeared -- classes without any
3512 parameter are treated as expected by the 'class' command.
3514 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
3516 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
3517 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
3519 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
3520 method "approximation". It proves formulas on real values by using
3521 interval arithmetic. In the formulas are also the transcendental
3522 functions sin, cos, tan, atan, ln, exp and the constant pi are
3523 allowed. For examples see
3524 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
3526 * Theory "Reflection" now resides in HOL/Library.
3528 * Entry point to Word library now simply named "Word".
3531 * Made source layout more coherent with logical distribution
3534 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
3535 src/HOL/Library/Code_Message.thy ~> src/HOL/
3536 src/HOL/Library/GCD.thy ~> src/HOL/
3537 src/HOL/Library/Order_Relation.thy ~> src/HOL/
3538 src/HOL/Library/Parity.thy ~> src/HOL/
3539 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
3540 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
3541 src/HOL/Real/Lubs.thy ~> src/HOL/
3542 src/HOL/Real/PReal.thy ~> src/HOL/
3543 src/HOL/Real/Rational.thy ~> src/HOL/
3544 src/HOL/Real/RComplete.thy ~> src/HOL/
3545 src/HOL/Real/RealDef.thy ~> src/HOL/
3546 src/HOL/Real/RealPow.thy ~> src/HOL/
3547 src/HOL/Real/Real.thy ~> src/HOL/
3548 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
3549 src/HOL/Complex/Complex.thy ~> src/HOL/
3550 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
3551 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
3552 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
3553 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
3554 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
3555 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
3556 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
3557 src/HOL/Hyperreal/Log.thy ~> src/HOL/
3558 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
3559 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
3560 src/HOL/Hyperreal/Series.thy ~> src/HOL/
3561 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
3562 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
3563 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
3564 src/HOL/Real/Float ~> src/HOL/Library/
3565 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
3566 src/HOL/Real/RealVector.thy ~> src/HOL/
3568 src/HOL/arith_data.ML ~> src/HOL/Tools
3569 src/HOL/hologic.ML ~> src/HOL/Tools
3570 src/HOL/simpdata.ML ~> src/HOL/Tools
3571 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
3572 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
3573 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
3574 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
3575 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
3576 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
3577 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
3579 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
3580 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
3581 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
3582 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
3583 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
3584 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
3586 * If methods "eval" and "evaluation" encounter a structured proof
3587 state with !!/==>, only the conclusion is evaluated to True (if
3588 possible), avoiding strange error messages.
3590 * Method "sizechange" automates termination proofs using (a
3591 modification of) the size-change principle. Requires SAT solver. See
3592 src/HOL/ex/Termination.thy for examples.
3594 * Simplifier: simproc for let expressions now unfolds if bound
3595 variable occurs at most once in let expression body. INCOMPATIBILITY.
3597 * Method "arith": Linear arithmetic now ignores all inequalities when
3598 fast_arith_neq_limit is exceeded, instead of giving up entirely.
3600 * New attribute "arith" for facts that should always be used
3601 automatically by arithmetic. It is intended to be used locally in
3604 assumes [arith]: "x > 0"
3606 Global usage is discouraged because of possible performance impact.
3608 * New classes "top" and "bot" with corresponding operations "top" and
3609 "bot" in theory Orderings; instantiation of class "complete_lattice"
3610 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
3612 * Changed definition lemma "less_fun_def" in order to provide an
3613 instance for preorders on functions; use lemma "less_le" instead.
3616 * Theory Orderings: class "wellorder" moved here, with explicit
3617 induction rule "less_induct" as assumption. For instantiation of
3618 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
3621 * Theory Orderings: added class "preorder" as superclass of "order".
3622 INCOMPATIBILITY: Instantiation proofs for order, linorder
3623 etc. slightly changed. Some theorems named order_class.* now named
3626 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
3629 * Theory Finite_Set: added a new fold combinator of type
3631 ('a => 'b => 'b) => 'b => 'a set => 'b
3633 Occasionally this is more convenient than the old fold combinator
3634 which is now defined in terms of the new one and renamed to
3637 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
3638 and "ring_simps" have been replaced by "algebra_simps" (which can be
3639 extended with further lemmas!). At the moment both still exist but
3640 the former will disappear at some point.
3642 * Theory Power: Lemma power_Suc is now declared as a simp rule in
3643 class recpower. Type-specific simp rules for various recpower types
3644 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
3646 rat_power_0 -> power_0
3647 rat_power_Suc -> power_Suc
3648 realpow_0 -> power_0
3649 realpow_Suc -> power_Suc
3650 complexpow_0 -> power_0
3651 complexpow_Suc -> power_Suc
3652 power_poly_0 -> power_0
3653 power_poly_Suc -> power_Suc
3655 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
3656 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
3657 dvd has been generalized to class comm_semiring_1. Likewise a bunch
3658 of lemmas from Divides has been generalized from nat to class
3659 semiring_div. INCOMPATIBILITY. This involves the following theorem
3660 renames resulting from duplicate elimination:
3662 dvd_def_mod ~> dvd_eq_mod_eq_0
3663 zero_dvd_iff ~> dvd_0_left_iff
3664 dvd_0 ~> dvd_0_right
3665 DIVISION_BY_ZERO_DIV ~> div_by_0
3666 DIVISION_BY_ZERO_MOD ~> mod_by_0
3667 mult_div ~> div_mult_self2_is_id
3668 mult_mod ~> mod_mult_self2_is_0
3670 * Theory IntDiv: removed many lemmas that are instances of class-based
3671 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
3672 rename old lemmas as follows:
3674 dvd_diff -> nat_dvd_diff
3675 dvd_zminus_iff -> dvd_minus_iff
3676 mod_add1_eq -> mod_add_eq
3677 mod_mult1_eq -> mod_mult_right_eq
3678 mod_mult1_eq' -> mod_mult_left_eq
3679 mod_mult_distrib_mod -> mod_mult_eq
3680 nat_mod_add_left_eq -> mod_add_left_eq
3681 nat_mod_add_right_eq -> mod_add_right_eq
3682 nat_mod_div_trivial -> mod_div_trivial
3683 nat_mod_mod_trivial -> mod_mod_trivial
3684 zdiv_zadd_self1 -> div_add_self1
3685 zdiv_zadd_self2 -> div_add_self2
3686 zdiv_zmult_self1 -> div_mult_self2_is_id
3687 zdiv_zmult_self2 -> div_mult_self1_is_id
3688 zdvd_triv_left -> dvd_triv_left
3689 zdvd_triv_right -> dvd_triv_right
3690 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
3691 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
3692 zmod_zadd_left_eq -> mod_add_left_eq
3693 zmod_zadd_right_eq -> mod_add_right_eq
3694 zmod_zadd_self1 -> mod_add_self1
3695 zmod_zadd_self2 -> mod_add_self2
3696 zmod_zadd1_eq -> mod_add_eq
3697 zmod_zdiff1_eq -> mod_diff_eq
3698 zmod_zdvd_zmod -> mod_mod_cancel
3699 zmod_zmod_cancel -> mod_mod_cancel
3700 zmod_zmult_self1 -> mod_mult_self2_is_0
3701 zmod_zmult_self2 -> mod_mult_self1_is_0
3704 zdvd_abs1 -> abs_dvd_iff
3705 zdvd_abs2 -> dvd_abs_iff
3706 zdvd_refl -> dvd_refl
3707 zdvd_trans -> dvd_trans
3708 zdvd_zadd -> dvd_add
3709 zdvd_zdiff -> dvd_diff
3710 zdvd_zminus_iff -> dvd_minus_iff
3711 zdvd_zminus2_iff -> minus_dvd_iff
3712 zdvd_zmultD -> dvd_mult_right
3713 zdvd_zmultD2 -> dvd_mult_left
3714 zdvd_zmult_mono -> mult_dvd_mono
3715 zdvd_0_right -> dvd_0_right
3716 zdvd_0_left -> dvd_0_left_iff
3717 zdvd_1_left -> one_dvd
3718 zminus_dvd_iff -> minus_dvd_iff
3720 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
3722 * The real numbers offer decimal input syntax: 12.34 is translated
3723 into 1234/10^2. This translation is not reversed upon output.
3725 * Theory Library/Polynomial defines an abstract type 'a poly of
3726 univariate polynomials with coefficients of type 'a. In addition to
3727 the standard ring operations, it also supports div and mod. Code
3728 generation is also supported, using list-style constructors.
3730 * Theory Library/Inner_Product defines a class of real_inner for real
3731 inner product spaces, with an overloaded operation inner :: 'a => 'a
3732 => real. Class real_inner is a subclass of real_normed_vector from
3735 * Theory Library/Product_Vector provides instances for the product
3736 type 'a * 'b of several classes from RealVector and Inner_Product.
3737 Definitions of addition, subtraction, scalar multiplication, norms,
3738 and inner products are included.
3740 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
3741 addition to the field operations, numerals and case syntax are also
3744 * Theory Library/Diagonalize provides constructive version of Cantor's
3745 first diagonalization argument.
3747 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
3748 zlcm (for int); carried together from various gcd/lcm developements in
3749 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
3750 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
3751 may recover tupled syntax as follows:
3753 hide (open) const gcd
3754 abbreviation gcd where
3755 "gcd == (%(a, b). GCD.gcd a b)"
3757 GCD.gcd ("gcd '(_, _')")
3759 The same works for lcm, zgcd, zlcm.
3761 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
3762 instantiations for algebraic structures. Removed some duplicate
3763 theorems. Changes in simp rules. INCOMPATIBILITY.
3765 * ML antiquotation @{code} takes a constant as argument and generates
3766 corresponding code in background and inserts name of the corresponding
3767 resulting ML value/function/datatype constructor binding in place.
3768 All occurrences of @{code} with a single ML block are generated
3769 simultaneously. Provides a generic and safe interface for
3770 instrumentalizing code generation. See
3771 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
3772 In future you ought to refrain from ad-hoc compiling generated SML
3773 code on the ML toplevel. Note that (for technical reasons) @{code}
3774 cannot refer to constants for which user-defined serializations are
3775 set. Refer to the corresponding ML counterpart directly in that
3778 * Command 'rep_datatype': instead of theorem names the command now
3779 takes a list of terms denoting the constructors of the type to be
3780 represented as datatype. The characteristic theorems have to be
3781 proven. INCOMPATIBILITY. Also observe that the following theorems
3782 have disappeared in favour of existing ones:
3784 unit_induct ~> unit.induct
3785 prod_induct ~> prod.induct
3786 sum_induct ~> sum.induct
3787 Suc_Suc_eq ~> nat.inject
3788 Suc_not_Zero Zero_not_Suc ~> nat.distinct
3793 * New locales for orders and lattices where the equivalence relation
3794 is not restricted to equality. INCOMPATIBILITY: all order and lattice
3795 locales use a record structure with field eq for the equivalence.
3797 * New theory of factorial domains.
3799 * Units_l_inv and Units_r_inv are now simp rules by default.
3800 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
3801 and/or r_inv will now also require deletion of these lemmas.
3803 * Renamed the following theorems, INCOMPATIBILITY:
3805 UpperD ~> Upper_memD
3806 LowerD ~> Lower_memD
3807 least_carrier ~> least_closed
3808 greatest_carrier ~> greatest_closed
3809 greatest_Lower_above ~> greatest_Lower_below
3810 one_zero ~> carrier_one_zero
3811 one_not_zero ~> carrier_one_not_zero (collision with assumption)
3816 * Nominal datatypes can now contain type-variables.
3818 * Commands 'nominal_inductive' and 'equivariance' work with local
3821 * Nominal primrec can now works with local theory targets and its
3822 specification syntax now conforms to the general format as seen in
3825 * Method "perm_simp" honours the standard simplifier attributes
3826 (no_asm), (no_asm_use) etc.
3828 * The new predicate #* is defined like freshness, except that on the
3829 left hand side can be a set or list of atoms.
3831 * Experimental command 'nominal_inductive2' derives strong induction
3832 principles for inductive definitions. In contrast to
3833 'nominal_inductive', which can only deal with a fixed number of
3834 binders, it can deal with arbitrary expressions standing for sets of
3835 atoms to be avoided. The only inductive definition we have at the
3836 moment that needs this generalisation is the typing rule for Lets in
3839 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
3840 -----------------------------------------------------------------
3841 Gamma |- Let x be t1 in t2 : T2
3843 In this rule one wants to avoid all the binders that are introduced by
3844 "close Gamma T1". We are looking for other examples where this
3845 feature might be useful. Please let us know.
3850 * Reimplemented the simplification procedure for proving continuity
3851 subgoals. The new simproc is extensible; users can declare additional
3852 continuity introduction rules with the attribute [cont2cont].
3854 * The continuity simproc now uses a different introduction rule for
3855 solving continuity subgoals on terms with lambda abstractions. In
3856 some rare cases the new simproc may fail to solve subgoals that the
3857 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
3858 Potential INCOMPATIBILITY.
3860 * Command 'fixrec': specification syntax now conforms to the general
3861 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
3862 examples. INCOMPATIBILITY.
3867 * Proof of Zorn's Lemma for partial orders.
3872 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
3873 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
3874 depends on multithreading, so timouts will not work before Poly/ML
3877 * High-level support for concurrent ML programming, see
3878 src/Pure/Cuncurrent. The data-oriented model of "future values" is
3879 particularly convenient to organize independent functional
3880 computations. The concept of "synchronized variables" provides a
3881 higher-order interface for components with shared state, avoiding the
3882 delicate details of mutexes and condition variables. (Requires
3883 Poly/ML 5.2.1 or later.)
3885 * ML bindings produced via Isar commands are stored within the Isar
3886 context (theory or proof). Consequently, commands like 'use' and 'ML'
3887 become thread-safe and work with undo as expected (concerning
3888 top-level bindings, not side-effects on global references).
3889 INCOMPATIBILITY, need to provide proper Isar context when invoking the
3890 compiler at runtime; really global bindings need to be given outside a
3891 theory. (Requires Poly/ML 5.2 or later.)
3893 * Command 'ML_prf' is analogous to 'ML' but works within a proof
3894 context. Top-level ML bindings are stored within the proof context in
3895 a purely sequential fashion, disregarding the nested proof structure.
3896 ML bindings introduced by 'ML_prf' are discarded at the end of the
3897 proof. (Requires Poly/ML 5.2 or later.)
3899 * Simplified ML attribute and method setup, cf. functions Attrib.setup
3900 and Method.setup, as well as Isar commands 'attribute_setup' and
3901 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
3902 existing code accordingly, or use plain 'setup' together with old
3905 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
3906 to 'a -> thm, while results are always tagged with an authentic oracle
3907 name. The Isar command 'oracle' is now polymorphic, no argument type
3908 is specified. INCOMPATIBILITY, need to simplify existing oracle code
3909 accordingly. Note that extra performance may be gained by producing
3910 the cterm carefully, avoiding slow Thm.cterm_of.
3912 * Simplified interface for defining document antiquotations via
3913 ThyOutput.antiquotation, ThyOutput.output, and optionally
3914 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
3915 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
3918 * More systematic treatment of long names, abstract name bindings, and
3919 name space operations. Basic operations on qualified names have been
3920 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
3921 Long_Name.append. Old type bstring has been mostly replaced by
3922 abstract type binding (see structure Binding), which supports precise
3923 qualification by packages and local theory targets, as well as proper
3924 tracking of source positions. INCOMPATIBILITY, need to wrap old
3925 bstring values into Binding.name, or better pass through abstract
3926 bindings everywhere. See further src/Pure/General/long_name.ML,
3927 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
3929 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
3930 LocalTheory.note etc.) now refer to the *full* internal name, not the
3931 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
3933 * Disposed old type and term read functions (Sign.read_def_typ,
3934 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
3935 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
3936 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
3937 Syntax.read_term_global etc.; see also OldGoals.read_term as last
3938 resort for legacy applications.
3940 * Disposed old declarations, tactics, tactic combinators that refer to
3941 the simpset or claset of an implicit theory (such as Addsimps,
3942 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
3943 embedded ML text, or local_simpset_of with a proper context passed as
3944 explicit runtime argument.
3946 * Rules and tactics that read instantiations (read_instantiate,
3947 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
3948 context, which is required for parsing and type-checking. Moreover,
3949 the variables are specified as plain indexnames, not string encodings
3950 thereof. INCOMPATIBILITY.
3952 * Generic Toplevel.add_hook interface allows to analyze the result of
3953 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
3954 for theorem dependency output of transactions resulting in a new
3957 * ML antiquotations: block-structured compilation context indicated by
3958 \<lbrace> ... \<rbrace>; additional antiquotation forms:
3960 @{binding name} - basic name binding
3961 @{let ?pat = term} - term abbreviation (HO matching)
3962 @{note name = fact} - fact abbreviation
3963 @{thm fact} - singleton fact (with attributes)
3964 @{thms fact} - general fact (with attributes)
3965 @{lemma prop by method} - singleton goal
3966 @{lemma prop by meth1 meth2} - singleton goal
3967 @{lemma prop1 ... propN by method} - general goal
3968 @{lemma prop1 ... propN by meth1 meth2} - general goal
3969 @{lemma (open) ...} - open derivation
3974 * The Isabelle "emacs" tool provides a specific interface to invoke
3975 Proof General / Emacs, with more explicit failure if that is not
3976 installed (the old isabelle-interface script silently falls back on
3977 isabelle-process). The PROOFGENERAL_HOME setting determines the
3978 installation location of the Proof General distribution.
3980 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
3981 the Isabelle process into a JVM/Scala application. See
3982 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
3983 process wrapper has been discontinued.)
3985 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
3987 * Various status messages (with exact source position information) are
3988 emitted, if proper markup print mode is enabled. This allows
3989 user-interface components to provide detailed feedback on internal
3994 New in Isabelle2008 (June 2008)
3995 -------------------------------
3999 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
4000 and updated, with formally checked references as hyperlinks.
4002 * Theory loader: use_thy (and similar operations) no longer set the
4003 implicit ML context, which was occasionally hard to predict and in
4004 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
4005 provides a proper context already.
4007 * Theory loader: old-style ML proof scripts being *attached* to a thy
4008 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
4009 'use' within a theory file will do the job.
4011 * Name space merge now observes canonical order, i.e. the second space
4012 is inserted into the first one, while existing entries in the first
4013 space take precedence. INCOMPATIBILITY in rare situations, may try to
4014 swap theory imports.
4016 * Syntax: symbol \<chi> is now considered a letter. Potential
4017 INCOMPATIBILITY in identifier syntax etc.
4019 * Outer syntax: string tokens no longer admit escaped white space,
4020 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
4021 white space without escapes.
4023 * Outer syntax: string tokens may contain arbitrary character codes
4024 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
4030 * Context-dependent token translations. Default setup reverts locally
4031 fixed variables, and adds hilite markup for undeclared frees.
4033 * Unused theorems can be found using the new command 'unused_thms'.
4034 There are three ways of invoking it:
4037 Only finds unused theorems in the current theory.
4039 (2) unused_thms thy_1 ... thy_n -
4040 Finds unused theorems in the current theory and all of its ancestors,
4041 excluding the theories thy_1 ... thy_n and all of their ancestors.
4043 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
4044 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
4045 their ancestors, excluding the theories thy_1 ... thy_n and all of
4048 In order to increase the readability of the list produced by
4049 unused_thms, theorems that have been created by a particular instance
4050 of a theory command such as 'inductive' or 'function' are considered
4051 to belong to the same "group", meaning that if at least one theorem in
4052 this group is used, the other theorems in the same group are no longer
4053 reported as unused. Moreover, if all theorems in the group are
4054 unused, only one theorem in the group is displayed.
4056 Note that proof objects have to be switched on in order for
4057 unused_thms to work properly (i.e. !proofs must be >= 1, which is
4058 usually the case when using Proof General with the default settings).
4060 * Authentic naming of facts disallows ad-hoc overwriting of previous
4061 theorems within the same name space. INCOMPATIBILITY, need to remove
4062 duplicate fact bindings, or even accidental fact duplications. Note
4063 that tools may maintain dynamically scoped facts systematically, using
4064 PureThy.add_thms_dynamic.
4066 * Command 'hide' now allows to hide from "fact" name space as well.
4068 * Eliminated destructive theorem database, simpset, claset, and
4069 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
4070 update of theories within ML code.
4072 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
4073 INCOMPATIBILITY, object-logics depending on former Pure require
4074 additional setup PureThy.old_appl_syntax_setup; object-logics
4075 depending on former CPure need to refer to Pure.
4077 * Commands 'use' and 'ML' are now purely functional, operating on
4078 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
4079 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
4082 * Command 'setup': discontinued implicit version with ML reference.
4084 * Instantiation target allows for simultaneous specification of class
4085 instance operations together with an instantiation proof.
4086 Type-checking phase allows to refer to class operations uniformly.
4087 See src/HOL/Complex/Complex.thy for an Isar example and
4088 src/HOL/Library/Eval.thy for an ML example.
4090 * Indexing of literal facts: be more serious about including only
4091 facts from the visible specification/proof context, but not the
4092 background context (locale etc.). Affects `prop` notation and method
4093 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
4096 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
4097 "(open)" option, which used to expose internal bound variables to the
4100 * Isar statements: removed obsolete case "rule_context".
4101 INCOMPATIBILITY, better use explicit fixes/assumes.
4103 * Locale proofs: default proof step now includes 'unfold_locales';
4104 hence 'proof' without argument may be used to unfold locale
4108 *** Document preparation ***
4110 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
4111 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
4112 obsolete thumbpdf setup (contemporary PDF viewers do this on the
4113 spot); renamed link color from "darkblue" to "linkcolor" (default
4114 value unchanged, can be redefined via \definecolor); no longer sets
4115 "a4paper" option (unnecessary or even intrusive).
4117 * Antiquotation @{lemma A method} proves proposition A by the given
4118 method (either a method name or a method name plus (optional) method
4119 arguments in parentheses) and prints A just like @{prop A}.
4124 * New primrec package. Specification syntax conforms in style to
4125 definition/function/.... No separate induction rule is provided. The
4126 "primrec" command distinguishes old-style and new-style specifications
4127 by syntax. The former primrec package is now named OldPrimrecPackage.
4128 When adjusting theories, beware: constants stemming from new-style
4129 primrec specifications have authentic syntax.
4131 * Metis prover is now an order of magnitude faster, and also works
4132 with multithreading.
4134 * Metis: the maximum number of clauses that can be produced from a
4135 theorem is now given by the attribute max_clauses. Theorems that
4136 exceed this number are ignored, with a warning printed.
4138 * Sledgehammer no longer produces structured proofs by default. To
4139 enable, declare [[sledgehammer_full = true]]. Attributes
4140 reconstruction_modulus, reconstruction_sorts renamed
4141 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
4143 * Method "induct_scheme" derives user-specified induction rules
4144 from well-founded induction and completeness of patterns. This factors
4145 out some operations that are done internally by the function package
4146 and makes them available separately. See
4147 src/HOL/ex/Induction_Scheme.thy for examples.
4149 * More flexible generation of measure functions for termination
4150 proofs: Measure functions can be declared by proving a rule of the
4151 form "is_measure f" and giving it the [measure_function] attribute.
4152 The "is_measure" predicate is logically meaningless (always true), and
4153 just guides the heuristic. To find suitable measure functions, the
4154 termination prover sets up the goal "is_measure ?f" of the appropriate
4155 type and generates all solutions by prolog-style backwards proof using
4158 This setup also deals with rules like
4160 "is_measure f ==> is_measure (list_size f)"
4162 which accommodates nested datatypes that recurse through lists.
4163 Similar rules are predeclared for products and option types.
4165 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
4169 - Definitions of overloaded constants on sets have to be replaced by
4170 definitions on => and bool.
4172 - Some definitions of overloaded operators on sets can now be proved
4173 using the definitions of the operators on => and bool. Therefore,
4174 the following theorems have been renamed:
4176 subset_def -> subset_eq
4177 psubset_def -> psubset_eq
4178 set_diff_def -> set_diff_eq
4179 Compl_def -> Compl_eq
4180 Sup_set_def -> Sup_set_eq
4181 Inf_set_def -> Inf_set_eq
4182 sup_set_def -> sup_set_eq
4183 inf_set_def -> inf_set_eq
4185 - Due to the incompleteness of the HO unification algorithm, some
4186 rules such as subst may require manual instantiation, if some of
4187 the unknowns in the rule is a set.
4189 - Higher order unification and forward proofs:
4192 have "P (S::'a set)" <...>
4193 then have "EX S. P S" ..
4195 no longer works (due to the incompleteness of the HO unification
4196 algorithm) and must be replaced by the pattern
4203 - Calculational reasoning with subst (or similar rules):
4206 have "P (S::'a set)" <...>
4207 also have "S = T" <...>
4208 finally have "P T" .
4210 no longer works (for similar reasons as the previous example) and
4211 must be replaced by something like
4213 have "P (S::'a set)" <...>
4214 moreover have "S = T" <...>
4215 ultimately have "P T" by simp
4217 - Tactics or packages written in ML code:
4218 Code performing pattern matching on types via
4220 Type ("set", [T]) => ...
4222 must be rewritten. Moreover, functions like strip_type or
4223 binder_types no longer return the right value when applied to a
4226 T1 => ... => Tn => U => bool
4230 T1 => ... => Tn => U set
4232 * Merged theories Wellfounded_Recursion, Accessible_Part and
4233 Wellfounded_Relations to theory Wellfounded.
4235 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
4237 * Class finite no longer treats UNIV as class parameter. Use class
4238 enum from theory Library/Enum instead to achieve a similar effect.
4241 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
4242 and "Cons". INCOMPATIBILITY.
4244 * HOL (and FOL): renamed variables in rules imp_elim and swap.
4245 Potential INCOMPATIBILITY.
4247 * Theory Product_Type: duplicated lemmas split_Pair_apply and
4248 injective_fst_snd removed, use split_eta and prod_eqI instead.
4249 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
4251 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
4252 the same name in theory Orderings:
4262 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
4263 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
4264 and different variable names.
4266 * Library/Option_ord.thy: Canonical order on option type.
4268 * Library/RBT.thy: Red-black trees, an efficient implementation of
4271 * Library/Countable.thy: Type class for countable types.
4273 * Theory Int: The representation of numerals has changed. The infix
4274 operator BIT and the bit datatype with constructors B0 and B1 have
4275 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
4276 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
4277 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
4280 * Theory Nat: definition of <= and < on natural numbers no longer
4281 depend on well-founded relations. INCOMPATIBILITY. Definitions
4282 le_def and less_def have disappeared. Consider lemmas not_less
4283 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
4285 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
4286 (whose purpose mainly is for various fold_set functionals) have been
4287 abandoned in favor of the existing algebraic classes
4288 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
4289 lower_semilattice (resp. upper_semilattice) and linorder.
4292 * Theory Transitive_Closure: induct and cases rules now declare proper
4293 case_names ("base" and "step"). INCOMPATIBILITY.
4295 * Theorem Inductive.lfp_ordinal_induct generalized to complete
4296 lattices. The form set-specific version is available as
4297 Inductive.lfp_ordinal_induct_set.
4299 * Renamed theorems "power.simps" to "power_int.simps".
4302 * Class semiring_div provides basic abstract properties of semirings
4303 with division and modulo operations. Subsumes former class dvd_mod.
4305 * Merged theories IntDef, Numeral and IntArith into unified theory
4306 Int. INCOMPATIBILITY.
4308 * Theory Library/Code_Index: type "index" now represents natural
4309 numbers rather than integers. INCOMPATIBILITY.
4311 * New class "uminus" with operation "uminus" (split of from class
4312 "minus" which now only has operation "minus", binary).
4315 * Constants "card", "internal_split", "option_map" now with authentic
4316 syntax. INCOMPATIBILITY.
4318 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
4319 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
4320 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
4321 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
4322 Sup_set_def, le_def, less_def, option_map_def now with object
4323 equality. INCOMPATIBILITY.
4325 * Records. Removed K_record, and replaced it by pure lambda term
4326 %x. c. The simplifier setup is now more robust against eta expansion.
4327 INCOMPATIBILITY: in cases explicitly referring to K_record.
4329 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
4331 * Library/ListVector: new theory of arithmetic vector operations.
4333 * Library/Order_Relation: new theory of various orderings as sets of
4334 pairs. Defines preorders, partial orders, linear orders and
4335 well-orders on sets and on types.
4340 * Renamed some theories to allow to loading both ZF and HOL in the
4343 Datatype -> Datatype_ZF
4344 Inductive -> Inductive_ZF
4351 INCOMPATIBILITY: ZF theories that import individual theories below
4352 Main might need to be adapted. Regular theory Main is still
4353 available, as trivial extension of Main_ZF.
4358 * ML within Isar: antiquotation @{const name} or @{const
4359 name(typargs)} produces statically-checked Const term.
4361 * Functor NamedThmsFun: data is available to the user as dynamic fact
4362 (of the same name). Removed obsolete print command.
4364 * Removed obsolete "use_legacy_bindings" function.
4366 * The ``print mode'' is now a thread-local value derived from a global
4367 template (the former print_mode reference), thus access becomes
4368 non-critical. The global print_mode reference is for session
4369 management only; user-code should use print_mode_value,
4370 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
4372 * Functions system/system_out provide a robust way to invoke external
4373 shell commands, with propagation of interrupts (requires Poly/ML
4374 5.2.1). Do not use OS.Process.system etc. from the basis library!
4379 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
4380 in accordance with Proof General 3.7, which prefers GNU emacs.
4382 * isatool tty runs Isabelle process with plain tty interaction;
4383 optional line editor may be specified via ISABELLE_LINE_EDITOR
4384 setting, the default settings attempt to locate "ledit" and "rlwrap".
4386 * isatool browser now works with Cygwin as well, using general
4387 "javapath" function defined in Isabelle process environment.
4389 * YXML notation provides a simple and efficient alternative to
4390 standard XML transfer syntax. See src/Pure/General/yxml.ML and
4391 isatool yxml as described in the Isabelle system manual.
4393 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
4394 provides general wrapper for managing an Isabelle process in a robust
4395 fashion, with ``cooked'' output from stdin/stderr.
4397 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
4398 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
4400 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
4401 way of changing the user's settings is via
4402 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
4405 * Multithreading.max_threads := 0 refers to the number of actual CPU
4406 cores of the underlying machine, which is a good starting point for
4407 optimal performance tuning. The corresponding usedir option -M allows
4408 "max" as an alias for "0". WARNING: does not work on certain versions
4409 of Mac OS (with Poly/ML 5.1).
4411 * isabelle-process: non-ML sessions are run with "nice", to reduce the
4412 adverse effect of Isabelle flooding interactive front-ends (notably
4413 ProofGeneral / XEmacs).
4417 New in Isabelle2007 (November 2007)
4418 -----------------------------------
4422 * More uniform information about legacy features, notably a
4423 warning/error of "Legacy feature: ...", depending on the state of the
4424 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
4425 legacy features will disappear eventually.
4427 * Theory syntax: the header format ``theory A = B + C:'' has been
4428 discontinued in favour of ``theory A imports B C begin''. Use isatool
4429 fixheaders to convert existing theory files. INCOMPATIBILITY.
4431 * Theory syntax: the old non-Isar theory file format has been
4432 discontinued altogether. Note that ML proof scripts may still be used
4433 with Isar theories; migration is usually quite simple with the ML
4434 function use_legacy_bindings. INCOMPATIBILITY.
4436 * Theory syntax: some popular names (e.g. 'class', 'declaration',
4437 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
4440 * Theory loader: be more serious about observing the static theory
4441 header specifications (including optional directories), but not the
4442 accidental file locations of previously successful loads. The strict
4443 update policy of former update_thy is now already performed by
4444 use_thy, so the former has been removed; use_thys updates several
4445 theories simultaneously, just as 'imports' within a theory header
4446 specification, but without merging the results. Potential
4447 INCOMPATIBILITY: may need to refine theory headers and commands
4448 ROOT.ML which depend on load order.
4450 * Theory loader: optional support for content-based file
4451 identification, instead of the traditional scheme of full physical
4452 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
4453 (cf. the system manual). The new scheme allows to work with
4454 non-finished theories in persistent session images, such that source
4455 files may be moved later on without requiring reloads.
4457 * Theory loader: old-style ML proof scripts being *attached* to a thy
4458 file (with the same base name as the theory) are considered a legacy
4459 feature, which will disappear eventually. Even now, the theory loader
4460 no longer maintains dependencies on such files.
4462 * Syntax: the scope for resolving ambiguities via type-inference is
4463 now limited to individual terms, instead of whole simultaneous
4464 specifications as before. This greatly reduces the complexity of the
4465 syntax module and improves flexibility by separating parsing and
4466 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
4467 'fixes' etc.) are required in rare situations.
4469 * Syntax: constants introduced by new-style packages ('definition',
4470 'abbreviation' etc.) are passed through the syntax module in
4471 ``authentic mode''. This means that associated mixfix annotations
4472 really stick to such constants, independently of potential name space
4473 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
4474 trees are represented slightly differently, may need to adapt syntax
4475 translations accordingly. Use CONST marker in 'translations' and
4476 @{const_syntax} antiquotation in 'parse_translation' etc.
4478 * Legacy goal package: reduced interface to the bare minimum required
4479 to keep existing proof scripts running. Most other user-level
4480 functions are now part of the OldGoals structure, which is *not* open
4481 by default (consider isatool expandshort before open OldGoals).
4482 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
4483 these tend to cause confusion about the actual goal (!) context being
4484 used here, which is not necessarily the same as the_context().
4486 * Command 'find_theorems': supports "*" wild-card in "name:"
4487 criterion; "with_dups" option. Certain ProofGeneral versions might
4488 support a specific search form (see ProofGeneral/CHANGES).
4490 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
4491 by default, which means that "prems" (and also "fixed variables") are
4492 suppressed from proof state output. Note that the ProofGeneral
4493 settings mechanism allows to change and save options persistently, but
4494 older versions of Isabelle will fail to start up if a negative prems
4497 * Local theory targets may be specified by non-nested blocks of
4498 ``context/locale/class ... begin'' followed by ``end''. The body may
4499 contain definitions, theorems etc., including any derived mechanism
4500 that has been implemented on top of these primitives. This concept
4501 generalizes the existing ``theorem (in ...)'' towards more versatility
4504 * Proof General interface: proper undo of final 'end' command;
4505 discontinued Isabelle/classic mode (ML proof scripts).
4508 *** Document preparation ***
4510 * Added antiquotation @{theory name} which prints the given name,
4511 after checking that it refers to a valid ancestor theory in the
4514 * Added antiquotations @{ML_type text} and @{ML_struct text} which
4515 check the given source text as ML type/structure, printing verbatim.
4517 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
4518 "c args == rhs" given in the current context. (Any number of
4519 arguments may be given on the LHS.)
4524 * The 'class' package offers a combination of axclass and locale to
4525 achieve Haskell-like type classes in Isabelle. Definitions and
4526 theorems within a class context produce both relative results (with
4527 implicit parameters according to the locale context), and polymorphic
4528 constants with qualified polymorphism (according to the class
4529 context). Within the body context of a 'class' target, a separate
4530 syntax layer ("user space type system") takes care of converting
4531 between global polymorphic consts and internal locale representation.
4532 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
4533 "isatool doc classes" provides a tutorial.
4535 * Generic code generator framework allows to generate executable
4536 code for ML and Haskell (including Isabelle classes). A short usage
4539 internal compilation:
4540 export_code <list of constants (term syntax)> in SML
4541 writing SML code to a file:
4542 export_code <list of constants (term syntax)> in SML <filename>
4543 writing OCaml code to a file:
4544 export_code <list of constants (term syntax)> in OCaml <filename>
4545 writing Haskell code to a bunch of files:
4546 export_code <list of constants (term syntax)> in Haskell <filename>
4548 evaluating closed propositions to True/False using code generation:
4551 Reasonable default setup of framework in HOL.
4553 Theorem attributs for selecting and transforming function equations theorems:
4555 [code fun]: select a theorem as function equation for a specific constant
4556 [code fun del]: deselect a theorem as function equation for a specific constant
4557 [code inline]: select an equation theorem for unfolding (inlining) in place
4558 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
4560 User-defined serializations (target in {SML, OCaml, Haskell}):
4562 code_const <and-list of constants (term syntax)>
4563 {(target) <and-list of const target syntax>}+
4565 code_type <and-list of type constructors>
4566 {(target) <and-list of type target syntax>}+
4568 code_instance <and-list of instances>
4570 where instance ::= <type constructor> :: <class>
4572 code_class <and_list of classes>
4573 {(target) <and-list of class target syntax>}+
4574 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
4576 code_instance and code_class only are effective to target Haskell.
4578 For example usage see src/HOL/ex/Codegenerator.thy and
4579 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
4580 generation from Isabelle/HOL theories is available via "isatool doc
4583 * Code generator: consts in 'consts_code' Isar commands are now
4584 referred to by usual term syntax (including optional type
4587 * Command 'no_translations' removes translation rules from theory
4590 * Overloaded definitions are now actually checked for acyclic
4591 dependencies. The overloading scheme is slightly more general than
4592 that of Haskell98, although Isabelle does not demand an exact
4593 correspondence to type class and instance declarations.
4594 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
4595 exotic versions of overloading -- at the discretion of the user!
4597 Polymorphic constants are represented via type arguments, i.e. the
4598 instantiation that matches an instance against the most general
4599 declaration given in the signature. For example, with the declaration
4600 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
4601 as c(nat). Overloading is essentially simultaneous structural
4602 recursion over such type arguments. Incomplete specification patterns
4603 impose global constraints on all occurrences, e.g. c('a * 'a) on the
4604 LHS means that more general c('a * 'b) will be disallowed on any RHS.
4605 Command 'print_theory' outputs the normalized system of recursive
4606 equations, see section "definitions".
4608 * Configuration options are maintained within the theory or proof
4609 context (with name and type bool/int/string), providing a very simple
4610 interface to a poor-man's version of general context data. Tools may
4611 declare options in ML (e.g. using Attrib.config_int) and then refer to
4612 these values using Config.get etc. Users may change options via an
4613 associated attribute of the same name. This form of context
4614 declaration works particularly well with commands 'declare' or
4615 'using', for example ``declare [[foo = 42]]''. Thus it has become
4616 very easy to avoid global references, which would not observe Isar
4617 toplevel undo/redo and fail to work with multithreading.
4619 Various global ML references of Pure and HOL have been turned into
4620 configuration options:
4622 Unify.search_bound unify_search_bound
4623 Unify.trace_bound unify_trace_bound
4624 Unify.trace_simp unify_trace_simp
4625 Unify.trace_types unify_trace_types
4626 Simplifier.simp_depth_limit simp_depth_limit
4627 Blast.depth_limit blast_depth_limit
4628 DatatypeProp.dtK datatype_distinctness_limit
4629 fast_arith_neq_limit fast_arith_neq_limit
4630 fast_arith_split_limit fast_arith_split_limit
4632 * Named collections of theorems may be easily installed as context
4633 data using the functor NamedThmsFun (see also
4634 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
4635 attributes; there is also a toplevel print command. This facility is
4636 just a common case of general context data, which is the preferred way
4637 for anything more complex than just a list of facts in canonical
4640 * Isar: command 'declaration' augments a local theory by generic
4641 declaration functions written in ML. This enables arbitrary content
4642 being added to the context, depending on a morphism that tells the
4643 difference of the original declaration context wrt. the application
4644 context encountered later on.
4646 * Isar: proper interfaces for simplification procedures. Command
4647 'simproc_setup' declares named simprocs (with match patterns, and body
4648 text in ML). Attribute "simproc" adds/deletes simprocs in the current
4649 context. ML antiquotation @{simproc name} retrieves named simprocs.
4651 * Isar: an extra pair of brackets around attribute declarations
4652 abbreviates a theorem reference involving an internal dummy fact,
4653 which will be ignored later --- only the effect of the attribute on
4654 the background context will persist. This form of in-place
4655 declarations is particularly useful with commands like 'declare' and
4656 'using', for example ``have A using [[simproc a]] by simp''.
4658 * Isar: method "assumption" (and implicit closing of subproofs) now
4659 takes simple non-atomic goal assumptions into account: after applying
4660 an assumption as a rule the resulting subgoals are solved by atomic
4661 assumption steps. This is particularly useful to finish 'obtain'
4662 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
4663 without referring to the original premise "!!x. P x ==> thesis" in the
4664 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
4667 * Isar: implicit use of prems from the Isar proof context is
4668 considered a legacy feature. Common applications like ``have A .''
4669 may be replaced by ``have A by fact'' or ``note `A`''. In general,
4670 referencing facts explicitly here improves readability and
4671 maintainability of proof texts.
4673 * Isar: improper proof element 'guess' is like 'obtain', but derives
4674 the obtained context from the course of reasoning! For example:
4676 assume "EX x y. A x & B y" -- "any previous fact"
4677 then guess x and y by clarify
4679 This technique is potentially adventurous, depending on the facts and
4680 proof tools being involved here.
4682 * Isar: known facts from the proof context may be specified as literal
4683 propositions, using ASCII back-quote syntax. This works wherever
4684 named facts used to be allowed so far, in proof commands, proof
4685 methods, attributes etc. Literal facts are retrieved from the context
4686 according to unification of type and term parameters. For example,
4687 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
4688 theorems in the current context, then these are valid literal facts:
4689 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
4691 There is also a proof method "fact" which does the same composition
4692 for explicit goal states, e.g. the following proof texts coincide with
4693 certain special cases of literal facts:
4695 have "A" by fact == note `A`
4696 have "A ==> B" by fact == note `A ==> B`
4697 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
4698 have "P a ==> Q a" by fact == note `P a ==> Q a`
4700 * Isar: ":" (colon) is no longer a symbolic identifier character in
4701 outer syntax. Thus symbolic identifiers may be used without
4702 additional white space in declarations like this: ``assume *: A''.
4704 * Isar: 'print_facts' prints all local facts of the current context,
4705 both named and unnamed ones.
4707 * Isar: 'def' now admits simultaneous definitions, e.g.:
4709 def x == "t" and y == "u"
4711 * Isar: added command 'unfolding', which is structurally similar to
4712 'using', but affects both the goal state and facts by unfolding given
4713 rewrite rules. Thus many occurrences of the 'unfold' method or
4714 'unfolded' attribute may be replaced by first-class proof text.
4716 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
4717 and command 'unfolding' now all support object-level equalities
4718 (potentially conditional). The underlying notion of rewrite rule is
4719 analogous to the 'rule_format' attribute, but *not* that of the
4720 Simplifier (which is usually more generous).
4722 * Isar: the new attribute [rotated n] (default n = 1) rotates the
4723 premises of a theorem by n. Useful in conjunction with drule.
4725 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
4726 method expression within a sandbox consisting of the first N
4727 sub-goals, which need to exist. For example, ``simp_all [3]''
4728 simplifies the first three sub-goals, while (rule foo, simp_all)[]
4729 simplifies all new goals that emerge from applying rule foo to the
4730 originally first one.
4732 * Isar: schematic goals are no longer restricted to higher-order
4733 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
4736 * Isar: the conclusion of a long theorem statement is now either
4737 'shows' (a simultaneous conjunction, as before), or 'obtains'
4738 (essentially a disjunction of cases with local parameters and
4739 assumptions). The latter allows to express general elimination rules
4740 adequately; in this notation common elimination rules look like this:
4742 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
4744 obtains x where "P x"
4746 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
4750 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
4756 The subsequent classical rules even refer to the formal "thesis"
4759 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
4762 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
4763 obtains "thesis ==> something"
4765 The actual proof of an 'obtains' statement is analogous to that of the
4766 Isar proof element 'obtain', only that there may be several cases.
4767 Optional case names may be specified in parentheses; these will be
4768 available both in the present proof and as annotations in the
4769 resulting rule, for later use with the 'cases' method (cf. attribute
4772 * Isar: the assumptions of a long theorem statement are available as
4773 "assms" fact in the proof context. This is more appropriate than the
4774 (historical) "prems", which refers to all assumptions of the current
4775 context, including those from the target locale, proof body etc.
4777 * Isar: 'print_statement' prints theorems from the current theory or
4778 proof context in long statement form, according to the syntax of a
4781 * Isar: 'obtain' takes an optional case name for the local context
4782 introduction rule (default "that").
4784 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
4785 explicit (is "_ ==> ?foo") in the rare cases where this still happens
4788 * Pure: syntax "CONST name" produces a fully internalized constant
4789 according to the current context. This is particularly useful for
4790 syntax translations that should refer to internal constant
4791 representations independently of name spaces.
4793 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
4794 instead of "FOO ". This allows multiple binder declarations to coexist
4795 in the same context. INCOMPATIBILITY.
4797 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
4798 primitive that also works in a locale context (both for constants and
4799 fixed variables). Type declaration and internal syntactic representation
4800 of given constants retrieved from the context. Likewise, the
4801 'no_notation' command allows to remove given syntax annotations from the
4804 * Isar/locales: new derived specification elements 'axiomatization',
4805 'definition', 'abbreviation', which support type-inference, admit
4806 object-level specifications (equality, equivalence). See also the
4807 isar-ref manual. Examples:
4810 eq (infix "===" 50) where
4811 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
4813 definition "f x y = x + y + 1"
4814 definition g where "g x = f x x"
4817 neq (infix "=!=" 50) where
4818 "x =!= y == ~ (x === y)"
4820 These specifications may be also used in a locale context. Then the
4821 constants being introduced depend on certain fixed parameters, and the
4822 constant name is qualified by the locale base name. An internal
4823 abbreviation takes care for convenient input and output, making the
4824 parameters implicit and using the original short name. See also
4825 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
4826 entities from a monomorphic theory.
4828 Presently, abbreviations are only available 'in' a target locale, but
4829 not inherited by general import expressions. Also note that
4830 'abbreviation' may be used as a type-safe replacement for 'syntax' +
4831 'translations' in common applications. The "no_abbrevs" print mode
4832 prevents folding of abbreviations in term output.
4834 Concrete syntax is attached to specified constants in internal form,
4835 independently of name spaces. The parse tree representation is
4836 slightly different -- use 'notation' instead of raw 'syntax', and
4837 'translations' with explicit "CONST" markup to accommodate this.
4839 * Pure/Isar: unified syntax for new-style specification mechanisms
4840 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
4841 full type inference and dummy patterns ("_"). For example:
4843 definition "K x _ = x"
4845 inductive conj for A B
4846 where "A ==> B ==> conj A B"
4848 * Pure: command 'print_abbrevs' prints all constant abbreviations of
4849 the current context. Print mode "no_abbrevs" prevents inversion of
4850 abbreviations on output.
4852 * Isar/locales: improved parameter handling: use of locales "var" and
4853 "struct" no longer necessary; - parameter renamings are no longer
4854 required to be injective. For example, this allows to define
4855 endomorphisms as locale endom = homom mult mult h.
4857 * Isar/locales: changed the way locales with predicates are defined.
4858 Instead of accumulating the specification, the imported expression is
4859 now an interpretation. INCOMPATIBILITY: different normal form of
4860 locale expressions. In particular, in interpretations of locales with
4861 predicates, goals repesenting already interpreted fragments are not
4862 removed automatically. Use methods `intro_locales' and
4863 `unfold_locales'; see below.
4865 * Isar/locales: new methods `intro_locales' and `unfold_locales'
4866 provide backward reasoning on locales predicates. The methods are
4867 aware of interpretations and discharge corresponding goals.
4868 `intro_locales' is less aggressive then `unfold_locales' and does not
4869 unfold predicates to assumptions.
4871 * Isar/locales: the order in which locale fragments are accumulated
4872 has changed. This enables to override declarations from fragments due
4873 to interpretations -- for example, unwanted simp rules.
4875 * Isar/locales: interpretation in theories and proof contexts has been
4876 extended. One may now specify (and prove) equations, which are
4877 unfolded in interpreted theorems. This is useful for replacing
4878 defined concepts (constants depending on locale parameters) by
4879 concepts already existing in the target context. Example:
4881 interpretation partial_order ["op <= :: [int, int] => bool"]
4882 where "partial_order.less (op <=) (x::int) y = (x < y)"
4884 Typically, the constant `partial_order.less' is created by a
4885 definition specification element in the context of locale
4888 * Method "induct": improved internal context management to support
4889 local fixes and defines on-the-fly. Thus explicit meta-level
4890 connectives !! and ==> are rarely required anymore in inductive goals
4891 (using object-logic connectives for this purpose has been long
4892 obsolete anyway). Common proof patterns are explained in
4893 src/HOL/Induct/Common_Patterns.thy, see also
4894 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
4897 * Method "induct": improved handling of simultaneous goals. Instead of
4898 introducing object-level conjunction, the statement is now split into
4899 several conclusions, while the corresponding symbolic cases are nested
4900 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
4901 see src/HOL/Induct/Common_Patterns.thy, for example.
4903 * Method "induct": mutual induction rules are now specified as a list
4904 of rule sharing the same induction cases. HOL packages usually provide
4905 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
4906 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
4907 mutual induction rules differently, i.e. like this:
4909 (induct rule: foo_bar.inducts)
4910 (induct set: foo bar)
4911 (induct pred: foo bar)
4912 (induct type: foo bar)
4914 The ML function ProjectRule.projections turns old-style rules into the
4917 * Method "coinduct": dual of induction, see
4918 src/HOL/Library/Coinductive_List.thy for various examples.
4920 * Method "cases", "induct", "coinduct": the ``(open)'' option is
4921 considered a legacy feature.
4923 * Attribute "symmetric" produces result with standardized schematic
4924 variables (index 0). Potential INCOMPATIBILITY.
4926 * Simplifier: by default the simplifier trace only shows top level
4927 rewrites now. That is, trace_simp_depth_limit is set to 1 by
4928 default. Thus there is less danger of being flooded by the trace. The
4929 trace indicates where parts have been suppressed.
4931 * Provers/classical: removed obsolete classical version of elim_format
4932 attribute; classical elim/dest rules are now treated uniformly when
4933 manipulating the claset.
4935 * Provers/classical: stricter checks to ensure that supplied intro,
4936 dest and elim rules are well-formed; dest and elim rules must have at
4939 * Provers/classical: attributes dest/elim/intro take an optional
4940 weight argument for the rule (just as the Pure versions). Weights are
4941 ignored by automated tools, but determine the search order of single
4944 * Syntax: input syntax now supports dummy variable binding "%_. b",
4945 where the body does not mention the bound variable. Note that dummy
4946 patterns implicitly depend on their context of bounds, which makes
4947 "{_. _}" match any set comprehension as expected. Potential
4948 INCOMPATIBILITY -- parse translations need to cope with syntactic
4949 constant "_idtdummy" in the binding position.
4951 * Syntax: removed obsolete syntactic constant "_K" and its associated
4952 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
4953 for example "A -> B" => "Pi A (%_. B)".
4955 * Pure: 'class_deps' command visualizes the subclass relation, using
4956 the graph browser tool.
4958 * Pure: 'print_theory' now suppresses certain internal declarations by
4959 default; use '!' option for full details.
4964 * Method "metis" proves goals by applying the Metis general-purpose
4965 resolution prover (see also http://gilith.com/software/metis/).
4966 Examples are in the directory MetisExamples. WARNING: the
4967 Isabelle/HOL-Metis integration does not yet work properly with
4970 * Command 'sledgehammer' invokes external automatic theorem provers as
4971 background processes. It generates calls to the "metis" method if
4972 successful. These can be pasted into the proof. Users do not have to
4973 wait for the automatic provers to return. WARNING: does not really
4974 work with multi-threading.
4976 * New "auto_quickcheck" feature tests outermost goal statements for
4977 potential counter-examples. Controlled by ML references
4978 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
4979 5000 milliseconds). Fails silently if statements is outside of
4980 executable fragment, or any other codgenerator problem occurs.
4982 * New constant "undefined" with axiom "undefined x = undefined".
4984 * Added class "HOL.eq", allowing for code generation with polymorphic
4987 * Some renaming of class constants due to canonical name prefixing in
4988 the new 'class' package:
4990 HOL.abs ~> HOL.abs_class.abs
4991 HOL.divide ~> HOL.divide_class.divide
4992 0 ~> HOL.zero_class.zero
4993 1 ~> HOL.one_class.one
4994 op + ~> HOL.plus_class.plus
4995 op - ~> HOL.minus_class.minus
4996 uminus ~> HOL.minus_class.uminus
4997 op * ~> HOL.times_class.times
4998 op < ~> HOL.ord_class.less
4999 op <= > HOL.ord_class.less_eq
5000 Nat.power ~> Power.power_class.power
5001 Nat.size ~> Nat.size_class.size
5002 Numeral.number_of ~> Numeral.number_class.number_of
5003 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
5004 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
5005 Orderings.min ~> Orderings.ord_class.min
5006 Orderings.max ~> Orderings.ord_class.max
5007 Divides.op div ~> Divides.div_class.div
5008 Divides.op mod ~> Divides.div_class.mod
5009 Divides.op dvd ~> Divides.div_class.dvd
5011 INCOMPATIBILITY. Adaptions may be required in the following cases:
5013 a) User-defined constants using any of the names "plus", "minus",
5014 "times", "less" or "less_eq". The standard syntax translations for
5015 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
5018 b) Variables named "plus", "minus", "times", "less", "less_eq"
5019 INCOMPATIBILITY: use more specific names.
5021 c) Permutative equations (e.g. "a + b = b + a")
5022 Since the change of names also changes the order of terms, permutative
5023 rewrite rules may get applied in a different order. Experience shows
5024 that this is rarely the case (only two adaptions in the whole Isabelle
5025 distribution). INCOMPATIBILITY: rewrite proofs
5027 d) ML code directly refering to constant names
5028 This in general only affects hand-written proof tactics, simprocs and
5029 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
5030 Consider using @{const_name} antiquotation.
5032 * New class "default" with associated constant "default".
5034 * Function "sgn" is now overloaded and available on int, real, complex
5035 (and other numeric types), using class "sgn". Two possible defs of
5036 sgn are given as equational assumptions in the classes sgn_if and
5037 sgn_div_norm; ordered_idom now also inherits from sgn_if.
5040 * Locale "partial_order" now unified with class "order" (cf. theory
5041 Orderings), added parameter "less". INCOMPATIBILITY.
5043 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
5044 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
5045 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
5047 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
5048 changed order of proof goals in instance proofs.
5050 * The transitivity reasoner for partial and linear orders is set up
5051 for classes "order" and "linorder". Instances of the reasoner are available
5052 in all contexts importing or interpreting the corresponding locales.
5053 Method "order" invokes the reasoner separately; the reasoner
5054 is also integrated with the Simplifier as a solver. Diagnostic
5055 command 'print_orders' shows the available instances of the reasoner
5056 in the current context.
5058 * Localized monotonicity predicate in theory "Orderings"; integrated
5059 lemmas max_of_mono and min_of_mono with this predicate.
5062 * Formulation of theorem "dense" changed slightly due to integration
5063 with new class dense_linear_order.
5065 * Uniform lattice theory development in HOL.
5067 constants "meet" and "join" now named "inf" and "sup"
5068 constant "Meet" now named "Inf"
5070 classes "meet_semilorder" and "join_semilorder" now named
5071 "lower_semilattice" and "upper_semilattice"
5072 class "lorder" now named "lattice"
5073 class "comp_lat" now named "complete_lattice"
5075 Instantiation of lattice classes allows explicit definitions
5076 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
5078 INCOMPATIBILITY. Theorem renames:
5080 meet_left_le ~> inf_le1
5081 meet_right_le ~> inf_le2
5082 join_left_le ~> sup_ge1
5083 join_right_le ~> sup_ge2
5084 meet_join_le ~> inf_sup_ord
5087 le_meet ~> le_inf_iff
5088 le_join ~> ge_sup_conv
5089 meet_idempotent ~> inf_idem
5090 join_idempotent ~> sup_idem
5091 meet_comm ~> inf_commute
5092 join_comm ~> sup_commute
5093 meet_leI1 ~> le_infI1
5094 meet_leI2 ~> le_infI2
5095 le_joinI1 ~> le_supI1
5096 le_joinI2 ~> le_supI2
5097 meet_assoc ~> inf_assoc
5098 join_assoc ~> sup_assoc
5099 meet_left_comm ~> inf_left_commute
5100 meet_left_idempotent ~> inf_left_idem
5101 join_left_comm ~> sup_left_commute
5102 join_left_idempotent ~> sup_left_idem
5105 le_def_meet ~> le_iff_inf
5106 le_def_join ~> le_iff_sup
5107 join_absorp2 ~> sup_absorb2
5108 join_absorp1 ~> sup_absorb1
5109 meet_absorp1 ~> inf_absorb1
5110 meet_absorp2 ~> inf_absorb2
5111 meet_join_absorp ~> inf_sup_absorb
5112 join_meet_absorp ~> sup_inf_absorb
5113 distrib_join_le ~> distrib_sup_le
5114 distrib_meet_le ~> distrib_inf_le
5116 add_meet_distrib_left ~> add_inf_distrib_left
5117 add_join_distrib_left ~> add_sup_distrib_left
5118 is_join_neg_meet ~> is_join_neg_inf
5119 is_meet_neg_join ~> is_meet_neg_sup
5120 add_meet_distrib_right ~> add_inf_distrib_right
5121 add_join_distrib_right ~> add_sup_distrib_right
5122 add_meet_join_distribs ~> add_sup_inf_distribs
5123 join_eq_neg_meet ~> sup_eq_neg_inf
5124 meet_eq_neg_join ~> inf_eq_neg_sup
5125 add_eq_meet_join ~> add_eq_inf_sup
5126 meet_0_imp_0 ~> inf_0_imp_0
5127 join_0_imp_0 ~> sup_0_imp_0
5128 meet_0_eq_0 ~> inf_0_eq_0
5129 join_0_eq_0 ~> sup_0_eq_0
5130 neg_meet_eq_join ~> neg_inf_eq_sup
5131 neg_join_eq_meet ~> neg_sup_eq_inf
5132 join_eq_if ~> sup_eq_if
5134 mono_meet ~> mono_inf
5135 mono_join ~> mono_sup
5136 meet_bool_eq ~> inf_bool_eq
5137 join_bool_eq ~> sup_bool_eq
5138 meet_fun_eq ~> inf_fun_eq
5139 join_fun_eq ~> sup_fun_eq
5140 meet_set_eq ~> inf_set_eq
5141 join_set_eq ~> sup_set_eq
5142 meet1_iff ~> inf1_iff
5143 meet2_iff ~> inf2_iff
5152 join1_iff ~> sup1_iff
5153 join2_iff ~> sup2_iff
5163 is_meet_Meet ~> is_meet_Inf
5164 Meet_bool_def ~> Inf_bool_def
5165 Meet_fun_def ~> Inf_fun_def
5166 Meet_greatest ~> Inf_greatest
5167 Meet_lower ~> Inf_lower
5168 Meet_set_def ~> Inf_set_def
5171 Sup_bool_eq ~> Sup_bool_def
5172 Sup_fun_eq ~> Sup_fun_def
5173 Sup_set_eq ~> Sup_set_def
5175 listsp_meetI ~> listsp_infI
5176 listsp_meet_eq ~> listsp_inf_eq
5181 * Added syntactic class "size"; overloaded constant "size" now has
5182 type "'a::size ==> bool"
5184 * Internal reorganisation of `size' of datatypes: size theorems
5185 "foo.size" are no longer subsumed by "foo.simps" (but are still
5186 simplification rules by default!); theorems "prod.size" now named
5189 * Class "div" now inherits from class "times" rather than "type".
5192 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
5193 Linorder etc. have disappeared; operations defined in terms of
5194 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
5196 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
5198 * HOL-Word: New extensive library and type for generic, fixed size
5199 machine words, with arithemtic, bit-wise, shifting and rotating
5200 operations, reflection into int, nat, and bool lists, automation for
5201 linear arithmetic (by automatic reflection into nat or int), including
5202 lemmas on overflow and monotonicity. Instantiated to all appropriate
5203 arithmetic type classes, supporting automatic simplification of
5204 numerals on all operations.
5206 * Library/Boolean_Algebra: locales for abstract boolean algebras.
5208 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
5210 * Code generator library theories:
5211 - Code_Integer represents HOL integers by big integer literals in target
5213 - Code_Char represents HOL characters by character literals in target
5215 - Code_Char_chr like Code_Char, but also offers treatment of character
5216 codes; includes Code_Integer.
5217 - Executable_Set allows to generate code for finite sets using lists.
5218 - Executable_Rat implements rational numbers as triples (sign, enumerator,
5220 - Executable_Real implements a subset of real numbers, namly those
5221 representable by rational numbers.
5222 - Efficient_Nat implements natural numbers by integers, which in general will
5223 result in higher efficency; pattern matching with 0/Suc is eliminated;
5224 includes Code_Integer.
5225 - Code_Index provides an additional datatype index which is mapped to
5226 target-language built-in integers.
5227 - Code_Message provides an additional datatype message_string which is isomorphic to
5228 strings; messages are mapped to target-language strings.
5230 * New package for inductive predicates
5232 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
5235 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5236 for z_1 :: U_1 and ... and z_n :: U_m
5238 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5241 with full support for type-inference, rather than
5243 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5245 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5246 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5248 inductive "s z_1 ... z_m"
5250 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5253 For backward compatibility, there is a wrapper allowing inductive
5254 sets to be defined with the new package via
5257 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5258 for z_1 :: U_1 and ... and z_n :: U_m
5260 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5266 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5267 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5268 for z_1 :: U_1 and ... and z_n :: U_m
5270 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5271 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5274 if the additional syntax "p ..." is required.
5276 Numerous examples can be found in the subdirectories src/HOL/Auth,
5277 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
5281 - Since declaration and definition of inductive sets or predicates
5282 is no longer separated, abbreviations involving the newly
5283 introduced sets or predicates must be specified together with the
5284 introduction rules after the 'where' keyword (see above), rather
5285 than before the actual inductive definition.
5287 - The variables in induction and elimination rules are now
5288 quantified in the order of their occurrence in the introduction
5289 rules, rather than in alphabetical order. Since this may break
5290 some proofs, these proofs either have to be repaired, e.g. by
5291 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
5292 statements of the form
5294 case (rule_i a_i_1 ... a_i_{k_i})
5296 or the old order of quantification has to be restored by explicitly adding
5297 meta-level quantifiers in the introduction rules, i.e.
5299 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
5301 - The format of the elimination rules is now
5303 p z_1 ... z_m x_1 ... x_n ==>
5304 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5309 (x_1, ..., x_n) : s z_1 ... z_m ==>
5310 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5313 for sets rather than
5315 x : s z_1 ... z_m ==>
5316 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
5319 This may require terms in goals to be expanded to n-tuples
5320 (e.g. using case_tac or simplification with the split_paired_all
5321 rule) before the above elimination rule is applicable.
5323 - The elimination or case analysis rules for (mutually) inductive
5324 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
5325 list of rules "p_1_..._p_k.elims" is no longer available.
5327 * New package "function"/"fun" for general recursive functions,
5328 supporting mutual and nested recursion, definitions in local contexts,
5329 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
5330 for small examples, and the separate tutorial on the function
5331 package. The old recdef "package" is still available as before, but
5332 users are encouraged to use the new package.
5334 * Method "lexicographic_order" automatically synthesizes termination
5335 relations as lexicographic combinations of size measures.
5337 * Case-expressions allow arbitrary constructor-patterns (including
5338 "_") and take their order into account, like in functional
5339 programming. Internally, this is translated into nested
5340 case-expressions; missing cases are added and mapped to the predefined
5341 constant "undefined". In complicated cases printing may no longer show
5342 the original input but the internal form. Lambda-abstractions allow
5343 the same form of pattern matching: "% pat1 => e1 | ..." is an
5344 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
5347 * IntDef: The constant "int :: nat => int" has been removed; now "int"
5348 is an abbreviation for "of_nat :: nat => int". The simplification
5349 rules for "of_nat" have been changed to work like "int" did
5350 previously. Potential INCOMPATIBILITY:
5351 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
5352 - of_nat_diff and of_nat_mult are no longer default simp rules
5354 * Method "algebra" solves polynomial equations over (semi)rings using
5355 Groebner bases. The (semi)ring structure is defined by locales and the
5356 tool setup depends on that generic context. Installing the method for
5357 a specific type involves instantiating the locale and possibly adding
5358 declarations for computation on the coefficients. The method is
5359 already instantiated for natural numbers and for the axiomatic class
5360 of idoms with numerals. See also the paper by Chaieb and Wenzel at
5361 CALCULEMUS 2007 for the general principles underlying this
5362 architecture of context-aware proof-tools.
5364 * Method "ferrack" implements quantifier elimination over
5365 special-purpose dense linear orders using locales (analogous to
5366 "algebra"). The method is already installed for class
5367 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
5370 * Former constant "List.op @" now named "List.append". Use ML
5371 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
5372 circumvent possible incompatibilities when working on ML level.
5374 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
5376 * New function listsum :: 'a list => 'a for arbitrary monoids.
5377 Special syntax: "SUM x <- xs. f x" (and latex variants)
5379 * New syntax for Haskell-like list comprehension (input only), eg.
5380 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
5382 * The special syntax for function "filter" has changed from [x :
5383 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
5384 comprehension syntax, and for uniformity. INCOMPATIBILITY.
5386 * [a..b] is now defined for arbitrary linear orders. It used to be
5387 defined on nat only, as an abbreviation for [a..<Suc b]
5390 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
5392 * New functions "sorted" and "sort" in src/HOL/List.thy.
5394 * New lemma collection field_simps (an extension of ring_simps) for
5395 manipulating (in)equations involving division. Multiplies with all
5396 denominators that can be proved to be non-zero (in equations) or
5397 positive/negative (in inequations).
5399 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
5400 have been improved and renamed to ring_simps, group_simps and
5401 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
5402 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
5404 * Theory Library/Commutative_Ring: switched from recdef to function
5405 package; constants add, mul, pow now curried. Infix syntax for
5406 algebraic operations.
5408 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
5411 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
5414 * HOL/records: generalised field-update to take a function on the
5415 field rather than the new value: r(|A := x|) is translated to A_update
5416 (K x) r The K-combinator that is internally used is called K_record.
5417 INCOMPATIBILITY: Usage of the plain update functions has to be
5420 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
5421 * x = 0, which are required for a semiring. Richer structures do not
5422 inherit from semiring_0 anymore, because this property is a theorem
5423 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
5424 there is more to prove, but this is mostly trivial.
5426 * Class "recpower" is generalized to arbitrary monoids, not just
5427 commutative semirings. INCOMPATIBILITY: may need to incorporate
5428 commutativity or semiring properties additionally.
5430 * Constant "List.list_all2" in List.thy now uses authentic syntax.
5431 INCOMPATIBILITY: translations containing list_all2 may go wrong,
5432 better use 'abbreviation'.
5434 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
5436 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
5437 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
5438 significant changes for setting up numeral syntax for types:
5439 - New constants Numeral.pred and Numeral.succ instead
5440 of former Numeral.bin_pred and Numeral.bin_succ.
5441 - Use integer operations instead of bin_add, bin_mult and so on.
5442 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
5443 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
5445 See src/HOL/Integ/IntArith.thy for an example setup.
5447 * Command 'normal_form' computes the normal form of a term that may
5448 contain free variables. For example ``normal_form "rev [a, b, c]"''
5449 produces ``[b, c, a]'' (without proof). This command is suitable for
5450 heavy-duty computations because the functions are compiled to ML
5451 first. Correspondingly, a method "normalization" is provided. See
5452 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
5454 * Alternative iff syntax "A <-> B" for equality on bool (with priority
5455 25 like -->); output depends on the "iff" print_mode, the default is
5456 "A = B" (with priority 50).
5458 * Relations less (<) and less_eq (<=) are also available on type bool.
5459 Modified syntax to disallow nesting without explicit parentheses,
5460 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
5463 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
5465 * Relation composition operator "op O" now has precedence 75 and binds
5466 stronger than union and intersection. INCOMPATIBILITY.
5468 * The old set interval syntax "{m..n(}" (and relatives) has been
5469 removed. Use "{m..<n}" (and relatives) instead.
5471 * In the context of the assumption "~(s = t)" the Simplifier rewrites
5472 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
5473 ``declare [[simproc del: neq]]''.
5475 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
5478 * Theorem Cons_eq_map_conv no longer declared as "simp".
5480 * Theorem setsum_mult renamed to setsum_right_distrib.
5482 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
5485 * Reimplemented methods "sat" and "satx", with several improvements:
5486 goals no longer need to be stated as "<prems> ==> False", equivalences
5487 (i.e. "=" on type bool) are handled, variable names of the form
5488 "lit_<n>" are no longer reserved, significant speedup.
5490 * Methods "sat" and "satx" can now replay MiniSat proof traces.
5491 zChaff is still supported as well.
5493 * 'inductive' and 'datatype': provide projections of mutual rules,
5494 bundled as foo_bar.inducts;
5496 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
5499 * Library: moved theory Accessible_Part to main HOL.
5501 * Library: added theory Coinductive_List of potentially infinite lists
5502 as greatest fixed-point.
5504 * Library: added theory AssocList which implements (finite) maps as
5507 * Method "evaluation" solves goals (i.e. a boolean expression)
5508 efficiently by compiling it to ML. The goal is "proved" (via an
5509 oracle) if it evaluates to True.
5511 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
5512 also when invoked by the simplifier. This results in the Simplifier
5513 being more powerful on arithmetic goals. INCOMPATIBILITY.
5514 Configuration option fast_arith_split_limit=0 recovers the old
5517 * Support for hex (0x20) and binary (0b1001) numerals.
5519 * New method: reify eqs (t), where eqs are equations for an
5520 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
5521 parameter, computes a term s::'b and a list xs::'a list and proves the
5522 theorem I xs s = t. This is also known as reification or quoting. The
5523 resulting theorem is applied to the subgoal to substitute t with I xs
5524 s. If t is omitted, the subgoal itself is reified.
5526 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
5527 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
5528 where f is supposed to be a computable function (in the sense of code
5529 generattion). The method uses reify to compute s and xs as above then
5530 applies corr_thm and uses normalization by evaluation to "prove" f s =
5531 r and finally gets the theorem t = r, which is again applied to the
5532 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
5534 * Reflection: Automatic reification now handels binding, an example is
5535 available in src/HOL/ex/ReflectionEx.thy
5537 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
5538 command 'statespace' that is similar to 'record', but introduces an
5539 abstract specification based on the locale infrastructure instead of
5540 HOL types. This leads to extra flexibility in composing state spaces,
5541 in particular multiple inheritance and renaming of components.
5546 * Hyperreal: Functions root and sqrt are now defined on negative real
5547 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
5548 Nonnegativity side conditions have been removed from many lemmas, so
5549 that more subgoals may now be solved by simplification; potential
5552 * Real: new type classes formalize real normed vector spaces and
5553 algebras, using new overloaded constants scaleR :: real => 'a => 'a
5554 and norm :: 'a => real.
5556 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
5557 reals into other types. The overloaded constant Reals :: 'a set is now
5558 defined as range of_real; potential INCOMPATIBILITY.
5560 * Real: proper support for ML code generation, including 'quickcheck'.
5561 Reals are implemented as arbitrary precision rationals.
5563 * Hyperreal: Several constants that previously worked only for the
5564 reals have been generalized, so they now work over arbitrary vector
5565 spaces. Type annotations may need to be added in some cases; potential
5568 Infinitesimal :: ('a::real_normed_vector) star set
5569 HFinite :: ('a::real_normed_vector) star set
5570 HInfinite :: ('a::real_normed_vector) star set
5571 approx :: ('a::real_normed_vector) star => 'a star => bool
5572 monad :: ('a::real_normed_vector) star => 'a star set
5573 galaxy :: ('a::real_normed_vector) star => 'a star set
5574 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
5575 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
5576 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
5577 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
5578 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
5579 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
5580 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
5581 sgn :: 'a::real_normed_vector => 'a
5582 exp :: 'a::{recpower,real_normed_field,banach} => 'a
5584 * Complex: Some complex-specific constants are now abbreviations for
5585 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
5586 hnorm. Other constants have been entirely removed in favor of the
5587 polymorphic versions (INCOMPATIBILITY):
5591 HInfinite <-- CInfinite
5592 Infinitesimal <-- CInfinitesimal
5595 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
5596 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
5597 (ns)deriv <-- (ns)cderiv
5602 * Formalisation of ideals and the quotient construction over rings.
5604 * Order and lattice theory no longer based on records.
5607 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
5608 greatest_closed. INCOMPATIBILITY.
5610 * Method algebra is now set up via an attribute. For examples see
5611 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
5612 of algebraic structures.
5614 * Renamed theory CRing to Ring.
5619 * Substantial, yet incomplete support for nominal datatypes (binding
5620 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
5621 src/HOL/Nominal/Examples. Prospective users should consult
5622 http://isabelle.in.tum.de/nominal/
5627 * ML basics: just one true type int, which coincides with IntInf.int
5630 * ML within Isar: antiquotations allow to embed statically-checked
5631 formal entities in the source, referring to the context available at
5632 compile-time. For example:
5634 ML {* @{sort "{zero,one}"} *}
5635 ML {* @{typ "'a => 'b"} *}
5636 ML {* @{term "%x. x"} *}
5637 ML {* @{prop "x == y"} *}
5638 ML {* @{ctyp "'a => 'b"} *}
5639 ML {* @{cterm "%x. x"} *}
5640 ML {* @{cprop "x == y"} *}
5641 ML {* @{thm asm_rl} *}
5642 ML {* @{thms asm_rl} *}
5643 ML {* @{type_name c} *}
5644 ML {* @{type_syntax c} *}
5645 ML {* @{const_name c} *}
5646 ML {* @{const_syntax c} *}
5649 ML {* @{theory Pure} *}
5650 ML {* @{theory_ref} *}
5651 ML {* @{theory_ref Pure} *}
5654 ML {* @{clasimpset} *}
5656 The same works for sources being ``used'' within an Isar context.
5658 * ML in Isar: improved error reporting; extra verbosity with
5659 ML_Context.trace enabled.
5661 * Pure/General/table.ML: the join operations now works via exceptions
5662 DUP/SAME instead of type option. This is simpler in simple cases, and
5663 admits slightly more efficient complex applications.
5665 * Pure: 'advanced' translation functions (parse_translation etc.) now
5666 use Context.generic instead of just theory.
5668 * Pure: datatype Context.generic joins theory/Proof.context and
5669 provides some facilities for code that works in either kind of
5670 context, notably GenericDataFun for uniform theory and proof data.
5672 * Pure: simplified internal attribute type, which is now always
5673 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
5674 local (Proof.context) attributes have been discontinued, while
5675 minimizing code duplication. Thm.rule_attribute and
5676 Thm.declaration_attribute build canonical attributes; see also structure
5677 Context for further operations on Context.generic, notably
5678 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
5679 declarations and definitions.
5681 * Context data interfaces (Theory/Proof/GenericDataFun): removed
5682 name/print, uninitialized data defaults to ad-hoc copy of empty value,
5683 init only required for impure data. INCOMPATIBILITY: empty really need
5684 to be empty (no dependencies on theory content!)
5686 * Pure/kernel: consts certification ignores sort constraints given in
5687 signature declarations. (This information is not relevant to the
5688 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
5689 potential INCOMPATIBILITY.
5691 * Pure: axiomatic type classes are now purely definitional, with
5692 explicit proofs of class axioms and super class relations performed
5693 internally. See Pure/axclass.ML for the main internal interfaces --
5694 notably AxClass.define_class supercedes AxClass.add_axclass, and
5695 AxClass.axiomatize_class/classrel/arity supersede
5696 Sign.add_classes/classrel/arities.
5698 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
5699 global/local versions on theory vs. Proof.context have been
5700 discontinued; Attrib.syntax and Method.syntax have been adapted
5701 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
5702 attributes, methods, etc.
5704 * Pure: several functions of signature "... -> theory -> theory * ..."
5705 have been reoriented to "... -> theory -> ... * theory" in order to
5706 allow natural usage in combination with the ||>, ||>>, |-> and
5707 fold_map combinators.
5709 * Pure: official theorem names (closed derivations) and additional
5710 comments (tags) are now strictly separate. Name hints -- which are
5711 maintained as tags -- may be attached any time without affecting the
5714 * Pure: primitive rule lift_rule now takes goal cterm instead of an
5715 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
5716 achieve the old behaviour.
5718 * Pure: the "Goal" constant is now called "prop", supporting a
5719 slightly more general idea of ``protecting'' meta-level rule
5722 * Pure: Logic.(un)varify only works in a global context, which is now
5723 enforced instead of silently assumed. INCOMPATIBILITY, may use
5724 Logic.legacy_(un)varify as temporary workaround.
5726 * Pure: structure Name provides scalable operations for generating
5727 internal variable names, notably Name.variants etc. This replaces
5728 some popular functions from term.ML:
5730 Term.variant -> Name.variant
5731 Term.variantlist -> Name.variant_list
5732 Term.invent_names -> Name.invent_list
5734 Note that low-level renaming rarely occurs in new code -- operations
5735 from structure Variable are used instead (see below).
5737 * Pure: structure Variable provides fundamental operations for proper
5738 treatment of fixed/schematic variables in a context. For example,
5739 Variable.import introduces fixes for schematics of given facts and
5740 Variable.export reverses the effect (up to renaming) -- this replaces
5741 various freeze_thaw operations.
5743 * Pure: structure Goal provides simple interfaces for
5744 init/conclude/finish and tactical prove operations (replacing former
5745 Tactic.prove). Goal.prove is the canonical way to prove results
5746 within a given context; Goal.prove_global is a degraded version for
5747 theory level goals, including a global Drule.standard. Note that
5748 OldGoals.prove_goalw_cterm has long been obsolete, since it is
5749 ill-behaved in a local proof context (e.g. with local fixes/assumes or
5750 in a locale context).
5752 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
5753 and type checking (Syntax.check_term etc.), with common combinations
5754 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
5755 which are considered legacy and await removal.
5757 * Pure/Syntax: generic interfaces for type unchecking
5758 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
5759 with common combinations (Syntax.pretty_term, Syntax.string_of_term
5760 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
5761 available for convenience, but refer to the very same operations using
5762 a mere theory instead of a full context.
5764 * Isar: simplified treatment of user-level errors, using exception
5765 ERROR of string uniformly. Function error now merely raises ERROR,
5766 without any side effect on output channels. The Isar toplevel takes
5767 care of proper display of ERROR exceptions. ML code may use plain
5768 handle/can/try; cat_error may be used to concatenate errors like this:
5770 ... handle ERROR msg => cat_error msg "..."
5772 Toplevel ML code (run directly or through the Isar toplevel) may be
5773 embedded into the Isar toplevel with exception display/debug like
5776 Isar.toplevel (fn () => ...)
5778 INCOMPATIBILITY, removed special transform_error facilities, removed
5779 obsolete variants of user-level exceptions (ERROR_MESSAGE,
5780 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
5781 -- use plain ERROR instead.
5783 * Isar: theory setup now has type (theory -> theory), instead of a
5784 list. INCOMPATIBILITY, may use #> to compose setup functions.
5786 * Isar: ML toplevel pretty printer for type Proof.context, subject to
5787 ProofContext.debug/verbose flags.
5789 * Isar: Toplevel.theory_to_proof admits transactions that modify the
5790 theory before entering a proof state. Transactions now always see a
5791 quasi-functional intermediate checkpoint, both in interactive and
5794 * Isar: simplified interfaces for outer syntax. Renamed
5795 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
5796 OuterSyntax.add_parsers -- this functionality is now included in
5797 OuterSyntax.command etc. INCOMPATIBILITY.
5799 * Simplifier: the simpset of a running simplification process now
5800 contains a proof context (cf. Simplifier.the_context), which is the
5801 very context that the initial simpset has been retrieved from (by
5802 simpset_of/local_simpset_of). Consequently, all plug-in components
5803 (solver, looper etc.) may depend on arbitrary proof data.
5805 * Simplifier.inherit_context inherits the proof context (plus the
5806 local bounds) of the current simplification process; any simproc
5807 etc. that calls the Simplifier recursively should do this! Removed
5808 former Simplifier.inherit_bounds, which is already included here --
5809 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
5810 specify an explicit context using Simplifier.context/theory_context.
5812 * Simplifier/Classical Reasoner: more abstract interfaces
5813 change_simpset/claset for modifying the simpset/claset reference of a
5814 theory; raw versions simpset/claset_ref etc. have been discontinued --
5817 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
5823 * settings: the default heap location within ISABELLE_HOME_USER now
5824 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
5825 Isabelle installations.
5827 * isabelle-process: option -S (secure mode) disables some critical
5828 operations, notably runtime compilation and evaluation of ML source
5831 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
5833 * Support for parallel execution, using native multicore support of
5834 Poly/ML 5.1. The theory loader exploits parallelism when processing
5835 independent theories, according to the given theory header
5836 specifications. The maximum number of worker threads is specified via
5837 usedir option -M or the "max-threads" setting in Proof General. A
5838 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
5839 to 6 on a 8-core machine. User-code needs to observe certain
5840 guidelines for thread-safe programming, see appendix A in the Isar
5841 Implementation manual.
5845 New in Isabelle2005 (October 2005)
5846 ----------------------------------
5850 * Theory headers: the new header syntax for Isar theories is
5853 imports <theory1> ... <theoryN>
5854 uses <file1> ... <fileM>
5857 where the 'uses' part is optional. The previous syntax
5859 theory <name> = <theory1> + ... + <theoryN>:
5861 will disappear in the next release. Use isatool fixheaders to convert
5862 existing theory files. Note that there is no change in ancient
5863 non-Isar theories now, but these will disappear soon.
5865 * Theory loader: parent theories can now also be referred to via
5866 relative and absolute paths.
5868 * Command 'find_theorems' searches for a list of criteria instead of a
5869 list of constants. Known criteria are: intro, elim, dest, name:string,
5870 simp:term, and any term. Criteria can be preceded by '-' to select
5871 theorems that do not match. Intro, elim, dest select theorems that
5872 match the current goal, name:s selects theorems whose fully qualified
5873 name contain s, and simp:term selects all simplification rules whose
5874 lhs match term. Any other term is interpreted as pattern and selects
5875 all theorems matching the pattern. Available in ProofGeneral under
5876 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
5878 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
5880 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
5881 matching the current goal as introduction rule and not having "HOL."
5882 in their name (i.e. not being defined in theory HOL).
5884 * Command 'thms_containing' has been discontinued in favour of
5885 'find_theorems'; INCOMPATIBILITY.
5887 * Communication with Proof General is now 8bit clean, which means that
5888 Unicode text in UTF-8 encoding may be used within theory texts (both
5889 formal and informal parts). Cf. option -U of the Isabelle Proof
5890 General interface. Here are some simple examples (cf. src/HOL/ex):
5892 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
5893 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
5895 * Improved efficiency of the Simplifier and, to a lesser degree, the
5896 Classical Reasoner. Typical big applications run around 2 times
5900 *** Document preparation ***
5902 * Commands 'display_drafts' and 'print_drafts' perform simple output
5903 of raw sources. Only those symbols that do not require additional
5904 LaTeX packages (depending on comments in isabellesym.sty) are
5905 displayed properly, everything else is left verbatim. isatool display
5906 and isatool print are used as front ends (these are subject to the
5907 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
5909 * Command tags control specific markup of certain regions of text,
5910 notably folding and hiding. Predefined tags include "theory" (for
5911 theory begin and end), "proof" for proof commands, and "ML" for
5912 commands involving ML code; the additional tags "visible" and
5913 "invisible" are unused by default. Users may give explicit tag
5914 specifications in the text, e.g. ''by %invisible (auto)''. The
5915 interpretation of tags is determined by the LaTeX job during document
5916 preparation: see option -V of isatool usedir, or options -n and -t of
5917 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
5920 Several document versions may be produced at the same time via isatool
5921 usedir (the generated index.html will link all of them). Typical
5922 specifications include ''-V document=theory,proof,ML'' to present
5923 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
5924 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
5925 these parts without any formal replacement text. The Isabelle site
5926 default settings produce ''document'' and ''outline'' versions as
5929 * Several new antiquotations:
5931 @{term_type term} prints a term with its type annotated;
5933 @{typeof term} prints the type of a term;
5935 @{const const} is the same as @{term const}, but checks that the
5936 argument is a known logical constant;
5938 @{term_style style term} and @{thm_style style thm} print a term or
5939 theorem applying a "style" to it
5943 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
5944 definitions, equations, inequations etc., 'concl' printing only the
5945 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
5946 to print the specified premise. TermStyle.add_style provides an ML
5947 interface for introducing further styles. See also the "LaTeX Sugar"
5948 document practical applications. The ML antiquotation prints
5949 type-checked ML expressions verbatim.
5951 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
5952 and 'text' support optional locale specification '(in loc)', which
5953 specifies the default context for interpreting antiquotations. For
5954 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
5956 * Option 'locale=NAME' of antiquotations specifies an alternative
5957 context interpreting the subsequent argument. For example: @{thm
5958 [locale=lattice] inf_assoc}.
5960 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
5963 * Proper output of antiquotations for theory commands involving a
5964 proof context (such as 'locale' or 'theorem (in loc) ...').
5966 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
5967 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
5969 * isatool usedir: new option -C (default true) controls whether option
5970 -D should include a copy of the original document directory; -C false
5971 prevents unwanted effects such as copying of administrative CVS data.
5976 * Considerably improved version of 'constdefs' command. Now performs
5977 automatic type-inference of declared constants; additional support for
5978 local structure declarations (cf. locales and HOL records), see also
5979 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
5980 sequential dependencies of definitions within a single 'constdefs'
5981 section; moreover, the declared name needs to be an identifier. If
5982 all fails, consider to fall back on 'consts' and 'defs' separately.
5984 * Improved indexed syntax and implicit structures. First of all,
5985 indexed syntax provides a notational device for subscripted
5986 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
5987 expressions. Secondly, in a local context with structure
5988 declarations, number indexes \<^sub>n or the empty index (default
5989 number 1) refer to a certain fixed variable implicitly; option
5990 show_structs controls printing of implicit structures. Typical
5991 applications of these concepts involve record types and locales.
5993 * New command 'no_syntax' removes grammar declarations (and
5994 translations) resulting from the given syntax specification, which is
5995 interpreted in the same manner as for the 'syntax' command.
5997 * 'Advanced' translation functions (parse_translation etc.) may depend
5998 on the signature of the theory context being presently used for
5999 parsing/printing, see also isar-ref manual.
6001 * Improved 'oracle' command provides a type-safe interface to turn an
6002 ML expression of type theory -> T -> term into a primitive rule of
6003 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
6004 is already included here); see also FOL/ex/IffExample.thy;
6007 * axclass: name space prefix for class "c" is now "c_class" (was "c"
6008 before); "cI" is no longer bound, use "c.intro" instead.
6009 INCOMPATIBILITY. This change avoids clashes of fact bindings for
6010 axclasses vs. locales.
6012 * Improved internal renaming of symbolic identifiers -- attach primes
6013 instead of base 26 numbers.
6015 * New flag show_question_marks controls printing of leading question
6016 marks in schematic variable names.
6018 * In schematic variable names, *any* symbol following \<^isub> or
6019 \<^isup> is now treated as part of the base name. For example, the
6020 following works without printing of awkward ".0" indexes:
6022 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
6025 * Inner syntax includes (*(*nested*) comments*).
6027 * Pretty printer now supports unbreakable blocks, specified in mixfix
6028 annotations as "(00...)".
6030 * Clear separation of logical types and nonterminals, where the latter
6031 may only occur in 'syntax' specifications or type abbreviations.
6032 Before that distinction was only partially implemented via type class
6033 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
6034 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
6035 exotic syntax specifications may require further adaption
6036 (e.g. Cube/Cube.thy).
6038 * Removed obsolete type class "logic", use the top sort {} instead.
6039 Note that non-logical types should be declared as 'nonterminals'
6040 rather than 'types'. INCOMPATIBILITY for new object-logic
6043 * Attributes 'induct' and 'cases': type or set names may now be
6044 locally fixed variables as well.
6046 * Simplifier: can now control the depth to which conditional rewriting
6047 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
6050 * Simplifier: simplification procedures may now take the current
6051 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
6052 interface), which is very useful for calling the Simplifier
6053 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
6054 is gone -- use prems_of_ss on the simpset instead. Moreover, the
6055 low-level mk_simproc no longer applies Logic.varify internally, to
6056 allow for use in a context of fixed variables.
6058 * thin_tac now works even if the assumption being deleted contains !!
6059 or ==>. More generally, erule now works even if the major premise of
6060 the elimination rule contains !! or ==>.
6062 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
6064 * Reorganized bootstrapping of the Pure theories; CPure is now derived
6065 from Pure, which contains all common declarations already. Both
6066 theories are defined via plain Isabelle/Isar .thy files.
6067 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
6068 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
6069 use isatool fixcpure to adapt your theory and ML sources.
6071 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
6072 selections of theorems in named facts via index ranges.
6074 * 'print_theorems': in theory mode, really print the difference
6075 wrt. the last state (works for interactive theory development only),
6076 in proof mode print all local facts (cf. 'print_facts');
6078 * 'hide': option '(open)' hides only base names.
6080 * More efficient treatment of intermediate checkpoints in interactive
6083 * Code generator is now invoked via code_module (incremental code
6084 generation) and code_library (modular code generation, ML structures
6085 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
6086 must be quoted when used as identifiers.
6088 * New 'value' command for reading, evaluating and printing terms using
6089 the code generator. INCOMPATIBILITY: command keyword 'value' must be
6090 quoted when used as identifier.
6095 * New commands for the interpretation of locale expressions in
6096 theories (1), locales (2) and proof contexts (3). These generate
6097 proof obligations from the expression specification. After the
6098 obligations have been discharged, theorems of the expression are added
6099 to the theory, target locale or proof context. The synopsis of the
6100 commands is a follows:
6102 (1) interpretation expr inst
6103 (2) interpretation target < expr
6104 (3) interpret expr inst
6106 Interpretation in theories and proof contexts require a parameter
6107 instantiation of terms from the current context. This is applied to
6108 specifications and theorems of the interpreted expression.
6109 Interpretation in locales only permits parameter renaming through the
6110 locale expression. Interpretation is smart in that interpretations
6111 that are active already do not occur in proof obligations, neither are
6112 instantiated theorems stored in duplicate. Use 'print_interps' to
6113 inspect active interpretations of a particular locale. For details,
6114 see the Isar Reference manual. Examples can be found in
6115 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
6117 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
6118 'interpret' instead.
6120 * New context element 'constrains' for adding type constraints to
6123 * Context expressions: renaming of parameters with syntax
6126 * Locale declaration: 'includes' disallowed.
6128 * Proper static binding of attribute syntax -- i.e. types / terms /
6129 facts mentioned as arguments are always those of the locale definition
6130 context, independently of the context of later invocations. Moreover,
6131 locale operations (renaming and type / term instantiation) are applied
6132 to attribute arguments as expected.
6134 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
6135 actual attributes; rare situations may require Attrib.attribute to
6136 embed those attributes into Attrib.src that lack concrete syntax.
6137 Attribute implementations need to cooperate properly with the static
6138 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
6139 Attrib.XXX_thm etc. already do the right thing without further
6140 intervention. Only unusual applications -- such as "where" or "of"
6141 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
6142 on the context and the facts involved -- may have to assign parsed
6143 values to argument tokens explicitly.
6145 * Changed parameter management in theorem generation for long goal
6146 statements with 'includes'. INCOMPATIBILITY: produces a different
6147 theorem statement in rare situations.
6149 * Locale inspection command 'print_locale' omits notes elements. Use
6150 'print_locale!' to have them included in the output.
6155 * Provers/hypsubst.ML: improved version of the subst method, for
6156 single-step rewriting: it now works in bound variable contexts. New is
6157 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
6158 rewrite a different subterm than the original subst method, which is
6159 still available as 'simplesubst'.
6161 * Provers/quasi.ML: new transitivity reasoners for transitivity only
6164 * Provers/trancl.ML: new transitivity reasoner for transitive and
6165 reflexive-transitive closure of relations.
6167 * Provers/blast.ML: new reference depth_limit to make blast's depth
6168 limit (previously hard-coded with a value of 20) user-definable.
6170 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
6171 is peformed already. Object-logics merely need to finish their
6172 initial simpset configuration as before. INCOMPATIBILITY.
6177 * Symbolic syntax of Hilbert Choice Operator is now as follows:
6180 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
6182 The symbol \<some> is displayed as the alternative epsilon of LaTeX
6183 and x-symbol; use option '-m epsilon' to get it actually printed.
6184 Moreover, the mathematically important symbolic identifier \<epsilon>
6185 becomes available as variable, constant etc. INCOMPATIBILITY,
6187 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
6188 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
6189 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
6190 support corresponding Isar calculations.
6192 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
6195 * theory SetInterval: changed the syntax for open intervals:
6204 The old syntax is still supported but will disappear in the next
6205 release. For conversion use the following Emacs search and replace
6206 patterns (these are not perfect but work quite well):
6208 {)\([^\.]*\)\.\. -> {\1<\.\.}
6209 \.\.\([^(}]*\)(} -> \.\.<\1}
6211 * Theory Commutative_Ring (in Library): method comm_ring for proving
6212 equalities in commutative rings; method 'algebra' provides a generic
6215 * Theory Finite_Set: changed the syntax for 'setsum', summation over
6216 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
6217 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
6220 Some new syntax forms are available:
6222 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
6223 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
6224 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
6225 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
6227 The latter form "\<Sum>x < k. e" used to be based on a separate
6228 function "Summation", which has been discontinued.
6230 * theory Finite_Set: in structured induction proofs, the insert case
6231 is now 'case (insert x F)' instead of the old counterintuitive 'case
6234 * The 'refute' command has been extended to support a much larger
6235 fragment of HOL, including axiomatic type classes, constdefs and
6236 typedefs, inductive datatypes and recursion.
6238 * New tactics 'sat' and 'satx' to prove propositional tautologies.
6239 Requires zChaff with proof generation to be installed. See
6240 HOL/ex/SAT_Examples.thy for examples.
6242 * Datatype induction via method 'induct' now preserves the name of the
6243 induction variable. For example, when proving P(xs::'a list) by
6244 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
6245 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
6246 in unstructured proof scripts.
6248 * Reworked implementation of records. Improved scalability for
6249 records with many fields, avoiding performance problems for type
6250 inference. Records are no longer composed of nested field types, but
6251 of nested extension types. Therefore the record type only grows linear
6252 in the number of extensions and not in the number of fields. The
6253 top-level (users) view on records is preserved. Potential
6254 INCOMPATIBILITY only in strange cases, where the theory depends on the
6255 old record representation. The type generated for a record is called
6256 <record_name>_ext_type.
6258 Flag record_quick_and_dirty_sensitive can be enabled to skip the
6259 proofs triggered by a record definition or a simproc (if
6260 quick_and_dirty is enabled). Definitions of large records can take
6263 New simproc record_upd_simproc for simplification of multiple record
6264 updates enabled by default. Moreover, trivial updates are also
6265 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
6266 occasionally, since simplification is more powerful by default.
6268 * typedef: proper support for polymorphic sets, which contain extra
6269 type-variables in the term.
6271 * Simplifier: automatically reasons about transitivity chains
6272 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
6273 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
6274 old proofs break occasionally as simplification may now solve more
6275 goals than previously.
6277 * Simplifier: converts x <= y into x = y if assumption y <= x is
6278 present. Works for all partial orders (class "order"), in particular
6279 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
6282 * Simplifier: new simproc for "let x = a in f x". If a is a free or
6283 bound variable or a constant then the let is unfolded. Otherwise
6284 first a is simplified to b, and then f b is simplified to g. If
6285 possible we abstract b from g arriving at "let x = b in h x",
6286 otherwise we unfold the let and arrive at g. The simproc can be
6287 enabled/disabled by the reference use_let_simproc. Potential
6288 INCOMPATIBILITY since simplification is more powerful by default.
6290 * Classical reasoning: the meson method now accepts theorems as arguments.
6292 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
6293 jobs to provide advice on the provability of subgoals.
6295 * Theory OrderedGroup and Ring_and_Field: various additions and
6296 improvements to faciliate calculations involving equalities and
6299 The following theorems have been eliminated or modified
6302 abs_eq now named abs_of_nonneg
6303 abs_of_ge_0 now named abs_of_nonneg
6304 abs_minus_eq now named abs_of_nonpos
6305 imp_abs_id now named abs_of_nonneg
6306 imp_abs_neg_id now named abs_of_nonpos
6307 mult_pos now named mult_pos_pos
6308 mult_pos_le now named mult_nonneg_nonneg
6309 mult_pos_neg_le now named mult_nonneg_nonpos
6310 mult_pos_neg2_le now named mult_nonneg_nonpos2
6311 mult_neg now named mult_neg_neg
6312 mult_neg_le now named mult_nonpos_nonpos
6314 * The following lemmas in Ring_and_Field have been added to the simplifier:
6317 not_square_less_zero
6319 The following lemmas have been deleted from Real/RealPow:
6329 * Theory Parity: added rules for simplifying exponents.
6333 The following theorems have been eliminated or modified
6336 list_all_Nil now named list_all.simps(1)
6337 list_all_Cons now named list_all.simps(2)
6338 list_all_conv now named list_all_iff
6339 set_mem_eq now named mem_iff
6341 * Theories SetsAndFunctions and BigO (see HOL/Library) support
6342 asymptotic "big O" calculations. See the notes in BigO.thy.
6347 * Theory RealDef: better support for embedding natural numbers and
6348 integers in the reals.
6350 The following theorems have been eliminated or modified
6353 exp_ge_add_one_self now requires no hypotheses
6354 real_of_int_add reversed direction of equality (use [symmetric])
6355 real_of_int_minus reversed direction of equality (use [symmetric])
6356 real_of_int_diff reversed direction of equality (use [symmetric])
6357 real_of_int_mult reversed direction of equality (use [symmetric])
6359 * Theory RComplete: expanded support for floor and ceiling functions.
6361 * Theory Ln is new, with properties of the natural logarithm
6363 * Hyperreal: There is a new type constructor "star" for making
6364 nonstandard types. The old type names are now type synonyms:
6368 hcomplex = complex star
6370 * Hyperreal: Many groups of similarly-defined constants have been
6371 replaced by polymorphic versions (INCOMPATIBILITY):
6373 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
6375 starset <-- starsetNat, starsetC
6376 *s* <-- *sNat*, *sc*
6377 starset_n <-- starsetNat_n, starsetC_n
6378 *sn* <-- *sNatn*, *scn*
6379 InternalSets <-- InternalNatSets, InternalCSets
6381 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6382 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
6383 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
6384 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
6385 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
6387 * Hyperreal: Many type-specific theorems have been removed in favor of
6388 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
6390 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
6391 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
6392 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
6393 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
6394 right_minus <-- hypreal_add_minus
6395 left_minus <-- {hypreal,hcomplex}_add_minus_left
6396 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
6397 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
6398 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
6399 mult_1_right <-- hcomplex_mult_one_right
6400 mult_zero_left <-- hcomplex_mult_zero_left
6401 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
6402 right_distrib <-- hypnat_add_mult_distrib2
6403 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
6404 right_inverse <-- hypreal_mult_inverse
6405 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
6406 order_refl <-- {hypreal,hypnat}_le_refl
6407 order_trans <-- {hypreal,hypnat}_le_trans
6408 order_antisym <-- {hypreal,hypnat}_le_anti_sym
6409 order_less_le <-- {hypreal,hypnat}_less_le
6410 linorder_linear <-- {hypreal,hypnat}_le_linear
6411 add_left_mono <-- {hypreal,hypnat}_add_left_mono
6412 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
6413 add_nonneg_nonneg <-- hypreal_le_add_order
6415 * Hyperreal: Separate theorems having to do with type-specific
6416 versions of constants have been merged into theorems that apply to the
6417 new polymorphic constants (INCOMPATIBILITY):
6419 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
6420 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
6421 STAR_Un <-- {STAR,NatStar,STARC}_Un
6422 STAR_Int <-- {STAR,NatStar,STARC}_Int
6423 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
6424 STAR_subset <-- {STAR,NatStar,STARC}_subset
6425 STAR_mem <-- {STAR,NatStar,STARC}_mem
6426 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
6427 STAR_diff <-- {STAR,STARC}_diff
6428 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
6429 STARC_hcomplex_of_complex}_image_subset
6430 starset_n_Un <-- starset{Nat,C}_n_Un
6431 starset_n_Int <-- starset{Nat,C}_n_Int
6432 starset_n_Compl <-- starset{Nat,C}_n_Compl
6433 starset_n_diff <-- starset{Nat,C}_n_diff
6434 InternalSets_Un <-- Internal{Nat,C}Sets_Un
6435 InternalSets_Int <-- Internal{Nat,C}Sets_Int
6436 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
6437 InternalSets_diff <-- Internal{Nat,C}Sets_diff
6438 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
6439 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
6440 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
6441 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
6442 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
6443 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6444 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
6445 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
6446 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
6447 starfun_diff <-- starfun{C,RC,CR}_diff
6448 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
6449 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
6450 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
6451 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
6452 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
6453 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
6454 starfun_Id <-- starfunC_Id
6455 starfun_approx <-- starfun{Nat,CR}_approx
6456 starfun_capprox <-- starfun{C,RC}_capprox
6457 starfun_abs <-- starfunNat_rabs
6458 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
6459 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
6460 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
6461 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
6462 starfun_add_capprox <-- starfun{C,RC}_add_capprox
6463 starfun_add_approx <-- starfunCR_add_approx
6464 starfun_inverse_inverse <-- starfunC_inverse_inverse
6465 starfun_divide <-- starfun{C,CR,RC}_divide
6466 starfun_n <-- starfun{Nat,C}_n
6467 starfun_n_mult <-- starfun{Nat,C}_n_mult
6468 starfun_n_add <-- starfun{Nat,C}_n_add
6469 starfun_n_add_minus <-- starfunNat_n_add_minus
6470 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
6471 starfun_n_minus <-- starfun{Nat,C}_n_minus
6472 starfun_n_eq <-- starfun{Nat,C}_n_eq
6474 star_n_add <-- {hypreal,hypnat,hcomplex}_add
6475 star_n_minus <-- {hypreal,hcomplex}_minus
6476 star_n_diff <-- {hypreal,hcomplex}_diff
6477 star_n_mult <-- {hypreal,hcomplex}_mult
6478 star_n_inverse <-- {hypreal,hcomplex}_inverse
6479 star_n_le <-- {hypreal,hypnat}_le
6480 star_n_less <-- {hypreal,hypnat}_less
6481 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
6482 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
6483 star_n_abs <-- hypreal_hrabs
6484 star_n_divide <-- hcomplex_divide
6486 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
6487 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
6488 star_of_diff <-- hypreal_of_real_diff
6489 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
6490 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
6491 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
6492 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
6493 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
6494 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
6495 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
6496 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
6497 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
6498 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
6499 star_of_number_of <-- {hypreal,hcomplex}_number_of
6500 star_of_number_less <-- number_of_less_hypreal_of_real_iff
6501 star_of_number_le <-- number_of_le_hypreal_of_real_iff
6502 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
6503 star_of_less_number <-- hypreal_of_real_less_number_of_iff
6504 star_of_le_number <-- hypreal_of_real_le_number_of_iff
6505 star_of_power <-- hypreal_of_real_power
6506 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
6508 * Hyperreal: new method "transfer" that implements the transfer
6509 principle of nonstandard analysis. With a subgoal that mentions
6510 nonstandard types like "'a star", the command "apply transfer"
6511 replaces it with an equivalent one that mentions only standard types.
6512 To be successful, all free variables must have standard types; non-
6513 standard variables must have explicit universal quantifiers.
6515 * Hyperreal: A theory of Taylor series.
6520 * Discontinued special version of 'constdefs' (which used to support
6521 continuous functions) in favor of the general Pure one with full
6524 * New simplification procedure for solving continuity conditions; it
6525 is much faster on terms with many nested lambda abstractions (cubic
6526 instead of exponential time).
6528 * New syntax for domain package: selector names are now optional.
6529 Parentheses should be omitted unless argument is lazy, for example:
6531 domain 'a stream = cons "'a" (lazy "'a stream")
6533 * New command 'fixrec' for defining recursive functions with pattern
6534 matching; defining multiple functions with mutual recursion is also
6535 supported. Patterns may include the constants cpair, spair, up, sinl,
6536 sinr, or any data constructor defined by the domain package. The given
6537 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
6538 syntax and examples.
6540 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
6541 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
6542 but the proof obligation additionally includes an admissibility
6543 requirement. The packages generate instances of class cpo or pcpo,
6544 with continuity and strictness theorems for Rep and Abs.
6546 * HOLCF: Many theorems have been renamed according to a more standard naming
6547 scheme (INCOMPATIBILITY):
6549 foo_inject: "foo$x = foo$y ==> x = y"
6550 foo_eq: "(foo$x = foo$y) = (x = y)"
6551 foo_less: "(foo$x << foo$y) = (x << y)"
6552 foo_strict: "foo$UU = UU"
6553 foo_defined: "... ==> foo$x ~= UU"
6554 foo_defined_iff: "(foo$x = UU) = (x = UU)"
6559 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
6560 including the First Isomorphism Theorem (on quotienting by the kernel
6563 * ZF/Simplifier: install second copy of type solver that actually
6564 makes use of TC rules declared to Isar proof contexts (or locales);
6565 the old version is still required for ML proof scripts.
6570 * Converted to Isar theory format; use locales instead of axiomatic
6576 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
6579 * Pure/library.ML no longer defines its own option datatype, but uses
6580 that of the SML basis, which has constructors NONE and SOME instead of
6581 None and Some, as well as exception Option.Option instead of OPTION.
6582 The functions the, if_none, is_some, is_none have been adapted
6583 accordingly, while Option.map replaces apsome.
6585 * Pure/library.ML: the exception LIST has been given up in favour of
6586 the standard exceptions Empty and Subscript, as well as
6587 Library.UnequalLengths. Function like Library.hd and Library.tl are
6588 superceded by the standard hd and tl functions etc.
6590 A number of basic list functions are no longer exported to the ML
6591 toplevel, as they are variants of predefined functions. The following
6592 suggests how one can translate existing code:
6594 rev_append xs ys = List.revAppend (xs, ys)
6595 nth_elem (i, xs) = List.nth (xs, i)
6596 last_elem xs = List.last xs
6597 flat xss = List.concat xss
6598 seq fs = List.app fs
6599 partition P xs = List.partition P xs
6600 mapfilter f xs = List.mapPartial f xs
6602 * Pure/library.ML: several combinators for linear functional
6603 transformations, notably reverse application and composition:
6606 (x, y) |-> f f #-> g
6608 * Pure/library.ML: introduced/changed precedence of infix operators:
6610 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
6612 infix 3 o oo ooo oooo;
6613 infix 4 ~~ upto downto;
6615 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
6618 * Pure/library.ML: natural list combinators fold, fold_rev, and
6619 fold_map support linear functional transformations and nesting. For
6622 fold f [x1, ..., xN] y =
6623 y |> f x1 |> ... |> f xN
6625 (fold o fold) f [xs1, ..., xsN] y =
6626 y |> fold f xs1 |> ... |> fold f xsN
6628 fold f [x1, ..., xN] =
6631 (fold o fold) f [xs1, ..., xsN] =
6632 fold f xs1 #> ... #> fold f xsN
6634 * Pure/library.ML: the following selectors on type 'a option are
6637 the: 'a option -> 'a (*partial*)
6638 these: 'a option -> 'a where 'a = 'b list
6639 the_default: 'a -> 'a option -> 'a
6640 the_list: 'a option -> 'a list
6642 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6643 basic operations for association lists, following natural argument
6644 order; moreover the explicit equality predicate passed here avoids
6645 potentially expensive polymorphic runtime equality checks.
6646 The old functions may be expressed as follows:
6648 assoc = uncurry (AList.lookup (op =))
6649 assocs = these oo AList.lookup (op =)
6650 overwrite = uncurry (AList.update (op =)) o swap
6652 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6654 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
6655 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
6657 replacing make_keylist and keyfilter (occassionally used)
6660 make_keylist = AList.make
6661 keyfilter = AList.find (op =)
6663 * eq_fst and eq_snd now take explicit equality parameter, thus
6664 avoiding eqtypes. Naive rewrites:
6666 eq_fst = eq_fst (op =)
6667 eq_snd = eq_snd (op =)
6669 * Removed deprecated apl and apr (rarely used).
6672 apl (n, op) =>>= curry op n
6673 apr (op, m) =>>= fn n => op (n, m)
6675 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
6676 provides a reasonably efficient light-weight implementation of sets as
6679 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
6680 few new operations; existing lookup and update are now curried to
6681 follow natural argument order (for use with fold etc.);
6682 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
6684 * Pure/General: output via the Isabelle channels of
6685 writeln/warning/error etc. is now passed through Output.output, with a
6686 hook for arbitrary transformations depending on the print_mode
6687 (cf. Output.add_mode -- the first active mode that provides a output
6688 function wins). Already formatted output may be embedded into further
6689 text via Output.raw; the result of Pretty.string_of/str_of and derived
6690 functions (string_of_term/cterm/thm etc.) is already marked raw to
6691 accommodate easy composition of diagnostic messages etc. Programmers
6692 rarely need to care about Output.output or Output.raw at all, with
6693 some notable exceptions: Output.output is required when bypassing the
6694 standard channels (writeln etc.), or in token translations to produce
6695 properly formatted results; Output.raw is required when capturing
6696 already output material that will eventually be presented to the user
6697 a second time. For the default print mode, both Output.output and
6698 Output.raw have no effect.
6700 * Pure/General: Output.time_accumulator NAME creates an operator ('a
6701 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
6702 cumulative results are displayed at the end of a batch session.
6704 * Pure/General: File.sysify_path and File.quote_sysify path have been
6705 replaced by File.platform_path and File.shell_path (with appropriate
6706 hooks). This provides a clean interface for unusual systems where the
6707 internal and external process view of file names are different.
6709 * Pure: more efficient orders for basic syntactic entities: added
6710 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
6711 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
6712 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
6713 orders now -- potential INCOMPATIBILITY for code that depends on a
6714 particular order for Symtab.keys, Symtab.dest, etc. (consider using
6715 Library.sort_strings on result).
6717 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
6718 fold_types traverse types/terms from left to right, observing natural
6719 argument order. Supercedes previous foldl_XXX versions, add_frees,
6720 add_vars etc. have been adapted as well: INCOMPATIBILITY.
6722 * Pure: name spaces have been refined, with significant changes of the
6723 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
6724 to extern(_table). The plain name entry path is superceded by a
6725 general 'naming' context, which also includes the 'policy' to produce
6726 a fully qualified name and external accesses of a fully qualified
6727 name; NameSpace.extend is superceded by context dependent
6728 Sign.declare_name. Several theory and proof context operations modify
6729 the naming context. Especially note Theory.restore_naming and
6730 ProofContext.restore_naming to get back to a sane state; note that
6731 Theory.add_path is no longer sufficient to recover from
6732 Theory.absolute_path in particular.
6734 * Pure: new flags short_names (default false) and unique_names
6735 (default true) for controlling output of qualified names. If
6736 short_names is set, names are printed unqualified. If unique_names is
6737 reset, the name prefix is reduced to the minimum required to achieve
6738 the original result when interning again, even if there is an overlap
6739 with earlier declarations.
6741 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
6742 now 'extend', and 'merge' gets an additional Pretty.pp argument
6743 (useful for printing error messages). INCOMPATIBILITY.
6745 * Pure: major reorganization of the theory context. Type Sign.sg and
6746 Theory.theory are now identified, referring to the universal
6747 Context.theory (see Pure/context.ML). Actual signature and theory
6748 content is managed as theory data. The old code and interfaces were
6749 spread over many files and structures; the new arrangement introduces
6750 considerable INCOMPATIBILITY to gain more clarity:
6752 Context -- theory management operations (name, identity, inclusion,
6753 parents, ancestors, merge, etc.), plus generic theory data;
6755 Sign -- logical signature and syntax operations (declaring consts,
6756 types, etc.), plus certify/read for common entities;
6758 Theory -- logical theory operations (stating axioms, definitions,
6759 oracles), plus a copy of logical signature operations (consts,
6760 types, etc.); also a few basic management operations (Theory.copy,
6763 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
6764 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
6765 for convenience -- they merely return the theory.
6767 * Pure: type Type.tsig is superceded by theory in most interfaces.
6769 * Pure: the Isar proof context type is already defined early in Pure
6770 as Context.proof (note that ProofContext.context and Proof.context are
6771 aliases, where the latter is the preferred name). This enables other
6772 Isabelle components to refer to that type even before Isar is present.
6774 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
6775 typeK, constK, axiomK, oracleK), but provide explicit operations for
6776 any of these kinds. For example, Sign.intern typeK is now
6777 Sign.intern_type, Theory.hide_space Sign.typeK is now
6778 Theory.hide_types. Also note that former
6779 Theory.hide_classes/types/consts are now
6780 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
6781 internalize their arguments! INCOMPATIBILITY.
6783 * Pure: get_thm interface (of PureThy and ProofContext) expects
6784 datatype thmref (with constructors Name and NameSelection) instead of
6785 plain string -- INCOMPATIBILITY;
6787 * Pure: cases produced by proof methods specify options, where NONE
6788 means to remove case bindings -- INCOMPATIBILITY in
6791 * Pure: the following operations retrieve axioms or theorems from a
6792 theory node or theory hierarchy, respectively:
6794 Theory.axioms_of: theory -> (string * term) list
6795 Theory.all_axioms_of: theory -> (string * term) list
6796 PureThy.thms_of: theory -> (string * thm) list
6797 PureThy.all_thms_of: theory -> (string * thm) list
6799 * Pure: print_tac now outputs the goal through the trace channel.
6801 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
6802 Reference Toplevel.debug (default false) controls detailed printing
6803 and tracing of low-level exceptions; Toplevel.profiling (default 0)
6804 controls execution profiling -- set to 1 for time and 2 for space
6805 (both increase the runtime).
6807 * Isar session: The initial use of ROOT.ML is now always timed,
6808 i.e. the log will show the actual process times, in contrast to the
6809 elapsed wall-clock time that the outer shell wrapper produces.
6811 * Simplifier: improved handling of bound variables (nameless
6812 representation, avoid allocating new strings). Simprocs that invoke
6813 the Simplifier recursively should use Simplifier.inherit_bounds to
6814 avoid local name clashes. Failure to do so produces warnings
6815 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
6816 for further details.
6818 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
6819 bindings for all theorems stored within a given theory; this may help
6820 in porting non-Isar theories to Isar ones, while keeping ML proof
6821 scripts for the time being.
6823 * ML operator HTML.with_charset specifies the charset begin used for
6824 generated HTML files. For example:
6826 HTML.with_charset "utf-8" use_thy "Hebrew";
6827 HTML.with_charset "utf-8" use_thy "Chinese";
6832 * Allow symlinks to all proper Isabelle executables (Isabelle,
6833 isabelle, isatool etc.).
6835 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
6836 isatool doc, isatool mkdir, display_drafts etc.).
6838 * isatool usedir: option -f allows specification of the ML file to be
6839 used by Isabelle; default is ROOT.ML.
6841 * New isatool version outputs the version identifier of the Isabelle
6842 distribution being used.
6844 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
6845 (containing Boolean satisfiability problems) into Isabelle/HOL
6850 New in Isabelle2004 (April 2004)
6851 --------------------------------
6855 * Provers/order.ML: new efficient reasoner for partial and linear orders.
6856 Replaces linorder.ML.
6858 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
6859 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
6860 (\<a>...\<z>), are now considered normal letters, and can therefore
6861 be used anywhere where an ASCII letter (a...zA...Z) has until
6862 now. COMPATIBILITY: This obviously changes the parsing of some
6863 terms, especially where a symbol has been used as a binder, say
6864 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
6865 as an identifier. Fix it by inserting a space around former
6866 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
6867 existing theory and ML files.
6869 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
6871 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
6872 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
6873 a normal (but invisible) letter. For multiple letter subscripts repeat
6874 \<^isub> like this: x\<^isub>1\<^isub>2.
6876 * Pure: There are now sub-/superscripts that can span more than one
6877 character. Text between \<^bsub> and \<^esub> is set in subscript in
6878 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
6879 superscript. The new control characters are not identifier parts.
6881 * Pure: Control-symbols of the form \<^raw:...> will literally print the
6882 content of "..." to the latex file instead of \isacntrl... . The "..."
6883 may consist of any printable characters excluding the end bracket >.
6885 * Pure: Using new Isar command "finalconsts" (or the ML functions
6886 Theory.add_finals or Theory.add_finals_i) it is now possible to
6887 declare constants "final", which prevents their being given a definition
6888 later. It is useful for constants whose behaviour is fixed axiomatically
6889 rather than definitionally, such as the meta-logic connectives.
6891 * Pure: 'instance' now handles general arities with general sorts
6892 (i.e. intersections of classes),
6894 * Presentation: generated HTML now uses a CSS style sheet to make layout
6895 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
6896 It can be changed to alter the colors/layout of generated pages.
6901 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
6902 cut_tac, subgoal_tac and thin_tac:
6903 - Now understand static (Isar) contexts. As a consequence, users of Isar
6904 locales are no longer forced to write Isar proof scripts.
6905 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
6907 - INCOMPATIBILITY: names of variables to be instantiated may no
6908 longer be enclosed in quotes. Instead, precede variable name with `?'.
6909 This is consistent with the instantiation attribute "where".
6911 * Attributes "where" and "of":
6912 - Now take type variables of instantiated theorem into account when reading
6913 the instantiation string. This fixes a bug that caused instantiated
6914 theorems to have too special types in some circumstances.
6915 - "where" permits explicit instantiations of type variables.
6917 * Calculation commands "moreover" and "also" no longer interfere with
6918 current facts ("this"), admitting arbitrary combinations with "then"
6922 - Goal statements involving the context element "includes" no longer
6923 generate theorems with internal delta predicates (those ending on
6924 "_axioms") in the premise.
6925 Resolve particular premise with <locale>.intro to obtain old form.
6926 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
6927 specification and "includes" elements in goal statement.
6928 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
6929 [intro?] and [elim?] (respectively) by default.
6930 - Experimental command for instantiation of locales in proof contexts:
6931 instantiate <label>[<attrs>]: <loc>
6932 Instantiates locale <loc> and adds all its theorems to the current context
6933 taking into account their attributes. Label and attrs are optional
6934 modifiers, like in theorem declarations. If present, names of
6935 instantiated theorems are qualified with <label>, and the attributes
6936 <attrs> are applied after any attributes these theorems might have already.
6937 If the locale has assumptions, a chained fact of the form
6938 "<loc> t1 ... tn" is expected from which instantiations of the parameters
6939 are derived. The command does not support old-style locales declared
6940 with "locale (open)".
6941 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
6943 * HOL: Tactic emulation methods induct_tac and case_tac understand static
6949 * Proof import: new image HOL4 contains the imported library from
6950 the HOL4 system with about 2500 theorems. It is imported by
6951 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
6952 can be used like any other Isabelle image. See
6953 HOL/Import/HOL/README for more information.
6956 - Much improved handling of linear and partial orders.
6957 Reasoners for linear and partial orders are set up for type classes
6958 "linorder" and "order" respectively, and are added to the default simpset
6959 as solvers. This means that the simplifier can build transitivity chains
6960 to solve goals from the assumptions.
6961 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
6962 of blast or auto after simplification become unnecessary because the goal
6963 is solved by simplification already.
6965 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
6966 all proved in axiomatic type classes for semirings, rings and fields.
6969 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
6970 now formalized using the Ring_and_Field theory mentioned above.
6971 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
6972 than before, because now they are set up once in a generic manner.
6973 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
6974 Look for the general versions in Ring_and_Field (and Power if they concern
6977 * Type "rat" of the rational numbers is now available in HOL-Complex.
6980 - Record types are now by default printed with their type abbreviation
6981 instead of the list of all field types. This can be configured via
6982 the reference "print_record_type_abbr".
6983 - Simproc "record_upd_simproc" for simplification of multiple updates added
6984 (not enabled by default).
6985 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
6986 EX x. x = sel r to True (not enabled by default).
6987 - Tactic "record_split_simp_tac" to split and simplify records added.
6989 * 'specification' command added, allowing for definition by
6990 specification. There is also an 'ax_specification' command that
6991 introduces the new constants axiomatically.
6993 * arith(_tac) is now able to generate counterexamples for reals as well.
6995 * HOL-Algebra: new locale "ring" for non-commutative rings.
6997 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
6998 definitions, thanks to Sava Krsti\'{c} and John Matthews.
7000 * HOL-Matrix: a first theory for matrices in HOL with an application of
7001 matrix theory to linear programming.
7003 * Unions and Intersections:
7004 The latex output syntax of UN and INT has been changed
7005 from "\Union x \in A. B" to "\Union_{x \in A} B"
7006 i.e. the index formulae has become a subscript.
7007 Similarly for "\Union x. B", and for \Inter instead of \Union.
7009 * Unions and Intersections over Intervals:
7010 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
7011 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
7012 like in normal math, and corresponding versions for < and for intersection.
7014 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
7015 lexicographic dictonary ordering has been added as "lexord".
7017 * ML: the legacy theory structures Int and List have been removed. They had
7018 conflicted with ML Basis Library structures having the same names.
7020 * 'refute' command added to search for (finite) countermodels. Only works
7021 for a fragment of HOL. The installation of an external SAT solver is
7022 highly recommended. See "HOL/Refute.thy" for details.
7024 * 'quickcheck' command: Allows to find counterexamples by evaluating
7025 formulae under an assignment of free variables to random values.
7026 In contrast to 'refute', it can deal with inductive datatypes,
7027 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
7033 * Streams now come with concatenation and are part of the HOLCF image
7037 New in Isabelle2003 (May 2003)
7038 ------------------------------
7042 * Provers/simplifier:
7044 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
7045 Assumptions are now subject to complete mutual simplification,
7046 not just from left to right. The simplifier now preserves
7047 the order of assumptions.
7049 Potential INCOMPATIBILITY:
7051 -- simp sometimes diverges where the old version did
7052 not, e.g. invoking simp on the goal
7054 [| P (f x); y = x; f x = f y |] ==> Q
7056 now gives rise to the infinite reduction sequence
7058 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
7060 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
7063 -- Tactics combining classical reasoner and simplification (such as auto)
7064 are also affected by this change, because many of them rely on
7065 simp. They may sometimes diverge as well or yield a different numbers
7066 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
7067 in case of problems. Sometimes subsequent calls to the classical
7068 reasoner will fail because a preceeding call to the simplifier too
7069 eagerly simplified the goal, e.g. deleted redundant premises.
7071 - The simplifier trace now shows the names of the applied rewrite rules
7073 - You can limit the number of recursive invocations of the simplifier
7074 during conditional rewriting (where the simplifie tries to solve the
7075 conditions before applying the rewrite rule):
7076 ML "simp_depth_limit := n"
7077 where n is an integer. Thus you can force termination where previously
7078 the simplifier would diverge.
7080 - Accepts free variables as head terms in congruence rules. Useful in Isar.
7082 - No longer aborts on failed congruence proof. Instead, the
7083 congruence is ignored.
7085 * Pure: New generic framework for extracting programs from constructive
7086 proofs. See HOL/Extraction.thy for an example instantiation, as well
7087 as HOL/Extraction for some case studies.
7089 * Pure: The main goal of the proof state is no longer shown by default, only
7090 the subgoals. This behaviour is controlled by a new flag.
7091 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
7092 (ML: Proof.show_main_goal).
7094 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
7095 rules whose conclusion matches subgoal 1:
7096 PG menu: Isabelle/Isar -> Show me -> matching rules
7097 The rules are ordered by how closely they match the subgoal.
7098 In particular, rules that solve a subgoal outright are displayed first
7099 (or rather last, the way they are printed).
7100 (ML: ProofGeneral.print_intros())
7102 * Pure: New flag trace_unify_fail causes unification to print
7103 diagnostic information (PG: in trace buffer) when it fails. This is
7104 useful for figuring out why single step proofs like rule, erule or
7107 * Pure: Locale specifications now produce predicate definitions
7108 according to the body of text (covering assumptions modulo local
7109 definitions); predicate "loc_axioms" covers newly introduced text,
7110 while "loc" is cumulative wrt. all included locale expressions; the
7111 latter view is presented only on export into the global theory
7112 context; potential INCOMPATIBILITY, use "(open)" option to fall back
7113 on the old view without predicates;
7115 * Pure: predefined locales "var" and "struct" are useful for sharing
7116 parameters (as in CASL, for example); just specify something like
7117 ``var x + var y + struct M'' as import;
7119 * Pure: improved thms_containing: proper indexing of facts instead of
7120 raw theorems; check validity of results wrt. current name space;
7121 include local facts of proof configuration (also covers active
7122 locales), cover fixed variables in index; may use "_" in term
7123 specification; an optional limit for the number of printed facts may
7124 be given (the default is 40);
7126 * Pure: disallow duplicate fact bindings within new-style theory files
7129 * Provers: improved induct method: assumptions introduced by case
7130 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
7131 the goal statement); "foo" still refers to all facts collectively;
7133 * Provers: the function blast.overloaded has been removed: all constants
7134 are regarded as potentially overloaded, which improves robustness in exchange
7135 for slight decrease in efficiency;
7137 * Provers/linorder: New generic prover for transitivity reasoning over
7138 linear orders. Note: this prover is not efficient!
7140 * Isar: preview of problems to finish 'show' now produce an error
7141 rather than just a warning (in interactive mode);
7148 - Produces a counter example if it cannot prove a goal.
7149 Note that the counter example may be spurious if the goal is not a formula
7150 of quantifier-free linear arithmetic.
7151 In ProofGeneral the counter example appears in the trace buffer.
7153 - Knows about div k and mod k where k is a numeral of type nat or int.
7155 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
7156 linear arithmetic fails. This takes account of quantifiers and divisibility.
7157 Presburger arithmetic can also be called explicitly via presburger(_tac).
7159 * simp's arithmetic capabilities have been enhanced a bit: it now
7160 takes ~= in premises into account (by performing a case split);
7162 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
7163 are distributed over a sum of terms;
7165 * New tactic "trans_tac" and method "trans" instantiate
7166 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
7169 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
7170 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
7172 * 'typedef' command has new option "open" to suppress the set
7175 * functions Min and Max on finite sets have been introduced (theory
7178 * attribute [symmetric] now works for relations as well; it turns
7179 (x,y) : R^-1 into (y,x) : R, and vice versa;
7181 * induct over a !!-quantified statement (say !!x1..xn):
7182 each "case" automatically performs "fix x1 .. xn" with exactly those names.
7184 * Map: `empty' is no longer a constant but a syntactic abbreviation for
7185 %x. None. Warning: empty_def now refers to the previously hidden definition
7188 * Algebra: formalization of classical algebra. Intended as base for
7189 any algebraic development in Isabelle. Currently covers group theory
7190 (up to Sylow's theorem) and ring theory (Universal Property of
7191 Univariate Polynomials). Contributions welcome;
7193 * GroupTheory: deleted, since its material has been moved to Algebra;
7195 * Complex: new directory of the complex numbers with numeric constants,
7196 nonstandard complex numbers, and some complex analysis, standard and
7197 nonstandard (Jacques Fleuriot);
7199 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
7201 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
7204 * Real/HahnBanach: updated and adapted to locales;
7206 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
7209 * UNITY: added the Meier-Sanders theory of progress sets;
7211 * MicroJava: bytecode verifier and lightweight bytecode verifier
7212 as abstract algorithms, instantiated to the JVM;
7214 * Bali: Java source language formalization. Type system, operational
7215 semantics, axiomatic semantics. Supported language features:
7216 classes, interfaces, objects,virtual methods, static methods,
7217 static/instance fields, arrays, access modifiers, definite
7218 assignment, exceptions.
7223 * ZF/Constructible: consistency proof for AC (Gdel's constructible
7226 * Main ZF: virtually all theories converted to new-style format;
7231 * Pure: Tactic.prove provides sane interface for internal proofs;
7232 omits the infamous "standard" operation, so this is more appropriate
7233 than prove_goalw_cterm in many situations (e.g. in simprocs);
7235 * Pure: improved error reporting of simprocs;
7237 * Provers: Simplifier.simproc(_i) provides sane interface for setting
7241 *** Document preparation ***
7243 * uses \par instead of \\ for line breaks in theory text. This may
7244 shift some page breaks in large documents. To get the old behaviour
7245 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
7247 * minimized dependencies of isabelle.sty and isabellesym.sty on
7250 * \<euro> now needs package babel/greek instead of marvosym (which
7253 * normal size for \<zero>...\<nine> (uses \mathbf instead of
7258 New in Isabelle2002 (March 2002)
7259 --------------------------------
7261 *** Document preparation ***
7263 * greatly simplified document preparation setup, including more
7264 graceful interpretation of isatool usedir -i/-d/-D options, and more
7265 instructive isatool mkdir; users should basically be able to get
7266 started with "isatool mkdir HOL Test && isatool make"; alternatively,
7267 users may run a separate document processing stage manually like this:
7268 "isatool usedir -D output HOL Test && isatool document Test/output";
7270 * theory dependency graph may now be incorporated into documents;
7271 isatool usedir -g true will produce session_graph.eps/.pdf for use
7272 with \includegraphics of LaTeX;
7274 * proper spacing of consecutive markup elements, especially text
7275 blocks after section headings;
7277 * support bold style (for single symbols only), input syntax is like
7278 this: "\<^bold>\<alpha>" or "\<^bold>A";
7280 * \<bullet> is now output as bold \cdot by default, which looks much
7281 better in printed text;
7283 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
7284 note that these symbols are currently unavailable in Proof General /
7285 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
7287 * isatool latex no longer depends on changed TEXINPUTS, instead
7288 isatool document copies the Isabelle style files to the target
7294 * Pure/Provers: improved proof by cases and induction;
7295 - 'case' command admits impromptu naming of parameters (such as
7297 - 'induct' method divinates rule instantiation from the inductive
7298 claim; no longer requires excessive ?P bindings for proper
7299 instantiation of cases;
7300 - 'induct' method properly enumerates all possibilities of set/type
7301 rules; as a consequence facts may be also passed through *type*
7302 rules without further ado;
7303 - 'induct' method now derives symbolic cases from the *rulified*
7304 rule (before it used to rulify cases stemming from the internal
7305 atomized version); this means that the context of a non-atomic
7306 statement becomes is included in the hypothesis, avoiding the
7307 slightly cumbersome show "PROP ?case" form;
7308 - 'induct' may now use elim-style induction rules without chaining
7309 facts, using ``missing'' premises from the goal state; this allows
7310 rules stemming from inductive sets to be applied in unstructured
7311 scripts, while still benefitting from proper handling of non-atomic
7312 statements; NB: major inductive premises need to be put first, all
7313 the rest of the goal is passed through the induction;
7314 - 'induct' proper support for mutual induction involving non-atomic
7315 rule statements (uses the new concept of simultaneous goals, see
7317 - append all possible rule selections, but only use the first
7318 success (no backtracking);
7319 - removed obsolete "(simplified)" and "(stripped)" options of methods;
7320 - undeclared rule case names default to numbers 1, 2, 3, ...;
7321 - added 'print_induct_rules' (covered by help item in recent Proof
7323 - moved induct/cases attributes to Pure, methods to Provers;
7324 - generic method setup instantiated for FOL and HOL;
7326 * Pure: support multiple simultaneous goal statements, for example
7327 "have a: A and b: B" (same for 'theorem' etc.); being a pure
7328 meta-level mechanism, this acts as if several individual goals had
7329 been stated separately; in particular common proof methods need to be
7330 repeated in order to cover all claims; note that a single elimination
7331 step is *not* sufficient to establish the two conjunctions, so this
7334 assume "A & B" then have A and B .. (*".." fails*)
7336 better use "obtain" in situations as above; alternative refer to
7337 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
7339 * Pure: proper integration with ``locales''; unlike the original
7340 version by Florian Kammller, Isar locales package high-level proof
7341 contexts rather than raw logical ones (e.g. we admit to include
7342 attributes everywhere); operations on locales include merge and
7343 rename; support for implicit arguments (``structures''); simultaneous
7344 type-inference over imports and text; see also HOL/ex/Locales.thy for
7347 * Pure: the following commands have been ``localized'', supporting a
7348 target locale specification "(in name)": 'lemma', 'theorem',
7349 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
7350 stored both within the locale and at the theory level (exported and
7351 qualified by the locale name);
7353 * Pure: theory goals may now be specified in ``long'' form, with
7354 ad-hoc contexts consisting of arbitrary locale elements. for example
7355 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
7356 definitions may be given, too); the result is a meta-level rule with
7357 the context elements being discharged in the obvious way;
7359 * Pure: new proof command 'using' allows to augment currently used
7360 facts after a goal statement ('using' is syntactically analogous to
7361 'apply', but acts on the goal's facts only); this allows chained facts
7362 to be separated into parts given before and after a claim, as in
7363 ``from a and b have C using d and e <proof>'';
7365 * Pure: renamed "antecedent" case to "rule_context";
7367 * Pure: new 'judgment' command records explicit information about the
7368 object-logic embedding (used by several tools internally); no longer
7369 use hard-wired "Trueprop";
7371 * Pure: added 'corollary' command;
7373 * Pure: fixed 'token_translation' command;
7375 * Pure: removed obsolete 'exported' attribute;
7377 * Pure: dummy pattern "_" in is/let is now automatically lifted over
7378 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
7379 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
7381 * Pure: method 'atomize' presents local goal premises as object-level
7382 statements (atomic meta-level propositions); setup controlled via
7383 rewrite rules declarations of 'atomize' attribute; example
7384 application: 'induct' method with proper rule statements in improper
7387 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
7388 now consider the syntactic context of assumptions, giving a better
7389 chance to get type-inference of the arguments right (this is
7390 especially important for locales);
7392 * Pure: "sorry" no longer requires quick_and_dirty in interactive
7395 * Pure/obtain: the formal conclusion "thesis", being marked as
7396 ``internal'', may no longer be reference directly in the text;
7397 potential INCOMPATIBILITY, may need to use "?thesis" in rare
7400 * Pure: generic 'sym' attribute which declares a rule both as pure
7401 'elim?' and for the 'symmetric' operation;
7403 * Pure: marginal comments ``--'' may now occur just anywhere in the
7404 text; the fixed correlation with particular command syntax has been
7407 * Pure: new method 'rules' is particularly well-suited for proof
7408 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
7409 but often produces more compact proof terms with less detours;
7411 * Pure/Provers/classical: simplified integration with pure rule
7412 attributes and methods; the classical "intro?/elim?/dest?"
7413 declarations coincide with the pure ones; the "rule" method no longer
7414 includes classically swapped intros; "intro" and "elim" methods no
7415 longer pick rules from the context; also got rid of ML declarations
7416 AddXIs/AddXEs/AddXDs; all of this has some potential for
7419 * Provers/classical: attribute 'swapped' produces classical inversions
7420 of introduction rules;
7422 * Provers/simplifier: 'simplified' attribute may refer to explicit
7423 rules instead of full simplifier context; 'iff' attribute handles
7426 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
7428 * HOL: 'recdef' now fails on unfinished automated proofs, use
7429 "(permissive)" option to recover old behavior;
7431 * HOL: 'inductive' no longer features separate (collective) attributes
7432 for 'intros' (was found too confusing);
7434 * HOL: properly declared induction rules less_induct and
7440 * HOL: moved over to sane numeral syntax; the new policy is as
7443 - 0 and 1 are polymorphic constants, which are defined on any
7444 numeric type (nat, int, real etc.);
7446 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
7447 binary representation internally;
7449 - type nat has special constructor Suc, and generally prefers Suc 0
7450 over 1::nat and Suc (Suc 0) over 2::nat;
7452 This change may cause significant problems of INCOMPATIBILITY; here
7453 are some hints on converting existing sources:
7455 - due to the new "num" token, "-0" and "-1" etc. are now atomic
7456 entities, so expressions involving "-" (unary or binary minus) need
7457 to be spaced properly;
7459 - existing occurrences of "1" may need to be constraint "1::nat" or
7460 even replaced by Suc 0; similar for old "2";
7462 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
7464 - remove all special provisions on numerals in proofs;
7466 * HOL: simp rules nat_number expand numerals on nat to Suc/0
7467 representation (depends on bin_arith_simps in the default context);
7469 * HOL: symbolic syntax for x^2 (numeral 2);
7471 * HOL: the class of all HOL types is now called "type" rather than
7472 "term"; INCOMPATIBILITY, need to adapt references to this type class
7473 in axclass/classes, instance/arities, and (usually rare) occurrences
7474 in typings (of consts etc.); internally the class is called
7475 "HOL.type", ML programs should refer to HOLogic.typeS;
7477 * HOL/record package improvements:
7478 - new derived operations "fields" to build a partial record section,
7479 "extend" to promote a fixed record to a record scheme, and
7480 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
7481 declared as simp by default;
7482 - shared operations ("more", "fields", etc.) now need to be always
7483 qualified) --- potential INCOMPATIBILITY;
7484 - removed "make_scheme" operations (use "make" with "extend") --
7486 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
7487 - provides cases/induct rules for use with corresponding Isar
7488 methods (for concrete records, record schemes, concrete more
7489 parts, and schematic more parts -- in that order);
7490 - internal definitions directly based on a light-weight abstract
7491 theory of product types over typedef rather than datatype;
7493 * HOL: generic code generator for generating executable ML code from
7494 specifications; specific support for HOL constructs such as inductive
7495 datatypes and sets, as well as recursive functions; can be invoked
7496 via 'generate_code' theory section;
7498 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
7500 * HOL: consolidated and renamed several theories. In particular:
7501 Ord.thy has been absorbed into HOL.thy
7502 String.thy has been absorbed into List.thy
7504 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
7505 (beware of argument permutation!);
7507 * HOL: linorder_less_split superseded by linorder_cases;
7509 * HOL/List: "nodups" renamed to "distinct";
7511 * HOL: added "The" definite description operator; move Hilbert's "Eps"
7512 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
7513 - Ex_def has changed, now need to use some_eq_ex
7515 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
7516 in this (rare) case use:
7518 delSWrapper "split_all_tac"
7519 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
7521 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
7524 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
7525 Isabelle's type classes, ^ on functions and relations has too general
7526 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
7527 necessary to attach explicit type constraints;
7529 * HOL/Relation: the prefix name of the infix "O" has been changed from
7530 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
7531 renamed accordingly (eg "compI" -> "rel_compI").
7533 * HOL: syntax translations now work properly with numerals and records
7536 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
7537 of "lam" -- INCOMPATIBILITY;
7539 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
7540 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
7541 renamed "Product_Type.unit";
7543 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
7545 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
7546 the "cases" method);
7548 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
7551 * HOL/IMP: updated and converted to new-style theory format; several
7552 parts turned into readable document, with proper Isar proof texts and
7553 some explanations (by Gerwin Klein);
7555 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
7557 * HOL-Hyperreal is now a logic image;
7562 * Isar: consts/constdefs supports mixfix syntax for continuous
7565 * Isar: domain package adapted to new-style theory format, e.g. see
7568 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
7569 potential INCOMPATIBILITY; now use plain induct_tac instead of former
7570 lift.induct_tac, always use UU instead of Undef;
7572 * HOLCF/IMP: updated and converted to new-style theory;
7577 * Isar: proper integration of logic-specific tools and packages,
7578 including theory commands '(co)inductive', '(co)datatype',
7579 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
7580 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
7582 * theory Main no longer includes AC; for the Axiom of Choice, base
7583 your theory on Main_ZFC;
7585 * the integer library now covers quotients and remainders, with many
7586 laws relating division to addition, multiplication, etc.;
7588 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
7589 typeless version of the formalism;
7591 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
7594 * ZF/Induct: new directory for examples of inductive definitions,
7595 including theory Multiset for multiset orderings; converted to
7596 new-style theory format;
7598 * ZF: many new theorems about lists, ordinals, etc.;
7603 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
7604 variable proof controls level of detail: 0 = no proofs (only oracle
7605 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
7606 also ref manual for further ML interfaces;
7608 * Pure/axclass: removed obsolete ML interface
7609 goal_subclass/goal_arity;
7611 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
7612 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
7613 separate tokens, so expressions involving minus need to be spaced
7616 * Pure/syntax: support non-oriented infixes, using keyword "infix"
7617 rather than "infixl" or "infixr";
7619 * Pure/syntax: concrete syntax for dummy type variables admits genuine
7620 sort constraint specifications in type inference; e.g. "x::_::foo"
7621 ensures that the type of "x" is of sort "foo" (but not necessarily a
7624 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
7625 control output of nested => (types); the default behavior is
7628 * Pure/syntax: builtin parse translation for "_constify" turns valued
7629 tokens into AST constants;
7631 * Pure/syntax: prefer later declarations of translations and print
7632 translation functions; potential INCOMPATIBILITY: need to reverse
7633 multiple declarations for same syntax element constant;
7635 * Pure/show_hyps reset by default (in accordance to existing Isar
7638 * Provers/classical: renamed addaltern to addafter, addSaltern to
7641 * Provers/clasimp: ``iff'' declarations now handle conditional rules
7644 * system: tested support for MacOS X; should be able to get Isabelle +
7645 Proof General to work in a plain Terminal after installing Poly/ML
7646 (e.g. from the Isabelle distribution area) and GNU bash alone
7647 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
7648 support requires further installations, e.g. from
7649 http://fink.sourceforge.net/);
7651 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
7653 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
7654 of 40 MB), cf. ML_OPTIONS;
7656 * system: Proof General keywords specification is now part of the
7657 Isabelle distribution (see etc/isar-keywords.el);
7659 * system: support for persistent Proof General sessions (refrain from
7660 outdating all loaded theories on startup); user may create writable
7661 logic images like this: ``isabelle -q HOL Test'';
7663 * system: smart selection of Isabelle process versus Isabelle
7664 interface, accommodates case-insensitive file systems (e.g. HFS+); may
7665 run both "isabelle" and "Isabelle" even if file names are badly
7666 damaged (executable inspects the case of the first letter of its own
7667 name); added separate "isabelle-process" and "isabelle-interface";
7669 * system: refrain from any attempt at filtering input streams; no
7670 longer support ``8bit'' encoding of old isabelle font, instead proper
7671 iso-latin characters may now be used; the related isatools
7672 "symbolinput" and "nonascii" have disappeared as well;
7674 * system: removed old "xterm" interface (the print modes "xterm" and
7675 "xterm_color" are still available for direct use in a suitable
7680 New in Isabelle99-2 (February 2001)
7681 -----------------------------------
7683 *** Overview of INCOMPATIBILITIES ***
7685 * HOL: please note that theories in the Library and elsewhere often use the
7686 new-style (Isar) format; to refer to their theorems in an ML script you must
7687 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
7689 * HOL: inductive package no longer splits induction rule aggressively,
7690 but only as far as specified by the introductions given; the old
7691 format may be recovered via ML function complete_split_rule or attribute
7692 'split_rule (complete)';
7694 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
7695 gfp_Tarski to gfp_unfold;
7697 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
7699 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
7700 relation); infix "^^" has been renamed "``"; infix "``" has been
7701 renamed "`"; "univalent" has been renamed "single_valued";
7703 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
7706 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
7708 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
7710 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
7711 consequence, it is no longer monotonic wrt. the local goal context
7712 (which is now passed through the inductive cases);
7714 * Document preparation: renamed standard symbols \<ll> to \<lless> and
7715 \<gg> to \<ggreater>;
7718 *** Document preparation ***
7720 * \isabellestyle{NAME} selects version of Isabelle output (currently
7721 available: are "it" for near math-mode best-style output, "sl" for
7722 slanted text style, and "tt" for plain type-writer; if no
7723 \isabellestyle command is given, output is according to slanted
7726 * support sub/super scripts (for single symbols only), input syntax is
7727 like this: "A\<^sup>*" or "A\<^sup>\<star>";
7729 * some more standard symbols; see Appendix A of the system manual for
7730 the complete list of symbols defined in isabellesym.sty;
7732 * improved isabelle style files; more abstract symbol implementation
7733 (should now use \isamath{...} and \isatext{...} in custom symbol
7736 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
7737 state; Note that presentation of goal states does not conform to
7738 actual human-readable proof documents. Please do not include goal
7739 states into document output unless you really know what you are doing!
7741 * proper indentation of antiquoted output with proportional LaTeX
7744 * no_document ML operator temporarily disables LaTeX document
7747 * isatool unsymbolize tunes sources for plain ASCII communication;
7752 * Pure: Isar now suffers initial goal statements to contain unbound
7753 schematic variables (this does not conform to actual readable proof
7754 documents, due to unpredictable outcome and non-compositional proof
7755 checking); users who know what they are doing may use schematic goals
7756 for Prolog-style synthesis of proven results;
7758 * Pure: assumption method (an implicit finishing) now handles actual
7761 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
7762 initial goal, declare "that" only as Pure intro (only for single
7763 steps); the "that" rule assumption may now be involved in implicit
7764 finishing, thus ".." becomes a feasible for trivial obtains;
7766 * Pure: default proof step now includes 'intro_classes'; thus trivial
7767 instance proofs may be performed by "..";
7769 * Pure: ?thesis / ?this / "..." now work for pure meta-level
7772 * Pure: more robust selection of calculational rules;
7774 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
7775 rule (as well as the assumption rule);
7777 * Pure: 'thm_deps' command visualizes dependencies of theorems and
7778 lemmas, using the graph browser tool;
7780 * Pure: predict failure of "show" in interactive mode;
7782 * Pure: 'thms_containing' now takes actual terms as arguments;
7784 * HOL: improved method 'induct' --- now handles non-atomic goals
7785 (potential INCOMPATIBILITY); tuned error handling;
7787 * HOL: cases and induct rules now provide explicit hints about the
7788 number of facts to be consumed (0 for "type" and 1 for "set" rules);
7789 any remaining facts are inserted into the goal verbatim;
7791 * HOL: local contexts (aka cases) may now contain term bindings as
7792 well; the 'cases' and 'induct' methods new provide a ?case binding for
7793 the result to be shown in each case;
7795 * HOL: added 'recdef_tc' command;
7797 * isatool convert assists in eliminating legacy ML scripts;
7802 * HOL/Library: a collection of generic theories to be used together
7803 with main HOL; the theory loader path already includes this directory
7804 by default; the following existing theories have been moved here:
7805 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
7806 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
7808 * HOL/Unix: "Some aspects of Unix file-system security", a typical
7809 modelling and verification task performed in Isabelle/HOL +
7810 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
7812 * HOL/Algebra: special summation operator SUM no longer exists, it has
7813 been replaced by setsum; infix 'assoc' now has priority 50 (like
7814 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
7815 'domain', this makes the theory consistent with mathematical
7818 * HOL basics: added overloaded operations "inverse" and "divide"
7819 (infix "/"), syntax for generic "abs" operation, generic summation
7822 * HOL/typedef: simplified package, provide more useful rules (see also
7825 * HOL/datatype: induction rule for arbitrarily branching datatypes is
7826 now expressed as a proper nested rule (old-style tactic scripts may
7827 require atomize_strip_tac to cope with non-atomic premises);
7829 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
7830 to "split_conv" (old name still available for compatibility);
7832 * HOL: improved concrete syntax for strings (e.g. allows translation
7833 rules with string literals);
7835 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
7836 and Fleuriot's mechanization of analysis, including the transcendental
7837 functions for the reals;
7839 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
7844 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
7845 "lam" is displayed as TWO lambda-symbols
7847 * CTT: theory Main now available, containing everything (that is, Bool
7853 * Pure: the Simplifier has been implemented properly as a derived rule
7854 outside of the actual kernel (at last!); the overall performance
7855 penalty in practical applications is about 50%, while reliability of
7856 the Isabelle inference kernel has been greatly improved;
7858 * print modes "brackets" and "no_brackets" control output of nested =>
7859 (types) and ==> (props); the default behaviour is "brackets";
7861 * Provers: fast_tac (and friends) now handle actual object-logic rules
7862 as assumptions as well;
7864 * system: support Poly/ML 4.0;
7866 * system: isatool install handles KDE version 1 or 2;
7870 New in Isabelle99-1 (October 2000)
7871 ----------------------------------
7873 *** Overview of INCOMPATIBILITIES ***
7875 * HOL: simplification of natural numbers is much changed; to partly
7876 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
7877 issue the following ML commands:
7879 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
7880 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
7882 * HOL: simplification no longer dives into case-expressions; this is
7883 controlled by "t.weak_case_cong" for each datatype t;
7885 * HOL: nat_less_induct renamed to less_induct;
7887 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
7888 fixsome to patch .thy and .ML sources automatically;
7890 select_equality -> some_equality
7891 select_eq_Ex -> some_eq_ex
7892 selectI2EX -> someI2_ex
7895 select1_equality -> some1_equality
7896 Eps_sym_eq -> some_sym_eq_trivial
7897 Eps_eq -> some_eq_trivial
7899 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
7901 * HOL: removed obsolete theorem binding expand_if (refer to split_if
7904 * HOL: the recursion equations generated by 'recdef' are now called
7905 f.simps instead of f.rules;
7907 * HOL: qed_spec_mp now also handles bounded ALL as well;
7909 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
7910 sometimes be needed;
7912 * HOL: the constant for "f``x" is now "image" rather than "op ``";
7914 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
7916 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
7917 product is now "<*>" instead of "Times"; the lexicographic product is
7918 now "<*lex*>" instead of "**";
7920 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
7921 of main HOL, but was unused); better use HOL's datatype package;
7923 * HOL: removed "symbols" syntax for constant "override" of theory Map;
7924 the old syntax may be recovered as follows:
7927 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
7928 (infixl "\\<oplus>" 100)
7930 * HOL/Real: "rabs" replaced by overloaded "abs" function;
7932 * HOL/ML: even fewer consts are declared as global (see theories Ord,
7933 Lfp, Gfp, WF); this only affects ML packages that refer to const names
7936 * HOL and ZF: syntax for quotienting wrt an equivalence relation
7937 changed from A/r to A//r;
7939 * ZF: new treatment of arithmetic (nat & int) may break some old
7942 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
7943 rulify -> rule_format, elimify -> elim_format, ...);
7945 * Isar/Provers: intro/elim/dest attributes changed; renamed
7946 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
7947 should have to change intro!! to intro? only); replaced "delrule" by
7950 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
7952 * Provers: strengthened force_tac by using new first_best_tac;
7954 * LaTeX document preparation: several changes of isabelle.sty (see
7958 *** Document preparation ***
7960 * formal comments (text blocks etc.) in new-style theories may now
7961 contain antiquotations of thm/prop/term/typ/text to be presented
7962 according to latex print mode; concrete syntax is like this:
7963 @{term[show_types] "f(x) = a + x"};
7965 * isatool mkdir provides easy setup of Isabelle session directories,
7966 including proper document sources;
7968 * generated LaTeX sources are now deleted after successful run
7969 (isatool document -c); may retain a copy somewhere else via -D option
7972 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
7973 style files, achieving self-contained LaTeX sources and simplifying
7976 * old-style theories now produce (crude) LaTeX output as well;
7978 * browser info session directories are now self-contained (may be put
7979 on WWW server seperately); improved graphs of nested sessions; removed
7980 graph for 'all sessions';
7982 * several improvements in isabelle style files; \isabellestyle{it}
7983 produces fake math mode output; \isamarkupheader is now \section by
7984 default; see lib/texinputs/isabelle.sty etc.;
7989 * Isar/Pure: local results and corresponding term bindings are now
7990 subject to Hindley-Milner polymorphism (similar to ML); this
7991 accommodates incremental type-inference very nicely;
7993 * Isar/Pure: new derived language element 'obtain' supports
7994 generalized existence reasoning;
7996 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
7997 support accumulation of results, without applying any rules yet;
7998 useful to collect intermediate results without explicit name
7999 references, and for use with transitivity rules with more than 2
8002 * Isar/Pure: scalable support for case-analysis type proofs: new
8003 'case' language element refers to local contexts symbolically, as
8004 produced by certain proof methods; internally, case names are attached
8005 to theorems as "tags";
8007 * Isar/Pure: theory command 'hide' removes declarations from
8008 class/type/const name spaces;
8010 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
8011 indicate potential overloading;
8013 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
8015 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
8016 "{a,b,c}" instead of {a,b,c};
8018 * Isar/Pure now provides its own version of intro/elim/dest
8019 attributes; useful for building new logics, but beware of confusion
8020 with the version in Provers/classical;
8022 * Isar/Pure: the local context of (non-atomic) goals is provided via
8023 case name 'antecedent';
8025 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
8026 to the current context is now done automatically);
8028 * Isar/Pure: theory command 'method_setup' provides a simple interface
8029 for definining proof methods in ML;
8031 * Isar/Provers: intro/elim/dest attributes changed; renamed
8032 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
8033 most cases, one should have to change intro!! to intro? only);
8034 replaced "delrule" by "rule del";
8036 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
8037 'symmetric' attribute (the latter supercedes [RS sym]);
8039 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
8040 method modifier); 'simp' method: 'only:' modifier removes loopers as
8041 well (including splits);
8043 * Isar/Provers: Simplifier and Classical methods now support all kind
8044 of modifiers used in the past, including 'cong', 'iff', etc.
8046 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
8047 of Simplifier and Classical reasoner);
8049 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
8050 now support named cases; major packages (inductive, datatype, primrec,
8051 recdef) support case names and properly name parameters;
8053 * Isar/HOL: new transitivity rules for substitution in inequalities --
8054 monotonicity conditions are extracted to be proven at end of
8057 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
8060 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
8061 split_if split_if_asm; datatype package provides theorems foo.splits =
8062 foo.split foo.split_asm for each datatype;
8064 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
8065 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
8066 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
8067 use "(cases (simplified))" method in proper proof texts);
8069 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
8071 * Isar: names of theorems etc. may be natural numbers as well;
8073 * Isar: 'pr' command: optional arguments for goals_limit and
8074 ProofContext.prems_limit; no longer prints theory contexts, but only
8077 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
8078 additional print modes to be specified; e.g. "pr(latex)" will print
8079 proof state according to the Isabelle LaTeX style;
8081 * Isar: improved support for emulating tactic scripts, including proof
8082 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
8083 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
8084 (for HOL datatypes);
8086 * Isar: simplified (more robust) goal selection of proof methods: 1st
8087 goal, all goals, or explicit goal specifier (tactic emulation); thus
8088 'proof method scripts' have to be in depth-first order;
8090 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
8092 * Isar: removed 'help' command, which hasn't been too helpful anyway;
8093 should instead use individual commands for printing items
8094 (print_commands, print_methods etc.);
8096 * Isar: added 'nothing' --- the empty list of theorems;
8101 * HOL/MicroJava: formalization of a fragment of Java, together with a
8102 corresponding virtual machine and a specification of its bytecode
8103 verifier and a lightweight bytecode verifier, including proofs of
8104 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
8105 Cornelia Pusch (see also the homepage of project Bali at
8106 http://isabelle.in.tum.de/Bali/);
8108 * HOL/Algebra: new theory of rings and univariate polynomials, by
8111 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
8112 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
8115 * HOL/Lattice: fundamental concepts of lattice theory and order
8116 structures, including duals, properties of bounds versus algebraic
8117 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
8118 Theorem for complete lattices etc.; may also serve as a demonstration
8119 for abstract algebraic reasoning using axiomatic type classes, and
8120 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
8122 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
8125 * HOL/IMPP: extension of IMP with local variables and mutually
8126 recursive procedures, by David von Oheimb;
8128 * HOL/Lambda: converted into new-style theory and document;
8130 * HOL/ex/Multiquote: example of multiple nested quotations and
8131 anti-quotations -- basically a generalized version of de-Bruijn
8132 representation; very useful in avoiding lifting of operations;
8134 * HOL/record: added general record equality rule to simpset; fixed
8135 select-update simplification procedure to handle extended records as
8136 well; admit "r" as field name;
8138 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
8139 other numeric types and also as the identity of groups, rings, etc.;
8141 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
8142 Types nat and int belong to this axclass;
8144 * HOL: greatly improved simplification involving numerals of type nat, int, real:
8145 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
8146 i*j + k + j*#3*i simplifies to #4*(i*j) + k
8147 two terms #m*u and #n*u are replaced by #(m+n)*u
8148 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
8149 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
8150 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
8152 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
8153 powerful prover for predicate logic but knows nothing of clasets; see
8154 ex/mesontest.ML and ex/mesontest2.ML for example applications;
8156 * HOL: new version of "case_tac" subsumes both boolean case split and
8157 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
8158 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
8160 * HOL: simplification no longer dives into case-expressions: only the
8161 selector expression is simplified, but not the remaining arms; to
8162 enable full simplification of case-expressions for datatype t, you may
8163 remove t.weak_case_cong from the simpset, either globally (Delcongs
8164 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
8166 * HOL/recdef: the recursion equations generated by 'recdef' for
8167 function 'f' are now called f.simps instead of f.rules; if all
8168 termination conditions are proved automatically, these simplification
8169 rules are added to the simpset, as in primrec; rules may be named
8170 individually as well, resulting in a separate list of theorems for
8173 * HOL/While is a new theory that provides a while-combinator. It
8174 permits the definition of tail-recursive functions without the
8175 provision of a termination measure. The latter is necessary once the
8176 invariant proof rule for while is applied.
8178 * HOL: new (overloaded) notation for the set of elements below/above
8179 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
8181 * HOL: theorems impI, allI, ballI bound as "strip";
8183 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
8184 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
8185 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
8187 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8189 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
8190 main HOL, but was unused);
8192 * HOL: fewer consts declared as global (e.g. have to refer to
8193 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
8195 * HOL: tuned AST representation of nested pairs, avoiding bogus output
8196 in case of overlap with user translations (e.g. judgements over
8197 tuples); (note that the underlying logical represenation is still
8203 * ZF: simplification automatically cancels common terms in arithmetic
8204 expressions over nat and int;
8206 * ZF: new treatment of nat to minimize type-checking: all operators
8207 coerce their operands to a natural number using the function natify,
8208 making the algebraic laws unconditional;
8210 * ZF: as above, for int: operators coerce their operands to an integer
8211 using the function intify;
8213 * ZF: the integer library now contains many of the usual laws for the
8214 orderings, including $<=, and monotonicity laws for $+ and $*;
8216 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
8219 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
8220 to the simplifier and classical reasoner simultaneously;
8225 * Provers: blast_tac now handles actual object-logic rules as
8226 assumptions; note that auto_tac uses blast_tac internally as well;
8228 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
8229 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
8231 * Provers: delrules now handles destruct rules as well (no longer need
8232 explicit make_elim);
8234 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
8235 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8236 use instead the strong form,
8237 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8238 in HOL, FOL and ZF the function cla_make_elim will create such rules
8239 from destruct-rules;
8241 * Provers: Simplifier.easy_setup provides a fast path to basic
8242 Simplifier setup for new object-logics;
8244 * Pure: AST translation rules no longer require constant head on LHS;
8246 * Pure: improved name spaces: ambiguous output is qualified; support
8247 for hiding of names;
8249 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
8250 XSYMBOL_HOME; no longer need to do manual configuration in most
8253 * system: compression of ML heaps images may now be controlled via -c
8254 option of isabelle and isatool usedir (currently only observed by
8257 * system: isatool installfonts may handle X-Symbol fonts as well (very
8258 useful for remote X11);
8260 * system: provide TAGS file for Isabelle sources;
8262 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
8265 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
8266 timing flag supersedes proof_timing and Toplevel.trace;
8268 * ML: new combinators |>> and |>>> for incremental transformations
8269 with secondary results (e.g. certain theory extensions):
8271 * ML: PureThy.add_defs gets additional argument to indicate potential
8272 overloading (usually false);
8274 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
8279 New in Isabelle99 (October 1999)
8280 --------------------------------
8282 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8284 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
8285 are no longer simplified. (This allows the simplifier to unfold recursive
8286 functional programs.) To restore the old behaviour, declare
8288 Delcongs [if_weak_cong];
8290 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
8293 * HOL: the predicate "inj" is now defined by translation to "inj_on";
8295 * HOL/datatype: mutual_induct_tac no longer exists --
8296 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
8298 * HOL/typedef: fixed type inference for representing set; type
8299 arguments now have to occur explicitly on the rhs as type constraints;
8301 * ZF: The con_defs part of an inductive definition may no longer refer
8302 to constants declared in the same theory;
8304 * HOL, ZF: the function mk_cases, generated by the inductive
8305 definition package, has lost an argument. To simplify its result, it
8306 uses the default simpset instead of a supplied list of theorems.
8308 * HOL/List: the constructors of type list are now Nil and Cons;
8310 * Simplifier: the type of the infix ML functions
8311 setSSolver addSSolver setSolver addSolver
8312 is now simpset * solver -> simpset where `solver' is a new abstract type
8313 for packaging solvers. A solver is created via
8314 mk_solver: string -> (thm list -> int -> tactic) -> solver
8315 where the string argument is only a comment.
8320 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
8321 decision procedure for linear arithmetic. Currently it is used for
8322 types `nat', `int', and `real' in HOL (see below); it can, should and
8323 will be instantiated for other types and logics as well.
8325 * The simplifier now accepts rewrite rules with flexible heads, eg
8326 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
8327 They are applied like any rule with a non-pattern lhs, i.e. by first-order
8333 * New Isabelle/Isar subsystem provides an alternative to traditional
8334 tactical theorem proving; together with the ProofGeneral/isar user
8335 interface it offers an interactive environment for developing human
8336 readable proof documents (Isar == Intelligible semi-automated
8337 reasoning); for further information see isatool doc isar-ref,
8338 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
8340 * improved and simplified presentation of theories: better HTML markup
8341 (including colors), graph views in several sizes; isatool usedir now
8342 provides a proper interface for user theories (via -P option); actual
8343 document preparation based on (PDF)LaTeX is available as well (for
8344 new-style theories only); see isatool doc system for more information;
8346 * native support for Proof General, both for classic Isabelle and
8349 * ML function thm_deps visualizes dependencies of theorems and lemmas,
8350 using the graph browser tool;
8352 * Isabelle manuals now also available as PDF;
8354 * theory loader rewritten from scratch (may not be fully
8355 bug-compatible); old loadpath variable has been replaced by show_path,
8356 add_path, del_path, reset_path functions; new operations such as
8357 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
8360 * improved isatool install: option -k creates KDE application icon,
8361 option -p DIR installs standalone binaries;
8363 * added ML_PLATFORM setting (useful for cross-platform installations);
8364 more robust handling of platform specific ML images for SML/NJ;
8366 * the settings environment is now statically scoped, i.e. it is never
8367 created again in sub-processes invoked from isabelle, isatool, or
8370 * path element specification '~~' refers to '$ISABELLE_HOME';
8372 * in locales, the "assumes" and "defines" parts may be omitted if
8375 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
8378 * new print_mode "HTML";
8380 * new flag show_tags controls display of tags of theorems (which are
8381 basically just comments that may be attached by some tools);
8383 * Isamode 2.6 requires patch to accomodate change of Isabelle font
8384 mode and goal output format:
8386 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
8388 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
8390 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
8391 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
8393 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
8395 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
8397 * function bind_thms stores lists of theorems (cf. bind_thm);
8399 * new shorthand tactics ftac, eatac, datac, fatac;
8401 * qed (and friends) now accept "" as result name; in that case the
8402 theorem is not stored, but proper checks and presentation of the
8405 * theorem database now also indexes constants "Trueprop", "all",
8406 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
8411 ** HOL arithmetic **
8413 * There are now decision procedures for linear arithmetic over nat and
8416 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
8417 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
8418 are treated as atomic; subformulae not involving type `nat' or `int'
8419 are ignored; quantified subformulae are ignored unless they are
8420 positive universal or negative existential. The tactic has to be
8421 invoked by hand and can be a little bit slow. In particular, the
8422 running time is exponential in the number of occurrences of `min' and
8423 `max', and `-' on `nat'.
8425 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
8426 (negated) (in)equalities among the premises and the conclusion into
8427 account (i.e. no compound formulae) and does not know about `min' and
8428 `max', and `-' on `nat'. It is fast and is used automatically by the
8431 NB: At the moment, these decision procedures do not cope with mixed
8432 nat/int formulae where the two parts interact, such as `m < n ==>
8435 * HOL/Numeral provides a generic theory of numerals (encoded
8436 efficiently as bit strings); setup for types nat/int/real is in place;
8437 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
8438 int, existing theories and proof scripts may require a few additional
8441 * integer division and remainder can now be performed on constant
8444 * many properties of integer multiplication, division and remainder
8447 * An interface to the Stanford Validity Checker (SVC) is available through the
8448 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
8449 are proved automatically. SVC must be installed separately, and its results
8450 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
8451 invocation of the underlying oracle). For SVC see
8452 http://verify.stanford.edu/SVC
8454 * IsaMakefile: the HOL-Real target now builds an actual image;
8459 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
8460 (in Isabelle/Isar) -- by Gertrud Bauer;
8462 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
8463 analysis for assembly languages with subtypes;
8465 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
8466 -- avoids syntactic ambiguities and treats state, transition, and
8467 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
8468 changed syntax and (many) tactics;
8470 * HOL/inductive: Now also handles more general introduction rules such
8471 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
8472 theorems are now maintained within the theory (maintained via the
8475 * HOL/datatype: Now also handles arbitrarily branching datatypes
8476 (using function types) such as
8478 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
8480 * HOL/record: record_simproc (part of the default simpset) takes care
8481 of selectors applied to updated records; record_split_tac is no longer
8482 part of the default claset; update_defs may now be removed from the
8483 simpset in many cases; COMPATIBILITY: old behavior achieved by
8485 claset_ref () := claset() addSWrapper record_split_wrapper;
8486 Delsimprocs [record_simproc]
8488 * HOL/typedef: fixed type inference for representing set; type
8489 arguments now have to occur explicitly on the rhs as type constraints;
8491 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
8492 names rather than an ML expression;
8494 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
8495 supplied later. Program schemes can be defined, such as
8496 "While B C s = (if B s then While B C (C s) else s)"
8497 where the well-founded relation can be chosen after B and C have been given.
8499 * HOL/List: the constructors of type list are now Nil and Cons;
8500 INCOMPATIBILITY: while [] and infix # syntax is still there, of
8501 course, ML tools referring to List.list.op # etc. have to be adapted;
8503 * HOL_quantifiers flag superseded by "HOL" print mode, which is
8504 disabled by default; run isabelle with option -m HOL to get back to
8505 the original Gordon/HOL-style output;
8507 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
8508 ALL x<=y. P, EX x<y. P, EX x<=y. P;
8510 * HOL basic syntax simplified (more orthogonal): all variants of
8511 All/Ex now support plain / symbolic / HOL notation; plain syntax for
8512 Eps operator is provided as well: "SOME x. P[x]";
8514 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
8516 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
8517 thus available for user theories;
8519 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
8520 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
8523 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
8524 several times and then mp;
8529 * the notation <<...>> is now available as a notation for sequences of
8532 * the simplifier is now installed
8534 * the axiom system has been generalized (thanks to Soren Heilmann)
8536 * the classical reasoner now has a default rule database
8541 * new primrec section allows primitive recursive functions to be given
8542 directly (as in HOL) over datatypes and the natural numbers;
8544 * new tactics induct_tac and exhaust_tac for induction (or case
8545 analysis) over datatypes and the natural numbers;
8547 * the datatype declaration of type T now defines the recursor T_rec;
8549 * simplification automatically does freeness reasoning for datatype
8552 * automatic type-inference, with AddTCs command to insert new
8553 type-checking rules;
8555 * datatype introduction rules are now added as Safe Introduction rules
8558 * the syntax "if P then x else y" is now available in addition to
8562 *** Internal programming interfaces ***
8564 * tuned simplifier trace output; new flag debug_simp;
8566 * structures Vartab / Termtab (instances of TableFun) offer efficient
8567 tables indexed by indexname_ord / term_ord (compatible with aconv);
8569 * AxClass.axclass_tac lost the theory argument;
8571 * tuned current_goals_markers semantics: begin / end goal avoids
8572 printing empty lines;
8574 * removed prs and prs_fn hook, which was broken because it did not
8575 include \n in its semantics, forcing writeln to add one
8576 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
8577 string -> unit if you really want to output text without newline;
8579 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
8580 plain output, interface builders may have to enable 'isabelle_font'
8581 mode to get Isabelle font glyphs as before;
8583 * refined token_translation interface; INCOMPATIBILITY: output length
8584 now of type real instead of int;
8586 * theory loader actions may be traced via new ThyInfo.add_hook
8587 interface (see src/Pure/Thy/thy_info.ML); example application: keep
8588 your own database of information attached to *whole* theories -- as
8589 opposed to intra-theory data slots offered via TheoryDataFun;
8591 * proper handling of dangling sort hypotheses (at last!);
8592 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
8593 extra sort hypotheses that can be witnessed from the type signature;
8594 the force_strip_shyps flag is gone, any remaining shyps are simply
8595 left in the theorem (with a warning issued by strip_shyps_warning);
8599 New in Isabelle98-1 (October 1998)
8600 ----------------------------------
8602 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8604 * several changes of automated proof tools;
8606 * HOL: major changes to the inductive and datatype packages, including
8607 some minor incompatibilities of theory syntax;
8609 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
8612 * HOL: removed duplicate thms in Arith:
8613 less_imp_add_less should be replaced by trans_less_add1
8614 le_imp_add_le should be replaced by trans_le_add1
8616 * HOL: unary minus is now overloaded (new type constraints may be
8619 * HOL and ZF: unary minus for integers is now #- instead of #~. In
8620 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
8621 now taken as an integer constant.
8623 * Pure: ML function 'theory_of' renamed to 'theory';
8629 1. Asm_full_simp_tac is now more aggressive.
8630 1. It will sometimes reorient premises if that increases their power to
8632 2. It does no longer proceed strictly from left to right but may also
8633 rotate premises to achieve further simplification.
8634 For compatibility reasons there is now Asm_lr_simp_tac which is like the
8635 old Asm_full_simp_tac in that it does not rotate premises.
8636 2. The simplifier now knows a little bit about nat-arithmetic.
8638 * Classical reasoner: wrapper mechanism for the classical reasoner now
8639 allows for selected deletion of wrappers, by introduction of names for
8640 wrapper functionals. This implies that addbefore, addSbefore,
8641 addaltern, and addSaltern now take a pair (name, tactic) as argument,
8642 and that adding two tactics with the same name overwrites the first
8643 one (emitting a warning).
8644 type wrapper = (int -> tactic) -> (int -> tactic)
8645 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
8646 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
8647 delWrapper, delSWrapper: claset * string -> claset
8648 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
8650 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
8651 semantics; addbefore now affects only the unsafe part of step_tac
8652 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
8653 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
8656 * Classical reasoner: setwrapper to setWrapper and compwrapper to
8657 compWrapper; added safe wrapper (and access functions for it);
8659 * HOL/split_all_tac is now much faster and fails if there is nothing
8660 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
8661 and the names of the automatically generated variables have changed.
8662 split_all_tac has moved within claset() from unsafe wrappers to safe
8663 wrappers, which means that !!-bound variables are split much more
8664 aggressively, and safe_tac and clarify_tac now split such variables.
8665 If this splitting is not appropriate, use delSWrapper "split_all_tac".
8666 Note: the same holds for record_split_tac, which does the job of
8667 split_all_tac for record fields.
8669 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
8670 permanently to the default simpset using Addsplits just like
8671 Addsimps. They can be removed via Delsplits just like
8672 Delsimps. Lower-case versions are also available.
8674 * HOL/Simplifier: The rule split_if is now part of the default
8675 simpset. This means that the simplifier will eliminate all occurrences
8676 of if-then-else in the conclusion of a goal. To prevent this, you can
8677 either remove split_if completely from the default simpset by
8678 `Delsplits [split_if]' or remove it in a specific call of the
8679 simplifier using `... delsplits [split_if]'. You can also add/delete
8680 other case splitting rules to/from the default simpset: every datatype
8681 generates suitable rules `split_t_case' and `split_t_case_asm' (where
8682 t is the name of the datatype).
8684 * Classical reasoner / Simplifier combination: new force_tac (and
8685 derivatives Force_tac, force) combines rewriting and classical
8686 reasoning (and whatever other tools) similarly to auto_tac, but is
8687 aimed to solve the given subgoal completely.
8692 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
8693 and `goalw': the theory is no longer needed as an explicit argument -
8694 the current theory context is used; assumptions are no longer returned
8695 at the ML-level unless one of them starts with ==> or !!; it is
8696 recommended to convert to these new commands using isatool fixgoal
8697 (backup your sources first!);
8699 * new top-level commands 'thm' and 'thms' for retrieving theorems from
8700 the current theory context, and 'theory' to lookup stored theories;
8702 * new theory section 'locale' for declaring constants, assumptions and
8703 definitions that have local scope;
8705 * new theory section 'nonterminals' for purely syntactic types;
8707 * new theory section 'setup' for generic ML setup functions
8708 (e.g. package initialization);
8710 * the distribution now includes Isabelle icons: see
8711 lib/logo/isabelle-{small,tiny}.xpm;
8713 * isatool install - install binaries with absolute references to
8716 * isatool logo -- create instances of the Isabelle logo (as EPS);
8718 * print mode 'emacs' reserved for Isamode;
8720 * support multiple print (ast) translations per constant name;
8722 * theorems involving oracles are now printed with a suffixed [!];
8727 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
8729 * HOL/inductive package reorganized and improved: now supports mutual
8735 oddI "n : EVEN ==> Suc n : ODD"
8736 evenI "n : ODD ==> Suc n : EVEN"
8738 new theorem list "elims" contains an elimination rule for each of the
8739 recursive sets; inductive definitions now handle disjunctive premises
8740 correctly (also ZF);
8742 INCOMPATIBILITIES: requires Inductive as an ancestor; component
8743 "mutual_induct" no longer exists - the induction rule is always
8744 contained in "induct";
8747 * HOL/datatype package re-implemented and greatly improved: now
8748 supports mutually recursive datatypes such as
8751 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
8752 | SUM ('a aexp) ('a aexp)
8753 | DIFF ('a aexp) ('a aexp)
8756 'a bexp = LESS ('a aexp) ('a aexp)
8757 | AND ('a bexp) ('a bexp)
8758 | OR ('a bexp) ('a bexp)
8760 as well as indirectly recursive datatypes such as
8763 ('a, 'b) term = Var 'a
8764 | App 'b ((('a, 'b) term) list)
8766 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
8767 induction on mutually / indirectly recursive datatypes.
8769 Primrec equations are now stored in theory and can be accessed via
8770 <function_name>.simps.
8774 - Theories using datatypes must now have theory Datatype as an
8776 - The specific <typename>.induct_tac no longer exists - use the
8777 generic induct_tac instead.
8778 - natE has been renamed to nat.exhaust - use exhaust_tac
8779 instead of res_inst_tac ... natE. Note that the variable
8780 names in nat.exhaust differ from the names in natE, this
8781 may cause some "fragile" proofs to fail.
8782 - The theorems split_<typename>_case and split_<typename>_case_asm
8783 have been renamed to <typename>.split and <typename>.split_asm.
8784 - Since default sorts of type variables are now handled correctly,
8785 some datatype definitions may have to be annotated with explicit
8787 - Primrec definitions no longer require function name and type
8788 of recursive argument.
8790 Consider using isatool fixdatatype to adapt your theories and proof
8791 scripts to the new package (backup your sources first!).
8794 * HOL/record package: considerably improved implementation; now
8795 includes concrete syntax for record types, terms, updates; theorems
8796 for surjective pairing and splitting !!-bound record variables; proof
8797 support is as follows:
8799 1) standard conversions (selectors or updates applied to record
8800 constructor terms) are part of the standard simpset;
8802 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
8803 made part of standard simpset and claset via addIffs;
8805 3) a tactic for record field splitting (record_split_tac) is part of
8806 the standard claset (addSWrapper);
8808 To get a better idea about these rules you may retrieve them via
8809 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
8810 the name of your record type.
8812 The split tactic 3) conceptually simplifies by the following rule:
8814 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
8816 Thus any record variable that is bound by meta-all will automatically
8817 blow up into some record constructor term, consequently the
8818 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
8819 solve record problems automatically.
8822 * reorganized the main HOL image: HOL/Integ and String loaded by
8823 default; theory Main includes everything;
8825 * automatic simplification of integer sums and comparisons, using cancellation;
8827 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
8829 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
8831 * many new identities for unions, intersections, set difference, etc.;
8833 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
8834 called split_if, split_split, split_sum_case and split_nat_case (to go
8835 with add/delsplits);
8837 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
8838 (?x::unit) = (); this is made part of the default simpset, which COULD
8839 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
8840 'Delsimprocs [unit_eq_proc];' as last resort); also note that
8841 unit_abs_eta_conv is added in order to counter the effect of
8842 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
8845 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
8848 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
8849 It and 'sym RS equals0D' are now in the default claset, giving automatic
8850 disjointness reasoning but breaking a few old proofs.
8852 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
8853 to 'converse' from 'inverse' (for compatibility with ZF and some
8856 * HOL/recdef can now declare non-recursive functions, with {} supplied as
8857 the well-founded relation;
8859 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
8860 Compl A. The "Compl" syntax remains available as input syntax for this
8863 * HOL/Update: new theory of function updates:
8864 f(a:=b) == %x. if x=a then b else f x
8865 may also be iterated as in f(a:=b,c:=d,...);
8867 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
8870 - new function list_update written xs[i:=v] that updates the i-th
8871 list position. May also be iterated as in xs[i:=a,j:=b,...].
8872 - new function `upt' written [i..j(] which generates the list
8873 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
8874 bound write [i..j], which is a shorthand for [i..j+1(].
8875 - new lexicographic orderings and corresponding wellfoundedness theorems.
8878 - removed 'pred' (predecessor) function;
8879 - generalized some theorems about n-1;
8880 - many new laws about "div" and "mod";
8881 - new laws about greatest common divisors (see theory ex/Primes);
8883 * HOL/Relation: renamed the relational operator r^-1 "converse"
8884 instead of "inverse";
8886 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
8887 of the multiset ordering;
8889 * directory HOL/Real: a construction of the reals using Dedekind cuts
8890 (not included by default);
8892 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
8894 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
8895 programs, i.e. different program variables may have different types.
8897 * calling (stac rew i) now fails if "rew" has no effect on the goal
8898 [previously, this check worked only if the rewrite rule was unconditional]
8899 Now rew can involve either definitions or equalities (either == or =).
8904 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
8905 only the theorems proved on ZF.ML;
8907 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
8908 It and 'sym RS equals0D' are now in the default claset, giving automatic
8909 disjointness reasoning but breaking a few old proofs.
8911 * ZF/Update: new theory of function updates
8912 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
8913 may also be iterated as in f(a:=b,c:=d,...);
8915 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
8917 * calling (stac rew i) now fails if "rew" has no effect on the goal
8918 [previously, this check worked only if the rewrite rule was unconditional]
8919 Now rew can involve either definitions or equalities (either == or =).
8921 * case_tac provided for compatibility with HOL
8922 (like the old excluded_middle_tac, but with subgoals swapped)
8925 *** Internal programming interfaces ***
8927 * Pure: several new basic modules made available for general use, see
8928 also src/Pure/README;
8930 * improved the theory data mechanism to support encapsulation (data
8931 kind name replaced by private Object.kind, acting as authorization
8932 key); new type-safe user interface via functor TheoryDataFun; generic
8933 print_data function becomes basically useless;
8935 * removed global_names compatibility flag -- all theory declarations
8936 are qualified by default;
8938 * module Pure/Syntax now offers quote / antiquote translation
8939 functions (useful for Hoare logic etc. with implicit dependencies);
8940 see HOL/ex/Antiquote for an example use;
8942 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
8945 * new tactical CHANGED_GOAL for checking that a tactic modifies a
8948 * Display.print_goals function moved to Locale.print_goals;
8950 * standard print function for goals supports current_goals_markers
8951 variable for marking begin of proof, end of proof, start of goal; the
8952 default is ("", "", ""); setting current_goals_markers := ("<proof>",
8953 "</proof>", "<goal>") causes SGML like tagged proof state printing,
8958 New in Isabelle98 (January 1998)
8959 --------------------------------
8961 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8963 * changed lexical syntax of terms / types: dots made part of long
8964 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
8966 * simpset (and claset) reference variable replaced by functions
8967 simpset / simpset_ref;
8969 * no longer supports theory aliases (via merge) and non-trivial
8970 implicit merge of thms' signatures;
8972 * most internal names of constants changed due to qualified names;
8974 * changed Pure/Sequence interface (see Pure/seq.ML);
8977 *** General Changes ***
8979 * hierachically structured name spaces (for consts, types, axms, thms
8980 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
8981 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
8982 isatool fixdots ensures space after dots (e.g. "%x. x"); set
8983 long_names for fully qualified output names; NOTE: ML programs
8984 (special tactics, packages etc.) referring to internal names may have
8985 to be adapted to cope with fully qualified names; in case of severe
8986 backward campatibility problems try setting 'global_names' at compile
8987 time to have enrything declared within a flat name space; one may also
8988 fine tune name declarations in theories via the 'global' and 'local'
8991 * reimplemented the implicit simpset and claset using the new anytype
8992 data filed in signatures; references simpset:simpset ref etc. are
8993 replaced by functions simpset:unit->simpset and
8994 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
8995 to patch your ML files accordingly;
8997 * HTML output now includes theory graph data for display with Java
8998 applet or isatool browser; data generated automatically via isatool
8999 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
9001 * defs may now be conditional; improved rewrite_goals_tac to handle
9002 conditional equations;
9004 * defs now admits additional type arguments, using TYPE('a) syntax;
9006 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
9007 creates a new theory node; implicit merge of thms' signatures is
9008 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
9009 transfer:theory->thm->thm in (rare) cases;
9011 * improved handling of draft signatures / theories; draft thms (and
9012 ctyps, cterms) are automatically promoted to real ones;
9014 * slightly changed interfaces for oracles: admit many per theory, named
9015 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
9017 * print_goals: optional output of const types (set show_consts and
9020 * improved output of warnings (###) and errors (***);
9022 * subgoal_tac displays a warning if the new subgoal has type variables;
9024 * removed old README and Makefiles;
9026 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
9028 * removed obsolete init_pps and init_database;
9030 * deleted the obsolete tactical STATE, which was declared by
9031 fun STATE tacfun st = tacfun st st;
9033 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
9034 (which abbreviates $HOME);
9036 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
9037 use isatool fixseq to adapt your ML programs (this works for fully
9038 qualified references to the Sequence structure only!);
9040 * use_thy no longer requires writable current directory; it always
9041 reloads .ML *and* .thy file, if either one is out of date;
9044 *** Classical Reasoner ***
9046 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
9047 tactics that use classical reasoning to simplify a subgoal without
9048 splitting it into several subgoals;
9050 * Safe_tac: like safe_tac but uses the default claset;
9055 * added simplification meta rules:
9056 (asm_)(full_)simplify: simpset -> thm -> thm;
9058 * simplifier.ML no longer part of Pure -- has to be loaded by object
9061 * added prems argument to simplification procedures;
9063 * HOL, FOL, ZF: added infix function `addsplits':
9064 instead of `<simpset> setloop (split_tac <thms>)'
9065 you can simply write `<simpset> addsplits <thms>'
9070 * TYPE('a) syntax for type reflection terms;
9072 * no longer handles consts with name "" -- declare as 'syntax' instead;
9074 * pretty printer: changed order of mixfix annotation preference (again!);
9076 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
9081 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
9082 with `addloop' of the simplifier to faciliate case splitting in premises.
9084 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
9086 * HOL/Auth: new protocol proofs including some for the Internet
9089 * HOL/Map: new theory of `maps' a la VDM;
9091 * HOL/simplifier: simplification procedures nat_cancel_sums for
9092 cancelling out common nat summands from =, <, <= (in)equalities, or
9093 differences; simplification procedures nat_cancel_factor for
9094 cancelling common factor from =, <, <= (in)equalities over natural
9095 sums; nat_cancel contains both kinds of procedures, it is installed by
9096 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
9098 * HOL/simplifier: terms of the form
9099 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
9101 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
9102 and those of the form
9103 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
9105 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
9108 Each datatype `t' now comes with a theorem `split_t_case' of the form
9110 P(t_case f1 ... fn x) =
9111 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
9113 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
9116 and a theorem `split_t_case_asm' of the form
9118 P(t_case f1 ... fn x) =
9119 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
9121 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
9123 which can be added to a simpset via `addsplits'. The existing theorems
9124 expand_list_case and expand_option_case have been renamed to
9125 split_list_case and split_option_case.
9128 - `pred n' is automatically converted to `n-1'.
9129 Users are strongly encouraged not to use `pred' any longer,
9130 because it will disappear altogether at some point.
9131 - Users are strongly encouraged to write "0 < n" rather than
9132 "n ~= 0". Theorems and proof tools have been modified towards this
9136 the function "set_of_list" has been renamed "set" (and its theorems too);
9137 the function "nth" now takes its arguments in the reverse order and
9138 has acquired the infix notation "!" as in "xs!n".
9140 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
9142 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
9143 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
9145 * HOL/record: extensible records with schematic structural subtyping
9146 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
9147 still lacks various theorems and concrete record syntax;
9152 * removed "axioms" and "generated by" sections;
9154 * replaced "ops" section by extended "consts" section, which is capable of
9155 handling the continuous function space "->" directly;
9158 . proves theorems immediately and stores them in the theory,
9159 . creates hierachical name space,
9160 . now uses normal mixfix annotations (instead of cinfix...),
9161 . minor changes to some names and values (for consistency),
9162 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
9163 . separator between mutual domain defs: changed "," to "and",
9164 . improved handling of sort constraints; now they have to
9165 appear on the left-hand side of the equations only;
9167 * fixed LAM <x,y,zs>.b syntax;
9169 * added extended adm_tac to simplifier in HOLCF -- can now discharge
9170 adm (%x. P (t x)), where P is chainfinite and t continuous;
9175 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
9176 with `addloop' of the simplifier to faciliate case splitting in premises.
9178 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
9179 in HOL, they strip ALL and --> from proved theorems;
9183 New in Isabelle94-8 (May 1997)
9184 ------------------------------
9186 *** General Changes ***
9188 * new utilities to build / run / maintain Isabelle etc. (in parts
9189 still somewhat experimental); old Makefiles etc. still functional;
9191 * new 'Isabelle System Manual';
9193 * INSTALL text, together with ./configure and ./build scripts;
9195 * reimplemented type inference for greater efficiency, better error
9196 messages and clean internal interface;
9198 * prlim command for dealing with lots of subgoals (an easier way of
9199 setting goals_limit);
9204 * supports alternative (named) syntax tables (parser and pretty
9205 printer); internal interface is provided by add_modesyntax(_i);
9207 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
9208 be used in conjunction with the Isabelle symbol font; uses the
9209 "symbols" syntax table;
9211 * added token_translation interface (may translate name tokens in
9212 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
9213 the current print_mode); IMPORTANT: user print translation functions
9214 are responsible for marking newly introduced bounds
9215 (Syntax.mark_boundT);
9217 * token translations for modes "xterm" and "xterm_color" that display
9218 names in bold, underline etc. or colors (which requires a color
9221 * infixes may now be declared with names independent of their syntax;
9223 * added typed_print_translation (like print_translation, but may
9224 access type of constant);
9227 *** Classical Reasoner ***
9229 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
9230 some limitations. Blast_tac...
9231 + ignores addss, addbefore, addafter; this restriction is intrinsic
9232 + ignores elimination rules that don't have the correct format
9233 (the conclusion MUST be a formula variable)
9234 + ignores types, which can make HOL proofs fail
9235 + rules must not require higher-order unification, e.g. apply_type in ZF
9236 [message "Function Var's argument not a bound variable" relates to this]
9237 + its proof strategy is more general but can actually be slower
9239 * substitution with equality assumptions no longer permutes other
9242 * minor changes in semantics of addafter (now called addaltern); renamed
9243 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
9244 (and access functions for it);
9246 * improved combination of classical reasoner and simplifier:
9247 + functions for handling clasimpsets
9248 + improvement of addss: now the simplifier is called _after_ the
9250 + safe variant of addss called addSss: uses safe simplifications
9251 _during_ the safe steps. It is more complete as it allows multiple
9252 instantiations of unknowns (e.g. with slow_tac).
9256 * added interface for simplification procedures (functions that
9257 produce *proven* rewrite rules on the fly, depending on current
9260 * ordering on terms as parameter (used for ordered rewriting);
9262 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
9264 * the solver is now split into a safe and an unsafe part.
9265 This should be invisible for the normal user, except that the
9266 functions setsolver and addsolver have been renamed to setSolver and
9267 addSolver; added safe_asm_full_simp_tac;
9272 * a generic induction tactic `induct_tac' which works for all datatypes and
9273 also for type `nat';
9275 * a generic case distinction tactic `exhaust_tac' which works for all
9276 datatypes and also for type `nat';
9278 * each datatype comes with a function `size';
9280 * patterns in case expressions allow tuple patterns as arguments to
9281 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
9283 * primrec now also works with type nat;
9285 * recdef: a new declaration form, allows general recursive functions to be
9286 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
9288 * the constant for negation has been renamed from "not" to "Not" to
9289 harmonize with FOL, ZF, LK, etc.;
9291 * HOL/ex/LFilter theory of a corecursive "filter" functional for
9294 * HOL/Modelcheck demonstrates invocation of model checker oracle;
9296 * HOL/ex/Ring.thy declares cring_simp, which solves equational
9297 problems in commutative rings, using axiomatic type classes for + and *;
9299 * more examples in HOL/MiniML and HOL/Auth;
9301 * more default rewrite rules for quantifiers, union/intersection;
9303 * a new constant `arbitrary == @x.False';
9305 * HOLCF/IOA replaces old HOL/IOA;
9307 * HOLCF changes: derived all rules and arities
9308 + axiomatic type classes instead of classes
9309 + typedef instead of faking type definitions
9310 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
9311 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
9312 + eliminated the types void, one, tr
9313 + use unit lift and bool lift (with translations) instead of one and tr
9314 + eliminated blift from Lift3.thy (use Def instead of blift)
9315 all eliminated rules are derived as theorems --> no visible changes ;
9320 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
9321 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
9322 as ZF_cs addSIs [equalityI];
9326 New in Isabelle94-7 (November 96)
9327 ---------------------------------
9329 * allowing negative levels (as offsets) in prlev and choplev;
9331 * super-linear speedup for large simplifications;
9333 * FOL, ZF and HOL now use miniscoping: rewriting pushes
9334 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
9335 FAIL); can suppress it using the command Delsimps (ex_simps @
9336 all_simps); De Morgan laws are also now included, by default;
9338 * improved printing of ==> : ~:
9340 * new object-logic "Sequents" adds linear logic, while replacing LK
9341 and Modal (thanks to Sara Kalvala);
9343 * HOL/Auth: correctness proofs for authentication protocols;
9345 * HOL: new auto_tac combines rewriting and classical reasoning (many
9346 examples on HOL/Auth);
9348 * HOL: new command AddIffs for declaring theorems of the form P=Q to
9349 the rewriter and classical reasoner simultaneously;
9351 * function uresult no longer returns theorems in "standard" format;
9352 regain previous version by: val uresult = standard o uresult;
9359 * oracles -- these establish an interface between Isabelle and trusted
9360 external reasoners, which may deliver results as theorems;
9362 * proof objects (in particular record all uses of oracles);
9364 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
9366 * "constdefs" section in theory files;
9368 * "primrec" section (HOL) no longer requires names;
9370 * internal type "tactic" now simply "thm -> thm Sequence.seq";
9377 * reduced space requirements;
9379 * automatic HTML generation from theories;
9381 * theory files no longer require "..." (quotes) around most types;
9383 * new examples, including two proofs of the Church-Rosser theorem;
9385 * non-curried (1994) version of HOL is no longer distributed;
9392 * greatly reduced space requirements;
9394 * theory files (.thy) no longer require \...\ escapes at line breaks;
9396 * searchable theorem database (see the section "Retrieving theorems" on
9397 page 8 of the Reference Manual);
9399 * new examples, including Grabczewski's monumental case study of the
9402 * The previous version of HOL renamed to Old_HOL;
9404 * The new version of HOL (previously called CHOL) uses a curried syntax
9405 for functions. Application looks like f a b instead of f(a,b);
9407 * Mutually recursive inductive definitions finally work in HOL;
9409 * In ZF, pattern-matching on tuples is now available in all abstractions and
9410 translates to the operator "split";
9417 * new infix operator, addss, allowing the classical reasoner to
9418 perform simplification at each step of its search. Example:
9419 fast_tac (cs addss ss)
9421 * a new logic, CHOL, the same as HOL, but with a curried syntax
9422 for functions. Application looks like f a b instead of f(a,b). Also pairs
9423 look like (a,b) instead of <a,b>;
9425 * PLEASE NOTE: CHOL will eventually replace HOL!
9427 * In CHOL, pattern-matching on tuples is now available in all abstractions.
9428 It translates to the operator "split". A new theory of integers is available;
9430 * In ZF, integer numerals now denote two's-complement binary integers.
9431 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
9433 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
9434 of the Axiom of Choice;
9441 * Significantly faster resolution;
9443 * the different sections in a .thy file can now be mixed and repeated
9446 * Database of theorems for FOL, HOL and ZF. New
9447 commands including qed, qed_goal and bind_thm store theorems in the database.
9449 * Simple database queries: return a named theorem (get_thm) or all theorems of
9450 a given theory (thms_of), or find out what theory a theorem was proved in
9453 * Bugs fixed in the inductive definition and datatype packages;
9455 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
9456 and HOL_dup_cs obsolete;
9458 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
9461 * Simpler definition of function space in ZF;
9463 * new results about cardinal and ordinal arithmetic in ZF;
9465 * 'subtype' facility in HOL for introducing new types as subsets of existing
9468 :mode=text:wrap=hard:maxLineLen=72: