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 most proofs use the transfer method.
487 pow2 x ~> use "2 powr (real x)"
489 * Session HOL-Word: Discontinued many redundant theorems specific to
490 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
493 word_sub_alt ~> word_sub_wi
494 word_add_alt ~> word_add_def
495 word_mult_alt ~> word_mult_def
496 word_minus_alt ~> word_minus_def
497 word_0_alt ~> word_0_wi
498 word_1_alt ~> word_1_wi
499 word_add_0 ~> add_0_left
500 word_add_0_right ~> add_0_right
501 word_mult_1 ~> mult_1_left
502 word_mult_1_right ~> mult_1_right
503 word_add_commute ~> add_commute
504 word_add_assoc ~> add_assoc
505 word_add_left_commute ~> add_left_commute
506 word_mult_commute ~> mult_commute
507 word_mult_assoc ~> mult_assoc
508 word_mult_left_commute ~> mult_left_commute
509 word_left_distrib ~> left_distrib
510 word_right_distrib ~> right_distrib
511 word_left_minus ~> left_minus
512 word_diff_0_right ~> diff_0_right
513 word_diff_self ~> diff_self
514 word_sub_def ~> diff_minus
515 word_diff_minus ~> diff_minus
516 word_add_ac ~> add_ac
517 word_mult_ac ~> mult_ac
518 word_plus_ac0 ~> add_0_left add_0_right add_ac
519 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
520 word_order_trans ~> order_trans
521 word_order_refl ~> order_refl
522 word_order_antisym ~> order_antisym
523 word_order_linear ~> linorder_linear
524 lenw1_zero_neq_one ~> zero_neq_one
525 word_number_of_eq ~> number_of_eq
526 word_of_int_add_hom ~> wi_hom_add
527 word_of_int_sub_hom ~> wi_hom_sub
528 word_of_int_mult_hom ~> wi_hom_mult
529 word_of_int_minus_hom ~> wi_hom_neg
530 word_of_int_succ_hom ~> wi_hom_succ
531 word_of_int_pred_hom ~> wi_hom_pred
532 word_of_int_0_hom ~> word_0_wi
533 word_of_int_1_hom ~> word_1_wi
535 * New tactic "word_bitwise" for splitting machine word equalities and
536 inequalities into logical circuits. Requires theory "WordBitwise" from HOL-Word
537 session. Supports addition, subtraction, multiplication, shifting by
538 constants, bitwise operators and numeric constants. Requires fixed-length word
539 types, cannot operate on 'a word. Solves many standard word identies outright
540 and converts more into first order problems amenable to blast or similar. See
541 HOL/Word/WordBitwise.thy and examples in HOL/Word/Examples/WordExamples.thy.
543 * Clarified attribute "mono_set": pure declaration without modifying
544 the result of the fact expression.
546 * "Transitive_Closure.ntrancl": bounded transitive closure on
549 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
551 * Theory Int: Discontinued many legacy theorems specific to type int.
552 INCOMPATIBILITY, use the corresponding generic theorems instead.
554 zminus_zminus ~> minus_minus
555 zminus_0 ~> minus_zero
556 zminus_zadd_distrib ~> minus_add_distrib
557 zadd_commute ~> add_commute
558 zadd_assoc ~> add_assoc
559 zadd_left_commute ~> add_left_commute
563 zadd_0_right ~> add_0_right
564 zadd_zminus_inverse2 ~> left_minus
565 zmult_zminus ~> mult_minus_left
566 zmult_commute ~> mult_commute
567 zmult_assoc ~> mult_assoc
568 zadd_zmult_distrib ~> left_distrib
569 zadd_zmult_distrib2 ~> right_distrib
570 zdiff_zmult_distrib ~> left_diff_distrib
571 zdiff_zmult_distrib2 ~> right_diff_distrib
572 zmult_1 ~> mult_1_left
573 zmult_1_right ~> mult_1_right
574 zle_refl ~> order_refl
575 zle_trans ~> order_trans
576 zle_antisym ~> order_antisym
577 zle_linear ~> linorder_linear
578 zless_linear ~> linorder_less_linear
579 zadd_left_mono ~> add_left_mono
580 zadd_strict_right_mono ~> add_strict_right_mono
581 zadd_zless_mono ~> add_less_le_mono
582 int_0_less_1 ~> zero_less_one
583 int_0_neq_1 ~> zero_neq_one
585 zpower_zadd_distrib ~> power_add
586 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
587 zero_le_zpower_abs ~> zero_le_power_abs
589 * Theory Deriv: Renamed
591 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
593 * New "case_product" attribute to generate a case rule doing multiple
594 case distinctions at the same time. E.g.
596 list.exhaust [case_product nat.exhaust]
598 produces a rule which can be used to perform case distinction on both
601 * Theory Library/Multiset: Improved code generation of multisets.
603 * New diagnostic command 'find_unused_assms' to find potentially
604 superfluous assumptions in theorems using Quickcheck.
608 - Quickcheck returns variable assignments as counterexamples, which
609 allows to reveal the underspecification of functions under test.
610 For example, refuting "hd xs = x", it presents the variable
611 assignment xs = [] and x = a1 as a counterexample, assuming that
612 any property is false whenever "hd []" occurs in it.
614 These counterexample are marked as potentially spurious, as
615 Quickcheck also returns "xs = []" as a counterexample to the
616 obvious theorem "hd xs = hd xs".
618 After finding a potentially spurious counterexample, Quickcheck
619 continues searching for genuine ones.
621 By default, Quickcheck shows potentially spurious and genuine
622 counterexamples. The option "genuine_only" sets quickcheck to only
623 show genuine counterexamples.
625 - The command 'quickcheck_generator' creates random and exhaustive
626 value generators for a given type and operations.
628 It generates values by using the operations as if they were
629 constructors of that type.
631 - Support for multisets.
633 - Added "use_subtype" options.
635 - Added "quickcheck_locale" configuration to specify how to process
636 conjectures in a locale context.
639 - Fixed infinite loop caused by the 'peephole_optim' option and
640 affecting 'rat' and 'real'.
643 - Integrated more tightly with SPASS, as described in the ITP 2012 paper "More
644 SPASS with Isabelle".
645 - Made it try "smt" as a fallback if "metis" fails or times out.
646 - Added support for the following provers: Alt-Ergo (via Why3 and TFF1),
648 - Replaced remote E-SInE with remote Satallax in the default setup.
649 - Sped up the minimizer.
650 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
651 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
652 - Renamed "sound" option to "strict".
655 - Added possibility to specify lambda translations scheme as a
656 parenthesized argument (e.g., "by (metis (lifting) ...)").
659 - Renamed "smt_fixed" option to "smt_read_only_certificates".
662 - Renamed from 'try_methods'. INCOMPATIBILITY.
664 * New "eventually_elim" method as a generalized variant of the
665 eventually_elim* rules. Supports structured proofs.
667 * HOL/TPTP: support to parse and import TPTP problems (all languages)
673 * New "case_product" attribute (see HOL).
678 * Greater support for structured proofs involving induction or case
681 * Much greater use of mathematical symbols.
683 * Removal of many ML theorem bindings. INCOMPATIBILITY.
688 * Antiquotation @{keyword "name"} produces a parser for outer syntax
689 from a minor keyword introduced via theory header declaration.
691 * Antiquotation @{command_spec "name"} produces the
692 Outer_Syntax.command_spec from a major keyword introduced via theory
693 header declaration; it can be passed to Outer_Syntax.command etc.
695 * Local_Theory.define no longer hard-wires default theorem name
696 "foo_def", but retains the binding as given. If that is Binding.empty
697 / Attrib.empty_binding, the result is not registered as user-level
698 fact. The Local_Theory.define_internal variant allows to specify a
699 non-empty name (used for the foundation in the background theory),
700 while omitting the fact binding in the user-context. Potential
701 INCOMPATIBILITY for derived definitional packages: need to specify
702 naming policy for primitive definitions more explicitly.
704 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
705 conformance with similar operations in structure Term and Logic.
707 * Antiquotation @{attributes [...]} embeds attribute source
708 representation into the ML text, which is particularly useful with
709 declarations like Local_Theory.note.
711 * Structure Proof_Context follows standard naming scheme. Old
712 ProofContext has been discontinued. INCOMPATIBILITY.
714 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
715 change of semantics: update is applied to auxiliary local theory
718 * Modernized some old-style infix operations:
720 addeqcongs ~> Simplifier.add_eqcong
721 deleqcongs ~> Simplifier.del_eqcong
722 addcongs ~> Simplifier.add_cong
723 delcongs ~> Simplifier.del_cong
724 setmksimps ~> Simplifier.set_mksimps
725 setmkcong ~> Simplifier.set_mkcong
726 setmksym ~> Simplifier.set_mksym
727 setmkeqTrue ~> Simplifier.set_mkeqTrue
728 settermless ~> Simplifier.set_termless
729 setsubgoaler ~> Simplifier.set_subgoaler
730 addsplits ~> Splitter.add_split
731 delsplits ~> Splitter.del_split
736 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
739 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
740 notation, which is useful for the jEdit file browser, for example.
744 New in Isabelle2011-1 (October 2011)
745 ------------------------------------
749 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
750 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
752 - Management of multiple theory files directly from the editor
753 buffer store -- bypassing the file-system (no requirement to save
756 - Markup of formal entities within the text buffer, with semantic
757 highlighting, tooltips and hyperlinks to jump to defining source
760 - Improved text rendering, with sub/superscripts in the source
761 buffer (including support for copy/paste wrt. output panel, HTML
762 theory output and other non-Isabelle text boxes).
764 - Refined scheduling of proof checking and printing of results,
765 based on interactive editor view. (Note: jEdit folding and
766 narrowing allows to restrict buffer perspectives explicitly.)
768 - Reduced CPU performance requirements, usable on machines with few
771 - Reduced memory requirements due to pruning of unused document
772 versions (garbage collection).
774 See also ~~/src/Tools/jEdit/README.html for further information,
775 including some remaining limitations.
777 * Theory loader: source files are exclusively located via the master
778 directory of each theory node (where the .thy file itself resides).
779 The global load path (such as src/HOL/Library) has been discontinued.
780 Note that the path element ~~ may be used to reference theories in the
781 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
784 * Theory loader: source files are identified by content via SHA1
785 digests. Discontinued former path/modtime identification and optional
786 ISABELLE_FILE_IDENT plugin scripts.
788 * Parallelization of nested Isar proofs is subject to
789 Goal.parallel_proofs_threshold (default 100). See also isabelle
792 * Name space: former unsynchronized references are now proper
793 configuration options, with more conventional names:
795 long_names ~> names_long
796 short_names ~> names_short
797 unique_names ~> names_unique
799 Minor INCOMPATIBILITY, need to declare options in context like this:
801 declare [[names_unique = false]]
803 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
804 that the result needs to be unique, which means fact specifications
805 may have to be refined after enriching a proof context.
807 * Attribute "case_names" has been refined: the assumptions in each case
808 can be named now by following the case name with [name1 name2 ...].
810 * Isabelle/Isar reference manual has been updated and extended:
811 - "Synopsis" provides a catalog of main Isar language concepts.
812 - Formal references in syntax diagrams, via @{rail} antiquotation.
813 - Updated material from classic "ref" manual, notably about
814 "Classical Reasoner".
819 * Class bot and top require underlying partial order rather than
820 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
822 * Class complete_lattice: generalized a couple of lemmas from sets;
823 generalized theorems INF_cong and SUP_cong. New type classes for
824 complete boolean algebras and complete linear orders. Lemmas
825 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
826 class complete_linorder.
828 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
829 Sup_fun_def, Inf_apply, Sup_apply.
831 Removed redundant lemmas (the right hand side gives hints how to
832 replace them for (metis ...), or (simp only: ...) proofs):
834 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
835 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
836 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
837 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
838 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
839 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
840 Inter_def ~> INF_def, image_def
841 Union_def ~> SUP_def, image_def
842 INT_eq ~> INF_def, and image_def
843 UN_eq ~> SUP_def, and image_def
844 INF_subset ~> INF_superset_mono [OF _ order_refl]
846 More consistent and comprehensive names:
848 INTER_eq_Inter_image ~> INF_def
849 UNION_eq_Union_image ~> SUP_def
853 INF_leI2 ~> INF_lower2
854 le_INFI ~> INF_greatest
856 le_SUPI2 ~> SUP_upper2
858 INFI_bool_eq ~> INF_bool_eq
859 SUPR_bool_eq ~> SUP_bool_eq
860 INFI_apply ~> INF_apply
861 SUPR_apply ~> SUP_apply
862 INTER_def ~> INTER_eq
863 UNION_def ~> UNION_eq
867 * Renamed theory Complete_Lattice to Complete_Lattices.
870 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
871 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
872 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
873 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
875 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
876 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
877 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
880 * Added syntactic classes "inf" and "sup" for the respective
881 constants. INCOMPATIBILITY: Changes in the argument order of the
882 (mostly internal) locale predicates for some derived classes.
884 * Theorem collections ball_simps and bex_simps do not contain theorems
885 referring to UNION any longer; these have been moved to collection
886 UN_ball_bex_simps. INCOMPATIBILITY.
888 * Theory Archimedean_Field: floor now is defined as parameter of a
889 separate type class floor_ceiling.
891 * Theory Finite_Set: more coherent development of fold_set locales:
893 locale fun_left_comm ~> locale comp_fun_commute
894 locale fun_left_comm_idem ~> locale comp_fun_idem
896 Both use point-free characterization; interpretation proofs may need
897 adjustment. INCOMPATIBILITY.
899 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
900 accordance with standard mathematical terminology. INCOMPATIBILITY.
902 * Theory Complex_Main: The locale interpretations for the
903 bounded_linear and bounded_bilinear locales have been removed, in
904 order to reduce the number of duplicate lemmas. Users must use the
905 original names for distributivity theorems, potential INCOMPATIBILITY.
907 divide.add ~> add_divide_distrib
908 divide.diff ~> diff_divide_distrib
909 divide.setsum ~> setsum_divide_distrib
910 mult.add_right ~> right_distrib
911 mult.diff_right ~> right_diff_distrib
912 mult_right.setsum ~> setsum_right_distrib
913 mult_left.diff ~> left_diff_distrib
915 * Theory Complex_Main: Several redundant theorems have been removed or
916 replaced by more general versions. INCOMPATIBILITY.
918 real_diff_def ~> minus_real_def
919 real_divide_def ~> divide_real_def
920 real_less_def ~> less_le
921 real_abs_def ~> abs_real_def
922 real_sgn_def ~> sgn_real_def
923 real_mult_commute ~> mult_commute
924 real_mult_assoc ~> mult_assoc
925 real_mult_1 ~> mult_1_left
926 real_add_mult_distrib ~> left_distrib
927 real_zero_not_eq_one ~> zero_neq_one
928 real_mult_inverse_left ~> left_inverse
929 INVERSE_ZERO ~> inverse_zero
930 real_le_refl ~> order_refl
931 real_le_antisym ~> order_antisym
932 real_le_trans ~> order_trans
933 real_le_linear ~> linear
934 real_le_eq_diff ~> le_iff_diff_le_0
935 real_add_left_mono ~> add_left_mono
936 real_mult_order ~> mult_pos_pos
937 real_mult_less_mono2 ~> mult_strict_left_mono
938 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
939 real_0_le_divide_iff ~> zero_le_divide_iff
940 realpow_two_disj ~> power2_eq_iff
941 real_squared_diff_one_factored ~> square_diff_one_factored
942 realpow_two_diff ~> square_diff_square_factored
943 reals_complete2 ~> complete_real
944 real_sum_squared_expand ~> power2_sum
945 exp_ln_eq ~> ln_unique
947 expi_zero ~> exp_zero
948 lemma_DERIV_subst ~> DERIV_cong
949 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
950 LIMSEQ_const ~> tendsto_const
951 LIMSEQ_norm ~> tendsto_norm
952 LIMSEQ_add ~> tendsto_add
953 LIMSEQ_minus ~> tendsto_minus
954 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
955 LIMSEQ_diff ~> tendsto_diff
956 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
957 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
958 LIMSEQ_mult ~> tendsto_mult
959 LIMSEQ_inverse ~> tendsto_inverse
960 LIMSEQ_divide ~> tendsto_divide
961 LIMSEQ_pow ~> tendsto_power
962 LIMSEQ_setsum ~> tendsto_setsum
963 LIMSEQ_setprod ~> tendsto_setprod
964 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
965 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
966 LIMSEQ_imp_rabs ~> tendsto_rabs
967 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
968 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
969 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
970 LIMSEQ_Complex ~> tendsto_Complex
971 LIM_ident ~> tendsto_ident_at
972 LIM_const ~> tendsto_const
973 LIM_add ~> tendsto_add
974 LIM_add_zero ~> tendsto_add_zero
975 LIM_minus ~> tendsto_minus
976 LIM_diff ~> tendsto_diff
977 LIM_norm ~> tendsto_norm
978 LIM_norm_zero ~> tendsto_norm_zero
979 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
980 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
981 LIM_rabs ~> tendsto_rabs
982 LIM_rabs_zero ~> tendsto_rabs_zero
983 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
984 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
985 LIM_compose ~> tendsto_compose
986 LIM_mult ~> tendsto_mult
987 LIM_scaleR ~> tendsto_scaleR
988 LIM_of_real ~> tendsto_of_real
989 LIM_power ~> tendsto_power
990 LIM_inverse ~> tendsto_inverse
991 LIM_sgn ~> tendsto_sgn
992 isCont_LIM_compose ~> isCont_tendsto_compose
993 bounded_linear.LIM ~> bounded_linear.tendsto
994 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
995 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
996 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
997 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
998 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
999 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
1001 * Theory Complex_Main: The definition of infinite series was
1002 generalized. Now it is defined on the type class {topological_space,
1003 comm_monoid_add}. Hence it is useable also for extended real numbers.
1005 * Theory Complex_Main: The complex exponential function "expi" is now
1006 a type-constrained abbreviation for "exp :: complex => complex"; thus
1007 several polymorphic lemmas about "exp" are now applicable to "expi".
1011 - Theory Library/Code_Char_ord provides native ordering of
1012 characters in the target language.
1014 - Commands code_module and code_library are legacy, use export_code
1017 - Method "evaluation" is legacy, use method "eval" instead.
1019 - Legacy evaluator "SML" is deactivated by default. May be
1020 reactivated by the following theory command:
1022 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
1024 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
1026 * New proof method "induction" that gives induction hypotheses the
1027 name "IH", thus distinguishing them from further hypotheses that come
1028 from rule induction. The latter are still called "hyps". Method
1029 "induction" is a thin wrapper around "induct" and follows the same
1032 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
1033 still available as a legacy feature for some time.
1036 - Added "need" and "total_consts" options.
1037 - Reintroduced "show_skolems" option by popular demand.
1038 - Renamed attribute: nitpick_def ~> nitpick_unfold.
1042 - Use quasi-sound (and efficient) translations by default.
1043 - Added support for the following provers: E-ToFoF, LEO-II,
1044 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
1045 - Automatically preplay and minimize proofs before showing them if
1046 this can be done within reasonable time.
1047 - sledgehammer available_provers ~> sledgehammer supported_provers.
1049 - Added "preplay_timeout", "slicing", "type_enc", "sound",
1050 "max_mono_iters", and "max_new_mono_instances" options.
1051 - Removed "explicit_apply" and "full_types" options as well as "Full
1052 Types" Proof General menu item. INCOMPATIBILITY.
1055 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
1056 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
1060 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
1061 "elim:" options. INCOMPATIBILITY.
1062 - Introduced 'try' that not only runs 'try_methods' but also
1063 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
1066 - Added "eval" option to evaluate terms for the found counterexample
1067 (currently only supported by the default (exhaustive) tester).
1068 - Added post-processing of terms to obtain readable counterexamples
1069 (currently only supported by the default (exhaustive) tester).
1070 - New counterexample generator quickcheck[narrowing] enables
1071 narrowing-based testing. Requires the Glasgow Haskell compiler
1072 with its installation location defined in the Isabelle settings
1073 environment as ISABELLE_GHC.
1074 - Removed quickcheck tester "SML" based on the SML code generator
1075 (formly in HOL/Library).
1077 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
1078 use 'partial_function' instead.
1080 * Theory Library/Extended_Reals replaces now the positive extended
1081 reals found in probability theory. This file is extended by
1082 Multivariate_Analysis/Extended_Real_Limits.
1084 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
1085 from where it must be imported explicitly if it is really required.
1088 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
1089 been moved here. INCOMPATIBILITY.
1091 * Theory Library/Saturated provides type of numbers with saturated
1094 * Theory Library/Product_Lattice defines a pointwise ordering for the
1095 product type 'a * 'b, and provides instance proofs for various order
1096 and lattice type classes.
1098 * Theory Library/Countable now provides the "countable_datatype" proof
1099 method for proving "countable" class instances for datatypes.
1101 * Theory Library/Cset_Monad allows do notation for computable sets
1102 (cset) via the generic monad ad-hoc overloading facility.
1104 * Library: Theories of common data structures are split into theories
1105 for implementation, an invariant-ensuring type, and connection to an
1106 abstract type. INCOMPATIBILITY.
1108 - RBT is split into RBT and RBT_Mapping.
1109 - AssocList is split and renamed into AList and AList_Mapping.
1110 - DList is split into DList_Impl, DList, and DList_Cset.
1111 - Cset is split into Cset and List_Cset.
1113 * Theory Library/Nat_Infinity has been renamed to
1114 Library/Extended_Nat, with name changes of the following types and
1117 type inat ~> type enat
1119 Infty ~> infinity (overloaded)
1123 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
1124 been renamed accordingly. INCOMPATIBILITY.
1126 * Session Multivariate_Analysis: The euclidean_space type class now
1127 fixes a constant "Basis :: 'a set" consisting of the standard
1128 orthonormal basis for the type. Users now have the option of
1129 quantifying over this set instead of using the "basis" function, e.g.
1130 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
1132 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
1133 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
1134 "Cart_nth" and "Cart_lambda" have been respectively renamed to
1135 "vec_nth" and "vec_lambda"; theorems mentioning those names have
1136 changed to match. Definition theorems for overloaded constants now use
1137 the standard "foo_vec_def" naming scheme. A few other theorems have
1138 been renamed as follows (INCOMPATIBILITY):
1140 Cart_eq ~> vec_eq_iff
1141 dist_nth_le_cart ~> dist_vec_nth_le
1142 tendsto_vector ~> vec_tendstoI
1143 Cauchy_vector ~> vec_CauchyI
1145 * Session Multivariate_Analysis: Several duplicate theorems have been
1146 removed, and other theorems have been renamed or replaced with more
1147 general versions. INCOMPATIBILITY.
1149 finite_choice ~> finite_set_choice
1150 eventually_conjI ~> eventually_conj
1151 eventually_and ~> eventually_conj_iff
1152 eventually_false ~> eventually_False
1153 setsum_norm ~> norm_setsum
1154 Lim_sequentially ~> LIMSEQ_def
1155 Lim_ident_at ~> LIM_ident
1156 Lim_const ~> tendsto_const
1157 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
1158 Lim_neg ~> tendsto_minus
1159 Lim_add ~> tendsto_add
1160 Lim_sub ~> tendsto_diff
1161 Lim_mul ~> tendsto_scaleR
1162 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
1163 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
1164 Lim_linear ~> bounded_linear.tendsto
1165 Lim_component ~> tendsto_euclidean_component
1166 Lim_component_cart ~> tendsto_vec_nth
1167 Lim_inner ~> tendsto_inner [OF tendsto_const]
1168 dot_lsum ~> inner_setsum_left
1169 dot_rsum ~> inner_setsum_right
1170 continuous_cmul ~> continuous_scaleR [OF continuous_const]
1171 continuous_neg ~> continuous_minus
1172 continuous_sub ~> continuous_diff
1173 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
1174 continuous_mul ~> continuous_scaleR
1175 continuous_inv ~> continuous_inverse
1176 continuous_at_within_inv ~> continuous_at_within_inverse
1177 continuous_at_inv ~> continuous_at_inverse
1178 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
1179 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
1180 continuous_at_component ~> continuous_component [OF continuous_at_id]
1181 continuous_on_neg ~> continuous_on_minus
1182 continuous_on_sub ~> continuous_on_diff
1183 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
1184 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
1185 continuous_on_mul ~> continuous_on_scaleR
1186 continuous_on_mul_real ~> continuous_on_mult
1187 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
1188 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
1189 continuous_on_inverse ~> continuous_on_inv
1190 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
1191 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
1192 subset_interior ~> interior_mono
1193 subset_closure ~> closure_mono
1194 closure_univ ~> closure_UNIV
1195 real_arch_lt ~> reals_Archimedean2
1196 real_arch ~> reals_Archimedean3
1197 real_abs_norm ~> abs_norm_cancel
1198 real_abs_sub_norm ~> norm_triangle_ineq3
1199 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
1201 * Session HOL-Probability:
1202 - Caratheodory's extension lemma is now proved for ring_of_sets.
1203 - Infinite products of probability measures are now available.
1204 - Sigma closure is independent, if the generator is independent
1205 - Use extended reals instead of positive extended
1206 reals. INCOMPATIBILITY.
1208 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
1210 expand_fun_below ~> fun_below_iff
1211 below_fun_ext ~> fun_belowI
1212 expand_cfun_eq ~> cfun_eq_iff
1213 ext_cfun ~> cfun_eqI
1214 expand_cfun_below ~> cfun_below_iff
1215 below_cfun_ext ~> cfun_belowI
1216 monofun_fun_fun ~> fun_belowD
1217 monofun_fun_arg ~> monofunE
1218 monofun_lub_fun ~> adm_monofun [THEN admD]
1219 cont_lub_fun ~> adm_cont [THEN admD]
1220 cont2cont_Rep_CFun ~> cont2cont_APP
1221 cont_Rep_CFun_app ~> cont_APP_app
1222 cont_Rep_CFun_app_app ~> cont_APP_app_app
1223 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
1224 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
1225 contlub_cfun ~> lub_APP [symmetric]
1226 contlub_LAM ~> lub_LAM [symmetric]
1229 lift_distinct1 ~> lift.distinct(1)
1230 lift_distinct2 ~> lift.distinct(2)
1231 Def_not_UU ~> lift.distinct(2)
1232 Def_inject ~> lift.inject
1233 below_UU_iff ~> below_bottom_iff
1234 eq_UU_iff ~> eq_bottom_iff
1237 *** Document preparation ***
1239 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
1240 isar-ref manual, both for description and actual application of the
1243 * Antiquotation @{value} evaluates the given term and presents its
1246 * Antiquotations: term style "isub" provides ad-hoc conversion of
1247 variables x1, y23 into subscripted form x\<^isub>1,
1248 y\<^isub>2\<^isub>3.
1250 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
1251 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
1253 * Localized \isabellestyle switch can be used within blocks or groups
1256 \isabellestyle{it} %preferred default
1257 {\isabellestylett @{text "typewriter stuff"}}
1259 * Discontinued special treatment of hard tabulators. Implicit
1260 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
1266 * The inner syntax of sort/type/term/prop supports inlined YXML
1267 representations within quoted string tokens. By encoding logical
1268 entities via Term_XML (in ML or Scala) concrete syntax can be
1269 bypassed, which is particularly useful for producing bits of text
1270 under external program control.
1272 * Antiquotations for ML and document preparation are managed as theory
1273 data, which requires explicit setup.
1275 * Isabelle_Process.is_active allows tools to check if the official
1276 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
1277 (better known as Proof General).
1279 * Structure Proof_Context follows standard naming scheme. Old
1280 ProofContext is still available for some time as legacy alias.
1282 * Structure Timing provides various operations for timing; supersedes
1283 former start_timing/end_timing etc.
1285 * Path.print is the official way to show file-system paths to users
1286 (including quotes etc.).
1288 * Inner syntax: identifiers in parse trees of generic categories
1289 "logic", "aprop", "idt" etc. carry position information (disguised as
1290 type constraints). Occasional INCOMPATIBILITY with non-compliant
1291 translations that choke on unexpected type constraints. Positions can
1292 be stripped in ML translations via Syntax.strip_positions /
1293 Syntax.strip_positions_ast, or via the syntax constant
1294 "_strip_positions" within parse trees. As last resort, positions can
1295 be disabled via the configuration option Syntax.positions, which is
1296 called "syntax_positions" in Isar attribute syntax.
1298 * Discontinued special status of various ML structures that contribute
1299 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
1300 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
1301 refer directly to Ast.Constant, Lexicon.is_identifier,
1302 Syntax_Trans.mk_binder_tr etc.
1304 * Typed print translation: discontinued show_sorts argument, which is
1305 already available via context of "advanced" translation.
1307 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
1308 goal states; body tactic needs to address all subgoals uniformly.
1310 * Slightly more special eq_list/eq_set, with shortcut involving
1311 pointer equality (assumes that eq relation is reflexive).
1313 * Classical tactics use proper Proof.context instead of historic types
1314 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
1315 operate directly on Proof.context. Raw type claset retains its use as
1316 snapshot of the classical context, which can be recovered via
1317 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
1318 INCOMPATIBILITY, classical tactics and derived proof methods require
1319 proper Proof.context.
1324 * Discontinued support for Poly/ML 5.2, which was the last version
1325 without proper multithreading and TimeLimit implementation.
1327 * Discontinued old lib/scripts/polyml-platform, which has been
1328 obsolete since Isabelle2009-2.
1330 * Various optional external tools are referenced more robustly and
1331 uniformly by explicit Isabelle settings as follows:
1333 ISABELLE_CSDP (formerly CSDP_EXE)
1334 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
1335 ISABELLE_OCAML (formerly EXEC_OCAML)
1336 ISABELLE_SWIPL (formerly EXEC_SWIPL)
1337 ISABELLE_YAP (formerly EXEC_YAP)
1339 Note that automated detection from the file-system or search path has
1340 been discontinued. INCOMPATIBILITY.
1342 * Scala layer provides JVM method invocation service for static
1343 methods of type (String)String, see Invoke_Scala.method in ML. For
1346 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
1348 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
1349 this allows to pass structured values between ML and Scala.
1351 * The IsabelleText fonts includes some further glyphs to support the
1352 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
1353 installed a local copy (which is normally *not* required) need to
1354 delete or update it from ~~/lib/fonts/.
1358 New in Isabelle2011 (January 2011)
1359 ----------------------------------
1363 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
1364 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
1365 useful tooltips and hyperlinks produced from its static analysis. The
1366 bundled component provides an executable Isabelle tool that can be run
1369 Isabelle2011/bin/isabelle jedit
1371 * Significantly improved Isabelle/Isar implementation manual.
1373 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
1374 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
1375 while the default heap location within that directory lacks that extra
1376 suffix. This isolates multiple Isabelle installations from each
1377 other, avoiding problems with old settings in new versions.
1378 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
1380 * Source files are always encoded as UTF-8, instead of old-fashioned
1381 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
1382 the following package declarations:
1384 \usepackage[utf8]{inputenc}
1385 \usepackage{textcomp}
1387 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
1388 a Unicode character is treated as a single symbol, not a sequence of
1389 non-ASCII bytes as before. Since Isabelle/ML string literals may
1390 contain symbols without further backslash escapes, Unicode can now be
1391 used here as well. Recall that Symbol.explode in ML provides a
1392 consistent view on symbols, while raw explode (or String.explode)
1393 merely give a byte-oriented representation.
1395 * Theory loader: source files are primarily located via the master
1396 directory of each theory node (where the .thy file itself resides).
1397 The global load path is still partially available as legacy feature.
1398 Minor INCOMPATIBILITY due to subtle change in file lookup: use
1399 explicit paths, relatively to the theory.
1401 * Special treatment of ML file names has been discontinued.
1402 Historically, optional extensions .ML or .sml were added on demand --
1403 at the cost of clarity of file dependencies. Recall that Isabelle/ML
1404 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
1406 * Various options that affect pretty printing etc. are now properly
1407 handled within the context via configuration options, instead of
1408 unsynchronized references or print modes. There are both ML Config.T
1409 entities and Isar declaration attributes to access these.
1411 ML (Config.T) Isar (attribute)
1413 eta_contract eta_contract
1414 show_brackets show_brackets
1415 show_sorts show_sorts
1416 show_types show_types
1417 show_question_marks show_question_marks
1418 show_consts show_consts
1419 show_abbrevs show_abbrevs
1421 Syntax.ast_trace syntax_ast_trace
1422 Syntax.ast_stat syntax_ast_stat
1423 Syntax.ambiguity_level syntax_ambiguity_level
1425 Goal_Display.goals_limit goals_limit
1426 Goal_Display.show_main_goal show_main_goal
1428 Method.rule_trace rule_trace
1430 Thy_Output.display thy_output_display
1431 Thy_Output.quotes thy_output_quotes
1432 Thy_Output.indent thy_output_indent
1433 Thy_Output.source thy_output_source
1434 Thy_Output.break thy_output_break
1436 Note that corresponding "..._default" references in ML may only be
1437 changed globally at the ROOT session setup, but *not* within a theory.
1438 The option "show_abbrevs" supersedes the former print mode
1439 "no_abbrevs" with inverted meaning.
1441 * More systematic naming of some configuration options.
1444 trace_simp ~> simp_trace
1445 debug_simp ~> simp_debug
1447 * Support for real valued configuration options, using simplistic
1448 floating-point notation that coincides with the inner syntax for
1451 * Support for real valued preferences (with approximative PGIP type):
1452 front-ends need to accept "pgint" values in float notation.
1455 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
1458 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
1463 * Command 'type_synonym' (with single argument) replaces somewhat
1464 outdated 'types', which is still available as legacy feature for some
1467 * Command 'nonterminal' (with 'and' separated list of arguments)
1468 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
1470 * Command 'notepad' replaces former 'example_proof' for
1471 experimentation in Isar without any result. INCOMPATIBILITY.
1473 * Locale interpretation commands 'interpret' and 'sublocale' accept
1474 lists of equations to map definitions in a locale to appropriate
1475 entities in the context of the interpretation. The 'interpretation'
1476 command already provided this functionality.
1478 * Diagnostic command 'print_dependencies' prints the locale instances
1479 that would be activated if the specified expression was interpreted in
1480 the current context. Variant "print_dependencies!" assumes a context
1481 without interpretations.
1483 * Diagnostic command 'print_interps' prints interpretations in proofs
1484 in addition to interpretations in theories.
1486 * Discontinued obsolete 'global' and 'local' commands to manipulate
1487 the theory name space. Rare INCOMPATIBILITY. The ML functions
1488 Sign.root_path and Sign.local_path may be applied directly where this
1489 feature is still required for historical reasons.
1491 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
1492 'definition' instead.
1494 * The "prems" fact, which refers to the accidental collection of
1495 foundational premises in the context, is now explicitly marked as
1496 legacy feature and will be discontinued soon. Consider using "assms"
1497 of the head statement or reference facts by explicit names.
1499 * Document antiquotations @{class} and @{type} print classes and type
1502 * Document antiquotation @{file} checks file/directory entries within
1503 the local file system.
1508 * Coercive subtyping: functions can be declared as coercions and type
1509 inference will add them as necessary upon input of a term. Theory
1510 Complex_Main declares real :: nat => real and real :: int => real as
1511 coercions. A coercion function f is declared like this:
1513 declare [[coercion f]]
1515 To lift coercions through type constructors (e.g. from nat => real to
1516 nat list => real list), map functions can be declared, e.g.
1518 declare [[coercion_map map]]
1520 Currently coercion inference is activated only in theories including
1521 real numbers, i.e. descendants of Complex_Main. This is controlled by
1522 the configuration option "coercion_enabled", e.g. it can be enabled in
1523 other theories like this:
1525 declare [[coercion_enabled]]
1527 * Command 'partial_function' provides basic support for recursive
1528 function definitions over complete partial orders. Concrete instances
1529 are provided for i) the option type, ii) tail recursion on arbitrary
1530 types, and iii) the heap monad of Imperative_HOL. See
1531 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
1534 * Function package: f.psimps rules are no longer implicitly declared
1535 as [simp]. INCOMPATIBILITY.
1537 * Datatype package: theorems generated for executable equality (class
1538 "eq") carry proper names and are treated as default code equations.
1540 * Inductive package: now offers command 'inductive_simps' to
1541 automatically derive instantiated and simplified equations for
1542 inductive predicates, similar to 'inductive_cases'.
1544 * Command 'enriched_type' allows to register properties of the
1545 functorial structure of types.
1547 * Improved infrastructure for term evaluation using code generator
1548 techniques, in particular static evaluation conversions.
1550 * Code generator: Scala (2.8 or higher) has been added to the target
1553 * Code generator: globbing constant expressions "*" and "Theory.*"
1554 have been replaced by the more idiomatic "_" and "Theory._".
1557 * Code generator: export_code without explicit file declaration prints
1558 to standard output. INCOMPATIBILITY.
1560 * Code generator: do not print function definitions for case
1561 combinators any longer.
1563 * Code generator: simplification with rules determined with
1564 src/Tools/Code/code_simp.ML and method "code_simp".
1566 * Code generator for records: more idiomatic representation of record
1567 types. Warning: records are not covered by ancient SML code
1568 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
1569 rep_datatype declaration helps to succeed then:
1573 rep_datatype foo_ext ...
1575 * Records: logical foundation type for records does not carry a
1576 '_type' suffix any longer (obsolete due to authentic syntax).
1579 * Quickcheck now by default uses exhaustive testing instead of random
1580 testing. Random testing can be invoked by "quickcheck [random]",
1581 exhaustive testing by "quickcheck [exhaustive]".
1583 * Quickcheck instantiates polymorphic types with small finite
1584 datatypes by default. This enables a simple execution mechanism to
1585 handle quantifiers and function equality over the finite datatypes.
1587 * Quickcheck random generator has been renamed from "code" to
1588 "random". INCOMPATIBILITY.
1590 * Quickcheck now has a configurable time limit which is set to 30
1591 seconds by default. This can be changed by adding [timeout = n] to the
1592 quickcheck command. The time limit for Auto Quickcheck is still set
1595 * Quickcheck in locales considers interpretations of that locale for
1596 counter example search.
1599 - Added "smt" and "remote_smt" provers based on the "smt" proof
1600 method. See the Sledgehammer manual for details ("isabelle doc
1603 sledgehammer atp_info ~> sledgehammer running_provers
1604 sledgehammer atp_kill ~> sledgehammer kill_provers
1605 sledgehammer available_atps ~> sledgehammer available_provers
1608 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
1609 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
1610 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
1611 (and "ms" and "min" are no longer supported)
1616 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
1617 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
1619 - Added support for partial quotient types.
1620 - Added local versions of the "Nitpick.register_xxx" functions.
1621 - Added "whack" option.
1622 - Allow registration of quotient types as codatatypes.
1623 - Improved "merge_type_vars" option to merge more types.
1624 - Removed unsound "fast_descrs" option.
1625 - Added custom symmetry breaking for datatypes, making it possible to reach
1626 higher cardinalities.
1627 - Prevent the expansion of too large definitions.
1629 * Proof methods "metis" and "meson" now have configuration options
1630 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
1631 to diagnose these tools. E.g.
1633 using [[metis_trace = true]]
1635 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
1636 manually as command 'solve_direct'.
1638 * The default SMT solver Z3 must be enabled explicitly (due to
1639 licensing issues) by setting the environment variable
1640 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
1641 commercial applications, the SMT solver CVC3 is provided as fall-back;
1642 changing the SMT solver is done via the configuration option
1645 * Remote SMT solvers need to be referred to by the "remote_" prefix,
1646 i.e. "remote_cvc3" and "remote_z3".
1648 * Added basic SMT support for datatypes, records, and typedefs using
1649 the oracle mode (no proofs). Direct support of pairs has been dropped
1650 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
1651 support for a similar behavior). Minor INCOMPATIBILITY.
1653 * Changed SMT configuration options:
1655 z3_proofs ~> smt_oracle (with inverted meaning)
1656 z3_trace_assms ~> smt_trace_used_facts
1669 * Boogie output files (.b2i files) need to be declared in the theory
1672 * Simplification procedure "list_to_set_comprehension" rewrites list
1673 comprehensions applied to List.set to set comprehensions. Occasional
1674 INCOMPATIBILITY, may be deactivated like this:
1676 declare [[simproc del: list_to_set_comprehension]]
1678 * Removed old version of primrec package. INCOMPATIBILITY.
1680 * Removed simplifier congruence rule of "prod_case", as has for long
1681 been the case with "split". INCOMPATIBILITY.
1683 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
1685 * Removed [split_format ... and ... and ...] version of
1686 [split_format]. Potential INCOMPATIBILITY.
1688 * Predicate "sorted" now defined inductively, with nice induction
1689 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
1691 * Constant "contents" renamed to "the_elem", to free the generic name
1692 contents for other uses. INCOMPATIBILITY.
1694 * Renamed class eq and constant eq (for code generation) to class
1695 equal and constant equal, plus renaming of related facts and various
1696 tuning. INCOMPATIBILITY.
1698 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
1700 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
1703 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
1704 avoid confusion with finite sets. INCOMPATIBILITY.
1706 * Abandoned locales equiv, congruent and congruent2 for equivalence
1707 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
1710 * Some previously unqualified names have been qualified:
1717 Trueprop ~> HOL.Trueprop
1722 op --> ~> HOL.implies
1734 Pair ~> Product_Type.Pair
1735 fst ~> Product_Type.fst
1736 snd ~> Product_Type.snd
1737 curry ~> Product_Type.curry
1739 Collect ~> Set.Collect
1743 * More canonical naming convention for some fundamental definitions:
1745 bot_bool_eq ~> bot_bool_def
1746 top_bool_eq ~> top_bool_def
1747 inf_bool_eq ~> inf_bool_def
1748 sup_bool_eq ~> sup_bool_def
1749 bot_fun_eq ~> bot_fun_def
1750 top_fun_eq ~> top_fun_def
1751 inf_fun_eq ~> inf_fun_def
1752 sup_fun_eq ~> sup_fun_def
1756 * More stylized fact names:
1758 expand_fun_eq ~> fun_eq_iff
1759 expand_set_eq ~> set_eq_iff
1761 nat_number ~> eval_nat_numeral
1765 * Refactoring of code-generation specific operations in theory List:
1771 mem_iff ~> member_def
1772 null_empty ~> null_def
1774 INCOMPATIBILITY. Note that these were not supposed to be used
1775 regularly unless for striking reasons; their main purpose was code
1778 Various operations from the Haskell prelude are used for generating
1781 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
1782 "surj f" is now an abbreviation of "range f = UNIV". The theorems
1783 bij_def and surj_def are unchanged. INCOMPATIBILITY.
1785 * Abolished some non-alphabetic type names: "prod" and "sum" replace
1786 "*" and "+" respectively. INCOMPATIBILITY.
1788 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
1789 "Sum_Type.Plus" instead.
1791 * Constant "split" has been merged with constant "prod_case"; names of
1792 ML functions, facts etc. involving split have been retained so far,
1793 though. INCOMPATIBILITY.
1795 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
1796 instead. INCOMPATIBILITY.
1798 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
1801 * Former theory Library/Enum is now part of the HOL-Main image.
1802 INCOMPATIBILITY: all constants of the Enum theory now have to be
1803 referred to by its qualified name.
1806 nlists ~> Enum.nlists
1807 product ~> Enum.product
1809 * Theory Library/Monad_Syntax provides do-syntax for monad types.
1810 Syntax in Library/State_Monad has been changed to avoid ambiguities.
1813 * Theory Library/SetsAndFunctions has been split into
1814 Library/Function_Algebras and Library/Set_Algebras; canonical names
1815 for instance definitions for functions; various improvements.
1818 * Theory Library/Multiset provides stable quicksort implementation of
1821 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
1824 * Session Multivariate_Analysis: introduced a type class for euclidean
1825 space. Most theorems are now stated in terms of euclidean spaces
1826 instead of finite cartesian products.
1829 real ^ 'n ~> 'a::real_vector
1830 ~> 'a::euclidean_space
1831 ~> 'a::ordered_euclidean_space
1832 (depends on your needs)
1836 \<chi> x. _ ~> \<chi>\<chi> x. _
1839 Also note that the indices are now natural numbers and not from some
1840 finite type. Finite cartesian products of euclidean spaces, products
1841 of euclidean spaces the real and complex numbers are instantiated to
1842 be euclidean_spaces. INCOMPATIBILITY.
1844 * Session Probability: introduced pextreal as positive extended real
1845 numbers. Use pextreal as value for measures. Introduce the
1846 Radon-Nikodym derivative, product spaces and Fubini's theorem for
1847 arbitrary sigma finite measures. Introduces Lebesgue measure based on
1848 the integral in Multivariate Analysis. INCOMPATIBILITY.
1850 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
1853 * Session SPARK (with image HOL-SPARK) provides commands to load and
1854 prove verification conditions generated by the SPARK Ada program
1855 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
1860 * Theorems for additive ring operations (locale abelian_monoid and
1861 descendants) are generated by interpretation from their multiplicative
1862 counterparts. Names (in particular theorem names) have the mandatory
1863 qualifier 'add'. Previous theorem names are redeclared for
1866 * Structure "int_ring" is now an abbreviation (previously a
1867 definition). This fits more natural with advanced interpretations.
1872 * The domain package now runs in definitional mode by default: The
1873 former command 'new_domain' is now called 'domain'. To use the domain
1874 package in its original axiomatic mode, use 'domain (unsafe)'.
1877 * The new class "domain" is now the default sort. Class "predomain"
1878 is an unpointed version of "domain". Theories can be updated by
1879 replacing sort annotations as shown below. INCOMPATIBILITY.
1881 'a::type ~> 'a::countable
1882 'a::cpo ~> 'a::predomain
1883 'a::pcpo ~> 'a::domain
1885 * The old type class "rep" has been superseded by class "domain".
1886 Accordingly, users of the definitional package must remove any
1887 "default_sort rep" declarations. INCOMPATIBILITY.
1889 * The domain package (definitional mode) now supports unpointed
1890 predomain argument types, as long as they are marked 'lazy'. (Strict
1891 arguments must be in class "domain".) For example, the following
1892 domain definition now works:
1894 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
1896 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
1897 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
1898 'a option, and 'a list. Additionally, it configures fixrec and the
1899 domain package to work with these types. For example:
1901 fixrec isInl :: "('a + 'b) u -> tr"
1902 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
1904 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
1906 * The "(permissive)" option of fixrec has been replaced with a
1907 per-equation "(unchecked)" option. See
1908 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
1910 * The "bifinite" class no longer fixes a constant "approx"; the class
1911 now just asserts that such a function exists. INCOMPATIBILITY.
1913 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
1914 defines an embedding of type 'a defl into udom by default; instances
1915 of "bifinite" and "domain" classes are available in
1916 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
1918 * The syntax "REP('a)" has been replaced with "DEFL('a)".
1920 * The predicate "directed" has been removed. INCOMPATIBILITY.
1922 * The type class "finite_po" has been removed. INCOMPATIBILITY.
1924 * The function "cprod_map" has been renamed to "prod_map".
1927 * The monadic bind operator on each powerdomain has new binder syntax
1928 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
1929 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
1931 * The infix syntax for binary union on each powerdomain has changed
1932 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
1933 syntax. INCOMPATIBILITY.
1935 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
1936 still supported as an input translation.
1938 * Renamed some theorems (the original names are also still available).
1940 expand_fun_below ~> fun_below_iff
1941 below_fun_ext ~> fun_belowI
1942 expand_cfun_eq ~> cfun_eq_iff
1943 ext_cfun ~> cfun_eqI
1944 expand_cfun_below ~> cfun_below_iff
1945 below_cfun_ext ~> cfun_belowI
1946 cont2cont_Rep_CFun ~> cont2cont_APP
1948 * The Abs and Rep functions for various types have changed names.
1949 Related theorem names have also changed to match. INCOMPATIBILITY.
1951 Rep_CFun ~> Rep_cfun
1952 Abs_CFun ~> Abs_cfun
1953 Rep_Sprod ~> Rep_sprod
1954 Abs_Sprod ~> Abs_sprod
1955 Rep_Ssum ~> Rep_ssum
1956 Abs_Ssum ~> Abs_ssum
1958 * Lemmas with names of the form *_defined_iff or *_strict_iff have
1959 been renamed to *_bottom_iff. INCOMPATIBILITY.
1961 * Various changes to bisimulation/coinduction with domain package:
1963 - Definitions of "bisim" constants no longer mention definedness.
1964 - With mutual recursion, "bisim" predicate is now curried.
1965 - With mutual recursion, each type gets a separate coind theorem.
1966 - Variable names in bisim_def and coinduct rules have changed.
1970 * Case combinators generated by the domain package for type "foo" are
1971 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
1973 * Several theorems have been renamed to more accurately reflect the
1974 names of constants and types involved. INCOMPATIBILITY.
1976 thelub_const ~> lub_const
1977 lub_const ~> is_lub_const
1979 is_lub_lub ~> is_lubD2
1981 unique_lub ~> is_lub_unique
1982 is_ub_lub ~> is_lub_rangeD1
1983 lub_bin_chain ~> is_lub_bin_chain
1984 lub_fun ~> is_lub_fun
1985 thelub_fun ~> lub_fun
1986 thelub_cfun ~> lub_cfun
1987 thelub_Pair ~> lub_Pair
1988 lub_cprod ~> is_lub_prod
1989 thelub_cprod ~> lub_prod
1990 minimal_cprod ~> minimal_prod
1991 inst_cprod_pcpo ~> inst_prod_pcpo
1993 compact_UU ~> compact_bottom
1994 deflation_UU ~> deflation_bottom
1995 finite_deflation_UU ~> finite_deflation_bottom
1997 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
1999 sq_ord_less_eq_trans ~> below_eq_trans
2000 sq_ord_eq_less_trans ~> eq_below_trans
2001 refl_less ~> below_refl
2002 trans_less ~> below_trans
2003 antisym_less ~> below_antisym
2004 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
2005 box_less ~> box_below
2006 rev_trans_less ~> rev_below_trans
2007 not_less2not_eq ~> not_below2not_eq
2008 less_UU_iff ~> below_UU_iff
2009 flat_less_iff ~> flat_below_iff
2010 adm_less ~> adm_below
2011 adm_not_less ~> adm_not_below
2012 adm_compact_not_less ~> adm_compact_not_below
2013 less_fun_def ~> below_fun_def
2014 expand_fun_less ~> fun_below_iff
2015 less_fun_ext ~> fun_belowI
2016 less_discr_def ~> below_discr_def
2017 discr_less_eq ~> discr_below_eq
2018 less_unit_def ~> below_unit_def
2019 less_cprod_def ~> below_prod_def
2020 prod_lessI ~> prod_belowI
2021 Pair_less_iff ~> Pair_below_iff
2022 fst_less_iff ~> fst_below_iff
2023 snd_less_iff ~> snd_below_iff
2024 expand_cfun_less ~> cfun_below_iff
2025 less_cfun_ext ~> cfun_belowI
2026 injection_less ~> injection_below
2027 less_up_def ~> below_up_def
2028 not_Iup_less ~> not_Iup_below
2029 Iup_less ~> Iup_below
2031 Def_inject_less_eq ~> Def_below_Def
2032 Def_less_is_eq ~> Def_below_iff
2033 spair_less_iff ~> spair_below_iff
2034 less_sprod ~> below_sprod
2035 spair_less ~> spair_below
2036 sfst_less_iff ~> sfst_below_iff
2037 ssnd_less_iff ~> ssnd_below_iff
2038 fix_least_less ~> fix_least_below
2039 dist_less_one ~> dist_below_one
2040 less_ONE ~> below_ONE
2041 ONE_less_iff ~> ONE_below_iff
2042 less_sinlD ~> below_sinlD
2043 less_sinrD ~> below_sinrD
2048 * All constant names are now qualified internally and use proper
2049 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
2054 * Antiquotation @{assert} inlines a function bool -> unit that raises
2055 Fail if the argument is false. Due to inlining the source position of
2056 failed assertions is included in the error output.
2058 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
2059 text is in practice always evaluated with a stable theory checkpoint.
2060 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
2062 * Antiquotation @{theory A} refers to theory A from the ancestry of
2063 the current context, not any accidental theory loader state as before.
2064 Potential INCOMPATIBILITY, subtle change in semantics.
2066 * Syntax.pretty_priority (default 0) configures the required priority
2067 of pretty-printed output and thus affects insertion of parentheses.
2069 * Syntax.default_root (default "any") configures the inner syntax
2070 category (nonterminal symbol) for parsing of terms.
2072 * Former exception Library.UnequalLengths now coincides with
2073 ListPair.UnequalLengths.
2075 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
2076 main functionality is provided by structure Simplifier.
2078 * Renamed raw "explode" function to "raw_explode" to emphasize its
2079 meaning. Note that internally to Isabelle, Symbol.explode is used in
2080 almost all situations.
2082 * Discontinued obsolete function sys_error and exception SYS_ERROR.
2083 See implementation manual for further details on exceptions in
2086 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
2089 * Renamed structure PureThy to Pure_Thy and moved most of its
2090 operations to structure Global_Theory, to emphasize that this is
2091 rarely-used global-only stuff.
2093 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
2094 instead (or tracing for high-volume output).
2096 * Configuration option show_question_marks only affects regular pretty
2097 printing of types and terms, not raw Term.string_of_vname.
2099 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
2100 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
2101 @{thms} for most purposes.
2103 * ML structure Unsynchronized is never opened, not even in Isar
2104 interaction mode as before. Old Unsynchronized.set etc. have been
2105 discontinued -- use plain := instead. This should be *rare* anyway,
2106 since modern tools always work via official context data, notably
2107 configuration options.
2109 * Parallel and asynchronous execution requires special care concerning
2110 interrupts. Structure Exn provides some convenience functions that
2111 avoid working directly with raw Interrupt. User code must not absorb
2112 interrupts -- intermediate handling (for cleanup etc.) needs to be
2113 followed by re-raising of the original exception. Another common
2114 source of mistakes are "handle _" patterns, which make the meaning of
2115 the program subject to physical effects of the environment.
2119 New in Isabelle2009-2 (June 2010)
2120 ---------------------------------
2124 * Authentic syntax for *all* logical entities (type classes, type
2125 constructors, term constants): provides simple and robust
2126 correspondence between formal entities and concrete syntax. Within
2127 the parse tree / AST representations, "constants" are decorated by
2128 their category (class, type, const) and spelled out explicitly with
2129 their full internal name.
2131 Substantial INCOMPATIBILITY concerning low-level syntax declarations
2132 and translations (translation rules and translation functions in ML).
2133 Some hints on upgrading:
2135 - Many existing uses of 'syntax' and 'translations' can be replaced
2136 by more modern 'type_notation', 'notation' and 'abbreviation',
2137 which are independent of this issue.
2139 - 'translations' require markup within the AST; the term syntax
2140 provides the following special forms:
2142 CONST c -- produces syntax version of constant c from context
2143 XCONST c -- literally c, checked as constant from context
2144 c -- literally c, if declared by 'syntax'
2146 Plain identifiers are treated as AST variables -- occasionally the
2147 system indicates accidental variables via the error "rhs contains
2150 Type classes and type constructors are marked according to their
2151 concrete syntax. Some old translations rules need to be written
2152 for the "type" category, using type constructor application
2153 instead of pseudo-term application of the default category
2156 - 'parse_translation' etc. in ML may use the following
2159 @{class_syntax c} -- type class c within parse tree / AST
2160 @{term_syntax c} -- type constructor c within parse tree / AST
2161 @{const_syntax c} -- ML version of "CONST c" above
2162 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
2164 - Literal types within 'typed_print_translations', i.e. those *not*
2165 represented as pseudo-terms are represented verbatim. Use @{class
2166 c} or @{type_name c} here instead of the above syntax
2169 Note that old non-authentic syntax was based on unqualified base
2170 names, so all of the above "constant" names would coincide. Recall
2171 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
2172 diagnose syntax problems.
2174 * Type constructors admit general mixfix syntax, not just infix.
2176 * Concrete syntax may be attached to local entities without a proof
2177 body, too. This works via regular mixfix annotations for 'fix',
2178 'def', 'obtain' etc. or via the explicit 'write' command, which is
2179 similar to the 'notation' command in theory specifications.
2181 * Discontinued unnamed infix syntax (legacy feature for many years) --
2182 need to specify constant name and syntax separately. Internal ML
2183 datatype constructors have been renamed from InfixName to Infix etc.
2184 Minor INCOMPATIBILITY.
2186 * Schematic theorem statements need to be explicitly markup as such,
2187 via commands 'schematic_lemma', 'schematic_theorem',
2188 'schematic_corollary'. Thus the relevance of the proof is made
2189 syntactically clear, which impacts performance in a parallel or
2190 asynchronous interactive environment. Minor INCOMPATIBILITY.
2192 * Use of cumulative prems via "!" in some proof methods has been
2193 discontinued (old legacy feature).
2195 * References 'trace_simp' and 'debug_simp' have been replaced by
2196 configuration options stored in the context. Enabling tracing (the
2197 case of debugging is similar) in proofs works via
2199 using [[trace_simp = true]]
2201 Tracing is then active for all invocations of the simplifier in
2202 subsequent goal refinement steps. Tracing may also still be enabled or
2203 disabled via the ProofGeneral settings menu.
2205 * Separate commands 'hide_class', 'hide_type', 'hide_const',
2206 'hide_fact' replace the former 'hide' KIND command. Minor
2209 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
2210 more efficient than combinations with -q1 or -q2.
2215 * Proofterms record type-class reasoning explicitly, using the
2216 "unconstrain" operation internally. This eliminates all sort
2217 constraints from a theorem and proof, introducing explicit
2218 OFCLASS-premises. On the proof term level, this operation is
2219 automatically applied at theorem boundaries, such that closed proofs
2220 are always free of sort constraints. INCOMPATIBILITY for tools that
2221 inspect proof terms.
2223 * Local theory specifications may depend on extra type variables that
2224 are not present in the result type -- arguments TYPE('a) :: 'a itself
2225 are added internally. For example:
2227 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
2229 * Predicates of locales introduced by classes carry a mandatory
2230 "class" prefix. INCOMPATIBILITY.
2232 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
2234 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
2237 * Command 'code_reflect' allows to incorporate generated ML code into
2238 runtime environment; replaces immature code_datatype antiquotation.
2241 * Code generator: simple concept for abstract datatypes obeying
2244 * Code generator: details of internal data cache have no impact on the
2245 user space functionality any longer.
2247 * Methods "unfold_locales" and "intro_locales" ignore non-locale
2248 subgoals. This is more appropriate for interpretations with 'where'.
2251 * Command 'example_proof' opens an empty proof body. This allows to
2252 experiment with Isar, without producing any persistent result.
2254 * Commands 'type_notation' and 'no_type_notation' declare type syntax
2255 within a local theory context, with explicit checking of the
2256 constructors involved (in contrast to the raw 'syntax' versions).
2258 * Commands 'types' and 'typedecl' now work within a local theory
2259 context -- without introducing dependencies on parameters or
2260 assumptions, which is not possible in Isabelle/Pure.
2262 * Command 'defaultsort' has been renamed to 'default_sort', it works
2263 within a local theory context. Minor INCOMPATIBILITY.
2268 * Command 'typedef' now works within a local theory context -- without
2269 introducing dependencies on parameters or assumptions, which is not
2270 possible in Isabelle/Pure/HOL. Note that the logical environment may
2271 contain multiple interpretations of local typedefs (with different
2272 non-emptiness proofs), even in a global theory context.
2274 * New package for quotient types. Commands 'quotient_type' and
2275 'quotient_definition' may be used for defining types and constants by
2276 quotient constructions. An example is the type of integers created by
2277 quotienting pairs of natural numbers:
2280 intrel :: "(nat * nat) => (nat * nat) => bool"
2282 "intrel (x, y) (u, v) = (x + v = u + y)"
2284 quotient_type int = "nat * nat" / intrel
2285 by (auto simp add: equivp_def expand_fun_eq)
2288 "0::int" is "(0::nat, 0::nat)"
2290 The method "lifting" can be used to lift of theorems from the
2291 underlying "raw" type to the quotient type. The example
2292 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
2293 construction and provides a reasoning infrastructure for finite sets.
2295 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
2296 clash with new theory Quotient in Main HOL.
2298 * Moved the SMT binding into the main HOL session, eliminating
2299 separate HOL-SMT session.
2301 * List membership infix mem operation is only an input abbreviation.
2304 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
2305 for future developements; former Library/Word.thy is still present in
2306 the AFP entry RSAPPS.
2308 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
2309 longer shadowed. INCOMPATIBILITY.
2311 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
2314 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
2317 * Dropped normalizing_semiring etc; use the facts in semiring classes
2318 instead. INCOMPATIBILITY.
2320 * Dropped several real-specific versions of lemmas about floor and
2321 ceiling; use the generic lemmas from theory "Archimedean_Field"
2322 instead. INCOMPATIBILITY.
2324 floor_number_of_eq ~> floor_number_of
2325 le_floor_eq_number_of ~> number_of_le_floor
2326 le_floor_eq_zero ~> zero_le_floor
2327 le_floor_eq_one ~> one_le_floor
2328 floor_less_eq_number_of ~> floor_less_number_of
2329 floor_less_eq_zero ~> floor_less_zero
2330 floor_less_eq_one ~> floor_less_one
2331 less_floor_eq_number_of ~> number_of_less_floor
2332 less_floor_eq_zero ~> zero_less_floor
2333 less_floor_eq_one ~> one_less_floor
2334 floor_le_eq_number_of ~> floor_le_number_of
2335 floor_le_eq_zero ~> floor_le_zero
2336 floor_le_eq_one ~> floor_le_one
2337 floor_subtract_number_of ~> floor_diff_number_of
2338 floor_subtract_one ~> floor_diff_one
2339 ceiling_number_of_eq ~> ceiling_number_of
2340 ceiling_le_eq_number_of ~> ceiling_le_number_of
2341 ceiling_le_zero_eq ~> ceiling_le_zero
2342 ceiling_le_eq_one ~> ceiling_le_one
2343 less_ceiling_eq_number_of ~> number_of_less_ceiling
2344 less_ceiling_eq_zero ~> zero_less_ceiling
2345 less_ceiling_eq_one ~> one_less_ceiling
2346 ceiling_less_eq_number_of ~> ceiling_less_number_of
2347 ceiling_less_eq_zero ~> ceiling_less_zero
2348 ceiling_less_eq_one ~> ceiling_less_one
2349 le_ceiling_eq_number_of ~> number_of_le_ceiling
2350 le_ceiling_eq_zero ~> zero_le_ceiling
2351 le_ceiling_eq_one ~> one_le_ceiling
2352 ceiling_subtract_number_of ~> ceiling_diff_number_of
2353 ceiling_subtract_one ~> ceiling_diff_one
2355 * Theory "Finite_Set": various folding_XXX locales facilitate the
2356 application of the various fold combinators on finite sets.
2358 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
2359 provides abstract red-black tree type which is backed by "RBT_Impl" as
2360 implementation. INCOMPATIBILTY.
2362 * Theory Library/Coinductive_List has been removed -- superseded by
2363 AFP/thys/Coinductive.
2365 * Theory PReal, including the type "preal" and related operations, has
2366 been removed. INCOMPATIBILITY.
2368 * Real: new development using Cauchy Sequences.
2370 * Split off theory "Big_Operators" containing setsum, setprod,
2371 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
2373 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
2374 "Int" etc. INCOMPATIBILITY.
2376 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
2378 * New set of rules "ac_simps" provides combined assoc / commute
2379 rewrites for all interpretations of the appropriate generic locales.
2381 * Renamed theory "OrderedGroup" to "Groups" and split theory
2382 "Ring_and_Field" into theories "Rings" and "Fields"; for more
2383 appropriate and more consistent names suitable for name prefixes
2384 within the HOL theories. INCOMPATIBILITY.
2386 * Some generic constants have been put to appropriate theories:
2387 - less_eq, less: Orderings
2388 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
2389 - inverse, divide: Rings
2392 * More consistent naming of type classes involving orderings (and
2395 lower_semilattice ~> semilattice_inf
2396 upper_semilattice ~> semilattice_sup
2398 dense_linear_order ~> dense_linorder
2400 pordered_ab_group_add ~> ordered_ab_group_add
2401 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
2402 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
2403 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
2404 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
2405 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
2406 pordered_cancel_semiring ~> ordered_cancel_semiring
2407 pordered_comm_monoid_add ~> ordered_comm_monoid_add
2408 pordered_comm_ring ~> ordered_comm_ring
2409 pordered_comm_semiring ~> ordered_comm_semiring
2410 pordered_ring ~> ordered_ring
2411 pordered_ring_abs ~> ordered_ring_abs
2412 pordered_semiring ~> ordered_semiring
2414 ordered_ab_group_add ~> linordered_ab_group_add
2415 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
2416 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
2417 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
2418 ordered_field ~> linordered_field
2419 ordered_field_no_lb ~> linordered_field_no_lb
2420 ordered_field_no_ub ~> linordered_field_no_ub
2421 ordered_field_dense_linear_order ~> dense_linordered_field
2422 ordered_idom ~> linordered_idom
2423 ordered_ring ~> linordered_ring
2424 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
2425 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
2426 ordered_ring_strict ~> linordered_ring_strict
2427 ordered_semidom ~> linordered_semidom
2428 ordered_semiring ~> linordered_semiring
2429 ordered_semiring_1 ~> linordered_semiring_1
2430 ordered_semiring_1_strict ~> linordered_semiring_1_strict
2431 ordered_semiring_strict ~> linordered_semiring_strict
2433 The following slightly odd type classes have been moved to a
2434 separate theory Library/Lattice_Algebras:
2436 lordered_ab_group_add ~> lattice_ab_group_add
2437 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
2438 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
2439 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
2440 lordered_ring ~> lattice_ring
2444 * Refined field classes:
2445 - classes division_ring_inverse_zero, field_inverse_zero,
2446 linordered_field_inverse_zero include rule inverse 0 = 0 --
2447 subsumes former division_by_zero class;
2448 - numerous lemmas have been ported from field to division_ring.
2451 * Refined algebra theorem collections:
2452 - dropped theorem group group_simps, use algebra_simps instead;
2453 - dropped theorem group ring_simps, use field_simps instead;
2454 - proper theorem collection field_simps subsumes former theorem
2455 groups field_eq_simps and field_simps;
2456 - dropped lemma eq_minus_self_iff which is a duplicate for
2460 * Theory Finite_Set and List: some lemmas have been generalized from
2463 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
2464 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
2465 inter_Inter_fold_inter ~> inf_Inf_fold_inf
2466 union_Union_fold_union ~> sup_Sup_fold_sup
2467 Inter_fold_inter ~> Inf_fold_inf
2468 Union_fold_union ~> Sup_fold_sup
2469 inter_INTER_fold_inter ~> inf_INFI_fold_inf
2470 union_UNION_fold_union ~> sup_SUPR_fold_sup
2471 INTER_fold_inter ~> INFI_fold_inf
2472 UNION_fold_union ~> SUPR_fold_sup
2474 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
2475 replaced by the more convenient lemmas Inf_empty and Sup_empty.
2476 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
2477 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
2478 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
2479 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
2481 * Reorganized theory Multiset: swapped notation of pointwise and
2484 - pointwise ordering is instance of class order with standard syntax
2486 - multiset ordering has syntax <=# and <#; partial order properties
2487 are provided by means of interpretation with prefix
2489 - less duplication, less historical organization of sections,
2490 conversion from associations lists to multisets, rudimentary code
2492 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
2497 multiset_eq_conv_count_eq ~> multiset_ext_iff
2498 multi_count_ext ~> multiset_ext
2499 diff_union_inverse2 ~> diff_union_cancelR
2503 * Theory Permutation: replaced local "remove" by List.remove1.
2505 * Code generation: ML and OCaml code is decorated with signatures.
2507 * Theory List: added transpose.
2509 * Library/Nat_Bijection.thy is a collection of bijective functions
2510 between nat and other types, which supersedes the older libraries
2511 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
2514 Nat_Int_Bij.nat2_to_nat ~> prod_encode
2515 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
2516 Nat_Int_Bij.int_to_nat_bij ~> int_encode
2517 Nat_Int_Bij.nat_to_int_bij ~> int_decode
2518 Countable.pair_encode ~> prod_encode
2519 NatIso.prod2nat ~> prod_encode
2520 NatIso.nat2prod ~> prod_decode
2521 NatIso.sum2nat ~> sum_encode
2522 NatIso.nat2sum ~> sum_decode
2523 NatIso.list2nat ~> list_encode
2524 NatIso.nat2list ~> list_decode
2525 NatIso.set2nat ~> set_encode
2526 NatIso.nat2set ~> set_decode
2529 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
2530 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
2531 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
2532 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
2533 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
2534 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
2535 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
2536 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
2537 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
2538 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
2539 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
2540 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
2541 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
2544 - Renamed ATP commands:
2545 atp_info ~> sledgehammer running_atps
2546 atp_kill ~> sledgehammer kill_atps
2547 atp_messages ~> sledgehammer messages
2548 atp_minimize ~> sledgehammer minimize
2549 print_atps ~> sledgehammer available_atps
2551 - Added user's manual ("isabelle doc sledgehammer").
2552 - Added option syntax and "sledgehammer_params" to customize
2553 Sledgehammer's behavior. See the manual for details.
2554 - Modified the Isar proof reconstruction code so that it produces
2555 direct proofs rather than proofs by contradiction. (This feature
2556 is still experimental.)
2557 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
2559 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
2562 - Added and implemented "binary_ints" and "bits" options.
2563 - Added "std" option and implemented support for nonstandard models.
2564 - Added and implemented "finitize" option to improve the precision
2565 of infinite datatypes based on a monotonicity analysis.
2566 - Added support for quotient types.
2567 - Added support for "specification" and "ax_specification"
2569 - Added support for local definitions (for "function" and
2570 "termination" proofs).
2571 - Added support for term postprocessors.
2572 - Optimized "Multiset.multiset" and "FinFun.finfun".
2573 - Improved efficiency of "destroy_constrs" optimization.
2574 - Fixed soundness bugs related to "destroy_constrs" optimization and
2576 - Fixed soundness bug related to higher-order constructors.
2577 - Fixed soundness bug when "full_descrs" is enabled.
2578 - Improved precision of set constructs.
2579 - Added "atoms" option.
2580 - Added cache to speed up repeated Kodkod invocations on the same
2582 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
2583 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
2584 "SAT4J_Light". INCOMPATIBILITY.
2585 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
2586 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
2587 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
2589 * Method "induct" now takes instantiations of the form t, where t is not
2590 a variable, as a shorthand for "x == t", where x is a fresh variable.
2591 If this is not intended, t has to be enclosed in parentheses.
2592 By default, the equalities generated by definitional instantiations
2593 are pre-simplified, which may cause parameters of inductive cases
2594 to disappear, or may even delete some of the inductive cases.
2595 Use "induct (no_simp)" instead of "induct" to restore the old
2596 behaviour. The (no_simp) option is also understood by the "cases"
2597 and "nominal_induct" methods, which now perform pre-simplification, too.
2603 * Variable names in lemmas generated by the domain package have
2604 changed; the naming scheme is now consistent with the HOL datatype
2605 package. Some proof scripts may be affected, INCOMPATIBILITY.
2607 * The domain package no longer defines the function "foo_copy" for
2608 recursive domain "foo". The reach lemma is now stated directly in
2609 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
2610 be reformulated in terms of "foo_take", INCOMPATIBILITY.
2612 * Most definedness lemmas generated by the domain package (previously
2613 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
2614 like "foo$x = UU <-> x = UU", which works better as a simp rule.
2615 Proofs that used definedness lemmas as intro rules may break,
2616 potential INCOMPATIBILITY.
2618 * Induction and casedist rules generated by the domain package now
2619 declare proper case_names (one called "bottom", and one named for each
2620 constructor). INCOMPATIBILITY.
2622 * For mutually-recursive domains, separate "reach" and "take_lemma"
2623 rules are generated for each domain, INCOMPATIBILITY.
2625 foo_bar.reach ~> foo.reach bar.reach
2626 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
2628 * Some lemmas generated by the domain package have been renamed for
2629 consistency with the datatype package, INCOMPATIBILITY.
2631 foo.ind ~> foo.induct
2632 foo.finite_ind ~> foo.finite_induct
2633 foo.coind ~> foo.coinduct
2634 foo.casedist ~> foo.exhaust
2635 foo.exhaust ~> foo.nchotomy
2637 * For consistency with other definition packages, the fixrec package
2638 now generates qualified theorem names, INCOMPATIBILITY.
2640 foo_simps ~> foo.simps
2641 foo_unfold ~> foo.unfold
2642 foo_induct ~> foo.induct
2644 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
2645 method and internal fixrec proofs now use the default simpset instead.
2648 * The "contlub" predicate has been removed. Proof scripts should use
2649 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
2651 * The "admw" predicate has been removed, INCOMPATIBILITY.
2653 * The constants cpair, cfst, and csnd have been removed in favor of
2654 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
2659 * Antiquotations for basic formal entities:
2661 @{class NAME} -- type class
2662 @{class_syntax NAME} -- syntax representation of the above
2664 @{type_name NAME} -- logical type
2665 @{type_abbrev NAME} -- type abbreviation
2666 @{nonterminal NAME} -- type of concrete syntactic category
2667 @{type_syntax NAME} -- syntax representation of any of the above
2669 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
2670 @{const_abbrev NAME} -- abbreviated constant
2671 @{const_syntax NAME} -- syntax representation of any of the above
2673 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
2674 syntax constant (cf. 'syntax' command).
2676 * Antiquotation @{make_string} inlines a function to print arbitrary
2677 values similar to the ML toplevel. The result is compiler dependent
2678 and may fall back on "?" in certain situations.
2680 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
2681 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
2682 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
2683 not work with the asynchronous Isar document model.
2685 * Configuration options now admit dynamic default values, depending on
2686 the context or even global references.
2688 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
2689 uses an efficient external library if available (for Poly/ML).
2691 * Renamed some important ML structures, while keeping the old names
2692 for some time as aliases within the structure Legacy:
2694 OuterKeyword ~> Keyword
2697 OuterSyntax ~> Outer_Syntax
2698 PrintMode ~> Print_Mode
2699 SpecParse ~> Parse_Spec
2702 ThyOutput ~> Thy_Output
2703 TypeInfer ~> Type_Infer
2705 Note that "open Legacy" simplifies porting of sources, but forgetting
2706 to remove it again will complicate porting again in the future.
2708 * Most operations that refer to a global context are named
2709 accordingly, e.g. Simplifier.global_context or
2710 ProofContext.init_global. There are some situations where a global
2711 context actually works, but under normal circumstances one needs to
2712 pass the proper local context through the code!
2714 * Discontinued old TheoryDataFun with its copy/init operation -- data
2715 needs to be pure. Functor Theory_Data_PP retains the traditional
2716 Pretty.pp argument to merge, which is absent in the standard
2717 Theory_Data version.
2719 * Sorts.certify_sort and derived "cert" operations for types and terms
2720 no longer minimize sorts. Thus certification at the boundary of the
2721 inference kernel becomes invariant under addition of class relations,
2722 which is an important monotonicity principle. Sorts are now minimized
2723 in the syntax layer only, at the boundary between the end-user and the
2724 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
2725 explicitly in rare situations.
2727 * Renamed old-style Drule.standard to Drule.export_without_context, to
2728 emphasize that this is in no way a standard operation.
2731 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
2732 usual for resolution. Rare INCOMPATIBILITY.
2734 * Renamed varify/unvarify operations to varify_global/unvarify_global
2735 to emphasize that these only work in a global situation (which is
2738 * Curried take and drop in library.ML; negative length is interpreted
2739 as infinity (as in chop). Subtle INCOMPATIBILITY.
2741 * Proof terms: type substitutions on proof constants now use canonical
2742 order of type variables. INCOMPATIBILITY for tools working with proof
2745 * Raw axioms/defs may no longer carry sort constraints, and raw defs
2746 may no longer carry premises. User-level specifications are
2747 transformed accordingly by Thm.add_axiom/add_def.
2752 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
2753 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
2754 proof terms are enabled unconditionally in the new HOL-Proofs image.
2756 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
2757 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
2760 * Old lib/scripts/polyml-platform is superseded by the
2761 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
2762 variant, even on a 64 bit machine. The following example setting
2763 prefers 64 bit if available:
2765 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
2767 * The preliminary Isabelle/jEdit application demonstrates the emerging
2768 Isabelle/Scala layer for advanced prover interaction and integration.
2769 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
2772 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
2773 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
2774 similar to the default assignment of the document preparation system
2775 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
2776 provides some operations for direct access to the font without asking
2777 the user for manual installation.
2781 New in Isabelle2009-1 (December 2009)
2782 -------------------------------------
2786 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
2787 one backslash should be used, even in ML sources.
2792 * Locale interpretation propagates mixins along the locale hierarchy.
2793 The currently only available mixins are the equations used to map
2794 local definitions to terms of the target domain of an interpretation.
2796 * Reactivated diagnostic command 'print_interps'. Use "print_interps
2797 loc" to print all interpretations of locale "loc" in the theory.
2798 Interpretations in proofs are not shown.
2800 * Thoroughly revised locales tutorial. New section on conditional
2803 * On instantiation of classes, remaining undefined class parameters
2804 are formally declared. INCOMPATIBILITY.
2807 *** Document preparation ***
2809 * New generalized style concept for printing terms: @{foo (style) ...}
2810 instead of @{foo_style style ...} (old form is still retained for
2811 backward compatibility). Styles can be also applied for
2812 antiquotations prop, term_type and typeof.
2817 * New proof method "smt" for a combination of first-order logic with
2818 equality, linear and nonlinear (natural/integer/real) arithmetic, and
2819 fixed-size bitvectors; there is also basic support for higher-order
2820 features (esp. lambda abstractions). It is an incomplete decision
2821 procedure based on external SMT solvers using the oracle mechanism;
2822 for the SMT solver Z3, this method is proof-producing. Certificates
2823 are provided to avoid calling the external solvers solely for
2824 re-checking proofs. Due to a remote SMT service there is no need for
2825 installing SMT solvers locally. See src/HOL/SMT.
2827 * New commands to load and prove verification conditions generated by
2828 the Boogie program verifier or derived systems (e.g. the Verifying C
2829 Compiler (VCC) or Spec#). See src/HOL/Boogie.
2831 * New counterexample generator tool 'nitpick' based on the Kodkod
2832 relational model finder. See src/HOL/Tools/Nitpick and
2833 src/HOL/Nitpick_Examples.
2835 * New commands 'code_pred' and 'values' to invoke the predicate
2836 compiler and to enumerate values of inductive predicates.
2838 * A tabled implementation of the reflexive transitive closure.
2840 * New implementation of quickcheck uses generic code generator;
2841 default generators are provided for all suitable HOL types, records
2842 and datatypes. Old quickcheck can be re-activated importing theory
2843 Library/SML_Quickcheck.
2845 * New testing tool Mirabelle for automated proof tools. Applies
2846 several tools and tactics like sledgehammer, metis, or quickcheck, to
2847 every proof step in a theory. To be used in batch mode via the
2848 "mirabelle" utility.
2850 * New proof method "sos" (sum of squares) for nonlinear real
2851 arithmetic (originally due to John Harison). It requires theory
2852 Library/Sum_Of_Squares. It is not a complete decision procedure but
2853 works well in practice on quantifier-free real arithmetic with +, -,
2854 *, ^, =, <= and <, i.e. boolean combinations of equalities and
2855 inequalities between polynomials. It makes use of external
2856 semidefinite programming solvers. Method "sos" generates a
2857 certificate that can be pasted into the proof thus avoiding the need
2858 to call an external tool every time the proof is checked. See
2859 src/HOL/Library/Sum_Of_Squares.
2861 * New method "linarith" invokes existing linear arithmetic decision
2864 * New command 'atp_minimal' reduces result produced by Sledgehammer.
2866 * New Sledgehammer option "Full Types" in Proof General settings menu.
2867 Causes full type information to be output to the ATPs. This slows
2868 ATPs down considerably but eliminates a source of unsound "proofs"
2871 * New method "metisFT": A version of metis that uses full type
2872 information in order to avoid failures of proof reconstruction.
2874 * New evaluator "approximate" approximates an real valued term using
2875 the same method as the approximation method.
2877 * Method "approximate" now supports arithmetic expressions as
2878 boundaries of intervals and implements interval splitting and Taylor
2881 * ML antiquotation @{code_datatype} inserts definition of a datatype
2882 generated by the code generator; e.g. see src/HOL/Predicate.thy.
2884 * New theory SupInf of the supremum and infimum operators for sets of
2887 * New theory Probability, which contains a development of measure
2888 theory, eventually leading to Lebesgue integration and probability.
2890 * Extended Multivariate Analysis to include derivation and Brouwer's
2893 * Reorganization of number theory, INCOMPATIBILITY:
2894 - new number theory development for nat and int, in theories Divides
2895 and GCD as well as in new session Number_Theory
2896 - some constants and facts now suffixed with _nat and _int
2898 - former session NumberTheory now named Old_Number_Theory, including
2899 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
2900 - moved theory Pocklington from src/HOL/Library to
2901 src/HOL/Old_Number_Theory
2903 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
2904 lcm of finite and infinite sets. It is shown that they form a complete
2907 * Class semiring_div requires superclass no_zero_divisors and proof of
2908 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
2909 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
2910 generalized to class semiring_div, subsuming former theorems
2911 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
2912 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
2915 * Refinements to lattice classes and sets:
2916 - less default intro/elim rules in locale variant, more default
2917 intro/elim rules in class variant: more uniformity
2918 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
2920 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
2922 - renamed ACI to inf_sup_aci
2923 - new class "boolean_algebra"
2924 - class "complete_lattice" moved to separate theory
2925 "Complete_Lattice"; corresponding constants (and abbreviations)
2926 renamed and with authentic syntax:
2927 Set.Inf ~> Complete_Lattice.Inf
2928 Set.Sup ~> Complete_Lattice.Sup
2929 Set.INFI ~> Complete_Lattice.INFI
2930 Set.SUPR ~> Complete_Lattice.SUPR
2931 Set.Inter ~> Complete_Lattice.Inter
2932 Set.Union ~> Complete_Lattice.Union
2933 Set.INTER ~> Complete_Lattice.INTER
2934 Set.UNION ~> Complete_Lattice.UNION
2935 - authentic syntax for
2938 - mere abbreviations:
2941 Set.inter (for inf, formerly Set.Int)
2942 Set.union (for sup, formerly Set.Un)
2943 Complete_Lattice.Inter (for Inf)
2944 Complete_Lattice.Union (for Sup)
2945 Complete_Lattice.INTER (for INFI)
2946 Complete_Lattice.UNION (for SUPR)
2947 - object-logic definitions as far as appropriate
2949 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
2950 Un_subset_iff are explicitly deleted as default simp rules; then also
2951 their lattice counterparts le_inf_iff and le_sup_iff have to be
2952 deleted to achieve the desired effect.
2954 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
2955 rules by default any longer; the same applies to min_max.inf_absorb1
2956 etc. INCOMPATIBILITY.
2958 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
2959 pred_set_conv by default. INCOMPATIBILITY.
2961 * Power operations on relations and functions are now one dedicated
2962 constant "compow" with infix syntax "^^". Power operation on
2963 multiplicative monoids retains syntax "^" and is now defined generic
2964 in class power. INCOMPATIBILITY.
2966 * Relation composition "R O S" now has a more standard argument order:
2967 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
2968 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
2969 break, since the O_assoc rule was not rewritten like this. Fix using
2970 O_assoc[symmetric]. The same applies to the curried version "R OO S".
2972 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
2973 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
2976 * Most rules produced by inductive and datatype package have mandatory
2977 prefixes. INCOMPATIBILITY.
2979 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
2980 the attribute of the same name. Each of the theorems in the list
2981 DERIV_intros assumes composition with an additional function and
2982 matches a variable to the derivative, which has to be solved by the
2983 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
2984 of most elementary terms. Former Maclauren.DERIV_tac and
2985 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
2988 * Code generator attributes follow the usual underscore convention:
2989 code_unfold replaces code unfold
2990 code_post replaces code post
2995 sizechange -> size_change
2996 induct_scheme -> induction_schema
2999 * Discontinued abbreviation "arbitrary" of constant "undefined".
3000 INCOMPATIBILITY, use "undefined" directly.
3003 Suc_eq_add_numeral_1 -> Suc_eq_plus1
3004 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
3005 Suc_plus1 -> Suc_eq_plus1
3006 *anti_sym -> *antisym*
3007 vector_less_eq_def -> vector_le_def
3010 * Added theorem List.map_map as [simp]. Removed List.map_compose.
3013 * Removed predicate "M hassize n" (<--> card M = n & finite M).
3019 * Theory Representable defines a class "rep" of domains that are
3020 representable (via an ep-pair) in the universal domain type "udom".
3021 Instances are provided for all type constructors defined in HOLCF.
3023 * The 'new_domain' command is a purely definitional version of the
3024 domain package, for representable domains. Syntax is identical to the
3025 old domain package. The 'new_domain' package also supports indirect
3026 recursion using previously-defined type constructors. See
3027 src/HOLCF/ex/New_Domain.thy for examples.
3029 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
3030 on the left-hand side of an equation, and then performs
3031 simplification. Rewriting is done using rules declared with the
3032 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
3033 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
3035 * The pattern-match compiler in 'fixrec' can now handle constructors
3036 with HOL function types. Pattern-match combinators for the Pair
3037 constructor are pre-configured.
3039 * The 'fixrec' package now produces better fixed-point induction rules
3040 for mutually-recursive definitions: Induction rules have conclusions
3041 of the form "P foo bar" instead of "P <foo, bar>".
3043 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
3044 been renamed to "below". The name "below" now replaces "less" in many
3045 theorem names. (Legacy theorem names using "less" are still supported
3048 * The 'fixrec' package now supports "bottom patterns". Bottom
3049 patterns can be used to generate strictness rules, or to make
3050 functions more strict (much like the bang-patterns supported by the
3051 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
3057 * Support for Poly/ML 5.3.0, with improved reporting of compiler
3058 errors and run-time exceptions, including detailed source positions.
3060 * Structure Name_Space (formerly NameSpace) now manages uniquely
3061 identified entries, with some additional information such as source
3062 position, logical grouping etc.
3064 * Theory and context data is now introduced by the simplified and
3065 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
3066 to be pure, but the old TheoryDataFun for mutable data (with explicit
3067 copy operation) is still available for some time.
3069 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
3070 provides a high-level programming interface to synchronized state
3071 variables with atomic update. This works via pure function
3072 application within a critical section -- its runtime should be as
3073 short as possible; beware of deadlocks if critical code is nested,
3074 either directly or indirectly via other synchronized variables!
3076 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
3077 wraps raw ML references, explicitly indicating their non-thread-safe
3078 behaviour. The Isar toplevel keeps this structure open, to
3079 accommodate Proof General as well as quick and dirty interactive
3080 experiments with references.
3082 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
3083 parallel tactical reasoning.
3085 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
3086 are similar to SUBPROOF, but are slightly more flexible: only the
3087 specified parts of the subgoal are imported into the context, and the
3088 body tactic may introduce new subgoals and schematic variables.
3090 * Old tactical METAHYPS, which does not observe the proof context, has
3091 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
3092 or Subgoal.FOCUS etc.
3094 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
3095 functors have their own ML name space there is no point to mark them
3096 separately.) Minor INCOMPATIBILITY.
3098 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
3100 * Renamed several structures FooBar to Foo_Bar. Occasional,
3103 * Operations of structure Skip_Proof no longer require quick_and_dirty
3104 mode, which avoids critical setmp.
3106 * Eliminated old Attrib.add_attributes, Method.add_methods and related
3107 combinators for "args". INCOMPATIBILITY, need to use simplified
3108 Attrib/Method.setup introduced in Isabelle2009.
3110 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
3111 back on global_simpset_of, global_claset_of, global_clasimpset_of as
3112 last resort. INCOMPATIBILITY.
3114 * Display.pretty_thm now requires a proper context (cf. former
3115 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
3116 or even Display.pretty_thm_without_context as last resort.
3119 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
3120 Syntax.pretty_typ/term directly, preferably with proper context
3121 instead of global theory.
3126 * Further fine tuning of parallel proof checking, scales up to 8 cores
3127 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
3130 * Support for additional "Isabelle components" via etc/components, see
3131 also the system manual.
3133 * The isabelle makeall tool now operates on all components with
3134 IsaMakefile, not just hardwired "logics".
3136 * Removed "compress" option from isabelle-process and isabelle usedir;
3137 this is always enabled.
3139 * Discontinued support for Poly/ML 4.x versions.
3141 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
3142 on a given logic image. This requires the lighttpd webserver and is
3143 currently supported on Linux only.
3147 New in Isabelle2009 (April 2009)
3148 --------------------------------
3152 * Simplified main Isabelle executables, with less surprises on
3153 case-insensitive file-systems (such as Mac OS).
3155 - The main Isabelle tool wrapper is now called "isabelle" instead of
3158 - The former "isabelle" alias for "isabelle-process" has been
3159 removed (should rarely occur to regular users).
3161 - The former "isabelle-interface" and its alias "Isabelle" have been
3162 removed (interfaces are now regular Isabelle tools).
3164 Within scripts and make files, the Isabelle environment variables
3165 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
3166 respectively. (The latter are still available as legacy feature.)
3168 The old isabelle-interface wrapper could react in confusing ways if
3169 the interface was uninstalled or changed otherwise. Individual
3170 interface tool configuration is now more explicit, see also the
3171 Isabelle system manual. In particular, Proof General is now available
3172 via "isabelle emacs".
3174 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
3175 purge installed copies of Isabelle executables and re-run "isabelle
3176 install -p ...", or use symlinks.
3178 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
3179 old ~/isabelle, which was slightly non-standard and apt to cause
3180 surprises on case-insensitive file-systems (such as Mac OS).
3182 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
3183 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
3184 care is required when using older releases of Isabelle. Note that
3185 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
3186 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
3188 * Proofs of fully specified statements are run in parallel on
3189 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
3190 a regular 4-core machine, if the initial heap space is made reasonably
3191 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
3193 * The main reference manuals ("isar-ref", "implementation", and
3194 "system") have been updated and extended. Formally checked references
3195 as hyperlinks are now available uniformly.
3200 * Complete re-implementation of locales. INCOMPATIBILITY in several
3201 respects. The most important changes are listed below. See the
3202 Tutorial on Locales ("locales" manual) for details.
3204 - In locale expressions, instantiation replaces renaming. Parameters
3205 must be declared in a for clause. To aid compatibility with previous
3206 parameter inheritance, in locale declarations, parameters that are not
3207 'touched' (instantiation position "_" or omitted) are implicitly added
3208 with their syntax at the beginning of the for clause.
3210 - Syntax from abbreviations and definitions in locales is available in
3211 locale expressions and context elements. The latter is particularly
3212 useful in locale declarations.
3214 - More flexible mechanisms to qualify names generated by locale
3215 expressions. Qualifiers (prefixes) may be specified in locale
3216 expressions, and can be marked as mandatory (syntax: "name!:") or
3217 optional (syntax "name?:"). The default depends for plain "name:"
3218 depends on the situation where a locale expression is used: in
3219 commands 'locale' and 'sublocale' prefixes are optional, in
3220 'interpretation' and 'interpret' prefixes are mandatory. The old
3221 implicit qualifiers derived from the parameter names of a locale are
3222 no longer generated.
3224 - Command "sublocale l < e" replaces "interpretation l < e". The
3225 instantiation clause in "interpretation" and "interpret" (square
3226 brackets) is no longer available. Use locale expressions.
3228 - When converting proof scripts, mandatory qualifiers in
3229 'interpretation' and 'interpret' should be retained by default, even
3230 if this is an INCOMPATIBILITY compared to former behavior. In the
3231 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
3232 in locale expressions range over a single locale instance only.
3234 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
3235 In existing theorem specifications replace the includes element by the
3236 respective context elements of the included locale, omitting those
3237 that are already present in the theorem specification. Multiple
3238 assume elements of a locale should be replaced by a single one
3239 involving the locale predicate. In the proof body, declarations (most
3240 notably theorems) may be regained by interpreting the respective
3241 locales in the proof context as required (command "interpret").
3243 If using "includes" in replacement of a target solely because the
3244 parameter types in the theorem are not as general as in the target,
3245 consider declaring a new locale with additional type constraints on
3246 the parameters (context element "constrains").
3248 - Discontinued "locale (open)". INCOMPATIBILITY.
3250 - Locale interpretation commands no longer attempt to simplify goal.
3251 INCOMPATIBILITY: in rare situations the generated goal differs. Use
3252 methods intro_locales and unfold_locales to clarify.
3254 - Locale interpretation commands no longer accept interpretation
3255 attributes. INCOMPATIBILITY.
3257 * Class declaration: so-called "base sort" must not be given in import
3258 list any longer, but is inferred from the specification. Particularly
3265 class foo = type + ...
3267 * Class target: global versions of theorems stemming do not carry a
3268 parameter prefix any longer. INCOMPATIBILITY.
3270 * Class 'instance' command no longer accepts attached definitions.
3271 INCOMPATIBILITY, use proper 'instantiation' target instead.
3273 * Recovered hiding of consts, which was accidentally broken in
3274 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
3275 makes c inaccessible; consider using ``hide (open) const c'' instead.
3277 * Slightly more coherent Pure syntax, with updated documentation in
3278 isar-ref manual. Removed locales meta_term_syntax and
3279 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
3280 INCOMPATIBILITY in rare situations. Note that &&& should not be used
3281 directly in regular applications.
3283 * There is a new syntactic category "float_const" for signed decimal
3284 fractions (e.g. 123.45 or -123.45).
3286 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
3287 interface with 'setup' command instead.
3289 * Command 'local_setup' is similar to 'setup', but operates on a local
3292 * The 'axiomatization' command now only works within a global theory
3293 context. INCOMPATIBILITY.
3295 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
3296 hypotheses. Sorts required in the course of reasoning need to be
3297 covered by the constraints in the initial statement, completed by the
3298 type instance information of the background theory. Non-trivial sort
3299 hypotheses, which rarely occur in practice, may be specified via
3300 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
3302 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
3304 The result contains an implicit sort hypotheses as before --
3305 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
3308 * Generalized Isar history, with support for linear undo, direct state
3311 * Changed defaults for unify configuration options:
3313 unify_trace_bound = 50 (formerly 25)
3314 unify_search_bound = 60 (formerly 30)
3316 * Different bookkeeping for code equations (INCOMPATIBILITY):
3318 a) On theory merge, the last set of code equations for a particular
3319 constant is taken (in accordance with the policy applied by other
3320 parts of the code generator framework).
3322 b) Code equations stemming from explicit declarations (e.g. code
3323 attribute) gain priority over default code equations stemming
3324 from definition, primrec, fun etc.
3326 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
3328 * Unified theorem tables for both code generators. Thus [code
3329 func] has disappeared and only [code] remains. INCOMPATIBILITY.
3331 * Command 'find_consts' searches for constants based on type and name
3334 find_consts "_ => bool"
3336 By default, matching is against subtypes, but it may be restricted to
3337 the whole type. Searching by name is possible. Multiple queries are
3338 conjunctive and queries may be negated by prefixing them with a
3341 find_consts strict: "_ => bool" name: "Int" -"int => int"
3343 * New 'find_theorems' criterion "solves" matches theorems that
3344 directly solve the current goal (modulo higher-order unification).
3346 * Auto solve feature for main theorem statements: whenever a new goal
3347 is stated, "find_theorems solves" is called; any theorems that could
3348 solve the lemma directly are listed as part of the goal state.
3349 Cf. associated options in Proof General Isabelle settings menu,
3350 enabled by default, with reasonable timeout for pathological cases of
3351 higher-order unification.
3354 *** Document preparation ***
3356 * Antiquotation @{lemma} now imitates a regular terminal proof,
3357 demanding keyword 'by' and supporting the full method expression
3358 syntax just like the Isar command 'by'.
3363 * Integrated main parts of former image HOL-Complex with HOL. Entry
3364 points Main and Complex_Main remain as before.
3366 * Logic image HOL-Plain provides a minimal HOL with the most important
3367 tools available (inductive, datatype, primrec, ...). This facilitates
3368 experimentation and tool development. Note that user applications
3369 (and library theories) should never refer to anything below theory
3372 * Logic image HOL-Main stops at theory Main, and thus facilitates
3373 experimentation due to shorter build times.
3375 * Logic image HOL-NSA contains theories of nonstandard analysis which
3376 were previously part of former HOL-Complex. Entry point Hyperreal
3377 remains valid, but theories formerly using Complex_Main should now use
3378 new entry point Hypercomplex.
3380 * Generic ATP manager for Sledgehammer, based on ML threads instead of
3381 Posix processes. Avoids potentially expensive forking of the ML
3382 process. New thread-based implementation also works on non-Unix
3383 platforms (Cygwin). Provers are no longer hardwired, but defined
3384 within the theory via plain ML wrapper functions. Basic Sledgehammer
3385 commands are covered in the isar-ref manual.
3387 * Wrapper scripts for remote SystemOnTPTP service allows to use
3388 sledgehammer without local ATP installation (Vampire etc.). Other
3389 provers may be included via suitable ML wrappers, see also
3390 src/HOL/ATP_Linkup.thy.
3392 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
3395 * The metis method no longer fails because the theorem is too trivial
3396 (contains the empty clause).
3398 * The metis method now fails in the usual manner, rather than raising
3399 an exception, if it determines that it cannot prove the theorem.
3401 * Method "coherent" implements a prover for coherent logic (see also
3402 src/Tools/coherent.ML).
3404 * Constants "undefined" and "default" replace "arbitrary". Usually
3405 "undefined" is the right choice to replace "arbitrary", though
3406 logically there is no difference. INCOMPATIBILITY.
3408 * Command "value" now integrates different evaluation mechanisms. The
3409 result of the first successful evaluation mechanism is printed. In
3410 square brackets a particular named evaluation mechanisms may be
3411 specified (currently, [SML], [code] or [nbe]). See further
3412 src/HOL/ex/Eval_Examples.thy.
3414 * Normalization by evaluation now allows non-leftlinear equations.
3415 Declare with attribute [code nbe].
3417 * Methods "case_tac" and "induct_tac" now refer to the very same rules
3418 as the structured Isar versions "cases" and "induct", cf. the
3419 corresponding "cases" and "induct" attributes. Mutual induction rules
3420 are now presented as a list of individual projections
3421 (e.g. foo_bar.inducts for types foo and bar); the old format with
3422 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
3423 rare situations a different rule is selected --- notably nested tuple
3424 elimination instead of former prod.exhaust: use explicit (case_tac t
3425 rule: prod.exhaust) here.
3427 * Attributes "cases", "induct", "coinduct" support "del" option.
3429 * Removed fact "case_split_thm", which duplicates "case_split".
3431 * The option datatype has been moved to a new theory Option. Renamed
3432 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
3434 * New predicate "strict_mono" classifies strict functions on partial
3435 orders. With strict functions on linear orders, reasoning about
3436 (in)equalities is facilitated by theorems "strict_mono_eq",
3437 "strict_mono_less_eq" and "strict_mono_less".
3439 * Some set operations are now proper qualified constants with
3440 authentic syntax. INCOMPATIBILITY:
3451 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
3454 * Auxiliary class "itself" has disappeared -- classes without any
3455 parameter are treated as expected by the 'class' command.
3457 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
3459 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
3460 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
3462 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
3463 method "approximation". It proves formulas on real values by using
3464 interval arithmetic. In the formulas are also the transcendental
3465 functions sin, cos, tan, atan, ln, exp and the constant pi are
3466 allowed. For examples see
3467 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
3469 * Theory "Reflection" now resides in HOL/Library.
3471 * Entry point to Word library now simply named "Word".
3474 * Made source layout more coherent with logical distribution
3477 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
3478 src/HOL/Library/Code_Message.thy ~> src/HOL/
3479 src/HOL/Library/GCD.thy ~> src/HOL/
3480 src/HOL/Library/Order_Relation.thy ~> src/HOL/
3481 src/HOL/Library/Parity.thy ~> src/HOL/
3482 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
3483 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
3484 src/HOL/Real/Lubs.thy ~> src/HOL/
3485 src/HOL/Real/PReal.thy ~> src/HOL/
3486 src/HOL/Real/Rational.thy ~> src/HOL/
3487 src/HOL/Real/RComplete.thy ~> src/HOL/
3488 src/HOL/Real/RealDef.thy ~> src/HOL/
3489 src/HOL/Real/RealPow.thy ~> src/HOL/
3490 src/HOL/Real/Real.thy ~> src/HOL/
3491 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
3492 src/HOL/Complex/Complex.thy ~> src/HOL/
3493 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
3494 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
3495 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
3496 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
3497 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
3498 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
3499 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
3500 src/HOL/Hyperreal/Log.thy ~> src/HOL/
3501 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
3502 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
3503 src/HOL/Hyperreal/Series.thy ~> src/HOL/
3504 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
3505 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
3506 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
3507 src/HOL/Real/Float ~> src/HOL/Library/
3508 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
3509 src/HOL/Real/RealVector.thy ~> src/HOL/
3511 src/HOL/arith_data.ML ~> src/HOL/Tools
3512 src/HOL/hologic.ML ~> src/HOL/Tools
3513 src/HOL/simpdata.ML ~> src/HOL/Tools
3514 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
3515 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
3516 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
3517 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
3518 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
3519 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
3520 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
3522 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
3523 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
3524 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
3525 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
3526 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
3527 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
3529 * If methods "eval" and "evaluation" encounter a structured proof
3530 state with !!/==>, only the conclusion is evaluated to True (if
3531 possible), avoiding strange error messages.
3533 * Method "sizechange" automates termination proofs using (a
3534 modification of) the size-change principle. Requires SAT solver. See
3535 src/HOL/ex/Termination.thy for examples.
3537 * Simplifier: simproc for let expressions now unfolds if bound
3538 variable occurs at most once in let expression body. INCOMPATIBILITY.
3540 * Method "arith": Linear arithmetic now ignores all inequalities when
3541 fast_arith_neq_limit is exceeded, instead of giving up entirely.
3543 * New attribute "arith" for facts that should always be used
3544 automatically by arithmetic. It is intended to be used locally in
3547 assumes [arith]: "x > 0"
3549 Global usage is discouraged because of possible performance impact.
3551 * New classes "top" and "bot" with corresponding operations "top" and
3552 "bot" in theory Orderings; instantiation of class "complete_lattice"
3553 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
3555 * Changed definition lemma "less_fun_def" in order to provide an
3556 instance for preorders on functions; use lemma "less_le" instead.
3559 * Theory Orderings: class "wellorder" moved here, with explicit
3560 induction rule "less_induct" as assumption. For instantiation of
3561 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
3564 * Theory Orderings: added class "preorder" as superclass of "order".
3565 INCOMPATIBILITY: Instantiation proofs for order, linorder
3566 etc. slightly changed. Some theorems named order_class.* now named
3569 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
3572 * Theory Finite_Set: added a new fold combinator of type
3574 ('a => 'b => 'b) => 'b => 'a set => 'b
3576 Occasionally this is more convenient than the old fold combinator
3577 which is now defined in terms of the new one and renamed to
3580 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
3581 and "ring_simps" have been replaced by "algebra_simps" (which can be
3582 extended with further lemmas!). At the moment both still exist but
3583 the former will disappear at some point.
3585 * Theory Power: Lemma power_Suc is now declared as a simp rule in
3586 class recpower. Type-specific simp rules for various recpower types
3587 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
3589 rat_power_0 -> power_0
3590 rat_power_Suc -> power_Suc
3591 realpow_0 -> power_0
3592 realpow_Suc -> power_Suc
3593 complexpow_0 -> power_0
3594 complexpow_Suc -> power_Suc
3595 power_poly_0 -> power_0
3596 power_poly_Suc -> power_Suc
3598 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
3599 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
3600 dvd has been generalized to class comm_semiring_1. Likewise a bunch
3601 of lemmas from Divides has been generalized from nat to class
3602 semiring_div. INCOMPATIBILITY. This involves the following theorem
3603 renames resulting from duplicate elimination:
3605 dvd_def_mod ~> dvd_eq_mod_eq_0
3606 zero_dvd_iff ~> dvd_0_left_iff
3607 dvd_0 ~> dvd_0_right
3608 DIVISION_BY_ZERO_DIV ~> div_by_0
3609 DIVISION_BY_ZERO_MOD ~> mod_by_0
3610 mult_div ~> div_mult_self2_is_id
3611 mult_mod ~> mod_mult_self2_is_0
3613 * Theory IntDiv: removed many lemmas that are instances of class-based
3614 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
3615 rename old lemmas as follows:
3617 dvd_diff -> nat_dvd_diff
3618 dvd_zminus_iff -> dvd_minus_iff
3619 mod_add1_eq -> mod_add_eq
3620 mod_mult1_eq -> mod_mult_right_eq
3621 mod_mult1_eq' -> mod_mult_left_eq
3622 mod_mult_distrib_mod -> mod_mult_eq
3623 nat_mod_add_left_eq -> mod_add_left_eq
3624 nat_mod_add_right_eq -> mod_add_right_eq
3625 nat_mod_div_trivial -> mod_div_trivial
3626 nat_mod_mod_trivial -> mod_mod_trivial
3627 zdiv_zadd_self1 -> div_add_self1
3628 zdiv_zadd_self2 -> div_add_self2
3629 zdiv_zmult_self1 -> div_mult_self2_is_id
3630 zdiv_zmult_self2 -> div_mult_self1_is_id
3631 zdvd_triv_left -> dvd_triv_left
3632 zdvd_triv_right -> dvd_triv_right
3633 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
3634 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
3635 zmod_zadd_left_eq -> mod_add_left_eq
3636 zmod_zadd_right_eq -> mod_add_right_eq
3637 zmod_zadd_self1 -> mod_add_self1
3638 zmod_zadd_self2 -> mod_add_self2
3639 zmod_zadd1_eq -> mod_add_eq
3640 zmod_zdiff1_eq -> mod_diff_eq
3641 zmod_zdvd_zmod -> mod_mod_cancel
3642 zmod_zmod_cancel -> mod_mod_cancel
3643 zmod_zmult_self1 -> mod_mult_self2_is_0
3644 zmod_zmult_self2 -> mod_mult_self1_is_0
3647 zdvd_abs1 -> abs_dvd_iff
3648 zdvd_abs2 -> dvd_abs_iff
3649 zdvd_refl -> dvd_refl
3650 zdvd_trans -> dvd_trans
3651 zdvd_zadd -> dvd_add
3652 zdvd_zdiff -> dvd_diff
3653 zdvd_zminus_iff -> dvd_minus_iff
3654 zdvd_zminus2_iff -> minus_dvd_iff
3655 zdvd_zmultD -> dvd_mult_right
3656 zdvd_zmultD2 -> dvd_mult_left
3657 zdvd_zmult_mono -> mult_dvd_mono
3658 zdvd_0_right -> dvd_0_right
3659 zdvd_0_left -> dvd_0_left_iff
3660 zdvd_1_left -> one_dvd
3661 zminus_dvd_iff -> minus_dvd_iff
3663 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
3665 * The real numbers offer decimal input syntax: 12.34 is translated
3666 into 1234/10^2. This translation is not reversed upon output.
3668 * Theory Library/Polynomial defines an abstract type 'a poly of
3669 univariate polynomials with coefficients of type 'a. In addition to
3670 the standard ring operations, it also supports div and mod. Code
3671 generation is also supported, using list-style constructors.
3673 * Theory Library/Inner_Product defines a class of real_inner for real
3674 inner product spaces, with an overloaded operation inner :: 'a => 'a
3675 => real. Class real_inner is a subclass of real_normed_vector from
3678 * Theory Library/Product_Vector provides instances for the product
3679 type 'a * 'b of several classes from RealVector and Inner_Product.
3680 Definitions of addition, subtraction, scalar multiplication, norms,
3681 and inner products are included.
3683 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
3684 addition to the field operations, numerals and case syntax are also
3687 * Theory Library/Diagonalize provides constructive version of Cantor's
3688 first diagonalization argument.
3690 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
3691 zlcm (for int); carried together from various gcd/lcm developements in
3692 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
3693 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
3694 may recover tupled syntax as follows:
3696 hide (open) const gcd
3697 abbreviation gcd where
3698 "gcd == (%(a, b). GCD.gcd a b)"
3700 GCD.gcd ("gcd '(_, _')")
3702 The same works for lcm, zgcd, zlcm.
3704 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
3705 instantiations for algebraic structures. Removed some duplicate
3706 theorems. Changes in simp rules. INCOMPATIBILITY.
3708 * ML antiquotation @{code} takes a constant as argument and generates
3709 corresponding code in background and inserts name of the corresponding
3710 resulting ML value/function/datatype constructor binding in place.
3711 All occurrences of @{code} with a single ML block are generated
3712 simultaneously. Provides a generic and safe interface for
3713 instrumentalizing code generation. See
3714 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
3715 In future you ought to refrain from ad-hoc compiling generated SML
3716 code on the ML toplevel. Note that (for technical reasons) @{code}
3717 cannot refer to constants for which user-defined serializations are
3718 set. Refer to the corresponding ML counterpart directly in that
3721 * Command 'rep_datatype': instead of theorem names the command now
3722 takes a list of terms denoting the constructors of the type to be
3723 represented as datatype. The characteristic theorems have to be
3724 proven. INCOMPATIBILITY. Also observe that the following theorems
3725 have disappeared in favour of existing ones:
3727 unit_induct ~> unit.induct
3728 prod_induct ~> prod.induct
3729 sum_induct ~> sum.induct
3730 Suc_Suc_eq ~> nat.inject
3731 Suc_not_Zero Zero_not_Suc ~> nat.distinct
3736 * New locales for orders and lattices where the equivalence relation
3737 is not restricted to equality. INCOMPATIBILITY: all order and lattice
3738 locales use a record structure with field eq for the equivalence.
3740 * New theory of factorial domains.
3742 * Units_l_inv and Units_r_inv are now simp rules by default.
3743 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
3744 and/or r_inv will now also require deletion of these lemmas.
3746 * Renamed the following theorems, INCOMPATIBILITY:
3748 UpperD ~> Upper_memD
3749 LowerD ~> Lower_memD
3750 least_carrier ~> least_closed
3751 greatest_carrier ~> greatest_closed
3752 greatest_Lower_above ~> greatest_Lower_below
3753 one_zero ~> carrier_one_zero
3754 one_not_zero ~> carrier_one_not_zero (collision with assumption)
3759 * Nominal datatypes can now contain type-variables.
3761 * Commands 'nominal_inductive' and 'equivariance' work with local
3764 * Nominal primrec can now works with local theory targets and its
3765 specification syntax now conforms to the general format as seen in
3768 * Method "perm_simp" honours the standard simplifier attributes
3769 (no_asm), (no_asm_use) etc.
3771 * The new predicate #* is defined like freshness, except that on the
3772 left hand side can be a set or list of atoms.
3774 * Experimental command 'nominal_inductive2' derives strong induction
3775 principles for inductive definitions. In contrast to
3776 'nominal_inductive', which can only deal with a fixed number of
3777 binders, it can deal with arbitrary expressions standing for sets of
3778 atoms to be avoided. The only inductive definition we have at the
3779 moment that needs this generalisation is the typing rule for Lets in
3782 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
3783 -----------------------------------------------------------------
3784 Gamma |- Let x be t1 in t2 : T2
3786 In this rule one wants to avoid all the binders that are introduced by
3787 "close Gamma T1". We are looking for other examples where this
3788 feature might be useful. Please let us know.
3793 * Reimplemented the simplification procedure for proving continuity
3794 subgoals. The new simproc is extensible; users can declare additional
3795 continuity introduction rules with the attribute [cont2cont].
3797 * The continuity simproc now uses a different introduction rule for
3798 solving continuity subgoals on terms with lambda abstractions. In
3799 some rare cases the new simproc may fail to solve subgoals that the
3800 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
3801 Potential INCOMPATIBILITY.
3803 * Command 'fixrec': specification syntax now conforms to the general
3804 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
3805 examples. INCOMPATIBILITY.
3810 * Proof of Zorn's Lemma for partial orders.
3815 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
3816 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
3817 depends on multithreading, so timouts will not work before Poly/ML
3820 * High-level support for concurrent ML programming, see
3821 src/Pure/Cuncurrent. The data-oriented model of "future values" is
3822 particularly convenient to organize independent functional
3823 computations. The concept of "synchronized variables" provides a
3824 higher-order interface for components with shared state, avoiding the
3825 delicate details of mutexes and condition variables. (Requires
3826 Poly/ML 5.2.1 or later.)
3828 * ML bindings produced via Isar commands are stored within the Isar
3829 context (theory or proof). Consequently, commands like 'use' and 'ML'
3830 become thread-safe and work with undo as expected (concerning
3831 top-level bindings, not side-effects on global references).
3832 INCOMPATIBILITY, need to provide proper Isar context when invoking the
3833 compiler at runtime; really global bindings need to be given outside a
3834 theory. (Requires Poly/ML 5.2 or later.)
3836 * Command 'ML_prf' is analogous to 'ML' but works within a proof
3837 context. Top-level ML bindings are stored within the proof context in
3838 a purely sequential fashion, disregarding the nested proof structure.
3839 ML bindings introduced by 'ML_prf' are discarded at the end of the
3840 proof. (Requires Poly/ML 5.2 or later.)
3842 * Simplified ML attribute and method setup, cf. functions Attrib.setup
3843 and Method.setup, as well as Isar commands 'attribute_setup' and
3844 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
3845 existing code accordingly, or use plain 'setup' together with old
3848 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
3849 to 'a -> thm, while results are always tagged with an authentic oracle
3850 name. The Isar command 'oracle' is now polymorphic, no argument type
3851 is specified. INCOMPATIBILITY, need to simplify existing oracle code
3852 accordingly. Note that extra performance may be gained by producing
3853 the cterm carefully, avoiding slow Thm.cterm_of.
3855 * Simplified interface for defining document antiquotations via
3856 ThyOutput.antiquotation, ThyOutput.output, and optionally
3857 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
3858 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
3861 * More systematic treatment of long names, abstract name bindings, and
3862 name space operations. Basic operations on qualified names have been
3863 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
3864 Long_Name.append. Old type bstring has been mostly replaced by
3865 abstract type binding (see structure Binding), which supports precise
3866 qualification by packages and local theory targets, as well as proper
3867 tracking of source positions. INCOMPATIBILITY, need to wrap old
3868 bstring values into Binding.name, or better pass through abstract
3869 bindings everywhere. See further src/Pure/General/long_name.ML,
3870 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
3872 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
3873 LocalTheory.note etc.) now refer to the *full* internal name, not the
3874 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
3876 * Disposed old type and term read functions (Sign.read_def_typ,
3877 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
3878 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
3879 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
3880 Syntax.read_term_global etc.; see also OldGoals.read_term as last
3881 resort for legacy applications.
3883 * Disposed old declarations, tactics, tactic combinators that refer to
3884 the simpset or claset of an implicit theory (such as Addsimps,
3885 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
3886 embedded ML text, or local_simpset_of with a proper context passed as
3887 explicit runtime argument.
3889 * Rules and tactics that read instantiations (read_instantiate,
3890 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
3891 context, which is required for parsing and type-checking. Moreover,
3892 the variables are specified as plain indexnames, not string encodings
3893 thereof. INCOMPATIBILITY.
3895 * Generic Toplevel.add_hook interface allows to analyze the result of
3896 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
3897 for theorem dependency output of transactions resulting in a new
3900 * ML antiquotations: block-structured compilation context indicated by
3901 \<lbrace> ... \<rbrace>; additional antiquotation forms:
3903 @{binding name} - basic name binding
3904 @{let ?pat = term} - term abbreviation (HO matching)
3905 @{note name = fact} - fact abbreviation
3906 @{thm fact} - singleton fact (with attributes)
3907 @{thms fact} - general fact (with attributes)
3908 @{lemma prop by method} - singleton goal
3909 @{lemma prop by meth1 meth2} - singleton goal
3910 @{lemma prop1 ... propN by method} - general goal
3911 @{lemma prop1 ... propN by meth1 meth2} - general goal
3912 @{lemma (open) ...} - open derivation
3917 * The Isabelle "emacs" tool provides a specific interface to invoke
3918 Proof General / Emacs, with more explicit failure if that is not
3919 installed (the old isabelle-interface script silently falls back on
3920 isabelle-process). The PROOFGENERAL_HOME setting determines the
3921 installation location of the Proof General distribution.
3923 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
3924 the Isabelle process into a JVM/Scala application. See
3925 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
3926 process wrapper has been discontinued.)
3928 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
3930 * Various status messages (with exact source position information) are
3931 emitted, if proper markup print mode is enabled. This allows
3932 user-interface components to provide detailed feedback on internal
3937 New in Isabelle2008 (June 2008)
3938 -------------------------------
3942 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
3943 and updated, with formally checked references as hyperlinks.
3945 * Theory loader: use_thy (and similar operations) no longer set the
3946 implicit ML context, which was occasionally hard to predict and in
3947 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
3948 provides a proper context already.
3950 * Theory loader: old-style ML proof scripts being *attached* to a thy
3951 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
3952 'use' within a theory file will do the job.
3954 * Name space merge now observes canonical order, i.e. the second space
3955 is inserted into the first one, while existing entries in the first
3956 space take precedence. INCOMPATIBILITY in rare situations, may try to
3957 swap theory imports.
3959 * Syntax: symbol \<chi> is now considered a letter. Potential
3960 INCOMPATIBILITY in identifier syntax etc.
3962 * Outer syntax: string tokens no longer admit escaped white space,
3963 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
3964 white space without escapes.
3966 * Outer syntax: string tokens may contain arbitrary character codes
3967 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
3973 * Context-dependent token translations. Default setup reverts locally
3974 fixed variables, and adds hilite markup for undeclared frees.
3976 * Unused theorems can be found using the new command 'unused_thms'.
3977 There are three ways of invoking it:
3980 Only finds unused theorems in the current theory.
3982 (2) unused_thms thy_1 ... thy_n -
3983 Finds unused theorems in the current theory and all of its ancestors,
3984 excluding the theories thy_1 ... thy_n and all of their ancestors.
3986 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
3987 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
3988 their ancestors, excluding the theories thy_1 ... thy_n and all of
3991 In order to increase the readability of the list produced by
3992 unused_thms, theorems that have been created by a particular instance
3993 of a theory command such as 'inductive' or 'function' are considered
3994 to belong to the same "group", meaning that if at least one theorem in
3995 this group is used, the other theorems in the same group are no longer
3996 reported as unused. Moreover, if all theorems in the group are
3997 unused, only one theorem in the group is displayed.
3999 Note that proof objects have to be switched on in order for
4000 unused_thms to work properly (i.e. !proofs must be >= 1, which is
4001 usually the case when using Proof General with the default settings).
4003 * Authentic naming of facts disallows ad-hoc overwriting of previous
4004 theorems within the same name space. INCOMPATIBILITY, need to remove
4005 duplicate fact bindings, or even accidental fact duplications. Note
4006 that tools may maintain dynamically scoped facts systematically, using
4007 PureThy.add_thms_dynamic.
4009 * Command 'hide' now allows to hide from "fact" name space as well.
4011 * Eliminated destructive theorem database, simpset, claset, and
4012 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
4013 update of theories within ML code.
4015 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
4016 INCOMPATIBILITY, object-logics depending on former Pure require
4017 additional setup PureThy.old_appl_syntax_setup; object-logics
4018 depending on former CPure need to refer to Pure.
4020 * Commands 'use' and 'ML' are now purely functional, operating on
4021 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
4022 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
4025 * Command 'setup': discontinued implicit version with ML reference.
4027 * Instantiation target allows for simultaneous specification of class
4028 instance operations together with an instantiation proof.
4029 Type-checking phase allows to refer to class operations uniformly.
4030 See src/HOL/Complex/Complex.thy for an Isar example and
4031 src/HOL/Library/Eval.thy for an ML example.
4033 * Indexing of literal facts: be more serious about including only
4034 facts from the visible specification/proof context, but not the
4035 background context (locale etc.). Affects `prop` notation and method
4036 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
4039 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
4040 "(open)" option, which used to expose internal bound variables to the
4043 * Isar statements: removed obsolete case "rule_context".
4044 INCOMPATIBILITY, better use explicit fixes/assumes.
4046 * Locale proofs: default proof step now includes 'unfold_locales';
4047 hence 'proof' without argument may be used to unfold locale
4051 *** Document preparation ***
4053 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
4054 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
4055 obsolete thumbpdf setup (contemporary PDF viewers do this on the
4056 spot); renamed link color from "darkblue" to "linkcolor" (default
4057 value unchanged, can be redefined via \definecolor); no longer sets
4058 "a4paper" option (unnecessary or even intrusive).
4060 * Antiquotation @{lemma A method} proves proposition A by the given
4061 method (either a method name or a method name plus (optional) method
4062 arguments in parentheses) and prints A just like @{prop A}.
4067 * New primrec package. Specification syntax conforms in style to
4068 definition/function/.... No separate induction rule is provided. The
4069 "primrec" command distinguishes old-style and new-style specifications
4070 by syntax. The former primrec package is now named OldPrimrecPackage.
4071 When adjusting theories, beware: constants stemming from new-style
4072 primrec specifications have authentic syntax.
4074 * Metis prover is now an order of magnitude faster, and also works
4075 with multithreading.
4077 * Metis: the maximum number of clauses that can be produced from a
4078 theorem is now given by the attribute max_clauses. Theorems that
4079 exceed this number are ignored, with a warning printed.
4081 * Sledgehammer no longer produces structured proofs by default. To
4082 enable, declare [[sledgehammer_full = true]]. Attributes
4083 reconstruction_modulus, reconstruction_sorts renamed
4084 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
4086 * Method "induct_scheme" derives user-specified induction rules
4087 from well-founded induction and completeness of patterns. This factors
4088 out some operations that are done internally by the function package
4089 and makes them available separately. See
4090 src/HOL/ex/Induction_Scheme.thy for examples.
4092 * More flexible generation of measure functions for termination
4093 proofs: Measure functions can be declared by proving a rule of the
4094 form "is_measure f" and giving it the [measure_function] attribute.
4095 The "is_measure" predicate is logically meaningless (always true), and
4096 just guides the heuristic. To find suitable measure functions, the
4097 termination prover sets up the goal "is_measure ?f" of the appropriate
4098 type and generates all solutions by prolog-style backwards proof using
4101 This setup also deals with rules like
4103 "is_measure f ==> is_measure (list_size f)"
4105 which accommodates nested datatypes that recurse through lists.
4106 Similar rules are predeclared for products and option types.
4108 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
4112 - Definitions of overloaded constants on sets have to be replaced by
4113 definitions on => and bool.
4115 - Some definitions of overloaded operators on sets can now be proved
4116 using the definitions of the operators on => and bool. Therefore,
4117 the following theorems have been renamed:
4119 subset_def -> subset_eq
4120 psubset_def -> psubset_eq
4121 set_diff_def -> set_diff_eq
4122 Compl_def -> Compl_eq
4123 Sup_set_def -> Sup_set_eq
4124 Inf_set_def -> Inf_set_eq
4125 sup_set_def -> sup_set_eq
4126 inf_set_def -> inf_set_eq
4128 - Due to the incompleteness of the HO unification algorithm, some
4129 rules such as subst may require manual instantiation, if some of
4130 the unknowns in the rule is a set.
4132 - Higher order unification and forward proofs:
4135 have "P (S::'a set)" <...>
4136 then have "EX S. P S" ..
4138 no longer works (due to the incompleteness of the HO unification
4139 algorithm) and must be replaced by the pattern
4146 - Calculational reasoning with subst (or similar rules):
4149 have "P (S::'a set)" <...>
4150 also have "S = T" <...>
4151 finally have "P T" .
4153 no longer works (for similar reasons as the previous example) and
4154 must be replaced by something like
4156 have "P (S::'a set)" <...>
4157 moreover have "S = T" <...>
4158 ultimately have "P T" by simp
4160 - Tactics or packages written in ML code:
4161 Code performing pattern matching on types via
4163 Type ("set", [T]) => ...
4165 must be rewritten. Moreover, functions like strip_type or
4166 binder_types no longer return the right value when applied to a
4169 T1 => ... => Tn => U => bool
4173 T1 => ... => Tn => U set
4175 * Merged theories Wellfounded_Recursion, Accessible_Part and
4176 Wellfounded_Relations to theory Wellfounded.
4178 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
4180 * Class finite no longer treats UNIV as class parameter. Use class
4181 enum from theory Library/Enum instead to achieve a similar effect.
4184 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
4185 and "Cons". INCOMPATIBILITY.
4187 * HOL (and FOL): renamed variables in rules imp_elim and swap.
4188 Potential INCOMPATIBILITY.
4190 * Theory Product_Type: duplicated lemmas split_Pair_apply and
4191 injective_fst_snd removed, use split_eta and prod_eqI instead.
4192 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
4194 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
4195 the same name in theory Orderings:
4205 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
4206 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
4207 and different variable names.
4209 * Library/Option_ord.thy: Canonical order on option type.
4211 * Library/RBT.thy: Red-black trees, an efficient implementation of
4214 * Library/Countable.thy: Type class for countable types.
4216 * Theory Int: The representation of numerals has changed. The infix
4217 operator BIT and the bit datatype with constructors B0 and B1 have
4218 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
4219 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
4220 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
4223 * Theory Nat: definition of <= and < on natural numbers no longer
4224 depend on well-founded relations. INCOMPATIBILITY. Definitions
4225 le_def and less_def have disappeared. Consider lemmas not_less
4226 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
4228 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
4229 (whose purpose mainly is for various fold_set functionals) have been
4230 abandoned in favor of the existing algebraic classes
4231 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
4232 lower_semilattice (resp. upper_semilattice) and linorder.
4235 * Theory Transitive_Closure: induct and cases rules now declare proper
4236 case_names ("base" and "step"). INCOMPATIBILITY.
4238 * Theorem Inductive.lfp_ordinal_induct generalized to complete
4239 lattices. The form set-specific version is available as
4240 Inductive.lfp_ordinal_induct_set.
4242 * Renamed theorems "power.simps" to "power_int.simps".
4245 * Class semiring_div provides basic abstract properties of semirings
4246 with division and modulo operations. Subsumes former class dvd_mod.
4248 * Merged theories IntDef, Numeral and IntArith into unified theory
4249 Int. INCOMPATIBILITY.
4251 * Theory Library/Code_Index: type "index" now represents natural
4252 numbers rather than integers. INCOMPATIBILITY.
4254 * New class "uminus" with operation "uminus" (split of from class
4255 "minus" which now only has operation "minus", binary).
4258 * Constants "card", "internal_split", "option_map" now with authentic
4259 syntax. INCOMPATIBILITY.
4261 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
4262 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
4263 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
4264 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
4265 Sup_set_def, le_def, less_def, option_map_def now with object
4266 equality. INCOMPATIBILITY.
4268 * Records. Removed K_record, and replaced it by pure lambda term
4269 %x. c. The simplifier setup is now more robust against eta expansion.
4270 INCOMPATIBILITY: in cases explicitly referring to K_record.
4272 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
4274 * Library/ListVector: new theory of arithmetic vector operations.
4276 * Library/Order_Relation: new theory of various orderings as sets of
4277 pairs. Defines preorders, partial orders, linear orders and
4278 well-orders on sets and on types.
4283 * Renamed some theories to allow to loading both ZF and HOL in the
4286 Datatype -> Datatype_ZF
4287 Inductive -> Inductive_ZF
4294 INCOMPATIBILITY: ZF theories that import individual theories below
4295 Main might need to be adapted. Regular theory Main is still
4296 available, as trivial extension of Main_ZF.
4301 * ML within Isar: antiquotation @{const name} or @{const
4302 name(typargs)} produces statically-checked Const term.
4304 * Functor NamedThmsFun: data is available to the user as dynamic fact
4305 (of the same name). Removed obsolete print command.
4307 * Removed obsolete "use_legacy_bindings" function.
4309 * The ``print mode'' is now a thread-local value derived from a global
4310 template (the former print_mode reference), thus access becomes
4311 non-critical. The global print_mode reference is for session
4312 management only; user-code should use print_mode_value,
4313 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
4315 * Functions system/system_out provide a robust way to invoke external
4316 shell commands, with propagation of interrupts (requires Poly/ML
4317 5.2.1). Do not use OS.Process.system etc. from the basis library!
4322 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
4323 in accordance with Proof General 3.7, which prefers GNU emacs.
4325 * isatool tty runs Isabelle process with plain tty interaction;
4326 optional line editor may be specified via ISABELLE_LINE_EDITOR
4327 setting, the default settings attempt to locate "ledit" and "rlwrap".
4329 * isatool browser now works with Cygwin as well, using general
4330 "javapath" function defined in Isabelle process environment.
4332 * YXML notation provides a simple and efficient alternative to
4333 standard XML transfer syntax. See src/Pure/General/yxml.ML and
4334 isatool yxml as described in the Isabelle system manual.
4336 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
4337 provides general wrapper for managing an Isabelle process in a robust
4338 fashion, with ``cooked'' output from stdin/stderr.
4340 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
4341 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
4343 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
4344 way of changing the user's settings is via
4345 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
4348 * Multithreading.max_threads := 0 refers to the number of actual CPU
4349 cores of the underlying machine, which is a good starting point for
4350 optimal performance tuning. The corresponding usedir option -M allows
4351 "max" as an alias for "0". WARNING: does not work on certain versions
4352 of Mac OS (with Poly/ML 5.1).
4354 * isabelle-process: non-ML sessions are run with "nice", to reduce the
4355 adverse effect of Isabelle flooding interactive front-ends (notably
4356 ProofGeneral / XEmacs).
4360 New in Isabelle2007 (November 2007)
4361 -----------------------------------
4365 * More uniform information about legacy features, notably a
4366 warning/error of "Legacy feature: ...", depending on the state of the
4367 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
4368 legacy features will disappear eventually.
4370 * Theory syntax: the header format ``theory A = B + C:'' has been
4371 discontinued in favour of ``theory A imports B C begin''. Use isatool
4372 fixheaders to convert existing theory files. INCOMPATIBILITY.
4374 * Theory syntax: the old non-Isar theory file format has been
4375 discontinued altogether. Note that ML proof scripts may still be used
4376 with Isar theories; migration is usually quite simple with the ML
4377 function use_legacy_bindings. INCOMPATIBILITY.
4379 * Theory syntax: some popular names (e.g. 'class', 'declaration',
4380 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
4383 * Theory loader: be more serious about observing the static theory
4384 header specifications (including optional directories), but not the
4385 accidental file locations of previously successful loads. The strict
4386 update policy of former update_thy is now already performed by
4387 use_thy, so the former has been removed; use_thys updates several
4388 theories simultaneously, just as 'imports' within a theory header
4389 specification, but without merging the results. Potential
4390 INCOMPATIBILITY: may need to refine theory headers and commands
4391 ROOT.ML which depend on load order.
4393 * Theory loader: optional support for content-based file
4394 identification, instead of the traditional scheme of full physical
4395 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
4396 (cf. the system manual). The new scheme allows to work with
4397 non-finished theories in persistent session images, such that source
4398 files may be moved later on without requiring reloads.
4400 * Theory loader: old-style ML proof scripts being *attached* to a thy
4401 file (with the same base name as the theory) are considered a legacy
4402 feature, which will disappear eventually. Even now, the theory loader
4403 no longer maintains dependencies on such files.
4405 * Syntax: the scope for resolving ambiguities via type-inference is
4406 now limited to individual terms, instead of whole simultaneous
4407 specifications as before. This greatly reduces the complexity of the
4408 syntax module and improves flexibility by separating parsing and
4409 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
4410 'fixes' etc.) are required in rare situations.
4412 * Syntax: constants introduced by new-style packages ('definition',
4413 'abbreviation' etc.) are passed through the syntax module in
4414 ``authentic mode''. This means that associated mixfix annotations
4415 really stick to such constants, independently of potential name space
4416 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
4417 trees are represented slightly differently, may need to adapt syntax
4418 translations accordingly. Use CONST marker in 'translations' and
4419 @{const_syntax} antiquotation in 'parse_translation' etc.
4421 * Legacy goal package: reduced interface to the bare minimum required
4422 to keep existing proof scripts running. Most other user-level
4423 functions are now part of the OldGoals structure, which is *not* open
4424 by default (consider isatool expandshort before open OldGoals).
4425 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
4426 these tend to cause confusion about the actual goal (!) context being
4427 used here, which is not necessarily the same as the_context().
4429 * Command 'find_theorems': supports "*" wild-card in "name:"
4430 criterion; "with_dups" option. Certain ProofGeneral versions might
4431 support a specific search form (see ProofGeneral/CHANGES).
4433 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
4434 by default, which means that "prems" (and also "fixed variables") are
4435 suppressed from proof state output. Note that the ProofGeneral
4436 settings mechanism allows to change and save options persistently, but
4437 older versions of Isabelle will fail to start up if a negative prems
4440 * Local theory targets may be specified by non-nested blocks of
4441 ``context/locale/class ... begin'' followed by ``end''. The body may
4442 contain definitions, theorems etc., including any derived mechanism
4443 that has been implemented on top of these primitives. This concept
4444 generalizes the existing ``theorem (in ...)'' towards more versatility
4447 * Proof General interface: proper undo of final 'end' command;
4448 discontinued Isabelle/classic mode (ML proof scripts).
4451 *** Document preparation ***
4453 * Added antiquotation @{theory name} which prints the given name,
4454 after checking that it refers to a valid ancestor theory in the
4457 * Added antiquotations @{ML_type text} and @{ML_struct text} which
4458 check the given source text as ML type/structure, printing verbatim.
4460 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
4461 "c args == rhs" given in the current context. (Any number of
4462 arguments may be given on the LHS.)
4467 * The 'class' package offers a combination of axclass and locale to
4468 achieve Haskell-like type classes in Isabelle. Definitions and
4469 theorems within a class context produce both relative results (with
4470 implicit parameters according to the locale context), and polymorphic
4471 constants with qualified polymorphism (according to the class
4472 context). Within the body context of a 'class' target, a separate
4473 syntax layer ("user space type system") takes care of converting
4474 between global polymorphic consts and internal locale representation.
4475 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
4476 "isatool doc classes" provides a tutorial.
4478 * Generic code generator framework allows to generate executable
4479 code for ML and Haskell (including Isabelle classes). A short usage
4482 internal compilation:
4483 export_code <list of constants (term syntax)> in SML
4484 writing SML code to a file:
4485 export_code <list of constants (term syntax)> in SML <filename>
4486 writing OCaml code to a file:
4487 export_code <list of constants (term syntax)> in OCaml <filename>
4488 writing Haskell code to a bunch of files:
4489 export_code <list of constants (term syntax)> in Haskell <filename>
4491 evaluating closed propositions to True/False using code generation:
4494 Reasonable default setup of framework in HOL.
4496 Theorem attributs for selecting and transforming function equations theorems:
4498 [code fun]: select a theorem as function equation for a specific constant
4499 [code fun del]: deselect a theorem as function equation for a specific constant
4500 [code inline]: select an equation theorem for unfolding (inlining) in place
4501 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
4503 User-defined serializations (target in {SML, OCaml, Haskell}):
4505 code_const <and-list of constants (term syntax)>
4506 {(target) <and-list of const target syntax>}+
4508 code_type <and-list of type constructors>
4509 {(target) <and-list of type target syntax>}+
4511 code_instance <and-list of instances>
4513 where instance ::= <type constructor> :: <class>
4515 code_class <and_list of classes>
4516 {(target) <and-list of class target syntax>}+
4517 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
4519 code_instance and code_class only are effective to target Haskell.
4521 For example usage see src/HOL/ex/Codegenerator.thy and
4522 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
4523 generation from Isabelle/HOL theories is available via "isatool doc
4526 * Code generator: consts in 'consts_code' Isar commands are now
4527 referred to by usual term syntax (including optional type
4530 * Command 'no_translations' removes translation rules from theory
4533 * Overloaded definitions are now actually checked for acyclic
4534 dependencies. The overloading scheme is slightly more general than
4535 that of Haskell98, although Isabelle does not demand an exact
4536 correspondence to type class and instance declarations.
4537 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
4538 exotic versions of overloading -- at the discretion of the user!
4540 Polymorphic constants are represented via type arguments, i.e. the
4541 instantiation that matches an instance against the most general
4542 declaration given in the signature. For example, with the declaration
4543 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
4544 as c(nat). Overloading is essentially simultaneous structural
4545 recursion over such type arguments. Incomplete specification patterns
4546 impose global constraints on all occurrences, e.g. c('a * 'a) on the
4547 LHS means that more general c('a * 'b) will be disallowed on any RHS.
4548 Command 'print_theory' outputs the normalized system of recursive
4549 equations, see section "definitions".
4551 * Configuration options are maintained within the theory or proof
4552 context (with name and type bool/int/string), providing a very simple
4553 interface to a poor-man's version of general context data. Tools may
4554 declare options in ML (e.g. using Attrib.config_int) and then refer to
4555 these values using Config.get etc. Users may change options via an
4556 associated attribute of the same name. This form of context
4557 declaration works particularly well with commands 'declare' or
4558 'using', for example ``declare [[foo = 42]]''. Thus it has become
4559 very easy to avoid global references, which would not observe Isar
4560 toplevel undo/redo and fail to work with multithreading.
4562 Various global ML references of Pure and HOL have been turned into
4563 configuration options:
4565 Unify.search_bound unify_search_bound
4566 Unify.trace_bound unify_trace_bound
4567 Unify.trace_simp unify_trace_simp
4568 Unify.trace_types unify_trace_types
4569 Simplifier.simp_depth_limit simp_depth_limit
4570 Blast.depth_limit blast_depth_limit
4571 DatatypeProp.dtK datatype_distinctness_limit
4572 fast_arith_neq_limit fast_arith_neq_limit
4573 fast_arith_split_limit fast_arith_split_limit
4575 * Named collections of theorems may be easily installed as context
4576 data using the functor NamedThmsFun (see also
4577 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
4578 attributes; there is also a toplevel print command. This facility is
4579 just a common case of general context data, which is the preferred way
4580 for anything more complex than just a list of facts in canonical
4583 * Isar: command 'declaration' augments a local theory by generic
4584 declaration functions written in ML. This enables arbitrary content
4585 being added to the context, depending on a morphism that tells the
4586 difference of the original declaration context wrt. the application
4587 context encountered later on.
4589 * Isar: proper interfaces for simplification procedures. Command
4590 'simproc_setup' declares named simprocs (with match patterns, and body
4591 text in ML). Attribute "simproc" adds/deletes simprocs in the current
4592 context. ML antiquotation @{simproc name} retrieves named simprocs.
4594 * Isar: an extra pair of brackets around attribute declarations
4595 abbreviates a theorem reference involving an internal dummy fact,
4596 which will be ignored later --- only the effect of the attribute on
4597 the background context will persist. This form of in-place
4598 declarations is particularly useful with commands like 'declare' and
4599 'using', for example ``have A using [[simproc a]] by simp''.
4601 * Isar: method "assumption" (and implicit closing of subproofs) now
4602 takes simple non-atomic goal assumptions into account: after applying
4603 an assumption as a rule the resulting subgoals are solved by atomic
4604 assumption steps. This is particularly useful to finish 'obtain'
4605 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
4606 without referring to the original premise "!!x. P x ==> thesis" in the
4607 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
4610 * Isar: implicit use of prems from the Isar proof context is
4611 considered a legacy feature. Common applications like ``have A .''
4612 may be replaced by ``have A by fact'' or ``note `A`''. In general,
4613 referencing facts explicitly here improves readability and
4614 maintainability of proof texts.
4616 * Isar: improper proof element 'guess' is like 'obtain', but derives
4617 the obtained context from the course of reasoning! For example:
4619 assume "EX x y. A x & B y" -- "any previous fact"
4620 then guess x and y by clarify
4622 This technique is potentially adventurous, depending on the facts and
4623 proof tools being involved here.
4625 * Isar: known facts from the proof context may be specified as literal
4626 propositions, using ASCII back-quote syntax. This works wherever
4627 named facts used to be allowed so far, in proof commands, proof
4628 methods, attributes etc. Literal facts are retrieved from the context
4629 according to unification of type and term parameters. For example,
4630 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
4631 theorems in the current context, then these are valid literal facts:
4632 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
4634 There is also a proof method "fact" which does the same composition
4635 for explicit goal states, e.g. the following proof texts coincide with
4636 certain special cases of literal facts:
4638 have "A" by fact == note `A`
4639 have "A ==> B" by fact == note `A ==> B`
4640 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
4641 have "P a ==> Q a" by fact == note `P a ==> Q a`
4643 * Isar: ":" (colon) is no longer a symbolic identifier character in
4644 outer syntax. Thus symbolic identifiers may be used without
4645 additional white space in declarations like this: ``assume *: A''.
4647 * Isar: 'print_facts' prints all local facts of the current context,
4648 both named and unnamed ones.
4650 * Isar: 'def' now admits simultaneous definitions, e.g.:
4652 def x == "t" and y == "u"
4654 * Isar: added command 'unfolding', which is structurally similar to
4655 'using', but affects both the goal state and facts by unfolding given
4656 rewrite rules. Thus many occurrences of the 'unfold' method or
4657 'unfolded' attribute may be replaced by first-class proof text.
4659 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
4660 and command 'unfolding' now all support object-level equalities
4661 (potentially conditional). The underlying notion of rewrite rule is
4662 analogous to the 'rule_format' attribute, but *not* that of the
4663 Simplifier (which is usually more generous).
4665 * Isar: the new attribute [rotated n] (default n = 1) rotates the
4666 premises of a theorem by n. Useful in conjunction with drule.
4668 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
4669 method expression within a sandbox consisting of the first N
4670 sub-goals, which need to exist. For example, ``simp_all [3]''
4671 simplifies the first three sub-goals, while (rule foo, simp_all)[]
4672 simplifies all new goals that emerge from applying rule foo to the
4673 originally first one.
4675 * Isar: schematic goals are no longer restricted to higher-order
4676 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
4679 * Isar: the conclusion of a long theorem statement is now either
4680 'shows' (a simultaneous conjunction, as before), or 'obtains'
4681 (essentially a disjunction of cases with local parameters and
4682 assumptions). The latter allows to express general elimination rules
4683 adequately; in this notation common elimination rules look like this:
4685 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
4687 obtains x where "P x"
4689 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
4693 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
4699 The subsequent classical rules even refer to the formal "thesis"
4702 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
4705 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
4706 obtains "thesis ==> something"
4708 The actual proof of an 'obtains' statement is analogous to that of the
4709 Isar proof element 'obtain', only that there may be several cases.
4710 Optional case names may be specified in parentheses; these will be
4711 available both in the present proof and as annotations in the
4712 resulting rule, for later use with the 'cases' method (cf. attribute
4715 * Isar: the assumptions of a long theorem statement are available as
4716 "assms" fact in the proof context. This is more appropriate than the
4717 (historical) "prems", which refers to all assumptions of the current
4718 context, including those from the target locale, proof body etc.
4720 * Isar: 'print_statement' prints theorems from the current theory or
4721 proof context in long statement form, according to the syntax of a
4724 * Isar: 'obtain' takes an optional case name for the local context
4725 introduction rule (default "that").
4727 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
4728 explicit (is "_ ==> ?foo") in the rare cases where this still happens
4731 * Pure: syntax "CONST name" produces a fully internalized constant
4732 according to the current context. This is particularly useful for
4733 syntax translations that should refer to internal constant
4734 representations independently of name spaces.
4736 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
4737 instead of "FOO ". This allows multiple binder declarations to coexist
4738 in the same context. INCOMPATIBILITY.
4740 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
4741 primitive that also works in a locale context (both for constants and
4742 fixed variables). Type declaration and internal syntactic representation
4743 of given constants retrieved from the context. Likewise, the
4744 'no_notation' command allows to remove given syntax annotations from the
4747 * Isar/locales: new derived specification elements 'axiomatization',
4748 'definition', 'abbreviation', which support type-inference, admit
4749 object-level specifications (equality, equivalence). See also the
4750 isar-ref manual. Examples:
4753 eq (infix "===" 50) where
4754 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
4756 definition "f x y = x + y + 1"
4757 definition g where "g x = f x x"
4760 neq (infix "=!=" 50) where
4761 "x =!= y == ~ (x === y)"
4763 These specifications may be also used in a locale context. Then the
4764 constants being introduced depend on certain fixed parameters, and the
4765 constant name is qualified by the locale base name. An internal
4766 abbreviation takes care for convenient input and output, making the
4767 parameters implicit and using the original short name. See also
4768 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
4769 entities from a monomorphic theory.
4771 Presently, abbreviations are only available 'in' a target locale, but
4772 not inherited by general import expressions. Also note that
4773 'abbreviation' may be used as a type-safe replacement for 'syntax' +
4774 'translations' in common applications. The "no_abbrevs" print mode
4775 prevents folding of abbreviations in term output.
4777 Concrete syntax is attached to specified constants in internal form,
4778 independently of name spaces. The parse tree representation is
4779 slightly different -- use 'notation' instead of raw 'syntax', and
4780 'translations' with explicit "CONST" markup to accommodate this.
4782 * Pure/Isar: unified syntax for new-style specification mechanisms
4783 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
4784 full type inference and dummy patterns ("_"). For example:
4786 definition "K x _ = x"
4788 inductive conj for A B
4789 where "A ==> B ==> conj A B"
4791 * Pure: command 'print_abbrevs' prints all constant abbreviations of
4792 the current context. Print mode "no_abbrevs" prevents inversion of
4793 abbreviations on output.
4795 * Isar/locales: improved parameter handling: use of locales "var" and
4796 "struct" no longer necessary; - parameter renamings are no longer
4797 required to be injective. For example, this allows to define
4798 endomorphisms as locale endom = homom mult mult h.
4800 * Isar/locales: changed the way locales with predicates are defined.
4801 Instead of accumulating the specification, the imported expression is
4802 now an interpretation. INCOMPATIBILITY: different normal form of
4803 locale expressions. In particular, in interpretations of locales with
4804 predicates, goals repesenting already interpreted fragments are not
4805 removed automatically. Use methods `intro_locales' and
4806 `unfold_locales'; see below.
4808 * Isar/locales: new methods `intro_locales' and `unfold_locales'
4809 provide backward reasoning on locales predicates. The methods are
4810 aware of interpretations and discharge corresponding goals.
4811 `intro_locales' is less aggressive then `unfold_locales' and does not
4812 unfold predicates to assumptions.
4814 * Isar/locales: the order in which locale fragments are accumulated
4815 has changed. This enables to override declarations from fragments due
4816 to interpretations -- for example, unwanted simp rules.
4818 * Isar/locales: interpretation in theories and proof contexts has been
4819 extended. One may now specify (and prove) equations, which are
4820 unfolded in interpreted theorems. This is useful for replacing
4821 defined concepts (constants depending on locale parameters) by
4822 concepts already existing in the target context. Example:
4824 interpretation partial_order ["op <= :: [int, int] => bool"]
4825 where "partial_order.less (op <=) (x::int) y = (x < y)"
4827 Typically, the constant `partial_order.less' is created by a
4828 definition specification element in the context of locale
4831 * Method "induct": improved internal context management to support
4832 local fixes and defines on-the-fly. Thus explicit meta-level
4833 connectives !! and ==> are rarely required anymore in inductive goals
4834 (using object-logic connectives for this purpose has been long
4835 obsolete anyway). Common proof patterns are explained in
4836 src/HOL/Induct/Common_Patterns.thy, see also
4837 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
4840 * Method "induct": improved handling of simultaneous goals. Instead of
4841 introducing object-level conjunction, the statement is now split into
4842 several conclusions, while the corresponding symbolic cases are nested
4843 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
4844 see src/HOL/Induct/Common_Patterns.thy, for example.
4846 * Method "induct": mutual induction rules are now specified as a list
4847 of rule sharing the same induction cases. HOL packages usually provide
4848 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
4849 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
4850 mutual induction rules differently, i.e. like this:
4852 (induct rule: foo_bar.inducts)
4853 (induct set: foo bar)
4854 (induct pred: foo bar)
4855 (induct type: foo bar)
4857 The ML function ProjectRule.projections turns old-style rules into the
4860 * Method "coinduct": dual of induction, see
4861 src/HOL/Library/Coinductive_List.thy for various examples.
4863 * Method "cases", "induct", "coinduct": the ``(open)'' option is
4864 considered a legacy feature.
4866 * Attribute "symmetric" produces result with standardized schematic
4867 variables (index 0). Potential INCOMPATIBILITY.
4869 * Simplifier: by default the simplifier trace only shows top level
4870 rewrites now. That is, trace_simp_depth_limit is set to 1 by
4871 default. Thus there is less danger of being flooded by the trace. The
4872 trace indicates where parts have been suppressed.
4874 * Provers/classical: removed obsolete classical version of elim_format
4875 attribute; classical elim/dest rules are now treated uniformly when
4876 manipulating the claset.
4878 * Provers/classical: stricter checks to ensure that supplied intro,
4879 dest and elim rules are well-formed; dest and elim rules must have at
4882 * Provers/classical: attributes dest/elim/intro take an optional
4883 weight argument for the rule (just as the Pure versions). Weights are
4884 ignored by automated tools, but determine the search order of single
4887 * Syntax: input syntax now supports dummy variable binding "%_. b",
4888 where the body does not mention the bound variable. Note that dummy
4889 patterns implicitly depend on their context of bounds, which makes
4890 "{_. _}" match any set comprehension as expected. Potential
4891 INCOMPATIBILITY -- parse translations need to cope with syntactic
4892 constant "_idtdummy" in the binding position.
4894 * Syntax: removed obsolete syntactic constant "_K" and its associated
4895 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
4896 for example "A -> B" => "Pi A (%_. B)".
4898 * Pure: 'class_deps' command visualizes the subclass relation, using
4899 the graph browser tool.
4901 * Pure: 'print_theory' now suppresses certain internal declarations by
4902 default; use '!' option for full details.
4907 * Method "metis" proves goals by applying the Metis general-purpose
4908 resolution prover (see also http://gilith.com/software/metis/).
4909 Examples are in the directory MetisExamples. WARNING: the
4910 Isabelle/HOL-Metis integration does not yet work properly with
4913 * Command 'sledgehammer' invokes external automatic theorem provers as
4914 background processes. It generates calls to the "metis" method if
4915 successful. These can be pasted into the proof. Users do not have to
4916 wait for the automatic provers to return. WARNING: does not really
4917 work with multi-threading.
4919 * New "auto_quickcheck" feature tests outermost goal statements for
4920 potential counter-examples. Controlled by ML references
4921 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
4922 5000 milliseconds). Fails silently if statements is outside of
4923 executable fragment, or any other codgenerator problem occurs.
4925 * New constant "undefined" with axiom "undefined x = undefined".
4927 * Added class "HOL.eq", allowing for code generation with polymorphic
4930 * Some renaming of class constants due to canonical name prefixing in
4931 the new 'class' package:
4933 HOL.abs ~> HOL.abs_class.abs
4934 HOL.divide ~> HOL.divide_class.divide
4935 0 ~> HOL.zero_class.zero
4936 1 ~> HOL.one_class.one
4937 op + ~> HOL.plus_class.plus
4938 op - ~> HOL.minus_class.minus
4939 uminus ~> HOL.minus_class.uminus
4940 op * ~> HOL.times_class.times
4941 op < ~> HOL.ord_class.less
4942 op <= > HOL.ord_class.less_eq
4943 Nat.power ~> Power.power_class.power
4944 Nat.size ~> Nat.size_class.size
4945 Numeral.number_of ~> Numeral.number_class.number_of
4946 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
4947 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
4948 Orderings.min ~> Orderings.ord_class.min
4949 Orderings.max ~> Orderings.ord_class.max
4950 Divides.op div ~> Divides.div_class.div
4951 Divides.op mod ~> Divides.div_class.mod
4952 Divides.op dvd ~> Divides.div_class.dvd
4954 INCOMPATIBILITY. Adaptions may be required in the following cases:
4956 a) User-defined constants using any of the names "plus", "minus",
4957 "times", "less" or "less_eq". The standard syntax translations for
4958 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
4961 b) Variables named "plus", "minus", "times", "less", "less_eq"
4962 INCOMPATIBILITY: use more specific names.
4964 c) Permutative equations (e.g. "a + b = b + a")
4965 Since the change of names also changes the order of terms, permutative
4966 rewrite rules may get applied in a different order. Experience shows
4967 that this is rarely the case (only two adaptions in the whole Isabelle
4968 distribution). INCOMPATIBILITY: rewrite proofs
4970 d) ML code directly refering to constant names
4971 This in general only affects hand-written proof tactics, simprocs and
4972 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
4973 Consider using @{const_name} antiquotation.
4975 * New class "default" with associated constant "default".
4977 * Function "sgn" is now overloaded and available on int, real, complex
4978 (and other numeric types), using class "sgn". Two possible defs of
4979 sgn are given as equational assumptions in the classes sgn_if and
4980 sgn_div_norm; ordered_idom now also inherits from sgn_if.
4983 * Locale "partial_order" now unified with class "order" (cf. theory
4984 Orderings), added parameter "less". INCOMPATIBILITY.
4986 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
4987 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
4988 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
4990 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
4991 changed order of proof goals in instance proofs.
4993 * The transitivity reasoner for partial and linear orders is set up
4994 for classes "order" and "linorder". Instances of the reasoner are available
4995 in all contexts importing or interpreting the corresponding locales.
4996 Method "order" invokes the reasoner separately; the reasoner
4997 is also integrated with the Simplifier as a solver. Diagnostic
4998 command 'print_orders' shows the available instances of the reasoner
4999 in the current context.
5001 * Localized monotonicity predicate in theory "Orderings"; integrated
5002 lemmas max_of_mono and min_of_mono with this predicate.
5005 * Formulation of theorem "dense" changed slightly due to integration
5006 with new class dense_linear_order.
5008 * Uniform lattice theory development in HOL.
5010 constants "meet" and "join" now named "inf" and "sup"
5011 constant "Meet" now named "Inf"
5013 classes "meet_semilorder" and "join_semilorder" now named
5014 "lower_semilattice" and "upper_semilattice"
5015 class "lorder" now named "lattice"
5016 class "comp_lat" now named "complete_lattice"
5018 Instantiation of lattice classes allows explicit definitions
5019 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
5021 INCOMPATIBILITY. Theorem renames:
5023 meet_left_le ~> inf_le1
5024 meet_right_le ~> inf_le2
5025 join_left_le ~> sup_ge1
5026 join_right_le ~> sup_ge2
5027 meet_join_le ~> inf_sup_ord
5030 le_meet ~> le_inf_iff
5031 le_join ~> ge_sup_conv
5032 meet_idempotent ~> inf_idem
5033 join_idempotent ~> sup_idem
5034 meet_comm ~> inf_commute
5035 join_comm ~> sup_commute
5036 meet_leI1 ~> le_infI1
5037 meet_leI2 ~> le_infI2
5038 le_joinI1 ~> le_supI1
5039 le_joinI2 ~> le_supI2
5040 meet_assoc ~> inf_assoc
5041 join_assoc ~> sup_assoc
5042 meet_left_comm ~> inf_left_commute
5043 meet_left_idempotent ~> inf_left_idem
5044 join_left_comm ~> sup_left_commute
5045 join_left_idempotent ~> sup_left_idem
5048 le_def_meet ~> le_iff_inf
5049 le_def_join ~> le_iff_sup
5050 join_absorp2 ~> sup_absorb2
5051 join_absorp1 ~> sup_absorb1
5052 meet_absorp1 ~> inf_absorb1
5053 meet_absorp2 ~> inf_absorb2
5054 meet_join_absorp ~> inf_sup_absorb
5055 join_meet_absorp ~> sup_inf_absorb
5056 distrib_join_le ~> distrib_sup_le
5057 distrib_meet_le ~> distrib_inf_le
5059 add_meet_distrib_left ~> add_inf_distrib_left
5060 add_join_distrib_left ~> add_sup_distrib_left
5061 is_join_neg_meet ~> is_join_neg_inf
5062 is_meet_neg_join ~> is_meet_neg_sup
5063 add_meet_distrib_right ~> add_inf_distrib_right
5064 add_join_distrib_right ~> add_sup_distrib_right
5065 add_meet_join_distribs ~> add_sup_inf_distribs
5066 join_eq_neg_meet ~> sup_eq_neg_inf
5067 meet_eq_neg_join ~> inf_eq_neg_sup
5068 add_eq_meet_join ~> add_eq_inf_sup
5069 meet_0_imp_0 ~> inf_0_imp_0
5070 join_0_imp_0 ~> sup_0_imp_0
5071 meet_0_eq_0 ~> inf_0_eq_0
5072 join_0_eq_0 ~> sup_0_eq_0
5073 neg_meet_eq_join ~> neg_inf_eq_sup
5074 neg_join_eq_meet ~> neg_sup_eq_inf
5075 join_eq_if ~> sup_eq_if
5077 mono_meet ~> mono_inf
5078 mono_join ~> mono_sup
5079 meet_bool_eq ~> inf_bool_eq
5080 join_bool_eq ~> sup_bool_eq
5081 meet_fun_eq ~> inf_fun_eq
5082 join_fun_eq ~> sup_fun_eq
5083 meet_set_eq ~> inf_set_eq
5084 join_set_eq ~> sup_set_eq
5085 meet1_iff ~> inf1_iff
5086 meet2_iff ~> inf2_iff
5095 join1_iff ~> sup1_iff
5096 join2_iff ~> sup2_iff
5106 is_meet_Meet ~> is_meet_Inf
5107 Meet_bool_def ~> Inf_bool_def
5108 Meet_fun_def ~> Inf_fun_def
5109 Meet_greatest ~> Inf_greatest
5110 Meet_lower ~> Inf_lower
5111 Meet_set_def ~> Inf_set_def
5114 Sup_bool_eq ~> Sup_bool_def
5115 Sup_fun_eq ~> Sup_fun_def
5116 Sup_set_eq ~> Sup_set_def
5118 listsp_meetI ~> listsp_infI
5119 listsp_meet_eq ~> listsp_inf_eq
5124 * Added syntactic class "size"; overloaded constant "size" now has
5125 type "'a::size ==> bool"
5127 * Internal reorganisation of `size' of datatypes: size theorems
5128 "foo.size" are no longer subsumed by "foo.simps" (but are still
5129 simplification rules by default!); theorems "prod.size" now named
5132 * Class "div" now inherits from class "times" rather than "type".
5135 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
5136 Linorder etc. have disappeared; operations defined in terms of
5137 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
5139 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
5141 * HOL-Word: New extensive library and type for generic, fixed size
5142 machine words, with arithemtic, bit-wise, shifting and rotating
5143 operations, reflection into int, nat, and bool lists, automation for
5144 linear arithmetic (by automatic reflection into nat or int), including
5145 lemmas on overflow and monotonicity. Instantiated to all appropriate
5146 arithmetic type classes, supporting automatic simplification of
5147 numerals on all operations.
5149 * Library/Boolean_Algebra: locales for abstract boolean algebras.
5151 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
5153 * Code generator library theories:
5154 - Code_Integer represents HOL integers by big integer literals in target
5156 - Code_Char represents HOL characters by character literals in target
5158 - Code_Char_chr like Code_Char, but also offers treatment of character
5159 codes; includes Code_Integer.
5160 - Executable_Set allows to generate code for finite sets using lists.
5161 - Executable_Rat implements rational numbers as triples (sign, enumerator,
5163 - Executable_Real implements a subset of real numbers, namly those
5164 representable by rational numbers.
5165 - Efficient_Nat implements natural numbers by integers, which in general will
5166 result in higher efficency; pattern matching with 0/Suc is eliminated;
5167 includes Code_Integer.
5168 - Code_Index provides an additional datatype index which is mapped to
5169 target-language built-in integers.
5170 - Code_Message provides an additional datatype message_string which is isomorphic to
5171 strings; messages are mapped to target-language strings.
5173 * New package for inductive predicates
5175 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
5178 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5179 for z_1 :: U_1 and ... and z_n :: U_m
5181 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5184 with full support for type-inference, rather than
5186 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5188 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5189 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5191 inductive "s z_1 ... z_m"
5193 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5196 For backward compatibility, there is a wrapper allowing inductive
5197 sets to be defined with the new package via
5200 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5201 for z_1 :: U_1 and ... and z_n :: U_m
5203 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5209 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5210 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5211 for z_1 :: U_1 and ... and z_n :: U_m
5213 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5214 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5217 if the additional syntax "p ..." is required.
5219 Numerous examples can be found in the subdirectories src/HOL/Auth,
5220 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
5224 - Since declaration and definition of inductive sets or predicates
5225 is no longer separated, abbreviations involving the newly
5226 introduced sets or predicates must be specified together with the
5227 introduction rules after the 'where' keyword (see above), rather
5228 than before the actual inductive definition.
5230 - The variables in induction and elimination rules are now
5231 quantified in the order of their occurrence in the introduction
5232 rules, rather than in alphabetical order. Since this may break
5233 some proofs, these proofs either have to be repaired, e.g. by
5234 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
5235 statements of the form
5237 case (rule_i a_i_1 ... a_i_{k_i})
5239 or the old order of quantification has to be restored by explicitly adding
5240 meta-level quantifiers in the introduction rules, i.e.
5242 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
5244 - The format of the elimination rules is now
5246 p z_1 ... z_m x_1 ... x_n ==>
5247 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5252 (x_1, ..., x_n) : s z_1 ... z_m ==>
5253 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5256 for sets rather than
5258 x : s z_1 ... z_m ==>
5259 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
5262 This may require terms in goals to be expanded to n-tuples
5263 (e.g. using case_tac or simplification with the split_paired_all
5264 rule) before the above elimination rule is applicable.
5266 - The elimination or case analysis rules for (mutually) inductive
5267 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
5268 list of rules "p_1_..._p_k.elims" is no longer available.
5270 * New package "function"/"fun" for general recursive functions,
5271 supporting mutual and nested recursion, definitions in local contexts,
5272 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
5273 for small examples, and the separate tutorial on the function
5274 package. The old recdef "package" is still available as before, but
5275 users are encouraged to use the new package.
5277 * Method "lexicographic_order" automatically synthesizes termination
5278 relations as lexicographic combinations of size measures.
5280 * Case-expressions allow arbitrary constructor-patterns (including
5281 "_") and take their order into account, like in functional
5282 programming. Internally, this is translated into nested
5283 case-expressions; missing cases are added and mapped to the predefined
5284 constant "undefined". In complicated cases printing may no longer show
5285 the original input but the internal form. Lambda-abstractions allow
5286 the same form of pattern matching: "% pat1 => e1 | ..." is an
5287 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
5290 * IntDef: The constant "int :: nat => int" has been removed; now "int"
5291 is an abbreviation for "of_nat :: nat => int". The simplification
5292 rules for "of_nat" have been changed to work like "int" did
5293 previously. Potential INCOMPATIBILITY:
5294 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
5295 - of_nat_diff and of_nat_mult are no longer default simp rules
5297 * Method "algebra" solves polynomial equations over (semi)rings using
5298 Groebner bases. The (semi)ring structure is defined by locales and the
5299 tool setup depends on that generic context. Installing the method for
5300 a specific type involves instantiating the locale and possibly adding
5301 declarations for computation on the coefficients. The method is
5302 already instantiated for natural numbers and for the axiomatic class
5303 of idoms with numerals. See also the paper by Chaieb and Wenzel at
5304 CALCULEMUS 2007 for the general principles underlying this
5305 architecture of context-aware proof-tools.
5307 * Method "ferrack" implements quantifier elimination over
5308 special-purpose dense linear orders using locales (analogous to
5309 "algebra"). The method is already installed for class
5310 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
5313 * Former constant "List.op @" now named "List.append". Use ML
5314 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
5315 circumvent possible incompatibilities when working on ML level.
5317 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
5319 * New function listsum :: 'a list => 'a for arbitrary monoids.
5320 Special syntax: "SUM x <- xs. f x" (and latex variants)
5322 * New syntax for Haskell-like list comprehension (input only), eg.
5323 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
5325 * The special syntax for function "filter" has changed from [x :
5326 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
5327 comprehension syntax, and for uniformity. INCOMPATIBILITY.
5329 * [a..b] is now defined for arbitrary linear orders. It used to be
5330 defined on nat only, as an abbreviation for [a..<Suc b]
5333 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
5335 * New functions "sorted" and "sort" in src/HOL/List.thy.
5337 * New lemma collection field_simps (an extension of ring_simps) for
5338 manipulating (in)equations involving division. Multiplies with all
5339 denominators that can be proved to be non-zero (in equations) or
5340 positive/negative (in inequations).
5342 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
5343 have been improved and renamed to ring_simps, group_simps and
5344 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
5345 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
5347 * Theory Library/Commutative_Ring: switched from recdef to function
5348 package; constants add, mul, pow now curried. Infix syntax for
5349 algebraic operations.
5351 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
5354 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
5357 * HOL/records: generalised field-update to take a function on the
5358 field rather than the new value: r(|A := x|) is translated to A_update
5359 (K x) r The K-combinator that is internally used is called K_record.
5360 INCOMPATIBILITY: Usage of the plain update functions has to be
5363 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
5364 * x = 0, which are required for a semiring. Richer structures do not
5365 inherit from semiring_0 anymore, because this property is a theorem
5366 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
5367 there is more to prove, but this is mostly trivial.
5369 * Class "recpower" is generalized to arbitrary monoids, not just
5370 commutative semirings. INCOMPATIBILITY: may need to incorporate
5371 commutativity or semiring properties additionally.
5373 * Constant "List.list_all2" in List.thy now uses authentic syntax.
5374 INCOMPATIBILITY: translations containing list_all2 may go wrong,
5375 better use 'abbreviation'.
5377 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
5379 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
5380 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
5381 significant changes for setting up numeral syntax for types:
5382 - New constants Numeral.pred and Numeral.succ instead
5383 of former Numeral.bin_pred and Numeral.bin_succ.
5384 - Use integer operations instead of bin_add, bin_mult and so on.
5385 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
5386 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
5388 See src/HOL/Integ/IntArith.thy for an example setup.
5390 * Command 'normal_form' computes the normal form of a term that may
5391 contain free variables. For example ``normal_form "rev [a, b, c]"''
5392 produces ``[b, c, a]'' (without proof). This command is suitable for
5393 heavy-duty computations because the functions are compiled to ML
5394 first. Correspondingly, a method "normalization" is provided. See
5395 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
5397 * Alternative iff syntax "A <-> B" for equality on bool (with priority
5398 25 like -->); output depends on the "iff" print_mode, the default is
5399 "A = B" (with priority 50).
5401 * Relations less (<) and less_eq (<=) are also available on type bool.
5402 Modified syntax to disallow nesting without explicit parentheses,
5403 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
5406 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
5408 * Relation composition operator "op O" now has precedence 75 and binds
5409 stronger than union and intersection. INCOMPATIBILITY.
5411 * The old set interval syntax "{m..n(}" (and relatives) has been
5412 removed. Use "{m..<n}" (and relatives) instead.
5414 * In the context of the assumption "~(s = t)" the Simplifier rewrites
5415 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
5416 ``declare [[simproc del: neq]]''.
5418 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
5421 * Theorem Cons_eq_map_conv no longer declared as "simp".
5423 * Theorem setsum_mult renamed to setsum_right_distrib.
5425 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
5428 * Reimplemented methods "sat" and "satx", with several improvements:
5429 goals no longer need to be stated as "<prems> ==> False", equivalences
5430 (i.e. "=" on type bool) are handled, variable names of the form
5431 "lit_<n>" are no longer reserved, significant speedup.
5433 * Methods "sat" and "satx" can now replay MiniSat proof traces.
5434 zChaff is still supported as well.
5436 * 'inductive' and 'datatype': provide projections of mutual rules,
5437 bundled as foo_bar.inducts;
5439 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
5442 * Library: moved theory Accessible_Part to main HOL.
5444 * Library: added theory Coinductive_List of potentially infinite lists
5445 as greatest fixed-point.
5447 * Library: added theory AssocList which implements (finite) maps as
5450 * Method "evaluation" solves goals (i.e. a boolean expression)
5451 efficiently by compiling it to ML. The goal is "proved" (via an
5452 oracle) if it evaluates to True.
5454 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
5455 also when invoked by the simplifier. This results in the Simplifier
5456 being more powerful on arithmetic goals. INCOMPATIBILITY.
5457 Configuration option fast_arith_split_limit=0 recovers the old
5460 * Support for hex (0x20) and binary (0b1001) numerals.
5462 * New method: reify eqs (t), where eqs are equations for an
5463 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
5464 parameter, computes a term s::'b and a list xs::'a list and proves the
5465 theorem I xs s = t. This is also known as reification or quoting. The
5466 resulting theorem is applied to the subgoal to substitute t with I xs
5467 s. If t is omitted, the subgoal itself is reified.
5469 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
5470 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
5471 where f is supposed to be a computable function (in the sense of code
5472 generattion). The method uses reify to compute s and xs as above then
5473 applies corr_thm and uses normalization by evaluation to "prove" f s =
5474 r and finally gets the theorem t = r, which is again applied to the
5475 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
5477 * Reflection: Automatic reification now handels binding, an example is
5478 available in src/HOL/ex/ReflectionEx.thy
5480 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
5481 command 'statespace' that is similar to 'record', but introduces an
5482 abstract specification based on the locale infrastructure instead of
5483 HOL types. This leads to extra flexibility in composing state spaces,
5484 in particular multiple inheritance and renaming of components.
5489 * Hyperreal: Functions root and sqrt are now defined on negative real
5490 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
5491 Nonnegativity side conditions have been removed from many lemmas, so
5492 that more subgoals may now be solved by simplification; potential
5495 * Real: new type classes formalize real normed vector spaces and
5496 algebras, using new overloaded constants scaleR :: real => 'a => 'a
5497 and norm :: 'a => real.
5499 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
5500 reals into other types. The overloaded constant Reals :: 'a set is now
5501 defined as range of_real; potential INCOMPATIBILITY.
5503 * Real: proper support for ML code generation, including 'quickcheck'.
5504 Reals are implemented as arbitrary precision rationals.
5506 * Hyperreal: Several constants that previously worked only for the
5507 reals have been generalized, so they now work over arbitrary vector
5508 spaces. Type annotations may need to be added in some cases; potential
5511 Infinitesimal :: ('a::real_normed_vector) star set
5512 HFinite :: ('a::real_normed_vector) star set
5513 HInfinite :: ('a::real_normed_vector) star set
5514 approx :: ('a::real_normed_vector) star => 'a star => bool
5515 monad :: ('a::real_normed_vector) star => 'a star set
5516 galaxy :: ('a::real_normed_vector) star => 'a star set
5517 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
5518 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
5519 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
5520 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
5521 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
5522 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
5523 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
5524 sgn :: 'a::real_normed_vector => 'a
5525 exp :: 'a::{recpower,real_normed_field,banach} => 'a
5527 * Complex: Some complex-specific constants are now abbreviations for
5528 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
5529 hnorm. Other constants have been entirely removed in favor of the
5530 polymorphic versions (INCOMPATIBILITY):
5534 HInfinite <-- CInfinite
5535 Infinitesimal <-- CInfinitesimal
5538 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
5539 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
5540 (ns)deriv <-- (ns)cderiv
5545 * Formalisation of ideals and the quotient construction over rings.
5547 * Order and lattice theory no longer based on records.
5550 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
5551 greatest_closed. INCOMPATIBILITY.
5553 * Method algebra is now set up via an attribute. For examples see
5554 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
5555 of algebraic structures.
5557 * Renamed theory CRing to Ring.
5562 * Substantial, yet incomplete support for nominal datatypes (binding
5563 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
5564 src/HOL/Nominal/Examples. Prospective users should consult
5565 http://isabelle.in.tum.de/nominal/
5570 * ML basics: just one true type int, which coincides with IntInf.int
5573 * ML within Isar: antiquotations allow to embed statically-checked
5574 formal entities in the source, referring to the context available at
5575 compile-time. For example:
5577 ML {* @{sort "{zero,one}"} *}
5578 ML {* @{typ "'a => 'b"} *}
5579 ML {* @{term "%x. x"} *}
5580 ML {* @{prop "x == y"} *}
5581 ML {* @{ctyp "'a => 'b"} *}
5582 ML {* @{cterm "%x. x"} *}
5583 ML {* @{cprop "x == y"} *}
5584 ML {* @{thm asm_rl} *}
5585 ML {* @{thms asm_rl} *}
5586 ML {* @{type_name c} *}
5587 ML {* @{type_syntax c} *}
5588 ML {* @{const_name c} *}
5589 ML {* @{const_syntax c} *}
5592 ML {* @{theory Pure} *}
5593 ML {* @{theory_ref} *}
5594 ML {* @{theory_ref Pure} *}
5597 ML {* @{clasimpset} *}
5599 The same works for sources being ``used'' within an Isar context.
5601 * ML in Isar: improved error reporting; extra verbosity with
5602 ML_Context.trace enabled.
5604 * Pure/General/table.ML: the join operations now works via exceptions
5605 DUP/SAME instead of type option. This is simpler in simple cases, and
5606 admits slightly more efficient complex applications.
5608 * Pure: 'advanced' translation functions (parse_translation etc.) now
5609 use Context.generic instead of just theory.
5611 * Pure: datatype Context.generic joins theory/Proof.context and
5612 provides some facilities for code that works in either kind of
5613 context, notably GenericDataFun for uniform theory and proof data.
5615 * Pure: simplified internal attribute type, which is now always
5616 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
5617 local (Proof.context) attributes have been discontinued, while
5618 minimizing code duplication. Thm.rule_attribute and
5619 Thm.declaration_attribute build canonical attributes; see also structure
5620 Context for further operations on Context.generic, notably
5621 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
5622 declarations and definitions.
5624 * Context data interfaces (Theory/Proof/GenericDataFun): removed
5625 name/print, uninitialized data defaults to ad-hoc copy of empty value,
5626 init only required for impure data. INCOMPATIBILITY: empty really need
5627 to be empty (no dependencies on theory content!)
5629 * Pure/kernel: consts certification ignores sort constraints given in
5630 signature declarations. (This information is not relevant to the
5631 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
5632 potential INCOMPATIBILITY.
5634 * Pure: axiomatic type classes are now purely definitional, with
5635 explicit proofs of class axioms and super class relations performed
5636 internally. See Pure/axclass.ML for the main internal interfaces --
5637 notably AxClass.define_class supercedes AxClass.add_axclass, and
5638 AxClass.axiomatize_class/classrel/arity supersede
5639 Sign.add_classes/classrel/arities.
5641 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
5642 global/local versions on theory vs. Proof.context have been
5643 discontinued; Attrib.syntax and Method.syntax have been adapted
5644 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
5645 attributes, methods, etc.
5647 * Pure: several functions of signature "... -> theory -> theory * ..."
5648 have been reoriented to "... -> theory -> ... * theory" in order to
5649 allow natural usage in combination with the ||>, ||>>, |-> and
5650 fold_map combinators.
5652 * Pure: official theorem names (closed derivations) and additional
5653 comments (tags) are now strictly separate. Name hints -- which are
5654 maintained as tags -- may be attached any time without affecting the
5657 * Pure: primitive rule lift_rule now takes goal cterm instead of an
5658 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
5659 achieve the old behaviour.
5661 * Pure: the "Goal" constant is now called "prop", supporting a
5662 slightly more general idea of ``protecting'' meta-level rule
5665 * Pure: Logic.(un)varify only works in a global context, which is now
5666 enforced instead of silently assumed. INCOMPATIBILITY, may use
5667 Logic.legacy_(un)varify as temporary workaround.
5669 * Pure: structure Name provides scalable operations for generating
5670 internal variable names, notably Name.variants etc. This replaces
5671 some popular functions from term.ML:
5673 Term.variant -> Name.variant
5674 Term.variantlist -> Name.variant_list
5675 Term.invent_names -> Name.invent_list
5677 Note that low-level renaming rarely occurs in new code -- operations
5678 from structure Variable are used instead (see below).
5680 * Pure: structure Variable provides fundamental operations for proper
5681 treatment of fixed/schematic variables in a context. For example,
5682 Variable.import introduces fixes for schematics of given facts and
5683 Variable.export reverses the effect (up to renaming) -- this replaces
5684 various freeze_thaw operations.
5686 * Pure: structure Goal provides simple interfaces for
5687 init/conclude/finish and tactical prove operations (replacing former
5688 Tactic.prove). Goal.prove is the canonical way to prove results
5689 within a given context; Goal.prove_global is a degraded version for
5690 theory level goals, including a global Drule.standard. Note that
5691 OldGoals.prove_goalw_cterm has long been obsolete, since it is
5692 ill-behaved in a local proof context (e.g. with local fixes/assumes or
5693 in a locale context).
5695 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
5696 and type checking (Syntax.check_term etc.), with common combinations
5697 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
5698 which are considered legacy and await removal.
5700 * Pure/Syntax: generic interfaces for type unchecking
5701 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
5702 with common combinations (Syntax.pretty_term, Syntax.string_of_term
5703 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
5704 available for convenience, but refer to the very same operations using
5705 a mere theory instead of a full context.
5707 * Isar: simplified treatment of user-level errors, using exception
5708 ERROR of string uniformly. Function error now merely raises ERROR,
5709 without any side effect on output channels. The Isar toplevel takes
5710 care of proper display of ERROR exceptions. ML code may use plain
5711 handle/can/try; cat_error may be used to concatenate errors like this:
5713 ... handle ERROR msg => cat_error msg "..."
5715 Toplevel ML code (run directly or through the Isar toplevel) may be
5716 embedded into the Isar toplevel with exception display/debug like
5719 Isar.toplevel (fn () => ...)
5721 INCOMPATIBILITY, removed special transform_error facilities, removed
5722 obsolete variants of user-level exceptions (ERROR_MESSAGE,
5723 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
5724 -- use plain ERROR instead.
5726 * Isar: theory setup now has type (theory -> theory), instead of a
5727 list. INCOMPATIBILITY, may use #> to compose setup functions.
5729 * Isar: ML toplevel pretty printer for type Proof.context, subject to
5730 ProofContext.debug/verbose flags.
5732 * Isar: Toplevel.theory_to_proof admits transactions that modify the
5733 theory before entering a proof state. Transactions now always see a
5734 quasi-functional intermediate checkpoint, both in interactive and
5737 * Isar: simplified interfaces for outer syntax. Renamed
5738 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
5739 OuterSyntax.add_parsers -- this functionality is now included in
5740 OuterSyntax.command etc. INCOMPATIBILITY.
5742 * Simplifier: the simpset of a running simplification process now
5743 contains a proof context (cf. Simplifier.the_context), which is the
5744 very context that the initial simpset has been retrieved from (by
5745 simpset_of/local_simpset_of). Consequently, all plug-in components
5746 (solver, looper etc.) may depend on arbitrary proof data.
5748 * Simplifier.inherit_context inherits the proof context (plus the
5749 local bounds) of the current simplification process; any simproc
5750 etc. that calls the Simplifier recursively should do this! Removed
5751 former Simplifier.inherit_bounds, which is already included here --
5752 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
5753 specify an explicit context using Simplifier.context/theory_context.
5755 * Simplifier/Classical Reasoner: more abstract interfaces
5756 change_simpset/claset for modifying the simpset/claset reference of a
5757 theory; raw versions simpset/claset_ref etc. have been discontinued --
5760 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
5766 * settings: the default heap location within ISABELLE_HOME_USER now
5767 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
5768 Isabelle installations.
5770 * isabelle-process: option -S (secure mode) disables some critical
5771 operations, notably runtime compilation and evaluation of ML source
5774 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
5776 * Support for parallel execution, using native multicore support of
5777 Poly/ML 5.1. The theory loader exploits parallelism when processing
5778 independent theories, according to the given theory header
5779 specifications. The maximum number of worker threads is specified via
5780 usedir option -M or the "max-threads" setting in Proof General. A
5781 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
5782 to 6 on a 8-core machine. User-code needs to observe certain
5783 guidelines for thread-safe programming, see appendix A in the Isar
5784 Implementation manual.
5788 New in Isabelle2005 (October 2005)
5789 ----------------------------------
5793 * Theory headers: the new header syntax for Isar theories is
5796 imports <theory1> ... <theoryN>
5797 uses <file1> ... <fileM>
5800 where the 'uses' part is optional. The previous syntax
5802 theory <name> = <theory1> + ... + <theoryN>:
5804 will disappear in the next release. Use isatool fixheaders to convert
5805 existing theory files. Note that there is no change in ancient
5806 non-Isar theories now, but these will disappear soon.
5808 * Theory loader: parent theories can now also be referred to via
5809 relative and absolute paths.
5811 * Command 'find_theorems' searches for a list of criteria instead of a
5812 list of constants. Known criteria are: intro, elim, dest, name:string,
5813 simp:term, and any term. Criteria can be preceded by '-' to select
5814 theorems that do not match. Intro, elim, dest select theorems that
5815 match the current goal, name:s selects theorems whose fully qualified
5816 name contain s, and simp:term selects all simplification rules whose
5817 lhs match term. Any other term is interpreted as pattern and selects
5818 all theorems matching the pattern. Available in ProofGeneral under
5819 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
5821 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
5823 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
5824 matching the current goal as introduction rule and not having "HOL."
5825 in their name (i.e. not being defined in theory HOL).
5827 * Command 'thms_containing' has been discontinued in favour of
5828 'find_theorems'; INCOMPATIBILITY.
5830 * Communication with Proof General is now 8bit clean, which means that
5831 Unicode text in UTF-8 encoding may be used within theory texts (both
5832 formal and informal parts). Cf. option -U of the Isabelle Proof
5833 General interface. Here are some simple examples (cf. src/HOL/ex):
5835 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
5836 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
5838 * Improved efficiency of the Simplifier and, to a lesser degree, the
5839 Classical Reasoner. Typical big applications run around 2 times
5843 *** Document preparation ***
5845 * Commands 'display_drafts' and 'print_drafts' perform simple output
5846 of raw sources. Only those symbols that do not require additional
5847 LaTeX packages (depending on comments in isabellesym.sty) are
5848 displayed properly, everything else is left verbatim. isatool display
5849 and isatool print are used as front ends (these are subject to the
5850 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
5852 * Command tags control specific markup of certain regions of text,
5853 notably folding and hiding. Predefined tags include "theory" (for
5854 theory begin and end), "proof" for proof commands, and "ML" for
5855 commands involving ML code; the additional tags "visible" and
5856 "invisible" are unused by default. Users may give explicit tag
5857 specifications in the text, e.g. ''by %invisible (auto)''. The
5858 interpretation of tags is determined by the LaTeX job during document
5859 preparation: see option -V of isatool usedir, or options -n and -t of
5860 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
5863 Several document versions may be produced at the same time via isatool
5864 usedir (the generated index.html will link all of them). Typical
5865 specifications include ''-V document=theory,proof,ML'' to present
5866 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
5867 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
5868 these parts without any formal replacement text. The Isabelle site
5869 default settings produce ''document'' and ''outline'' versions as
5872 * Several new antiquotations:
5874 @{term_type term} prints a term with its type annotated;
5876 @{typeof term} prints the type of a term;
5878 @{const const} is the same as @{term const}, but checks that the
5879 argument is a known logical constant;
5881 @{term_style style term} and @{thm_style style thm} print a term or
5882 theorem applying a "style" to it
5886 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
5887 definitions, equations, inequations etc., 'concl' printing only the
5888 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
5889 to print the specified premise. TermStyle.add_style provides an ML
5890 interface for introducing further styles. See also the "LaTeX Sugar"
5891 document practical applications. The ML antiquotation prints
5892 type-checked ML expressions verbatim.
5894 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
5895 and 'text' support optional locale specification '(in loc)', which
5896 specifies the default context for interpreting antiquotations. For
5897 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
5899 * Option 'locale=NAME' of antiquotations specifies an alternative
5900 context interpreting the subsequent argument. For example: @{thm
5901 [locale=lattice] inf_assoc}.
5903 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
5906 * Proper output of antiquotations for theory commands involving a
5907 proof context (such as 'locale' or 'theorem (in loc) ...').
5909 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
5910 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
5912 * isatool usedir: new option -C (default true) controls whether option
5913 -D should include a copy of the original document directory; -C false
5914 prevents unwanted effects such as copying of administrative CVS data.
5919 * Considerably improved version of 'constdefs' command. Now performs
5920 automatic type-inference of declared constants; additional support for
5921 local structure declarations (cf. locales and HOL records), see also
5922 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
5923 sequential dependencies of definitions within a single 'constdefs'
5924 section; moreover, the declared name needs to be an identifier. If
5925 all fails, consider to fall back on 'consts' and 'defs' separately.
5927 * Improved indexed syntax and implicit structures. First of all,
5928 indexed syntax provides a notational device for subscripted
5929 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
5930 expressions. Secondly, in a local context with structure
5931 declarations, number indexes \<^sub>n or the empty index (default
5932 number 1) refer to a certain fixed variable implicitly; option
5933 show_structs controls printing of implicit structures. Typical
5934 applications of these concepts involve record types and locales.
5936 * New command 'no_syntax' removes grammar declarations (and
5937 translations) resulting from the given syntax specification, which is
5938 interpreted in the same manner as for the 'syntax' command.
5940 * 'Advanced' translation functions (parse_translation etc.) may depend
5941 on the signature of the theory context being presently used for
5942 parsing/printing, see also isar-ref manual.
5944 * Improved 'oracle' command provides a type-safe interface to turn an
5945 ML expression of type theory -> T -> term into a primitive rule of
5946 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
5947 is already included here); see also FOL/ex/IffExample.thy;
5950 * axclass: name space prefix for class "c" is now "c_class" (was "c"
5951 before); "cI" is no longer bound, use "c.intro" instead.
5952 INCOMPATIBILITY. This change avoids clashes of fact bindings for
5953 axclasses vs. locales.
5955 * Improved internal renaming of symbolic identifiers -- attach primes
5956 instead of base 26 numbers.
5958 * New flag show_question_marks controls printing of leading question
5959 marks in schematic variable names.
5961 * In schematic variable names, *any* symbol following \<^isub> or
5962 \<^isup> is now treated as part of the base name. For example, the
5963 following works without printing of awkward ".0" indexes:
5965 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
5968 * Inner syntax includes (*(*nested*) comments*).
5970 * Pretty printer now supports unbreakable blocks, specified in mixfix
5971 annotations as "(00...)".
5973 * Clear separation of logical types and nonterminals, where the latter
5974 may only occur in 'syntax' specifications or type abbreviations.
5975 Before that distinction was only partially implemented via type class
5976 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
5977 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
5978 exotic syntax specifications may require further adaption
5979 (e.g. Cube/Cube.thy).
5981 * Removed obsolete type class "logic", use the top sort {} instead.
5982 Note that non-logical types should be declared as 'nonterminals'
5983 rather than 'types'. INCOMPATIBILITY for new object-logic
5986 * Attributes 'induct' and 'cases': type or set names may now be
5987 locally fixed variables as well.
5989 * Simplifier: can now control the depth to which conditional rewriting
5990 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
5993 * Simplifier: simplification procedures may now take the current
5994 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
5995 interface), which is very useful for calling the Simplifier
5996 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
5997 is gone -- use prems_of_ss on the simpset instead. Moreover, the
5998 low-level mk_simproc no longer applies Logic.varify internally, to
5999 allow for use in a context of fixed variables.
6001 * thin_tac now works even if the assumption being deleted contains !!
6002 or ==>. More generally, erule now works even if the major premise of
6003 the elimination rule contains !! or ==>.
6005 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
6007 * Reorganized bootstrapping of the Pure theories; CPure is now derived
6008 from Pure, which contains all common declarations already. Both
6009 theories are defined via plain Isabelle/Isar .thy files.
6010 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
6011 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
6012 use isatool fixcpure to adapt your theory and ML sources.
6014 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
6015 selections of theorems in named facts via index ranges.
6017 * 'print_theorems': in theory mode, really print the difference
6018 wrt. the last state (works for interactive theory development only),
6019 in proof mode print all local facts (cf. 'print_facts');
6021 * 'hide': option '(open)' hides only base names.
6023 * More efficient treatment of intermediate checkpoints in interactive
6026 * Code generator is now invoked via code_module (incremental code
6027 generation) and code_library (modular code generation, ML structures
6028 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
6029 must be quoted when used as identifiers.
6031 * New 'value' command for reading, evaluating and printing terms using
6032 the code generator. INCOMPATIBILITY: command keyword 'value' must be
6033 quoted when used as identifier.
6038 * New commands for the interpretation of locale expressions in
6039 theories (1), locales (2) and proof contexts (3). These generate
6040 proof obligations from the expression specification. After the
6041 obligations have been discharged, theorems of the expression are added
6042 to the theory, target locale or proof context. The synopsis of the
6043 commands is a follows:
6045 (1) interpretation expr inst
6046 (2) interpretation target < expr
6047 (3) interpret expr inst
6049 Interpretation in theories and proof contexts require a parameter
6050 instantiation of terms from the current context. This is applied to
6051 specifications and theorems of the interpreted expression.
6052 Interpretation in locales only permits parameter renaming through the
6053 locale expression. Interpretation is smart in that interpretations
6054 that are active already do not occur in proof obligations, neither are
6055 instantiated theorems stored in duplicate. Use 'print_interps' to
6056 inspect active interpretations of a particular locale. For details,
6057 see the Isar Reference manual. Examples can be found in
6058 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
6060 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
6061 'interpret' instead.
6063 * New context element 'constrains' for adding type constraints to
6066 * Context expressions: renaming of parameters with syntax
6069 * Locale declaration: 'includes' disallowed.
6071 * Proper static binding of attribute syntax -- i.e. types / terms /
6072 facts mentioned as arguments are always those of the locale definition
6073 context, independently of the context of later invocations. Moreover,
6074 locale operations (renaming and type / term instantiation) are applied
6075 to attribute arguments as expected.
6077 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
6078 actual attributes; rare situations may require Attrib.attribute to
6079 embed those attributes into Attrib.src that lack concrete syntax.
6080 Attribute implementations need to cooperate properly with the static
6081 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
6082 Attrib.XXX_thm etc. already do the right thing without further
6083 intervention. Only unusual applications -- such as "where" or "of"
6084 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
6085 on the context and the facts involved -- may have to assign parsed
6086 values to argument tokens explicitly.
6088 * Changed parameter management in theorem generation for long goal
6089 statements with 'includes'. INCOMPATIBILITY: produces a different
6090 theorem statement in rare situations.
6092 * Locale inspection command 'print_locale' omits notes elements. Use
6093 'print_locale!' to have them included in the output.
6098 * Provers/hypsubst.ML: improved version of the subst method, for
6099 single-step rewriting: it now works in bound variable contexts. New is
6100 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
6101 rewrite a different subterm than the original subst method, which is
6102 still available as 'simplesubst'.
6104 * Provers/quasi.ML: new transitivity reasoners for transitivity only
6107 * Provers/trancl.ML: new transitivity reasoner for transitive and
6108 reflexive-transitive closure of relations.
6110 * Provers/blast.ML: new reference depth_limit to make blast's depth
6111 limit (previously hard-coded with a value of 20) user-definable.
6113 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
6114 is peformed already. Object-logics merely need to finish their
6115 initial simpset configuration as before. INCOMPATIBILITY.
6120 * Symbolic syntax of Hilbert Choice Operator is now as follows:
6123 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
6125 The symbol \<some> is displayed as the alternative epsilon of LaTeX
6126 and x-symbol; use option '-m epsilon' to get it actually printed.
6127 Moreover, the mathematically important symbolic identifier \<epsilon>
6128 becomes available as variable, constant etc. INCOMPATIBILITY,
6130 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
6131 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
6132 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
6133 support corresponding Isar calculations.
6135 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
6138 * theory SetInterval: changed the syntax for open intervals:
6147 The old syntax is still supported but will disappear in the next
6148 release. For conversion use the following Emacs search and replace
6149 patterns (these are not perfect but work quite well):
6151 {)\([^\.]*\)\.\. -> {\1<\.\.}
6152 \.\.\([^(}]*\)(} -> \.\.<\1}
6154 * Theory Commutative_Ring (in Library): method comm_ring for proving
6155 equalities in commutative rings; method 'algebra' provides a generic
6158 * Theory Finite_Set: changed the syntax for 'setsum', summation over
6159 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
6160 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
6163 Some new syntax forms are available:
6165 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
6166 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
6167 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
6168 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
6170 The latter form "\<Sum>x < k. e" used to be based on a separate
6171 function "Summation", which has been discontinued.
6173 * theory Finite_Set: in structured induction proofs, the insert case
6174 is now 'case (insert x F)' instead of the old counterintuitive 'case
6177 * The 'refute' command has been extended to support a much larger
6178 fragment of HOL, including axiomatic type classes, constdefs and
6179 typedefs, inductive datatypes and recursion.
6181 * New tactics 'sat' and 'satx' to prove propositional tautologies.
6182 Requires zChaff with proof generation to be installed. See
6183 HOL/ex/SAT_Examples.thy for examples.
6185 * Datatype induction via method 'induct' now preserves the name of the
6186 induction variable. For example, when proving P(xs::'a list) by
6187 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
6188 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
6189 in unstructured proof scripts.
6191 * Reworked implementation of records. Improved scalability for
6192 records with many fields, avoiding performance problems for type
6193 inference. Records are no longer composed of nested field types, but
6194 of nested extension types. Therefore the record type only grows linear
6195 in the number of extensions and not in the number of fields. The
6196 top-level (users) view on records is preserved. Potential
6197 INCOMPATIBILITY only in strange cases, where the theory depends on the
6198 old record representation. The type generated for a record is called
6199 <record_name>_ext_type.
6201 Flag record_quick_and_dirty_sensitive can be enabled to skip the
6202 proofs triggered by a record definition or a simproc (if
6203 quick_and_dirty is enabled). Definitions of large records can take
6206 New simproc record_upd_simproc for simplification of multiple record
6207 updates enabled by default. Moreover, trivial updates are also
6208 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
6209 occasionally, since simplification is more powerful by default.
6211 * typedef: proper support for polymorphic sets, which contain extra
6212 type-variables in the term.
6214 * Simplifier: automatically reasons about transitivity chains
6215 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
6216 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
6217 old proofs break occasionally as simplification may now solve more
6218 goals than previously.
6220 * Simplifier: converts x <= y into x = y if assumption y <= x is
6221 present. Works for all partial orders (class "order"), in particular
6222 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
6225 * Simplifier: new simproc for "let x = a in f x". If a is a free or
6226 bound variable or a constant then the let is unfolded. Otherwise
6227 first a is simplified to b, and then f b is simplified to g. If
6228 possible we abstract b from g arriving at "let x = b in h x",
6229 otherwise we unfold the let and arrive at g. The simproc can be
6230 enabled/disabled by the reference use_let_simproc. Potential
6231 INCOMPATIBILITY since simplification is more powerful by default.
6233 * Classical reasoning: the meson method now accepts theorems as arguments.
6235 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
6236 jobs to provide advice on the provability of subgoals.
6238 * Theory OrderedGroup and Ring_and_Field: various additions and
6239 improvements to faciliate calculations involving equalities and
6242 The following theorems have been eliminated or modified
6245 abs_eq now named abs_of_nonneg
6246 abs_of_ge_0 now named abs_of_nonneg
6247 abs_minus_eq now named abs_of_nonpos
6248 imp_abs_id now named abs_of_nonneg
6249 imp_abs_neg_id now named abs_of_nonpos
6250 mult_pos now named mult_pos_pos
6251 mult_pos_le now named mult_nonneg_nonneg
6252 mult_pos_neg_le now named mult_nonneg_nonpos
6253 mult_pos_neg2_le now named mult_nonneg_nonpos2
6254 mult_neg now named mult_neg_neg
6255 mult_neg_le now named mult_nonpos_nonpos
6257 * The following lemmas in Ring_and_Field have been added to the simplifier:
6260 not_square_less_zero
6262 The following lemmas have been deleted from Real/RealPow:
6272 * Theory Parity: added rules for simplifying exponents.
6276 The following theorems have been eliminated or modified
6279 list_all_Nil now named list_all.simps(1)
6280 list_all_Cons now named list_all.simps(2)
6281 list_all_conv now named list_all_iff
6282 set_mem_eq now named mem_iff
6284 * Theories SetsAndFunctions and BigO (see HOL/Library) support
6285 asymptotic "big O" calculations. See the notes in BigO.thy.
6290 * Theory RealDef: better support for embedding natural numbers and
6291 integers in the reals.
6293 The following theorems have been eliminated or modified
6296 exp_ge_add_one_self now requires no hypotheses
6297 real_of_int_add reversed direction of equality (use [symmetric])
6298 real_of_int_minus reversed direction of equality (use [symmetric])
6299 real_of_int_diff reversed direction of equality (use [symmetric])
6300 real_of_int_mult reversed direction of equality (use [symmetric])
6302 * Theory RComplete: expanded support for floor and ceiling functions.
6304 * Theory Ln is new, with properties of the natural logarithm
6306 * Hyperreal: There is a new type constructor "star" for making
6307 nonstandard types. The old type names are now type synonyms:
6311 hcomplex = complex star
6313 * Hyperreal: Many groups of similarly-defined constants have been
6314 replaced by polymorphic versions (INCOMPATIBILITY):
6316 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
6318 starset <-- starsetNat, starsetC
6319 *s* <-- *sNat*, *sc*
6320 starset_n <-- starsetNat_n, starsetC_n
6321 *sn* <-- *sNatn*, *scn*
6322 InternalSets <-- InternalNatSets, InternalCSets
6324 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6325 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
6326 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
6327 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
6328 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
6330 * Hyperreal: Many type-specific theorems have been removed in favor of
6331 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
6333 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
6334 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
6335 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
6336 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
6337 right_minus <-- hypreal_add_minus
6338 left_minus <-- {hypreal,hcomplex}_add_minus_left
6339 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
6340 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
6341 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
6342 mult_1_right <-- hcomplex_mult_one_right
6343 mult_zero_left <-- hcomplex_mult_zero_left
6344 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
6345 right_distrib <-- hypnat_add_mult_distrib2
6346 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
6347 right_inverse <-- hypreal_mult_inverse
6348 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
6349 order_refl <-- {hypreal,hypnat}_le_refl
6350 order_trans <-- {hypreal,hypnat}_le_trans
6351 order_antisym <-- {hypreal,hypnat}_le_anti_sym
6352 order_less_le <-- {hypreal,hypnat}_less_le
6353 linorder_linear <-- {hypreal,hypnat}_le_linear
6354 add_left_mono <-- {hypreal,hypnat}_add_left_mono
6355 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
6356 add_nonneg_nonneg <-- hypreal_le_add_order
6358 * Hyperreal: Separate theorems having to do with type-specific
6359 versions of constants have been merged into theorems that apply to the
6360 new polymorphic constants (INCOMPATIBILITY):
6362 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
6363 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
6364 STAR_Un <-- {STAR,NatStar,STARC}_Un
6365 STAR_Int <-- {STAR,NatStar,STARC}_Int
6366 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
6367 STAR_subset <-- {STAR,NatStar,STARC}_subset
6368 STAR_mem <-- {STAR,NatStar,STARC}_mem
6369 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
6370 STAR_diff <-- {STAR,STARC}_diff
6371 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
6372 STARC_hcomplex_of_complex}_image_subset
6373 starset_n_Un <-- starset{Nat,C}_n_Un
6374 starset_n_Int <-- starset{Nat,C}_n_Int
6375 starset_n_Compl <-- starset{Nat,C}_n_Compl
6376 starset_n_diff <-- starset{Nat,C}_n_diff
6377 InternalSets_Un <-- Internal{Nat,C}Sets_Un
6378 InternalSets_Int <-- Internal{Nat,C}Sets_Int
6379 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
6380 InternalSets_diff <-- Internal{Nat,C}Sets_diff
6381 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
6382 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
6383 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
6384 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
6385 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
6386 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6387 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
6388 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
6389 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
6390 starfun_diff <-- starfun{C,RC,CR}_diff
6391 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
6392 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
6393 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
6394 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
6395 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
6396 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
6397 starfun_Id <-- starfunC_Id
6398 starfun_approx <-- starfun{Nat,CR}_approx
6399 starfun_capprox <-- starfun{C,RC}_capprox
6400 starfun_abs <-- starfunNat_rabs
6401 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
6402 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
6403 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
6404 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
6405 starfun_add_capprox <-- starfun{C,RC}_add_capprox
6406 starfun_add_approx <-- starfunCR_add_approx
6407 starfun_inverse_inverse <-- starfunC_inverse_inverse
6408 starfun_divide <-- starfun{C,CR,RC}_divide
6409 starfun_n <-- starfun{Nat,C}_n
6410 starfun_n_mult <-- starfun{Nat,C}_n_mult
6411 starfun_n_add <-- starfun{Nat,C}_n_add
6412 starfun_n_add_minus <-- starfunNat_n_add_minus
6413 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
6414 starfun_n_minus <-- starfun{Nat,C}_n_minus
6415 starfun_n_eq <-- starfun{Nat,C}_n_eq
6417 star_n_add <-- {hypreal,hypnat,hcomplex}_add
6418 star_n_minus <-- {hypreal,hcomplex}_minus
6419 star_n_diff <-- {hypreal,hcomplex}_diff
6420 star_n_mult <-- {hypreal,hcomplex}_mult
6421 star_n_inverse <-- {hypreal,hcomplex}_inverse
6422 star_n_le <-- {hypreal,hypnat}_le
6423 star_n_less <-- {hypreal,hypnat}_less
6424 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
6425 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
6426 star_n_abs <-- hypreal_hrabs
6427 star_n_divide <-- hcomplex_divide
6429 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
6430 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
6431 star_of_diff <-- hypreal_of_real_diff
6432 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
6433 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
6434 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
6435 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
6436 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
6437 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
6438 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
6439 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
6440 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
6441 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
6442 star_of_number_of <-- {hypreal,hcomplex}_number_of
6443 star_of_number_less <-- number_of_less_hypreal_of_real_iff
6444 star_of_number_le <-- number_of_le_hypreal_of_real_iff
6445 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
6446 star_of_less_number <-- hypreal_of_real_less_number_of_iff
6447 star_of_le_number <-- hypreal_of_real_le_number_of_iff
6448 star_of_power <-- hypreal_of_real_power
6449 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
6451 * Hyperreal: new method "transfer" that implements the transfer
6452 principle of nonstandard analysis. With a subgoal that mentions
6453 nonstandard types like "'a star", the command "apply transfer"
6454 replaces it with an equivalent one that mentions only standard types.
6455 To be successful, all free variables must have standard types; non-
6456 standard variables must have explicit universal quantifiers.
6458 * Hyperreal: A theory of Taylor series.
6463 * Discontinued special version of 'constdefs' (which used to support
6464 continuous functions) in favor of the general Pure one with full
6467 * New simplification procedure for solving continuity conditions; it
6468 is much faster on terms with many nested lambda abstractions (cubic
6469 instead of exponential time).
6471 * New syntax for domain package: selector names are now optional.
6472 Parentheses should be omitted unless argument is lazy, for example:
6474 domain 'a stream = cons "'a" (lazy "'a stream")
6476 * New command 'fixrec' for defining recursive functions with pattern
6477 matching; defining multiple functions with mutual recursion is also
6478 supported. Patterns may include the constants cpair, spair, up, sinl,
6479 sinr, or any data constructor defined by the domain package. The given
6480 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
6481 syntax and examples.
6483 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
6484 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
6485 but the proof obligation additionally includes an admissibility
6486 requirement. The packages generate instances of class cpo or pcpo,
6487 with continuity and strictness theorems for Rep and Abs.
6489 * HOLCF: Many theorems have been renamed according to a more standard naming
6490 scheme (INCOMPATIBILITY):
6492 foo_inject: "foo$x = foo$y ==> x = y"
6493 foo_eq: "(foo$x = foo$y) = (x = y)"
6494 foo_less: "(foo$x << foo$y) = (x << y)"
6495 foo_strict: "foo$UU = UU"
6496 foo_defined: "... ==> foo$x ~= UU"
6497 foo_defined_iff: "(foo$x = UU) = (x = UU)"
6502 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
6503 including the First Isomorphism Theorem (on quotienting by the kernel
6506 * ZF/Simplifier: install second copy of type solver that actually
6507 makes use of TC rules declared to Isar proof contexts (or locales);
6508 the old version is still required for ML proof scripts.
6513 * Converted to Isar theory format; use locales instead of axiomatic
6519 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
6522 * Pure/library.ML no longer defines its own option datatype, but uses
6523 that of the SML basis, which has constructors NONE and SOME instead of
6524 None and Some, as well as exception Option.Option instead of OPTION.
6525 The functions the, if_none, is_some, is_none have been adapted
6526 accordingly, while Option.map replaces apsome.
6528 * Pure/library.ML: the exception LIST has been given up in favour of
6529 the standard exceptions Empty and Subscript, as well as
6530 Library.UnequalLengths. Function like Library.hd and Library.tl are
6531 superceded by the standard hd and tl functions etc.
6533 A number of basic list functions are no longer exported to the ML
6534 toplevel, as they are variants of predefined functions. The following
6535 suggests how one can translate existing code:
6537 rev_append xs ys = List.revAppend (xs, ys)
6538 nth_elem (i, xs) = List.nth (xs, i)
6539 last_elem xs = List.last xs
6540 flat xss = List.concat xss
6541 seq fs = List.app fs
6542 partition P xs = List.partition P xs
6543 mapfilter f xs = List.mapPartial f xs
6545 * Pure/library.ML: several combinators for linear functional
6546 transformations, notably reverse application and composition:
6549 (x, y) |-> f f #-> g
6551 * Pure/library.ML: introduced/changed precedence of infix operators:
6553 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
6555 infix 3 o oo ooo oooo;
6556 infix 4 ~~ upto downto;
6558 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
6561 * Pure/library.ML: natural list combinators fold, fold_rev, and
6562 fold_map support linear functional transformations and nesting. For
6565 fold f [x1, ..., xN] y =
6566 y |> f x1 |> ... |> f xN
6568 (fold o fold) f [xs1, ..., xsN] y =
6569 y |> fold f xs1 |> ... |> fold f xsN
6571 fold f [x1, ..., xN] =
6574 (fold o fold) f [xs1, ..., xsN] =
6575 fold f xs1 #> ... #> fold f xsN
6577 * Pure/library.ML: the following selectors on type 'a option are
6580 the: 'a option -> 'a (*partial*)
6581 these: 'a option -> 'a where 'a = 'b list
6582 the_default: 'a -> 'a option -> 'a
6583 the_list: 'a option -> 'a list
6585 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6586 basic operations for association lists, following natural argument
6587 order; moreover the explicit equality predicate passed here avoids
6588 potentially expensive polymorphic runtime equality checks.
6589 The old functions may be expressed as follows:
6591 assoc = uncurry (AList.lookup (op =))
6592 assocs = these oo AList.lookup (op =)
6593 overwrite = uncurry (AList.update (op =)) o swap
6595 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6597 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
6598 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
6600 replacing make_keylist and keyfilter (occassionally used)
6603 make_keylist = AList.make
6604 keyfilter = AList.find (op =)
6606 * eq_fst and eq_snd now take explicit equality parameter, thus
6607 avoiding eqtypes. Naive rewrites:
6609 eq_fst = eq_fst (op =)
6610 eq_snd = eq_snd (op =)
6612 * Removed deprecated apl and apr (rarely used).
6615 apl (n, op) =>>= curry op n
6616 apr (op, m) =>>= fn n => op (n, m)
6618 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
6619 provides a reasonably efficient light-weight implementation of sets as
6622 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
6623 few new operations; existing lookup and update are now curried to
6624 follow natural argument order (for use with fold etc.);
6625 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
6627 * Pure/General: output via the Isabelle channels of
6628 writeln/warning/error etc. is now passed through Output.output, with a
6629 hook for arbitrary transformations depending on the print_mode
6630 (cf. Output.add_mode -- the first active mode that provides a output
6631 function wins). Already formatted output may be embedded into further
6632 text via Output.raw; the result of Pretty.string_of/str_of and derived
6633 functions (string_of_term/cterm/thm etc.) is already marked raw to
6634 accommodate easy composition of diagnostic messages etc. Programmers
6635 rarely need to care about Output.output or Output.raw at all, with
6636 some notable exceptions: Output.output is required when bypassing the
6637 standard channels (writeln etc.), or in token translations to produce
6638 properly formatted results; Output.raw is required when capturing
6639 already output material that will eventually be presented to the user
6640 a second time. For the default print mode, both Output.output and
6641 Output.raw have no effect.
6643 * Pure/General: Output.time_accumulator NAME creates an operator ('a
6644 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
6645 cumulative results are displayed at the end of a batch session.
6647 * Pure/General: File.sysify_path and File.quote_sysify path have been
6648 replaced by File.platform_path and File.shell_path (with appropriate
6649 hooks). This provides a clean interface for unusual systems where the
6650 internal and external process view of file names are different.
6652 * Pure: more efficient orders for basic syntactic entities: added
6653 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
6654 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
6655 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
6656 orders now -- potential INCOMPATIBILITY for code that depends on a
6657 particular order for Symtab.keys, Symtab.dest, etc. (consider using
6658 Library.sort_strings on result).
6660 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
6661 fold_types traverse types/terms from left to right, observing natural
6662 argument order. Supercedes previous foldl_XXX versions, add_frees,
6663 add_vars etc. have been adapted as well: INCOMPATIBILITY.
6665 * Pure: name spaces have been refined, with significant changes of the
6666 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
6667 to extern(_table). The plain name entry path is superceded by a
6668 general 'naming' context, which also includes the 'policy' to produce
6669 a fully qualified name and external accesses of a fully qualified
6670 name; NameSpace.extend is superceded by context dependent
6671 Sign.declare_name. Several theory and proof context operations modify
6672 the naming context. Especially note Theory.restore_naming and
6673 ProofContext.restore_naming to get back to a sane state; note that
6674 Theory.add_path is no longer sufficient to recover from
6675 Theory.absolute_path in particular.
6677 * Pure: new flags short_names (default false) and unique_names
6678 (default true) for controlling output of qualified names. If
6679 short_names is set, names are printed unqualified. If unique_names is
6680 reset, the name prefix is reduced to the minimum required to achieve
6681 the original result when interning again, even if there is an overlap
6682 with earlier declarations.
6684 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
6685 now 'extend', and 'merge' gets an additional Pretty.pp argument
6686 (useful for printing error messages). INCOMPATIBILITY.
6688 * Pure: major reorganization of the theory context. Type Sign.sg and
6689 Theory.theory are now identified, referring to the universal
6690 Context.theory (see Pure/context.ML). Actual signature and theory
6691 content is managed as theory data. The old code and interfaces were
6692 spread over many files and structures; the new arrangement introduces
6693 considerable INCOMPATIBILITY to gain more clarity:
6695 Context -- theory management operations (name, identity, inclusion,
6696 parents, ancestors, merge, etc.), plus generic theory data;
6698 Sign -- logical signature and syntax operations (declaring consts,
6699 types, etc.), plus certify/read for common entities;
6701 Theory -- logical theory operations (stating axioms, definitions,
6702 oracles), plus a copy of logical signature operations (consts,
6703 types, etc.); also a few basic management operations (Theory.copy,
6706 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
6707 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
6708 for convenience -- they merely return the theory.
6710 * Pure: type Type.tsig is superceded by theory in most interfaces.
6712 * Pure: the Isar proof context type is already defined early in Pure
6713 as Context.proof (note that ProofContext.context and Proof.context are
6714 aliases, where the latter is the preferred name). This enables other
6715 Isabelle components to refer to that type even before Isar is present.
6717 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
6718 typeK, constK, axiomK, oracleK), but provide explicit operations for
6719 any of these kinds. For example, Sign.intern typeK is now
6720 Sign.intern_type, Theory.hide_space Sign.typeK is now
6721 Theory.hide_types. Also note that former
6722 Theory.hide_classes/types/consts are now
6723 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
6724 internalize their arguments! INCOMPATIBILITY.
6726 * Pure: get_thm interface (of PureThy and ProofContext) expects
6727 datatype thmref (with constructors Name and NameSelection) instead of
6728 plain string -- INCOMPATIBILITY;
6730 * Pure: cases produced by proof methods specify options, where NONE
6731 means to remove case bindings -- INCOMPATIBILITY in
6734 * Pure: the following operations retrieve axioms or theorems from a
6735 theory node or theory hierarchy, respectively:
6737 Theory.axioms_of: theory -> (string * term) list
6738 Theory.all_axioms_of: theory -> (string * term) list
6739 PureThy.thms_of: theory -> (string * thm) list
6740 PureThy.all_thms_of: theory -> (string * thm) list
6742 * Pure: print_tac now outputs the goal through the trace channel.
6744 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
6745 Reference Toplevel.debug (default false) controls detailed printing
6746 and tracing of low-level exceptions; Toplevel.profiling (default 0)
6747 controls execution profiling -- set to 1 for time and 2 for space
6748 (both increase the runtime).
6750 * Isar session: The initial use of ROOT.ML is now always timed,
6751 i.e. the log will show the actual process times, in contrast to the
6752 elapsed wall-clock time that the outer shell wrapper produces.
6754 * Simplifier: improved handling of bound variables (nameless
6755 representation, avoid allocating new strings). Simprocs that invoke
6756 the Simplifier recursively should use Simplifier.inherit_bounds to
6757 avoid local name clashes. Failure to do so produces warnings
6758 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
6759 for further details.
6761 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
6762 bindings for all theorems stored within a given theory; this may help
6763 in porting non-Isar theories to Isar ones, while keeping ML proof
6764 scripts for the time being.
6766 * ML operator HTML.with_charset specifies the charset begin used for
6767 generated HTML files. For example:
6769 HTML.with_charset "utf-8" use_thy "Hebrew";
6770 HTML.with_charset "utf-8" use_thy "Chinese";
6775 * Allow symlinks to all proper Isabelle executables (Isabelle,
6776 isabelle, isatool etc.).
6778 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
6779 isatool doc, isatool mkdir, display_drafts etc.).
6781 * isatool usedir: option -f allows specification of the ML file to be
6782 used by Isabelle; default is ROOT.ML.
6784 * New isatool version outputs the version identifier of the Isabelle
6785 distribution being used.
6787 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
6788 (containing Boolean satisfiability problems) into Isabelle/HOL
6793 New in Isabelle2004 (April 2004)
6794 --------------------------------
6798 * Provers/order.ML: new efficient reasoner for partial and linear orders.
6799 Replaces linorder.ML.
6801 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
6802 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
6803 (\<a>...\<z>), are now considered normal letters, and can therefore
6804 be used anywhere where an ASCII letter (a...zA...Z) has until
6805 now. COMPATIBILITY: This obviously changes the parsing of some
6806 terms, especially where a symbol has been used as a binder, say
6807 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
6808 as an identifier. Fix it by inserting a space around former
6809 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
6810 existing theory and ML files.
6812 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
6814 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
6815 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
6816 a normal (but invisible) letter. For multiple letter subscripts repeat
6817 \<^isub> like this: x\<^isub>1\<^isub>2.
6819 * Pure: There are now sub-/superscripts that can span more than one
6820 character. Text between \<^bsub> and \<^esub> is set in subscript in
6821 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
6822 superscript. The new control characters are not identifier parts.
6824 * Pure: Control-symbols of the form \<^raw:...> will literally print the
6825 content of "..." to the latex file instead of \isacntrl... . The "..."
6826 may consist of any printable characters excluding the end bracket >.
6828 * Pure: Using new Isar command "finalconsts" (or the ML functions
6829 Theory.add_finals or Theory.add_finals_i) it is now possible to
6830 declare constants "final", which prevents their being given a definition
6831 later. It is useful for constants whose behaviour is fixed axiomatically
6832 rather than definitionally, such as the meta-logic connectives.
6834 * Pure: 'instance' now handles general arities with general sorts
6835 (i.e. intersections of classes),
6837 * Presentation: generated HTML now uses a CSS style sheet to make layout
6838 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
6839 It can be changed to alter the colors/layout of generated pages.
6844 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
6845 cut_tac, subgoal_tac and thin_tac:
6846 - Now understand static (Isar) contexts. As a consequence, users of Isar
6847 locales are no longer forced to write Isar proof scripts.
6848 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
6850 - INCOMPATIBILITY: names of variables to be instantiated may no
6851 longer be enclosed in quotes. Instead, precede variable name with `?'.
6852 This is consistent with the instantiation attribute "where".
6854 * Attributes "where" and "of":
6855 - Now take type variables of instantiated theorem into account when reading
6856 the instantiation string. This fixes a bug that caused instantiated
6857 theorems to have too special types in some circumstances.
6858 - "where" permits explicit instantiations of type variables.
6860 * Calculation commands "moreover" and "also" no longer interfere with
6861 current facts ("this"), admitting arbitrary combinations with "then"
6865 - Goal statements involving the context element "includes" no longer
6866 generate theorems with internal delta predicates (those ending on
6867 "_axioms") in the premise.
6868 Resolve particular premise with <locale>.intro to obtain old form.
6869 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
6870 specification and "includes" elements in goal statement.
6871 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
6872 [intro?] and [elim?] (respectively) by default.
6873 - Experimental command for instantiation of locales in proof contexts:
6874 instantiate <label>[<attrs>]: <loc>
6875 Instantiates locale <loc> and adds all its theorems to the current context
6876 taking into account their attributes. Label and attrs are optional
6877 modifiers, like in theorem declarations. If present, names of
6878 instantiated theorems are qualified with <label>, and the attributes
6879 <attrs> are applied after any attributes these theorems might have already.
6880 If the locale has assumptions, a chained fact of the form
6881 "<loc> t1 ... tn" is expected from which instantiations of the parameters
6882 are derived. The command does not support old-style locales declared
6883 with "locale (open)".
6884 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
6886 * HOL: Tactic emulation methods induct_tac and case_tac understand static
6892 * Proof import: new image HOL4 contains the imported library from
6893 the HOL4 system with about 2500 theorems. It is imported by
6894 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
6895 can be used like any other Isabelle image. See
6896 HOL/Import/HOL/README for more information.
6899 - Much improved handling of linear and partial orders.
6900 Reasoners for linear and partial orders are set up for type classes
6901 "linorder" and "order" respectively, and are added to the default simpset
6902 as solvers. This means that the simplifier can build transitivity chains
6903 to solve goals from the assumptions.
6904 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
6905 of blast or auto after simplification become unnecessary because the goal
6906 is solved by simplification already.
6908 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
6909 all proved in axiomatic type classes for semirings, rings and fields.
6912 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
6913 now formalized using the Ring_and_Field theory mentioned above.
6914 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
6915 than before, because now they are set up once in a generic manner.
6916 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
6917 Look for the general versions in Ring_and_Field (and Power if they concern
6920 * Type "rat" of the rational numbers is now available in HOL-Complex.
6923 - Record types are now by default printed with their type abbreviation
6924 instead of the list of all field types. This can be configured via
6925 the reference "print_record_type_abbr".
6926 - Simproc "record_upd_simproc" for simplification of multiple updates added
6927 (not enabled by default).
6928 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
6929 EX x. x = sel r to True (not enabled by default).
6930 - Tactic "record_split_simp_tac" to split and simplify records added.
6932 * 'specification' command added, allowing for definition by
6933 specification. There is also an 'ax_specification' command that
6934 introduces the new constants axiomatically.
6936 * arith(_tac) is now able to generate counterexamples for reals as well.
6938 * HOL-Algebra: new locale "ring" for non-commutative rings.
6940 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
6941 definitions, thanks to Sava Krsti\'{c} and John Matthews.
6943 * HOL-Matrix: a first theory for matrices in HOL with an application of
6944 matrix theory to linear programming.
6946 * Unions and Intersections:
6947 The latex output syntax of UN and INT has been changed
6948 from "\Union x \in A. B" to "\Union_{x \in A} B"
6949 i.e. the index formulae has become a subscript.
6950 Similarly for "\Union x. B", and for \Inter instead of \Union.
6952 * Unions and Intersections over Intervals:
6953 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
6954 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
6955 like in normal math, and corresponding versions for < and for intersection.
6957 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
6958 lexicographic dictonary ordering has been added as "lexord".
6960 * ML: the legacy theory structures Int and List have been removed. They had
6961 conflicted with ML Basis Library structures having the same names.
6963 * 'refute' command added to search for (finite) countermodels. Only works
6964 for a fragment of HOL. The installation of an external SAT solver is
6965 highly recommended. See "HOL/Refute.thy" for details.
6967 * 'quickcheck' command: Allows to find counterexamples by evaluating
6968 formulae under an assignment of free variables to random values.
6969 In contrast to 'refute', it can deal with inductive datatypes,
6970 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
6976 * Streams now come with concatenation and are part of the HOLCF image
6980 New in Isabelle2003 (May 2003)
6981 ------------------------------
6985 * Provers/simplifier:
6987 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
6988 Assumptions are now subject to complete mutual simplification,
6989 not just from left to right. The simplifier now preserves
6990 the order of assumptions.
6992 Potential INCOMPATIBILITY:
6994 -- simp sometimes diverges where the old version did
6995 not, e.g. invoking simp on the goal
6997 [| P (f x); y = x; f x = f y |] ==> Q
6999 now gives rise to the infinite reduction sequence
7001 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
7003 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
7006 -- Tactics combining classical reasoner and simplification (such as auto)
7007 are also affected by this change, because many of them rely on
7008 simp. They may sometimes diverge as well or yield a different numbers
7009 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
7010 in case of problems. Sometimes subsequent calls to the classical
7011 reasoner will fail because a preceeding call to the simplifier too
7012 eagerly simplified the goal, e.g. deleted redundant premises.
7014 - The simplifier trace now shows the names of the applied rewrite rules
7016 - You can limit the number of recursive invocations of the simplifier
7017 during conditional rewriting (where the simplifie tries to solve the
7018 conditions before applying the rewrite rule):
7019 ML "simp_depth_limit := n"
7020 where n is an integer. Thus you can force termination where previously
7021 the simplifier would diverge.
7023 - Accepts free variables as head terms in congruence rules. Useful in Isar.
7025 - No longer aborts on failed congruence proof. Instead, the
7026 congruence is ignored.
7028 * Pure: New generic framework for extracting programs from constructive
7029 proofs. See HOL/Extraction.thy for an example instantiation, as well
7030 as HOL/Extraction for some case studies.
7032 * Pure: The main goal of the proof state is no longer shown by default, only
7033 the subgoals. This behaviour is controlled by a new flag.
7034 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
7035 (ML: Proof.show_main_goal).
7037 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
7038 rules whose conclusion matches subgoal 1:
7039 PG menu: Isabelle/Isar -> Show me -> matching rules
7040 The rules are ordered by how closely they match the subgoal.
7041 In particular, rules that solve a subgoal outright are displayed first
7042 (or rather last, the way they are printed).
7043 (ML: ProofGeneral.print_intros())
7045 * Pure: New flag trace_unify_fail causes unification to print
7046 diagnostic information (PG: in trace buffer) when it fails. This is
7047 useful for figuring out why single step proofs like rule, erule or
7050 * Pure: Locale specifications now produce predicate definitions
7051 according to the body of text (covering assumptions modulo local
7052 definitions); predicate "loc_axioms" covers newly introduced text,
7053 while "loc" is cumulative wrt. all included locale expressions; the
7054 latter view is presented only on export into the global theory
7055 context; potential INCOMPATIBILITY, use "(open)" option to fall back
7056 on the old view without predicates;
7058 * Pure: predefined locales "var" and "struct" are useful for sharing
7059 parameters (as in CASL, for example); just specify something like
7060 ``var x + var y + struct M'' as import;
7062 * Pure: improved thms_containing: proper indexing of facts instead of
7063 raw theorems; check validity of results wrt. current name space;
7064 include local facts of proof configuration (also covers active
7065 locales), cover fixed variables in index; may use "_" in term
7066 specification; an optional limit for the number of printed facts may
7067 be given (the default is 40);
7069 * Pure: disallow duplicate fact bindings within new-style theory files
7072 * Provers: improved induct method: assumptions introduced by case
7073 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
7074 the goal statement); "foo" still refers to all facts collectively;
7076 * Provers: the function blast.overloaded has been removed: all constants
7077 are regarded as potentially overloaded, which improves robustness in exchange
7078 for slight decrease in efficiency;
7080 * Provers/linorder: New generic prover for transitivity reasoning over
7081 linear orders. Note: this prover is not efficient!
7083 * Isar: preview of problems to finish 'show' now produce an error
7084 rather than just a warning (in interactive mode);
7091 - Produces a counter example if it cannot prove a goal.
7092 Note that the counter example may be spurious if the goal is not a formula
7093 of quantifier-free linear arithmetic.
7094 In ProofGeneral the counter example appears in the trace buffer.
7096 - Knows about div k and mod k where k is a numeral of type nat or int.
7098 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
7099 linear arithmetic fails. This takes account of quantifiers and divisibility.
7100 Presburger arithmetic can also be called explicitly via presburger(_tac).
7102 * simp's arithmetic capabilities have been enhanced a bit: it now
7103 takes ~= in premises into account (by performing a case split);
7105 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
7106 are distributed over a sum of terms;
7108 * New tactic "trans_tac" and method "trans" instantiate
7109 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
7112 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
7113 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
7115 * 'typedef' command has new option "open" to suppress the set
7118 * functions Min and Max on finite sets have been introduced (theory
7121 * attribute [symmetric] now works for relations as well; it turns
7122 (x,y) : R^-1 into (y,x) : R, and vice versa;
7124 * induct over a !!-quantified statement (say !!x1..xn):
7125 each "case" automatically performs "fix x1 .. xn" with exactly those names.
7127 * Map: `empty' is no longer a constant but a syntactic abbreviation for
7128 %x. None. Warning: empty_def now refers to the previously hidden definition
7131 * Algebra: formalization of classical algebra. Intended as base for
7132 any algebraic development in Isabelle. Currently covers group theory
7133 (up to Sylow's theorem) and ring theory (Universal Property of
7134 Univariate Polynomials). Contributions welcome;
7136 * GroupTheory: deleted, since its material has been moved to Algebra;
7138 * Complex: new directory of the complex numbers with numeric constants,
7139 nonstandard complex numbers, and some complex analysis, standard and
7140 nonstandard (Jacques Fleuriot);
7142 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
7144 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
7147 * Real/HahnBanach: updated and adapted to locales;
7149 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
7152 * UNITY: added the Meier-Sanders theory of progress sets;
7154 * MicroJava: bytecode verifier and lightweight bytecode verifier
7155 as abstract algorithms, instantiated to the JVM;
7157 * Bali: Java source language formalization. Type system, operational
7158 semantics, axiomatic semantics. Supported language features:
7159 classes, interfaces, objects,virtual methods, static methods,
7160 static/instance fields, arrays, access modifiers, definite
7161 assignment, exceptions.
7166 * ZF/Constructible: consistency proof for AC (Gdel's constructible
7169 * Main ZF: virtually all theories converted to new-style format;
7174 * Pure: Tactic.prove provides sane interface for internal proofs;
7175 omits the infamous "standard" operation, so this is more appropriate
7176 than prove_goalw_cterm in many situations (e.g. in simprocs);
7178 * Pure: improved error reporting of simprocs;
7180 * Provers: Simplifier.simproc(_i) provides sane interface for setting
7184 *** Document preparation ***
7186 * uses \par instead of \\ for line breaks in theory text. This may
7187 shift some page breaks in large documents. To get the old behaviour
7188 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
7190 * minimized dependencies of isabelle.sty and isabellesym.sty on
7193 * \<euro> now needs package babel/greek instead of marvosym (which
7196 * normal size for \<zero>...\<nine> (uses \mathbf instead of
7201 New in Isabelle2002 (March 2002)
7202 --------------------------------
7204 *** Document preparation ***
7206 * greatly simplified document preparation setup, including more
7207 graceful interpretation of isatool usedir -i/-d/-D options, and more
7208 instructive isatool mkdir; users should basically be able to get
7209 started with "isatool mkdir HOL Test && isatool make"; alternatively,
7210 users may run a separate document processing stage manually like this:
7211 "isatool usedir -D output HOL Test && isatool document Test/output";
7213 * theory dependency graph may now be incorporated into documents;
7214 isatool usedir -g true will produce session_graph.eps/.pdf for use
7215 with \includegraphics of LaTeX;
7217 * proper spacing of consecutive markup elements, especially text
7218 blocks after section headings;
7220 * support bold style (for single symbols only), input syntax is like
7221 this: "\<^bold>\<alpha>" or "\<^bold>A";
7223 * \<bullet> is now output as bold \cdot by default, which looks much
7224 better in printed text;
7226 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
7227 note that these symbols are currently unavailable in Proof General /
7228 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
7230 * isatool latex no longer depends on changed TEXINPUTS, instead
7231 isatool document copies the Isabelle style files to the target
7237 * Pure/Provers: improved proof by cases and induction;
7238 - 'case' command admits impromptu naming of parameters (such as
7240 - 'induct' method divinates rule instantiation from the inductive
7241 claim; no longer requires excessive ?P bindings for proper
7242 instantiation of cases;
7243 - 'induct' method properly enumerates all possibilities of set/type
7244 rules; as a consequence facts may be also passed through *type*
7245 rules without further ado;
7246 - 'induct' method now derives symbolic cases from the *rulified*
7247 rule (before it used to rulify cases stemming from the internal
7248 atomized version); this means that the context of a non-atomic
7249 statement becomes is included in the hypothesis, avoiding the
7250 slightly cumbersome show "PROP ?case" form;
7251 - 'induct' may now use elim-style induction rules without chaining
7252 facts, using ``missing'' premises from the goal state; this allows
7253 rules stemming from inductive sets to be applied in unstructured
7254 scripts, while still benefitting from proper handling of non-atomic
7255 statements; NB: major inductive premises need to be put first, all
7256 the rest of the goal is passed through the induction;
7257 - 'induct' proper support for mutual induction involving non-atomic
7258 rule statements (uses the new concept of simultaneous goals, see
7260 - append all possible rule selections, but only use the first
7261 success (no backtracking);
7262 - removed obsolete "(simplified)" and "(stripped)" options of methods;
7263 - undeclared rule case names default to numbers 1, 2, 3, ...;
7264 - added 'print_induct_rules' (covered by help item in recent Proof
7266 - moved induct/cases attributes to Pure, methods to Provers;
7267 - generic method setup instantiated for FOL and HOL;
7269 * Pure: support multiple simultaneous goal statements, for example
7270 "have a: A and b: B" (same for 'theorem' etc.); being a pure
7271 meta-level mechanism, this acts as if several individual goals had
7272 been stated separately; in particular common proof methods need to be
7273 repeated in order to cover all claims; note that a single elimination
7274 step is *not* sufficient to establish the two conjunctions, so this
7277 assume "A & B" then have A and B .. (*".." fails*)
7279 better use "obtain" in situations as above; alternative refer to
7280 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
7282 * Pure: proper integration with ``locales''; unlike the original
7283 version by Florian Kammller, Isar locales package high-level proof
7284 contexts rather than raw logical ones (e.g. we admit to include
7285 attributes everywhere); operations on locales include merge and
7286 rename; support for implicit arguments (``structures''); simultaneous
7287 type-inference over imports and text; see also HOL/ex/Locales.thy for
7290 * Pure: the following commands have been ``localized'', supporting a
7291 target locale specification "(in name)": 'lemma', 'theorem',
7292 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
7293 stored both within the locale and at the theory level (exported and
7294 qualified by the locale name);
7296 * Pure: theory goals may now be specified in ``long'' form, with
7297 ad-hoc contexts consisting of arbitrary locale elements. for example
7298 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
7299 definitions may be given, too); the result is a meta-level rule with
7300 the context elements being discharged in the obvious way;
7302 * Pure: new proof command 'using' allows to augment currently used
7303 facts after a goal statement ('using' is syntactically analogous to
7304 'apply', but acts on the goal's facts only); this allows chained facts
7305 to be separated into parts given before and after a claim, as in
7306 ``from a and b have C using d and e <proof>'';
7308 * Pure: renamed "antecedent" case to "rule_context";
7310 * Pure: new 'judgment' command records explicit information about the
7311 object-logic embedding (used by several tools internally); no longer
7312 use hard-wired "Trueprop";
7314 * Pure: added 'corollary' command;
7316 * Pure: fixed 'token_translation' command;
7318 * Pure: removed obsolete 'exported' attribute;
7320 * Pure: dummy pattern "_" in is/let is now automatically lifted over
7321 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
7322 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
7324 * Pure: method 'atomize' presents local goal premises as object-level
7325 statements (atomic meta-level propositions); setup controlled via
7326 rewrite rules declarations of 'atomize' attribute; example
7327 application: 'induct' method with proper rule statements in improper
7330 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
7331 now consider the syntactic context of assumptions, giving a better
7332 chance to get type-inference of the arguments right (this is
7333 especially important for locales);
7335 * Pure: "sorry" no longer requires quick_and_dirty in interactive
7338 * Pure/obtain: the formal conclusion "thesis", being marked as
7339 ``internal'', may no longer be reference directly in the text;
7340 potential INCOMPATIBILITY, may need to use "?thesis" in rare
7343 * Pure: generic 'sym' attribute which declares a rule both as pure
7344 'elim?' and for the 'symmetric' operation;
7346 * Pure: marginal comments ``--'' may now occur just anywhere in the
7347 text; the fixed correlation with particular command syntax has been
7350 * Pure: new method 'rules' is particularly well-suited for proof
7351 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
7352 but often produces more compact proof terms with less detours;
7354 * Pure/Provers/classical: simplified integration with pure rule
7355 attributes and methods; the classical "intro?/elim?/dest?"
7356 declarations coincide with the pure ones; the "rule" method no longer
7357 includes classically swapped intros; "intro" and "elim" methods no
7358 longer pick rules from the context; also got rid of ML declarations
7359 AddXIs/AddXEs/AddXDs; all of this has some potential for
7362 * Provers/classical: attribute 'swapped' produces classical inversions
7363 of introduction rules;
7365 * Provers/simplifier: 'simplified' attribute may refer to explicit
7366 rules instead of full simplifier context; 'iff' attribute handles
7369 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
7371 * HOL: 'recdef' now fails on unfinished automated proofs, use
7372 "(permissive)" option to recover old behavior;
7374 * HOL: 'inductive' no longer features separate (collective) attributes
7375 for 'intros' (was found too confusing);
7377 * HOL: properly declared induction rules less_induct and
7383 * HOL: moved over to sane numeral syntax; the new policy is as
7386 - 0 and 1 are polymorphic constants, which are defined on any
7387 numeric type (nat, int, real etc.);
7389 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
7390 binary representation internally;
7392 - type nat has special constructor Suc, and generally prefers Suc 0
7393 over 1::nat and Suc (Suc 0) over 2::nat;
7395 This change may cause significant problems of INCOMPATIBILITY; here
7396 are some hints on converting existing sources:
7398 - due to the new "num" token, "-0" and "-1" etc. are now atomic
7399 entities, so expressions involving "-" (unary or binary minus) need
7400 to be spaced properly;
7402 - existing occurrences of "1" may need to be constraint "1::nat" or
7403 even replaced by Suc 0; similar for old "2";
7405 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
7407 - remove all special provisions on numerals in proofs;
7409 * HOL: simp rules nat_number expand numerals on nat to Suc/0
7410 representation (depends on bin_arith_simps in the default context);
7412 * HOL: symbolic syntax for x^2 (numeral 2);
7414 * HOL: the class of all HOL types is now called "type" rather than
7415 "term"; INCOMPATIBILITY, need to adapt references to this type class
7416 in axclass/classes, instance/arities, and (usually rare) occurrences
7417 in typings (of consts etc.); internally the class is called
7418 "HOL.type", ML programs should refer to HOLogic.typeS;
7420 * HOL/record package improvements:
7421 - new derived operations "fields" to build a partial record section,
7422 "extend" to promote a fixed record to a record scheme, and
7423 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
7424 declared as simp by default;
7425 - shared operations ("more", "fields", etc.) now need to be always
7426 qualified) --- potential INCOMPATIBILITY;
7427 - removed "make_scheme" operations (use "make" with "extend") --
7429 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
7430 - provides cases/induct rules for use with corresponding Isar
7431 methods (for concrete records, record schemes, concrete more
7432 parts, and schematic more parts -- in that order);
7433 - internal definitions directly based on a light-weight abstract
7434 theory of product types over typedef rather than datatype;
7436 * HOL: generic code generator for generating executable ML code from
7437 specifications; specific support for HOL constructs such as inductive
7438 datatypes and sets, as well as recursive functions; can be invoked
7439 via 'generate_code' theory section;
7441 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
7443 * HOL: consolidated and renamed several theories. In particular:
7444 Ord.thy has been absorbed into HOL.thy
7445 String.thy has been absorbed into List.thy
7447 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
7448 (beware of argument permutation!);
7450 * HOL: linorder_less_split superseded by linorder_cases;
7452 * HOL/List: "nodups" renamed to "distinct";
7454 * HOL: added "The" definite description operator; move Hilbert's "Eps"
7455 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
7456 - Ex_def has changed, now need to use some_eq_ex
7458 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
7459 in this (rare) case use:
7461 delSWrapper "split_all_tac"
7462 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
7464 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
7467 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
7468 Isabelle's type classes, ^ on functions and relations has too general
7469 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
7470 necessary to attach explicit type constraints;
7472 * HOL/Relation: the prefix name of the infix "O" has been changed from
7473 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
7474 renamed accordingly (eg "compI" -> "rel_compI").
7476 * HOL: syntax translations now work properly with numerals and records
7479 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
7480 of "lam" -- INCOMPATIBILITY;
7482 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
7483 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
7484 renamed "Product_Type.unit";
7486 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
7488 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
7489 the "cases" method);
7491 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
7494 * HOL/IMP: updated and converted to new-style theory format; several
7495 parts turned into readable document, with proper Isar proof texts and
7496 some explanations (by Gerwin Klein);
7498 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
7500 * HOL-Hyperreal is now a logic image;
7505 * Isar: consts/constdefs supports mixfix syntax for continuous
7508 * Isar: domain package adapted to new-style theory format, e.g. see
7511 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
7512 potential INCOMPATIBILITY; now use plain induct_tac instead of former
7513 lift.induct_tac, always use UU instead of Undef;
7515 * HOLCF/IMP: updated and converted to new-style theory;
7520 * Isar: proper integration of logic-specific tools and packages,
7521 including theory commands '(co)inductive', '(co)datatype',
7522 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
7523 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
7525 * theory Main no longer includes AC; for the Axiom of Choice, base
7526 your theory on Main_ZFC;
7528 * the integer library now covers quotients and remainders, with many
7529 laws relating division to addition, multiplication, etc.;
7531 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
7532 typeless version of the formalism;
7534 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
7537 * ZF/Induct: new directory for examples of inductive definitions,
7538 including theory Multiset for multiset orderings; converted to
7539 new-style theory format;
7541 * ZF: many new theorems about lists, ordinals, etc.;
7546 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
7547 variable proof controls level of detail: 0 = no proofs (only oracle
7548 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
7549 also ref manual for further ML interfaces;
7551 * Pure/axclass: removed obsolete ML interface
7552 goal_subclass/goal_arity;
7554 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
7555 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
7556 separate tokens, so expressions involving minus need to be spaced
7559 * Pure/syntax: support non-oriented infixes, using keyword "infix"
7560 rather than "infixl" or "infixr";
7562 * Pure/syntax: concrete syntax for dummy type variables admits genuine
7563 sort constraint specifications in type inference; e.g. "x::_::foo"
7564 ensures that the type of "x" is of sort "foo" (but not necessarily a
7567 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
7568 control output of nested => (types); the default behavior is
7571 * Pure/syntax: builtin parse translation for "_constify" turns valued
7572 tokens into AST constants;
7574 * Pure/syntax: prefer later declarations of translations and print
7575 translation functions; potential INCOMPATIBILITY: need to reverse
7576 multiple declarations for same syntax element constant;
7578 * Pure/show_hyps reset by default (in accordance to existing Isar
7581 * Provers/classical: renamed addaltern to addafter, addSaltern to
7584 * Provers/clasimp: ``iff'' declarations now handle conditional rules
7587 * system: tested support for MacOS X; should be able to get Isabelle +
7588 Proof General to work in a plain Terminal after installing Poly/ML
7589 (e.g. from the Isabelle distribution area) and GNU bash alone
7590 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
7591 support requires further installations, e.g. from
7592 http://fink.sourceforge.net/);
7594 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
7596 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
7597 of 40 MB), cf. ML_OPTIONS;
7599 * system: Proof General keywords specification is now part of the
7600 Isabelle distribution (see etc/isar-keywords.el);
7602 * system: support for persistent Proof General sessions (refrain from
7603 outdating all loaded theories on startup); user may create writable
7604 logic images like this: ``isabelle -q HOL Test'';
7606 * system: smart selection of Isabelle process versus Isabelle
7607 interface, accommodates case-insensitive file systems (e.g. HFS+); may
7608 run both "isabelle" and "Isabelle" even if file names are badly
7609 damaged (executable inspects the case of the first letter of its own
7610 name); added separate "isabelle-process" and "isabelle-interface";
7612 * system: refrain from any attempt at filtering input streams; no
7613 longer support ``8bit'' encoding of old isabelle font, instead proper
7614 iso-latin characters may now be used; the related isatools
7615 "symbolinput" and "nonascii" have disappeared as well;
7617 * system: removed old "xterm" interface (the print modes "xterm" and
7618 "xterm_color" are still available for direct use in a suitable
7623 New in Isabelle99-2 (February 2001)
7624 -----------------------------------
7626 *** Overview of INCOMPATIBILITIES ***
7628 * HOL: please note that theories in the Library and elsewhere often use the
7629 new-style (Isar) format; to refer to their theorems in an ML script you must
7630 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
7632 * HOL: inductive package no longer splits induction rule aggressively,
7633 but only as far as specified by the introductions given; the old
7634 format may be recovered via ML function complete_split_rule or attribute
7635 'split_rule (complete)';
7637 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
7638 gfp_Tarski to gfp_unfold;
7640 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
7642 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
7643 relation); infix "^^" has been renamed "``"; infix "``" has been
7644 renamed "`"; "univalent" has been renamed "single_valued";
7646 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
7649 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
7651 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
7653 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
7654 consequence, it is no longer monotonic wrt. the local goal context
7655 (which is now passed through the inductive cases);
7657 * Document preparation: renamed standard symbols \<ll> to \<lless> and
7658 \<gg> to \<ggreater>;
7661 *** Document preparation ***
7663 * \isabellestyle{NAME} selects version of Isabelle output (currently
7664 available: are "it" for near math-mode best-style output, "sl" for
7665 slanted text style, and "tt" for plain type-writer; if no
7666 \isabellestyle command is given, output is according to slanted
7669 * support sub/super scripts (for single symbols only), input syntax is
7670 like this: "A\<^sup>*" or "A\<^sup>\<star>";
7672 * some more standard symbols; see Appendix A of the system manual for
7673 the complete list of symbols defined in isabellesym.sty;
7675 * improved isabelle style files; more abstract symbol implementation
7676 (should now use \isamath{...} and \isatext{...} in custom symbol
7679 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
7680 state; Note that presentation of goal states does not conform to
7681 actual human-readable proof documents. Please do not include goal
7682 states into document output unless you really know what you are doing!
7684 * proper indentation of antiquoted output with proportional LaTeX
7687 * no_document ML operator temporarily disables LaTeX document
7690 * isatool unsymbolize tunes sources for plain ASCII communication;
7695 * Pure: Isar now suffers initial goal statements to contain unbound
7696 schematic variables (this does not conform to actual readable proof
7697 documents, due to unpredictable outcome and non-compositional proof
7698 checking); users who know what they are doing may use schematic goals
7699 for Prolog-style synthesis of proven results;
7701 * Pure: assumption method (an implicit finishing) now handles actual
7704 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
7705 initial goal, declare "that" only as Pure intro (only for single
7706 steps); the "that" rule assumption may now be involved in implicit
7707 finishing, thus ".." becomes a feasible for trivial obtains;
7709 * Pure: default proof step now includes 'intro_classes'; thus trivial
7710 instance proofs may be performed by "..";
7712 * Pure: ?thesis / ?this / "..." now work for pure meta-level
7715 * Pure: more robust selection of calculational rules;
7717 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
7718 rule (as well as the assumption rule);
7720 * Pure: 'thm_deps' command visualizes dependencies of theorems and
7721 lemmas, using the graph browser tool;
7723 * Pure: predict failure of "show" in interactive mode;
7725 * Pure: 'thms_containing' now takes actual terms as arguments;
7727 * HOL: improved method 'induct' --- now handles non-atomic goals
7728 (potential INCOMPATIBILITY); tuned error handling;
7730 * HOL: cases and induct rules now provide explicit hints about the
7731 number of facts to be consumed (0 for "type" and 1 for "set" rules);
7732 any remaining facts are inserted into the goal verbatim;
7734 * HOL: local contexts (aka cases) may now contain term bindings as
7735 well; the 'cases' and 'induct' methods new provide a ?case binding for
7736 the result to be shown in each case;
7738 * HOL: added 'recdef_tc' command;
7740 * isatool convert assists in eliminating legacy ML scripts;
7745 * HOL/Library: a collection of generic theories to be used together
7746 with main HOL; the theory loader path already includes this directory
7747 by default; the following existing theories have been moved here:
7748 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
7749 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
7751 * HOL/Unix: "Some aspects of Unix file-system security", a typical
7752 modelling and verification task performed in Isabelle/HOL +
7753 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
7755 * HOL/Algebra: special summation operator SUM no longer exists, it has
7756 been replaced by setsum; infix 'assoc' now has priority 50 (like
7757 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
7758 'domain', this makes the theory consistent with mathematical
7761 * HOL basics: added overloaded operations "inverse" and "divide"
7762 (infix "/"), syntax for generic "abs" operation, generic summation
7765 * HOL/typedef: simplified package, provide more useful rules (see also
7768 * HOL/datatype: induction rule for arbitrarily branching datatypes is
7769 now expressed as a proper nested rule (old-style tactic scripts may
7770 require atomize_strip_tac to cope with non-atomic premises);
7772 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
7773 to "split_conv" (old name still available for compatibility);
7775 * HOL: improved concrete syntax for strings (e.g. allows translation
7776 rules with string literals);
7778 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
7779 and Fleuriot's mechanization of analysis, including the transcendental
7780 functions for the reals;
7782 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
7787 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
7788 "lam" is displayed as TWO lambda-symbols
7790 * CTT: theory Main now available, containing everything (that is, Bool
7796 * Pure: the Simplifier has been implemented properly as a derived rule
7797 outside of the actual kernel (at last!); the overall performance
7798 penalty in practical applications is about 50%, while reliability of
7799 the Isabelle inference kernel has been greatly improved;
7801 * print modes "brackets" and "no_brackets" control output of nested =>
7802 (types) and ==> (props); the default behaviour is "brackets";
7804 * Provers: fast_tac (and friends) now handle actual object-logic rules
7805 as assumptions as well;
7807 * system: support Poly/ML 4.0;
7809 * system: isatool install handles KDE version 1 or 2;
7813 New in Isabelle99-1 (October 2000)
7814 ----------------------------------
7816 *** Overview of INCOMPATIBILITIES ***
7818 * HOL: simplification of natural numbers is much changed; to partly
7819 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
7820 issue the following ML commands:
7822 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
7823 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
7825 * HOL: simplification no longer dives into case-expressions; this is
7826 controlled by "t.weak_case_cong" for each datatype t;
7828 * HOL: nat_less_induct renamed to less_induct;
7830 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
7831 fixsome to patch .thy and .ML sources automatically;
7833 select_equality -> some_equality
7834 select_eq_Ex -> some_eq_ex
7835 selectI2EX -> someI2_ex
7838 select1_equality -> some1_equality
7839 Eps_sym_eq -> some_sym_eq_trivial
7840 Eps_eq -> some_eq_trivial
7842 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
7844 * HOL: removed obsolete theorem binding expand_if (refer to split_if
7847 * HOL: the recursion equations generated by 'recdef' are now called
7848 f.simps instead of f.rules;
7850 * HOL: qed_spec_mp now also handles bounded ALL as well;
7852 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
7853 sometimes be needed;
7855 * HOL: the constant for "f``x" is now "image" rather than "op ``";
7857 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
7859 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
7860 product is now "<*>" instead of "Times"; the lexicographic product is
7861 now "<*lex*>" instead of "**";
7863 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
7864 of main HOL, but was unused); better use HOL's datatype package;
7866 * HOL: removed "symbols" syntax for constant "override" of theory Map;
7867 the old syntax may be recovered as follows:
7870 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
7871 (infixl "\\<oplus>" 100)
7873 * HOL/Real: "rabs" replaced by overloaded "abs" function;
7875 * HOL/ML: even fewer consts are declared as global (see theories Ord,
7876 Lfp, Gfp, WF); this only affects ML packages that refer to const names
7879 * HOL and ZF: syntax for quotienting wrt an equivalence relation
7880 changed from A/r to A//r;
7882 * ZF: new treatment of arithmetic (nat & int) may break some old
7885 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
7886 rulify -> rule_format, elimify -> elim_format, ...);
7888 * Isar/Provers: intro/elim/dest attributes changed; renamed
7889 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
7890 should have to change intro!! to intro? only); replaced "delrule" by
7893 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
7895 * Provers: strengthened force_tac by using new first_best_tac;
7897 * LaTeX document preparation: several changes of isabelle.sty (see
7901 *** Document preparation ***
7903 * formal comments (text blocks etc.) in new-style theories may now
7904 contain antiquotations of thm/prop/term/typ/text to be presented
7905 according to latex print mode; concrete syntax is like this:
7906 @{term[show_types] "f(x) = a + x"};
7908 * isatool mkdir provides easy setup of Isabelle session directories,
7909 including proper document sources;
7911 * generated LaTeX sources are now deleted after successful run
7912 (isatool document -c); may retain a copy somewhere else via -D option
7915 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
7916 style files, achieving self-contained LaTeX sources and simplifying
7919 * old-style theories now produce (crude) LaTeX output as well;
7921 * browser info session directories are now self-contained (may be put
7922 on WWW server seperately); improved graphs of nested sessions; removed
7923 graph for 'all sessions';
7925 * several improvements in isabelle style files; \isabellestyle{it}
7926 produces fake math mode output; \isamarkupheader is now \section by
7927 default; see lib/texinputs/isabelle.sty etc.;
7932 * Isar/Pure: local results and corresponding term bindings are now
7933 subject to Hindley-Milner polymorphism (similar to ML); this
7934 accommodates incremental type-inference very nicely;
7936 * Isar/Pure: new derived language element 'obtain' supports
7937 generalized existence reasoning;
7939 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
7940 support accumulation of results, without applying any rules yet;
7941 useful to collect intermediate results without explicit name
7942 references, and for use with transitivity rules with more than 2
7945 * Isar/Pure: scalable support for case-analysis type proofs: new
7946 'case' language element refers to local contexts symbolically, as
7947 produced by certain proof methods; internally, case names are attached
7948 to theorems as "tags";
7950 * Isar/Pure: theory command 'hide' removes declarations from
7951 class/type/const name spaces;
7953 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
7954 indicate potential overloading;
7956 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
7958 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
7959 "{a,b,c}" instead of {a,b,c};
7961 * Isar/Pure now provides its own version of intro/elim/dest
7962 attributes; useful for building new logics, but beware of confusion
7963 with the version in Provers/classical;
7965 * Isar/Pure: the local context of (non-atomic) goals is provided via
7966 case name 'antecedent';
7968 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
7969 to the current context is now done automatically);
7971 * Isar/Pure: theory command 'method_setup' provides a simple interface
7972 for definining proof methods in ML;
7974 * Isar/Provers: intro/elim/dest attributes changed; renamed
7975 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
7976 most cases, one should have to change intro!! to intro? only);
7977 replaced "delrule" by "rule del";
7979 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
7980 'symmetric' attribute (the latter supercedes [RS sym]);
7982 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
7983 method modifier); 'simp' method: 'only:' modifier removes loopers as
7984 well (including splits);
7986 * Isar/Provers: Simplifier and Classical methods now support all kind
7987 of modifiers used in the past, including 'cong', 'iff', etc.
7989 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
7990 of Simplifier and Classical reasoner);
7992 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
7993 now support named cases; major packages (inductive, datatype, primrec,
7994 recdef) support case names and properly name parameters;
7996 * Isar/HOL: new transitivity rules for substitution in inequalities --
7997 monotonicity conditions are extracted to be proven at end of
8000 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
8003 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
8004 split_if split_if_asm; datatype package provides theorems foo.splits =
8005 foo.split foo.split_asm for each datatype;
8007 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
8008 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
8009 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
8010 use "(cases (simplified))" method in proper proof texts);
8012 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
8014 * Isar: names of theorems etc. may be natural numbers as well;
8016 * Isar: 'pr' command: optional arguments for goals_limit and
8017 ProofContext.prems_limit; no longer prints theory contexts, but only
8020 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
8021 additional print modes to be specified; e.g. "pr(latex)" will print
8022 proof state according to the Isabelle LaTeX style;
8024 * Isar: improved support for emulating tactic scripts, including proof
8025 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
8026 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
8027 (for HOL datatypes);
8029 * Isar: simplified (more robust) goal selection of proof methods: 1st
8030 goal, all goals, or explicit goal specifier (tactic emulation); thus
8031 'proof method scripts' have to be in depth-first order;
8033 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
8035 * Isar: removed 'help' command, which hasn't been too helpful anyway;
8036 should instead use individual commands for printing items
8037 (print_commands, print_methods etc.);
8039 * Isar: added 'nothing' --- the empty list of theorems;
8044 * HOL/MicroJava: formalization of a fragment of Java, together with a
8045 corresponding virtual machine and a specification of its bytecode
8046 verifier and a lightweight bytecode verifier, including proofs of
8047 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
8048 Cornelia Pusch (see also the homepage of project Bali at
8049 http://isabelle.in.tum.de/Bali/);
8051 * HOL/Algebra: new theory of rings and univariate polynomials, by
8054 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
8055 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
8058 * HOL/Lattice: fundamental concepts of lattice theory and order
8059 structures, including duals, properties of bounds versus algebraic
8060 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
8061 Theorem for complete lattices etc.; may also serve as a demonstration
8062 for abstract algebraic reasoning using axiomatic type classes, and
8063 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
8065 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
8068 * HOL/IMPP: extension of IMP with local variables and mutually
8069 recursive procedures, by David von Oheimb;
8071 * HOL/Lambda: converted into new-style theory and document;
8073 * HOL/ex/Multiquote: example of multiple nested quotations and
8074 anti-quotations -- basically a generalized version of de-Bruijn
8075 representation; very useful in avoiding lifting of operations;
8077 * HOL/record: added general record equality rule to simpset; fixed
8078 select-update simplification procedure to handle extended records as
8079 well; admit "r" as field name;
8081 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
8082 other numeric types and also as the identity of groups, rings, etc.;
8084 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
8085 Types nat and int belong to this axclass;
8087 * HOL: greatly improved simplification involving numerals of type nat, int, real:
8088 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
8089 i*j + k + j*#3*i simplifies to #4*(i*j) + k
8090 two terms #m*u and #n*u are replaced by #(m+n)*u
8091 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
8092 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
8093 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
8095 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
8096 powerful prover for predicate logic but knows nothing of clasets; see
8097 ex/mesontest.ML and ex/mesontest2.ML for example applications;
8099 * HOL: new version of "case_tac" subsumes both boolean case split and
8100 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
8101 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
8103 * HOL: simplification no longer dives into case-expressions: only the
8104 selector expression is simplified, but not the remaining arms; to
8105 enable full simplification of case-expressions for datatype t, you may
8106 remove t.weak_case_cong from the simpset, either globally (Delcongs
8107 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
8109 * HOL/recdef: the recursion equations generated by 'recdef' for
8110 function 'f' are now called f.simps instead of f.rules; if all
8111 termination conditions are proved automatically, these simplification
8112 rules are added to the simpset, as in primrec; rules may be named
8113 individually as well, resulting in a separate list of theorems for
8116 * HOL/While is a new theory that provides a while-combinator. It
8117 permits the definition of tail-recursive functions without the
8118 provision of a termination measure. The latter is necessary once the
8119 invariant proof rule for while is applied.
8121 * HOL: new (overloaded) notation for the set of elements below/above
8122 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
8124 * HOL: theorems impI, allI, ballI bound as "strip";
8126 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
8127 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
8128 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
8130 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8132 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
8133 main HOL, but was unused);
8135 * HOL: fewer consts declared as global (e.g. have to refer to
8136 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
8138 * HOL: tuned AST representation of nested pairs, avoiding bogus output
8139 in case of overlap with user translations (e.g. judgements over
8140 tuples); (note that the underlying logical represenation is still
8146 * ZF: simplification automatically cancels common terms in arithmetic
8147 expressions over nat and int;
8149 * ZF: new treatment of nat to minimize type-checking: all operators
8150 coerce their operands to a natural number using the function natify,
8151 making the algebraic laws unconditional;
8153 * ZF: as above, for int: operators coerce their operands to an integer
8154 using the function intify;
8156 * ZF: the integer library now contains many of the usual laws for the
8157 orderings, including $<=, and monotonicity laws for $+ and $*;
8159 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
8162 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
8163 to the simplifier and classical reasoner simultaneously;
8168 * Provers: blast_tac now handles actual object-logic rules as
8169 assumptions; note that auto_tac uses blast_tac internally as well;
8171 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
8172 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
8174 * Provers: delrules now handles destruct rules as well (no longer need
8175 explicit make_elim);
8177 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
8178 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8179 use instead the strong form,
8180 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8181 in HOL, FOL and ZF the function cla_make_elim will create such rules
8182 from destruct-rules;
8184 * Provers: Simplifier.easy_setup provides a fast path to basic
8185 Simplifier setup for new object-logics;
8187 * Pure: AST translation rules no longer require constant head on LHS;
8189 * Pure: improved name spaces: ambiguous output is qualified; support
8190 for hiding of names;
8192 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
8193 XSYMBOL_HOME; no longer need to do manual configuration in most
8196 * system: compression of ML heaps images may now be controlled via -c
8197 option of isabelle and isatool usedir (currently only observed by
8200 * system: isatool installfonts may handle X-Symbol fonts as well (very
8201 useful for remote X11);
8203 * system: provide TAGS file for Isabelle sources;
8205 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
8208 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
8209 timing flag supersedes proof_timing and Toplevel.trace;
8211 * ML: new combinators |>> and |>>> for incremental transformations
8212 with secondary results (e.g. certain theory extensions):
8214 * ML: PureThy.add_defs gets additional argument to indicate potential
8215 overloading (usually false);
8217 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
8222 New in Isabelle99 (October 1999)
8223 --------------------------------
8225 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8227 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
8228 are no longer simplified. (This allows the simplifier to unfold recursive
8229 functional programs.) To restore the old behaviour, declare
8231 Delcongs [if_weak_cong];
8233 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
8236 * HOL: the predicate "inj" is now defined by translation to "inj_on";
8238 * HOL/datatype: mutual_induct_tac no longer exists --
8239 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
8241 * HOL/typedef: fixed type inference for representing set; type
8242 arguments now have to occur explicitly on the rhs as type constraints;
8244 * ZF: The con_defs part of an inductive definition may no longer refer
8245 to constants declared in the same theory;
8247 * HOL, ZF: the function mk_cases, generated by the inductive
8248 definition package, has lost an argument. To simplify its result, it
8249 uses the default simpset instead of a supplied list of theorems.
8251 * HOL/List: the constructors of type list are now Nil and Cons;
8253 * Simplifier: the type of the infix ML functions
8254 setSSolver addSSolver setSolver addSolver
8255 is now simpset * solver -> simpset where `solver' is a new abstract type
8256 for packaging solvers. A solver is created via
8257 mk_solver: string -> (thm list -> int -> tactic) -> solver
8258 where the string argument is only a comment.
8263 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
8264 decision procedure for linear arithmetic. Currently it is used for
8265 types `nat', `int', and `real' in HOL (see below); it can, should and
8266 will be instantiated for other types and logics as well.
8268 * The simplifier now accepts rewrite rules with flexible heads, eg
8269 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
8270 They are applied like any rule with a non-pattern lhs, i.e. by first-order
8276 * New Isabelle/Isar subsystem provides an alternative to traditional
8277 tactical theorem proving; together with the ProofGeneral/isar user
8278 interface it offers an interactive environment for developing human
8279 readable proof documents (Isar == Intelligible semi-automated
8280 reasoning); for further information see isatool doc isar-ref,
8281 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
8283 * improved and simplified presentation of theories: better HTML markup
8284 (including colors), graph views in several sizes; isatool usedir now
8285 provides a proper interface for user theories (via -P option); actual
8286 document preparation based on (PDF)LaTeX is available as well (for
8287 new-style theories only); see isatool doc system for more information;
8289 * native support for Proof General, both for classic Isabelle and
8292 * ML function thm_deps visualizes dependencies of theorems and lemmas,
8293 using the graph browser tool;
8295 * Isabelle manuals now also available as PDF;
8297 * theory loader rewritten from scratch (may not be fully
8298 bug-compatible); old loadpath variable has been replaced by show_path,
8299 add_path, del_path, reset_path functions; new operations such as
8300 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
8303 * improved isatool install: option -k creates KDE application icon,
8304 option -p DIR installs standalone binaries;
8306 * added ML_PLATFORM setting (useful for cross-platform installations);
8307 more robust handling of platform specific ML images for SML/NJ;
8309 * the settings environment is now statically scoped, i.e. it is never
8310 created again in sub-processes invoked from isabelle, isatool, or
8313 * path element specification '~~' refers to '$ISABELLE_HOME';
8315 * in locales, the "assumes" and "defines" parts may be omitted if
8318 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
8321 * new print_mode "HTML";
8323 * new flag show_tags controls display of tags of theorems (which are
8324 basically just comments that may be attached by some tools);
8326 * Isamode 2.6 requires patch to accomodate change of Isabelle font
8327 mode and goal output format:
8329 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
8331 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
8333 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
8334 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
8336 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
8338 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
8340 * function bind_thms stores lists of theorems (cf. bind_thm);
8342 * new shorthand tactics ftac, eatac, datac, fatac;
8344 * qed (and friends) now accept "" as result name; in that case the
8345 theorem is not stored, but proper checks and presentation of the
8348 * theorem database now also indexes constants "Trueprop", "all",
8349 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
8354 ** HOL arithmetic **
8356 * There are now decision procedures for linear arithmetic over nat and
8359 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
8360 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
8361 are treated as atomic; subformulae not involving type `nat' or `int'
8362 are ignored; quantified subformulae are ignored unless they are
8363 positive universal or negative existential. The tactic has to be
8364 invoked by hand and can be a little bit slow. In particular, the
8365 running time is exponential in the number of occurrences of `min' and
8366 `max', and `-' on `nat'.
8368 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
8369 (negated) (in)equalities among the premises and the conclusion into
8370 account (i.e. no compound formulae) and does not know about `min' and
8371 `max', and `-' on `nat'. It is fast and is used automatically by the
8374 NB: At the moment, these decision procedures do not cope with mixed
8375 nat/int formulae where the two parts interact, such as `m < n ==>
8378 * HOL/Numeral provides a generic theory of numerals (encoded
8379 efficiently as bit strings); setup for types nat/int/real is in place;
8380 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
8381 int, existing theories and proof scripts may require a few additional
8384 * integer division and remainder can now be performed on constant
8387 * many properties of integer multiplication, division and remainder
8390 * An interface to the Stanford Validity Checker (SVC) is available through the
8391 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
8392 are proved automatically. SVC must be installed separately, and its results
8393 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
8394 invocation of the underlying oracle). For SVC see
8395 http://verify.stanford.edu/SVC
8397 * IsaMakefile: the HOL-Real target now builds an actual image;
8402 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
8403 (in Isabelle/Isar) -- by Gertrud Bauer;
8405 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
8406 analysis for assembly languages with subtypes;
8408 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
8409 -- avoids syntactic ambiguities and treats state, transition, and
8410 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
8411 changed syntax and (many) tactics;
8413 * HOL/inductive: Now also handles more general introduction rules such
8414 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
8415 theorems are now maintained within the theory (maintained via the
8418 * HOL/datatype: Now also handles arbitrarily branching datatypes
8419 (using function types) such as
8421 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
8423 * HOL/record: record_simproc (part of the default simpset) takes care
8424 of selectors applied to updated records; record_split_tac is no longer
8425 part of the default claset; update_defs may now be removed from the
8426 simpset in many cases; COMPATIBILITY: old behavior achieved by
8428 claset_ref () := claset() addSWrapper record_split_wrapper;
8429 Delsimprocs [record_simproc]
8431 * HOL/typedef: fixed type inference for representing set; type
8432 arguments now have to occur explicitly on the rhs as type constraints;
8434 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
8435 names rather than an ML expression;
8437 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
8438 supplied later. Program schemes can be defined, such as
8439 "While B C s = (if B s then While B C (C s) else s)"
8440 where the well-founded relation can be chosen after B and C have been given.
8442 * HOL/List: the constructors of type list are now Nil and Cons;
8443 INCOMPATIBILITY: while [] and infix # syntax is still there, of
8444 course, ML tools referring to List.list.op # etc. have to be adapted;
8446 * HOL_quantifiers flag superseded by "HOL" print mode, which is
8447 disabled by default; run isabelle with option -m HOL to get back to
8448 the original Gordon/HOL-style output;
8450 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
8451 ALL x<=y. P, EX x<y. P, EX x<=y. P;
8453 * HOL basic syntax simplified (more orthogonal): all variants of
8454 All/Ex now support plain / symbolic / HOL notation; plain syntax for
8455 Eps operator is provided as well: "SOME x. P[x]";
8457 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
8459 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
8460 thus available for user theories;
8462 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
8463 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
8466 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
8467 several times and then mp;
8472 * the notation <<...>> is now available as a notation for sequences of
8475 * the simplifier is now installed
8477 * the axiom system has been generalized (thanks to Soren Heilmann)
8479 * the classical reasoner now has a default rule database
8484 * new primrec section allows primitive recursive functions to be given
8485 directly (as in HOL) over datatypes and the natural numbers;
8487 * new tactics induct_tac and exhaust_tac for induction (or case
8488 analysis) over datatypes and the natural numbers;
8490 * the datatype declaration of type T now defines the recursor T_rec;
8492 * simplification automatically does freeness reasoning for datatype
8495 * automatic type-inference, with AddTCs command to insert new
8496 type-checking rules;
8498 * datatype introduction rules are now added as Safe Introduction rules
8501 * the syntax "if P then x else y" is now available in addition to
8505 *** Internal programming interfaces ***
8507 * tuned simplifier trace output; new flag debug_simp;
8509 * structures Vartab / Termtab (instances of TableFun) offer efficient
8510 tables indexed by indexname_ord / term_ord (compatible with aconv);
8512 * AxClass.axclass_tac lost the theory argument;
8514 * tuned current_goals_markers semantics: begin / end goal avoids
8515 printing empty lines;
8517 * removed prs and prs_fn hook, which was broken because it did not
8518 include \n in its semantics, forcing writeln to add one
8519 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
8520 string -> unit if you really want to output text without newline;
8522 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
8523 plain output, interface builders may have to enable 'isabelle_font'
8524 mode to get Isabelle font glyphs as before;
8526 * refined token_translation interface; INCOMPATIBILITY: output length
8527 now of type real instead of int;
8529 * theory loader actions may be traced via new ThyInfo.add_hook
8530 interface (see src/Pure/Thy/thy_info.ML); example application: keep
8531 your own database of information attached to *whole* theories -- as
8532 opposed to intra-theory data slots offered via TheoryDataFun;
8534 * proper handling of dangling sort hypotheses (at last!);
8535 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
8536 extra sort hypotheses that can be witnessed from the type signature;
8537 the force_strip_shyps flag is gone, any remaining shyps are simply
8538 left in the theorem (with a warning issued by strip_shyps_warning);
8542 New in Isabelle98-1 (October 1998)
8543 ----------------------------------
8545 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8547 * several changes of automated proof tools;
8549 * HOL: major changes to the inductive and datatype packages, including
8550 some minor incompatibilities of theory syntax;
8552 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
8555 * HOL: removed duplicate thms in Arith:
8556 less_imp_add_less should be replaced by trans_less_add1
8557 le_imp_add_le should be replaced by trans_le_add1
8559 * HOL: unary minus is now overloaded (new type constraints may be
8562 * HOL and ZF: unary minus for integers is now #- instead of #~. In
8563 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
8564 now taken as an integer constant.
8566 * Pure: ML function 'theory_of' renamed to 'theory';
8572 1. Asm_full_simp_tac is now more aggressive.
8573 1. It will sometimes reorient premises if that increases their power to
8575 2. It does no longer proceed strictly from left to right but may also
8576 rotate premises to achieve further simplification.
8577 For compatibility reasons there is now Asm_lr_simp_tac which is like the
8578 old Asm_full_simp_tac in that it does not rotate premises.
8579 2. The simplifier now knows a little bit about nat-arithmetic.
8581 * Classical reasoner: wrapper mechanism for the classical reasoner now
8582 allows for selected deletion of wrappers, by introduction of names for
8583 wrapper functionals. This implies that addbefore, addSbefore,
8584 addaltern, and addSaltern now take a pair (name, tactic) as argument,
8585 and that adding two tactics with the same name overwrites the first
8586 one (emitting a warning).
8587 type wrapper = (int -> tactic) -> (int -> tactic)
8588 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
8589 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
8590 delWrapper, delSWrapper: claset * string -> claset
8591 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
8593 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
8594 semantics; addbefore now affects only the unsafe part of step_tac
8595 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
8596 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
8599 * Classical reasoner: setwrapper to setWrapper and compwrapper to
8600 compWrapper; added safe wrapper (and access functions for it);
8602 * HOL/split_all_tac is now much faster and fails if there is nothing
8603 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
8604 and the names of the automatically generated variables have changed.
8605 split_all_tac has moved within claset() from unsafe wrappers to safe
8606 wrappers, which means that !!-bound variables are split much more
8607 aggressively, and safe_tac and clarify_tac now split such variables.
8608 If this splitting is not appropriate, use delSWrapper "split_all_tac".
8609 Note: the same holds for record_split_tac, which does the job of
8610 split_all_tac for record fields.
8612 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
8613 permanently to the default simpset using Addsplits just like
8614 Addsimps. They can be removed via Delsplits just like
8615 Delsimps. Lower-case versions are also available.
8617 * HOL/Simplifier: The rule split_if is now part of the default
8618 simpset. This means that the simplifier will eliminate all occurrences
8619 of if-then-else in the conclusion of a goal. To prevent this, you can
8620 either remove split_if completely from the default simpset by
8621 `Delsplits [split_if]' or remove it in a specific call of the
8622 simplifier using `... delsplits [split_if]'. You can also add/delete
8623 other case splitting rules to/from the default simpset: every datatype
8624 generates suitable rules `split_t_case' and `split_t_case_asm' (where
8625 t is the name of the datatype).
8627 * Classical reasoner / Simplifier combination: new force_tac (and
8628 derivatives Force_tac, force) combines rewriting and classical
8629 reasoning (and whatever other tools) similarly to auto_tac, but is
8630 aimed to solve the given subgoal completely.
8635 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
8636 and `goalw': the theory is no longer needed as an explicit argument -
8637 the current theory context is used; assumptions are no longer returned
8638 at the ML-level unless one of them starts with ==> or !!; it is
8639 recommended to convert to these new commands using isatool fixgoal
8640 (backup your sources first!);
8642 * new top-level commands 'thm' and 'thms' for retrieving theorems from
8643 the current theory context, and 'theory' to lookup stored theories;
8645 * new theory section 'locale' for declaring constants, assumptions and
8646 definitions that have local scope;
8648 * new theory section 'nonterminals' for purely syntactic types;
8650 * new theory section 'setup' for generic ML setup functions
8651 (e.g. package initialization);
8653 * the distribution now includes Isabelle icons: see
8654 lib/logo/isabelle-{small,tiny}.xpm;
8656 * isatool install - install binaries with absolute references to
8659 * isatool logo -- create instances of the Isabelle logo (as EPS);
8661 * print mode 'emacs' reserved for Isamode;
8663 * support multiple print (ast) translations per constant name;
8665 * theorems involving oracles are now printed with a suffixed [!];
8670 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
8672 * HOL/inductive package reorganized and improved: now supports mutual
8678 oddI "n : EVEN ==> Suc n : ODD"
8679 evenI "n : ODD ==> Suc n : EVEN"
8681 new theorem list "elims" contains an elimination rule for each of the
8682 recursive sets; inductive definitions now handle disjunctive premises
8683 correctly (also ZF);
8685 INCOMPATIBILITIES: requires Inductive as an ancestor; component
8686 "mutual_induct" no longer exists - the induction rule is always
8687 contained in "induct";
8690 * HOL/datatype package re-implemented and greatly improved: now
8691 supports mutually recursive datatypes such as
8694 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
8695 | SUM ('a aexp) ('a aexp)
8696 | DIFF ('a aexp) ('a aexp)
8699 'a bexp = LESS ('a aexp) ('a aexp)
8700 | AND ('a bexp) ('a bexp)
8701 | OR ('a bexp) ('a bexp)
8703 as well as indirectly recursive datatypes such as
8706 ('a, 'b) term = Var 'a
8707 | App 'b ((('a, 'b) term) list)
8709 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
8710 induction on mutually / indirectly recursive datatypes.
8712 Primrec equations are now stored in theory and can be accessed via
8713 <function_name>.simps.
8717 - Theories using datatypes must now have theory Datatype as an
8719 - The specific <typename>.induct_tac no longer exists - use the
8720 generic induct_tac instead.
8721 - natE has been renamed to nat.exhaust - use exhaust_tac
8722 instead of res_inst_tac ... natE. Note that the variable
8723 names in nat.exhaust differ from the names in natE, this
8724 may cause some "fragile" proofs to fail.
8725 - The theorems split_<typename>_case and split_<typename>_case_asm
8726 have been renamed to <typename>.split and <typename>.split_asm.
8727 - Since default sorts of type variables are now handled correctly,
8728 some datatype definitions may have to be annotated with explicit
8730 - Primrec definitions no longer require function name and type
8731 of recursive argument.
8733 Consider using isatool fixdatatype to adapt your theories and proof
8734 scripts to the new package (backup your sources first!).
8737 * HOL/record package: considerably improved implementation; now
8738 includes concrete syntax for record types, terms, updates; theorems
8739 for surjective pairing and splitting !!-bound record variables; proof
8740 support is as follows:
8742 1) standard conversions (selectors or updates applied to record
8743 constructor terms) are part of the standard simpset;
8745 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
8746 made part of standard simpset and claset via addIffs;
8748 3) a tactic for record field splitting (record_split_tac) is part of
8749 the standard claset (addSWrapper);
8751 To get a better idea about these rules you may retrieve them via
8752 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
8753 the name of your record type.
8755 The split tactic 3) conceptually simplifies by the following rule:
8757 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
8759 Thus any record variable that is bound by meta-all will automatically
8760 blow up into some record constructor term, consequently the
8761 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
8762 solve record problems automatically.
8765 * reorganized the main HOL image: HOL/Integ and String loaded by
8766 default; theory Main includes everything;
8768 * automatic simplification of integer sums and comparisons, using cancellation;
8770 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
8772 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
8774 * many new identities for unions, intersections, set difference, etc.;
8776 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
8777 called split_if, split_split, split_sum_case and split_nat_case (to go
8778 with add/delsplits);
8780 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
8781 (?x::unit) = (); this is made part of the default simpset, which COULD
8782 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
8783 'Delsimprocs [unit_eq_proc];' as last resort); also note that
8784 unit_abs_eta_conv is added in order to counter the effect of
8785 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
8788 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
8791 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
8792 It and 'sym RS equals0D' are now in the default claset, giving automatic
8793 disjointness reasoning but breaking a few old proofs.
8795 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
8796 to 'converse' from 'inverse' (for compatibility with ZF and some
8799 * HOL/recdef can now declare non-recursive functions, with {} supplied as
8800 the well-founded relation;
8802 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
8803 Compl A. The "Compl" syntax remains available as input syntax for this
8806 * HOL/Update: new theory of function updates:
8807 f(a:=b) == %x. if x=a then b else f x
8808 may also be iterated as in f(a:=b,c:=d,...);
8810 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
8813 - new function list_update written xs[i:=v] that updates the i-th
8814 list position. May also be iterated as in xs[i:=a,j:=b,...].
8815 - new function `upt' written [i..j(] which generates the list
8816 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
8817 bound write [i..j], which is a shorthand for [i..j+1(].
8818 - new lexicographic orderings and corresponding wellfoundedness theorems.
8821 - removed 'pred' (predecessor) function;
8822 - generalized some theorems about n-1;
8823 - many new laws about "div" and "mod";
8824 - new laws about greatest common divisors (see theory ex/Primes);
8826 * HOL/Relation: renamed the relational operator r^-1 "converse"
8827 instead of "inverse";
8829 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
8830 of the multiset ordering;
8832 * directory HOL/Real: a construction of the reals using Dedekind cuts
8833 (not included by default);
8835 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
8837 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
8838 programs, i.e. different program variables may have different types.
8840 * calling (stac rew i) now fails if "rew" has no effect on the goal
8841 [previously, this check worked only if the rewrite rule was unconditional]
8842 Now rew can involve either definitions or equalities (either == or =).
8847 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
8848 only the theorems proved on ZF.ML;
8850 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
8851 It and 'sym RS equals0D' are now in the default claset, giving automatic
8852 disjointness reasoning but breaking a few old proofs.
8854 * ZF/Update: new theory of function updates
8855 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
8856 may also be iterated as in f(a:=b,c:=d,...);
8858 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
8860 * calling (stac rew i) now fails if "rew" has no effect on the goal
8861 [previously, this check worked only if the rewrite rule was unconditional]
8862 Now rew can involve either definitions or equalities (either == or =).
8864 * case_tac provided for compatibility with HOL
8865 (like the old excluded_middle_tac, but with subgoals swapped)
8868 *** Internal programming interfaces ***
8870 * Pure: several new basic modules made available for general use, see
8871 also src/Pure/README;
8873 * improved the theory data mechanism to support encapsulation (data
8874 kind name replaced by private Object.kind, acting as authorization
8875 key); new type-safe user interface via functor TheoryDataFun; generic
8876 print_data function becomes basically useless;
8878 * removed global_names compatibility flag -- all theory declarations
8879 are qualified by default;
8881 * module Pure/Syntax now offers quote / antiquote translation
8882 functions (useful for Hoare logic etc. with implicit dependencies);
8883 see HOL/ex/Antiquote for an example use;
8885 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
8888 * new tactical CHANGED_GOAL for checking that a tactic modifies a
8891 * Display.print_goals function moved to Locale.print_goals;
8893 * standard print function for goals supports current_goals_markers
8894 variable for marking begin of proof, end of proof, start of goal; the
8895 default is ("", "", ""); setting current_goals_markers := ("<proof>",
8896 "</proof>", "<goal>") causes SGML like tagged proof state printing,
8901 New in Isabelle98 (January 1998)
8902 --------------------------------
8904 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8906 * changed lexical syntax of terms / types: dots made part of long
8907 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
8909 * simpset (and claset) reference variable replaced by functions
8910 simpset / simpset_ref;
8912 * no longer supports theory aliases (via merge) and non-trivial
8913 implicit merge of thms' signatures;
8915 * most internal names of constants changed due to qualified names;
8917 * changed Pure/Sequence interface (see Pure/seq.ML);
8920 *** General Changes ***
8922 * hierachically structured name spaces (for consts, types, axms, thms
8923 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
8924 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
8925 isatool fixdots ensures space after dots (e.g. "%x. x"); set
8926 long_names for fully qualified output names; NOTE: ML programs
8927 (special tactics, packages etc.) referring to internal names may have
8928 to be adapted to cope with fully qualified names; in case of severe
8929 backward campatibility problems try setting 'global_names' at compile
8930 time to have enrything declared within a flat name space; one may also
8931 fine tune name declarations in theories via the 'global' and 'local'
8934 * reimplemented the implicit simpset and claset using the new anytype
8935 data filed in signatures; references simpset:simpset ref etc. are
8936 replaced by functions simpset:unit->simpset and
8937 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
8938 to patch your ML files accordingly;
8940 * HTML output now includes theory graph data for display with Java
8941 applet or isatool browser; data generated automatically via isatool
8942 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
8944 * defs may now be conditional; improved rewrite_goals_tac to handle
8945 conditional equations;
8947 * defs now admits additional type arguments, using TYPE('a) syntax;
8949 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
8950 creates a new theory node; implicit merge of thms' signatures is
8951 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
8952 transfer:theory->thm->thm in (rare) cases;
8954 * improved handling of draft signatures / theories; draft thms (and
8955 ctyps, cterms) are automatically promoted to real ones;
8957 * slightly changed interfaces for oracles: admit many per theory, named
8958 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
8960 * print_goals: optional output of const types (set show_consts and
8963 * improved output of warnings (###) and errors (***);
8965 * subgoal_tac displays a warning if the new subgoal has type variables;
8967 * removed old README and Makefiles;
8969 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
8971 * removed obsolete init_pps and init_database;
8973 * deleted the obsolete tactical STATE, which was declared by
8974 fun STATE tacfun st = tacfun st st;
8976 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
8977 (which abbreviates $HOME);
8979 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
8980 use isatool fixseq to adapt your ML programs (this works for fully
8981 qualified references to the Sequence structure only!);
8983 * use_thy no longer requires writable current directory; it always
8984 reloads .ML *and* .thy file, if either one is out of date;
8987 *** Classical Reasoner ***
8989 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
8990 tactics that use classical reasoning to simplify a subgoal without
8991 splitting it into several subgoals;
8993 * Safe_tac: like safe_tac but uses the default claset;
8998 * added simplification meta rules:
8999 (asm_)(full_)simplify: simpset -> thm -> thm;
9001 * simplifier.ML no longer part of Pure -- has to be loaded by object
9004 * added prems argument to simplification procedures;
9006 * HOL, FOL, ZF: added infix function `addsplits':
9007 instead of `<simpset> setloop (split_tac <thms>)'
9008 you can simply write `<simpset> addsplits <thms>'
9013 * TYPE('a) syntax for type reflection terms;
9015 * no longer handles consts with name "" -- declare as 'syntax' instead;
9017 * pretty printer: changed order of mixfix annotation preference (again!);
9019 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
9024 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
9025 with `addloop' of the simplifier to faciliate case splitting in premises.
9027 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
9029 * HOL/Auth: new protocol proofs including some for the Internet
9032 * HOL/Map: new theory of `maps' a la VDM;
9034 * HOL/simplifier: simplification procedures nat_cancel_sums for
9035 cancelling out common nat summands from =, <, <= (in)equalities, or
9036 differences; simplification procedures nat_cancel_factor for
9037 cancelling common factor from =, <, <= (in)equalities over natural
9038 sums; nat_cancel contains both kinds of procedures, it is installed by
9039 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
9041 * HOL/simplifier: terms of the form
9042 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
9044 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
9045 and those of the form
9046 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
9048 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
9051 Each datatype `t' now comes with a theorem `split_t_case' of the form
9053 P(t_case f1 ... fn x) =
9054 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
9056 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
9059 and a theorem `split_t_case_asm' of the form
9061 P(t_case f1 ... fn x) =
9062 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
9064 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
9066 which can be added to a simpset via `addsplits'. The existing theorems
9067 expand_list_case and expand_option_case have been renamed to
9068 split_list_case and split_option_case.
9071 - `pred n' is automatically converted to `n-1'.
9072 Users are strongly encouraged not to use `pred' any longer,
9073 because it will disappear altogether at some point.
9074 - Users are strongly encouraged to write "0 < n" rather than
9075 "n ~= 0". Theorems and proof tools have been modified towards this
9079 the function "set_of_list" has been renamed "set" (and its theorems too);
9080 the function "nth" now takes its arguments in the reverse order and
9081 has acquired the infix notation "!" as in "xs!n".
9083 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
9085 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
9086 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
9088 * HOL/record: extensible records with schematic structural subtyping
9089 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
9090 still lacks various theorems and concrete record syntax;
9095 * removed "axioms" and "generated by" sections;
9097 * replaced "ops" section by extended "consts" section, which is capable of
9098 handling the continuous function space "->" directly;
9101 . proves theorems immediately and stores them in the theory,
9102 . creates hierachical name space,
9103 . now uses normal mixfix annotations (instead of cinfix...),
9104 . minor changes to some names and values (for consistency),
9105 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
9106 . separator between mutual domain defs: changed "," to "and",
9107 . improved handling of sort constraints; now they have to
9108 appear on the left-hand side of the equations only;
9110 * fixed LAM <x,y,zs>.b syntax;
9112 * added extended adm_tac to simplifier in HOLCF -- can now discharge
9113 adm (%x. P (t x)), where P is chainfinite and t continuous;
9118 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
9119 with `addloop' of the simplifier to faciliate case splitting in premises.
9121 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
9122 in HOL, they strip ALL and --> from proved theorems;
9126 New in Isabelle94-8 (May 1997)
9127 ------------------------------
9129 *** General Changes ***
9131 * new utilities to build / run / maintain Isabelle etc. (in parts
9132 still somewhat experimental); old Makefiles etc. still functional;
9134 * new 'Isabelle System Manual';
9136 * INSTALL text, together with ./configure and ./build scripts;
9138 * reimplemented type inference for greater efficiency, better error
9139 messages and clean internal interface;
9141 * prlim command for dealing with lots of subgoals (an easier way of
9142 setting goals_limit);
9147 * supports alternative (named) syntax tables (parser and pretty
9148 printer); internal interface is provided by add_modesyntax(_i);
9150 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
9151 be used in conjunction with the Isabelle symbol font; uses the
9152 "symbols" syntax table;
9154 * added token_translation interface (may translate name tokens in
9155 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
9156 the current print_mode); IMPORTANT: user print translation functions
9157 are responsible for marking newly introduced bounds
9158 (Syntax.mark_boundT);
9160 * token translations for modes "xterm" and "xterm_color" that display
9161 names in bold, underline etc. or colors (which requires a color
9164 * infixes may now be declared with names independent of their syntax;
9166 * added typed_print_translation (like print_translation, but may
9167 access type of constant);
9170 *** Classical Reasoner ***
9172 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
9173 some limitations. Blast_tac...
9174 + ignores addss, addbefore, addafter; this restriction is intrinsic
9175 + ignores elimination rules that don't have the correct format
9176 (the conclusion MUST be a formula variable)
9177 + ignores types, which can make HOL proofs fail
9178 + rules must not require higher-order unification, e.g. apply_type in ZF
9179 [message "Function Var's argument not a bound variable" relates to this]
9180 + its proof strategy is more general but can actually be slower
9182 * substitution with equality assumptions no longer permutes other
9185 * minor changes in semantics of addafter (now called addaltern); renamed
9186 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
9187 (and access functions for it);
9189 * improved combination of classical reasoner and simplifier:
9190 + functions for handling clasimpsets
9191 + improvement of addss: now the simplifier is called _after_ the
9193 + safe variant of addss called addSss: uses safe simplifications
9194 _during_ the safe steps. It is more complete as it allows multiple
9195 instantiations of unknowns (e.g. with slow_tac).
9199 * added interface for simplification procedures (functions that
9200 produce *proven* rewrite rules on the fly, depending on current
9203 * ordering on terms as parameter (used for ordered rewriting);
9205 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
9207 * the solver is now split into a safe and an unsafe part.
9208 This should be invisible for the normal user, except that the
9209 functions setsolver and addsolver have been renamed to setSolver and
9210 addSolver; added safe_asm_full_simp_tac;
9215 * a generic induction tactic `induct_tac' which works for all datatypes and
9216 also for type `nat';
9218 * a generic case distinction tactic `exhaust_tac' which works for all
9219 datatypes and also for type `nat';
9221 * each datatype comes with a function `size';
9223 * patterns in case expressions allow tuple patterns as arguments to
9224 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
9226 * primrec now also works with type nat;
9228 * recdef: a new declaration form, allows general recursive functions to be
9229 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
9231 * the constant for negation has been renamed from "not" to "Not" to
9232 harmonize with FOL, ZF, LK, etc.;
9234 * HOL/ex/LFilter theory of a corecursive "filter" functional for
9237 * HOL/Modelcheck demonstrates invocation of model checker oracle;
9239 * HOL/ex/Ring.thy declares cring_simp, which solves equational
9240 problems in commutative rings, using axiomatic type classes for + and *;
9242 * more examples in HOL/MiniML and HOL/Auth;
9244 * more default rewrite rules for quantifiers, union/intersection;
9246 * a new constant `arbitrary == @x.False';
9248 * HOLCF/IOA replaces old HOL/IOA;
9250 * HOLCF changes: derived all rules and arities
9251 + axiomatic type classes instead of classes
9252 + typedef instead of faking type definitions
9253 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
9254 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
9255 + eliminated the types void, one, tr
9256 + use unit lift and bool lift (with translations) instead of one and tr
9257 + eliminated blift from Lift3.thy (use Def instead of blift)
9258 all eliminated rules are derived as theorems --> no visible changes ;
9263 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
9264 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
9265 as ZF_cs addSIs [equalityI];
9269 New in Isabelle94-7 (November 96)
9270 ---------------------------------
9272 * allowing negative levels (as offsets) in prlev and choplev;
9274 * super-linear speedup for large simplifications;
9276 * FOL, ZF and HOL now use miniscoping: rewriting pushes
9277 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
9278 FAIL); can suppress it using the command Delsimps (ex_simps @
9279 all_simps); De Morgan laws are also now included, by default;
9281 * improved printing of ==> : ~:
9283 * new object-logic "Sequents" adds linear logic, while replacing LK
9284 and Modal (thanks to Sara Kalvala);
9286 * HOL/Auth: correctness proofs for authentication protocols;
9288 * HOL: new auto_tac combines rewriting and classical reasoning (many
9289 examples on HOL/Auth);
9291 * HOL: new command AddIffs for declaring theorems of the form P=Q to
9292 the rewriter and classical reasoner simultaneously;
9294 * function uresult no longer returns theorems in "standard" format;
9295 regain previous version by: val uresult = standard o uresult;
9302 * oracles -- these establish an interface between Isabelle and trusted
9303 external reasoners, which may deliver results as theorems;
9305 * proof objects (in particular record all uses of oracles);
9307 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
9309 * "constdefs" section in theory files;
9311 * "primrec" section (HOL) no longer requires names;
9313 * internal type "tactic" now simply "thm -> thm Sequence.seq";
9320 * reduced space requirements;
9322 * automatic HTML generation from theories;
9324 * theory files no longer require "..." (quotes) around most types;
9326 * new examples, including two proofs of the Church-Rosser theorem;
9328 * non-curried (1994) version of HOL is no longer distributed;
9335 * greatly reduced space requirements;
9337 * theory files (.thy) no longer require \...\ escapes at line breaks;
9339 * searchable theorem database (see the section "Retrieving theorems" on
9340 page 8 of the Reference Manual);
9342 * new examples, including Grabczewski's monumental case study of the
9345 * The previous version of HOL renamed to Old_HOL;
9347 * The new version of HOL (previously called CHOL) uses a curried syntax
9348 for functions. Application looks like f a b instead of f(a,b);
9350 * Mutually recursive inductive definitions finally work in HOL;
9352 * In ZF, pattern-matching on tuples is now available in all abstractions and
9353 translates to the operator "split";
9360 * new infix operator, addss, allowing the classical reasoner to
9361 perform simplification at each step of its search. Example:
9362 fast_tac (cs addss ss)
9364 * a new logic, CHOL, the same as HOL, but with a curried syntax
9365 for functions. Application looks like f a b instead of f(a,b). Also pairs
9366 look like (a,b) instead of <a,b>;
9368 * PLEASE NOTE: CHOL will eventually replace HOL!
9370 * In CHOL, pattern-matching on tuples is now available in all abstractions.
9371 It translates to the operator "split". A new theory of integers is available;
9373 * In ZF, integer numerals now denote two's-complement binary integers.
9374 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
9376 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
9377 of the Axiom of Choice;
9384 * Significantly faster resolution;
9386 * the different sections in a .thy file can now be mixed and repeated
9389 * Database of theorems for FOL, HOL and ZF. New
9390 commands including qed, qed_goal and bind_thm store theorems in the database.
9392 * Simple database queries: return a named theorem (get_thm) or all theorems of
9393 a given theory (thms_of), or find out what theory a theorem was proved in
9396 * Bugs fixed in the inductive definition and datatype packages;
9398 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
9399 and HOL_dup_cs obsolete;
9401 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
9404 * Simpler definition of function space in ZF;
9406 * new results about cardinal and ordinal arithmetic in ZF;
9408 * 'subtype' facility in HOL for introducing new types as subsets of existing
9411 :mode=text:wrap=hard:maxLineLen=72: