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 Transfer package:
662 - transfer_rule attribute: Maintains a collection of transfer rules,
663 which relate constants at two different types. Transfer rules may
664 relate different type instances of the same polymorphic constant,
665 or they may relate an operation on a raw type to a corresponding
666 operation on an abstract type (quotient or subtype). For example:
668 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
669 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
671 - transfer method: Replaces a subgoal on abstract types with an
672 equivalent subgoal on the corresponding raw types. Constants are
673 replaced with corresponding ones according to the transfer rules.
674 Goals are generalized over all free variables by default; this is
675 necessary for variables whose types changes, but can be overridden
676 for specific variables with e.g. 'transfer fixing: x y z'.
678 - relator_eq attribute: Collects identity laws for relators of
679 various type constructors, e.g. "list_all2 (op =) = (op =)". The
680 transfer method uses these lemmas to infer transfer rules for
681 non-polymorphic constants on the fly.
683 - transfer_prover method: Assists with proving a transfer rule for a
684 new constant, provided the constant is defined in terms of other
685 constants that already have transfer rules. It should be applied
686 after unfolding the constant definitions.
688 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
689 from type nat to type int.
691 * New Lifting package:
693 - lift_definition command: Defines operations on an abstract type in
694 terms of a corresponding operation on a representation type. Example
697 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
700 Users must discharge a respectfulness proof obligation when each
701 constant is defined. (For a type copy, i.e. a typedef with UNIV,
702 the proof is discharged automatically.) The obligation is
703 presented in a user-friendly, readable form; a respectfulness
704 theorem in the standard format and a transfer rule are generated
707 - Integration with code_abstype: For typedefs (e.g. subtypes
708 corresponding to a datatype invariant, such as dlist),
709 lift_definition generates a code certificate theorem and sets up
710 code generation for each constant.
712 - setup_lifting command: Sets up the Lifting package to work with
713 a user-defined type. The user must provide either a quotient
714 theorem or a type_definition theorem. The package configures
715 transfer rules for equality and quantifiers on the type, and sets
716 up the lift_definition command to work with the type.
718 - Usage examples: See Quotient_Examples/Lift_DList.thy,
719 Quotient_Examples/Lift_RBT.thy, Word/Word.thy and
724 - The 'quotient_type' command now supports a 'morphisms' option with
725 rep and abs functions, similar to typedef.
727 - 'quotient_type' sets up new types to work with the Lifting and
728 Transfer packages, as with 'setup_lifting'.
730 - The 'quotient_definition' command now requires the user to prove a
731 respectfulness property at the point where the constant is
732 defined, similar to lift_definition; INCOMPATIBILITY. Users are
733 encouraged to use lift_definition + transfer instead of
734 quotient_definition + descending, which will eventually be
737 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
738 accordingly, INCOMPATIBILITY.
740 * New diagnostic command 'find_unused_assms' to find potentially
741 superfluous assumptions in theorems using Quickcheck.
745 - Quickcheck returns variable assignments as counterexamples, which
746 allows to reveal the underspecification of functions under test.
747 For example, refuting "hd xs = x", it presents the variable
748 assignment xs = [] and x = a1 as a counterexample, assuming that
749 any property is false whenever "hd []" occurs in it.
751 These counterexample are marked as potentially spurious, as
752 Quickcheck also returns "xs = []" as a counterexample to the
753 obvious theorem "hd xs = hd xs".
755 After finding a potentially spurious counterexample, Quickcheck
756 continues searching for genuine ones.
758 By default, Quickcheck shows potentially spurious and genuine
759 counterexamples. The option "genuine_only" sets quickcheck to only
760 show genuine counterexamples.
762 - The command 'quickcheck_generator' creates random and exhaustive
763 value generators for a given type and operations.
765 It generates values by using the operations as if they were
766 constructors of that type.
768 - Support for multisets.
770 - Added "use_subtype" options.
772 - Added "quickcheck_locale" configuration to specify how to process
773 conjectures in a locale context.
776 - Fixed infinite loop caused by the 'peephole_optim' option and
777 affecting 'rat' and 'real'.
780 - Integrated more tightly with SPASS, as described in the ITP 2012 paper "More
781 SPASS with Isabelle".
782 - Made it try "smt" as a fallback if "metis" fails or times out.
783 - Added support for the following provers: Alt-Ergo (via Why3 and TFF1),
785 - Replaced remote E-SInE with remote Satallax in the default setup.
786 - Sped up the minimizer.
787 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
788 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
789 - Renamed "sound" option to "strict".
792 - Added possibility to specify lambda translations scheme as a
793 parenthesized argument (e.g., "by (metis (lifting) ...)").
796 - Renamed "smt_fixed" option to "smt_read_only_certificates".
799 - Renamed from 'try_methods'. INCOMPATIBILITY.
801 * New "eventually_elim" method as a generalized variant of the
802 eventually_elim* rules. Supports structured proofs.
804 * HOL/TPTP: support to parse and import TPTP problems (all languages)
810 * New "case_product" attribute (see HOL).
815 * Greater support for structured proofs involving induction or case
818 * Much greater use of mathematical symbols.
820 * Removal of many ML theorem bindings. INCOMPATIBILITY.
825 * Antiquotation @{keyword "name"} produces a parser for outer syntax
826 from a minor keyword introduced via theory header declaration.
828 * Antiquotation @{command_spec "name"} produces the
829 Outer_Syntax.command_spec from a major keyword introduced via theory
830 header declaration; it can be passed to Outer_Syntax.command etc.
832 * Local_Theory.define no longer hard-wires default theorem name
833 "foo_def", but retains the binding as given. If that is Binding.empty
834 / Attrib.empty_binding, the result is not registered as user-level
835 fact. The Local_Theory.define_internal variant allows to specify a
836 non-empty name (used for the foundation in the background theory),
837 while omitting the fact binding in the user-context. Potential
838 INCOMPATIBILITY for derived definitional packages: need to specify
839 naming policy for primitive definitions more explicitly.
841 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
842 conformance with similar operations in structure Term and Logic.
844 * Antiquotation @{attributes [...]} embeds attribute source
845 representation into the ML text, which is particularly useful with
846 declarations like Local_Theory.note.
848 * Structure Proof_Context follows standard naming scheme. Old
849 ProofContext has been discontinued. INCOMPATIBILITY.
851 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
852 change of semantics: update is applied to auxiliary local theory
855 * Modernized some old-style infix operations:
857 addeqcongs ~> Simplifier.add_eqcong
858 deleqcongs ~> Simplifier.del_eqcong
859 addcongs ~> Simplifier.add_cong
860 delcongs ~> Simplifier.del_cong
861 setmksimps ~> Simplifier.set_mksimps
862 setmkcong ~> Simplifier.set_mkcong
863 setmksym ~> Simplifier.set_mksym
864 setmkeqTrue ~> Simplifier.set_mkeqTrue
865 settermless ~> Simplifier.set_termless
866 setsubgoaler ~> Simplifier.set_subgoaler
867 addsplits ~> Splitter.add_split
868 delsplits ~> Splitter.del_split
873 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
876 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
877 notation, which is useful for the jEdit file browser, for example.
881 New in Isabelle2011-1 (October 2011)
882 ------------------------------------
886 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
887 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
889 - Management of multiple theory files directly from the editor
890 buffer store -- bypassing the file-system (no requirement to save
893 - Markup of formal entities within the text buffer, with semantic
894 highlighting, tooltips and hyperlinks to jump to defining source
897 - Improved text rendering, with sub/superscripts in the source
898 buffer (including support for copy/paste wrt. output panel, HTML
899 theory output and other non-Isabelle text boxes).
901 - Refined scheduling of proof checking and printing of results,
902 based on interactive editor view. (Note: jEdit folding and
903 narrowing allows to restrict buffer perspectives explicitly.)
905 - Reduced CPU performance requirements, usable on machines with few
908 - Reduced memory requirements due to pruning of unused document
909 versions (garbage collection).
911 See also ~~/src/Tools/jEdit/README.html for further information,
912 including some remaining limitations.
914 * Theory loader: source files are exclusively located via the master
915 directory of each theory node (where the .thy file itself resides).
916 The global load path (such as src/HOL/Library) has been discontinued.
917 Note that the path element ~~ may be used to reference theories in the
918 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
921 * Theory loader: source files are identified by content via SHA1
922 digests. Discontinued former path/modtime identification and optional
923 ISABELLE_FILE_IDENT plugin scripts.
925 * Parallelization of nested Isar proofs is subject to
926 Goal.parallel_proofs_threshold (default 100). See also isabelle
929 * Name space: former unsynchronized references are now proper
930 configuration options, with more conventional names:
932 long_names ~> names_long
933 short_names ~> names_short
934 unique_names ~> names_unique
936 Minor INCOMPATIBILITY, need to declare options in context like this:
938 declare [[names_unique = false]]
940 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
941 that the result needs to be unique, which means fact specifications
942 may have to be refined after enriching a proof context.
944 * Attribute "case_names" has been refined: the assumptions in each case
945 can be named now by following the case name with [name1 name2 ...].
947 * Isabelle/Isar reference manual has been updated and extended:
948 - "Synopsis" provides a catalog of main Isar language concepts.
949 - Formal references in syntax diagrams, via @{rail} antiquotation.
950 - Updated material from classic "ref" manual, notably about
951 "Classical Reasoner".
956 * Class bot and top require underlying partial order rather than
957 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
959 * Class complete_lattice: generalized a couple of lemmas from sets;
960 generalized theorems INF_cong and SUP_cong. New type classes for
961 complete boolean algebras and complete linear orders. Lemmas
962 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
963 class complete_linorder.
965 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
966 Sup_fun_def, Inf_apply, Sup_apply.
968 Removed redundant lemmas (the right hand side gives hints how to
969 replace them for (metis ...), or (simp only: ...) proofs):
971 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
972 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
973 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
974 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
975 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
976 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
977 Inter_def ~> INF_def, image_def
978 Union_def ~> SUP_def, image_def
979 INT_eq ~> INF_def, and image_def
980 UN_eq ~> SUP_def, and image_def
981 INF_subset ~> INF_superset_mono [OF _ order_refl]
983 More consistent and comprehensive names:
985 INTER_eq_Inter_image ~> INF_def
986 UNION_eq_Union_image ~> SUP_def
990 INF_leI2 ~> INF_lower2
991 le_INFI ~> INF_greatest
993 le_SUPI2 ~> SUP_upper2
995 INFI_bool_eq ~> INF_bool_eq
996 SUPR_bool_eq ~> SUP_bool_eq
997 INFI_apply ~> INF_apply
998 SUPR_apply ~> SUP_apply
999 INTER_def ~> INTER_eq
1000 UNION_def ~> UNION_eq
1004 * Renamed theory Complete_Lattice to Complete_Lattices.
1007 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
1008 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
1009 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
1010 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
1012 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
1013 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
1014 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
1017 * Added syntactic classes "inf" and "sup" for the respective
1018 constants. INCOMPATIBILITY: Changes in the argument order of the
1019 (mostly internal) locale predicates for some derived classes.
1021 * Theorem collections ball_simps and bex_simps do not contain theorems
1022 referring to UNION any longer; these have been moved to collection
1023 UN_ball_bex_simps. INCOMPATIBILITY.
1025 * Theory Archimedean_Field: floor now is defined as parameter of a
1026 separate type class floor_ceiling.
1028 * Theory Finite_Set: more coherent development of fold_set locales:
1030 locale fun_left_comm ~> locale comp_fun_commute
1031 locale fun_left_comm_idem ~> locale comp_fun_idem
1033 Both use point-free characterization; interpretation proofs may need
1034 adjustment. INCOMPATIBILITY.
1036 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
1037 accordance with standard mathematical terminology. INCOMPATIBILITY.
1039 * Theory Complex_Main: The locale interpretations for the
1040 bounded_linear and bounded_bilinear locales have been removed, in
1041 order to reduce the number of duplicate lemmas. Users must use the
1042 original names for distributivity theorems, potential INCOMPATIBILITY.
1044 divide.add ~> add_divide_distrib
1045 divide.diff ~> diff_divide_distrib
1046 divide.setsum ~> setsum_divide_distrib
1047 mult.add_right ~> right_distrib
1048 mult.diff_right ~> right_diff_distrib
1049 mult_right.setsum ~> setsum_right_distrib
1050 mult_left.diff ~> left_diff_distrib
1052 * Theory Complex_Main: Several redundant theorems have been removed or
1053 replaced by more general versions. INCOMPATIBILITY.
1055 real_diff_def ~> minus_real_def
1056 real_divide_def ~> divide_real_def
1057 real_less_def ~> less_le
1058 real_abs_def ~> abs_real_def
1059 real_sgn_def ~> sgn_real_def
1060 real_mult_commute ~> mult_commute
1061 real_mult_assoc ~> mult_assoc
1062 real_mult_1 ~> mult_1_left
1063 real_add_mult_distrib ~> left_distrib
1064 real_zero_not_eq_one ~> zero_neq_one
1065 real_mult_inverse_left ~> left_inverse
1066 INVERSE_ZERO ~> inverse_zero
1067 real_le_refl ~> order_refl
1068 real_le_antisym ~> order_antisym
1069 real_le_trans ~> order_trans
1070 real_le_linear ~> linear
1071 real_le_eq_diff ~> le_iff_diff_le_0
1072 real_add_left_mono ~> add_left_mono
1073 real_mult_order ~> mult_pos_pos
1074 real_mult_less_mono2 ~> mult_strict_left_mono
1075 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
1076 real_0_le_divide_iff ~> zero_le_divide_iff
1077 realpow_two_disj ~> power2_eq_iff
1078 real_squared_diff_one_factored ~> square_diff_one_factored
1079 realpow_two_diff ~> square_diff_square_factored
1080 reals_complete2 ~> complete_real
1081 real_sum_squared_expand ~> power2_sum
1082 exp_ln_eq ~> ln_unique
1084 expi_zero ~> exp_zero
1085 lemma_DERIV_subst ~> DERIV_cong
1086 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
1087 LIMSEQ_const ~> tendsto_const
1088 LIMSEQ_norm ~> tendsto_norm
1089 LIMSEQ_add ~> tendsto_add
1090 LIMSEQ_minus ~> tendsto_minus
1091 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
1092 LIMSEQ_diff ~> tendsto_diff
1093 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
1094 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
1095 LIMSEQ_mult ~> tendsto_mult
1096 LIMSEQ_inverse ~> tendsto_inverse
1097 LIMSEQ_divide ~> tendsto_divide
1098 LIMSEQ_pow ~> tendsto_power
1099 LIMSEQ_setsum ~> tendsto_setsum
1100 LIMSEQ_setprod ~> tendsto_setprod
1101 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
1102 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
1103 LIMSEQ_imp_rabs ~> tendsto_rabs
1104 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
1105 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
1106 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
1107 LIMSEQ_Complex ~> tendsto_Complex
1108 LIM_ident ~> tendsto_ident_at
1109 LIM_const ~> tendsto_const
1110 LIM_add ~> tendsto_add
1111 LIM_add_zero ~> tendsto_add_zero
1112 LIM_minus ~> tendsto_minus
1113 LIM_diff ~> tendsto_diff
1114 LIM_norm ~> tendsto_norm
1115 LIM_norm_zero ~> tendsto_norm_zero
1116 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
1117 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
1118 LIM_rabs ~> tendsto_rabs
1119 LIM_rabs_zero ~> tendsto_rabs_zero
1120 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
1121 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
1122 LIM_compose ~> tendsto_compose
1123 LIM_mult ~> tendsto_mult
1124 LIM_scaleR ~> tendsto_scaleR
1125 LIM_of_real ~> tendsto_of_real
1126 LIM_power ~> tendsto_power
1127 LIM_inverse ~> tendsto_inverse
1128 LIM_sgn ~> tendsto_sgn
1129 isCont_LIM_compose ~> isCont_tendsto_compose
1130 bounded_linear.LIM ~> bounded_linear.tendsto
1131 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
1132 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
1133 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
1134 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
1135 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
1136 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
1138 * Theory Complex_Main: The definition of infinite series was
1139 generalized. Now it is defined on the type class {topological_space,
1140 comm_monoid_add}. Hence it is useable also for extended real numbers.
1142 * Theory Complex_Main: The complex exponential function "expi" is now
1143 a type-constrained abbreviation for "exp :: complex => complex"; thus
1144 several polymorphic lemmas about "exp" are now applicable to "expi".
1148 - Theory Library/Code_Char_ord provides native ordering of
1149 characters in the target language.
1151 - Commands code_module and code_library are legacy, use export_code
1154 - Method "evaluation" is legacy, use method "eval" instead.
1156 - Legacy evaluator "SML" is deactivated by default. May be
1157 reactivated by the following theory command:
1159 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
1161 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
1163 * New proof method "induction" that gives induction hypotheses the
1164 name "IH", thus distinguishing them from further hypotheses that come
1165 from rule induction. The latter are still called "hyps". Method
1166 "induction" is a thin wrapper around "induct" and follows the same
1169 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
1170 still available as a legacy feature for some time.
1173 - Added "need" and "total_consts" options.
1174 - Reintroduced "show_skolems" option by popular demand.
1175 - Renamed attribute: nitpick_def ~> nitpick_unfold.
1179 - Use quasi-sound (and efficient) translations by default.
1180 - Added support for the following provers: E-ToFoF, LEO-II,
1181 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
1182 - Automatically preplay and minimize proofs before showing them if
1183 this can be done within reasonable time.
1184 - sledgehammer available_provers ~> sledgehammer supported_provers.
1186 - Added "preplay_timeout", "slicing", "type_enc", "sound",
1187 "max_mono_iters", and "max_new_mono_instances" options.
1188 - Removed "explicit_apply" and "full_types" options as well as "Full
1189 Types" Proof General menu item. INCOMPATIBILITY.
1192 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
1193 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
1197 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
1198 "elim:" options. INCOMPATIBILITY.
1199 - Introduced 'try' that not only runs 'try_methods' but also
1200 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
1203 - Added "eval" option to evaluate terms for the found counterexample
1204 (currently only supported by the default (exhaustive) tester).
1205 - Added post-processing of terms to obtain readable counterexamples
1206 (currently only supported by the default (exhaustive) tester).
1207 - New counterexample generator quickcheck[narrowing] enables
1208 narrowing-based testing. Requires the Glasgow Haskell compiler
1209 with its installation location defined in the Isabelle settings
1210 environment as ISABELLE_GHC.
1211 - Removed quickcheck tester "SML" based on the SML code generator
1212 (formly in HOL/Library).
1214 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
1215 use 'partial_function' instead.
1217 * Theory Library/Extended_Reals replaces now the positive extended
1218 reals found in probability theory. This file is extended by
1219 Multivariate_Analysis/Extended_Real_Limits.
1221 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
1222 from where it must be imported explicitly if it is really required.
1225 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
1226 been moved here. INCOMPATIBILITY.
1228 * Theory Library/Saturated provides type of numbers with saturated
1231 * Theory Library/Product_Lattice defines a pointwise ordering for the
1232 product type 'a * 'b, and provides instance proofs for various order
1233 and lattice type classes.
1235 * Theory Library/Countable now provides the "countable_datatype" proof
1236 method for proving "countable" class instances for datatypes.
1238 * Theory Library/Cset_Monad allows do notation for computable sets
1239 (cset) via the generic monad ad-hoc overloading facility.
1241 * Library: Theories of common data structures are split into theories
1242 for implementation, an invariant-ensuring type, and connection to an
1243 abstract type. INCOMPATIBILITY.
1245 - RBT is split into RBT and RBT_Mapping.
1246 - AssocList is split and renamed into AList and AList_Mapping.
1247 - DList is split into DList_Impl, DList, and DList_Cset.
1248 - Cset is split into Cset and List_Cset.
1250 * Theory Library/Nat_Infinity has been renamed to
1251 Library/Extended_Nat, with name changes of the following types and
1254 type inat ~> type enat
1256 Infty ~> infinity (overloaded)
1260 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
1261 been renamed accordingly. INCOMPATIBILITY.
1263 * Session Multivariate_Analysis: The euclidean_space type class now
1264 fixes a constant "Basis :: 'a set" consisting of the standard
1265 orthonormal basis for the type. Users now have the option of
1266 quantifying over this set instead of using the "basis" function, e.g.
1267 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
1269 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
1270 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
1271 "Cart_nth" and "Cart_lambda" have been respectively renamed to
1272 "vec_nth" and "vec_lambda"; theorems mentioning those names have
1273 changed to match. Definition theorems for overloaded constants now use
1274 the standard "foo_vec_def" naming scheme. A few other theorems have
1275 been renamed as follows (INCOMPATIBILITY):
1277 Cart_eq ~> vec_eq_iff
1278 dist_nth_le_cart ~> dist_vec_nth_le
1279 tendsto_vector ~> vec_tendstoI
1280 Cauchy_vector ~> vec_CauchyI
1282 * Session Multivariate_Analysis: Several duplicate theorems have been
1283 removed, and other theorems have been renamed or replaced with more
1284 general versions. INCOMPATIBILITY.
1286 finite_choice ~> finite_set_choice
1287 eventually_conjI ~> eventually_conj
1288 eventually_and ~> eventually_conj_iff
1289 eventually_false ~> eventually_False
1290 setsum_norm ~> norm_setsum
1291 Lim_sequentially ~> LIMSEQ_def
1292 Lim_ident_at ~> LIM_ident
1293 Lim_const ~> tendsto_const
1294 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
1295 Lim_neg ~> tendsto_minus
1296 Lim_add ~> tendsto_add
1297 Lim_sub ~> tendsto_diff
1298 Lim_mul ~> tendsto_scaleR
1299 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
1300 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
1301 Lim_linear ~> bounded_linear.tendsto
1302 Lim_component ~> tendsto_euclidean_component
1303 Lim_component_cart ~> tendsto_vec_nth
1304 Lim_inner ~> tendsto_inner [OF tendsto_const]
1305 dot_lsum ~> inner_setsum_left
1306 dot_rsum ~> inner_setsum_right
1307 continuous_cmul ~> continuous_scaleR [OF continuous_const]
1308 continuous_neg ~> continuous_minus
1309 continuous_sub ~> continuous_diff
1310 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
1311 continuous_mul ~> continuous_scaleR
1312 continuous_inv ~> continuous_inverse
1313 continuous_at_within_inv ~> continuous_at_within_inverse
1314 continuous_at_inv ~> continuous_at_inverse
1315 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
1316 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
1317 continuous_at_component ~> continuous_component [OF continuous_at_id]
1318 continuous_on_neg ~> continuous_on_minus
1319 continuous_on_sub ~> continuous_on_diff
1320 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
1321 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
1322 continuous_on_mul ~> continuous_on_scaleR
1323 continuous_on_mul_real ~> continuous_on_mult
1324 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
1325 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
1326 continuous_on_inverse ~> continuous_on_inv
1327 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
1328 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
1329 subset_interior ~> interior_mono
1330 subset_closure ~> closure_mono
1331 closure_univ ~> closure_UNIV
1332 real_arch_lt ~> reals_Archimedean2
1333 real_arch ~> reals_Archimedean3
1334 real_abs_norm ~> abs_norm_cancel
1335 real_abs_sub_norm ~> norm_triangle_ineq3
1336 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
1338 * Session HOL-Probability:
1339 - Caratheodory's extension lemma is now proved for ring_of_sets.
1340 - Infinite products of probability measures are now available.
1341 - Sigma closure is independent, if the generator is independent
1342 - Use extended reals instead of positive extended
1343 reals. INCOMPATIBILITY.
1345 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
1347 expand_fun_below ~> fun_below_iff
1348 below_fun_ext ~> fun_belowI
1349 expand_cfun_eq ~> cfun_eq_iff
1350 ext_cfun ~> cfun_eqI
1351 expand_cfun_below ~> cfun_below_iff
1352 below_cfun_ext ~> cfun_belowI
1353 monofun_fun_fun ~> fun_belowD
1354 monofun_fun_arg ~> monofunE
1355 monofun_lub_fun ~> adm_monofun [THEN admD]
1356 cont_lub_fun ~> adm_cont [THEN admD]
1357 cont2cont_Rep_CFun ~> cont2cont_APP
1358 cont_Rep_CFun_app ~> cont_APP_app
1359 cont_Rep_CFun_app_app ~> cont_APP_app_app
1360 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
1361 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
1362 contlub_cfun ~> lub_APP [symmetric]
1363 contlub_LAM ~> lub_LAM [symmetric]
1366 lift_distinct1 ~> lift.distinct(1)
1367 lift_distinct2 ~> lift.distinct(2)
1368 Def_not_UU ~> lift.distinct(2)
1369 Def_inject ~> lift.inject
1370 below_UU_iff ~> below_bottom_iff
1371 eq_UU_iff ~> eq_bottom_iff
1374 *** Document preparation ***
1376 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
1377 isar-ref manual, both for description and actual application of the
1380 * Antiquotation @{value} evaluates the given term and presents its
1383 * Antiquotations: term style "isub" provides ad-hoc conversion of
1384 variables x1, y23 into subscripted form x\<^isub>1,
1385 y\<^isub>2\<^isub>3.
1387 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
1388 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
1390 * Localized \isabellestyle switch can be used within blocks or groups
1393 \isabellestyle{it} %preferred default
1394 {\isabellestylett @{text "typewriter stuff"}}
1396 * Discontinued special treatment of hard tabulators. Implicit
1397 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
1403 * The inner syntax of sort/type/term/prop supports inlined YXML
1404 representations within quoted string tokens. By encoding logical
1405 entities via Term_XML (in ML or Scala) concrete syntax can be
1406 bypassed, which is particularly useful for producing bits of text
1407 under external program control.
1409 * Antiquotations for ML and document preparation are managed as theory
1410 data, which requires explicit setup.
1412 * Isabelle_Process.is_active allows tools to check if the official
1413 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
1414 (better known as Proof General).
1416 * Structure Proof_Context follows standard naming scheme. Old
1417 ProofContext is still available for some time as legacy alias.
1419 * Structure Timing provides various operations for timing; supersedes
1420 former start_timing/end_timing etc.
1422 * Path.print is the official way to show file-system paths to users
1423 (including quotes etc.).
1425 * Inner syntax: identifiers in parse trees of generic categories
1426 "logic", "aprop", "idt" etc. carry position information (disguised as
1427 type constraints). Occasional INCOMPATIBILITY with non-compliant
1428 translations that choke on unexpected type constraints. Positions can
1429 be stripped in ML translations via Syntax.strip_positions /
1430 Syntax.strip_positions_ast, or via the syntax constant
1431 "_strip_positions" within parse trees. As last resort, positions can
1432 be disabled via the configuration option Syntax.positions, which is
1433 called "syntax_positions" in Isar attribute syntax.
1435 * Discontinued special status of various ML structures that contribute
1436 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
1437 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
1438 refer directly to Ast.Constant, Lexicon.is_identifier,
1439 Syntax_Trans.mk_binder_tr etc.
1441 * Typed print translation: discontinued show_sorts argument, which is
1442 already available via context of "advanced" translation.
1444 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
1445 goal states; body tactic needs to address all subgoals uniformly.
1447 * Slightly more special eq_list/eq_set, with shortcut involving
1448 pointer equality (assumes that eq relation is reflexive).
1450 * Classical tactics use proper Proof.context instead of historic types
1451 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
1452 operate directly on Proof.context. Raw type claset retains its use as
1453 snapshot of the classical context, which can be recovered via
1454 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
1455 INCOMPATIBILITY, classical tactics and derived proof methods require
1456 proper Proof.context.
1461 * Discontinued support for Poly/ML 5.2, which was the last version
1462 without proper multithreading and TimeLimit implementation.
1464 * Discontinued old lib/scripts/polyml-platform, which has been
1465 obsolete since Isabelle2009-2.
1467 * Various optional external tools are referenced more robustly and
1468 uniformly by explicit Isabelle settings as follows:
1470 ISABELLE_CSDP (formerly CSDP_EXE)
1471 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
1472 ISABELLE_OCAML (formerly EXEC_OCAML)
1473 ISABELLE_SWIPL (formerly EXEC_SWIPL)
1474 ISABELLE_YAP (formerly EXEC_YAP)
1476 Note that automated detection from the file-system or search path has
1477 been discontinued. INCOMPATIBILITY.
1479 * Scala layer provides JVM method invocation service for static
1480 methods of type (String)String, see Invoke_Scala.method in ML. For
1483 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
1485 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
1486 this allows to pass structured values between ML and Scala.
1488 * The IsabelleText fonts includes some further glyphs to support the
1489 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
1490 installed a local copy (which is normally *not* required) need to
1491 delete or update it from ~~/lib/fonts/.
1495 New in Isabelle2011 (January 2011)
1496 ----------------------------------
1500 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
1501 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
1502 useful tooltips and hyperlinks produced from its static analysis. The
1503 bundled component provides an executable Isabelle tool that can be run
1506 Isabelle2011/bin/isabelle jedit
1508 * Significantly improved Isabelle/Isar implementation manual.
1510 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
1511 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
1512 while the default heap location within that directory lacks that extra
1513 suffix. This isolates multiple Isabelle installations from each
1514 other, avoiding problems with old settings in new versions.
1515 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
1517 * Source files are always encoded as UTF-8, instead of old-fashioned
1518 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
1519 the following package declarations:
1521 \usepackage[utf8]{inputenc}
1522 \usepackage{textcomp}
1524 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
1525 a Unicode character is treated as a single symbol, not a sequence of
1526 non-ASCII bytes as before. Since Isabelle/ML string literals may
1527 contain symbols without further backslash escapes, Unicode can now be
1528 used here as well. Recall that Symbol.explode in ML provides a
1529 consistent view on symbols, while raw explode (or String.explode)
1530 merely give a byte-oriented representation.
1532 * Theory loader: source files are primarily located via the master
1533 directory of each theory node (where the .thy file itself resides).
1534 The global load path is still partially available as legacy feature.
1535 Minor INCOMPATIBILITY due to subtle change in file lookup: use
1536 explicit paths, relatively to the theory.
1538 * Special treatment of ML file names has been discontinued.
1539 Historically, optional extensions .ML or .sml were added on demand --
1540 at the cost of clarity of file dependencies. Recall that Isabelle/ML
1541 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
1543 * Various options that affect pretty printing etc. are now properly
1544 handled within the context via configuration options, instead of
1545 unsynchronized references or print modes. There are both ML Config.T
1546 entities and Isar declaration attributes to access these.
1548 ML (Config.T) Isar (attribute)
1550 eta_contract eta_contract
1551 show_brackets show_brackets
1552 show_sorts show_sorts
1553 show_types show_types
1554 show_question_marks show_question_marks
1555 show_consts show_consts
1556 show_abbrevs show_abbrevs
1558 Syntax.ast_trace syntax_ast_trace
1559 Syntax.ast_stat syntax_ast_stat
1560 Syntax.ambiguity_level syntax_ambiguity_level
1562 Goal_Display.goals_limit goals_limit
1563 Goal_Display.show_main_goal show_main_goal
1565 Method.rule_trace rule_trace
1567 Thy_Output.display thy_output_display
1568 Thy_Output.quotes thy_output_quotes
1569 Thy_Output.indent thy_output_indent
1570 Thy_Output.source thy_output_source
1571 Thy_Output.break thy_output_break
1573 Note that corresponding "..._default" references in ML may only be
1574 changed globally at the ROOT session setup, but *not* within a theory.
1575 The option "show_abbrevs" supersedes the former print mode
1576 "no_abbrevs" with inverted meaning.
1578 * More systematic naming of some configuration options.
1581 trace_simp ~> simp_trace
1582 debug_simp ~> simp_debug
1584 * Support for real valued configuration options, using simplistic
1585 floating-point notation that coincides with the inner syntax for
1588 * Support for real valued preferences (with approximative PGIP type):
1589 front-ends need to accept "pgint" values in float notation.
1592 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
1595 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
1600 * Command 'type_synonym' (with single argument) replaces somewhat
1601 outdated 'types', which is still available as legacy feature for some
1604 * Command 'nonterminal' (with 'and' separated list of arguments)
1605 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
1607 * Command 'notepad' replaces former 'example_proof' for
1608 experimentation in Isar without any result. INCOMPATIBILITY.
1610 * Locale interpretation commands 'interpret' and 'sublocale' accept
1611 lists of equations to map definitions in a locale to appropriate
1612 entities in the context of the interpretation. The 'interpretation'
1613 command already provided this functionality.
1615 * Diagnostic command 'print_dependencies' prints the locale instances
1616 that would be activated if the specified expression was interpreted in
1617 the current context. Variant "print_dependencies!" assumes a context
1618 without interpretations.
1620 * Diagnostic command 'print_interps' prints interpretations in proofs
1621 in addition to interpretations in theories.
1623 * Discontinued obsolete 'global' and 'local' commands to manipulate
1624 the theory name space. Rare INCOMPATIBILITY. The ML functions
1625 Sign.root_path and Sign.local_path may be applied directly where this
1626 feature is still required for historical reasons.
1628 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
1629 'definition' instead.
1631 * The "prems" fact, which refers to the accidental collection of
1632 foundational premises in the context, is now explicitly marked as
1633 legacy feature and will be discontinued soon. Consider using "assms"
1634 of the head statement or reference facts by explicit names.
1636 * Document antiquotations @{class} and @{type} print classes and type
1639 * Document antiquotation @{file} checks file/directory entries within
1640 the local file system.
1645 * Coercive subtyping: functions can be declared as coercions and type
1646 inference will add them as necessary upon input of a term. Theory
1647 Complex_Main declares real :: nat => real and real :: int => real as
1648 coercions. A coercion function f is declared like this:
1650 declare [[coercion f]]
1652 To lift coercions through type constructors (e.g. from nat => real to
1653 nat list => real list), map functions can be declared, e.g.
1655 declare [[coercion_map map]]
1657 Currently coercion inference is activated only in theories including
1658 real numbers, i.e. descendants of Complex_Main. This is controlled by
1659 the configuration option "coercion_enabled", e.g. it can be enabled in
1660 other theories like this:
1662 declare [[coercion_enabled]]
1664 * Command 'partial_function' provides basic support for recursive
1665 function definitions over complete partial orders. Concrete instances
1666 are provided for i) the option type, ii) tail recursion on arbitrary
1667 types, and iii) the heap monad of Imperative_HOL. See
1668 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
1671 * Function package: f.psimps rules are no longer implicitly declared
1672 as [simp]. INCOMPATIBILITY.
1674 * Datatype package: theorems generated for executable equality (class
1675 "eq") carry proper names and are treated as default code equations.
1677 * Inductive package: now offers command 'inductive_simps' to
1678 automatically derive instantiated and simplified equations for
1679 inductive predicates, similar to 'inductive_cases'.
1681 * Command 'enriched_type' allows to register properties of the
1682 functorial structure of types.
1684 * Improved infrastructure for term evaluation using code generator
1685 techniques, in particular static evaluation conversions.
1687 * Code generator: Scala (2.8 or higher) has been added to the target
1690 * Code generator: globbing constant expressions "*" and "Theory.*"
1691 have been replaced by the more idiomatic "_" and "Theory._".
1694 * Code generator: export_code without explicit file declaration prints
1695 to standard output. INCOMPATIBILITY.
1697 * Code generator: do not print function definitions for case
1698 combinators any longer.
1700 * Code generator: simplification with rules determined with
1701 src/Tools/Code/code_simp.ML and method "code_simp".
1703 * Code generator for records: more idiomatic representation of record
1704 types. Warning: records are not covered by ancient SML code
1705 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
1706 rep_datatype declaration helps to succeed then:
1710 rep_datatype foo_ext ...
1712 * Records: logical foundation type for records does not carry a
1713 '_type' suffix any longer (obsolete due to authentic syntax).
1716 * Quickcheck now by default uses exhaustive testing instead of random
1717 testing. Random testing can be invoked by "quickcheck [random]",
1718 exhaustive testing by "quickcheck [exhaustive]".
1720 * Quickcheck instantiates polymorphic types with small finite
1721 datatypes by default. This enables a simple execution mechanism to
1722 handle quantifiers and function equality over the finite datatypes.
1724 * Quickcheck random generator has been renamed from "code" to
1725 "random". INCOMPATIBILITY.
1727 * Quickcheck now has a configurable time limit which is set to 30
1728 seconds by default. This can be changed by adding [timeout = n] to the
1729 quickcheck command. The time limit for Auto Quickcheck is still set
1732 * Quickcheck in locales considers interpretations of that locale for
1733 counter example search.
1736 - Added "smt" and "remote_smt" provers based on the "smt" proof
1737 method. See the Sledgehammer manual for details ("isabelle doc
1740 sledgehammer atp_info ~> sledgehammer running_provers
1741 sledgehammer atp_kill ~> sledgehammer kill_provers
1742 sledgehammer available_atps ~> sledgehammer available_provers
1745 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
1746 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
1747 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
1748 (and "ms" and "min" are no longer supported)
1753 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
1754 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
1756 - Added support for partial quotient types.
1757 - Added local versions of the "Nitpick.register_xxx" functions.
1758 - Added "whack" option.
1759 - Allow registration of quotient types as codatatypes.
1760 - Improved "merge_type_vars" option to merge more types.
1761 - Removed unsound "fast_descrs" option.
1762 - Added custom symmetry breaking for datatypes, making it possible to reach
1763 higher cardinalities.
1764 - Prevent the expansion of too large definitions.
1766 * Proof methods "metis" and "meson" now have configuration options
1767 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
1768 to diagnose these tools. E.g.
1770 using [[metis_trace = true]]
1772 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
1773 manually as command 'solve_direct'.
1775 * The default SMT solver Z3 must be enabled explicitly (due to
1776 licensing issues) by setting the environment variable
1777 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
1778 commercial applications, the SMT solver CVC3 is provided as fall-back;
1779 changing the SMT solver is done via the configuration option
1782 * Remote SMT solvers need to be referred to by the "remote_" prefix,
1783 i.e. "remote_cvc3" and "remote_z3".
1785 * Added basic SMT support for datatypes, records, and typedefs using
1786 the oracle mode (no proofs). Direct support of pairs has been dropped
1787 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
1788 support for a similar behavior). Minor INCOMPATIBILITY.
1790 * Changed SMT configuration options:
1792 z3_proofs ~> smt_oracle (with inverted meaning)
1793 z3_trace_assms ~> smt_trace_used_facts
1806 * Boogie output files (.b2i files) need to be declared in the theory
1809 * Simplification procedure "list_to_set_comprehension" rewrites list
1810 comprehensions applied to List.set to set comprehensions. Occasional
1811 INCOMPATIBILITY, may be deactivated like this:
1813 declare [[simproc del: list_to_set_comprehension]]
1815 * Removed old version of primrec package. INCOMPATIBILITY.
1817 * Removed simplifier congruence rule of "prod_case", as has for long
1818 been the case with "split". INCOMPATIBILITY.
1820 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
1822 * Removed [split_format ... and ... and ...] version of
1823 [split_format]. Potential INCOMPATIBILITY.
1825 * Predicate "sorted" now defined inductively, with nice induction
1826 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
1828 * Constant "contents" renamed to "the_elem", to free the generic name
1829 contents for other uses. INCOMPATIBILITY.
1831 * Renamed class eq and constant eq (for code generation) to class
1832 equal and constant equal, plus renaming of related facts and various
1833 tuning. INCOMPATIBILITY.
1835 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
1837 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
1840 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
1841 avoid confusion with finite sets. INCOMPATIBILITY.
1843 * Abandoned locales equiv, congruent and congruent2 for equivalence
1844 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
1847 * Some previously unqualified names have been qualified:
1854 Trueprop ~> HOL.Trueprop
1859 op --> ~> HOL.implies
1871 Pair ~> Product_Type.Pair
1872 fst ~> Product_Type.fst
1873 snd ~> Product_Type.snd
1874 curry ~> Product_Type.curry
1876 Collect ~> Set.Collect
1880 * More canonical naming convention for some fundamental definitions:
1882 bot_bool_eq ~> bot_bool_def
1883 top_bool_eq ~> top_bool_def
1884 inf_bool_eq ~> inf_bool_def
1885 sup_bool_eq ~> sup_bool_def
1886 bot_fun_eq ~> bot_fun_def
1887 top_fun_eq ~> top_fun_def
1888 inf_fun_eq ~> inf_fun_def
1889 sup_fun_eq ~> sup_fun_def
1893 * More stylized fact names:
1895 expand_fun_eq ~> fun_eq_iff
1896 expand_set_eq ~> set_eq_iff
1898 nat_number ~> eval_nat_numeral
1902 * Refactoring of code-generation specific operations in theory List:
1908 mem_iff ~> member_def
1909 null_empty ~> null_def
1911 INCOMPATIBILITY. Note that these were not supposed to be used
1912 regularly unless for striking reasons; their main purpose was code
1915 Various operations from the Haskell prelude are used for generating
1918 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
1919 "surj f" is now an abbreviation of "range f = UNIV". The theorems
1920 bij_def and surj_def are unchanged. INCOMPATIBILITY.
1922 * Abolished some non-alphabetic type names: "prod" and "sum" replace
1923 "*" and "+" respectively. INCOMPATIBILITY.
1925 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
1926 "Sum_Type.Plus" instead.
1928 * Constant "split" has been merged with constant "prod_case"; names of
1929 ML functions, facts etc. involving split have been retained so far,
1930 though. INCOMPATIBILITY.
1932 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
1933 instead. INCOMPATIBILITY.
1935 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
1938 * Former theory Library/Enum is now part of the HOL-Main image.
1939 INCOMPATIBILITY: all constants of the Enum theory now have to be
1940 referred to by its qualified name.
1943 nlists ~> Enum.nlists
1944 product ~> Enum.product
1946 * Theory Library/Monad_Syntax provides do-syntax for monad types.
1947 Syntax in Library/State_Monad has been changed to avoid ambiguities.
1950 * Theory Library/SetsAndFunctions has been split into
1951 Library/Function_Algebras and Library/Set_Algebras; canonical names
1952 for instance definitions for functions; various improvements.
1955 * Theory Library/Multiset provides stable quicksort implementation of
1958 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
1961 * Session Multivariate_Analysis: introduced a type class for euclidean
1962 space. Most theorems are now stated in terms of euclidean spaces
1963 instead of finite cartesian products.
1966 real ^ 'n ~> 'a::real_vector
1967 ~> 'a::euclidean_space
1968 ~> 'a::ordered_euclidean_space
1969 (depends on your needs)
1973 \<chi> x. _ ~> \<chi>\<chi> x. _
1976 Also note that the indices are now natural numbers and not from some
1977 finite type. Finite cartesian products of euclidean spaces, products
1978 of euclidean spaces the real and complex numbers are instantiated to
1979 be euclidean_spaces. INCOMPATIBILITY.
1981 * Session Probability: introduced pextreal as positive extended real
1982 numbers. Use pextreal as value for measures. Introduce the
1983 Radon-Nikodym derivative, product spaces and Fubini's theorem for
1984 arbitrary sigma finite measures. Introduces Lebesgue measure based on
1985 the integral in Multivariate Analysis. INCOMPATIBILITY.
1987 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
1990 * Session SPARK (with image HOL-SPARK) provides commands to load and
1991 prove verification conditions generated by the SPARK Ada program
1992 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
1997 * Theorems for additive ring operations (locale abelian_monoid and
1998 descendants) are generated by interpretation from their multiplicative
1999 counterparts. Names (in particular theorem names) have the mandatory
2000 qualifier 'add'. Previous theorem names are redeclared for
2003 * Structure "int_ring" is now an abbreviation (previously a
2004 definition). This fits more natural with advanced interpretations.
2009 * The domain package now runs in definitional mode by default: The
2010 former command 'new_domain' is now called 'domain'. To use the domain
2011 package in its original axiomatic mode, use 'domain (unsafe)'.
2014 * The new class "domain" is now the default sort. Class "predomain"
2015 is an unpointed version of "domain". Theories can be updated by
2016 replacing sort annotations as shown below. INCOMPATIBILITY.
2018 'a::type ~> 'a::countable
2019 'a::cpo ~> 'a::predomain
2020 'a::pcpo ~> 'a::domain
2022 * The old type class "rep" has been superseded by class "domain".
2023 Accordingly, users of the definitional package must remove any
2024 "default_sort rep" declarations. INCOMPATIBILITY.
2026 * The domain package (definitional mode) now supports unpointed
2027 predomain argument types, as long as they are marked 'lazy'. (Strict
2028 arguments must be in class "domain".) For example, the following
2029 domain definition now works:
2031 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
2033 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
2034 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
2035 'a option, and 'a list. Additionally, it configures fixrec and the
2036 domain package to work with these types. For example:
2038 fixrec isInl :: "('a + 'b) u -> tr"
2039 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
2041 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
2043 * The "(permissive)" option of fixrec has been replaced with a
2044 per-equation "(unchecked)" option. See
2045 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
2047 * The "bifinite" class no longer fixes a constant "approx"; the class
2048 now just asserts that such a function exists. INCOMPATIBILITY.
2050 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
2051 defines an embedding of type 'a defl into udom by default; instances
2052 of "bifinite" and "domain" classes are available in
2053 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
2055 * The syntax "REP('a)" has been replaced with "DEFL('a)".
2057 * The predicate "directed" has been removed. INCOMPATIBILITY.
2059 * The type class "finite_po" has been removed. INCOMPATIBILITY.
2061 * The function "cprod_map" has been renamed to "prod_map".
2064 * The monadic bind operator on each powerdomain has new binder syntax
2065 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
2066 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
2068 * The infix syntax for binary union on each powerdomain has changed
2069 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
2070 syntax. INCOMPATIBILITY.
2072 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
2073 still supported as an input translation.
2075 * Renamed some theorems (the original names are also still available).
2077 expand_fun_below ~> fun_below_iff
2078 below_fun_ext ~> fun_belowI
2079 expand_cfun_eq ~> cfun_eq_iff
2080 ext_cfun ~> cfun_eqI
2081 expand_cfun_below ~> cfun_below_iff
2082 below_cfun_ext ~> cfun_belowI
2083 cont2cont_Rep_CFun ~> cont2cont_APP
2085 * The Abs and Rep functions for various types have changed names.
2086 Related theorem names have also changed to match. INCOMPATIBILITY.
2088 Rep_CFun ~> Rep_cfun
2089 Abs_CFun ~> Abs_cfun
2090 Rep_Sprod ~> Rep_sprod
2091 Abs_Sprod ~> Abs_sprod
2092 Rep_Ssum ~> Rep_ssum
2093 Abs_Ssum ~> Abs_ssum
2095 * Lemmas with names of the form *_defined_iff or *_strict_iff have
2096 been renamed to *_bottom_iff. INCOMPATIBILITY.
2098 * Various changes to bisimulation/coinduction with domain package:
2100 - Definitions of "bisim" constants no longer mention definedness.
2101 - With mutual recursion, "bisim" predicate is now curried.
2102 - With mutual recursion, each type gets a separate coind theorem.
2103 - Variable names in bisim_def and coinduct rules have changed.
2107 * Case combinators generated by the domain package for type "foo" are
2108 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
2110 * Several theorems have been renamed to more accurately reflect the
2111 names of constants and types involved. INCOMPATIBILITY.
2113 thelub_const ~> lub_const
2114 lub_const ~> is_lub_const
2116 is_lub_lub ~> is_lubD2
2118 unique_lub ~> is_lub_unique
2119 is_ub_lub ~> is_lub_rangeD1
2120 lub_bin_chain ~> is_lub_bin_chain
2121 lub_fun ~> is_lub_fun
2122 thelub_fun ~> lub_fun
2123 thelub_cfun ~> lub_cfun
2124 thelub_Pair ~> lub_Pair
2125 lub_cprod ~> is_lub_prod
2126 thelub_cprod ~> lub_prod
2127 minimal_cprod ~> minimal_prod
2128 inst_cprod_pcpo ~> inst_prod_pcpo
2130 compact_UU ~> compact_bottom
2131 deflation_UU ~> deflation_bottom
2132 finite_deflation_UU ~> finite_deflation_bottom
2134 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
2136 sq_ord_less_eq_trans ~> below_eq_trans
2137 sq_ord_eq_less_trans ~> eq_below_trans
2138 refl_less ~> below_refl
2139 trans_less ~> below_trans
2140 antisym_less ~> below_antisym
2141 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
2142 box_less ~> box_below
2143 rev_trans_less ~> rev_below_trans
2144 not_less2not_eq ~> not_below2not_eq
2145 less_UU_iff ~> below_UU_iff
2146 flat_less_iff ~> flat_below_iff
2147 adm_less ~> adm_below
2148 adm_not_less ~> adm_not_below
2149 adm_compact_not_less ~> adm_compact_not_below
2150 less_fun_def ~> below_fun_def
2151 expand_fun_less ~> fun_below_iff
2152 less_fun_ext ~> fun_belowI
2153 less_discr_def ~> below_discr_def
2154 discr_less_eq ~> discr_below_eq
2155 less_unit_def ~> below_unit_def
2156 less_cprod_def ~> below_prod_def
2157 prod_lessI ~> prod_belowI
2158 Pair_less_iff ~> Pair_below_iff
2159 fst_less_iff ~> fst_below_iff
2160 snd_less_iff ~> snd_below_iff
2161 expand_cfun_less ~> cfun_below_iff
2162 less_cfun_ext ~> cfun_belowI
2163 injection_less ~> injection_below
2164 less_up_def ~> below_up_def
2165 not_Iup_less ~> not_Iup_below
2166 Iup_less ~> Iup_below
2168 Def_inject_less_eq ~> Def_below_Def
2169 Def_less_is_eq ~> Def_below_iff
2170 spair_less_iff ~> spair_below_iff
2171 less_sprod ~> below_sprod
2172 spair_less ~> spair_below
2173 sfst_less_iff ~> sfst_below_iff
2174 ssnd_less_iff ~> ssnd_below_iff
2175 fix_least_less ~> fix_least_below
2176 dist_less_one ~> dist_below_one
2177 less_ONE ~> below_ONE
2178 ONE_less_iff ~> ONE_below_iff
2179 less_sinlD ~> below_sinlD
2180 less_sinrD ~> below_sinrD
2185 * All constant names are now qualified internally and use proper
2186 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
2191 * Antiquotation @{assert} inlines a function bool -> unit that raises
2192 Fail if the argument is false. Due to inlining the source position of
2193 failed assertions is included in the error output.
2195 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
2196 text is in practice always evaluated with a stable theory checkpoint.
2197 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
2199 * Antiquotation @{theory A} refers to theory A from the ancestry of
2200 the current context, not any accidental theory loader state as before.
2201 Potential INCOMPATIBILITY, subtle change in semantics.
2203 * Syntax.pretty_priority (default 0) configures the required priority
2204 of pretty-printed output and thus affects insertion of parentheses.
2206 * Syntax.default_root (default "any") configures the inner syntax
2207 category (nonterminal symbol) for parsing of terms.
2209 * Former exception Library.UnequalLengths now coincides with
2210 ListPair.UnequalLengths.
2212 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
2213 main functionality is provided by structure Simplifier.
2215 * Renamed raw "explode" function to "raw_explode" to emphasize its
2216 meaning. Note that internally to Isabelle, Symbol.explode is used in
2217 almost all situations.
2219 * Discontinued obsolete function sys_error and exception SYS_ERROR.
2220 See implementation manual for further details on exceptions in
2223 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
2226 * Renamed structure PureThy to Pure_Thy and moved most of its
2227 operations to structure Global_Theory, to emphasize that this is
2228 rarely-used global-only stuff.
2230 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
2231 instead (or tracing for high-volume output).
2233 * Configuration option show_question_marks only affects regular pretty
2234 printing of types and terms, not raw Term.string_of_vname.
2236 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
2237 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
2238 @{thms} for most purposes.
2240 * ML structure Unsynchronized is never opened, not even in Isar
2241 interaction mode as before. Old Unsynchronized.set etc. have been
2242 discontinued -- use plain := instead. This should be *rare* anyway,
2243 since modern tools always work via official context data, notably
2244 configuration options.
2246 * Parallel and asynchronous execution requires special care concerning
2247 interrupts. Structure Exn provides some convenience functions that
2248 avoid working directly with raw Interrupt. User code must not absorb
2249 interrupts -- intermediate handling (for cleanup etc.) needs to be
2250 followed by re-raising of the original exception. Another common
2251 source of mistakes are "handle _" patterns, which make the meaning of
2252 the program subject to physical effects of the environment.
2256 New in Isabelle2009-2 (June 2010)
2257 ---------------------------------
2261 * Authentic syntax for *all* logical entities (type classes, type
2262 constructors, term constants): provides simple and robust
2263 correspondence between formal entities and concrete syntax. Within
2264 the parse tree / AST representations, "constants" are decorated by
2265 their category (class, type, const) and spelled out explicitly with
2266 their full internal name.
2268 Substantial INCOMPATIBILITY concerning low-level syntax declarations
2269 and translations (translation rules and translation functions in ML).
2270 Some hints on upgrading:
2272 - Many existing uses of 'syntax' and 'translations' can be replaced
2273 by more modern 'type_notation', 'notation' and 'abbreviation',
2274 which are independent of this issue.
2276 - 'translations' require markup within the AST; the term syntax
2277 provides the following special forms:
2279 CONST c -- produces syntax version of constant c from context
2280 XCONST c -- literally c, checked as constant from context
2281 c -- literally c, if declared by 'syntax'
2283 Plain identifiers are treated as AST variables -- occasionally the
2284 system indicates accidental variables via the error "rhs contains
2287 Type classes and type constructors are marked according to their
2288 concrete syntax. Some old translations rules need to be written
2289 for the "type" category, using type constructor application
2290 instead of pseudo-term application of the default category
2293 - 'parse_translation' etc. in ML may use the following
2296 @{class_syntax c} -- type class c within parse tree / AST
2297 @{term_syntax c} -- type constructor c within parse tree / AST
2298 @{const_syntax c} -- ML version of "CONST c" above
2299 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
2301 - Literal types within 'typed_print_translations', i.e. those *not*
2302 represented as pseudo-terms are represented verbatim. Use @{class
2303 c} or @{type_name c} here instead of the above syntax
2306 Note that old non-authentic syntax was based on unqualified base
2307 names, so all of the above "constant" names would coincide. Recall
2308 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
2309 diagnose syntax problems.
2311 * Type constructors admit general mixfix syntax, not just infix.
2313 * Concrete syntax may be attached to local entities without a proof
2314 body, too. This works via regular mixfix annotations for 'fix',
2315 'def', 'obtain' etc. or via the explicit 'write' command, which is
2316 similar to the 'notation' command in theory specifications.
2318 * Discontinued unnamed infix syntax (legacy feature for many years) --
2319 need to specify constant name and syntax separately. Internal ML
2320 datatype constructors have been renamed from InfixName to Infix etc.
2321 Minor INCOMPATIBILITY.
2323 * Schematic theorem statements need to be explicitly markup as such,
2324 via commands 'schematic_lemma', 'schematic_theorem',
2325 'schematic_corollary'. Thus the relevance of the proof is made
2326 syntactically clear, which impacts performance in a parallel or
2327 asynchronous interactive environment. Minor INCOMPATIBILITY.
2329 * Use of cumulative prems via "!" in some proof methods has been
2330 discontinued (old legacy feature).
2332 * References 'trace_simp' and 'debug_simp' have been replaced by
2333 configuration options stored in the context. Enabling tracing (the
2334 case of debugging is similar) in proofs works via
2336 using [[trace_simp = true]]
2338 Tracing is then active for all invocations of the simplifier in
2339 subsequent goal refinement steps. Tracing may also still be enabled or
2340 disabled via the ProofGeneral settings menu.
2342 * Separate commands 'hide_class', 'hide_type', 'hide_const',
2343 'hide_fact' replace the former 'hide' KIND command. Minor
2346 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
2347 more efficient than combinations with -q1 or -q2.
2352 * Proofterms record type-class reasoning explicitly, using the
2353 "unconstrain" operation internally. This eliminates all sort
2354 constraints from a theorem and proof, introducing explicit
2355 OFCLASS-premises. On the proof term level, this operation is
2356 automatically applied at theorem boundaries, such that closed proofs
2357 are always free of sort constraints. INCOMPATIBILITY for tools that
2358 inspect proof terms.
2360 * Local theory specifications may depend on extra type variables that
2361 are not present in the result type -- arguments TYPE('a) :: 'a itself
2362 are added internally. For example:
2364 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
2366 * Predicates of locales introduced by classes carry a mandatory
2367 "class" prefix. INCOMPATIBILITY.
2369 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
2371 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
2374 * Command 'code_reflect' allows to incorporate generated ML code into
2375 runtime environment; replaces immature code_datatype antiquotation.
2378 * Code generator: simple concept for abstract datatypes obeying
2381 * Code generator: details of internal data cache have no impact on the
2382 user space functionality any longer.
2384 * Methods "unfold_locales" and "intro_locales" ignore non-locale
2385 subgoals. This is more appropriate for interpretations with 'where'.
2388 * Command 'example_proof' opens an empty proof body. This allows to
2389 experiment with Isar, without producing any persistent result.
2391 * Commands 'type_notation' and 'no_type_notation' declare type syntax
2392 within a local theory context, with explicit checking of the
2393 constructors involved (in contrast to the raw 'syntax' versions).
2395 * Commands 'types' and 'typedecl' now work within a local theory
2396 context -- without introducing dependencies on parameters or
2397 assumptions, which is not possible in Isabelle/Pure.
2399 * Command 'defaultsort' has been renamed to 'default_sort', it works
2400 within a local theory context. Minor INCOMPATIBILITY.
2405 * Command 'typedef' now works within a local theory context -- without
2406 introducing dependencies on parameters or assumptions, which is not
2407 possible in Isabelle/Pure/HOL. Note that the logical environment may
2408 contain multiple interpretations of local typedefs (with different
2409 non-emptiness proofs), even in a global theory context.
2411 * New package for quotient types. Commands 'quotient_type' and
2412 'quotient_definition' may be used for defining types and constants by
2413 quotient constructions. An example is the type of integers created by
2414 quotienting pairs of natural numbers:
2417 intrel :: "(nat * nat) => (nat * nat) => bool"
2419 "intrel (x, y) (u, v) = (x + v = u + y)"
2421 quotient_type int = "nat * nat" / intrel
2422 by (auto simp add: equivp_def expand_fun_eq)
2425 "0::int" is "(0::nat, 0::nat)"
2427 The method "lifting" can be used to lift of theorems from the
2428 underlying "raw" type to the quotient type. The example
2429 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
2430 construction and provides a reasoning infrastructure for finite sets.
2432 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
2433 clash with new theory Quotient in Main HOL.
2435 * Moved the SMT binding into the main HOL session, eliminating
2436 separate HOL-SMT session.
2438 * List membership infix mem operation is only an input abbreviation.
2441 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
2442 for future developements; former Library/Word.thy is still present in
2443 the AFP entry RSAPPS.
2445 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
2446 longer shadowed. INCOMPATIBILITY.
2448 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
2451 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
2454 * Dropped normalizing_semiring etc; use the facts in semiring classes
2455 instead. INCOMPATIBILITY.
2457 * Dropped several real-specific versions of lemmas about floor and
2458 ceiling; use the generic lemmas from theory "Archimedean_Field"
2459 instead. INCOMPATIBILITY.
2461 floor_number_of_eq ~> floor_number_of
2462 le_floor_eq_number_of ~> number_of_le_floor
2463 le_floor_eq_zero ~> zero_le_floor
2464 le_floor_eq_one ~> one_le_floor
2465 floor_less_eq_number_of ~> floor_less_number_of
2466 floor_less_eq_zero ~> floor_less_zero
2467 floor_less_eq_one ~> floor_less_one
2468 less_floor_eq_number_of ~> number_of_less_floor
2469 less_floor_eq_zero ~> zero_less_floor
2470 less_floor_eq_one ~> one_less_floor
2471 floor_le_eq_number_of ~> floor_le_number_of
2472 floor_le_eq_zero ~> floor_le_zero
2473 floor_le_eq_one ~> floor_le_one
2474 floor_subtract_number_of ~> floor_diff_number_of
2475 floor_subtract_one ~> floor_diff_one
2476 ceiling_number_of_eq ~> ceiling_number_of
2477 ceiling_le_eq_number_of ~> ceiling_le_number_of
2478 ceiling_le_zero_eq ~> ceiling_le_zero
2479 ceiling_le_eq_one ~> ceiling_le_one
2480 less_ceiling_eq_number_of ~> number_of_less_ceiling
2481 less_ceiling_eq_zero ~> zero_less_ceiling
2482 less_ceiling_eq_one ~> one_less_ceiling
2483 ceiling_less_eq_number_of ~> ceiling_less_number_of
2484 ceiling_less_eq_zero ~> ceiling_less_zero
2485 ceiling_less_eq_one ~> ceiling_less_one
2486 le_ceiling_eq_number_of ~> number_of_le_ceiling
2487 le_ceiling_eq_zero ~> zero_le_ceiling
2488 le_ceiling_eq_one ~> one_le_ceiling
2489 ceiling_subtract_number_of ~> ceiling_diff_number_of
2490 ceiling_subtract_one ~> ceiling_diff_one
2492 * Theory "Finite_Set": various folding_XXX locales facilitate the
2493 application of the various fold combinators on finite sets.
2495 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
2496 provides abstract red-black tree type which is backed by "RBT_Impl" as
2497 implementation. INCOMPATIBILTY.
2499 * Theory Library/Coinductive_List has been removed -- superseded by
2500 AFP/thys/Coinductive.
2502 * Theory PReal, including the type "preal" and related operations, has
2503 been removed. INCOMPATIBILITY.
2505 * Real: new development using Cauchy Sequences.
2507 * Split off theory "Big_Operators" containing setsum, setprod,
2508 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
2510 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
2511 "Int" etc. INCOMPATIBILITY.
2513 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
2515 * New set of rules "ac_simps" provides combined assoc / commute
2516 rewrites for all interpretations of the appropriate generic locales.
2518 * Renamed theory "OrderedGroup" to "Groups" and split theory
2519 "Ring_and_Field" into theories "Rings" and "Fields"; for more
2520 appropriate and more consistent names suitable for name prefixes
2521 within the HOL theories. INCOMPATIBILITY.
2523 * Some generic constants have been put to appropriate theories:
2524 - less_eq, less: Orderings
2525 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
2526 - inverse, divide: Rings
2529 * More consistent naming of type classes involving orderings (and
2532 lower_semilattice ~> semilattice_inf
2533 upper_semilattice ~> semilattice_sup
2535 dense_linear_order ~> dense_linorder
2537 pordered_ab_group_add ~> ordered_ab_group_add
2538 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
2539 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
2540 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
2541 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
2542 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
2543 pordered_cancel_semiring ~> ordered_cancel_semiring
2544 pordered_comm_monoid_add ~> ordered_comm_monoid_add
2545 pordered_comm_ring ~> ordered_comm_ring
2546 pordered_comm_semiring ~> ordered_comm_semiring
2547 pordered_ring ~> ordered_ring
2548 pordered_ring_abs ~> ordered_ring_abs
2549 pordered_semiring ~> ordered_semiring
2551 ordered_ab_group_add ~> linordered_ab_group_add
2552 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
2553 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
2554 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
2555 ordered_field ~> linordered_field
2556 ordered_field_no_lb ~> linordered_field_no_lb
2557 ordered_field_no_ub ~> linordered_field_no_ub
2558 ordered_field_dense_linear_order ~> dense_linordered_field
2559 ordered_idom ~> linordered_idom
2560 ordered_ring ~> linordered_ring
2561 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
2562 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
2563 ordered_ring_strict ~> linordered_ring_strict
2564 ordered_semidom ~> linordered_semidom
2565 ordered_semiring ~> linordered_semiring
2566 ordered_semiring_1 ~> linordered_semiring_1
2567 ordered_semiring_1_strict ~> linordered_semiring_1_strict
2568 ordered_semiring_strict ~> linordered_semiring_strict
2570 The following slightly odd type classes have been moved to a
2571 separate theory Library/Lattice_Algebras:
2573 lordered_ab_group_add ~> lattice_ab_group_add
2574 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
2575 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
2576 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
2577 lordered_ring ~> lattice_ring
2581 * Refined field classes:
2582 - classes division_ring_inverse_zero, field_inverse_zero,
2583 linordered_field_inverse_zero include rule inverse 0 = 0 --
2584 subsumes former division_by_zero class;
2585 - numerous lemmas have been ported from field to division_ring.
2588 * Refined algebra theorem collections:
2589 - dropped theorem group group_simps, use algebra_simps instead;
2590 - dropped theorem group ring_simps, use field_simps instead;
2591 - proper theorem collection field_simps subsumes former theorem
2592 groups field_eq_simps and field_simps;
2593 - dropped lemma eq_minus_self_iff which is a duplicate for
2597 * Theory Finite_Set and List: some lemmas have been generalized from
2600 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
2601 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
2602 inter_Inter_fold_inter ~> inf_Inf_fold_inf
2603 union_Union_fold_union ~> sup_Sup_fold_sup
2604 Inter_fold_inter ~> Inf_fold_inf
2605 Union_fold_union ~> Sup_fold_sup
2606 inter_INTER_fold_inter ~> inf_INFI_fold_inf
2607 union_UNION_fold_union ~> sup_SUPR_fold_sup
2608 INTER_fold_inter ~> INFI_fold_inf
2609 UNION_fold_union ~> SUPR_fold_sup
2611 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
2612 replaced by the more convenient lemmas Inf_empty and Sup_empty.
2613 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
2614 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
2615 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
2616 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
2618 * Reorganized theory Multiset: swapped notation of pointwise and
2621 - pointwise ordering is instance of class order with standard syntax
2623 - multiset ordering has syntax <=# and <#; partial order properties
2624 are provided by means of interpretation with prefix
2626 - less duplication, less historical organization of sections,
2627 conversion from associations lists to multisets, rudimentary code
2629 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
2634 multiset_eq_conv_count_eq ~> multiset_ext_iff
2635 multi_count_ext ~> multiset_ext
2636 diff_union_inverse2 ~> diff_union_cancelR
2640 * Theory Permutation: replaced local "remove" by List.remove1.
2642 * Code generation: ML and OCaml code is decorated with signatures.
2644 * Theory List: added transpose.
2646 * Library/Nat_Bijection.thy is a collection of bijective functions
2647 between nat and other types, which supersedes the older libraries
2648 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
2651 Nat_Int_Bij.nat2_to_nat ~> prod_encode
2652 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
2653 Nat_Int_Bij.int_to_nat_bij ~> int_encode
2654 Nat_Int_Bij.nat_to_int_bij ~> int_decode
2655 Countable.pair_encode ~> prod_encode
2656 NatIso.prod2nat ~> prod_encode
2657 NatIso.nat2prod ~> prod_decode
2658 NatIso.sum2nat ~> sum_encode
2659 NatIso.nat2sum ~> sum_decode
2660 NatIso.list2nat ~> list_encode
2661 NatIso.nat2list ~> list_decode
2662 NatIso.set2nat ~> set_encode
2663 NatIso.nat2set ~> set_decode
2666 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
2667 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
2668 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
2669 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
2670 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
2671 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
2672 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
2673 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
2674 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
2675 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
2676 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
2677 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
2678 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
2681 - Renamed ATP commands:
2682 atp_info ~> sledgehammer running_atps
2683 atp_kill ~> sledgehammer kill_atps
2684 atp_messages ~> sledgehammer messages
2685 atp_minimize ~> sledgehammer minimize
2686 print_atps ~> sledgehammer available_atps
2688 - Added user's manual ("isabelle doc sledgehammer").
2689 - Added option syntax and "sledgehammer_params" to customize
2690 Sledgehammer's behavior. See the manual for details.
2691 - Modified the Isar proof reconstruction code so that it produces
2692 direct proofs rather than proofs by contradiction. (This feature
2693 is still experimental.)
2694 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
2696 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
2699 - Added and implemented "binary_ints" and "bits" options.
2700 - Added "std" option and implemented support for nonstandard models.
2701 - Added and implemented "finitize" option to improve the precision
2702 of infinite datatypes based on a monotonicity analysis.
2703 - Added support for quotient types.
2704 - Added support for "specification" and "ax_specification"
2706 - Added support for local definitions (for "function" and
2707 "termination" proofs).
2708 - Added support for term postprocessors.
2709 - Optimized "Multiset.multiset" and "FinFun.finfun".
2710 - Improved efficiency of "destroy_constrs" optimization.
2711 - Fixed soundness bugs related to "destroy_constrs" optimization and
2713 - Fixed soundness bug related to higher-order constructors.
2714 - Fixed soundness bug when "full_descrs" is enabled.
2715 - Improved precision of set constructs.
2716 - Added "atoms" option.
2717 - Added cache to speed up repeated Kodkod invocations on the same
2719 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
2720 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
2721 "SAT4J_Light". INCOMPATIBILITY.
2722 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
2723 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
2724 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
2726 * Method "induct" now takes instantiations of the form t, where t is not
2727 a variable, as a shorthand for "x == t", where x is a fresh variable.
2728 If this is not intended, t has to be enclosed in parentheses.
2729 By default, the equalities generated by definitional instantiations
2730 are pre-simplified, which may cause parameters of inductive cases
2731 to disappear, or may even delete some of the inductive cases.
2732 Use "induct (no_simp)" instead of "induct" to restore the old
2733 behaviour. The (no_simp) option is also understood by the "cases"
2734 and "nominal_induct" methods, which now perform pre-simplification, too.
2740 * Variable names in lemmas generated by the domain package have
2741 changed; the naming scheme is now consistent with the HOL datatype
2742 package. Some proof scripts may be affected, INCOMPATIBILITY.
2744 * The domain package no longer defines the function "foo_copy" for
2745 recursive domain "foo". The reach lemma is now stated directly in
2746 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
2747 be reformulated in terms of "foo_take", INCOMPATIBILITY.
2749 * Most definedness lemmas generated by the domain package (previously
2750 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
2751 like "foo$x = UU <-> x = UU", which works better as a simp rule.
2752 Proofs that used definedness lemmas as intro rules may break,
2753 potential INCOMPATIBILITY.
2755 * Induction and casedist rules generated by the domain package now
2756 declare proper case_names (one called "bottom", and one named for each
2757 constructor). INCOMPATIBILITY.
2759 * For mutually-recursive domains, separate "reach" and "take_lemma"
2760 rules are generated for each domain, INCOMPATIBILITY.
2762 foo_bar.reach ~> foo.reach bar.reach
2763 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
2765 * Some lemmas generated by the domain package have been renamed for
2766 consistency with the datatype package, INCOMPATIBILITY.
2768 foo.ind ~> foo.induct
2769 foo.finite_ind ~> foo.finite_induct
2770 foo.coind ~> foo.coinduct
2771 foo.casedist ~> foo.exhaust
2772 foo.exhaust ~> foo.nchotomy
2774 * For consistency with other definition packages, the fixrec package
2775 now generates qualified theorem names, INCOMPATIBILITY.
2777 foo_simps ~> foo.simps
2778 foo_unfold ~> foo.unfold
2779 foo_induct ~> foo.induct
2781 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
2782 method and internal fixrec proofs now use the default simpset instead.
2785 * The "contlub" predicate has been removed. Proof scripts should use
2786 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
2788 * The "admw" predicate has been removed, INCOMPATIBILITY.
2790 * The constants cpair, cfst, and csnd have been removed in favor of
2791 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
2796 * Antiquotations for basic formal entities:
2798 @{class NAME} -- type class
2799 @{class_syntax NAME} -- syntax representation of the above
2801 @{type_name NAME} -- logical type
2802 @{type_abbrev NAME} -- type abbreviation
2803 @{nonterminal NAME} -- type of concrete syntactic category
2804 @{type_syntax NAME} -- syntax representation of any of the above
2806 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
2807 @{const_abbrev NAME} -- abbreviated constant
2808 @{const_syntax NAME} -- syntax representation of any of the above
2810 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
2811 syntax constant (cf. 'syntax' command).
2813 * Antiquotation @{make_string} inlines a function to print arbitrary
2814 values similar to the ML toplevel. The result is compiler dependent
2815 and may fall back on "?" in certain situations.
2817 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
2818 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
2819 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
2820 not work with the asynchronous Isar document model.
2822 * Configuration options now admit dynamic default values, depending on
2823 the context or even global references.
2825 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
2826 uses an efficient external library if available (for Poly/ML).
2828 * Renamed some important ML structures, while keeping the old names
2829 for some time as aliases within the structure Legacy:
2831 OuterKeyword ~> Keyword
2834 OuterSyntax ~> Outer_Syntax
2835 PrintMode ~> Print_Mode
2836 SpecParse ~> Parse_Spec
2839 ThyOutput ~> Thy_Output
2840 TypeInfer ~> Type_Infer
2842 Note that "open Legacy" simplifies porting of sources, but forgetting
2843 to remove it again will complicate porting again in the future.
2845 * Most operations that refer to a global context are named
2846 accordingly, e.g. Simplifier.global_context or
2847 ProofContext.init_global. There are some situations where a global
2848 context actually works, but under normal circumstances one needs to
2849 pass the proper local context through the code!
2851 * Discontinued old TheoryDataFun with its copy/init operation -- data
2852 needs to be pure. Functor Theory_Data_PP retains the traditional
2853 Pretty.pp argument to merge, which is absent in the standard
2854 Theory_Data version.
2856 * Sorts.certify_sort and derived "cert" operations for types and terms
2857 no longer minimize sorts. Thus certification at the boundary of the
2858 inference kernel becomes invariant under addition of class relations,
2859 which is an important monotonicity principle. Sorts are now minimized
2860 in the syntax layer only, at the boundary between the end-user and the
2861 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
2862 explicitly in rare situations.
2864 * Renamed old-style Drule.standard to Drule.export_without_context, to
2865 emphasize that this is in no way a standard operation.
2868 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
2869 usual for resolution. Rare INCOMPATIBILITY.
2871 * Renamed varify/unvarify operations to varify_global/unvarify_global
2872 to emphasize that these only work in a global situation (which is
2875 * Curried take and drop in library.ML; negative length is interpreted
2876 as infinity (as in chop). Subtle INCOMPATIBILITY.
2878 * Proof terms: type substitutions on proof constants now use canonical
2879 order of type variables. INCOMPATIBILITY for tools working with proof
2882 * Raw axioms/defs may no longer carry sort constraints, and raw defs
2883 may no longer carry premises. User-level specifications are
2884 transformed accordingly by Thm.add_axiom/add_def.
2889 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
2890 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
2891 proof terms are enabled unconditionally in the new HOL-Proofs image.
2893 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
2894 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
2897 * Old lib/scripts/polyml-platform is superseded by the
2898 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
2899 variant, even on a 64 bit machine. The following example setting
2900 prefers 64 bit if available:
2902 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
2904 * The preliminary Isabelle/jEdit application demonstrates the emerging
2905 Isabelle/Scala layer for advanced prover interaction and integration.
2906 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
2909 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
2910 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
2911 similar to the default assignment of the document preparation system
2912 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
2913 provides some operations for direct access to the font without asking
2914 the user for manual installation.
2918 New in Isabelle2009-1 (December 2009)
2919 -------------------------------------
2923 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
2924 one backslash should be used, even in ML sources.
2929 * Locale interpretation propagates mixins along the locale hierarchy.
2930 The currently only available mixins are the equations used to map
2931 local definitions to terms of the target domain of an interpretation.
2933 * Reactivated diagnostic command 'print_interps'. Use "print_interps
2934 loc" to print all interpretations of locale "loc" in the theory.
2935 Interpretations in proofs are not shown.
2937 * Thoroughly revised locales tutorial. New section on conditional
2940 * On instantiation of classes, remaining undefined class parameters
2941 are formally declared. INCOMPATIBILITY.
2944 *** Document preparation ***
2946 * New generalized style concept for printing terms: @{foo (style) ...}
2947 instead of @{foo_style style ...} (old form is still retained for
2948 backward compatibility). Styles can be also applied for
2949 antiquotations prop, term_type and typeof.
2954 * New proof method "smt" for a combination of first-order logic with
2955 equality, linear and nonlinear (natural/integer/real) arithmetic, and
2956 fixed-size bitvectors; there is also basic support for higher-order
2957 features (esp. lambda abstractions). It is an incomplete decision
2958 procedure based on external SMT solvers using the oracle mechanism;
2959 for the SMT solver Z3, this method is proof-producing. Certificates
2960 are provided to avoid calling the external solvers solely for
2961 re-checking proofs. Due to a remote SMT service there is no need for
2962 installing SMT solvers locally. See src/HOL/SMT.
2964 * New commands to load and prove verification conditions generated by
2965 the Boogie program verifier or derived systems (e.g. the Verifying C
2966 Compiler (VCC) or Spec#). See src/HOL/Boogie.
2968 * New counterexample generator tool 'nitpick' based on the Kodkod
2969 relational model finder. See src/HOL/Tools/Nitpick and
2970 src/HOL/Nitpick_Examples.
2972 * New commands 'code_pred' and 'values' to invoke the predicate
2973 compiler and to enumerate values of inductive predicates.
2975 * A tabled implementation of the reflexive transitive closure.
2977 * New implementation of quickcheck uses generic code generator;
2978 default generators are provided for all suitable HOL types, records
2979 and datatypes. Old quickcheck can be re-activated importing theory
2980 Library/SML_Quickcheck.
2982 * New testing tool Mirabelle for automated proof tools. Applies
2983 several tools and tactics like sledgehammer, metis, or quickcheck, to
2984 every proof step in a theory. To be used in batch mode via the
2985 "mirabelle" utility.
2987 * New proof method "sos" (sum of squares) for nonlinear real
2988 arithmetic (originally due to John Harison). It requires theory
2989 Library/Sum_Of_Squares. It is not a complete decision procedure but
2990 works well in practice on quantifier-free real arithmetic with +, -,
2991 *, ^, =, <= and <, i.e. boolean combinations of equalities and
2992 inequalities between polynomials. It makes use of external
2993 semidefinite programming solvers. Method "sos" generates a
2994 certificate that can be pasted into the proof thus avoiding the need
2995 to call an external tool every time the proof is checked. See
2996 src/HOL/Library/Sum_Of_Squares.
2998 * New method "linarith" invokes existing linear arithmetic decision
3001 * New command 'atp_minimal' reduces result produced by Sledgehammer.
3003 * New Sledgehammer option "Full Types" in Proof General settings menu.
3004 Causes full type information to be output to the ATPs. This slows
3005 ATPs down considerably but eliminates a source of unsound "proofs"
3008 * New method "metisFT": A version of metis that uses full type
3009 information in order to avoid failures of proof reconstruction.
3011 * New evaluator "approximate" approximates an real valued term using
3012 the same method as the approximation method.
3014 * Method "approximate" now supports arithmetic expressions as
3015 boundaries of intervals and implements interval splitting and Taylor
3018 * ML antiquotation @{code_datatype} inserts definition of a datatype
3019 generated by the code generator; e.g. see src/HOL/Predicate.thy.
3021 * New theory SupInf of the supremum and infimum operators for sets of
3024 * New theory Probability, which contains a development of measure
3025 theory, eventually leading to Lebesgue integration and probability.
3027 * Extended Multivariate Analysis to include derivation and Brouwer's
3030 * Reorganization of number theory, INCOMPATIBILITY:
3031 - new number theory development for nat and int, in theories Divides
3032 and GCD as well as in new session Number_Theory
3033 - some constants and facts now suffixed with _nat and _int
3035 - former session NumberTheory now named Old_Number_Theory, including
3036 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
3037 - moved theory Pocklington from src/HOL/Library to
3038 src/HOL/Old_Number_Theory
3040 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
3041 lcm of finite and infinite sets. It is shown that they form a complete
3044 * Class semiring_div requires superclass no_zero_divisors and proof of
3045 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
3046 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
3047 generalized to class semiring_div, subsuming former theorems
3048 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
3049 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
3052 * Refinements to lattice classes and sets:
3053 - less default intro/elim rules in locale variant, more default
3054 intro/elim rules in class variant: more uniformity
3055 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
3057 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
3059 - renamed ACI to inf_sup_aci
3060 - new class "boolean_algebra"
3061 - class "complete_lattice" moved to separate theory
3062 "Complete_Lattice"; corresponding constants (and abbreviations)
3063 renamed and with authentic syntax:
3064 Set.Inf ~> Complete_Lattice.Inf
3065 Set.Sup ~> Complete_Lattice.Sup
3066 Set.INFI ~> Complete_Lattice.INFI
3067 Set.SUPR ~> Complete_Lattice.SUPR
3068 Set.Inter ~> Complete_Lattice.Inter
3069 Set.Union ~> Complete_Lattice.Union
3070 Set.INTER ~> Complete_Lattice.INTER
3071 Set.UNION ~> Complete_Lattice.UNION
3072 - authentic syntax for
3075 - mere abbreviations:
3078 Set.inter (for inf, formerly Set.Int)
3079 Set.union (for sup, formerly Set.Un)
3080 Complete_Lattice.Inter (for Inf)
3081 Complete_Lattice.Union (for Sup)
3082 Complete_Lattice.INTER (for INFI)
3083 Complete_Lattice.UNION (for SUPR)
3084 - object-logic definitions as far as appropriate
3086 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
3087 Un_subset_iff are explicitly deleted as default simp rules; then also
3088 their lattice counterparts le_inf_iff and le_sup_iff have to be
3089 deleted to achieve the desired effect.
3091 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
3092 rules by default any longer; the same applies to min_max.inf_absorb1
3093 etc. INCOMPATIBILITY.
3095 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
3096 pred_set_conv by default. INCOMPATIBILITY.
3098 * Power operations on relations and functions are now one dedicated
3099 constant "compow" with infix syntax "^^". Power operation on
3100 multiplicative monoids retains syntax "^" and is now defined generic
3101 in class power. INCOMPATIBILITY.
3103 * Relation composition "R O S" now has a more standard argument order:
3104 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
3105 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
3106 break, since the O_assoc rule was not rewritten like this. Fix using
3107 O_assoc[symmetric]. The same applies to the curried version "R OO S".
3109 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
3110 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
3113 * Most rules produced by inductive and datatype package have mandatory
3114 prefixes. INCOMPATIBILITY.
3116 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
3117 the attribute of the same name. Each of the theorems in the list
3118 DERIV_intros assumes composition with an additional function and
3119 matches a variable to the derivative, which has to be solved by the
3120 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
3121 of most elementary terms. Former Maclauren.DERIV_tac and
3122 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
3125 * Code generator attributes follow the usual underscore convention:
3126 code_unfold replaces code unfold
3127 code_post replaces code post
3132 sizechange -> size_change
3133 induct_scheme -> induction_schema
3136 * Discontinued abbreviation "arbitrary" of constant "undefined".
3137 INCOMPATIBILITY, use "undefined" directly.
3140 Suc_eq_add_numeral_1 -> Suc_eq_plus1
3141 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
3142 Suc_plus1 -> Suc_eq_plus1
3143 *anti_sym -> *antisym*
3144 vector_less_eq_def -> vector_le_def
3147 * Added theorem List.map_map as [simp]. Removed List.map_compose.
3150 * Removed predicate "M hassize n" (<--> card M = n & finite M).
3156 * Theory Representable defines a class "rep" of domains that are
3157 representable (via an ep-pair) in the universal domain type "udom".
3158 Instances are provided for all type constructors defined in HOLCF.
3160 * The 'new_domain' command is a purely definitional version of the
3161 domain package, for representable domains. Syntax is identical to the
3162 old domain package. The 'new_domain' package also supports indirect
3163 recursion using previously-defined type constructors. See
3164 src/HOLCF/ex/New_Domain.thy for examples.
3166 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
3167 on the left-hand side of an equation, and then performs
3168 simplification. Rewriting is done using rules declared with the
3169 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
3170 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
3172 * The pattern-match compiler in 'fixrec' can now handle constructors
3173 with HOL function types. Pattern-match combinators for the Pair
3174 constructor are pre-configured.
3176 * The 'fixrec' package now produces better fixed-point induction rules
3177 for mutually-recursive definitions: Induction rules have conclusions
3178 of the form "P foo bar" instead of "P <foo, bar>".
3180 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
3181 been renamed to "below". The name "below" now replaces "less" in many
3182 theorem names. (Legacy theorem names using "less" are still supported
3185 * The 'fixrec' package now supports "bottom patterns". Bottom
3186 patterns can be used to generate strictness rules, or to make
3187 functions more strict (much like the bang-patterns supported by the
3188 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
3194 * Support for Poly/ML 5.3.0, with improved reporting of compiler
3195 errors and run-time exceptions, including detailed source positions.
3197 * Structure Name_Space (formerly NameSpace) now manages uniquely
3198 identified entries, with some additional information such as source
3199 position, logical grouping etc.
3201 * Theory and context data is now introduced by the simplified and
3202 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
3203 to be pure, but the old TheoryDataFun for mutable data (with explicit
3204 copy operation) is still available for some time.
3206 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
3207 provides a high-level programming interface to synchronized state
3208 variables with atomic update. This works via pure function
3209 application within a critical section -- its runtime should be as
3210 short as possible; beware of deadlocks if critical code is nested,
3211 either directly or indirectly via other synchronized variables!
3213 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
3214 wraps raw ML references, explicitly indicating their non-thread-safe
3215 behaviour. The Isar toplevel keeps this structure open, to
3216 accommodate Proof General as well as quick and dirty interactive
3217 experiments with references.
3219 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
3220 parallel tactical reasoning.
3222 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
3223 are similar to SUBPROOF, but are slightly more flexible: only the
3224 specified parts of the subgoal are imported into the context, and the
3225 body tactic may introduce new subgoals and schematic variables.
3227 * Old tactical METAHYPS, which does not observe the proof context, has
3228 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
3229 or Subgoal.FOCUS etc.
3231 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
3232 functors have their own ML name space there is no point to mark them
3233 separately.) Minor INCOMPATIBILITY.
3235 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
3237 * Renamed several structures FooBar to Foo_Bar. Occasional,
3240 * Operations of structure Skip_Proof no longer require quick_and_dirty
3241 mode, which avoids critical setmp.
3243 * Eliminated old Attrib.add_attributes, Method.add_methods and related
3244 combinators for "args". INCOMPATIBILITY, need to use simplified
3245 Attrib/Method.setup introduced in Isabelle2009.
3247 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
3248 back on global_simpset_of, global_claset_of, global_clasimpset_of as
3249 last resort. INCOMPATIBILITY.
3251 * Display.pretty_thm now requires a proper context (cf. former
3252 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
3253 or even Display.pretty_thm_without_context as last resort.
3256 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
3257 Syntax.pretty_typ/term directly, preferably with proper context
3258 instead of global theory.
3263 * Further fine tuning of parallel proof checking, scales up to 8 cores
3264 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
3267 * Support for additional "Isabelle components" via etc/components, see
3268 also the system manual.
3270 * The isabelle makeall tool now operates on all components with
3271 IsaMakefile, not just hardwired "logics".
3273 * Removed "compress" option from isabelle-process and isabelle usedir;
3274 this is always enabled.
3276 * Discontinued support for Poly/ML 4.x versions.
3278 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
3279 on a given logic image. This requires the lighttpd webserver and is
3280 currently supported on Linux only.
3284 New in Isabelle2009 (April 2009)
3285 --------------------------------
3289 * Simplified main Isabelle executables, with less surprises on
3290 case-insensitive file-systems (such as Mac OS).
3292 - The main Isabelle tool wrapper is now called "isabelle" instead of
3295 - The former "isabelle" alias for "isabelle-process" has been
3296 removed (should rarely occur to regular users).
3298 - The former "isabelle-interface" and its alias "Isabelle" have been
3299 removed (interfaces are now regular Isabelle tools).
3301 Within scripts and make files, the Isabelle environment variables
3302 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
3303 respectively. (The latter are still available as legacy feature.)
3305 The old isabelle-interface wrapper could react in confusing ways if
3306 the interface was uninstalled or changed otherwise. Individual
3307 interface tool configuration is now more explicit, see also the
3308 Isabelle system manual. In particular, Proof General is now available
3309 via "isabelle emacs".
3311 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
3312 purge installed copies of Isabelle executables and re-run "isabelle
3313 install -p ...", or use symlinks.
3315 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
3316 old ~/isabelle, which was slightly non-standard and apt to cause
3317 surprises on case-insensitive file-systems (such as Mac OS).
3319 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
3320 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
3321 care is required when using older releases of Isabelle. Note that
3322 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
3323 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
3325 * Proofs of fully specified statements are run in parallel on
3326 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
3327 a regular 4-core machine, if the initial heap space is made reasonably
3328 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
3330 * The main reference manuals ("isar-ref", "implementation", and
3331 "system") have been updated and extended. Formally checked references
3332 as hyperlinks are now available uniformly.
3337 * Complete re-implementation of locales. INCOMPATIBILITY in several
3338 respects. The most important changes are listed below. See the
3339 Tutorial on Locales ("locales" manual) for details.
3341 - In locale expressions, instantiation replaces renaming. Parameters
3342 must be declared in a for clause. To aid compatibility with previous
3343 parameter inheritance, in locale declarations, parameters that are not
3344 'touched' (instantiation position "_" or omitted) are implicitly added
3345 with their syntax at the beginning of the for clause.
3347 - Syntax from abbreviations and definitions in locales is available in
3348 locale expressions and context elements. The latter is particularly
3349 useful in locale declarations.
3351 - More flexible mechanisms to qualify names generated by locale
3352 expressions. Qualifiers (prefixes) may be specified in locale
3353 expressions, and can be marked as mandatory (syntax: "name!:") or
3354 optional (syntax "name?:"). The default depends for plain "name:"
3355 depends on the situation where a locale expression is used: in
3356 commands 'locale' and 'sublocale' prefixes are optional, in
3357 'interpretation' and 'interpret' prefixes are mandatory. The old
3358 implicit qualifiers derived from the parameter names of a locale are
3359 no longer generated.
3361 - Command "sublocale l < e" replaces "interpretation l < e". The
3362 instantiation clause in "interpretation" and "interpret" (square
3363 brackets) is no longer available. Use locale expressions.
3365 - When converting proof scripts, mandatory qualifiers in
3366 'interpretation' and 'interpret' should be retained by default, even
3367 if this is an INCOMPATIBILITY compared to former behavior. In the
3368 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
3369 in locale expressions range over a single locale instance only.
3371 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
3372 In existing theorem specifications replace the includes element by the
3373 respective context elements of the included locale, omitting those
3374 that are already present in the theorem specification. Multiple
3375 assume elements of a locale should be replaced by a single one
3376 involving the locale predicate. In the proof body, declarations (most
3377 notably theorems) may be regained by interpreting the respective
3378 locales in the proof context as required (command "interpret").
3380 If using "includes" in replacement of a target solely because the
3381 parameter types in the theorem are not as general as in the target,
3382 consider declaring a new locale with additional type constraints on
3383 the parameters (context element "constrains").
3385 - Discontinued "locale (open)". INCOMPATIBILITY.
3387 - Locale interpretation commands no longer attempt to simplify goal.
3388 INCOMPATIBILITY: in rare situations the generated goal differs. Use
3389 methods intro_locales and unfold_locales to clarify.
3391 - Locale interpretation commands no longer accept interpretation
3392 attributes. INCOMPATIBILITY.
3394 * Class declaration: so-called "base sort" must not be given in import
3395 list any longer, but is inferred from the specification. Particularly
3402 class foo = type + ...
3404 * Class target: global versions of theorems stemming do not carry a
3405 parameter prefix any longer. INCOMPATIBILITY.
3407 * Class 'instance' command no longer accepts attached definitions.
3408 INCOMPATIBILITY, use proper 'instantiation' target instead.
3410 * Recovered hiding of consts, which was accidentally broken in
3411 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
3412 makes c inaccessible; consider using ``hide (open) const c'' instead.
3414 * Slightly more coherent Pure syntax, with updated documentation in
3415 isar-ref manual. Removed locales meta_term_syntax and
3416 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
3417 INCOMPATIBILITY in rare situations. Note that &&& should not be used
3418 directly in regular applications.
3420 * There is a new syntactic category "float_const" for signed decimal
3421 fractions (e.g. 123.45 or -123.45).
3423 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
3424 interface with 'setup' command instead.
3426 * Command 'local_setup' is similar to 'setup', but operates on a local
3429 * The 'axiomatization' command now only works within a global theory
3430 context. INCOMPATIBILITY.
3432 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
3433 hypotheses. Sorts required in the course of reasoning need to be
3434 covered by the constraints in the initial statement, completed by the
3435 type instance information of the background theory. Non-trivial sort
3436 hypotheses, which rarely occur in practice, may be specified via
3437 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
3439 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
3441 The result contains an implicit sort hypotheses as before --
3442 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
3445 * Generalized Isar history, with support for linear undo, direct state
3448 * Changed defaults for unify configuration options:
3450 unify_trace_bound = 50 (formerly 25)
3451 unify_search_bound = 60 (formerly 30)
3453 * Different bookkeeping for code equations (INCOMPATIBILITY):
3455 a) On theory merge, the last set of code equations for a particular
3456 constant is taken (in accordance with the policy applied by other
3457 parts of the code generator framework).
3459 b) Code equations stemming from explicit declarations (e.g. code
3460 attribute) gain priority over default code equations stemming
3461 from definition, primrec, fun etc.
3463 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
3465 * Unified theorem tables for both code generators. Thus [code
3466 func] has disappeared and only [code] remains. INCOMPATIBILITY.
3468 * Command 'find_consts' searches for constants based on type and name
3471 find_consts "_ => bool"
3473 By default, matching is against subtypes, but it may be restricted to
3474 the whole type. Searching by name is possible. Multiple queries are
3475 conjunctive and queries may be negated by prefixing them with a
3478 find_consts strict: "_ => bool" name: "Int" -"int => int"
3480 * New 'find_theorems' criterion "solves" matches theorems that
3481 directly solve the current goal (modulo higher-order unification).
3483 * Auto solve feature for main theorem statements: whenever a new goal
3484 is stated, "find_theorems solves" is called; any theorems that could
3485 solve the lemma directly are listed as part of the goal state.
3486 Cf. associated options in Proof General Isabelle settings menu,
3487 enabled by default, with reasonable timeout for pathological cases of
3488 higher-order unification.
3491 *** Document preparation ***
3493 * Antiquotation @{lemma} now imitates a regular terminal proof,
3494 demanding keyword 'by' and supporting the full method expression
3495 syntax just like the Isar command 'by'.
3500 * Integrated main parts of former image HOL-Complex with HOL. Entry
3501 points Main and Complex_Main remain as before.
3503 * Logic image HOL-Plain provides a minimal HOL with the most important
3504 tools available (inductive, datatype, primrec, ...). This facilitates
3505 experimentation and tool development. Note that user applications
3506 (and library theories) should never refer to anything below theory
3509 * Logic image HOL-Main stops at theory Main, and thus facilitates
3510 experimentation due to shorter build times.
3512 * Logic image HOL-NSA contains theories of nonstandard analysis which
3513 were previously part of former HOL-Complex. Entry point Hyperreal
3514 remains valid, but theories formerly using Complex_Main should now use
3515 new entry point Hypercomplex.
3517 * Generic ATP manager for Sledgehammer, based on ML threads instead of
3518 Posix processes. Avoids potentially expensive forking of the ML
3519 process. New thread-based implementation also works on non-Unix
3520 platforms (Cygwin). Provers are no longer hardwired, but defined
3521 within the theory via plain ML wrapper functions. Basic Sledgehammer
3522 commands are covered in the isar-ref manual.
3524 * Wrapper scripts for remote SystemOnTPTP service allows to use
3525 sledgehammer without local ATP installation (Vampire etc.). Other
3526 provers may be included via suitable ML wrappers, see also
3527 src/HOL/ATP_Linkup.thy.
3529 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
3532 * The metis method no longer fails because the theorem is too trivial
3533 (contains the empty clause).
3535 * The metis method now fails in the usual manner, rather than raising
3536 an exception, if it determines that it cannot prove the theorem.
3538 * Method "coherent" implements a prover for coherent logic (see also
3539 src/Tools/coherent.ML).
3541 * Constants "undefined" and "default" replace "arbitrary". Usually
3542 "undefined" is the right choice to replace "arbitrary", though
3543 logically there is no difference. INCOMPATIBILITY.
3545 * Command "value" now integrates different evaluation mechanisms. The
3546 result of the first successful evaluation mechanism is printed. In
3547 square brackets a particular named evaluation mechanisms may be
3548 specified (currently, [SML], [code] or [nbe]). See further
3549 src/HOL/ex/Eval_Examples.thy.
3551 * Normalization by evaluation now allows non-leftlinear equations.
3552 Declare with attribute [code nbe].
3554 * Methods "case_tac" and "induct_tac" now refer to the very same rules
3555 as the structured Isar versions "cases" and "induct", cf. the
3556 corresponding "cases" and "induct" attributes. Mutual induction rules
3557 are now presented as a list of individual projections
3558 (e.g. foo_bar.inducts for types foo and bar); the old format with
3559 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
3560 rare situations a different rule is selected --- notably nested tuple
3561 elimination instead of former prod.exhaust: use explicit (case_tac t
3562 rule: prod.exhaust) here.
3564 * Attributes "cases", "induct", "coinduct" support "del" option.
3566 * Removed fact "case_split_thm", which duplicates "case_split".
3568 * The option datatype has been moved to a new theory Option. Renamed
3569 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
3571 * New predicate "strict_mono" classifies strict functions on partial
3572 orders. With strict functions on linear orders, reasoning about
3573 (in)equalities is facilitated by theorems "strict_mono_eq",
3574 "strict_mono_less_eq" and "strict_mono_less".
3576 * Some set operations are now proper qualified constants with
3577 authentic syntax. INCOMPATIBILITY:
3588 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
3591 * Auxiliary class "itself" has disappeared -- classes without any
3592 parameter are treated as expected by the 'class' command.
3594 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
3596 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
3597 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
3599 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
3600 method "approximation". It proves formulas on real values by using
3601 interval arithmetic. In the formulas are also the transcendental
3602 functions sin, cos, tan, atan, ln, exp and the constant pi are
3603 allowed. For examples see
3604 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
3606 * Theory "Reflection" now resides in HOL/Library.
3608 * Entry point to Word library now simply named "Word".
3611 * Made source layout more coherent with logical distribution
3614 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
3615 src/HOL/Library/Code_Message.thy ~> src/HOL/
3616 src/HOL/Library/GCD.thy ~> src/HOL/
3617 src/HOL/Library/Order_Relation.thy ~> src/HOL/
3618 src/HOL/Library/Parity.thy ~> src/HOL/
3619 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
3620 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
3621 src/HOL/Real/Lubs.thy ~> src/HOL/
3622 src/HOL/Real/PReal.thy ~> src/HOL/
3623 src/HOL/Real/Rational.thy ~> src/HOL/
3624 src/HOL/Real/RComplete.thy ~> src/HOL/
3625 src/HOL/Real/RealDef.thy ~> src/HOL/
3626 src/HOL/Real/RealPow.thy ~> src/HOL/
3627 src/HOL/Real/Real.thy ~> src/HOL/
3628 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
3629 src/HOL/Complex/Complex.thy ~> src/HOL/
3630 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
3631 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
3632 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
3633 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
3634 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
3635 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
3636 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
3637 src/HOL/Hyperreal/Log.thy ~> src/HOL/
3638 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
3639 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
3640 src/HOL/Hyperreal/Series.thy ~> src/HOL/
3641 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
3642 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
3643 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
3644 src/HOL/Real/Float ~> src/HOL/Library/
3645 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
3646 src/HOL/Real/RealVector.thy ~> src/HOL/
3648 src/HOL/arith_data.ML ~> src/HOL/Tools
3649 src/HOL/hologic.ML ~> src/HOL/Tools
3650 src/HOL/simpdata.ML ~> src/HOL/Tools
3651 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
3652 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
3653 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
3654 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
3655 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
3656 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
3657 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
3659 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
3660 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
3661 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
3662 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
3663 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
3664 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
3666 * If methods "eval" and "evaluation" encounter a structured proof
3667 state with !!/==>, only the conclusion is evaluated to True (if
3668 possible), avoiding strange error messages.
3670 * Method "sizechange" automates termination proofs using (a
3671 modification of) the size-change principle. Requires SAT solver. See
3672 src/HOL/ex/Termination.thy for examples.
3674 * Simplifier: simproc for let expressions now unfolds if bound
3675 variable occurs at most once in let expression body. INCOMPATIBILITY.
3677 * Method "arith": Linear arithmetic now ignores all inequalities when
3678 fast_arith_neq_limit is exceeded, instead of giving up entirely.
3680 * New attribute "arith" for facts that should always be used
3681 automatically by arithmetic. It is intended to be used locally in
3684 assumes [arith]: "x > 0"
3686 Global usage is discouraged because of possible performance impact.
3688 * New classes "top" and "bot" with corresponding operations "top" and
3689 "bot" in theory Orderings; instantiation of class "complete_lattice"
3690 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
3692 * Changed definition lemma "less_fun_def" in order to provide an
3693 instance for preorders on functions; use lemma "less_le" instead.
3696 * Theory Orderings: class "wellorder" moved here, with explicit
3697 induction rule "less_induct" as assumption. For instantiation of
3698 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
3701 * Theory Orderings: added class "preorder" as superclass of "order".
3702 INCOMPATIBILITY: Instantiation proofs for order, linorder
3703 etc. slightly changed. Some theorems named order_class.* now named
3706 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
3709 * Theory Finite_Set: added a new fold combinator of type
3711 ('a => 'b => 'b) => 'b => 'a set => 'b
3713 Occasionally this is more convenient than the old fold combinator
3714 which is now defined in terms of the new one and renamed to
3717 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
3718 and "ring_simps" have been replaced by "algebra_simps" (which can be
3719 extended with further lemmas!). At the moment both still exist but
3720 the former will disappear at some point.
3722 * Theory Power: Lemma power_Suc is now declared as a simp rule in
3723 class recpower. Type-specific simp rules for various recpower types
3724 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
3726 rat_power_0 -> power_0
3727 rat_power_Suc -> power_Suc
3728 realpow_0 -> power_0
3729 realpow_Suc -> power_Suc
3730 complexpow_0 -> power_0
3731 complexpow_Suc -> power_Suc
3732 power_poly_0 -> power_0
3733 power_poly_Suc -> power_Suc
3735 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
3736 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
3737 dvd has been generalized to class comm_semiring_1. Likewise a bunch
3738 of lemmas from Divides has been generalized from nat to class
3739 semiring_div. INCOMPATIBILITY. This involves the following theorem
3740 renames resulting from duplicate elimination:
3742 dvd_def_mod ~> dvd_eq_mod_eq_0
3743 zero_dvd_iff ~> dvd_0_left_iff
3744 dvd_0 ~> dvd_0_right
3745 DIVISION_BY_ZERO_DIV ~> div_by_0
3746 DIVISION_BY_ZERO_MOD ~> mod_by_0
3747 mult_div ~> div_mult_self2_is_id
3748 mult_mod ~> mod_mult_self2_is_0
3750 * Theory IntDiv: removed many lemmas that are instances of class-based
3751 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
3752 rename old lemmas as follows:
3754 dvd_diff -> nat_dvd_diff
3755 dvd_zminus_iff -> dvd_minus_iff
3756 mod_add1_eq -> mod_add_eq
3757 mod_mult1_eq -> mod_mult_right_eq
3758 mod_mult1_eq' -> mod_mult_left_eq
3759 mod_mult_distrib_mod -> mod_mult_eq
3760 nat_mod_add_left_eq -> mod_add_left_eq
3761 nat_mod_add_right_eq -> mod_add_right_eq
3762 nat_mod_div_trivial -> mod_div_trivial
3763 nat_mod_mod_trivial -> mod_mod_trivial
3764 zdiv_zadd_self1 -> div_add_self1
3765 zdiv_zadd_self2 -> div_add_self2
3766 zdiv_zmult_self1 -> div_mult_self2_is_id
3767 zdiv_zmult_self2 -> div_mult_self1_is_id
3768 zdvd_triv_left -> dvd_triv_left
3769 zdvd_triv_right -> dvd_triv_right
3770 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
3771 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
3772 zmod_zadd_left_eq -> mod_add_left_eq
3773 zmod_zadd_right_eq -> mod_add_right_eq
3774 zmod_zadd_self1 -> mod_add_self1
3775 zmod_zadd_self2 -> mod_add_self2
3776 zmod_zadd1_eq -> mod_add_eq
3777 zmod_zdiff1_eq -> mod_diff_eq
3778 zmod_zdvd_zmod -> mod_mod_cancel
3779 zmod_zmod_cancel -> mod_mod_cancel
3780 zmod_zmult_self1 -> mod_mult_self2_is_0
3781 zmod_zmult_self2 -> mod_mult_self1_is_0
3784 zdvd_abs1 -> abs_dvd_iff
3785 zdvd_abs2 -> dvd_abs_iff
3786 zdvd_refl -> dvd_refl
3787 zdvd_trans -> dvd_trans
3788 zdvd_zadd -> dvd_add
3789 zdvd_zdiff -> dvd_diff
3790 zdvd_zminus_iff -> dvd_minus_iff
3791 zdvd_zminus2_iff -> minus_dvd_iff
3792 zdvd_zmultD -> dvd_mult_right
3793 zdvd_zmultD2 -> dvd_mult_left
3794 zdvd_zmult_mono -> mult_dvd_mono
3795 zdvd_0_right -> dvd_0_right
3796 zdvd_0_left -> dvd_0_left_iff
3797 zdvd_1_left -> one_dvd
3798 zminus_dvd_iff -> minus_dvd_iff
3800 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
3802 * The real numbers offer decimal input syntax: 12.34 is translated
3803 into 1234/10^2. This translation is not reversed upon output.
3805 * Theory Library/Polynomial defines an abstract type 'a poly of
3806 univariate polynomials with coefficients of type 'a. In addition to
3807 the standard ring operations, it also supports div and mod. Code
3808 generation is also supported, using list-style constructors.
3810 * Theory Library/Inner_Product defines a class of real_inner for real
3811 inner product spaces, with an overloaded operation inner :: 'a => 'a
3812 => real. Class real_inner is a subclass of real_normed_vector from
3815 * Theory Library/Product_Vector provides instances for the product
3816 type 'a * 'b of several classes from RealVector and Inner_Product.
3817 Definitions of addition, subtraction, scalar multiplication, norms,
3818 and inner products are included.
3820 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
3821 addition to the field operations, numerals and case syntax are also
3824 * Theory Library/Diagonalize provides constructive version of Cantor's
3825 first diagonalization argument.
3827 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
3828 zlcm (for int); carried together from various gcd/lcm developements in
3829 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
3830 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
3831 may recover tupled syntax as follows:
3833 hide (open) const gcd
3834 abbreviation gcd where
3835 "gcd == (%(a, b). GCD.gcd a b)"
3837 GCD.gcd ("gcd '(_, _')")
3839 The same works for lcm, zgcd, zlcm.
3841 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
3842 instantiations for algebraic structures. Removed some duplicate
3843 theorems. Changes in simp rules. INCOMPATIBILITY.
3845 * ML antiquotation @{code} takes a constant as argument and generates
3846 corresponding code in background and inserts name of the corresponding
3847 resulting ML value/function/datatype constructor binding in place.
3848 All occurrences of @{code} with a single ML block are generated
3849 simultaneously. Provides a generic and safe interface for
3850 instrumentalizing code generation. See
3851 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
3852 In future you ought to refrain from ad-hoc compiling generated SML
3853 code on the ML toplevel. Note that (for technical reasons) @{code}
3854 cannot refer to constants for which user-defined serializations are
3855 set. Refer to the corresponding ML counterpart directly in that
3858 * Command 'rep_datatype': instead of theorem names the command now
3859 takes a list of terms denoting the constructors of the type to be
3860 represented as datatype. The characteristic theorems have to be
3861 proven. INCOMPATIBILITY. Also observe that the following theorems
3862 have disappeared in favour of existing ones:
3864 unit_induct ~> unit.induct
3865 prod_induct ~> prod.induct
3866 sum_induct ~> sum.induct
3867 Suc_Suc_eq ~> nat.inject
3868 Suc_not_Zero Zero_not_Suc ~> nat.distinct
3873 * New locales for orders and lattices where the equivalence relation
3874 is not restricted to equality. INCOMPATIBILITY: all order and lattice
3875 locales use a record structure with field eq for the equivalence.
3877 * New theory of factorial domains.
3879 * Units_l_inv and Units_r_inv are now simp rules by default.
3880 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
3881 and/or r_inv will now also require deletion of these lemmas.
3883 * Renamed the following theorems, INCOMPATIBILITY:
3885 UpperD ~> Upper_memD
3886 LowerD ~> Lower_memD
3887 least_carrier ~> least_closed
3888 greatest_carrier ~> greatest_closed
3889 greatest_Lower_above ~> greatest_Lower_below
3890 one_zero ~> carrier_one_zero
3891 one_not_zero ~> carrier_one_not_zero (collision with assumption)
3896 * Nominal datatypes can now contain type-variables.
3898 * Commands 'nominal_inductive' and 'equivariance' work with local
3901 * Nominal primrec can now works with local theory targets and its
3902 specification syntax now conforms to the general format as seen in
3905 * Method "perm_simp" honours the standard simplifier attributes
3906 (no_asm), (no_asm_use) etc.
3908 * The new predicate #* is defined like freshness, except that on the
3909 left hand side can be a set or list of atoms.
3911 * Experimental command 'nominal_inductive2' derives strong induction
3912 principles for inductive definitions. In contrast to
3913 'nominal_inductive', which can only deal with a fixed number of
3914 binders, it can deal with arbitrary expressions standing for sets of
3915 atoms to be avoided. The only inductive definition we have at the
3916 moment that needs this generalisation is the typing rule for Lets in
3919 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
3920 -----------------------------------------------------------------
3921 Gamma |- Let x be t1 in t2 : T2
3923 In this rule one wants to avoid all the binders that are introduced by
3924 "close Gamma T1". We are looking for other examples where this
3925 feature might be useful. Please let us know.
3930 * Reimplemented the simplification procedure for proving continuity
3931 subgoals. The new simproc is extensible; users can declare additional
3932 continuity introduction rules with the attribute [cont2cont].
3934 * The continuity simproc now uses a different introduction rule for
3935 solving continuity subgoals on terms with lambda abstractions. In
3936 some rare cases the new simproc may fail to solve subgoals that the
3937 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
3938 Potential INCOMPATIBILITY.
3940 * Command 'fixrec': specification syntax now conforms to the general
3941 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
3942 examples. INCOMPATIBILITY.
3947 * Proof of Zorn's Lemma for partial orders.
3952 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
3953 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
3954 depends on multithreading, so timouts will not work before Poly/ML
3957 * High-level support for concurrent ML programming, see
3958 src/Pure/Cuncurrent. The data-oriented model of "future values" is
3959 particularly convenient to organize independent functional
3960 computations. The concept of "synchronized variables" provides a
3961 higher-order interface for components with shared state, avoiding the
3962 delicate details of mutexes and condition variables. (Requires
3963 Poly/ML 5.2.1 or later.)
3965 * ML bindings produced via Isar commands are stored within the Isar
3966 context (theory or proof). Consequently, commands like 'use' and 'ML'
3967 become thread-safe and work with undo as expected (concerning
3968 top-level bindings, not side-effects on global references).
3969 INCOMPATIBILITY, need to provide proper Isar context when invoking the
3970 compiler at runtime; really global bindings need to be given outside a
3971 theory. (Requires Poly/ML 5.2 or later.)
3973 * Command 'ML_prf' is analogous to 'ML' but works within a proof
3974 context. Top-level ML bindings are stored within the proof context in
3975 a purely sequential fashion, disregarding the nested proof structure.
3976 ML bindings introduced by 'ML_prf' are discarded at the end of the
3977 proof. (Requires Poly/ML 5.2 or later.)
3979 * Simplified ML attribute and method setup, cf. functions Attrib.setup
3980 and Method.setup, as well as Isar commands 'attribute_setup' and
3981 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
3982 existing code accordingly, or use plain 'setup' together with old
3985 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
3986 to 'a -> thm, while results are always tagged with an authentic oracle
3987 name. The Isar command 'oracle' is now polymorphic, no argument type
3988 is specified. INCOMPATIBILITY, need to simplify existing oracle code
3989 accordingly. Note that extra performance may be gained by producing
3990 the cterm carefully, avoiding slow Thm.cterm_of.
3992 * Simplified interface for defining document antiquotations via
3993 ThyOutput.antiquotation, ThyOutput.output, and optionally
3994 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
3995 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
3998 * More systematic treatment of long names, abstract name bindings, and
3999 name space operations. Basic operations on qualified names have been
4000 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
4001 Long_Name.append. Old type bstring has been mostly replaced by
4002 abstract type binding (see structure Binding), which supports precise
4003 qualification by packages and local theory targets, as well as proper
4004 tracking of source positions. INCOMPATIBILITY, need to wrap old
4005 bstring values into Binding.name, or better pass through abstract
4006 bindings everywhere. See further src/Pure/General/long_name.ML,
4007 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
4009 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
4010 LocalTheory.note etc.) now refer to the *full* internal name, not the
4011 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
4013 * Disposed old type and term read functions (Sign.read_def_typ,
4014 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
4015 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
4016 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
4017 Syntax.read_term_global etc.; see also OldGoals.read_term as last
4018 resort for legacy applications.
4020 * Disposed old declarations, tactics, tactic combinators that refer to
4021 the simpset or claset of an implicit theory (such as Addsimps,
4022 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
4023 embedded ML text, or local_simpset_of with a proper context passed as
4024 explicit runtime argument.
4026 * Rules and tactics that read instantiations (read_instantiate,
4027 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
4028 context, which is required for parsing and type-checking. Moreover,
4029 the variables are specified as plain indexnames, not string encodings
4030 thereof. INCOMPATIBILITY.
4032 * Generic Toplevel.add_hook interface allows to analyze the result of
4033 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
4034 for theorem dependency output of transactions resulting in a new
4037 * ML antiquotations: block-structured compilation context indicated by
4038 \<lbrace> ... \<rbrace>; additional antiquotation forms:
4040 @{binding name} - basic name binding
4041 @{let ?pat = term} - term abbreviation (HO matching)
4042 @{note name = fact} - fact abbreviation
4043 @{thm fact} - singleton fact (with attributes)
4044 @{thms fact} - general fact (with attributes)
4045 @{lemma prop by method} - singleton goal
4046 @{lemma prop by meth1 meth2} - singleton goal
4047 @{lemma prop1 ... propN by method} - general goal
4048 @{lemma prop1 ... propN by meth1 meth2} - general goal
4049 @{lemma (open) ...} - open derivation
4054 * The Isabelle "emacs" tool provides a specific interface to invoke
4055 Proof General / Emacs, with more explicit failure if that is not
4056 installed (the old isabelle-interface script silently falls back on
4057 isabelle-process). The PROOFGENERAL_HOME setting determines the
4058 installation location of the Proof General distribution.
4060 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
4061 the Isabelle process into a JVM/Scala application. See
4062 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
4063 process wrapper has been discontinued.)
4065 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
4067 * Various status messages (with exact source position information) are
4068 emitted, if proper markup print mode is enabled. This allows
4069 user-interface components to provide detailed feedback on internal
4074 New in Isabelle2008 (June 2008)
4075 -------------------------------
4079 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
4080 and updated, with formally checked references as hyperlinks.
4082 * Theory loader: use_thy (and similar operations) no longer set the
4083 implicit ML context, which was occasionally hard to predict and in
4084 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
4085 provides a proper context already.
4087 * Theory loader: old-style ML proof scripts being *attached* to a thy
4088 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
4089 'use' within a theory file will do the job.
4091 * Name space merge now observes canonical order, i.e. the second space
4092 is inserted into the first one, while existing entries in the first
4093 space take precedence. INCOMPATIBILITY in rare situations, may try to
4094 swap theory imports.
4096 * Syntax: symbol \<chi> is now considered a letter. Potential
4097 INCOMPATIBILITY in identifier syntax etc.
4099 * Outer syntax: string tokens no longer admit escaped white space,
4100 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
4101 white space without escapes.
4103 * Outer syntax: string tokens may contain arbitrary character codes
4104 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
4110 * Context-dependent token translations. Default setup reverts locally
4111 fixed variables, and adds hilite markup for undeclared frees.
4113 * Unused theorems can be found using the new command 'unused_thms'.
4114 There are three ways of invoking it:
4117 Only finds unused theorems in the current theory.
4119 (2) unused_thms thy_1 ... thy_n -
4120 Finds unused theorems in the current theory and all of its ancestors,
4121 excluding the theories thy_1 ... thy_n and all of their ancestors.
4123 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
4124 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
4125 their ancestors, excluding the theories thy_1 ... thy_n and all of
4128 In order to increase the readability of the list produced by
4129 unused_thms, theorems that have been created by a particular instance
4130 of a theory command such as 'inductive' or 'function' are considered
4131 to belong to the same "group", meaning that if at least one theorem in
4132 this group is used, the other theorems in the same group are no longer
4133 reported as unused. Moreover, if all theorems in the group are
4134 unused, only one theorem in the group is displayed.
4136 Note that proof objects have to be switched on in order for
4137 unused_thms to work properly (i.e. !proofs must be >= 1, which is
4138 usually the case when using Proof General with the default settings).
4140 * Authentic naming of facts disallows ad-hoc overwriting of previous
4141 theorems within the same name space. INCOMPATIBILITY, need to remove
4142 duplicate fact bindings, or even accidental fact duplications. Note
4143 that tools may maintain dynamically scoped facts systematically, using
4144 PureThy.add_thms_dynamic.
4146 * Command 'hide' now allows to hide from "fact" name space as well.
4148 * Eliminated destructive theorem database, simpset, claset, and
4149 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
4150 update of theories within ML code.
4152 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
4153 INCOMPATIBILITY, object-logics depending on former Pure require
4154 additional setup PureThy.old_appl_syntax_setup; object-logics
4155 depending on former CPure need to refer to Pure.
4157 * Commands 'use' and 'ML' are now purely functional, operating on
4158 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
4159 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
4162 * Command 'setup': discontinued implicit version with ML reference.
4164 * Instantiation target allows for simultaneous specification of class
4165 instance operations together with an instantiation proof.
4166 Type-checking phase allows to refer to class operations uniformly.
4167 See src/HOL/Complex/Complex.thy for an Isar example and
4168 src/HOL/Library/Eval.thy for an ML example.
4170 * Indexing of literal facts: be more serious about including only
4171 facts from the visible specification/proof context, but not the
4172 background context (locale etc.). Affects `prop` notation and method
4173 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
4176 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
4177 "(open)" option, which used to expose internal bound variables to the
4180 * Isar statements: removed obsolete case "rule_context".
4181 INCOMPATIBILITY, better use explicit fixes/assumes.
4183 * Locale proofs: default proof step now includes 'unfold_locales';
4184 hence 'proof' without argument may be used to unfold locale
4188 *** Document preparation ***
4190 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
4191 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
4192 obsolete thumbpdf setup (contemporary PDF viewers do this on the
4193 spot); renamed link color from "darkblue" to "linkcolor" (default
4194 value unchanged, can be redefined via \definecolor); no longer sets
4195 "a4paper" option (unnecessary or even intrusive).
4197 * Antiquotation @{lemma A method} proves proposition A by the given
4198 method (either a method name or a method name plus (optional) method
4199 arguments in parentheses) and prints A just like @{prop A}.
4204 * New primrec package. Specification syntax conforms in style to
4205 definition/function/.... No separate induction rule is provided. The
4206 "primrec" command distinguishes old-style and new-style specifications
4207 by syntax. The former primrec package is now named OldPrimrecPackage.
4208 When adjusting theories, beware: constants stemming from new-style
4209 primrec specifications have authentic syntax.
4211 * Metis prover is now an order of magnitude faster, and also works
4212 with multithreading.
4214 * Metis: the maximum number of clauses that can be produced from a
4215 theorem is now given by the attribute max_clauses. Theorems that
4216 exceed this number are ignored, with a warning printed.
4218 * Sledgehammer no longer produces structured proofs by default. To
4219 enable, declare [[sledgehammer_full = true]]. Attributes
4220 reconstruction_modulus, reconstruction_sorts renamed
4221 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
4223 * Method "induct_scheme" derives user-specified induction rules
4224 from well-founded induction and completeness of patterns. This factors
4225 out some operations that are done internally by the function package
4226 and makes them available separately. See
4227 src/HOL/ex/Induction_Scheme.thy for examples.
4229 * More flexible generation of measure functions for termination
4230 proofs: Measure functions can be declared by proving a rule of the
4231 form "is_measure f" and giving it the [measure_function] attribute.
4232 The "is_measure" predicate is logically meaningless (always true), and
4233 just guides the heuristic. To find suitable measure functions, the
4234 termination prover sets up the goal "is_measure ?f" of the appropriate
4235 type and generates all solutions by prolog-style backwards proof using
4238 This setup also deals with rules like
4240 "is_measure f ==> is_measure (list_size f)"
4242 which accommodates nested datatypes that recurse through lists.
4243 Similar rules are predeclared for products and option types.
4245 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
4249 - Definitions of overloaded constants on sets have to be replaced by
4250 definitions on => and bool.
4252 - Some definitions of overloaded operators on sets can now be proved
4253 using the definitions of the operators on => and bool. Therefore,
4254 the following theorems have been renamed:
4256 subset_def -> subset_eq
4257 psubset_def -> psubset_eq
4258 set_diff_def -> set_diff_eq
4259 Compl_def -> Compl_eq
4260 Sup_set_def -> Sup_set_eq
4261 Inf_set_def -> Inf_set_eq
4262 sup_set_def -> sup_set_eq
4263 inf_set_def -> inf_set_eq
4265 - Due to the incompleteness of the HO unification algorithm, some
4266 rules such as subst may require manual instantiation, if some of
4267 the unknowns in the rule is a set.
4269 - Higher order unification and forward proofs:
4272 have "P (S::'a set)" <...>
4273 then have "EX S. P S" ..
4275 no longer works (due to the incompleteness of the HO unification
4276 algorithm) and must be replaced by the pattern
4283 - Calculational reasoning with subst (or similar rules):
4286 have "P (S::'a set)" <...>
4287 also have "S = T" <...>
4288 finally have "P T" .
4290 no longer works (for similar reasons as the previous example) and
4291 must be replaced by something like
4293 have "P (S::'a set)" <...>
4294 moreover have "S = T" <...>
4295 ultimately have "P T" by simp
4297 - Tactics or packages written in ML code:
4298 Code performing pattern matching on types via
4300 Type ("set", [T]) => ...
4302 must be rewritten. Moreover, functions like strip_type or
4303 binder_types no longer return the right value when applied to a
4306 T1 => ... => Tn => U => bool
4310 T1 => ... => Tn => U set
4312 * Merged theories Wellfounded_Recursion, Accessible_Part and
4313 Wellfounded_Relations to theory Wellfounded.
4315 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
4317 * Class finite no longer treats UNIV as class parameter. Use class
4318 enum from theory Library/Enum instead to achieve a similar effect.
4321 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
4322 and "Cons". INCOMPATIBILITY.
4324 * HOL (and FOL): renamed variables in rules imp_elim and swap.
4325 Potential INCOMPATIBILITY.
4327 * Theory Product_Type: duplicated lemmas split_Pair_apply and
4328 injective_fst_snd removed, use split_eta and prod_eqI instead.
4329 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
4331 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
4332 the same name in theory Orderings:
4342 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
4343 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
4344 and different variable names.
4346 * Library/Option_ord.thy: Canonical order on option type.
4348 * Library/RBT.thy: Red-black trees, an efficient implementation of
4351 * Library/Countable.thy: Type class for countable types.
4353 * Theory Int: The representation of numerals has changed. The infix
4354 operator BIT and the bit datatype with constructors B0 and B1 have
4355 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
4356 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
4357 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
4360 * Theory Nat: definition of <= and < on natural numbers no longer
4361 depend on well-founded relations. INCOMPATIBILITY. Definitions
4362 le_def and less_def have disappeared. Consider lemmas not_less
4363 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
4365 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
4366 (whose purpose mainly is for various fold_set functionals) have been
4367 abandoned in favor of the existing algebraic classes
4368 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
4369 lower_semilattice (resp. upper_semilattice) and linorder.
4372 * Theory Transitive_Closure: induct and cases rules now declare proper
4373 case_names ("base" and "step"). INCOMPATIBILITY.
4375 * Theorem Inductive.lfp_ordinal_induct generalized to complete
4376 lattices. The form set-specific version is available as
4377 Inductive.lfp_ordinal_induct_set.
4379 * Renamed theorems "power.simps" to "power_int.simps".
4382 * Class semiring_div provides basic abstract properties of semirings
4383 with division and modulo operations. Subsumes former class dvd_mod.
4385 * Merged theories IntDef, Numeral and IntArith into unified theory
4386 Int. INCOMPATIBILITY.
4388 * Theory Library/Code_Index: type "index" now represents natural
4389 numbers rather than integers. INCOMPATIBILITY.
4391 * New class "uminus" with operation "uminus" (split of from class
4392 "minus" which now only has operation "minus", binary).
4395 * Constants "card", "internal_split", "option_map" now with authentic
4396 syntax. INCOMPATIBILITY.
4398 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
4399 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
4400 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
4401 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
4402 Sup_set_def, le_def, less_def, option_map_def now with object
4403 equality. INCOMPATIBILITY.
4405 * Records. Removed K_record, and replaced it by pure lambda term
4406 %x. c. The simplifier setup is now more robust against eta expansion.
4407 INCOMPATIBILITY: in cases explicitly referring to K_record.
4409 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
4411 * Library/ListVector: new theory of arithmetic vector operations.
4413 * Library/Order_Relation: new theory of various orderings as sets of
4414 pairs. Defines preorders, partial orders, linear orders and
4415 well-orders on sets and on types.
4420 * Renamed some theories to allow to loading both ZF and HOL in the
4423 Datatype -> Datatype_ZF
4424 Inductive -> Inductive_ZF
4431 INCOMPATIBILITY: ZF theories that import individual theories below
4432 Main might need to be adapted. Regular theory Main is still
4433 available, as trivial extension of Main_ZF.
4438 * ML within Isar: antiquotation @{const name} or @{const
4439 name(typargs)} produces statically-checked Const term.
4441 * Functor NamedThmsFun: data is available to the user as dynamic fact
4442 (of the same name). Removed obsolete print command.
4444 * Removed obsolete "use_legacy_bindings" function.
4446 * The ``print mode'' is now a thread-local value derived from a global
4447 template (the former print_mode reference), thus access becomes
4448 non-critical. The global print_mode reference is for session
4449 management only; user-code should use print_mode_value,
4450 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
4452 * Functions system/system_out provide a robust way to invoke external
4453 shell commands, with propagation of interrupts (requires Poly/ML
4454 5.2.1). Do not use OS.Process.system etc. from the basis library!
4459 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
4460 in accordance with Proof General 3.7, which prefers GNU emacs.
4462 * isatool tty runs Isabelle process with plain tty interaction;
4463 optional line editor may be specified via ISABELLE_LINE_EDITOR
4464 setting, the default settings attempt to locate "ledit" and "rlwrap".
4466 * isatool browser now works with Cygwin as well, using general
4467 "javapath" function defined in Isabelle process environment.
4469 * YXML notation provides a simple and efficient alternative to
4470 standard XML transfer syntax. See src/Pure/General/yxml.ML and
4471 isatool yxml as described in the Isabelle system manual.
4473 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
4474 provides general wrapper for managing an Isabelle process in a robust
4475 fashion, with ``cooked'' output from stdin/stderr.
4477 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
4478 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
4480 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
4481 way of changing the user's settings is via
4482 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
4485 * Multithreading.max_threads := 0 refers to the number of actual CPU
4486 cores of the underlying machine, which is a good starting point for
4487 optimal performance tuning. The corresponding usedir option -M allows
4488 "max" as an alias for "0". WARNING: does not work on certain versions
4489 of Mac OS (with Poly/ML 5.1).
4491 * isabelle-process: non-ML sessions are run with "nice", to reduce the
4492 adverse effect of Isabelle flooding interactive front-ends (notably
4493 ProofGeneral / XEmacs).
4497 New in Isabelle2007 (November 2007)
4498 -----------------------------------
4502 * More uniform information about legacy features, notably a
4503 warning/error of "Legacy feature: ...", depending on the state of the
4504 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
4505 legacy features will disappear eventually.
4507 * Theory syntax: the header format ``theory A = B + C:'' has been
4508 discontinued in favour of ``theory A imports B C begin''. Use isatool
4509 fixheaders to convert existing theory files. INCOMPATIBILITY.
4511 * Theory syntax: the old non-Isar theory file format has been
4512 discontinued altogether. Note that ML proof scripts may still be used
4513 with Isar theories; migration is usually quite simple with the ML
4514 function use_legacy_bindings. INCOMPATIBILITY.
4516 * Theory syntax: some popular names (e.g. 'class', 'declaration',
4517 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
4520 * Theory loader: be more serious about observing the static theory
4521 header specifications (including optional directories), but not the
4522 accidental file locations of previously successful loads. The strict
4523 update policy of former update_thy is now already performed by
4524 use_thy, so the former has been removed; use_thys updates several
4525 theories simultaneously, just as 'imports' within a theory header
4526 specification, but without merging the results. Potential
4527 INCOMPATIBILITY: may need to refine theory headers and commands
4528 ROOT.ML which depend on load order.
4530 * Theory loader: optional support for content-based file
4531 identification, instead of the traditional scheme of full physical
4532 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
4533 (cf. the system manual). The new scheme allows to work with
4534 non-finished theories in persistent session images, such that source
4535 files may be moved later on without requiring reloads.
4537 * Theory loader: old-style ML proof scripts being *attached* to a thy
4538 file (with the same base name as the theory) are considered a legacy
4539 feature, which will disappear eventually. Even now, the theory loader
4540 no longer maintains dependencies on such files.
4542 * Syntax: the scope for resolving ambiguities via type-inference is
4543 now limited to individual terms, instead of whole simultaneous
4544 specifications as before. This greatly reduces the complexity of the
4545 syntax module and improves flexibility by separating parsing and
4546 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
4547 'fixes' etc.) are required in rare situations.
4549 * Syntax: constants introduced by new-style packages ('definition',
4550 'abbreviation' etc.) are passed through the syntax module in
4551 ``authentic mode''. This means that associated mixfix annotations
4552 really stick to such constants, independently of potential name space
4553 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
4554 trees are represented slightly differently, may need to adapt syntax
4555 translations accordingly. Use CONST marker in 'translations' and
4556 @{const_syntax} antiquotation in 'parse_translation' etc.
4558 * Legacy goal package: reduced interface to the bare minimum required
4559 to keep existing proof scripts running. Most other user-level
4560 functions are now part of the OldGoals structure, which is *not* open
4561 by default (consider isatool expandshort before open OldGoals).
4562 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
4563 these tend to cause confusion about the actual goal (!) context being
4564 used here, which is not necessarily the same as the_context().
4566 * Command 'find_theorems': supports "*" wild-card in "name:"
4567 criterion; "with_dups" option. Certain ProofGeneral versions might
4568 support a specific search form (see ProofGeneral/CHANGES).
4570 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
4571 by default, which means that "prems" (and also "fixed variables") are
4572 suppressed from proof state output. Note that the ProofGeneral
4573 settings mechanism allows to change and save options persistently, but
4574 older versions of Isabelle will fail to start up if a negative prems
4577 * Local theory targets may be specified by non-nested blocks of
4578 ``context/locale/class ... begin'' followed by ``end''. The body may
4579 contain definitions, theorems etc., including any derived mechanism
4580 that has been implemented on top of these primitives. This concept
4581 generalizes the existing ``theorem (in ...)'' towards more versatility
4584 * Proof General interface: proper undo of final 'end' command;
4585 discontinued Isabelle/classic mode (ML proof scripts).
4588 *** Document preparation ***
4590 * Added antiquotation @{theory name} which prints the given name,
4591 after checking that it refers to a valid ancestor theory in the
4594 * Added antiquotations @{ML_type text} and @{ML_struct text} which
4595 check the given source text as ML type/structure, printing verbatim.
4597 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
4598 "c args == rhs" given in the current context. (Any number of
4599 arguments may be given on the LHS.)
4604 * The 'class' package offers a combination of axclass and locale to
4605 achieve Haskell-like type classes in Isabelle. Definitions and
4606 theorems within a class context produce both relative results (with
4607 implicit parameters according to the locale context), and polymorphic
4608 constants with qualified polymorphism (according to the class
4609 context). Within the body context of a 'class' target, a separate
4610 syntax layer ("user space type system") takes care of converting
4611 between global polymorphic consts and internal locale representation.
4612 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
4613 "isatool doc classes" provides a tutorial.
4615 * Generic code generator framework allows to generate executable
4616 code for ML and Haskell (including Isabelle classes). A short usage
4619 internal compilation:
4620 export_code <list of constants (term syntax)> in SML
4621 writing SML code to a file:
4622 export_code <list of constants (term syntax)> in SML <filename>
4623 writing OCaml code to a file:
4624 export_code <list of constants (term syntax)> in OCaml <filename>
4625 writing Haskell code to a bunch of files:
4626 export_code <list of constants (term syntax)> in Haskell <filename>
4628 evaluating closed propositions to True/False using code generation:
4631 Reasonable default setup of framework in HOL.
4633 Theorem attributs for selecting and transforming function equations theorems:
4635 [code fun]: select a theorem as function equation for a specific constant
4636 [code fun del]: deselect a theorem as function equation for a specific constant
4637 [code inline]: select an equation theorem for unfolding (inlining) in place
4638 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
4640 User-defined serializations (target in {SML, OCaml, Haskell}):
4642 code_const <and-list of constants (term syntax)>
4643 {(target) <and-list of const target syntax>}+
4645 code_type <and-list of type constructors>
4646 {(target) <and-list of type target syntax>}+
4648 code_instance <and-list of instances>
4650 where instance ::= <type constructor> :: <class>
4652 code_class <and_list of classes>
4653 {(target) <and-list of class target syntax>}+
4654 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
4656 code_instance and code_class only are effective to target Haskell.
4658 For example usage see src/HOL/ex/Codegenerator.thy and
4659 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
4660 generation from Isabelle/HOL theories is available via "isatool doc
4663 * Code generator: consts in 'consts_code' Isar commands are now
4664 referred to by usual term syntax (including optional type
4667 * Command 'no_translations' removes translation rules from theory
4670 * Overloaded definitions are now actually checked for acyclic
4671 dependencies. The overloading scheme is slightly more general than
4672 that of Haskell98, although Isabelle does not demand an exact
4673 correspondence to type class and instance declarations.
4674 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
4675 exotic versions of overloading -- at the discretion of the user!
4677 Polymorphic constants are represented via type arguments, i.e. the
4678 instantiation that matches an instance against the most general
4679 declaration given in the signature. For example, with the declaration
4680 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
4681 as c(nat). Overloading is essentially simultaneous structural
4682 recursion over such type arguments. Incomplete specification patterns
4683 impose global constraints on all occurrences, e.g. c('a * 'a) on the
4684 LHS means that more general c('a * 'b) will be disallowed on any RHS.
4685 Command 'print_theory' outputs the normalized system of recursive
4686 equations, see section "definitions".
4688 * Configuration options are maintained within the theory or proof
4689 context (with name and type bool/int/string), providing a very simple
4690 interface to a poor-man's version of general context data. Tools may
4691 declare options in ML (e.g. using Attrib.config_int) and then refer to
4692 these values using Config.get etc. Users may change options via an
4693 associated attribute of the same name. This form of context
4694 declaration works particularly well with commands 'declare' or
4695 'using', for example ``declare [[foo = 42]]''. Thus it has become
4696 very easy to avoid global references, which would not observe Isar
4697 toplevel undo/redo and fail to work with multithreading.
4699 Various global ML references of Pure and HOL have been turned into
4700 configuration options:
4702 Unify.search_bound unify_search_bound
4703 Unify.trace_bound unify_trace_bound
4704 Unify.trace_simp unify_trace_simp
4705 Unify.trace_types unify_trace_types
4706 Simplifier.simp_depth_limit simp_depth_limit
4707 Blast.depth_limit blast_depth_limit
4708 DatatypeProp.dtK datatype_distinctness_limit
4709 fast_arith_neq_limit fast_arith_neq_limit
4710 fast_arith_split_limit fast_arith_split_limit
4712 * Named collections of theorems may be easily installed as context
4713 data using the functor NamedThmsFun (see also
4714 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
4715 attributes; there is also a toplevel print command. This facility is
4716 just a common case of general context data, which is the preferred way
4717 for anything more complex than just a list of facts in canonical
4720 * Isar: command 'declaration' augments a local theory by generic
4721 declaration functions written in ML. This enables arbitrary content
4722 being added to the context, depending on a morphism that tells the
4723 difference of the original declaration context wrt. the application
4724 context encountered later on.
4726 * Isar: proper interfaces for simplification procedures. Command
4727 'simproc_setup' declares named simprocs (with match patterns, and body
4728 text in ML). Attribute "simproc" adds/deletes simprocs in the current
4729 context. ML antiquotation @{simproc name} retrieves named simprocs.
4731 * Isar: an extra pair of brackets around attribute declarations
4732 abbreviates a theorem reference involving an internal dummy fact,
4733 which will be ignored later --- only the effect of the attribute on
4734 the background context will persist. This form of in-place
4735 declarations is particularly useful with commands like 'declare' and
4736 'using', for example ``have A using [[simproc a]] by simp''.
4738 * Isar: method "assumption" (and implicit closing of subproofs) now
4739 takes simple non-atomic goal assumptions into account: after applying
4740 an assumption as a rule the resulting subgoals are solved by atomic
4741 assumption steps. This is particularly useful to finish 'obtain'
4742 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
4743 without referring to the original premise "!!x. P x ==> thesis" in the
4744 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
4747 * Isar: implicit use of prems from the Isar proof context is
4748 considered a legacy feature. Common applications like ``have A .''
4749 may be replaced by ``have A by fact'' or ``note `A`''. In general,
4750 referencing facts explicitly here improves readability and
4751 maintainability of proof texts.
4753 * Isar: improper proof element 'guess' is like 'obtain', but derives
4754 the obtained context from the course of reasoning! For example:
4756 assume "EX x y. A x & B y" -- "any previous fact"
4757 then guess x and y by clarify
4759 This technique is potentially adventurous, depending on the facts and
4760 proof tools being involved here.
4762 * Isar: known facts from the proof context may be specified as literal
4763 propositions, using ASCII back-quote syntax. This works wherever
4764 named facts used to be allowed so far, in proof commands, proof
4765 methods, attributes etc. Literal facts are retrieved from the context
4766 according to unification of type and term parameters. For example,
4767 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
4768 theorems in the current context, then these are valid literal facts:
4769 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
4771 There is also a proof method "fact" which does the same composition
4772 for explicit goal states, e.g. the following proof texts coincide with
4773 certain special cases of literal facts:
4775 have "A" by fact == note `A`
4776 have "A ==> B" by fact == note `A ==> B`
4777 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
4778 have "P a ==> Q a" by fact == note `P a ==> Q a`
4780 * Isar: ":" (colon) is no longer a symbolic identifier character in
4781 outer syntax. Thus symbolic identifiers may be used without
4782 additional white space in declarations like this: ``assume *: A''.
4784 * Isar: 'print_facts' prints all local facts of the current context,
4785 both named and unnamed ones.
4787 * Isar: 'def' now admits simultaneous definitions, e.g.:
4789 def x == "t" and y == "u"
4791 * Isar: added command 'unfolding', which is structurally similar to
4792 'using', but affects both the goal state and facts by unfolding given
4793 rewrite rules. Thus many occurrences of the 'unfold' method or
4794 'unfolded' attribute may be replaced by first-class proof text.
4796 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
4797 and command 'unfolding' now all support object-level equalities
4798 (potentially conditional). The underlying notion of rewrite rule is
4799 analogous to the 'rule_format' attribute, but *not* that of the
4800 Simplifier (which is usually more generous).
4802 * Isar: the new attribute [rotated n] (default n = 1) rotates the
4803 premises of a theorem by n. Useful in conjunction with drule.
4805 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
4806 method expression within a sandbox consisting of the first N
4807 sub-goals, which need to exist. For example, ``simp_all [3]''
4808 simplifies the first three sub-goals, while (rule foo, simp_all)[]
4809 simplifies all new goals that emerge from applying rule foo to the
4810 originally first one.
4812 * Isar: schematic goals are no longer restricted to higher-order
4813 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
4816 * Isar: the conclusion of a long theorem statement is now either
4817 'shows' (a simultaneous conjunction, as before), or 'obtains'
4818 (essentially a disjunction of cases with local parameters and
4819 assumptions). The latter allows to express general elimination rules
4820 adequately; in this notation common elimination rules look like this:
4822 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
4824 obtains x where "P x"
4826 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
4830 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
4836 The subsequent classical rules even refer to the formal "thesis"
4839 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
4842 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
4843 obtains "thesis ==> something"
4845 The actual proof of an 'obtains' statement is analogous to that of the
4846 Isar proof element 'obtain', only that there may be several cases.
4847 Optional case names may be specified in parentheses; these will be
4848 available both in the present proof and as annotations in the
4849 resulting rule, for later use with the 'cases' method (cf. attribute
4852 * Isar: the assumptions of a long theorem statement are available as
4853 "assms" fact in the proof context. This is more appropriate than the
4854 (historical) "prems", which refers to all assumptions of the current
4855 context, including those from the target locale, proof body etc.
4857 * Isar: 'print_statement' prints theorems from the current theory or
4858 proof context in long statement form, according to the syntax of a
4861 * Isar: 'obtain' takes an optional case name for the local context
4862 introduction rule (default "that").
4864 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
4865 explicit (is "_ ==> ?foo") in the rare cases where this still happens
4868 * Pure: syntax "CONST name" produces a fully internalized constant
4869 according to the current context. This is particularly useful for
4870 syntax translations that should refer to internal constant
4871 representations independently of name spaces.
4873 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
4874 instead of "FOO ". This allows multiple binder declarations to coexist
4875 in the same context. INCOMPATIBILITY.
4877 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
4878 primitive that also works in a locale context (both for constants and
4879 fixed variables). Type declaration and internal syntactic representation
4880 of given constants retrieved from the context. Likewise, the
4881 'no_notation' command allows to remove given syntax annotations from the
4884 * Isar/locales: new derived specification elements 'axiomatization',
4885 'definition', 'abbreviation', which support type-inference, admit
4886 object-level specifications (equality, equivalence). See also the
4887 isar-ref manual. Examples:
4890 eq (infix "===" 50) where
4891 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
4893 definition "f x y = x + y + 1"
4894 definition g where "g x = f x x"
4897 neq (infix "=!=" 50) where
4898 "x =!= y == ~ (x === y)"
4900 These specifications may be also used in a locale context. Then the
4901 constants being introduced depend on certain fixed parameters, and the
4902 constant name is qualified by the locale base name. An internal
4903 abbreviation takes care for convenient input and output, making the
4904 parameters implicit and using the original short name. See also
4905 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
4906 entities from a monomorphic theory.
4908 Presently, abbreviations are only available 'in' a target locale, but
4909 not inherited by general import expressions. Also note that
4910 'abbreviation' may be used as a type-safe replacement for 'syntax' +
4911 'translations' in common applications. The "no_abbrevs" print mode
4912 prevents folding of abbreviations in term output.
4914 Concrete syntax is attached to specified constants in internal form,
4915 independently of name spaces. The parse tree representation is
4916 slightly different -- use 'notation' instead of raw 'syntax', and
4917 'translations' with explicit "CONST" markup to accommodate this.
4919 * Pure/Isar: unified syntax for new-style specification mechanisms
4920 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
4921 full type inference and dummy patterns ("_"). For example:
4923 definition "K x _ = x"
4925 inductive conj for A B
4926 where "A ==> B ==> conj A B"
4928 * Pure: command 'print_abbrevs' prints all constant abbreviations of
4929 the current context. Print mode "no_abbrevs" prevents inversion of
4930 abbreviations on output.
4932 * Isar/locales: improved parameter handling: use of locales "var" and
4933 "struct" no longer necessary; - parameter renamings are no longer
4934 required to be injective. For example, this allows to define
4935 endomorphisms as locale endom = homom mult mult h.
4937 * Isar/locales: changed the way locales with predicates are defined.
4938 Instead of accumulating the specification, the imported expression is
4939 now an interpretation. INCOMPATIBILITY: different normal form of
4940 locale expressions. In particular, in interpretations of locales with
4941 predicates, goals repesenting already interpreted fragments are not
4942 removed automatically. Use methods `intro_locales' and
4943 `unfold_locales'; see below.
4945 * Isar/locales: new methods `intro_locales' and `unfold_locales'
4946 provide backward reasoning on locales predicates. The methods are
4947 aware of interpretations and discharge corresponding goals.
4948 `intro_locales' is less aggressive then `unfold_locales' and does not
4949 unfold predicates to assumptions.
4951 * Isar/locales: the order in which locale fragments are accumulated
4952 has changed. This enables to override declarations from fragments due
4953 to interpretations -- for example, unwanted simp rules.
4955 * Isar/locales: interpretation in theories and proof contexts has been
4956 extended. One may now specify (and prove) equations, which are
4957 unfolded in interpreted theorems. This is useful for replacing
4958 defined concepts (constants depending on locale parameters) by
4959 concepts already existing in the target context. Example:
4961 interpretation partial_order ["op <= :: [int, int] => bool"]
4962 where "partial_order.less (op <=) (x::int) y = (x < y)"
4964 Typically, the constant `partial_order.less' is created by a
4965 definition specification element in the context of locale
4968 * Method "induct": improved internal context management to support
4969 local fixes and defines on-the-fly. Thus explicit meta-level
4970 connectives !! and ==> are rarely required anymore in inductive goals
4971 (using object-logic connectives for this purpose has been long
4972 obsolete anyway). Common proof patterns are explained in
4973 src/HOL/Induct/Common_Patterns.thy, see also
4974 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
4977 * Method "induct": improved handling of simultaneous goals. Instead of
4978 introducing object-level conjunction, the statement is now split into
4979 several conclusions, while the corresponding symbolic cases are nested
4980 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
4981 see src/HOL/Induct/Common_Patterns.thy, for example.
4983 * Method "induct": mutual induction rules are now specified as a list
4984 of rule sharing the same induction cases. HOL packages usually provide
4985 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
4986 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
4987 mutual induction rules differently, i.e. like this:
4989 (induct rule: foo_bar.inducts)
4990 (induct set: foo bar)
4991 (induct pred: foo bar)
4992 (induct type: foo bar)
4994 The ML function ProjectRule.projections turns old-style rules into the
4997 * Method "coinduct": dual of induction, see
4998 src/HOL/Library/Coinductive_List.thy for various examples.
5000 * Method "cases", "induct", "coinduct": the ``(open)'' option is
5001 considered a legacy feature.
5003 * Attribute "symmetric" produces result with standardized schematic
5004 variables (index 0). Potential INCOMPATIBILITY.
5006 * Simplifier: by default the simplifier trace only shows top level
5007 rewrites now. That is, trace_simp_depth_limit is set to 1 by
5008 default. Thus there is less danger of being flooded by the trace. The
5009 trace indicates where parts have been suppressed.
5011 * Provers/classical: removed obsolete classical version of elim_format
5012 attribute; classical elim/dest rules are now treated uniformly when
5013 manipulating the claset.
5015 * Provers/classical: stricter checks to ensure that supplied intro,
5016 dest and elim rules are well-formed; dest and elim rules must have at
5019 * Provers/classical: attributes dest/elim/intro take an optional
5020 weight argument for the rule (just as the Pure versions). Weights are
5021 ignored by automated tools, but determine the search order of single
5024 * Syntax: input syntax now supports dummy variable binding "%_. b",
5025 where the body does not mention the bound variable. Note that dummy
5026 patterns implicitly depend on their context of bounds, which makes
5027 "{_. _}" match any set comprehension as expected. Potential
5028 INCOMPATIBILITY -- parse translations need to cope with syntactic
5029 constant "_idtdummy" in the binding position.
5031 * Syntax: removed obsolete syntactic constant "_K" and its associated
5032 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
5033 for example "A -> B" => "Pi A (%_. B)".
5035 * Pure: 'class_deps' command visualizes the subclass relation, using
5036 the graph browser tool.
5038 * Pure: 'print_theory' now suppresses certain internal declarations by
5039 default; use '!' option for full details.
5044 * Method "metis" proves goals by applying the Metis general-purpose
5045 resolution prover (see also http://gilith.com/software/metis/).
5046 Examples are in the directory MetisExamples. WARNING: the
5047 Isabelle/HOL-Metis integration does not yet work properly with
5050 * Command 'sledgehammer' invokes external automatic theorem provers as
5051 background processes. It generates calls to the "metis" method if
5052 successful. These can be pasted into the proof. Users do not have to
5053 wait for the automatic provers to return. WARNING: does not really
5054 work with multi-threading.
5056 * New "auto_quickcheck" feature tests outermost goal statements for
5057 potential counter-examples. Controlled by ML references
5058 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
5059 5000 milliseconds). Fails silently if statements is outside of
5060 executable fragment, or any other codgenerator problem occurs.
5062 * New constant "undefined" with axiom "undefined x = undefined".
5064 * Added class "HOL.eq", allowing for code generation with polymorphic
5067 * Some renaming of class constants due to canonical name prefixing in
5068 the new 'class' package:
5070 HOL.abs ~> HOL.abs_class.abs
5071 HOL.divide ~> HOL.divide_class.divide
5072 0 ~> HOL.zero_class.zero
5073 1 ~> HOL.one_class.one
5074 op + ~> HOL.plus_class.plus
5075 op - ~> HOL.minus_class.minus
5076 uminus ~> HOL.minus_class.uminus
5077 op * ~> HOL.times_class.times
5078 op < ~> HOL.ord_class.less
5079 op <= > HOL.ord_class.less_eq
5080 Nat.power ~> Power.power_class.power
5081 Nat.size ~> Nat.size_class.size
5082 Numeral.number_of ~> Numeral.number_class.number_of
5083 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
5084 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
5085 Orderings.min ~> Orderings.ord_class.min
5086 Orderings.max ~> Orderings.ord_class.max
5087 Divides.op div ~> Divides.div_class.div
5088 Divides.op mod ~> Divides.div_class.mod
5089 Divides.op dvd ~> Divides.div_class.dvd
5091 INCOMPATIBILITY. Adaptions may be required in the following cases:
5093 a) User-defined constants using any of the names "plus", "minus",
5094 "times", "less" or "less_eq". The standard syntax translations for
5095 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
5098 b) Variables named "plus", "minus", "times", "less", "less_eq"
5099 INCOMPATIBILITY: use more specific names.
5101 c) Permutative equations (e.g. "a + b = b + a")
5102 Since the change of names also changes the order of terms, permutative
5103 rewrite rules may get applied in a different order. Experience shows
5104 that this is rarely the case (only two adaptions in the whole Isabelle
5105 distribution). INCOMPATIBILITY: rewrite proofs
5107 d) ML code directly refering to constant names
5108 This in general only affects hand-written proof tactics, simprocs and
5109 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
5110 Consider using @{const_name} antiquotation.
5112 * New class "default" with associated constant "default".
5114 * Function "sgn" is now overloaded and available on int, real, complex
5115 (and other numeric types), using class "sgn". Two possible defs of
5116 sgn are given as equational assumptions in the classes sgn_if and
5117 sgn_div_norm; ordered_idom now also inherits from sgn_if.
5120 * Locale "partial_order" now unified with class "order" (cf. theory
5121 Orderings), added parameter "less". INCOMPATIBILITY.
5123 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
5124 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
5125 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
5127 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
5128 changed order of proof goals in instance proofs.
5130 * The transitivity reasoner for partial and linear orders is set up
5131 for classes "order" and "linorder". Instances of the reasoner are available
5132 in all contexts importing or interpreting the corresponding locales.
5133 Method "order" invokes the reasoner separately; the reasoner
5134 is also integrated with the Simplifier as a solver. Diagnostic
5135 command 'print_orders' shows the available instances of the reasoner
5136 in the current context.
5138 * Localized monotonicity predicate in theory "Orderings"; integrated
5139 lemmas max_of_mono and min_of_mono with this predicate.
5142 * Formulation of theorem "dense" changed slightly due to integration
5143 with new class dense_linear_order.
5145 * Uniform lattice theory development in HOL.
5147 constants "meet" and "join" now named "inf" and "sup"
5148 constant "Meet" now named "Inf"
5150 classes "meet_semilorder" and "join_semilorder" now named
5151 "lower_semilattice" and "upper_semilattice"
5152 class "lorder" now named "lattice"
5153 class "comp_lat" now named "complete_lattice"
5155 Instantiation of lattice classes allows explicit definitions
5156 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
5158 INCOMPATIBILITY. Theorem renames:
5160 meet_left_le ~> inf_le1
5161 meet_right_le ~> inf_le2
5162 join_left_le ~> sup_ge1
5163 join_right_le ~> sup_ge2
5164 meet_join_le ~> inf_sup_ord
5167 le_meet ~> le_inf_iff
5168 le_join ~> ge_sup_conv
5169 meet_idempotent ~> inf_idem
5170 join_idempotent ~> sup_idem
5171 meet_comm ~> inf_commute
5172 join_comm ~> sup_commute
5173 meet_leI1 ~> le_infI1
5174 meet_leI2 ~> le_infI2
5175 le_joinI1 ~> le_supI1
5176 le_joinI2 ~> le_supI2
5177 meet_assoc ~> inf_assoc
5178 join_assoc ~> sup_assoc
5179 meet_left_comm ~> inf_left_commute
5180 meet_left_idempotent ~> inf_left_idem
5181 join_left_comm ~> sup_left_commute
5182 join_left_idempotent ~> sup_left_idem
5185 le_def_meet ~> le_iff_inf
5186 le_def_join ~> le_iff_sup
5187 join_absorp2 ~> sup_absorb2
5188 join_absorp1 ~> sup_absorb1
5189 meet_absorp1 ~> inf_absorb1
5190 meet_absorp2 ~> inf_absorb2
5191 meet_join_absorp ~> inf_sup_absorb
5192 join_meet_absorp ~> sup_inf_absorb
5193 distrib_join_le ~> distrib_sup_le
5194 distrib_meet_le ~> distrib_inf_le
5196 add_meet_distrib_left ~> add_inf_distrib_left
5197 add_join_distrib_left ~> add_sup_distrib_left
5198 is_join_neg_meet ~> is_join_neg_inf
5199 is_meet_neg_join ~> is_meet_neg_sup
5200 add_meet_distrib_right ~> add_inf_distrib_right
5201 add_join_distrib_right ~> add_sup_distrib_right
5202 add_meet_join_distribs ~> add_sup_inf_distribs
5203 join_eq_neg_meet ~> sup_eq_neg_inf
5204 meet_eq_neg_join ~> inf_eq_neg_sup
5205 add_eq_meet_join ~> add_eq_inf_sup
5206 meet_0_imp_0 ~> inf_0_imp_0
5207 join_0_imp_0 ~> sup_0_imp_0
5208 meet_0_eq_0 ~> inf_0_eq_0
5209 join_0_eq_0 ~> sup_0_eq_0
5210 neg_meet_eq_join ~> neg_inf_eq_sup
5211 neg_join_eq_meet ~> neg_sup_eq_inf
5212 join_eq_if ~> sup_eq_if
5214 mono_meet ~> mono_inf
5215 mono_join ~> mono_sup
5216 meet_bool_eq ~> inf_bool_eq
5217 join_bool_eq ~> sup_bool_eq
5218 meet_fun_eq ~> inf_fun_eq
5219 join_fun_eq ~> sup_fun_eq
5220 meet_set_eq ~> inf_set_eq
5221 join_set_eq ~> sup_set_eq
5222 meet1_iff ~> inf1_iff
5223 meet2_iff ~> inf2_iff
5232 join1_iff ~> sup1_iff
5233 join2_iff ~> sup2_iff
5243 is_meet_Meet ~> is_meet_Inf
5244 Meet_bool_def ~> Inf_bool_def
5245 Meet_fun_def ~> Inf_fun_def
5246 Meet_greatest ~> Inf_greatest
5247 Meet_lower ~> Inf_lower
5248 Meet_set_def ~> Inf_set_def
5251 Sup_bool_eq ~> Sup_bool_def
5252 Sup_fun_eq ~> Sup_fun_def
5253 Sup_set_eq ~> Sup_set_def
5255 listsp_meetI ~> listsp_infI
5256 listsp_meet_eq ~> listsp_inf_eq
5261 * Added syntactic class "size"; overloaded constant "size" now has
5262 type "'a::size ==> bool"
5264 * Internal reorganisation of `size' of datatypes: size theorems
5265 "foo.size" are no longer subsumed by "foo.simps" (but are still
5266 simplification rules by default!); theorems "prod.size" now named
5269 * Class "div" now inherits from class "times" rather than "type".
5272 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
5273 Linorder etc. have disappeared; operations defined in terms of
5274 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
5276 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
5278 * HOL-Word: New extensive library and type for generic, fixed size
5279 machine words, with arithemtic, bit-wise, shifting and rotating
5280 operations, reflection into int, nat, and bool lists, automation for
5281 linear arithmetic (by automatic reflection into nat or int), including
5282 lemmas on overflow and monotonicity. Instantiated to all appropriate
5283 arithmetic type classes, supporting automatic simplification of
5284 numerals on all operations.
5286 * Library/Boolean_Algebra: locales for abstract boolean algebras.
5288 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
5290 * Code generator library theories:
5291 - Code_Integer represents HOL integers by big integer literals in target
5293 - Code_Char represents HOL characters by character literals in target
5295 - Code_Char_chr like Code_Char, but also offers treatment of character
5296 codes; includes Code_Integer.
5297 - Executable_Set allows to generate code for finite sets using lists.
5298 - Executable_Rat implements rational numbers as triples (sign, enumerator,
5300 - Executable_Real implements a subset of real numbers, namly those
5301 representable by rational numbers.
5302 - Efficient_Nat implements natural numbers by integers, which in general will
5303 result in higher efficency; pattern matching with 0/Suc is eliminated;
5304 includes Code_Integer.
5305 - Code_Index provides an additional datatype index which is mapped to
5306 target-language built-in integers.
5307 - Code_Message provides an additional datatype message_string which is isomorphic to
5308 strings; messages are mapped to target-language strings.
5310 * New package for inductive predicates
5312 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
5315 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5316 for z_1 :: U_1 and ... and z_n :: U_m
5318 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5321 with full support for type-inference, rather than
5323 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5325 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5326 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5328 inductive "s z_1 ... z_m"
5330 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5333 For backward compatibility, there is a wrapper allowing inductive
5334 sets to be defined with the new package via
5337 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5338 for z_1 :: U_1 and ... and z_n :: U_m
5340 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5346 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5347 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5348 for z_1 :: U_1 and ... and z_n :: U_m
5350 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5351 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5354 if the additional syntax "p ..." is required.
5356 Numerous examples can be found in the subdirectories src/HOL/Auth,
5357 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
5361 - Since declaration and definition of inductive sets or predicates
5362 is no longer separated, abbreviations involving the newly
5363 introduced sets or predicates must be specified together with the
5364 introduction rules after the 'where' keyword (see above), rather
5365 than before the actual inductive definition.
5367 - The variables in induction and elimination rules are now
5368 quantified in the order of their occurrence in the introduction
5369 rules, rather than in alphabetical order. Since this may break
5370 some proofs, these proofs either have to be repaired, e.g. by
5371 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
5372 statements of the form
5374 case (rule_i a_i_1 ... a_i_{k_i})
5376 or the old order of quantification has to be restored by explicitly adding
5377 meta-level quantifiers in the introduction rules, i.e.
5379 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
5381 - The format of the elimination rules is now
5383 p z_1 ... z_m x_1 ... x_n ==>
5384 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5389 (x_1, ..., x_n) : s z_1 ... z_m ==>
5390 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5393 for sets rather than
5395 x : s z_1 ... z_m ==>
5396 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
5399 This may require terms in goals to be expanded to n-tuples
5400 (e.g. using case_tac or simplification with the split_paired_all
5401 rule) before the above elimination rule is applicable.
5403 - The elimination or case analysis rules for (mutually) inductive
5404 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
5405 list of rules "p_1_..._p_k.elims" is no longer available.
5407 * New package "function"/"fun" for general recursive functions,
5408 supporting mutual and nested recursion, definitions in local contexts,
5409 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
5410 for small examples, and the separate tutorial on the function
5411 package. The old recdef "package" is still available as before, but
5412 users are encouraged to use the new package.
5414 * Method "lexicographic_order" automatically synthesizes termination
5415 relations as lexicographic combinations of size measures.
5417 * Case-expressions allow arbitrary constructor-patterns (including
5418 "_") and take their order into account, like in functional
5419 programming. Internally, this is translated into nested
5420 case-expressions; missing cases are added and mapped to the predefined
5421 constant "undefined". In complicated cases printing may no longer show
5422 the original input but the internal form. Lambda-abstractions allow
5423 the same form of pattern matching: "% pat1 => e1 | ..." is an
5424 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
5427 * IntDef: The constant "int :: nat => int" has been removed; now "int"
5428 is an abbreviation for "of_nat :: nat => int". The simplification
5429 rules for "of_nat" have been changed to work like "int" did
5430 previously. Potential INCOMPATIBILITY:
5431 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
5432 - of_nat_diff and of_nat_mult are no longer default simp rules
5434 * Method "algebra" solves polynomial equations over (semi)rings using
5435 Groebner bases. The (semi)ring structure is defined by locales and the
5436 tool setup depends on that generic context. Installing the method for
5437 a specific type involves instantiating the locale and possibly adding
5438 declarations for computation on the coefficients. The method is
5439 already instantiated for natural numbers and for the axiomatic class
5440 of idoms with numerals. See also the paper by Chaieb and Wenzel at
5441 CALCULEMUS 2007 for the general principles underlying this
5442 architecture of context-aware proof-tools.
5444 * Method "ferrack" implements quantifier elimination over
5445 special-purpose dense linear orders using locales (analogous to
5446 "algebra"). The method is already installed for class
5447 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
5450 * Former constant "List.op @" now named "List.append". Use ML
5451 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
5452 circumvent possible incompatibilities when working on ML level.
5454 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
5456 * New function listsum :: 'a list => 'a for arbitrary monoids.
5457 Special syntax: "SUM x <- xs. f x" (and latex variants)
5459 * New syntax for Haskell-like list comprehension (input only), eg.
5460 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
5462 * The special syntax for function "filter" has changed from [x :
5463 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
5464 comprehension syntax, and for uniformity. INCOMPATIBILITY.
5466 * [a..b] is now defined for arbitrary linear orders. It used to be
5467 defined on nat only, as an abbreviation for [a..<Suc b]
5470 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
5472 * New functions "sorted" and "sort" in src/HOL/List.thy.
5474 * New lemma collection field_simps (an extension of ring_simps) for
5475 manipulating (in)equations involving division. Multiplies with all
5476 denominators that can be proved to be non-zero (in equations) or
5477 positive/negative (in inequations).
5479 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
5480 have been improved and renamed to ring_simps, group_simps and
5481 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
5482 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
5484 * Theory Library/Commutative_Ring: switched from recdef to function
5485 package; constants add, mul, pow now curried. Infix syntax for
5486 algebraic operations.
5488 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
5491 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
5494 * HOL/records: generalised field-update to take a function on the
5495 field rather than the new value: r(|A := x|) is translated to A_update
5496 (K x) r The K-combinator that is internally used is called K_record.
5497 INCOMPATIBILITY: Usage of the plain update functions has to be
5500 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
5501 * x = 0, which are required for a semiring. Richer structures do not
5502 inherit from semiring_0 anymore, because this property is a theorem
5503 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
5504 there is more to prove, but this is mostly trivial.
5506 * Class "recpower" is generalized to arbitrary monoids, not just
5507 commutative semirings. INCOMPATIBILITY: may need to incorporate
5508 commutativity or semiring properties additionally.
5510 * Constant "List.list_all2" in List.thy now uses authentic syntax.
5511 INCOMPATIBILITY: translations containing list_all2 may go wrong,
5512 better use 'abbreviation'.
5514 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
5516 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
5517 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
5518 significant changes for setting up numeral syntax for types:
5519 - New constants Numeral.pred and Numeral.succ instead
5520 of former Numeral.bin_pred and Numeral.bin_succ.
5521 - Use integer operations instead of bin_add, bin_mult and so on.
5522 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
5523 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
5525 See src/HOL/Integ/IntArith.thy for an example setup.
5527 * Command 'normal_form' computes the normal form of a term that may
5528 contain free variables. For example ``normal_form "rev [a, b, c]"''
5529 produces ``[b, c, a]'' (without proof). This command is suitable for
5530 heavy-duty computations because the functions are compiled to ML
5531 first. Correspondingly, a method "normalization" is provided. See
5532 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
5534 * Alternative iff syntax "A <-> B" for equality on bool (with priority
5535 25 like -->); output depends on the "iff" print_mode, the default is
5536 "A = B" (with priority 50).
5538 * Relations less (<) and less_eq (<=) are also available on type bool.
5539 Modified syntax to disallow nesting without explicit parentheses,
5540 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
5543 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
5545 * Relation composition operator "op O" now has precedence 75 and binds
5546 stronger than union and intersection. INCOMPATIBILITY.
5548 * The old set interval syntax "{m..n(}" (and relatives) has been
5549 removed. Use "{m..<n}" (and relatives) instead.
5551 * In the context of the assumption "~(s = t)" the Simplifier rewrites
5552 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
5553 ``declare [[simproc del: neq]]''.
5555 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
5558 * Theorem Cons_eq_map_conv no longer declared as "simp".
5560 * Theorem setsum_mult renamed to setsum_right_distrib.
5562 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
5565 * Reimplemented methods "sat" and "satx", with several improvements:
5566 goals no longer need to be stated as "<prems> ==> False", equivalences
5567 (i.e. "=" on type bool) are handled, variable names of the form
5568 "lit_<n>" are no longer reserved, significant speedup.
5570 * Methods "sat" and "satx" can now replay MiniSat proof traces.
5571 zChaff is still supported as well.
5573 * 'inductive' and 'datatype': provide projections of mutual rules,
5574 bundled as foo_bar.inducts;
5576 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
5579 * Library: moved theory Accessible_Part to main HOL.
5581 * Library: added theory Coinductive_List of potentially infinite lists
5582 as greatest fixed-point.
5584 * Library: added theory AssocList which implements (finite) maps as
5587 * Method "evaluation" solves goals (i.e. a boolean expression)
5588 efficiently by compiling it to ML. The goal is "proved" (via an
5589 oracle) if it evaluates to True.
5591 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
5592 also when invoked by the simplifier. This results in the Simplifier
5593 being more powerful on arithmetic goals. INCOMPATIBILITY.
5594 Configuration option fast_arith_split_limit=0 recovers the old
5597 * Support for hex (0x20) and binary (0b1001) numerals.
5599 * New method: reify eqs (t), where eqs are equations for an
5600 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
5601 parameter, computes a term s::'b and a list xs::'a list and proves the
5602 theorem I xs s = t. This is also known as reification or quoting. The
5603 resulting theorem is applied to the subgoal to substitute t with I xs
5604 s. If t is omitted, the subgoal itself is reified.
5606 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
5607 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
5608 where f is supposed to be a computable function (in the sense of code
5609 generattion). The method uses reify to compute s and xs as above then
5610 applies corr_thm and uses normalization by evaluation to "prove" f s =
5611 r and finally gets the theorem t = r, which is again applied to the
5612 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
5614 * Reflection: Automatic reification now handels binding, an example is
5615 available in src/HOL/ex/ReflectionEx.thy
5617 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
5618 command 'statespace' that is similar to 'record', but introduces an
5619 abstract specification based on the locale infrastructure instead of
5620 HOL types. This leads to extra flexibility in composing state spaces,
5621 in particular multiple inheritance and renaming of components.
5626 * Hyperreal: Functions root and sqrt are now defined on negative real
5627 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
5628 Nonnegativity side conditions have been removed from many lemmas, so
5629 that more subgoals may now be solved by simplification; potential
5632 * Real: new type classes formalize real normed vector spaces and
5633 algebras, using new overloaded constants scaleR :: real => 'a => 'a
5634 and norm :: 'a => real.
5636 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
5637 reals into other types. The overloaded constant Reals :: 'a set is now
5638 defined as range of_real; potential INCOMPATIBILITY.
5640 * Real: proper support for ML code generation, including 'quickcheck'.
5641 Reals are implemented as arbitrary precision rationals.
5643 * Hyperreal: Several constants that previously worked only for the
5644 reals have been generalized, so they now work over arbitrary vector
5645 spaces. Type annotations may need to be added in some cases; potential
5648 Infinitesimal :: ('a::real_normed_vector) star set
5649 HFinite :: ('a::real_normed_vector) star set
5650 HInfinite :: ('a::real_normed_vector) star set
5651 approx :: ('a::real_normed_vector) star => 'a star => bool
5652 monad :: ('a::real_normed_vector) star => 'a star set
5653 galaxy :: ('a::real_normed_vector) star => 'a star set
5654 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
5655 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
5656 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
5657 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
5658 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
5659 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
5660 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
5661 sgn :: 'a::real_normed_vector => 'a
5662 exp :: 'a::{recpower,real_normed_field,banach} => 'a
5664 * Complex: Some complex-specific constants are now abbreviations for
5665 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
5666 hnorm. Other constants have been entirely removed in favor of the
5667 polymorphic versions (INCOMPATIBILITY):
5671 HInfinite <-- CInfinite
5672 Infinitesimal <-- CInfinitesimal
5675 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
5676 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
5677 (ns)deriv <-- (ns)cderiv
5682 * Formalisation of ideals and the quotient construction over rings.
5684 * Order and lattice theory no longer based on records.
5687 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
5688 greatest_closed. INCOMPATIBILITY.
5690 * Method algebra is now set up via an attribute. For examples see
5691 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
5692 of algebraic structures.
5694 * Renamed theory CRing to Ring.
5699 * Substantial, yet incomplete support for nominal datatypes (binding
5700 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
5701 src/HOL/Nominal/Examples. Prospective users should consult
5702 http://isabelle.in.tum.de/nominal/
5707 * ML basics: just one true type int, which coincides with IntInf.int
5710 * ML within Isar: antiquotations allow to embed statically-checked
5711 formal entities in the source, referring to the context available at
5712 compile-time. For example:
5714 ML {* @{sort "{zero,one}"} *}
5715 ML {* @{typ "'a => 'b"} *}
5716 ML {* @{term "%x. x"} *}
5717 ML {* @{prop "x == y"} *}
5718 ML {* @{ctyp "'a => 'b"} *}
5719 ML {* @{cterm "%x. x"} *}
5720 ML {* @{cprop "x == y"} *}
5721 ML {* @{thm asm_rl} *}
5722 ML {* @{thms asm_rl} *}
5723 ML {* @{type_name c} *}
5724 ML {* @{type_syntax c} *}
5725 ML {* @{const_name c} *}
5726 ML {* @{const_syntax c} *}
5729 ML {* @{theory Pure} *}
5730 ML {* @{theory_ref} *}
5731 ML {* @{theory_ref Pure} *}
5734 ML {* @{clasimpset} *}
5736 The same works for sources being ``used'' within an Isar context.
5738 * ML in Isar: improved error reporting; extra verbosity with
5739 ML_Context.trace enabled.
5741 * Pure/General/table.ML: the join operations now works via exceptions
5742 DUP/SAME instead of type option. This is simpler in simple cases, and
5743 admits slightly more efficient complex applications.
5745 * Pure: 'advanced' translation functions (parse_translation etc.) now
5746 use Context.generic instead of just theory.
5748 * Pure: datatype Context.generic joins theory/Proof.context and
5749 provides some facilities for code that works in either kind of
5750 context, notably GenericDataFun for uniform theory and proof data.
5752 * Pure: simplified internal attribute type, which is now always
5753 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
5754 local (Proof.context) attributes have been discontinued, while
5755 minimizing code duplication. Thm.rule_attribute and
5756 Thm.declaration_attribute build canonical attributes; see also structure
5757 Context for further operations on Context.generic, notably
5758 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
5759 declarations and definitions.
5761 * Context data interfaces (Theory/Proof/GenericDataFun): removed
5762 name/print, uninitialized data defaults to ad-hoc copy of empty value,
5763 init only required for impure data. INCOMPATIBILITY: empty really need
5764 to be empty (no dependencies on theory content!)
5766 * Pure/kernel: consts certification ignores sort constraints given in
5767 signature declarations. (This information is not relevant to the
5768 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
5769 potential INCOMPATIBILITY.
5771 * Pure: axiomatic type classes are now purely definitional, with
5772 explicit proofs of class axioms and super class relations performed
5773 internally. See Pure/axclass.ML for the main internal interfaces --
5774 notably AxClass.define_class supercedes AxClass.add_axclass, and
5775 AxClass.axiomatize_class/classrel/arity supersede
5776 Sign.add_classes/classrel/arities.
5778 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
5779 global/local versions on theory vs. Proof.context have been
5780 discontinued; Attrib.syntax and Method.syntax have been adapted
5781 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
5782 attributes, methods, etc.
5784 * Pure: several functions of signature "... -> theory -> theory * ..."
5785 have been reoriented to "... -> theory -> ... * theory" in order to
5786 allow natural usage in combination with the ||>, ||>>, |-> and
5787 fold_map combinators.
5789 * Pure: official theorem names (closed derivations) and additional
5790 comments (tags) are now strictly separate. Name hints -- which are
5791 maintained as tags -- may be attached any time without affecting the
5794 * Pure: primitive rule lift_rule now takes goal cterm instead of an
5795 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
5796 achieve the old behaviour.
5798 * Pure: the "Goal" constant is now called "prop", supporting a
5799 slightly more general idea of ``protecting'' meta-level rule
5802 * Pure: Logic.(un)varify only works in a global context, which is now
5803 enforced instead of silently assumed. INCOMPATIBILITY, may use
5804 Logic.legacy_(un)varify as temporary workaround.
5806 * Pure: structure Name provides scalable operations for generating
5807 internal variable names, notably Name.variants etc. This replaces
5808 some popular functions from term.ML:
5810 Term.variant -> Name.variant
5811 Term.variantlist -> Name.variant_list
5812 Term.invent_names -> Name.invent_list
5814 Note that low-level renaming rarely occurs in new code -- operations
5815 from structure Variable are used instead (see below).
5817 * Pure: structure Variable provides fundamental operations for proper
5818 treatment of fixed/schematic variables in a context. For example,
5819 Variable.import introduces fixes for schematics of given facts and
5820 Variable.export reverses the effect (up to renaming) -- this replaces
5821 various freeze_thaw operations.
5823 * Pure: structure Goal provides simple interfaces for
5824 init/conclude/finish and tactical prove operations (replacing former
5825 Tactic.prove). Goal.prove is the canonical way to prove results
5826 within a given context; Goal.prove_global is a degraded version for
5827 theory level goals, including a global Drule.standard. Note that
5828 OldGoals.prove_goalw_cterm has long been obsolete, since it is
5829 ill-behaved in a local proof context (e.g. with local fixes/assumes or
5830 in a locale context).
5832 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
5833 and type checking (Syntax.check_term etc.), with common combinations
5834 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
5835 which are considered legacy and await removal.
5837 * Pure/Syntax: generic interfaces for type unchecking
5838 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
5839 with common combinations (Syntax.pretty_term, Syntax.string_of_term
5840 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
5841 available for convenience, but refer to the very same operations using
5842 a mere theory instead of a full context.
5844 * Isar: simplified treatment of user-level errors, using exception
5845 ERROR of string uniformly. Function error now merely raises ERROR,
5846 without any side effect on output channels. The Isar toplevel takes
5847 care of proper display of ERROR exceptions. ML code may use plain
5848 handle/can/try; cat_error may be used to concatenate errors like this:
5850 ... handle ERROR msg => cat_error msg "..."
5852 Toplevel ML code (run directly or through the Isar toplevel) may be
5853 embedded into the Isar toplevel with exception display/debug like
5856 Isar.toplevel (fn () => ...)
5858 INCOMPATIBILITY, removed special transform_error facilities, removed
5859 obsolete variants of user-level exceptions (ERROR_MESSAGE,
5860 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
5861 -- use plain ERROR instead.
5863 * Isar: theory setup now has type (theory -> theory), instead of a
5864 list. INCOMPATIBILITY, may use #> to compose setup functions.
5866 * Isar: ML toplevel pretty printer for type Proof.context, subject to
5867 ProofContext.debug/verbose flags.
5869 * Isar: Toplevel.theory_to_proof admits transactions that modify the
5870 theory before entering a proof state. Transactions now always see a
5871 quasi-functional intermediate checkpoint, both in interactive and
5874 * Isar: simplified interfaces for outer syntax. Renamed
5875 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
5876 OuterSyntax.add_parsers -- this functionality is now included in
5877 OuterSyntax.command etc. INCOMPATIBILITY.
5879 * Simplifier: the simpset of a running simplification process now
5880 contains a proof context (cf. Simplifier.the_context), which is the
5881 very context that the initial simpset has been retrieved from (by
5882 simpset_of/local_simpset_of). Consequently, all plug-in components
5883 (solver, looper etc.) may depend on arbitrary proof data.
5885 * Simplifier.inherit_context inherits the proof context (plus the
5886 local bounds) of the current simplification process; any simproc
5887 etc. that calls the Simplifier recursively should do this! Removed
5888 former Simplifier.inherit_bounds, which is already included here --
5889 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
5890 specify an explicit context using Simplifier.context/theory_context.
5892 * Simplifier/Classical Reasoner: more abstract interfaces
5893 change_simpset/claset for modifying the simpset/claset reference of a
5894 theory; raw versions simpset/claset_ref etc. have been discontinued --
5897 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
5903 * settings: the default heap location within ISABELLE_HOME_USER now
5904 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
5905 Isabelle installations.
5907 * isabelle-process: option -S (secure mode) disables some critical
5908 operations, notably runtime compilation and evaluation of ML source
5911 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
5913 * Support for parallel execution, using native multicore support of
5914 Poly/ML 5.1. The theory loader exploits parallelism when processing
5915 independent theories, according to the given theory header
5916 specifications. The maximum number of worker threads is specified via
5917 usedir option -M or the "max-threads" setting in Proof General. A
5918 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
5919 to 6 on a 8-core machine. User-code needs to observe certain
5920 guidelines for thread-safe programming, see appendix A in the Isar
5921 Implementation manual.
5925 New in Isabelle2005 (October 2005)
5926 ----------------------------------
5930 * Theory headers: the new header syntax for Isar theories is
5933 imports <theory1> ... <theoryN>
5934 uses <file1> ... <fileM>
5937 where the 'uses' part is optional. The previous syntax
5939 theory <name> = <theory1> + ... + <theoryN>:
5941 will disappear in the next release. Use isatool fixheaders to convert
5942 existing theory files. Note that there is no change in ancient
5943 non-Isar theories now, but these will disappear soon.
5945 * Theory loader: parent theories can now also be referred to via
5946 relative and absolute paths.
5948 * Command 'find_theorems' searches for a list of criteria instead of a
5949 list of constants. Known criteria are: intro, elim, dest, name:string,
5950 simp:term, and any term. Criteria can be preceded by '-' to select
5951 theorems that do not match. Intro, elim, dest select theorems that
5952 match the current goal, name:s selects theorems whose fully qualified
5953 name contain s, and simp:term selects all simplification rules whose
5954 lhs match term. Any other term is interpreted as pattern and selects
5955 all theorems matching the pattern. Available in ProofGeneral under
5956 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
5958 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
5960 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
5961 matching the current goal as introduction rule and not having "HOL."
5962 in their name (i.e. not being defined in theory HOL).
5964 * Command 'thms_containing' has been discontinued in favour of
5965 'find_theorems'; INCOMPATIBILITY.
5967 * Communication with Proof General is now 8bit clean, which means that
5968 Unicode text in UTF-8 encoding may be used within theory texts (both
5969 formal and informal parts). Cf. option -U of the Isabelle Proof
5970 General interface. Here are some simple examples (cf. src/HOL/ex):
5972 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
5973 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
5975 * Improved efficiency of the Simplifier and, to a lesser degree, the
5976 Classical Reasoner. Typical big applications run around 2 times
5980 *** Document preparation ***
5982 * Commands 'display_drafts' and 'print_drafts' perform simple output
5983 of raw sources. Only those symbols that do not require additional
5984 LaTeX packages (depending on comments in isabellesym.sty) are
5985 displayed properly, everything else is left verbatim. isatool display
5986 and isatool print are used as front ends (these are subject to the
5987 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
5989 * Command tags control specific markup of certain regions of text,
5990 notably folding and hiding. Predefined tags include "theory" (for
5991 theory begin and end), "proof" for proof commands, and "ML" for
5992 commands involving ML code; the additional tags "visible" and
5993 "invisible" are unused by default. Users may give explicit tag
5994 specifications in the text, e.g. ''by %invisible (auto)''. The
5995 interpretation of tags is determined by the LaTeX job during document
5996 preparation: see option -V of isatool usedir, or options -n and -t of
5997 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
6000 Several document versions may be produced at the same time via isatool
6001 usedir (the generated index.html will link all of them). Typical
6002 specifications include ''-V document=theory,proof,ML'' to present
6003 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
6004 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
6005 these parts without any formal replacement text. The Isabelle site
6006 default settings produce ''document'' and ''outline'' versions as
6009 * Several new antiquotations:
6011 @{term_type term} prints a term with its type annotated;
6013 @{typeof term} prints the type of a term;
6015 @{const const} is the same as @{term const}, but checks that the
6016 argument is a known logical constant;
6018 @{term_style style term} and @{thm_style style thm} print a term or
6019 theorem applying a "style" to it
6023 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
6024 definitions, equations, inequations etc., 'concl' printing only the
6025 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
6026 to print the specified premise. TermStyle.add_style provides an ML
6027 interface for introducing further styles. See also the "LaTeX Sugar"
6028 document practical applications. The ML antiquotation prints
6029 type-checked ML expressions verbatim.
6031 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
6032 and 'text' support optional locale specification '(in loc)', which
6033 specifies the default context for interpreting antiquotations. For
6034 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
6036 * Option 'locale=NAME' of antiquotations specifies an alternative
6037 context interpreting the subsequent argument. For example: @{thm
6038 [locale=lattice] inf_assoc}.
6040 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
6043 * Proper output of antiquotations for theory commands involving a
6044 proof context (such as 'locale' or 'theorem (in loc) ...').
6046 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
6047 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
6049 * isatool usedir: new option -C (default true) controls whether option
6050 -D should include a copy of the original document directory; -C false
6051 prevents unwanted effects such as copying of administrative CVS data.
6056 * Considerably improved version of 'constdefs' command. Now performs
6057 automatic type-inference of declared constants; additional support for
6058 local structure declarations (cf. locales and HOL records), see also
6059 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
6060 sequential dependencies of definitions within a single 'constdefs'
6061 section; moreover, the declared name needs to be an identifier. If
6062 all fails, consider to fall back on 'consts' and 'defs' separately.
6064 * Improved indexed syntax and implicit structures. First of all,
6065 indexed syntax provides a notational device for subscripted
6066 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
6067 expressions. Secondly, in a local context with structure
6068 declarations, number indexes \<^sub>n or the empty index (default
6069 number 1) refer to a certain fixed variable implicitly; option
6070 show_structs controls printing of implicit structures. Typical
6071 applications of these concepts involve record types and locales.
6073 * New command 'no_syntax' removes grammar declarations (and
6074 translations) resulting from the given syntax specification, which is
6075 interpreted in the same manner as for the 'syntax' command.
6077 * 'Advanced' translation functions (parse_translation etc.) may depend
6078 on the signature of the theory context being presently used for
6079 parsing/printing, see also isar-ref manual.
6081 * Improved 'oracle' command provides a type-safe interface to turn an
6082 ML expression of type theory -> T -> term into a primitive rule of
6083 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
6084 is already included here); see also FOL/ex/IffExample.thy;
6087 * axclass: name space prefix for class "c" is now "c_class" (was "c"
6088 before); "cI" is no longer bound, use "c.intro" instead.
6089 INCOMPATIBILITY. This change avoids clashes of fact bindings for
6090 axclasses vs. locales.
6092 * Improved internal renaming of symbolic identifiers -- attach primes
6093 instead of base 26 numbers.
6095 * New flag show_question_marks controls printing of leading question
6096 marks in schematic variable names.
6098 * In schematic variable names, *any* symbol following \<^isub> or
6099 \<^isup> is now treated as part of the base name. For example, the
6100 following works without printing of awkward ".0" indexes:
6102 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
6105 * Inner syntax includes (*(*nested*) comments*).
6107 * Pretty printer now supports unbreakable blocks, specified in mixfix
6108 annotations as "(00...)".
6110 * Clear separation of logical types and nonterminals, where the latter
6111 may only occur in 'syntax' specifications or type abbreviations.
6112 Before that distinction was only partially implemented via type class
6113 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
6114 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
6115 exotic syntax specifications may require further adaption
6116 (e.g. Cube/Cube.thy).
6118 * Removed obsolete type class "logic", use the top sort {} instead.
6119 Note that non-logical types should be declared as 'nonterminals'
6120 rather than 'types'. INCOMPATIBILITY for new object-logic
6123 * Attributes 'induct' and 'cases': type or set names may now be
6124 locally fixed variables as well.
6126 * Simplifier: can now control the depth to which conditional rewriting
6127 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
6130 * Simplifier: simplification procedures may now take the current
6131 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
6132 interface), which is very useful for calling the Simplifier
6133 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
6134 is gone -- use prems_of_ss on the simpset instead. Moreover, the
6135 low-level mk_simproc no longer applies Logic.varify internally, to
6136 allow for use in a context of fixed variables.
6138 * thin_tac now works even if the assumption being deleted contains !!
6139 or ==>. More generally, erule now works even if the major premise of
6140 the elimination rule contains !! or ==>.
6142 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
6144 * Reorganized bootstrapping of the Pure theories; CPure is now derived
6145 from Pure, which contains all common declarations already. Both
6146 theories are defined via plain Isabelle/Isar .thy files.
6147 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
6148 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
6149 use isatool fixcpure to adapt your theory and ML sources.
6151 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
6152 selections of theorems in named facts via index ranges.
6154 * 'print_theorems': in theory mode, really print the difference
6155 wrt. the last state (works for interactive theory development only),
6156 in proof mode print all local facts (cf. 'print_facts');
6158 * 'hide': option '(open)' hides only base names.
6160 * More efficient treatment of intermediate checkpoints in interactive
6163 * Code generator is now invoked via code_module (incremental code
6164 generation) and code_library (modular code generation, ML structures
6165 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
6166 must be quoted when used as identifiers.
6168 * New 'value' command for reading, evaluating and printing terms using
6169 the code generator. INCOMPATIBILITY: command keyword 'value' must be
6170 quoted when used as identifier.
6175 * New commands for the interpretation of locale expressions in
6176 theories (1), locales (2) and proof contexts (3). These generate
6177 proof obligations from the expression specification. After the
6178 obligations have been discharged, theorems of the expression are added
6179 to the theory, target locale or proof context. The synopsis of the
6180 commands is a follows:
6182 (1) interpretation expr inst
6183 (2) interpretation target < expr
6184 (3) interpret expr inst
6186 Interpretation in theories and proof contexts require a parameter
6187 instantiation of terms from the current context. This is applied to
6188 specifications and theorems of the interpreted expression.
6189 Interpretation in locales only permits parameter renaming through the
6190 locale expression. Interpretation is smart in that interpretations
6191 that are active already do not occur in proof obligations, neither are
6192 instantiated theorems stored in duplicate. Use 'print_interps' to
6193 inspect active interpretations of a particular locale. For details,
6194 see the Isar Reference manual. Examples can be found in
6195 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
6197 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
6198 'interpret' instead.
6200 * New context element 'constrains' for adding type constraints to
6203 * Context expressions: renaming of parameters with syntax
6206 * Locale declaration: 'includes' disallowed.
6208 * Proper static binding of attribute syntax -- i.e. types / terms /
6209 facts mentioned as arguments are always those of the locale definition
6210 context, independently of the context of later invocations. Moreover,
6211 locale operations (renaming and type / term instantiation) are applied
6212 to attribute arguments as expected.
6214 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
6215 actual attributes; rare situations may require Attrib.attribute to
6216 embed those attributes into Attrib.src that lack concrete syntax.
6217 Attribute implementations need to cooperate properly with the static
6218 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
6219 Attrib.XXX_thm etc. already do the right thing without further
6220 intervention. Only unusual applications -- such as "where" or "of"
6221 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
6222 on the context and the facts involved -- may have to assign parsed
6223 values to argument tokens explicitly.
6225 * Changed parameter management in theorem generation for long goal
6226 statements with 'includes'. INCOMPATIBILITY: produces a different
6227 theorem statement in rare situations.
6229 * Locale inspection command 'print_locale' omits notes elements. Use
6230 'print_locale!' to have them included in the output.
6235 * Provers/hypsubst.ML: improved version of the subst method, for
6236 single-step rewriting: it now works in bound variable contexts. New is
6237 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
6238 rewrite a different subterm than the original subst method, which is
6239 still available as 'simplesubst'.
6241 * Provers/quasi.ML: new transitivity reasoners for transitivity only
6244 * Provers/trancl.ML: new transitivity reasoner for transitive and
6245 reflexive-transitive closure of relations.
6247 * Provers/blast.ML: new reference depth_limit to make blast's depth
6248 limit (previously hard-coded with a value of 20) user-definable.
6250 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
6251 is peformed already. Object-logics merely need to finish their
6252 initial simpset configuration as before. INCOMPATIBILITY.
6257 * Symbolic syntax of Hilbert Choice Operator is now as follows:
6260 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
6262 The symbol \<some> is displayed as the alternative epsilon of LaTeX
6263 and x-symbol; use option '-m epsilon' to get it actually printed.
6264 Moreover, the mathematically important symbolic identifier \<epsilon>
6265 becomes available as variable, constant etc. INCOMPATIBILITY,
6267 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
6268 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
6269 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
6270 support corresponding Isar calculations.
6272 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
6275 * theory SetInterval: changed the syntax for open intervals:
6284 The old syntax is still supported but will disappear in the next
6285 release. For conversion use the following Emacs search and replace
6286 patterns (these are not perfect but work quite well):
6288 {)\([^\.]*\)\.\. -> {\1<\.\.}
6289 \.\.\([^(}]*\)(} -> \.\.<\1}
6291 * Theory Commutative_Ring (in Library): method comm_ring for proving
6292 equalities in commutative rings; method 'algebra' provides a generic
6295 * Theory Finite_Set: changed the syntax for 'setsum', summation over
6296 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
6297 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
6300 Some new syntax forms are available:
6302 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
6303 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
6304 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
6305 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
6307 The latter form "\<Sum>x < k. e" used to be based on a separate
6308 function "Summation", which has been discontinued.
6310 * theory Finite_Set: in structured induction proofs, the insert case
6311 is now 'case (insert x F)' instead of the old counterintuitive 'case
6314 * The 'refute' command has been extended to support a much larger
6315 fragment of HOL, including axiomatic type classes, constdefs and
6316 typedefs, inductive datatypes and recursion.
6318 * New tactics 'sat' and 'satx' to prove propositional tautologies.
6319 Requires zChaff with proof generation to be installed. See
6320 HOL/ex/SAT_Examples.thy for examples.
6322 * Datatype induction via method 'induct' now preserves the name of the
6323 induction variable. For example, when proving P(xs::'a list) by
6324 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
6325 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
6326 in unstructured proof scripts.
6328 * Reworked implementation of records. Improved scalability for
6329 records with many fields, avoiding performance problems for type
6330 inference. Records are no longer composed of nested field types, but
6331 of nested extension types. Therefore the record type only grows linear
6332 in the number of extensions and not in the number of fields. The
6333 top-level (users) view on records is preserved. Potential
6334 INCOMPATIBILITY only in strange cases, where the theory depends on the
6335 old record representation. The type generated for a record is called
6336 <record_name>_ext_type.
6338 Flag record_quick_and_dirty_sensitive can be enabled to skip the
6339 proofs triggered by a record definition or a simproc (if
6340 quick_and_dirty is enabled). Definitions of large records can take
6343 New simproc record_upd_simproc for simplification of multiple record
6344 updates enabled by default. Moreover, trivial updates are also
6345 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
6346 occasionally, since simplification is more powerful by default.
6348 * typedef: proper support for polymorphic sets, which contain extra
6349 type-variables in the term.
6351 * Simplifier: automatically reasons about transitivity chains
6352 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
6353 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
6354 old proofs break occasionally as simplification may now solve more
6355 goals than previously.
6357 * Simplifier: converts x <= y into x = y if assumption y <= x is
6358 present. Works for all partial orders (class "order"), in particular
6359 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
6362 * Simplifier: new simproc for "let x = a in f x". If a is a free or
6363 bound variable or a constant then the let is unfolded. Otherwise
6364 first a is simplified to b, and then f b is simplified to g. If
6365 possible we abstract b from g arriving at "let x = b in h x",
6366 otherwise we unfold the let and arrive at g. The simproc can be
6367 enabled/disabled by the reference use_let_simproc. Potential
6368 INCOMPATIBILITY since simplification is more powerful by default.
6370 * Classical reasoning: the meson method now accepts theorems as arguments.
6372 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
6373 jobs to provide advice on the provability of subgoals.
6375 * Theory OrderedGroup and Ring_and_Field: various additions and
6376 improvements to faciliate calculations involving equalities and
6379 The following theorems have been eliminated or modified
6382 abs_eq now named abs_of_nonneg
6383 abs_of_ge_0 now named abs_of_nonneg
6384 abs_minus_eq now named abs_of_nonpos
6385 imp_abs_id now named abs_of_nonneg
6386 imp_abs_neg_id now named abs_of_nonpos
6387 mult_pos now named mult_pos_pos
6388 mult_pos_le now named mult_nonneg_nonneg
6389 mult_pos_neg_le now named mult_nonneg_nonpos
6390 mult_pos_neg2_le now named mult_nonneg_nonpos2
6391 mult_neg now named mult_neg_neg
6392 mult_neg_le now named mult_nonpos_nonpos
6394 * The following lemmas in Ring_and_Field have been added to the simplifier:
6397 not_square_less_zero
6399 The following lemmas have been deleted from Real/RealPow:
6409 * Theory Parity: added rules for simplifying exponents.
6413 The following theorems have been eliminated or modified
6416 list_all_Nil now named list_all.simps(1)
6417 list_all_Cons now named list_all.simps(2)
6418 list_all_conv now named list_all_iff
6419 set_mem_eq now named mem_iff
6421 * Theories SetsAndFunctions and BigO (see HOL/Library) support
6422 asymptotic "big O" calculations. See the notes in BigO.thy.
6427 * Theory RealDef: better support for embedding natural numbers and
6428 integers in the reals.
6430 The following theorems have been eliminated or modified
6433 exp_ge_add_one_self now requires no hypotheses
6434 real_of_int_add reversed direction of equality (use [symmetric])
6435 real_of_int_minus reversed direction of equality (use [symmetric])
6436 real_of_int_diff reversed direction of equality (use [symmetric])
6437 real_of_int_mult reversed direction of equality (use [symmetric])
6439 * Theory RComplete: expanded support for floor and ceiling functions.
6441 * Theory Ln is new, with properties of the natural logarithm
6443 * Hyperreal: There is a new type constructor "star" for making
6444 nonstandard types. The old type names are now type synonyms:
6448 hcomplex = complex star
6450 * Hyperreal: Many groups of similarly-defined constants have been
6451 replaced by polymorphic versions (INCOMPATIBILITY):
6453 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
6455 starset <-- starsetNat, starsetC
6456 *s* <-- *sNat*, *sc*
6457 starset_n <-- starsetNat_n, starsetC_n
6458 *sn* <-- *sNatn*, *scn*
6459 InternalSets <-- InternalNatSets, InternalCSets
6461 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6462 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
6463 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
6464 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
6465 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
6467 * Hyperreal: Many type-specific theorems have been removed in favor of
6468 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
6470 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
6471 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
6472 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
6473 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
6474 right_minus <-- hypreal_add_minus
6475 left_minus <-- {hypreal,hcomplex}_add_minus_left
6476 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
6477 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
6478 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
6479 mult_1_right <-- hcomplex_mult_one_right
6480 mult_zero_left <-- hcomplex_mult_zero_left
6481 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
6482 right_distrib <-- hypnat_add_mult_distrib2
6483 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
6484 right_inverse <-- hypreal_mult_inverse
6485 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
6486 order_refl <-- {hypreal,hypnat}_le_refl
6487 order_trans <-- {hypreal,hypnat}_le_trans
6488 order_antisym <-- {hypreal,hypnat}_le_anti_sym
6489 order_less_le <-- {hypreal,hypnat}_less_le
6490 linorder_linear <-- {hypreal,hypnat}_le_linear
6491 add_left_mono <-- {hypreal,hypnat}_add_left_mono
6492 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
6493 add_nonneg_nonneg <-- hypreal_le_add_order
6495 * Hyperreal: Separate theorems having to do with type-specific
6496 versions of constants have been merged into theorems that apply to the
6497 new polymorphic constants (INCOMPATIBILITY):
6499 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
6500 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
6501 STAR_Un <-- {STAR,NatStar,STARC}_Un
6502 STAR_Int <-- {STAR,NatStar,STARC}_Int
6503 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
6504 STAR_subset <-- {STAR,NatStar,STARC}_subset
6505 STAR_mem <-- {STAR,NatStar,STARC}_mem
6506 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
6507 STAR_diff <-- {STAR,STARC}_diff
6508 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
6509 STARC_hcomplex_of_complex}_image_subset
6510 starset_n_Un <-- starset{Nat,C}_n_Un
6511 starset_n_Int <-- starset{Nat,C}_n_Int
6512 starset_n_Compl <-- starset{Nat,C}_n_Compl
6513 starset_n_diff <-- starset{Nat,C}_n_diff
6514 InternalSets_Un <-- Internal{Nat,C}Sets_Un
6515 InternalSets_Int <-- Internal{Nat,C}Sets_Int
6516 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
6517 InternalSets_diff <-- Internal{Nat,C}Sets_diff
6518 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
6519 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
6520 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
6521 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
6522 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
6523 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6524 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
6525 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
6526 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
6527 starfun_diff <-- starfun{C,RC,CR}_diff
6528 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
6529 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
6530 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
6531 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
6532 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
6533 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
6534 starfun_Id <-- starfunC_Id
6535 starfun_approx <-- starfun{Nat,CR}_approx
6536 starfun_capprox <-- starfun{C,RC}_capprox
6537 starfun_abs <-- starfunNat_rabs
6538 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
6539 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
6540 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
6541 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
6542 starfun_add_capprox <-- starfun{C,RC}_add_capprox
6543 starfun_add_approx <-- starfunCR_add_approx
6544 starfun_inverse_inverse <-- starfunC_inverse_inverse
6545 starfun_divide <-- starfun{C,CR,RC}_divide
6546 starfun_n <-- starfun{Nat,C}_n
6547 starfun_n_mult <-- starfun{Nat,C}_n_mult
6548 starfun_n_add <-- starfun{Nat,C}_n_add
6549 starfun_n_add_minus <-- starfunNat_n_add_minus
6550 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
6551 starfun_n_minus <-- starfun{Nat,C}_n_minus
6552 starfun_n_eq <-- starfun{Nat,C}_n_eq
6554 star_n_add <-- {hypreal,hypnat,hcomplex}_add
6555 star_n_minus <-- {hypreal,hcomplex}_minus
6556 star_n_diff <-- {hypreal,hcomplex}_diff
6557 star_n_mult <-- {hypreal,hcomplex}_mult
6558 star_n_inverse <-- {hypreal,hcomplex}_inverse
6559 star_n_le <-- {hypreal,hypnat}_le
6560 star_n_less <-- {hypreal,hypnat}_less
6561 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
6562 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
6563 star_n_abs <-- hypreal_hrabs
6564 star_n_divide <-- hcomplex_divide
6566 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
6567 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
6568 star_of_diff <-- hypreal_of_real_diff
6569 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
6570 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
6571 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
6572 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
6573 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
6574 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
6575 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
6576 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
6577 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
6578 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
6579 star_of_number_of <-- {hypreal,hcomplex}_number_of
6580 star_of_number_less <-- number_of_less_hypreal_of_real_iff
6581 star_of_number_le <-- number_of_le_hypreal_of_real_iff
6582 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
6583 star_of_less_number <-- hypreal_of_real_less_number_of_iff
6584 star_of_le_number <-- hypreal_of_real_le_number_of_iff
6585 star_of_power <-- hypreal_of_real_power
6586 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
6588 * Hyperreal: new method "transfer" that implements the transfer
6589 principle of nonstandard analysis. With a subgoal that mentions
6590 nonstandard types like "'a star", the command "apply transfer"
6591 replaces it with an equivalent one that mentions only standard types.
6592 To be successful, all free variables must have standard types; non-
6593 standard variables must have explicit universal quantifiers.
6595 * Hyperreal: A theory of Taylor series.
6600 * Discontinued special version of 'constdefs' (which used to support
6601 continuous functions) in favor of the general Pure one with full
6604 * New simplification procedure for solving continuity conditions; it
6605 is much faster on terms with many nested lambda abstractions (cubic
6606 instead of exponential time).
6608 * New syntax for domain package: selector names are now optional.
6609 Parentheses should be omitted unless argument is lazy, for example:
6611 domain 'a stream = cons "'a" (lazy "'a stream")
6613 * New command 'fixrec' for defining recursive functions with pattern
6614 matching; defining multiple functions with mutual recursion is also
6615 supported. Patterns may include the constants cpair, spair, up, sinl,
6616 sinr, or any data constructor defined by the domain package. The given
6617 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
6618 syntax and examples.
6620 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
6621 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
6622 but the proof obligation additionally includes an admissibility
6623 requirement. The packages generate instances of class cpo or pcpo,
6624 with continuity and strictness theorems for Rep and Abs.
6626 * HOLCF: Many theorems have been renamed according to a more standard naming
6627 scheme (INCOMPATIBILITY):
6629 foo_inject: "foo$x = foo$y ==> x = y"
6630 foo_eq: "(foo$x = foo$y) = (x = y)"
6631 foo_less: "(foo$x << foo$y) = (x << y)"
6632 foo_strict: "foo$UU = UU"
6633 foo_defined: "... ==> foo$x ~= UU"
6634 foo_defined_iff: "(foo$x = UU) = (x = UU)"
6639 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
6640 including the First Isomorphism Theorem (on quotienting by the kernel
6643 * ZF/Simplifier: install second copy of type solver that actually
6644 makes use of TC rules declared to Isar proof contexts (or locales);
6645 the old version is still required for ML proof scripts.
6650 * Converted to Isar theory format; use locales instead of axiomatic
6656 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
6659 * Pure/library.ML no longer defines its own option datatype, but uses
6660 that of the SML basis, which has constructors NONE and SOME instead of
6661 None and Some, as well as exception Option.Option instead of OPTION.
6662 The functions the, if_none, is_some, is_none have been adapted
6663 accordingly, while Option.map replaces apsome.
6665 * Pure/library.ML: the exception LIST has been given up in favour of
6666 the standard exceptions Empty and Subscript, as well as
6667 Library.UnequalLengths. Function like Library.hd and Library.tl are
6668 superceded by the standard hd and tl functions etc.
6670 A number of basic list functions are no longer exported to the ML
6671 toplevel, as they are variants of predefined functions. The following
6672 suggests how one can translate existing code:
6674 rev_append xs ys = List.revAppend (xs, ys)
6675 nth_elem (i, xs) = List.nth (xs, i)
6676 last_elem xs = List.last xs
6677 flat xss = List.concat xss
6678 seq fs = List.app fs
6679 partition P xs = List.partition P xs
6680 mapfilter f xs = List.mapPartial f xs
6682 * Pure/library.ML: several combinators for linear functional
6683 transformations, notably reverse application and composition:
6686 (x, y) |-> f f #-> g
6688 * Pure/library.ML: introduced/changed precedence of infix operators:
6690 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
6692 infix 3 o oo ooo oooo;
6693 infix 4 ~~ upto downto;
6695 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
6698 * Pure/library.ML: natural list combinators fold, fold_rev, and
6699 fold_map support linear functional transformations and nesting. For
6702 fold f [x1, ..., xN] y =
6703 y |> f x1 |> ... |> f xN
6705 (fold o fold) f [xs1, ..., xsN] y =
6706 y |> fold f xs1 |> ... |> fold f xsN
6708 fold f [x1, ..., xN] =
6711 (fold o fold) f [xs1, ..., xsN] =
6712 fold f xs1 #> ... #> fold f xsN
6714 * Pure/library.ML: the following selectors on type 'a option are
6717 the: 'a option -> 'a (*partial*)
6718 these: 'a option -> 'a where 'a = 'b list
6719 the_default: 'a -> 'a option -> 'a
6720 the_list: 'a option -> 'a list
6722 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6723 basic operations for association lists, following natural argument
6724 order; moreover the explicit equality predicate passed here avoids
6725 potentially expensive polymorphic runtime equality checks.
6726 The old functions may be expressed as follows:
6728 assoc = uncurry (AList.lookup (op =))
6729 assocs = these oo AList.lookup (op =)
6730 overwrite = uncurry (AList.update (op =)) o swap
6732 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6734 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
6735 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
6737 replacing make_keylist and keyfilter (occassionally used)
6740 make_keylist = AList.make
6741 keyfilter = AList.find (op =)
6743 * eq_fst and eq_snd now take explicit equality parameter, thus
6744 avoiding eqtypes. Naive rewrites:
6746 eq_fst = eq_fst (op =)
6747 eq_snd = eq_snd (op =)
6749 * Removed deprecated apl and apr (rarely used).
6752 apl (n, op) =>>= curry op n
6753 apr (op, m) =>>= fn n => op (n, m)
6755 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
6756 provides a reasonably efficient light-weight implementation of sets as
6759 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
6760 few new operations; existing lookup and update are now curried to
6761 follow natural argument order (for use with fold etc.);
6762 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
6764 * Pure/General: output via the Isabelle channels of
6765 writeln/warning/error etc. is now passed through Output.output, with a
6766 hook for arbitrary transformations depending on the print_mode
6767 (cf. Output.add_mode -- the first active mode that provides a output
6768 function wins). Already formatted output may be embedded into further
6769 text via Output.raw; the result of Pretty.string_of/str_of and derived
6770 functions (string_of_term/cterm/thm etc.) is already marked raw to
6771 accommodate easy composition of diagnostic messages etc. Programmers
6772 rarely need to care about Output.output or Output.raw at all, with
6773 some notable exceptions: Output.output is required when bypassing the
6774 standard channels (writeln etc.), or in token translations to produce
6775 properly formatted results; Output.raw is required when capturing
6776 already output material that will eventually be presented to the user
6777 a second time. For the default print mode, both Output.output and
6778 Output.raw have no effect.
6780 * Pure/General: Output.time_accumulator NAME creates an operator ('a
6781 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
6782 cumulative results are displayed at the end of a batch session.
6784 * Pure/General: File.sysify_path and File.quote_sysify path have been
6785 replaced by File.platform_path and File.shell_path (with appropriate
6786 hooks). This provides a clean interface for unusual systems where the
6787 internal and external process view of file names are different.
6789 * Pure: more efficient orders for basic syntactic entities: added
6790 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
6791 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
6792 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
6793 orders now -- potential INCOMPATIBILITY for code that depends on a
6794 particular order for Symtab.keys, Symtab.dest, etc. (consider using
6795 Library.sort_strings on result).
6797 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
6798 fold_types traverse types/terms from left to right, observing natural
6799 argument order. Supercedes previous foldl_XXX versions, add_frees,
6800 add_vars etc. have been adapted as well: INCOMPATIBILITY.
6802 * Pure: name spaces have been refined, with significant changes of the
6803 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
6804 to extern(_table). The plain name entry path is superceded by a
6805 general 'naming' context, which also includes the 'policy' to produce
6806 a fully qualified name and external accesses of a fully qualified
6807 name; NameSpace.extend is superceded by context dependent
6808 Sign.declare_name. Several theory and proof context operations modify
6809 the naming context. Especially note Theory.restore_naming and
6810 ProofContext.restore_naming to get back to a sane state; note that
6811 Theory.add_path is no longer sufficient to recover from
6812 Theory.absolute_path in particular.
6814 * Pure: new flags short_names (default false) and unique_names
6815 (default true) for controlling output of qualified names. If
6816 short_names is set, names are printed unqualified. If unique_names is
6817 reset, the name prefix is reduced to the minimum required to achieve
6818 the original result when interning again, even if there is an overlap
6819 with earlier declarations.
6821 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
6822 now 'extend', and 'merge' gets an additional Pretty.pp argument
6823 (useful for printing error messages). INCOMPATIBILITY.
6825 * Pure: major reorganization of the theory context. Type Sign.sg and
6826 Theory.theory are now identified, referring to the universal
6827 Context.theory (see Pure/context.ML). Actual signature and theory
6828 content is managed as theory data. The old code and interfaces were
6829 spread over many files and structures; the new arrangement introduces
6830 considerable INCOMPATIBILITY to gain more clarity:
6832 Context -- theory management operations (name, identity, inclusion,
6833 parents, ancestors, merge, etc.), plus generic theory data;
6835 Sign -- logical signature and syntax operations (declaring consts,
6836 types, etc.), plus certify/read for common entities;
6838 Theory -- logical theory operations (stating axioms, definitions,
6839 oracles), plus a copy of logical signature operations (consts,
6840 types, etc.); also a few basic management operations (Theory.copy,
6843 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
6844 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
6845 for convenience -- they merely return the theory.
6847 * Pure: type Type.tsig is superceded by theory in most interfaces.
6849 * Pure: the Isar proof context type is already defined early in Pure
6850 as Context.proof (note that ProofContext.context and Proof.context are
6851 aliases, where the latter is the preferred name). This enables other
6852 Isabelle components to refer to that type even before Isar is present.
6854 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
6855 typeK, constK, axiomK, oracleK), but provide explicit operations for
6856 any of these kinds. For example, Sign.intern typeK is now
6857 Sign.intern_type, Theory.hide_space Sign.typeK is now
6858 Theory.hide_types. Also note that former
6859 Theory.hide_classes/types/consts are now
6860 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
6861 internalize their arguments! INCOMPATIBILITY.
6863 * Pure: get_thm interface (of PureThy and ProofContext) expects
6864 datatype thmref (with constructors Name and NameSelection) instead of
6865 plain string -- INCOMPATIBILITY;
6867 * Pure: cases produced by proof methods specify options, where NONE
6868 means to remove case bindings -- INCOMPATIBILITY in
6871 * Pure: the following operations retrieve axioms or theorems from a
6872 theory node or theory hierarchy, respectively:
6874 Theory.axioms_of: theory -> (string * term) list
6875 Theory.all_axioms_of: theory -> (string * term) list
6876 PureThy.thms_of: theory -> (string * thm) list
6877 PureThy.all_thms_of: theory -> (string * thm) list
6879 * Pure: print_tac now outputs the goal through the trace channel.
6881 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
6882 Reference Toplevel.debug (default false) controls detailed printing
6883 and tracing of low-level exceptions; Toplevel.profiling (default 0)
6884 controls execution profiling -- set to 1 for time and 2 for space
6885 (both increase the runtime).
6887 * Isar session: The initial use of ROOT.ML is now always timed,
6888 i.e. the log will show the actual process times, in contrast to the
6889 elapsed wall-clock time that the outer shell wrapper produces.
6891 * Simplifier: improved handling of bound variables (nameless
6892 representation, avoid allocating new strings). Simprocs that invoke
6893 the Simplifier recursively should use Simplifier.inherit_bounds to
6894 avoid local name clashes. Failure to do so produces warnings
6895 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
6896 for further details.
6898 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
6899 bindings for all theorems stored within a given theory; this may help
6900 in porting non-Isar theories to Isar ones, while keeping ML proof
6901 scripts for the time being.
6903 * ML operator HTML.with_charset specifies the charset begin used for
6904 generated HTML files. For example:
6906 HTML.with_charset "utf-8" use_thy "Hebrew";
6907 HTML.with_charset "utf-8" use_thy "Chinese";
6912 * Allow symlinks to all proper Isabelle executables (Isabelle,
6913 isabelle, isatool etc.).
6915 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
6916 isatool doc, isatool mkdir, display_drafts etc.).
6918 * isatool usedir: option -f allows specification of the ML file to be
6919 used by Isabelle; default is ROOT.ML.
6921 * New isatool version outputs the version identifier of the Isabelle
6922 distribution being used.
6924 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
6925 (containing Boolean satisfiability problems) into Isabelle/HOL
6930 New in Isabelle2004 (April 2004)
6931 --------------------------------
6935 * Provers/order.ML: new efficient reasoner for partial and linear orders.
6936 Replaces linorder.ML.
6938 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
6939 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
6940 (\<a>...\<z>), are now considered normal letters, and can therefore
6941 be used anywhere where an ASCII letter (a...zA...Z) has until
6942 now. COMPATIBILITY: This obviously changes the parsing of some
6943 terms, especially where a symbol has been used as a binder, say
6944 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
6945 as an identifier. Fix it by inserting a space around former
6946 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
6947 existing theory and ML files.
6949 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
6951 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
6952 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
6953 a normal (but invisible) letter. For multiple letter subscripts repeat
6954 \<^isub> like this: x\<^isub>1\<^isub>2.
6956 * Pure: There are now sub-/superscripts that can span more than one
6957 character. Text between \<^bsub> and \<^esub> is set in subscript in
6958 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
6959 superscript. The new control characters are not identifier parts.
6961 * Pure: Control-symbols of the form \<^raw:...> will literally print the
6962 content of "..." to the latex file instead of \isacntrl... . The "..."
6963 may consist of any printable characters excluding the end bracket >.
6965 * Pure: Using new Isar command "finalconsts" (or the ML functions
6966 Theory.add_finals or Theory.add_finals_i) it is now possible to
6967 declare constants "final", which prevents their being given a definition
6968 later. It is useful for constants whose behaviour is fixed axiomatically
6969 rather than definitionally, such as the meta-logic connectives.
6971 * Pure: 'instance' now handles general arities with general sorts
6972 (i.e. intersections of classes),
6974 * Presentation: generated HTML now uses a CSS style sheet to make layout
6975 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
6976 It can be changed to alter the colors/layout of generated pages.
6981 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
6982 cut_tac, subgoal_tac and thin_tac:
6983 - Now understand static (Isar) contexts. As a consequence, users of Isar
6984 locales are no longer forced to write Isar proof scripts.
6985 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
6987 - INCOMPATIBILITY: names of variables to be instantiated may no
6988 longer be enclosed in quotes. Instead, precede variable name with `?'.
6989 This is consistent with the instantiation attribute "where".
6991 * Attributes "where" and "of":
6992 - Now take type variables of instantiated theorem into account when reading
6993 the instantiation string. This fixes a bug that caused instantiated
6994 theorems to have too special types in some circumstances.
6995 - "where" permits explicit instantiations of type variables.
6997 * Calculation commands "moreover" and "also" no longer interfere with
6998 current facts ("this"), admitting arbitrary combinations with "then"
7002 - Goal statements involving the context element "includes" no longer
7003 generate theorems with internal delta predicates (those ending on
7004 "_axioms") in the premise.
7005 Resolve particular premise with <locale>.intro to obtain old form.
7006 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
7007 specification and "includes" elements in goal statement.
7008 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
7009 [intro?] and [elim?] (respectively) by default.
7010 - Experimental command for instantiation of locales in proof contexts:
7011 instantiate <label>[<attrs>]: <loc>
7012 Instantiates locale <loc> and adds all its theorems to the current context
7013 taking into account their attributes. Label and attrs are optional
7014 modifiers, like in theorem declarations. If present, names of
7015 instantiated theorems are qualified with <label>, and the attributes
7016 <attrs> are applied after any attributes these theorems might have already.
7017 If the locale has assumptions, a chained fact of the form
7018 "<loc> t1 ... tn" is expected from which instantiations of the parameters
7019 are derived. The command does not support old-style locales declared
7020 with "locale (open)".
7021 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
7023 * HOL: Tactic emulation methods induct_tac and case_tac understand static
7029 * Proof import: new image HOL4 contains the imported library from
7030 the HOL4 system with about 2500 theorems. It is imported by
7031 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
7032 can be used like any other Isabelle image. See
7033 HOL/Import/HOL/README for more information.
7036 - Much improved handling of linear and partial orders.
7037 Reasoners for linear and partial orders are set up for type classes
7038 "linorder" and "order" respectively, and are added to the default simpset
7039 as solvers. This means that the simplifier can build transitivity chains
7040 to solve goals from the assumptions.
7041 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
7042 of blast or auto after simplification become unnecessary because the goal
7043 is solved by simplification already.
7045 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
7046 all proved in axiomatic type classes for semirings, rings and fields.
7049 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
7050 now formalized using the Ring_and_Field theory mentioned above.
7051 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
7052 than before, because now they are set up once in a generic manner.
7053 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
7054 Look for the general versions in Ring_and_Field (and Power if they concern
7057 * Type "rat" of the rational numbers is now available in HOL-Complex.
7060 - Record types are now by default printed with their type abbreviation
7061 instead of the list of all field types. This can be configured via
7062 the reference "print_record_type_abbr".
7063 - Simproc "record_upd_simproc" for simplification of multiple updates added
7064 (not enabled by default).
7065 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
7066 EX x. x = sel r to True (not enabled by default).
7067 - Tactic "record_split_simp_tac" to split and simplify records added.
7069 * 'specification' command added, allowing for definition by
7070 specification. There is also an 'ax_specification' command that
7071 introduces the new constants axiomatically.
7073 * arith(_tac) is now able to generate counterexamples for reals as well.
7075 * HOL-Algebra: new locale "ring" for non-commutative rings.
7077 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
7078 definitions, thanks to Sava Krsti\'{c} and John Matthews.
7080 * HOL-Matrix: a first theory for matrices in HOL with an application of
7081 matrix theory to linear programming.
7083 * Unions and Intersections:
7084 The latex output syntax of UN and INT has been changed
7085 from "\Union x \in A. B" to "\Union_{x \in A} B"
7086 i.e. the index formulae has become a subscript.
7087 Similarly for "\Union x. B", and for \Inter instead of \Union.
7089 * Unions and Intersections over Intervals:
7090 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
7091 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
7092 like in normal math, and corresponding versions for < and for intersection.
7094 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
7095 lexicographic dictonary ordering has been added as "lexord".
7097 * ML: the legacy theory structures Int and List have been removed. They had
7098 conflicted with ML Basis Library structures having the same names.
7100 * 'refute' command added to search for (finite) countermodels. Only works
7101 for a fragment of HOL. The installation of an external SAT solver is
7102 highly recommended. See "HOL/Refute.thy" for details.
7104 * 'quickcheck' command: Allows to find counterexamples by evaluating
7105 formulae under an assignment of free variables to random values.
7106 In contrast to 'refute', it can deal with inductive datatypes,
7107 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
7113 * Streams now come with concatenation and are part of the HOLCF image
7117 New in Isabelle2003 (May 2003)
7118 ------------------------------
7122 * Provers/simplifier:
7124 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
7125 Assumptions are now subject to complete mutual simplification,
7126 not just from left to right. The simplifier now preserves
7127 the order of assumptions.
7129 Potential INCOMPATIBILITY:
7131 -- simp sometimes diverges where the old version did
7132 not, e.g. invoking simp on the goal
7134 [| P (f x); y = x; f x = f y |] ==> Q
7136 now gives rise to the infinite reduction sequence
7138 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
7140 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
7143 -- Tactics combining classical reasoner and simplification (such as auto)
7144 are also affected by this change, because many of them rely on
7145 simp. They may sometimes diverge as well or yield a different numbers
7146 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
7147 in case of problems. Sometimes subsequent calls to the classical
7148 reasoner will fail because a preceeding call to the simplifier too
7149 eagerly simplified the goal, e.g. deleted redundant premises.
7151 - The simplifier trace now shows the names of the applied rewrite rules
7153 - You can limit the number of recursive invocations of the simplifier
7154 during conditional rewriting (where the simplifie tries to solve the
7155 conditions before applying the rewrite rule):
7156 ML "simp_depth_limit := n"
7157 where n is an integer. Thus you can force termination where previously
7158 the simplifier would diverge.
7160 - Accepts free variables as head terms in congruence rules. Useful in Isar.
7162 - No longer aborts on failed congruence proof. Instead, the
7163 congruence is ignored.
7165 * Pure: New generic framework for extracting programs from constructive
7166 proofs. See HOL/Extraction.thy for an example instantiation, as well
7167 as HOL/Extraction for some case studies.
7169 * Pure: The main goal of the proof state is no longer shown by default, only
7170 the subgoals. This behaviour is controlled by a new flag.
7171 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
7172 (ML: Proof.show_main_goal).
7174 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
7175 rules whose conclusion matches subgoal 1:
7176 PG menu: Isabelle/Isar -> Show me -> matching rules
7177 The rules are ordered by how closely they match the subgoal.
7178 In particular, rules that solve a subgoal outright are displayed first
7179 (or rather last, the way they are printed).
7180 (ML: ProofGeneral.print_intros())
7182 * Pure: New flag trace_unify_fail causes unification to print
7183 diagnostic information (PG: in trace buffer) when it fails. This is
7184 useful for figuring out why single step proofs like rule, erule or
7187 * Pure: Locale specifications now produce predicate definitions
7188 according to the body of text (covering assumptions modulo local
7189 definitions); predicate "loc_axioms" covers newly introduced text,
7190 while "loc" is cumulative wrt. all included locale expressions; the
7191 latter view is presented only on export into the global theory
7192 context; potential INCOMPATIBILITY, use "(open)" option to fall back
7193 on the old view without predicates;
7195 * Pure: predefined locales "var" and "struct" are useful for sharing
7196 parameters (as in CASL, for example); just specify something like
7197 ``var x + var y + struct M'' as import;
7199 * Pure: improved thms_containing: proper indexing of facts instead of
7200 raw theorems; check validity of results wrt. current name space;
7201 include local facts of proof configuration (also covers active
7202 locales), cover fixed variables in index; may use "_" in term
7203 specification; an optional limit for the number of printed facts may
7204 be given (the default is 40);
7206 * Pure: disallow duplicate fact bindings within new-style theory files
7209 * Provers: improved induct method: assumptions introduced by case
7210 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
7211 the goal statement); "foo" still refers to all facts collectively;
7213 * Provers: the function blast.overloaded has been removed: all constants
7214 are regarded as potentially overloaded, which improves robustness in exchange
7215 for slight decrease in efficiency;
7217 * Provers/linorder: New generic prover for transitivity reasoning over
7218 linear orders. Note: this prover is not efficient!
7220 * Isar: preview of problems to finish 'show' now produce an error
7221 rather than just a warning (in interactive mode);
7228 - Produces a counter example if it cannot prove a goal.
7229 Note that the counter example may be spurious if the goal is not a formula
7230 of quantifier-free linear arithmetic.
7231 In ProofGeneral the counter example appears in the trace buffer.
7233 - Knows about div k and mod k where k is a numeral of type nat or int.
7235 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
7236 linear arithmetic fails. This takes account of quantifiers and divisibility.
7237 Presburger arithmetic can also be called explicitly via presburger(_tac).
7239 * simp's arithmetic capabilities have been enhanced a bit: it now
7240 takes ~= in premises into account (by performing a case split);
7242 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
7243 are distributed over a sum of terms;
7245 * New tactic "trans_tac" and method "trans" instantiate
7246 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
7249 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
7250 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
7252 * 'typedef' command has new option "open" to suppress the set
7255 * functions Min and Max on finite sets have been introduced (theory
7258 * attribute [symmetric] now works for relations as well; it turns
7259 (x,y) : R^-1 into (y,x) : R, and vice versa;
7261 * induct over a !!-quantified statement (say !!x1..xn):
7262 each "case" automatically performs "fix x1 .. xn" with exactly those names.
7264 * Map: `empty' is no longer a constant but a syntactic abbreviation for
7265 %x. None. Warning: empty_def now refers to the previously hidden definition
7268 * Algebra: formalization of classical algebra. Intended as base for
7269 any algebraic development in Isabelle. Currently covers group theory
7270 (up to Sylow's theorem) and ring theory (Universal Property of
7271 Univariate Polynomials). Contributions welcome;
7273 * GroupTheory: deleted, since its material has been moved to Algebra;
7275 * Complex: new directory of the complex numbers with numeric constants,
7276 nonstandard complex numbers, and some complex analysis, standard and
7277 nonstandard (Jacques Fleuriot);
7279 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
7281 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
7284 * Real/HahnBanach: updated and adapted to locales;
7286 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
7289 * UNITY: added the Meier-Sanders theory of progress sets;
7291 * MicroJava: bytecode verifier and lightweight bytecode verifier
7292 as abstract algorithms, instantiated to the JVM;
7294 * Bali: Java source language formalization. Type system, operational
7295 semantics, axiomatic semantics. Supported language features:
7296 classes, interfaces, objects,virtual methods, static methods,
7297 static/instance fields, arrays, access modifiers, definite
7298 assignment, exceptions.
7303 * ZF/Constructible: consistency proof for AC (Gdel's constructible
7306 * Main ZF: virtually all theories converted to new-style format;
7311 * Pure: Tactic.prove provides sane interface for internal proofs;
7312 omits the infamous "standard" operation, so this is more appropriate
7313 than prove_goalw_cterm in many situations (e.g. in simprocs);
7315 * Pure: improved error reporting of simprocs;
7317 * Provers: Simplifier.simproc(_i) provides sane interface for setting
7321 *** Document preparation ***
7323 * uses \par instead of \\ for line breaks in theory text. This may
7324 shift some page breaks in large documents. To get the old behaviour
7325 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
7327 * minimized dependencies of isabelle.sty and isabellesym.sty on
7330 * \<euro> now needs package babel/greek instead of marvosym (which
7333 * normal size for \<zero>...\<nine> (uses \mathbf instead of
7338 New in Isabelle2002 (March 2002)
7339 --------------------------------
7341 *** Document preparation ***
7343 * greatly simplified document preparation setup, including more
7344 graceful interpretation of isatool usedir -i/-d/-D options, and more
7345 instructive isatool mkdir; users should basically be able to get
7346 started with "isatool mkdir HOL Test && isatool make"; alternatively,
7347 users may run a separate document processing stage manually like this:
7348 "isatool usedir -D output HOL Test && isatool document Test/output";
7350 * theory dependency graph may now be incorporated into documents;
7351 isatool usedir -g true will produce session_graph.eps/.pdf for use
7352 with \includegraphics of LaTeX;
7354 * proper spacing of consecutive markup elements, especially text
7355 blocks after section headings;
7357 * support bold style (for single symbols only), input syntax is like
7358 this: "\<^bold>\<alpha>" or "\<^bold>A";
7360 * \<bullet> is now output as bold \cdot by default, which looks much
7361 better in printed text;
7363 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
7364 note that these symbols are currently unavailable in Proof General /
7365 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
7367 * isatool latex no longer depends on changed TEXINPUTS, instead
7368 isatool document copies the Isabelle style files to the target
7374 * Pure/Provers: improved proof by cases and induction;
7375 - 'case' command admits impromptu naming of parameters (such as
7377 - 'induct' method divinates rule instantiation from the inductive
7378 claim; no longer requires excessive ?P bindings for proper
7379 instantiation of cases;
7380 - 'induct' method properly enumerates all possibilities of set/type
7381 rules; as a consequence facts may be also passed through *type*
7382 rules without further ado;
7383 - 'induct' method now derives symbolic cases from the *rulified*
7384 rule (before it used to rulify cases stemming from the internal
7385 atomized version); this means that the context of a non-atomic
7386 statement becomes is included in the hypothesis, avoiding the
7387 slightly cumbersome show "PROP ?case" form;
7388 - 'induct' may now use elim-style induction rules without chaining
7389 facts, using ``missing'' premises from the goal state; this allows
7390 rules stemming from inductive sets to be applied in unstructured
7391 scripts, while still benefitting from proper handling of non-atomic
7392 statements; NB: major inductive premises need to be put first, all
7393 the rest of the goal is passed through the induction;
7394 - 'induct' proper support for mutual induction involving non-atomic
7395 rule statements (uses the new concept of simultaneous goals, see
7397 - append all possible rule selections, but only use the first
7398 success (no backtracking);
7399 - removed obsolete "(simplified)" and "(stripped)" options of methods;
7400 - undeclared rule case names default to numbers 1, 2, 3, ...;
7401 - added 'print_induct_rules' (covered by help item in recent Proof
7403 - moved induct/cases attributes to Pure, methods to Provers;
7404 - generic method setup instantiated for FOL and HOL;
7406 * Pure: support multiple simultaneous goal statements, for example
7407 "have a: A and b: B" (same for 'theorem' etc.); being a pure
7408 meta-level mechanism, this acts as if several individual goals had
7409 been stated separately; in particular common proof methods need to be
7410 repeated in order to cover all claims; note that a single elimination
7411 step is *not* sufficient to establish the two conjunctions, so this
7414 assume "A & B" then have A and B .. (*".." fails*)
7416 better use "obtain" in situations as above; alternative refer to
7417 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
7419 * Pure: proper integration with ``locales''; unlike the original
7420 version by Florian Kammller, Isar locales package high-level proof
7421 contexts rather than raw logical ones (e.g. we admit to include
7422 attributes everywhere); operations on locales include merge and
7423 rename; support for implicit arguments (``structures''); simultaneous
7424 type-inference over imports and text; see also HOL/ex/Locales.thy for
7427 * Pure: the following commands have been ``localized'', supporting a
7428 target locale specification "(in name)": 'lemma', 'theorem',
7429 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
7430 stored both within the locale and at the theory level (exported and
7431 qualified by the locale name);
7433 * Pure: theory goals may now be specified in ``long'' form, with
7434 ad-hoc contexts consisting of arbitrary locale elements. for example
7435 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
7436 definitions may be given, too); the result is a meta-level rule with
7437 the context elements being discharged in the obvious way;
7439 * Pure: new proof command 'using' allows to augment currently used
7440 facts after a goal statement ('using' is syntactically analogous to
7441 'apply', but acts on the goal's facts only); this allows chained facts
7442 to be separated into parts given before and after a claim, as in
7443 ``from a and b have C using d and e <proof>'';
7445 * Pure: renamed "antecedent" case to "rule_context";
7447 * Pure: new 'judgment' command records explicit information about the
7448 object-logic embedding (used by several tools internally); no longer
7449 use hard-wired "Trueprop";
7451 * Pure: added 'corollary' command;
7453 * Pure: fixed 'token_translation' command;
7455 * Pure: removed obsolete 'exported' attribute;
7457 * Pure: dummy pattern "_" in is/let is now automatically lifted over
7458 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
7459 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
7461 * Pure: method 'atomize' presents local goal premises as object-level
7462 statements (atomic meta-level propositions); setup controlled via
7463 rewrite rules declarations of 'atomize' attribute; example
7464 application: 'induct' method with proper rule statements in improper
7467 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
7468 now consider the syntactic context of assumptions, giving a better
7469 chance to get type-inference of the arguments right (this is
7470 especially important for locales);
7472 * Pure: "sorry" no longer requires quick_and_dirty in interactive
7475 * Pure/obtain: the formal conclusion "thesis", being marked as
7476 ``internal'', may no longer be reference directly in the text;
7477 potential INCOMPATIBILITY, may need to use "?thesis" in rare
7480 * Pure: generic 'sym' attribute which declares a rule both as pure
7481 'elim?' and for the 'symmetric' operation;
7483 * Pure: marginal comments ``--'' may now occur just anywhere in the
7484 text; the fixed correlation with particular command syntax has been
7487 * Pure: new method 'rules' is particularly well-suited for proof
7488 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
7489 but often produces more compact proof terms with less detours;
7491 * Pure/Provers/classical: simplified integration with pure rule
7492 attributes and methods; the classical "intro?/elim?/dest?"
7493 declarations coincide with the pure ones; the "rule" method no longer
7494 includes classically swapped intros; "intro" and "elim" methods no
7495 longer pick rules from the context; also got rid of ML declarations
7496 AddXIs/AddXEs/AddXDs; all of this has some potential for
7499 * Provers/classical: attribute 'swapped' produces classical inversions
7500 of introduction rules;
7502 * Provers/simplifier: 'simplified' attribute may refer to explicit
7503 rules instead of full simplifier context; 'iff' attribute handles
7506 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
7508 * HOL: 'recdef' now fails on unfinished automated proofs, use
7509 "(permissive)" option to recover old behavior;
7511 * HOL: 'inductive' no longer features separate (collective) attributes
7512 for 'intros' (was found too confusing);
7514 * HOL: properly declared induction rules less_induct and
7520 * HOL: moved over to sane numeral syntax; the new policy is as
7523 - 0 and 1 are polymorphic constants, which are defined on any
7524 numeric type (nat, int, real etc.);
7526 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
7527 binary representation internally;
7529 - type nat has special constructor Suc, and generally prefers Suc 0
7530 over 1::nat and Suc (Suc 0) over 2::nat;
7532 This change may cause significant problems of INCOMPATIBILITY; here
7533 are some hints on converting existing sources:
7535 - due to the new "num" token, "-0" and "-1" etc. are now atomic
7536 entities, so expressions involving "-" (unary or binary minus) need
7537 to be spaced properly;
7539 - existing occurrences of "1" may need to be constraint "1::nat" or
7540 even replaced by Suc 0; similar for old "2";
7542 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
7544 - remove all special provisions on numerals in proofs;
7546 * HOL: simp rules nat_number expand numerals on nat to Suc/0
7547 representation (depends on bin_arith_simps in the default context);
7549 * HOL: symbolic syntax for x^2 (numeral 2);
7551 * HOL: the class of all HOL types is now called "type" rather than
7552 "term"; INCOMPATIBILITY, need to adapt references to this type class
7553 in axclass/classes, instance/arities, and (usually rare) occurrences
7554 in typings (of consts etc.); internally the class is called
7555 "HOL.type", ML programs should refer to HOLogic.typeS;
7557 * HOL/record package improvements:
7558 - new derived operations "fields" to build a partial record section,
7559 "extend" to promote a fixed record to a record scheme, and
7560 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
7561 declared as simp by default;
7562 - shared operations ("more", "fields", etc.) now need to be always
7563 qualified) --- potential INCOMPATIBILITY;
7564 - removed "make_scheme" operations (use "make" with "extend") --
7566 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
7567 - provides cases/induct rules for use with corresponding Isar
7568 methods (for concrete records, record schemes, concrete more
7569 parts, and schematic more parts -- in that order);
7570 - internal definitions directly based on a light-weight abstract
7571 theory of product types over typedef rather than datatype;
7573 * HOL: generic code generator for generating executable ML code from
7574 specifications; specific support for HOL constructs such as inductive
7575 datatypes and sets, as well as recursive functions; can be invoked
7576 via 'generate_code' theory section;
7578 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
7580 * HOL: consolidated and renamed several theories. In particular:
7581 Ord.thy has been absorbed into HOL.thy
7582 String.thy has been absorbed into List.thy
7584 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
7585 (beware of argument permutation!);
7587 * HOL: linorder_less_split superseded by linorder_cases;
7589 * HOL/List: "nodups" renamed to "distinct";
7591 * HOL: added "The" definite description operator; move Hilbert's "Eps"
7592 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
7593 - Ex_def has changed, now need to use some_eq_ex
7595 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
7596 in this (rare) case use:
7598 delSWrapper "split_all_tac"
7599 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
7601 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
7604 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
7605 Isabelle's type classes, ^ on functions and relations has too general
7606 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
7607 necessary to attach explicit type constraints;
7609 * HOL/Relation: the prefix name of the infix "O" has been changed from
7610 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
7611 renamed accordingly (eg "compI" -> "rel_compI").
7613 * HOL: syntax translations now work properly with numerals and records
7616 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
7617 of "lam" -- INCOMPATIBILITY;
7619 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
7620 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
7621 renamed "Product_Type.unit";
7623 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
7625 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
7626 the "cases" method);
7628 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
7631 * HOL/IMP: updated and converted to new-style theory format; several
7632 parts turned into readable document, with proper Isar proof texts and
7633 some explanations (by Gerwin Klein);
7635 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
7637 * HOL-Hyperreal is now a logic image;
7642 * Isar: consts/constdefs supports mixfix syntax for continuous
7645 * Isar: domain package adapted to new-style theory format, e.g. see
7648 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
7649 potential INCOMPATIBILITY; now use plain induct_tac instead of former
7650 lift.induct_tac, always use UU instead of Undef;
7652 * HOLCF/IMP: updated and converted to new-style theory;
7657 * Isar: proper integration of logic-specific tools and packages,
7658 including theory commands '(co)inductive', '(co)datatype',
7659 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
7660 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
7662 * theory Main no longer includes AC; for the Axiom of Choice, base
7663 your theory on Main_ZFC;
7665 * the integer library now covers quotients and remainders, with many
7666 laws relating division to addition, multiplication, etc.;
7668 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
7669 typeless version of the formalism;
7671 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
7674 * ZF/Induct: new directory for examples of inductive definitions,
7675 including theory Multiset for multiset orderings; converted to
7676 new-style theory format;
7678 * ZF: many new theorems about lists, ordinals, etc.;
7683 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
7684 variable proof controls level of detail: 0 = no proofs (only oracle
7685 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
7686 also ref manual for further ML interfaces;
7688 * Pure/axclass: removed obsolete ML interface
7689 goal_subclass/goal_arity;
7691 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
7692 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
7693 separate tokens, so expressions involving minus need to be spaced
7696 * Pure/syntax: support non-oriented infixes, using keyword "infix"
7697 rather than "infixl" or "infixr";
7699 * Pure/syntax: concrete syntax for dummy type variables admits genuine
7700 sort constraint specifications in type inference; e.g. "x::_::foo"
7701 ensures that the type of "x" is of sort "foo" (but not necessarily a
7704 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
7705 control output of nested => (types); the default behavior is
7708 * Pure/syntax: builtin parse translation for "_constify" turns valued
7709 tokens into AST constants;
7711 * Pure/syntax: prefer later declarations of translations and print
7712 translation functions; potential INCOMPATIBILITY: need to reverse
7713 multiple declarations for same syntax element constant;
7715 * Pure/show_hyps reset by default (in accordance to existing Isar
7718 * Provers/classical: renamed addaltern to addafter, addSaltern to
7721 * Provers/clasimp: ``iff'' declarations now handle conditional rules
7724 * system: tested support for MacOS X; should be able to get Isabelle +
7725 Proof General to work in a plain Terminal after installing Poly/ML
7726 (e.g. from the Isabelle distribution area) and GNU bash alone
7727 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
7728 support requires further installations, e.g. from
7729 http://fink.sourceforge.net/);
7731 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
7733 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
7734 of 40 MB), cf. ML_OPTIONS;
7736 * system: Proof General keywords specification is now part of the
7737 Isabelle distribution (see etc/isar-keywords.el);
7739 * system: support for persistent Proof General sessions (refrain from
7740 outdating all loaded theories on startup); user may create writable
7741 logic images like this: ``isabelle -q HOL Test'';
7743 * system: smart selection of Isabelle process versus Isabelle
7744 interface, accommodates case-insensitive file systems (e.g. HFS+); may
7745 run both "isabelle" and "Isabelle" even if file names are badly
7746 damaged (executable inspects the case of the first letter of its own
7747 name); added separate "isabelle-process" and "isabelle-interface";
7749 * system: refrain from any attempt at filtering input streams; no
7750 longer support ``8bit'' encoding of old isabelle font, instead proper
7751 iso-latin characters may now be used; the related isatools
7752 "symbolinput" and "nonascii" have disappeared as well;
7754 * system: removed old "xterm" interface (the print modes "xterm" and
7755 "xterm_color" are still available for direct use in a suitable
7760 New in Isabelle99-2 (February 2001)
7761 -----------------------------------
7763 *** Overview of INCOMPATIBILITIES ***
7765 * HOL: please note that theories in the Library and elsewhere often use the
7766 new-style (Isar) format; to refer to their theorems in an ML script you must
7767 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
7769 * HOL: inductive package no longer splits induction rule aggressively,
7770 but only as far as specified by the introductions given; the old
7771 format may be recovered via ML function complete_split_rule or attribute
7772 'split_rule (complete)';
7774 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
7775 gfp_Tarski to gfp_unfold;
7777 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
7779 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
7780 relation); infix "^^" has been renamed "``"; infix "``" has been
7781 renamed "`"; "univalent" has been renamed "single_valued";
7783 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
7786 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
7788 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
7790 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
7791 consequence, it is no longer monotonic wrt. the local goal context
7792 (which is now passed through the inductive cases);
7794 * Document preparation: renamed standard symbols \<ll> to \<lless> and
7795 \<gg> to \<ggreater>;
7798 *** Document preparation ***
7800 * \isabellestyle{NAME} selects version of Isabelle output (currently
7801 available: are "it" for near math-mode best-style output, "sl" for
7802 slanted text style, and "tt" for plain type-writer; if no
7803 \isabellestyle command is given, output is according to slanted
7806 * support sub/super scripts (for single symbols only), input syntax is
7807 like this: "A\<^sup>*" or "A\<^sup>\<star>";
7809 * some more standard symbols; see Appendix A of the system manual for
7810 the complete list of symbols defined in isabellesym.sty;
7812 * improved isabelle style files; more abstract symbol implementation
7813 (should now use \isamath{...} and \isatext{...} in custom symbol
7816 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
7817 state; Note that presentation of goal states does not conform to
7818 actual human-readable proof documents. Please do not include goal
7819 states into document output unless you really know what you are doing!
7821 * proper indentation of antiquoted output with proportional LaTeX
7824 * no_document ML operator temporarily disables LaTeX document
7827 * isatool unsymbolize tunes sources for plain ASCII communication;
7832 * Pure: Isar now suffers initial goal statements to contain unbound
7833 schematic variables (this does not conform to actual readable proof
7834 documents, due to unpredictable outcome and non-compositional proof
7835 checking); users who know what they are doing may use schematic goals
7836 for Prolog-style synthesis of proven results;
7838 * Pure: assumption method (an implicit finishing) now handles actual
7841 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
7842 initial goal, declare "that" only as Pure intro (only for single
7843 steps); the "that" rule assumption may now be involved in implicit
7844 finishing, thus ".." becomes a feasible for trivial obtains;
7846 * Pure: default proof step now includes 'intro_classes'; thus trivial
7847 instance proofs may be performed by "..";
7849 * Pure: ?thesis / ?this / "..." now work for pure meta-level
7852 * Pure: more robust selection of calculational rules;
7854 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
7855 rule (as well as the assumption rule);
7857 * Pure: 'thm_deps' command visualizes dependencies of theorems and
7858 lemmas, using the graph browser tool;
7860 * Pure: predict failure of "show" in interactive mode;
7862 * Pure: 'thms_containing' now takes actual terms as arguments;
7864 * HOL: improved method 'induct' --- now handles non-atomic goals
7865 (potential INCOMPATIBILITY); tuned error handling;
7867 * HOL: cases and induct rules now provide explicit hints about the
7868 number of facts to be consumed (0 for "type" and 1 for "set" rules);
7869 any remaining facts are inserted into the goal verbatim;
7871 * HOL: local contexts (aka cases) may now contain term bindings as
7872 well; the 'cases' and 'induct' methods new provide a ?case binding for
7873 the result to be shown in each case;
7875 * HOL: added 'recdef_tc' command;
7877 * isatool convert assists in eliminating legacy ML scripts;
7882 * HOL/Library: a collection of generic theories to be used together
7883 with main HOL; the theory loader path already includes this directory
7884 by default; the following existing theories have been moved here:
7885 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
7886 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
7888 * HOL/Unix: "Some aspects of Unix file-system security", a typical
7889 modelling and verification task performed in Isabelle/HOL +
7890 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
7892 * HOL/Algebra: special summation operator SUM no longer exists, it has
7893 been replaced by setsum; infix 'assoc' now has priority 50 (like
7894 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
7895 'domain', this makes the theory consistent with mathematical
7898 * HOL basics: added overloaded operations "inverse" and "divide"
7899 (infix "/"), syntax for generic "abs" operation, generic summation
7902 * HOL/typedef: simplified package, provide more useful rules (see also
7905 * HOL/datatype: induction rule for arbitrarily branching datatypes is
7906 now expressed as a proper nested rule (old-style tactic scripts may
7907 require atomize_strip_tac to cope with non-atomic premises);
7909 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
7910 to "split_conv" (old name still available for compatibility);
7912 * HOL: improved concrete syntax for strings (e.g. allows translation
7913 rules with string literals);
7915 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
7916 and Fleuriot's mechanization of analysis, including the transcendental
7917 functions for the reals;
7919 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
7924 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
7925 "lam" is displayed as TWO lambda-symbols
7927 * CTT: theory Main now available, containing everything (that is, Bool
7933 * Pure: the Simplifier has been implemented properly as a derived rule
7934 outside of the actual kernel (at last!); the overall performance
7935 penalty in practical applications is about 50%, while reliability of
7936 the Isabelle inference kernel has been greatly improved;
7938 * print modes "brackets" and "no_brackets" control output of nested =>
7939 (types) and ==> (props); the default behaviour is "brackets";
7941 * Provers: fast_tac (and friends) now handle actual object-logic rules
7942 as assumptions as well;
7944 * system: support Poly/ML 4.0;
7946 * system: isatool install handles KDE version 1 or 2;
7950 New in Isabelle99-1 (October 2000)
7951 ----------------------------------
7953 *** Overview of INCOMPATIBILITIES ***
7955 * HOL: simplification of natural numbers is much changed; to partly
7956 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
7957 issue the following ML commands:
7959 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
7960 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
7962 * HOL: simplification no longer dives into case-expressions; this is
7963 controlled by "t.weak_case_cong" for each datatype t;
7965 * HOL: nat_less_induct renamed to less_induct;
7967 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
7968 fixsome to patch .thy and .ML sources automatically;
7970 select_equality -> some_equality
7971 select_eq_Ex -> some_eq_ex
7972 selectI2EX -> someI2_ex
7975 select1_equality -> some1_equality
7976 Eps_sym_eq -> some_sym_eq_trivial
7977 Eps_eq -> some_eq_trivial
7979 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
7981 * HOL: removed obsolete theorem binding expand_if (refer to split_if
7984 * HOL: the recursion equations generated by 'recdef' are now called
7985 f.simps instead of f.rules;
7987 * HOL: qed_spec_mp now also handles bounded ALL as well;
7989 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
7990 sometimes be needed;
7992 * HOL: the constant for "f``x" is now "image" rather than "op ``";
7994 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
7996 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
7997 product is now "<*>" instead of "Times"; the lexicographic product is
7998 now "<*lex*>" instead of "**";
8000 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
8001 of main HOL, but was unused); better use HOL's datatype package;
8003 * HOL: removed "symbols" syntax for constant "override" of theory Map;
8004 the old syntax may be recovered as follows:
8007 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
8008 (infixl "\\<oplus>" 100)
8010 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8012 * HOL/ML: even fewer consts are declared as global (see theories Ord,
8013 Lfp, Gfp, WF); this only affects ML packages that refer to const names
8016 * HOL and ZF: syntax for quotienting wrt an equivalence relation
8017 changed from A/r to A//r;
8019 * ZF: new treatment of arithmetic (nat & int) may break some old
8022 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
8023 rulify -> rule_format, elimify -> elim_format, ...);
8025 * Isar/Provers: intro/elim/dest attributes changed; renamed
8026 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
8027 should have to change intro!! to intro? only); replaced "delrule" by
8030 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
8032 * Provers: strengthened force_tac by using new first_best_tac;
8034 * LaTeX document preparation: several changes of isabelle.sty (see
8038 *** Document preparation ***
8040 * formal comments (text blocks etc.) in new-style theories may now
8041 contain antiquotations of thm/prop/term/typ/text to be presented
8042 according to latex print mode; concrete syntax is like this:
8043 @{term[show_types] "f(x) = a + x"};
8045 * isatool mkdir provides easy setup of Isabelle session directories,
8046 including proper document sources;
8048 * generated LaTeX sources are now deleted after successful run
8049 (isatool document -c); may retain a copy somewhere else via -D option
8052 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
8053 style files, achieving self-contained LaTeX sources and simplifying
8056 * old-style theories now produce (crude) LaTeX output as well;
8058 * browser info session directories are now self-contained (may be put
8059 on WWW server seperately); improved graphs of nested sessions; removed
8060 graph for 'all sessions';
8062 * several improvements in isabelle style files; \isabellestyle{it}
8063 produces fake math mode output; \isamarkupheader is now \section by
8064 default; see lib/texinputs/isabelle.sty etc.;
8069 * Isar/Pure: local results and corresponding term bindings are now
8070 subject to Hindley-Milner polymorphism (similar to ML); this
8071 accommodates incremental type-inference very nicely;
8073 * Isar/Pure: new derived language element 'obtain' supports
8074 generalized existence reasoning;
8076 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
8077 support accumulation of results, without applying any rules yet;
8078 useful to collect intermediate results without explicit name
8079 references, and for use with transitivity rules with more than 2
8082 * Isar/Pure: scalable support for case-analysis type proofs: new
8083 'case' language element refers to local contexts symbolically, as
8084 produced by certain proof methods; internally, case names are attached
8085 to theorems as "tags";
8087 * Isar/Pure: theory command 'hide' removes declarations from
8088 class/type/const name spaces;
8090 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
8091 indicate potential overloading;
8093 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
8095 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
8096 "{a,b,c}" instead of {a,b,c};
8098 * Isar/Pure now provides its own version of intro/elim/dest
8099 attributes; useful for building new logics, but beware of confusion
8100 with the version in Provers/classical;
8102 * Isar/Pure: the local context of (non-atomic) goals is provided via
8103 case name 'antecedent';
8105 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
8106 to the current context is now done automatically);
8108 * Isar/Pure: theory command 'method_setup' provides a simple interface
8109 for definining proof methods in ML;
8111 * Isar/Provers: intro/elim/dest attributes changed; renamed
8112 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
8113 most cases, one should have to change intro!! to intro? only);
8114 replaced "delrule" by "rule del";
8116 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
8117 'symmetric' attribute (the latter supercedes [RS sym]);
8119 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
8120 method modifier); 'simp' method: 'only:' modifier removes loopers as
8121 well (including splits);
8123 * Isar/Provers: Simplifier and Classical methods now support all kind
8124 of modifiers used in the past, including 'cong', 'iff', etc.
8126 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
8127 of Simplifier and Classical reasoner);
8129 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
8130 now support named cases; major packages (inductive, datatype, primrec,
8131 recdef) support case names and properly name parameters;
8133 * Isar/HOL: new transitivity rules for substitution in inequalities --
8134 monotonicity conditions are extracted to be proven at end of
8137 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
8140 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
8141 split_if split_if_asm; datatype package provides theorems foo.splits =
8142 foo.split foo.split_asm for each datatype;
8144 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
8145 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
8146 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
8147 use "(cases (simplified))" method in proper proof texts);
8149 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
8151 * Isar: names of theorems etc. may be natural numbers as well;
8153 * Isar: 'pr' command: optional arguments for goals_limit and
8154 ProofContext.prems_limit; no longer prints theory contexts, but only
8157 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
8158 additional print modes to be specified; e.g. "pr(latex)" will print
8159 proof state according to the Isabelle LaTeX style;
8161 * Isar: improved support for emulating tactic scripts, including proof
8162 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
8163 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
8164 (for HOL datatypes);
8166 * Isar: simplified (more robust) goal selection of proof methods: 1st
8167 goal, all goals, or explicit goal specifier (tactic emulation); thus
8168 'proof method scripts' have to be in depth-first order;
8170 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
8172 * Isar: removed 'help' command, which hasn't been too helpful anyway;
8173 should instead use individual commands for printing items
8174 (print_commands, print_methods etc.);
8176 * Isar: added 'nothing' --- the empty list of theorems;
8181 * HOL/MicroJava: formalization of a fragment of Java, together with a
8182 corresponding virtual machine and a specification of its bytecode
8183 verifier and a lightweight bytecode verifier, including proofs of
8184 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
8185 Cornelia Pusch (see also the homepage of project Bali at
8186 http://isabelle.in.tum.de/Bali/);
8188 * HOL/Algebra: new theory of rings and univariate polynomials, by
8191 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
8192 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
8195 * HOL/Lattice: fundamental concepts of lattice theory and order
8196 structures, including duals, properties of bounds versus algebraic
8197 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
8198 Theorem for complete lattices etc.; may also serve as a demonstration
8199 for abstract algebraic reasoning using axiomatic type classes, and
8200 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
8202 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
8205 * HOL/IMPP: extension of IMP with local variables and mutually
8206 recursive procedures, by David von Oheimb;
8208 * HOL/Lambda: converted into new-style theory and document;
8210 * HOL/ex/Multiquote: example of multiple nested quotations and
8211 anti-quotations -- basically a generalized version of de-Bruijn
8212 representation; very useful in avoiding lifting of operations;
8214 * HOL/record: added general record equality rule to simpset; fixed
8215 select-update simplification procedure to handle extended records as
8216 well; admit "r" as field name;
8218 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
8219 other numeric types and also as the identity of groups, rings, etc.;
8221 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
8222 Types nat and int belong to this axclass;
8224 * HOL: greatly improved simplification involving numerals of type nat, int, real:
8225 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
8226 i*j + k + j*#3*i simplifies to #4*(i*j) + k
8227 two terms #m*u and #n*u are replaced by #(m+n)*u
8228 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
8229 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
8230 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
8232 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
8233 powerful prover for predicate logic but knows nothing of clasets; see
8234 ex/mesontest.ML and ex/mesontest2.ML for example applications;
8236 * HOL: new version of "case_tac" subsumes both boolean case split and
8237 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
8238 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
8240 * HOL: simplification no longer dives into case-expressions: only the
8241 selector expression is simplified, but not the remaining arms; to
8242 enable full simplification of case-expressions for datatype t, you may
8243 remove t.weak_case_cong from the simpset, either globally (Delcongs
8244 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
8246 * HOL/recdef: the recursion equations generated by 'recdef' for
8247 function 'f' are now called f.simps instead of f.rules; if all
8248 termination conditions are proved automatically, these simplification
8249 rules are added to the simpset, as in primrec; rules may be named
8250 individually as well, resulting in a separate list of theorems for
8253 * HOL/While is a new theory that provides a while-combinator. It
8254 permits the definition of tail-recursive functions without the
8255 provision of a termination measure. The latter is necessary once the
8256 invariant proof rule for while is applied.
8258 * HOL: new (overloaded) notation for the set of elements below/above
8259 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
8261 * HOL: theorems impI, allI, ballI bound as "strip";
8263 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
8264 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
8265 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
8267 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8269 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
8270 main HOL, but was unused);
8272 * HOL: fewer consts declared as global (e.g. have to refer to
8273 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
8275 * HOL: tuned AST representation of nested pairs, avoiding bogus output
8276 in case of overlap with user translations (e.g. judgements over
8277 tuples); (note that the underlying logical represenation is still
8283 * ZF: simplification automatically cancels common terms in arithmetic
8284 expressions over nat and int;
8286 * ZF: new treatment of nat to minimize type-checking: all operators
8287 coerce their operands to a natural number using the function natify,
8288 making the algebraic laws unconditional;
8290 * ZF: as above, for int: operators coerce their operands to an integer
8291 using the function intify;
8293 * ZF: the integer library now contains many of the usual laws for the
8294 orderings, including $<=, and monotonicity laws for $+ and $*;
8296 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
8299 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
8300 to the simplifier and classical reasoner simultaneously;
8305 * Provers: blast_tac now handles actual object-logic rules as
8306 assumptions; note that auto_tac uses blast_tac internally as well;
8308 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
8309 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
8311 * Provers: delrules now handles destruct rules as well (no longer need
8312 explicit make_elim);
8314 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
8315 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8316 use instead the strong form,
8317 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8318 in HOL, FOL and ZF the function cla_make_elim will create such rules
8319 from destruct-rules;
8321 * Provers: Simplifier.easy_setup provides a fast path to basic
8322 Simplifier setup for new object-logics;
8324 * Pure: AST translation rules no longer require constant head on LHS;
8326 * Pure: improved name spaces: ambiguous output is qualified; support
8327 for hiding of names;
8329 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
8330 XSYMBOL_HOME; no longer need to do manual configuration in most
8333 * system: compression of ML heaps images may now be controlled via -c
8334 option of isabelle and isatool usedir (currently only observed by
8337 * system: isatool installfonts may handle X-Symbol fonts as well (very
8338 useful for remote X11);
8340 * system: provide TAGS file for Isabelle sources;
8342 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
8345 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
8346 timing flag supersedes proof_timing and Toplevel.trace;
8348 * ML: new combinators |>> and |>>> for incremental transformations
8349 with secondary results (e.g. certain theory extensions):
8351 * ML: PureThy.add_defs gets additional argument to indicate potential
8352 overloading (usually false);
8354 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
8359 New in Isabelle99 (October 1999)
8360 --------------------------------
8362 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8364 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
8365 are no longer simplified. (This allows the simplifier to unfold recursive
8366 functional programs.) To restore the old behaviour, declare
8368 Delcongs [if_weak_cong];
8370 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
8373 * HOL: the predicate "inj" is now defined by translation to "inj_on";
8375 * HOL/datatype: mutual_induct_tac no longer exists --
8376 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
8378 * HOL/typedef: fixed type inference for representing set; type
8379 arguments now have to occur explicitly on the rhs as type constraints;
8381 * ZF: The con_defs part of an inductive definition may no longer refer
8382 to constants declared in the same theory;
8384 * HOL, ZF: the function mk_cases, generated by the inductive
8385 definition package, has lost an argument. To simplify its result, it
8386 uses the default simpset instead of a supplied list of theorems.
8388 * HOL/List: the constructors of type list are now Nil and Cons;
8390 * Simplifier: the type of the infix ML functions
8391 setSSolver addSSolver setSolver addSolver
8392 is now simpset * solver -> simpset where `solver' is a new abstract type
8393 for packaging solvers. A solver is created via
8394 mk_solver: string -> (thm list -> int -> tactic) -> solver
8395 where the string argument is only a comment.
8400 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
8401 decision procedure for linear arithmetic. Currently it is used for
8402 types `nat', `int', and `real' in HOL (see below); it can, should and
8403 will be instantiated for other types and logics as well.
8405 * The simplifier now accepts rewrite rules with flexible heads, eg
8406 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
8407 They are applied like any rule with a non-pattern lhs, i.e. by first-order
8413 * New Isabelle/Isar subsystem provides an alternative to traditional
8414 tactical theorem proving; together with the ProofGeneral/isar user
8415 interface it offers an interactive environment for developing human
8416 readable proof documents (Isar == Intelligible semi-automated
8417 reasoning); for further information see isatool doc isar-ref,
8418 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
8420 * improved and simplified presentation of theories: better HTML markup
8421 (including colors), graph views in several sizes; isatool usedir now
8422 provides a proper interface for user theories (via -P option); actual
8423 document preparation based on (PDF)LaTeX is available as well (for
8424 new-style theories only); see isatool doc system for more information;
8426 * native support for Proof General, both for classic Isabelle and
8429 * ML function thm_deps visualizes dependencies of theorems and lemmas,
8430 using the graph browser tool;
8432 * Isabelle manuals now also available as PDF;
8434 * theory loader rewritten from scratch (may not be fully
8435 bug-compatible); old loadpath variable has been replaced by show_path,
8436 add_path, del_path, reset_path functions; new operations such as
8437 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
8440 * improved isatool install: option -k creates KDE application icon,
8441 option -p DIR installs standalone binaries;
8443 * added ML_PLATFORM setting (useful for cross-platform installations);
8444 more robust handling of platform specific ML images for SML/NJ;
8446 * the settings environment is now statically scoped, i.e. it is never
8447 created again in sub-processes invoked from isabelle, isatool, or
8450 * path element specification '~~' refers to '$ISABELLE_HOME';
8452 * in locales, the "assumes" and "defines" parts may be omitted if
8455 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
8458 * new print_mode "HTML";
8460 * new flag show_tags controls display of tags of theorems (which are
8461 basically just comments that may be attached by some tools);
8463 * Isamode 2.6 requires patch to accomodate change of Isabelle font
8464 mode and goal output format:
8466 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
8468 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
8470 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
8471 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
8473 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
8475 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
8477 * function bind_thms stores lists of theorems (cf. bind_thm);
8479 * new shorthand tactics ftac, eatac, datac, fatac;
8481 * qed (and friends) now accept "" as result name; in that case the
8482 theorem is not stored, but proper checks and presentation of the
8485 * theorem database now also indexes constants "Trueprop", "all",
8486 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
8491 ** HOL arithmetic **
8493 * There are now decision procedures for linear arithmetic over nat and
8496 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
8497 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
8498 are treated as atomic; subformulae not involving type `nat' or `int'
8499 are ignored; quantified subformulae are ignored unless they are
8500 positive universal or negative existential. The tactic has to be
8501 invoked by hand and can be a little bit slow. In particular, the
8502 running time is exponential in the number of occurrences of `min' and
8503 `max', and `-' on `nat'.
8505 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
8506 (negated) (in)equalities among the premises and the conclusion into
8507 account (i.e. no compound formulae) and does not know about `min' and
8508 `max', and `-' on `nat'. It is fast and is used automatically by the
8511 NB: At the moment, these decision procedures do not cope with mixed
8512 nat/int formulae where the two parts interact, such as `m < n ==>
8515 * HOL/Numeral provides a generic theory of numerals (encoded
8516 efficiently as bit strings); setup for types nat/int/real is in place;
8517 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
8518 int, existing theories and proof scripts may require a few additional
8521 * integer division and remainder can now be performed on constant
8524 * many properties of integer multiplication, division and remainder
8527 * An interface to the Stanford Validity Checker (SVC) is available through the
8528 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
8529 are proved automatically. SVC must be installed separately, and its results
8530 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
8531 invocation of the underlying oracle). For SVC see
8532 http://verify.stanford.edu/SVC
8534 * IsaMakefile: the HOL-Real target now builds an actual image;
8539 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
8540 (in Isabelle/Isar) -- by Gertrud Bauer;
8542 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
8543 analysis for assembly languages with subtypes;
8545 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
8546 -- avoids syntactic ambiguities and treats state, transition, and
8547 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
8548 changed syntax and (many) tactics;
8550 * HOL/inductive: Now also handles more general introduction rules such
8551 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
8552 theorems are now maintained within the theory (maintained via the
8555 * HOL/datatype: Now also handles arbitrarily branching datatypes
8556 (using function types) such as
8558 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
8560 * HOL/record: record_simproc (part of the default simpset) takes care
8561 of selectors applied to updated records; record_split_tac is no longer
8562 part of the default claset; update_defs may now be removed from the
8563 simpset in many cases; COMPATIBILITY: old behavior achieved by
8565 claset_ref () := claset() addSWrapper record_split_wrapper;
8566 Delsimprocs [record_simproc]
8568 * HOL/typedef: fixed type inference for representing set; type
8569 arguments now have to occur explicitly on the rhs as type constraints;
8571 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
8572 names rather than an ML expression;
8574 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
8575 supplied later. Program schemes can be defined, such as
8576 "While B C s = (if B s then While B C (C s) else s)"
8577 where the well-founded relation can be chosen after B and C have been given.
8579 * HOL/List: the constructors of type list are now Nil and Cons;
8580 INCOMPATIBILITY: while [] and infix # syntax is still there, of
8581 course, ML tools referring to List.list.op # etc. have to be adapted;
8583 * HOL_quantifiers flag superseded by "HOL" print mode, which is
8584 disabled by default; run isabelle with option -m HOL to get back to
8585 the original Gordon/HOL-style output;
8587 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
8588 ALL x<=y. P, EX x<y. P, EX x<=y. P;
8590 * HOL basic syntax simplified (more orthogonal): all variants of
8591 All/Ex now support plain / symbolic / HOL notation; plain syntax for
8592 Eps operator is provided as well: "SOME x. P[x]";
8594 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
8596 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
8597 thus available for user theories;
8599 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
8600 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
8603 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
8604 several times and then mp;
8609 * the notation <<...>> is now available as a notation for sequences of
8612 * the simplifier is now installed
8614 * the axiom system has been generalized (thanks to Soren Heilmann)
8616 * the classical reasoner now has a default rule database
8621 * new primrec section allows primitive recursive functions to be given
8622 directly (as in HOL) over datatypes and the natural numbers;
8624 * new tactics induct_tac and exhaust_tac for induction (or case
8625 analysis) over datatypes and the natural numbers;
8627 * the datatype declaration of type T now defines the recursor T_rec;
8629 * simplification automatically does freeness reasoning for datatype
8632 * automatic type-inference, with AddTCs command to insert new
8633 type-checking rules;
8635 * datatype introduction rules are now added as Safe Introduction rules
8638 * the syntax "if P then x else y" is now available in addition to
8642 *** Internal programming interfaces ***
8644 * tuned simplifier trace output; new flag debug_simp;
8646 * structures Vartab / Termtab (instances of TableFun) offer efficient
8647 tables indexed by indexname_ord / term_ord (compatible with aconv);
8649 * AxClass.axclass_tac lost the theory argument;
8651 * tuned current_goals_markers semantics: begin / end goal avoids
8652 printing empty lines;
8654 * removed prs and prs_fn hook, which was broken because it did not
8655 include \n in its semantics, forcing writeln to add one
8656 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
8657 string -> unit if you really want to output text without newline;
8659 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
8660 plain output, interface builders may have to enable 'isabelle_font'
8661 mode to get Isabelle font glyphs as before;
8663 * refined token_translation interface; INCOMPATIBILITY: output length
8664 now of type real instead of int;
8666 * theory loader actions may be traced via new ThyInfo.add_hook
8667 interface (see src/Pure/Thy/thy_info.ML); example application: keep
8668 your own database of information attached to *whole* theories -- as
8669 opposed to intra-theory data slots offered via TheoryDataFun;
8671 * proper handling of dangling sort hypotheses (at last!);
8672 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
8673 extra sort hypotheses that can be witnessed from the type signature;
8674 the force_strip_shyps flag is gone, any remaining shyps are simply
8675 left in the theorem (with a warning issued by strip_shyps_warning);
8679 New in Isabelle98-1 (October 1998)
8680 ----------------------------------
8682 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8684 * several changes of automated proof tools;
8686 * HOL: major changes to the inductive and datatype packages, including
8687 some minor incompatibilities of theory syntax;
8689 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
8692 * HOL: removed duplicate thms in Arith:
8693 less_imp_add_less should be replaced by trans_less_add1
8694 le_imp_add_le should be replaced by trans_le_add1
8696 * HOL: unary minus is now overloaded (new type constraints may be
8699 * HOL and ZF: unary minus for integers is now #- instead of #~. In
8700 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
8701 now taken as an integer constant.
8703 * Pure: ML function 'theory_of' renamed to 'theory';
8709 1. Asm_full_simp_tac is now more aggressive.
8710 1. It will sometimes reorient premises if that increases their power to
8712 2. It does no longer proceed strictly from left to right but may also
8713 rotate premises to achieve further simplification.
8714 For compatibility reasons there is now Asm_lr_simp_tac which is like the
8715 old Asm_full_simp_tac in that it does not rotate premises.
8716 2. The simplifier now knows a little bit about nat-arithmetic.
8718 * Classical reasoner: wrapper mechanism for the classical reasoner now
8719 allows for selected deletion of wrappers, by introduction of names for
8720 wrapper functionals. This implies that addbefore, addSbefore,
8721 addaltern, and addSaltern now take a pair (name, tactic) as argument,
8722 and that adding two tactics with the same name overwrites the first
8723 one (emitting a warning).
8724 type wrapper = (int -> tactic) -> (int -> tactic)
8725 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
8726 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
8727 delWrapper, delSWrapper: claset * string -> claset
8728 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
8730 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
8731 semantics; addbefore now affects only the unsafe part of step_tac
8732 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
8733 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
8736 * Classical reasoner: setwrapper to setWrapper and compwrapper to
8737 compWrapper; added safe wrapper (and access functions for it);
8739 * HOL/split_all_tac is now much faster and fails if there is nothing
8740 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
8741 and the names of the automatically generated variables have changed.
8742 split_all_tac has moved within claset() from unsafe wrappers to safe
8743 wrappers, which means that !!-bound variables are split much more
8744 aggressively, and safe_tac and clarify_tac now split such variables.
8745 If this splitting is not appropriate, use delSWrapper "split_all_tac".
8746 Note: the same holds for record_split_tac, which does the job of
8747 split_all_tac for record fields.
8749 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
8750 permanently to the default simpset using Addsplits just like
8751 Addsimps. They can be removed via Delsplits just like
8752 Delsimps. Lower-case versions are also available.
8754 * HOL/Simplifier: The rule split_if is now part of the default
8755 simpset. This means that the simplifier will eliminate all occurrences
8756 of if-then-else in the conclusion of a goal. To prevent this, you can
8757 either remove split_if completely from the default simpset by
8758 `Delsplits [split_if]' or remove it in a specific call of the
8759 simplifier using `... delsplits [split_if]'. You can also add/delete
8760 other case splitting rules to/from the default simpset: every datatype
8761 generates suitable rules `split_t_case' and `split_t_case_asm' (where
8762 t is the name of the datatype).
8764 * Classical reasoner / Simplifier combination: new force_tac (and
8765 derivatives Force_tac, force) combines rewriting and classical
8766 reasoning (and whatever other tools) similarly to auto_tac, but is
8767 aimed to solve the given subgoal completely.
8772 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
8773 and `goalw': the theory is no longer needed as an explicit argument -
8774 the current theory context is used; assumptions are no longer returned
8775 at the ML-level unless one of them starts with ==> or !!; it is
8776 recommended to convert to these new commands using isatool fixgoal
8777 (backup your sources first!);
8779 * new top-level commands 'thm' and 'thms' for retrieving theorems from
8780 the current theory context, and 'theory' to lookup stored theories;
8782 * new theory section 'locale' for declaring constants, assumptions and
8783 definitions that have local scope;
8785 * new theory section 'nonterminals' for purely syntactic types;
8787 * new theory section 'setup' for generic ML setup functions
8788 (e.g. package initialization);
8790 * the distribution now includes Isabelle icons: see
8791 lib/logo/isabelle-{small,tiny}.xpm;
8793 * isatool install - install binaries with absolute references to
8796 * isatool logo -- create instances of the Isabelle logo (as EPS);
8798 * print mode 'emacs' reserved for Isamode;
8800 * support multiple print (ast) translations per constant name;
8802 * theorems involving oracles are now printed with a suffixed [!];
8807 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
8809 * HOL/inductive package reorganized and improved: now supports mutual
8815 oddI "n : EVEN ==> Suc n : ODD"
8816 evenI "n : ODD ==> Suc n : EVEN"
8818 new theorem list "elims" contains an elimination rule for each of the
8819 recursive sets; inductive definitions now handle disjunctive premises
8820 correctly (also ZF);
8822 INCOMPATIBILITIES: requires Inductive as an ancestor; component
8823 "mutual_induct" no longer exists - the induction rule is always
8824 contained in "induct";
8827 * HOL/datatype package re-implemented and greatly improved: now
8828 supports mutually recursive datatypes such as
8831 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
8832 | SUM ('a aexp) ('a aexp)
8833 | DIFF ('a aexp) ('a aexp)
8836 'a bexp = LESS ('a aexp) ('a aexp)
8837 | AND ('a bexp) ('a bexp)
8838 | OR ('a bexp) ('a bexp)
8840 as well as indirectly recursive datatypes such as
8843 ('a, 'b) term = Var 'a
8844 | App 'b ((('a, 'b) term) list)
8846 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
8847 induction on mutually / indirectly recursive datatypes.
8849 Primrec equations are now stored in theory and can be accessed via
8850 <function_name>.simps.
8854 - Theories using datatypes must now have theory Datatype as an
8856 - The specific <typename>.induct_tac no longer exists - use the
8857 generic induct_tac instead.
8858 - natE has been renamed to nat.exhaust - use exhaust_tac
8859 instead of res_inst_tac ... natE. Note that the variable
8860 names in nat.exhaust differ from the names in natE, this
8861 may cause some "fragile" proofs to fail.
8862 - The theorems split_<typename>_case and split_<typename>_case_asm
8863 have been renamed to <typename>.split and <typename>.split_asm.
8864 - Since default sorts of type variables are now handled correctly,
8865 some datatype definitions may have to be annotated with explicit
8867 - Primrec definitions no longer require function name and type
8868 of recursive argument.
8870 Consider using isatool fixdatatype to adapt your theories and proof
8871 scripts to the new package (backup your sources first!).
8874 * HOL/record package: considerably improved implementation; now
8875 includes concrete syntax for record types, terms, updates; theorems
8876 for surjective pairing and splitting !!-bound record variables; proof
8877 support is as follows:
8879 1) standard conversions (selectors or updates applied to record
8880 constructor terms) are part of the standard simpset;
8882 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
8883 made part of standard simpset and claset via addIffs;
8885 3) a tactic for record field splitting (record_split_tac) is part of
8886 the standard claset (addSWrapper);
8888 To get a better idea about these rules you may retrieve them via
8889 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
8890 the name of your record type.
8892 The split tactic 3) conceptually simplifies by the following rule:
8894 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
8896 Thus any record variable that is bound by meta-all will automatically
8897 blow up into some record constructor term, consequently the
8898 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
8899 solve record problems automatically.
8902 * reorganized the main HOL image: HOL/Integ and String loaded by
8903 default; theory Main includes everything;
8905 * automatic simplification of integer sums and comparisons, using cancellation;
8907 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
8909 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
8911 * many new identities for unions, intersections, set difference, etc.;
8913 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
8914 called split_if, split_split, split_sum_case and split_nat_case (to go
8915 with add/delsplits);
8917 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
8918 (?x::unit) = (); this is made part of the default simpset, which COULD
8919 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
8920 'Delsimprocs [unit_eq_proc];' as last resort); also note that
8921 unit_abs_eta_conv is added in order to counter the effect of
8922 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
8925 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
8928 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
8929 It and 'sym RS equals0D' are now in the default claset, giving automatic
8930 disjointness reasoning but breaking a few old proofs.
8932 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
8933 to 'converse' from 'inverse' (for compatibility with ZF and some
8936 * HOL/recdef can now declare non-recursive functions, with {} supplied as
8937 the well-founded relation;
8939 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
8940 Compl A. The "Compl" syntax remains available as input syntax for this
8943 * HOL/Update: new theory of function updates:
8944 f(a:=b) == %x. if x=a then b else f x
8945 may also be iterated as in f(a:=b,c:=d,...);
8947 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
8950 - new function list_update written xs[i:=v] that updates the i-th
8951 list position. May also be iterated as in xs[i:=a,j:=b,...].
8952 - new function `upt' written [i..j(] which generates the list
8953 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
8954 bound write [i..j], which is a shorthand for [i..j+1(].
8955 - new lexicographic orderings and corresponding wellfoundedness theorems.
8958 - removed 'pred' (predecessor) function;
8959 - generalized some theorems about n-1;
8960 - many new laws about "div" and "mod";
8961 - new laws about greatest common divisors (see theory ex/Primes);
8963 * HOL/Relation: renamed the relational operator r^-1 "converse"
8964 instead of "inverse";
8966 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
8967 of the multiset ordering;
8969 * directory HOL/Real: a construction of the reals using Dedekind cuts
8970 (not included by default);
8972 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
8974 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
8975 programs, i.e. different program variables may have different types.
8977 * calling (stac rew i) now fails if "rew" has no effect on the goal
8978 [previously, this check worked only if the rewrite rule was unconditional]
8979 Now rew can involve either definitions or equalities (either == or =).
8984 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
8985 only the theorems proved on ZF.ML;
8987 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
8988 It and 'sym RS equals0D' are now in the default claset, giving automatic
8989 disjointness reasoning but breaking a few old proofs.
8991 * ZF/Update: new theory of function updates
8992 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
8993 may also be iterated as in f(a:=b,c:=d,...);
8995 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
8997 * calling (stac rew i) now fails if "rew" has no effect on the goal
8998 [previously, this check worked only if the rewrite rule was unconditional]
8999 Now rew can involve either definitions or equalities (either == or =).
9001 * case_tac provided for compatibility with HOL
9002 (like the old excluded_middle_tac, but with subgoals swapped)
9005 *** Internal programming interfaces ***
9007 * Pure: several new basic modules made available for general use, see
9008 also src/Pure/README;
9010 * improved the theory data mechanism to support encapsulation (data
9011 kind name replaced by private Object.kind, acting as authorization
9012 key); new type-safe user interface via functor TheoryDataFun; generic
9013 print_data function becomes basically useless;
9015 * removed global_names compatibility flag -- all theory declarations
9016 are qualified by default;
9018 * module Pure/Syntax now offers quote / antiquote translation
9019 functions (useful for Hoare logic etc. with implicit dependencies);
9020 see HOL/ex/Antiquote for an example use;
9022 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
9025 * new tactical CHANGED_GOAL for checking that a tactic modifies a
9028 * Display.print_goals function moved to Locale.print_goals;
9030 * standard print function for goals supports current_goals_markers
9031 variable for marking begin of proof, end of proof, start of goal; the
9032 default is ("", "", ""); setting current_goals_markers := ("<proof>",
9033 "</proof>", "<goal>") causes SGML like tagged proof state printing,
9038 New in Isabelle98 (January 1998)
9039 --------------------------------
9041 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9043 * changed lexical syntax of terms / types: dots made part of long
9044 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
9046 * simpset (and claset) reference variable replaced by functions
9047 simpset / simpset_ref;
9049 * no longer supports theory aliases (via merge) and non-trivial
9050 implicit merge of thms' signatures;
9052 * most internal names of constants changed due to qualified names;
9054 * changed Pure/Sequence interface (see Pure/seq.ML);
9057 *** General Changes ***
9059 * hierachically structured name spaces (for consts, types, axms, thms
9060 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
9061 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
9062 isatool fixdots ensures space after dots (e.g. "%x. x"); set
9063 long_names for fully qualified output names; NOTE: ML programs
9064 (special tactics, packages etc.) referring to internal names may have
9065 to be adapted to cope with fully qualified names; in case of severe
9066 backward campatibility problems try setting 'global_names' at compile
9067 time to have enrything declared within a flat name space; one may also
9068 fine tune name declarations in theories via the 'global' and 'local'
9071 * reimplemented the implicit simpset and claset using the new anytype
9072 data filed in signatures; references simpset:simpset ref etc. are
9073 replaced by functions simpset:unit->simpset and
9074 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
9075 to patch your ML files accordingly;
9077 * HTML output now includes theory graph data for display with Java
9078 applet or isatool browser; data generated automatically via isatool
9079 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
9081 * defs may now be conditional; improved rewrite_goals_tac to handle
9082 conditional equations;
9084 * defs now admits additional type arguments, using TYPE('a) syntax;
9086 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
9087 creates a new theory node; implicit merge of thms' signatures is
9088 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
9089 transfer:theory->thm->thm in (rare) cases;
9091 * improved handling of draft signatures / theories; draft thms (and
9092 ctyps, cterms) are automatically promoted to real ones;
9094 * slightly changed interfaces for oracles: admit many per theory, named
9095 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
9097 * print_goals: optional output of const types (set show_consts and
9100 * improved output of warnings (###) and errors (***);
9102 * subgoal_tac displays a warning if the new subgoal has type variables;
9104 * removed old README and Makefiles;
9106 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
9108 * removed obsolete init_pps and init_database;
9110 * deleted the obsolete tactical STATE, which was declared by
9111 fun STATE tacfun st = tacfun st st;
9113 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
9114 (which abbreviates $HOME);
9116 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
9117 use isatool fixseq to adapt your ML programs (this works for fully
9118 qualified references to the Sequence structure only!);
9120 * use_thy no longer requires writable current directory; it always
9121 reloads .ML *and* .thy file, if either one is out of date;
9124 *** Classical Reasoner ***
9126 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
9127 tactics that use classical reasoning to simplify a subgoal without
9128 splitting it into several subgoals;
9130 * Safe_tac: like safe_tac but uses the default claset;
9135 * added simplification meta rules:
9136 (asm_)(full_)simplify: simpset -> thm -> thm;
9138 * simplifier.ML no longer part of Pure -- has to be loaded by object
9141 * added prems argument to simplification procedures;
9143 * HOL, FOL, ZF: added infix function `addsplits':
9144 instead of `<simpset> setloop (split_tac <thms>)'
9145 you can simply write `<simpset> addsplits <thms>'
9150 * TYPE('a) syntax for type reflection terms;
9152 * no longer handles consts with name "" -- declare as 'syntax' instead;
9154 * pretty printer: changed order of mixfix annotation preference (again!);
9156 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
9161 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
9162 with `addloop' of the simplifier to faciliate case splitting in premises.
9164 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
9166 * HOL/Auth: new protocol proofs including some for the Internet
9169 * HOL/Map: new theory of `maps' a la VDM;
9171 * HOL/simplifier: simplification procedures nat_cancel_sums for
9172 cancelling out common nat summands from =, <, <= (in)equalities, or
9173 differences; simplification procedures nat_cancel_factor for
9174 cancelling common factor from =, <, <= (in)equalities over natural
9175 sums; nat_cancel contains both kinds of procedures, it is installed by
9176 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
9178 * HOL/simplifier: terms of the form
9179 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
9181 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
9182 and those of the form
9183 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
9185 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
9188 Each datatype `t' now comes with a theorem `split_t_case' of the form
9190 P(t_case f1 ... fn x) =
9191 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
9193 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
9196 and a theorem `split_t_case_asm' of the form
9198 P(t_case f1 ... fn x) =
9199 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
9201 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
9203 which can be added to a simpset via `addsplits'. The existing theorems
9204 expand_list_case and expand_option_case have been renamed to
9205 split_list_case and split_option_case.
9208 - `pred n' is automatically converted to `n-1'.
9209 Users are strongly encouraged not to use `pred' any longer,
9210 because it will disappear altogether at some point.
9211 - Users are strongly encouraged to write "0 < n" rather than
9212 "n ~= 0". Theorems and proof tools have been modified towards this
9216 the function "set_of_list" has been renamed "set" (and its theorems too);
9217 the function "nth" now takes its arguments in the reverse order and
9218 has acquired the infix notation "!" as in "xs!n".
9220 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
9222 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
9223 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
9225 * HOL/record: extensible records with schematic structural subtyping
9226 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
9227 still lacks various theorems and concrete record syntax;
9232 * removed "axioms" and "generated by" sections;
9234 * replaced "ops" section by extended "consts" section, which is capable of
9235 handling the continuous function space "->" directly;
9238 . proves theorems immediately and stores them in the theory,
9239 . creates hierachical name space,
9240 . now uses normal mixfix annotations (instead of cinfix...),
9241 . minor changes to some names and values (for consistency),
9242 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
9243 . separator between mutual domain defs: changed "," to "and",
9244 . improved handling of sort constraints; now they have to
9245 appear on the left-hand side of the equations only;
9247 * fixed LAM <x,y,zs>.b syntax;
9249 * added extended adm_tac to simplifier in HOLCF -- can now discharge
9250 adm (%x. P (t x)), where P is chainfinite and t continuous;
9255 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
9256 with `addloop' of the simplifier to faciliate case splitting in premises.
9258 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
9259 in HOL, they strip ALL and --> from proved theorems;
9263 New in Isabelle94-8 (May 1997)
9264 ------------------------------
9266 *** General Changes ***
9268 * new utilities to build / run / maintain Isabelle etc. (in parts
9269 still somewhat experimental); old Makefiles etc. still functional;
9271 * new 'Isabelle System Manual';
9273 * INSTALL text, together with ./configure and ./build scripts;
9275 * reimplemented type inference for greater efficiency, better error
9276 messages and clean internal interface;
9278 * prlim command for dealing with lots of subgoals (an easier way of
9279 setting goals_limit);
9284 * supports alternative (named) syntax tables (parser and pretty
9285 printer); internal interface is provided by add_modesyntax(_i);
9287 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
9288 be used in conjunction with the Isabelle symbol font; uses the
9289 "symbols" syntax table;
9291 * added token_translation interface (may translate name tokens in
9292 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
9293 the current print_mode); IMPORTANT: user print translation functions
9294 are responsible for marking newly introduced bounds
9295 (Syntax.mark_boundT);
9297 * token translations for modes "xterm" and "xterm_color" that display
9298 names in bold, underline etc. or colors (which requires a color
9301 * infixes may now be declared with names independent of their syntax;
9303 * added typed_print_translation (like print_translation, but may
9304 access type of constant);
9307 *** Classical Reasoner ***
9309 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
9310 some limitations. Blast_tac...
9311 + ignores addss, addbefore, addafter; this restriction is intrinsic
9312 + ignores elimination rules that don't have the correct format
9313 (the conclusion MUST be a formula variable)
9314 + ignores types, which can make HOL proofs fail
9315 + rules must not require higher-order unification, e.g. apply_type in ZF
9316 [message "Function Var's argument not a bound variable" relates to this]
9317 + its proof strategy is more general but can actually be slower
9319 * substitution with equality assumptions no longer permutes other
9322 * minor changes in semantics of addafter (now called addaltern); renamed
9323 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
9324 (and access functions for it);
9326 * improved combination of classical reasoner and simplifier:
9327 + functions for handling clasimpsets
9328 + improvement of addss: now the simplifier is called _after_ the
9330 + safe variant of addss called addSss: uses safe simplifications
9331 _during_ the safe steps. It is more complete as it allows multiple
9332 instantiations of unknowns (e.g. with slow_tac).
9336 * added interface for simplification procedures (functions that
9337 produce *proven* rewrite rules on the fly, depending on current
9340 * ordering on terms as parameter (used for ordered rewriting);
9342 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
9344 * the solver is now split into a safe and an unsafe part.
9345 This should be invisible for the normal user, except that the
9346 functions setsolver and addsolver have been renamed to setSolver and
9347 addSolver; added safe_asm_full_simp_tac;
9352 * a generic induction tactic `induct_tac' which works for all datatypes and
9353 also for type `nat';
9355 * a generic case distinction tactic `exhaust_tac' which works for all
9356 datatypes and also for type `nat';
9358 * each datatype comes with a function `size';
9360 * patterns in case expressions allow tuple patterns as arguments to
9361 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
9363 * primrec now also works with type nat;
9365 * recdef: a new declaration form, allows general recursive functions to be
9366 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
9368 * the constant for negation has been renamed from "not" to "Not" to
9369 harmonize with FOL, ZF, LK, etc.;
9371 * HOL/ex/LFilter theory of a corecursive "filter" functional for
9374 * HOL/Modelcheck demonstrates invocation of model checker oracle;
9376 * HOL/ex/Ring.thy declares cring_simp, which solves equational
9377 problems in commutative rings, using axiomatic type classes for + and *;
9379 * more examples in HOL/MiniML and HOL/Auth;
9381 * more default rewrite rules for quantifiers, union/intersection;
9383 * a new constant `arbitrary == @x.False';
9385 * HOLCF/IOA replaces old HOL/IOA;
9387 * HOLCF changes: derived all rules and arities
9388 + axiomatic type classes instead of classes
9389 + typedef instead of faking type definitions
9390 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
9391 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
9392 + eliminated the types void, one, tr
9393 + use unit lift and bool lift (with translations) instead of one and tr
9394 + eliminated blift from Lift3.thy (use Def instead of blift)
9395 all eliminated rules are derived as theorems --> no visible changes ;
9400 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
9401 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
9402 as ZF_cs addSIs [equalityI];
9406 New in Isabelle94-7 (November 96)
9407 ---------------------------------
9409 * allowing negative levels (as offsets) in prlev and choplev;
9411 * super-linear speedup for large simplifications;
9413 * FOL, ZF and HOL now use miniscoping: rewriting pushes
9414 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
9415 FAIL); can suppress it using the command Delsimps (ex_simps @
9416 all_simps); De Morgan laws are also now included, by default;
9418 * improved printing of ==> : ~:
9420 * new object-logic "Sequents" adds linear logic, while replacing LK
9421 and Modal (thanks to Sara Kalvala);
9423 * HOL/Auth: correctness proofs for authentication protocols;
9425 * HOL: new auto_tac combines rewriting and classical reasoning (many
9426 examples on HOL/Auth);
9428 * HOL: new command AddIffs for declaring theorems of the form P=Q to
9429 the rewriter and classical reasoner simultaneously;
9431 * function uresult no longer returns theorems in "standard" format;
9432 regain previous version by: val uresult = standard o uresult;
9439 * oracles -- these establish an interface between Isabelle and trusted
9440 external reasoners, which may deliver results as theorems;
9442 * proof objects (in particular record all uses of oracles);
9444 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
9446 * "constdefs" section in theory files;
9448 * "primrec" section (HOL) no longer requires names;
9450 * internal type "tactic" now simply "thm -> thm Sequence.seq";
9457 * reduced space requirements;
9459 * automatic HTML generation from theories;
9461 * theory files no longer require "..." (quotes) around most types;
9463 * new examples, including two proofs of the Church-Rosser theorem;
9465 * non-curried (1994) version of HOL is no longer distributed;
9472 * greatly reduced space requirements;
9474 * theory files (.thy) no longer require \...\ escapes at line breaks;
9476 * searchable theorem database (see the section "Retrieving theorems" on
9477 page 8 of the Reference Manual);
9479 * new examples, including Grabczewski's monumental case study of the
9482 * The previous version of HOL renamed to Old_HOL;
9484 * The new version of HOL (previously called CHOL) uses a curried syntax
9485 for functions. Application looks like f a b instead of f(a,b);
9487 * Mutually recursive inductive definitions finally work in HOL;
9489 * In ZF, pattern-matching on tuples is now available in all abstractions and
9490 translates to the operator "split";
9497 * new infix operator, addss, allowing the classical reasoner to
9498 perform simplification at each step of its search. Example:
9499 fast_tac (cs addss ss)
9501 * a new logic, CHOL, the same as HOL, but with a curried syntax
9502 for functions. Application looks like f a b instead of f(a,b). Also pairs
9503 look like (a,b) instead of <a,b>;
9505 * PLEASE NOTE: CHOL will eventually replace HOL!
9507 * In CHOL, pattern-matching on tuples is now available in all abstractions.
9508 It translates to the operator "split". A new theory of integers is available;
9510 * In ZF, integer numerals now denote two's-complement binary integers.
9511 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
9513 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
9514 of the Axiom of Choice;
9521 * Significantly faster resolution;
9523 * the different sections in a .thy file can now be mixed and repeated
9526 * Database of theorems for FOL, HOL and ZF. New
9527 commands including qed, qed_goal and bind_thm store theorems in the database.
9529 * Simple database queries: return a named theorem (get_thm) or all theorems of
9530 a given theory (thms_of), or find out what theory a theorem was proved in
9533 * Bugs fixed in the inductive definition and datatype packages;
9535 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
9536 and HOL_dup_cs obsolete;
9538 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
9541 * Simpler definition of function space in ZF;
9543 * new results about cardinal and ordinal arithmetic in ZF;
9545 * 'subtype' facility in HOL for introducing new types as subsets of existing
9548 :mode=text:wrap=hard:maxLineLen=72: