more robust treatment of ISABELLE_HOME on windows: eliminate spaces and funny unicode characters in directory name via DOS~1 notation;
1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Prover IDE (PIDE) improvements:
11 - markup for bound variables
12 - markup for types of term variables (e.g. displayed as tooltips)
13 - support for user-defined Isar commands within the running session
14 - improved support for Unicode outside original 16bit range
15 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
17 * Updated and extended reference manuals ("isar-ref" and
18 "implementation"); reduced remaining material in old "ref" manual.
20 * Rule attributes in local theory declarations (e.g. locale or class)
21 are now statically evaluated: the resulting theorem is stored instead
22 of the original expression. INCOMPATIBILITY in rare situations, where
23 the historic accident of dynamic re-evaluation in interpretations
26 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
27 declaration, and results are standardized before being stored. Thus
28 old-style "standard" after instantiation or composition of facts
29 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
30 indices of schematic variables.
32 * Renamed some inner syntax categories:
38 Minor INCOMPATIBILITY. Note that in practice "num_const" or
39 "num_position" etc. are mainly used instead (which also include
40 position information via constraints).
42 * Simplified configuration options for syntax ambiguity: see
43 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
44 manual. Minor INCOMPATIBILITY.
46 * Forward declaration of outer syntax keywords within the theory
47 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
48 commands to be used in the same theory where defined.
50 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
56 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
57 tolerant against multiple unifiers, as long as the final result is
58 unique. (As before, rules are composed in canonical right-to-left
59 order to accommodate newly introduced premises.)
61 * Command 'definition' no longer exports the foundational "raw_def"
62 into the user context. Minor INCOMPATIBILITY, may use the regular
63 "def" result with attribute "abs_def" to imitate the old version.
65 * Attribute "abs_def" turns an equation of the form "f x y == t" into
66 "f == %x y. t", which ensures that "simp" or "unfold" steps always
67 expand it. This also works for object-logic equality. (Formerly
68 undocumented feature.)
70 * Discontinued old "prems" fact, which used to refer to the accidental
71 collection of foundational premises in the context (marked as legacy
74 * Obsolete command 'types' has been discontinued. Use 'type_synonym'
75 instead. INCOMPATIBILITY.
77 * Ancient code generator for SML and its commands 'code_module',
78 'code_library', 'consts_code', 'types_code' have been discontinued.
79 Use commands of the generic code generator instead. INCOMPATIBILITY.
81 * Redundant attribute 'code_inline' has been discontinued. Use
82 'code_unfold' instead. INCOMPATIBILITY.
84 * Dropped attribute 'code_unfold_post' in favor of the its dual
85 'code_abbrev', which yields a common pattern in definitions like
87 definition [code_abbrev]: "f = t"
91 * Sort constraints are now propagated in simultaneous statements, just
92 like type constraints. INCOMPATIBILITY in rare situations, where
93 distinct sorts used to be assigned accidentally. For example:
95 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
97 lemma "P (x::'a)" and "Q (y::'a::bar)"
98 -- "now uniform 'a::bar instead of default sort for first occurence (!)"
103 * New tutorial Programming and Proving in Isabelle/HOL
105 * The representation of numerals has changed. We now have a datatype
106 "num" representing strictly positive binary numerals, along with
107 functions "numeral :: num => 'a" and "neg_numeral :: num => 'a" to
108 represent positive and negated numeric literals, respectively. (See
109 definitions in Num.thy.) Potential INCOMPATIBILITY; some user theories
110 may require adaptations:
112 - Theorems with number_ring or number_semiring constraints: These
113 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
115 - Theories defining numeric types: Remove number, number_semiring,
116 and number_ring instances. Defer all theorems about numerals until
117 after classes one and semigroup_add have been instantiated.
119 - Numeral-only simp rules: Replace each rule having a "number_of v"
120 pattern with two copies, one for numeral and one for neg_numeral.
122 - Theorems about subclasses of semiring_1 or ring_1: These classes
123 automatically support numerals now, so more simp rules and
124 simprocs may now apply within the proof.
126 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
127 Redefine using other integer operations.
129 * Type 'a set is now a proper type constructor (just as before
130 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
131 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
132 sets separate, it is often sufficient to rephrase sets S accidentally
133 used as predicates by "%x. x : S" and predicates P accidentally used
134 as sets by "{x. P x}". Corresponding proofs in a first step should be
135 pruned from any tinkering with former theorems mem_def and
136 Collect_def as far as possible.
137 For developments which deliberately mixed predicates and
138 sets, a planning step is necessary to determine what should become a
139 predicate and what a set. It can be helpful to carry out that step in
140 Isabelle2011-1 before jumping right into the current release.
142 * Code generation by default implements sets as container type rather
143 than predicates. INCOMPATIBILITY.
145 * New proof import from HOL Light: Faster, simpler, and more scalable.
146 Requires a proof bundle, which is available as an external component.
147 Removed old (and mostly dead) Importer for HOL4 and HOL Light.
150 * New type synonym 'a rel = ('a * 'a) set
152 * Theory Divides: Discontinued redundant theorems about div and mod.
153 INCOMPATIBILITY, use the corresponding generic theorems instead.
155 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
156 zdiv_self ~> div_self
157 zmod_self ~> mod_self
160 zdiv_zmod_equality ~> div_mod_equality2
161 zdiv_zmod_equality2 ~> div_mod_equality
162 zmod_zdiv_trivial ~> mod_div_trivial
163 zdiv_zminus_zminus ~> div_minus_minus
164 zmod_zminus_zminus ~> mod_minus_minus
165 zdiv_zminus2 ~> div_minus_right
166 zmod_zminus2 ~> mod_minus_right
167 zdiv_minus1_right ~> div_minus1_right
168 zmod_minus1_right ~> mod_minus1_right
169 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
170 zmod_zmult1_eq ~> mod_mult_right_eq
171 zpower_zmod ~> power_mod
173 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
174 mod_mult_distrib ~> mult_mod_left
175 mod_mult_distrib2 ~> mult_mod_right
177 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
178 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
180 * More default pred/set conversions on a couple of relation operations
181 and predicates. Added powers of predicate relations.
182 Consolidation of some relation theorems:
184 converse_def ~> converse_unfold
185 rel_comp_def ~> rel_comp_unfold
186 symp_def ~> (dropped, use symp_def and sym_def instead)
187 transp_def ~> transp_trans
188 Domain_def ~> Domain_unfold
189 Range_def ~> Domain_converse [symmetric]
191 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
193 See theory "Relation" for examples for making use of pred/set conversions
194 by means of attributes "to_set" and "to_pred".
198 * Consolidated various theorem names relating to Finite_Set.fold
201 inf_INFI_fold_inf ~> inf_INF_fold_inf
202 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
203 INFI_fold_inf ~> INF_fold_inf
204 SUPR_fold_sup ~> SUP_fold_sup
205 union_set ~> union_set_fold
206 minus_set ~> minus_set_fold
210 * Consolidated theorem names concerning fold combinators:
212 INFI_set_fold ~> INF_set_fold
213 SUPR_set_fold ~> SUP_set_fold
214 INF_code ~> INF_set_foldr
215 SUP_code ~> SUP_set_foldr
216 foldr.simps ~> foldr.simps (in point-free formulation)
217 foldr_fold_rev ~> foldr_conv_fold
218 foldl_fold ~> foldl_conv_fold
219 foldr_foldr ~> foldr_conv_foldl
220 foldl_foldr ~> foldl_conv_foldr
224 * Dropped rarely useful theorems concerning fold combinators:
225 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
226 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
227 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
228 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
229 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
230 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
231 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
232 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can
233 be useful to boil down "List.foldr" and "List.foldl" to "List.fold"
234 by unfolding "foldr_conv_fold" and "foldl_conv_fold".
236 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
237 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
238 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
239 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
240 lemmas over fold rather than foldr, or make use of lemmas
241 fold_conv_foldr and fold_rev.
243 * Congruence rules Option.map_cong and Option.bind_cong for recursion
244 through option types.
246 * Concrete syntax for case expressions includes constraints for source
247 positions, and thus produces Prover IDE markup for its bindings.
248 INCOMPATIBILITY for old-style syntax translations that augment the
249 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
252 * Discontinued configuration option "syntax_positions": atomic terms
253 in parse trees are always annotated by position constraints.
255 * Finite_Set.fold now qualified. INCOMPATIBILITY.
257 * Renamed some facts on canonical fold on lists, in order to avoid
258 problems with interpretation involving corresponding facts on foldl
259 with the same base names:
261 fold_set_remdups ~> fold_set_fold_remdups
262 fold_set ~> fold_set_fold
263 fold1_set ~> fold1_set_fold
267 * Renamed facts about the power operation on relations, i.e., relpow
268 to match the constant's name:
270 rel_pow_1 ~> relpow_1
271 rel_pow_0_I ~> relpow_0_I
272 rel_pow_Suc_I ~> relpow_Suc_I
273 rel_pow_Suc_I2 ~> relpow_Suc_I2
274 rel_pow_0_E ~> relpow_0_E
275 rel_pow_Suc_E ~> relpow_Suc_E
276 rel_pow_E ~> relpow_E
277 rel_pow_Suc_D2 ~> relpow_Suc_D2
278 rel_pow_Suc_E2 ~> relpow_Suc_E2
279 rel_pow_Suc_D2' ~> relpow_Suc_D2'
280 rel_pow_E2 ~> relpow_E2
281 rel_pow_add ~> relpow_add
282 rel_pow_commute ~> relpow
283 rel_pow_empty ~> relpow_empty:
284 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
285 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
286 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
287 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
288 rel_pow_fun_conv ~> relpow_fun_conv
289 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
290 rel_pow_finite_bounded ~> relpow_finite_bounded
291 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
292 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
293 single_valued_rel_pow ~> single_valued_relpow
297 * Theory Relation: Consolidated constant name for relation composition
298 and corresponding theorem names:
299 - Renamed constant rel_comp to relcomp
300 - Dropped abbreviation pred_comp. Use relcompp instead.
303 rel_compI ~> relcompI
304 rel_compEpair ~> relcompEpair
305 rel_compE ~> relcompE
306 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
307 rel_comp_empty1 ~> relcomp_empty1
308 rel_comp_mono ~> relcomp_mono
309 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
310 rel_comp_distrib ~> relcomp_distrib
311 rel_comp_distrib2 ~> relcomp_distrib2
312 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
313 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
314 single_valued_rel_comp ~> single_valued_relcomp
315 rel_comp_unfold ~> relcomp_unfold
316 converse_rel_comp ~> converse_relcomp
317 pred_compI ~> relcomppI
318 pred_compE ~> relcomppE
319 pred_comp_bot1 ~> relcompp_bot1
320 pred_comp_bot2 ~> relcompp_bot2
321 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
322 pred_comp_mono ~> relcompp_mono
323 pred_comp_distrib ~> relcompp_distrib
324 pred_comp_distrib2 ~> relcompp_distrib2
325 converse_pred_comp ~> converse_relcompp
327 finite_rel_comp ~> finite_relcomp
329 set_rel_comp ~> set_relcomp
333 * New theory HOL/Library/DAList provides an abstract type for association
334 lists with distinct keys.
336 * 'datatype' specifications allow explicit sort constraints.
338 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
339 use theory HOL/Library/Nat_Bijection instead.
341 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black trees is
342 now inside the type class' local context. Names of affected operations and lemmas
343 have been prefixed by rbt_. INCOMPATIBILITY for theories working directly with
344 raw red-black trees, adapt the names as follows:
347 bulkload -> rbt_bulkload
348 del_from_left -> rbt_del_from_left
349 del_from_right -> rbt_del_from_right
354 insertw -> rbt_insert_with
355 insert_with_key -> rbt_insert_with_key
356 map_entry -> rbt_map_entry
359 tree_greater -> rbt_greater
360 tree_less -> rbt_less
361 tree_less_symbol -> rbt_less_symbol
363 union_with -> rbt_union_with
364 union_with_key -> rbt_union_with_key
367 balance_left_sorted -> balance_left_rbt_sorted
368 balance_left_tree_greater -> balance_left_rbt_greater
369 balance_left_tree_less -> balance_left_rbt_less
370 balance_right_sorted -> balance_right_rbt_sorted
371 balance_right_tree_greater -> balance_right_rbt_greater
372 balance_right_tree_less -> balance_right_rbt_less
373 balance_sorted -> balance_rbt_sorted
374 balance_tree_greater -> balance_rbt_greater
375 balance_tree_less -> balance_rbt_less
376 bulkload_is_rbt -> rbt_bulkload_is_rbt
377 combine_sorted -> combine_rbt_sorted
378 combine_tree_greater -> combine_rbt_greater
379 combine_tree_less -> combine_rbt_less
380 delete_in_tree -> rbt_delete_in_tree
381 delete_is_rbt -> rbt_delete_is_rbt
382 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
383 del_from_left_tree_less -> rbt_del_from_left_rbt_less
384 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
385 del_from_right_tree_less -> rbt_del_from_right_rbt_less
386 del_in_tree -> rbt_del_in_tree
387 del_inv1_inv2 -> rbt_del_inv1_inv2
388 del_sorted -> rbt_del_rbt_sorted
389 del_tree_greater -> rbt_del_rbt_greater
390 del_tree_less -> rbt_del_rbt_less
391 dom_lookup_Branch -> dom_rbt_lookup_Branch
392 entries_lookup -> entries_rbt_lookup
393 finite_dom_lookup -> finite_dom_rbt_lookup
394 insert_sorted -> rbt_insert_rbt_sorted
395 insertw_is_rbt -> rbt_insertw_is_rbt
396 insertwk_is_rbt -> rbt_insertwk_is_rbt
397 insertwk_sorted -> rbt_insertwk_rbt_sorted
398 insertw_sorted -> rbt_insertw_rbt_sorted
399 ins_sorted -> ins_rbt_sorted
400 ins_tree_greater -> ins_rbt_greater
401 ins_tree_less -> ins_rbt_less
402 is_rbt_sorted -> is_rbt_rbt_sorted
403 lookup_balance -> rbt_lookup_balance
404 lookup_bulkload -> rbt_lookup_rbt_bulkload
405 lookup_delete -> rbt_lookup_rbt_delete
406 lookup_Empty -> rbt_lookup_Empty
407 lookup_from_in_tree -> rbt_lookup_from_in_tree
408 lookup_in_tree -> rbt_lookup_in_tree
409 lookup_ins -> rbt_lookup_ins
410 lookup_insert -> rbt_lookup_rbt_insert
411 lookup_insertw -> rbt_lookup_rbt_insertw
412 lookup_insertwk -> rbt_lookup_rbt_insertwk
413 lookup_keys -> rbt_lookup_keys
414 lookup_map -> rbt_lookup_map
415 lookup_map_entry -> rbt_lookup_rbt_map_entry
416 lookup_tree_greater -> rbt_lookup_rbt_greater
417 lookup_tree_less -> rbt_lookup_rbt_less
418 lookup_union -> rbt_lookup_rbt_union
419 map_entry_color_of -> rbt_map_entry_color_of
420 map_entry_inv1 -> rbt_map_entry_inv1
421 map_entry_inv2 -> rbt_map_entry_inv2
422 map_entry_is_rbt -> rbt_map_entry_is_rbt
423 map_entry_sorted -> rbt_map_entry_rbt_sorted
424 map_entry_tree_greater -> rbt_map_entry_rbt_greater
425 map_entry_tree_less -> rbt_map_entry_rbt_less
426 map_tree_greater -> map_rbt_greater
427 map_tree_less -> map_rbt_less
428 map_sorted -> map_rbt_sorted
429 paint_sorted -> paint_rbt_sorted
430 paint_lookup -> paint_rbt_lookup
431 paint_tree_greater -> paint_rbt_greater
432 paint_tree_less -> paint_rbt_less
433 sorted_entries -> rbt_sorted_entries
434 tree_greater_eq_trans -> rbt_greater_eq_trans
435 tree_greater_nit -> rbt_greater_nit
436 tree_greater_prop -> rbt_greater_prop
437 tree_greater_simps -> rbt_greater_simps
438 tree_greater_trans -> rbt_greater_trans
439 tree_less_eq_trans -> rbt_less_eq_trans
440 tree_less_nit -> rbt_less_nit
441 tree_less_prop -> rbt_less_prop
442 tree_less_simps -> rbt_less_simps
443 tree_less_trans -> rbt_less_trans
444 tree_ord_props -> rbt_ord_props
445 union_Branch -> rbt_union_Branch
446 union_is_rbt -> rbt_union_is_rbt
447 unionw_is_rbt -> rbt_unionw_is_rbt
448 unionwk_is_rbt -> rbt_unionwk_is_rbt
449 unionwk_sorted -> rbt_unionwk_rbt_sorted
451 * Session HOL-Word: Discontinued many redundant theorems specific to
452 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
455 word_sub_alt ~> word_sub_wi
456 word_add_alt ~> word_add_def
457 word_mult_alt ~> word_mult_def
458 word_minus_alt ~> word_minus_def
459 word_0_alt ~> word_0_wi
460 word_1_alt ~> word_1_wi
461 word_add_0 ~> add_0_left
462 word_add_0_right ~> add_0_right
463 word_mult_1 ~> mult_1_left
464 word_mult_1_right ~> mult_1_right
465 word_add_commute ~> add_commute
466 word_add_assoc ~> add_assoc
467 word_add_left_commute ~> add_left_commute
468 word_mult_commute ~> mult_commute
469 word_mult_assoc ~> mult_assoc
470 word_mult_left_commute ~> mult_left_commute
471 word_left_distrib ~> left_distrib
472 word_right_distrib ~> right_distrib
473 word_left_minus ~> left_minus
474 word_diff_0_right ~> diff_0_right
475 word_diff_self ~> diff_self
476 word_sub_def ~> diff_minus
477 word_diff_minus ~> diff_minus
478 word_add_ac ~> add_ac
479 word_mult_ac ~> mult_ac
480 word_plus_ac0 ~> add_0_left add_0_right add_ac
481 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
482 word_order_trans ~> order_trans
483 word_order_refl ~> order_refl
484 word_order_antisym ~> order_antisym
485 word_order_linear ~> linorder_linear
486 lenw1_zero_neq_one ~> zero_neq_one
487 word_number_of_eq ~> number_of_eq
488 word_of_int_add_hom ~> wi_hom_add
489 word_of_int_sub_hom ~> wi_hom_sub
490 word_of_int_mult_hom ~> wi_hom_mult
491 word_of_int_minus_hom ~> wi_hom_neg
492 word_of_int_succ_hom ~> wi_hom_succ
493 word_of_int_pred_hom ~> wi_hom_pred
494 word_of_int_0_hom ~> word_0_wi
495 word_of_int_1_hom ~> word_1_wi
497 * Clarified attribute "mono_set": pure declaration without modifying
498 the result of the fact expression.
500 * "Transitive_Closure.ntrancl": bounded transitive closure on
503 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
505 * "sublists" moved to theory More_List. INCOMPATIBILITY.
507 * Theory Int: Discontinued many legacy theorems specific to type int.
508 INCOMPATIBILITY, use the corresponding generic theorems instead.
510 zminus_zminus ~> minus_minus
511 zminus_0 ~> minus_zero
512 zminus_zadd_distrib ~> minus_add_distrib
513 zadd_commute ~> add_commute
514 zadd_assoc ~> add_assoc
515 zadd_left_commute ~> add_left_commute
519 zadd_0_right ~> add_0_right
520 zadd_zminus_inverse2 ~> left_minus
521 zmult_zminus ~> mult_minus_left
522 zmult_commute ~> mult_commute
523 zmult_assoc ~> mult_assoc
524 zadd_zmult_distrib ~> left_distrib
525 zadd_zmult_distrib2 ~> right_distrib
526 zdiff_zmult_distrib ~> left_diff_distrib
527 zdiff_zmult_distrib2 ~> right_diff_distrib
528 zmult_1 ~> mult_1_left
529 zmult_1_right ~> mult_1_right
530 zle_refl ~> order_refl
531 zle_trans ~> order_trans
532 zle_antisym ~> order_antisym
533 zle_linear ~> linorder_linear
534 zless_linear ~> linorder_less_linear
535 zadd_left_mono ~> add_left_mono
536 zadd_strict_right_mono ~> add_strict_right_mono
537 zadd_zless_mono ~> add_less_le_mono
538 int_0_less_1 ~> zero_less_one
539 int_0_neq_1 ~> zero_neq_one
541 zpower_zadd_distrib ~> power_add
542 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
543 zero_le_zpower_abs ~> zero_le_power_abs
545 * Theory Deriv: Renamed
547 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
549 * New "case_product" attribute to generate a case rule doing multiple
550 case distinctions at the same time. E.g.
552 list.exhaust [case_product nat.exhaust]
554 produces a rule which can be used to perform case distinction on both
557 * Improved code generation of multisets.
559 * New diagnostic command find_unused_assms to find potentially superfluous
560 assumptions in theorems using Quickcheck.
563 - Quickcheck returns variable assignments as counterexamples, which
564 allows to reveal the underspecification of functions under test.
565 For example, refuting "hd xs = x", it presents the variable
566 assignment xs = [] and x = a1 as a counterexample, assuming that
567 any property is false whenever "hd []" occurs in it.
568 These counterexample are marked as potentially spurious, as
569 Quickcheck also returns "xs = []" as a counterexample to the
570 obvious theorem "hd xs = hd xs".
571 After finding a potentially spurious counterexample, Quickcheck
572 continues searching for genuine ones.
573 By default, Quickcheck shows potentially spurious and genuine
574 counterexamples. The option "genuine_only" sets quickcheck to
575 only show genuine counterexamples.
577 - The command 'quickcheck_generator' creates random and exhaustive
578 value generators for a given type and operations.
579 It generates values by using the operations as if they were
580 constructors of that type.
582 - Support for multisets.
584 - Added "use_subtype" options.
585 - Added "quickcheck_locale" configuration to specify how to process
586 conjectures in a locale context.
589 - Fixed infinite loop caused by the 'peephole_optim' option and
590 affecting 'rat' and 'real'.
593 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
594 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
595 - Renamed "sound" option to "strict".
598 - Added possibility to specify lambda translations scheme as a
599 parenthesized argument (e.g., "by (metis (lifting) ...)").
602 - renamed "smt_fixed" option to "smt_read_only_certificates".
605 - Renamed from 'try_methods'. INCOMPATIBILITY.
607 * New "eventually_elim" method as a generalized variant of the
608 eventually_elim* rules. Supports structured proofs.
610 * HOL/TPTP: support to parse and import TPTP problems (all languages)
616 * New "case_product" attribute (see HOL).
621 * Antiquotation @{keyword "name"} produces a parser for outer syntax
622 from a minor keyword introduced via theory header declaration.
624 * Antiquotation @{command_spec "name"} produces the
625 Outer_Syntax.command_spec from a major keyword introduced via theory
626 header declaration; it can be passed to Outer_Syntax.command etc.
628 * Local_Theory.define no longer hard-wires default theorem name
629 "foo_def", but retains the binding as given. If that is Binding.empty
630 / Attrib.empty_binding, the result is not registered as user-level
631 fact. The Local_Theory.define_internal variant allows to specify a
632 non-empty name (used for the foundation in the background theory),
633 while omitting the fact binding in the user-context. Potential
634 INCOMPATIBILITY for derived definitional packages: need to specify
635 naming policy for primitive definitions more explicitly.
637 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
638 conformance with similar operations in structure Term and Logic.
640 * Antiquotation @{attributes [...]} embeds attribute source
641 representation into the ML text, which is particularly useful with
642 declarations like Local_Theory.note.
644 * Structure Proof_Context follows standard naming scheme. Old
645 ProofContext has been discontinued. INCOMPATIBILITY.
647 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
648 change of semantics: update is applied to auxiliary local theory
651 * Modernized some old-style infix operations:
653 addeqcongs ~> Simplifier.add_eqcong
654 deleqcongs ~> Simplifier.del_eqcong
655 addcongs ~> Simplifier.add_cong
656 delcongs ~> Simplifier.del_cong
657 setmksimps ~> Simplifier.set_mksimps
658 setmkcong ~> Simplifier.set_mkcong
659 setmksym ~> Simplifier.set_mksym
660 setmkeqTrue ~> Simplifier.set_mkeqTrue
661 settermless ~> Simplifier.set_termless
662 setsubgoaler ~> Simplifier.set_subgoaler
663 addsplits ~> Splitter.add_split
664 delsplits ~> Splitter.del_split
669 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
670 notation, which is useful for the jEdit file browser, for example.
674 New in Isabelle2011-1 (October 2011)
675 ------------------------------------
679 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
680 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
682 - Management of multiple theory files directly from the editor
683 buffer store -- bypassing the file-system (no requirement to save
686 - Markup of formal entities within the text buffer, with semantic
687 highlighting, tooltips and hyperlinks to jump to defining source
690 - Improved text rendering, with sub/superscripts in the source
691 buffer (including support for copy/paste wrt. output panel, HTML
692 theory output and other non-Isabelle text boxes).
694 - Refined scheduling of proof checking and printing of results,
695 based on interactive editor view. (Note: jEdit folding and
696 narrowing allows to restrict buffer perspectives explicitly.)
698 - Reduced CPU performance requirements, usable on machines with few
701 - Reduced memory requirements due to pruning of unused document
702 versions (garbage collection).
704 See also ~~/src/Tools/jEdit/README.html for further information,
705 including some remaining limitations.
707 * Theory loader: source files are exclusively located via the master
708 directory of each theory node (where the .thy file itself resides).
709 The global load path (such as src/HOL/Library) has been discontinued.
710 Note that the path element ~~ may be used to reference theories in the
711 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
714 * Theory loader: source files are identified by content via SHA1
715 digests. Discontinued former path/modtime identification and optional
716 ISABELLE_FILE_IDENT plugin scripts.
718 * Parallelization of nested Isar proofs is subject to
719 Goal.parallel_proofs_threshold (default 100). See also isabelle
722 * Name space: former unsynchronized references are now proper
723 configuration options, with more conventional names:
725 long_names ~> names_long
726 short_names ~> names_short
727 unique_names ~> names_unique
729 Minor INCOMPATIBILITY, need to declare options in context like this:
731 declare [[names_unique = false]]
733 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
734 that the result needs to be unique, which means fact specifications
735 may have to be refined after enriching a proof context.
737 * Attribute "case_names" has been refined: the assumptions in each case
738 can be named now by following the case name with [name1 name2 ...].
740 * Isabelle/Isar reference manual has been updated and extended:
741 - "Synopsis" provides a catalog of main Isar language concepts.
742 - Formal references in syntax diagrams, via @{rail} antiquotation.
743 - Updated material from classic "ref" manual, notably about
744 "Classical Reasoner".
749 * Class bot and top require underlying partial order rather than
750 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
752 * Class complete_lattice: generalized a couple of lemmas from sets;
753 generalized theorems INF_cong and SUP_cong. New type classes for
754 complete boolean algebras and complete linear orders. Lemmas
755 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
756 class complete_linorder.
758 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
759 Sup_fun_def, Inf_apply, Sup_apply.
761 Removed redundant lemmas (the right hand side gives hints how to
762 replace them for (metis ...), or (simp only: ...) proofs):
764 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
765 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
766 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
767 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
768 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
769 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
770 Inter_def ~> INF_def, image_def
771 Union_def ~> SUP_def, image_def
772 INT_eq ~> INF_def, and image_def
773 UN_eq ~> SUP_def, and image_def
774 INF_subset ~> INF_superset_mono [OF _ order_refl]
776 More consistent and comprehensive names:
778 INTER_eq_Inter_image ~> INF_def
779 UNION_eq_Union_image ~> SUP_def
783 INF_leI2 ~> INF_lower2
784 le_INFI ~> INF_greatest
786 le_SUPI2 ~> SUP_upper2
788 INFI_bool_eq ~> INF_bool_eq
789 SUPR_bool_eq ~> SUP_bool_eq
790 INFI_apply ~> INF_apply
791 SUPR_apply ~> SUP_apply
792 INTER_def ~> INTER_eq
793 UNION_def ~> UNION_eq
797 * Renamed theory Complete_Lattice to Complete_Lattices.
800 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
801 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
802 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
803 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
805 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
806 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
807 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
810 * Added syntactic classes "inf" and "sup" for the respective
811 constants. INCOMPATIBILITY: Changes in the argument order of the
812 (mostly internal) locale predicates for some derived classes.
814 * Theorem collections ball_simps and bex_simps do not contain theorems
815 referring to UNION any longer; these have been moved to collection
816 UN_ball_bex_simps. INCOMPATIBILITY.
818 * Theory Archimedean_Field: floor now is defined as parameter of a
819 separate type class floor_ceiling.
821 * Theory Finite_Set: more coherent development of fold_set locales:
823 locale fun_left_comm ~> locale comp_fun_commute
824 locale fun_left_comm_idem ~> locale comp_fun_idem
826 Both use point-free characterization; interpretation proofs may need
827 adjustment. INCOMPATIBILITY.
829 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
830 accordance with standard mathematical terminology. INCOMPATIBILITY.
832 * Theory Complex_Main: The locale interpretations for the
833 bounded_linear and bounded_bilinear locales have been removed, in
834 order to reduce the number of duplicate lemmas. Users must use the
835 original names for distributivity theorems, potential INCOMPATIBILITY.
837 divide.add ~> add_divide_distrib
838 divide.diff ~> diff_divide_distrib
839 divide.setsum ~> setsum_divide_distrib
840 mult.add_right ~> right_distrib
841 mult.diff_right ~> right_diff_distrib
842 mult_right.setsum ~> setsum_right_distrib
843 mult_left.diff ~> left_diff_distrib
845 * Theory Complex_Main: Several redundant theorems have been removed or
846 replaced by more general versions. INCOMPATIBILITY.
848 real_diff_def ~> minus_real_def
849 real_divide_def ~> divide_real_def
850 real_less_def ~> less_le
851 real_abs_def ~> abs_real_def
852 real_sgn_def ~> sgn_real_def
853 real_mult_commute ~> mult_commute
854 real_mult_assoc ~> mult_assoc
855 real_mult_1 ~> mult_1_left
856 real_add_mult_distrib ~> left_distrib
857 real_zero_not_eq_one ~> zero_neq_one
858 real_mult_inverse_left ~> left_inverse
859 INVERSE_ZERO ~> inverse_zero
860 real_le_refl ~> order_refl
861 real_le_antisym ~> order_antisym
862 real_le_trans ~> order_trans
863 real_le_linear ~> linear
864 real_le_eq_diff ~> le_iff_diff_le_0
865 real_add_left_mono ~> add_left_mono
866 real_mult_order ~> mult_pos_pos
867 real_mult_less_mono2 ~> mult_strict_left_mono
868 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
869 real_0_le_divide_iff ~> zero_le_divide_iff
870 realpow_two_disj ~> power2_eq_iff
871 real_squared_diff_one_factored ~> square_diff_one_factored
872 realpow_two_diff ~> square_diff_square_factored
873 reals_complete2 ~> complete_real
874 real_sum_squared_expand ~> power2_sum
875 exp_ln_eq ~> ln_unique
877 expi_zero ~> exp_zero
878 lemma_DERIV_subst ~> DERIV_cong
879 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
880 LIMSEQ_const ~> tendsto_const
881 LIMSEQ_norm ~> tendsto_norm
882 LIMSEQ_add ~> tendsto_add
883 LIMSEQ_minus ~> tendsto_minus
884 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
885 LIMSEQ_diff ~> tendsto_diff
886 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
887 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
888 LIMSEQ_mult ~> tendsto_mult
889 LIMSEQ_inverse ~> tendsto_inverse
890 LIMSEQ_divide ~> tendsto_divide
891 LIMSEQ_pow ~> tendsto_power
892 LIMSEQ_setsum ~> tendsto_setsum
893 LIMSEQ_setprod ~> tendsto_setprod
894 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
895 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
896 LIMSEQ_imp_rabs ~> tendsto_rabs
897 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
898 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
899 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
900 LIMSEQ_Complex ~> tendsto_Complex
901 LIM_ident ~> tendsto_ident_at
902 LIM_const ~> tendsto_const
903 LIM_add ~> tendsto_add
904 LIM_add_zero ~> tendsto_add_zero
905 LIM_minus ~> tendsto_minus
906 LIM_diff ~> tendsto_diff
907 LIM_norm ~> tendsto_norm
908 LIM_norm_zero ~> tendsto_norm_zero
909 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
910 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
911 LIM_rabs ~> tendsto_rabs
912 LIM_rabs_zero ~> tendsto_rabs_zero
913 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
914 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
915 LIM_compose ~> tendsto_compose
916 LIM_mult ~> tendsto_mult
917 LIM_scaleR ~> tendsto_scaleR
918 LIM_of_real ~> tendsto_of_real
919 LIM_power ~> tendsto_power
920 LIM_inverse ~> tendsto_inverse
921 LIM_sgn ~> tendsto_sgn
922 isCont_LIM_compose ~> isCont_tendsto_compose
923 bounded_linear.LIM ~> bounded_linear.tendsto
924 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
925 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
926 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
927 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
928 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
929 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
931 * Theory Complex_Main: The definition of infinite series was
932 generalized. Now it is defined on the type class {topological_space,
933 comm_monoid_add}. Hence it is useable also for extended real numbers.
935 * Theory Complex_Main: The complex exponential function "expi" is now
936 a type-constrained abbreviation for "exp :: complex => complex"; thus
937 several polymorphic lemmas about "exp" are now applicable to "expi".
941 - Theory Library/Code_Char_ord provides native ordering of
942 characters in the target language.
944 - Commands code_module and code_library are legacy, use export_code
947 - Method "evaluation" is legacy, use method "eval" instead.
949 - Legacy evaluator "SML" is deactivated by default. May be
950 reactivated by the following theory command:
952 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
954 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
956 * New proof method "induction" that gives induction hypotheses the
957 name "IH", thus distinguishing them from further hypotheses that come
958 from rule induction. The latter are still called "hyps". Method
959 "induction" is a thin wrapper around "induct" and follows the same
962 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
963 still available as a legacy feature for some time.
966 - Added "need" and "total_consts" options.
967 - Reintroduced "show_skolems" option by popular demand.
968 - Renamed attribute: nitpick_def ~> nitpick_unfold.
972 - Use quasi-sound (and efficient) translations by default.
973 - Added support for the following provers: E-ToFoF, LEO-II,
974 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
975 - Automatically preplay and minimize proofs before showing them if
976 this can be done within reasonable time.
977 - sledgehammer available_provers ~> sledgehammer supported_provers.
979 - Added "preplay_timeout", "slicing", "type_enc", "sound",
980 "max_mono_iters", and "max_new_mono_instances" options.
981 - Removed "explicit_apply" and "full_types" options as well as "Full
982 Types" Proof General menu item. INCOMPATIBILITY.
985 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
986 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
990 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
991 "elim:" options. INCOMPATIBILITY.
992 - Introduced 'try' that not only runs 'try_methods' but also
993 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
996 - Added "eval" option to evaluate terms for the found counterexample
997 (currently only supported by the default (exhaustive) tester).
998 - Added post-processing of terms to obtain readable counterexamples
999 (currently only supported by the default (exhaustive) tester).
1000 - New counterexample generator quickcheck[narrowing] enables
1001 narrowing-based testing. Requires the Glasgow Haskell compiler
1002 with its installation location defined in the Isabelle settings
1003 environment as ISABELLE_GHC.
1004 - Removed quickcheck tester "SML" based on the SML code generator
1005 (formly in HOL/Library).
1007 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
1008 use 'partial_function' instead.
1010 * Theory Library/Extended_Reals replaces now the positive extended
1011 reals found in probability theory. This file is extended by
1012 Multivariate_Analysis/Extended_Real_Limits.
1014 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
1015 from where it must be imported explicitly if it is really required.
1018 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
1019 been moved here. INCOMPATIBILITY.
1021 * Theory Library/Saturated provides type of numbers with saturated
1024 * Theory Library/Product_Lattice defines a pointwise ordering for the
1025 product type 'a * 'b, and provides instance proofs for various order
1026 and lattice type classes.
1028 * Theory Library/Countable now provides the "countable_datatype" proof
1029 method for proving "countable" class instances for datatypes.
1031 * Theory Library/Cset_Monad allows do notation for computable sets
1032 (cset) via the generic monad ad-hoc overloading facility.
1034 * Library: Theories of common data structures are split into theories
1035 for implementation, an invariant-ensuring type, and connection to an
1036 abstract type. INCOMPATIBILITY.
1038 - RBT is split into RBT and RBT_Mapping.
1039 - AssocList is split and renamed into AList and AList_Mapping.
1040 - DList is split into DList_Impl, DList, and DList_Cset.
1041 - Cset is split into Cset and List_Cset.
1043 * Theory Library/Nat_Infinity has been renamed to
1044 Library/Extended_Nat, with name changes of the following types and
1047 type inat ~> type enat
1049 Infty ~> infinity (overloaded)
1053 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
1054 been renamed accordingly. INCOMPATIBILITY.
1056 * Session Multivariate_Analysis: The euclidean_space type class now
1057 fixes a constant "Basis :: 'a set" consisting of the standard
1058 orthonormal basis for the type. Users now have the option of
1059 quantifying over this set instead of using the "basis" function, e.g.
1060 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
1062 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
1063 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
1064 "Cart_nth" and "Cart_lambda" have been respectively renamed to
1065 "vec_nth" and "vec_lambda"; theorems mentioning those names have
1066 changed to match. Definition theorems for overloaded constants now use
1067 the standard "foo_vec_def" naming scheme. A few other theorems have
1068 been renamed as follows (INCOMPATIBILITY):
1070 Cart_eq ~> vec_eq_iff
1071 dist_nth_le_cart ~> dist_vec_nth_le
1072 tendsto_vector ~> vec_tendstoI
1073 Cauchy_vector ~> vec_CauchyI
1075 * Session Multivariate_Analysis: Several duplicate theorems have been
1076 removed, and other theorems have been renamed or replaced with more
1077 general versions. INCOMPATIBILITY.
1079 finite_choice ~> finite_set_choice
1080 eventually_conjI ~> eventually_conj
1081 eventually_and ~> eventually_conj_iff
1082 eventually_false ~> eventually_False
1083 setsum_norm ~> norm_setsum
1084 Lim_sequentially ~> LIMSEQ_def
1085 Lim_ident_at ~> LIM_ident
1086 Lim_const ~> tendsto_const
1087 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
1088 Lim_neg ~> tendsto_minus
1089 Lim_add ~> tendsto_add
1090 Lim_sub ~> tendsto_diff
1091 Lim_mul ~> tendsto_scaleR
1092 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
1093 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
1094 Lim_linear ~> bounded_linear.tendsto
1095 Lim_component ~> tendsto_euclidean_component
1096 Lim_component_cart ~> tendsto_vec_nth
1097 Lim_inner ~> tendsto_inner [OF tendsto_const]
1098 dot_lsum ~> inner_setsum_left
1099 dot_rsum ~> inner_setsum_right
1100 continuous_cmul ~> continuous_scaleR [OF continuous_const]
1101 continuous_neg ~> continuous_minus
1102 continuous_sub ~> continuous_diff
1103 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
1104 continuous_mul ~> continuous_scaleR
1105 continuous_inv ~> continuous_inverse
1106 continuous_at_within_inv ~> continuous_at_within_inverse
1107 continuous_at_inv ~> continuous_at_inverse
1108 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
1109 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
1110 continuous_at_component ~> continuous_component [OF continuous_at_id]
1111 continuous_on_neg ~> continuous_on_minus
1112 continuous_on_sub ~> continuous_on_diff
1113 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
1114 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
1115 continuous_on_mul ~> continuous_on_scaleR
1116 continuous_on_mul_real ~> continuous_on_mult
1117 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
1118 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
1119 continuous_on_inverse ~> continuous_on_inv
1120 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
1121 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
1122 subset_interior ~> interior_mono
1123 subset_closure ~> closure_mono
1124 closure_univ ~> closure_UNIV
1125 real_arch_lt ~> reals_Archimedean2
1126 real_arch ~> reals_Archimedean3
1127 real_abs_norm ~> abs_norm_cancel
1128 real_abs_sub_norm ~> norm_triangle_ineq3
1129 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
1131 * Session HOL-Probability:
1132 - Caratheodory's extension lemma is now proved for ring_of_sets.
1133 - Infinite products of probability measures are now available.
1134 - Sigma closure is independent, if the generator is independent
1135 - Use extended reals instead of positive extended
1136 reals. INCOMPATIBILITY.
1138 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
1140 expand_fun_below ~> fun_below_iff
1141 below_fun_ext ~> fun_belowI
1142 expand_cfun_eq ~> cfun_eq_iff
1143 ext_cfun ~> cfun_eqI
1144 expand_cfun_below ~> cfun_below_iff
1145 below_cfun_ext ~> cfun_belowI
1146 monofun_fun_fun ~> fun_belowD
1147 monofun_fun_arg ~> monofunE
1148 monofun_lub_fun ~> adm_monofun [THEN admD]
1149 cont_lub_fun ~> adm_cont [THEN admD]
1150 cont2cont_Rep_CFun ~> cont2cont_APP
1151 cont_Rep_CFun_app ~> cont_APP_app
1152 cont_Rep_CFun_app_app ~> cont_APP_app_app
1153 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
1154 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
1155 contlub_cfun ~> lub_APP [symmetric]
1156 contlub_LAM ~> lub_LAM [symmetric]
1159 lift_distinct1 ~> lift.distinct(1)
1160 lift_distinct2 ~> lift.distinct(2)
1161 Def_not_UU ~> lift.distinct(2)
1162 Def_inject ~> lift.inject
1163 below_UU_iff ~> below_bottom_iff
1164 eq_UU_iff ~> eq_bottom_iff
1167 *** Document preparation ***
1169 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
1170 isar-ref manual, both for description and actual application of the
1173 * Antiquotation @{value} evaluates the given term and presents its
1176 * Antiquotations: term style "isub" provides ad-hoc conversion of
1177 variables x1, y23 into subscripted form x\<^isub>1,
1178 y\<^isub>2\<^isub>3.
1180 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
1181 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
1183 * Localized \isabellestyle switch can be used within blocks or groups
1186 \isabellestyle{it} %preferred default
1187 {\isabellestylett @{text "typewriter stuff"}}
1189 * Discontinued special treatment of hard tabulators. Implicit
1190 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
1196 * The inner syntax of sort/type/term/prop supports inlined YXML
1197 representations within quoted string tokens. By encoding logical
1198 entities via Term_XML (in ML or Scala) concrete syntax can be
1199 bypassed, which is particularly useful for producing bits of text
1200 under external program control.
1202 * Antiquotations for ML and document preparation are managed as theory
1203 data, which requires explicit setup.
1205 * Isabelle_Process.is_active allows tools to check if the official
1206 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
1207 (better known as Proof General).
1209 * Structure Proof_Context follows standard naming scheme. Old
1210 ProofContext is still available for some time as legacy alias.
1212 * Structure Timing provides various operations for timing; supersedes
1213 former start_timing/end_timing etc.
1215 * Path.print is the official way to show file-system paths to users
1216 (including quotes etc.).
1218 * Inner syntax: identifiers in parse trees of generic categories
1219 "logic", "aprop", "idt" etc. carry position information (disguised as
1220 type constraints). Occasional INCOMPATIBILITY with non-compliant
1221 translations that choke on unexpected type constraints. Positions can
1222 be stripped in ML translations via Syntax.strip_positions /
1223 Syntax.strip_positions_ast, or via the syntax constant
1224 "_strip_positions" within parse trees. As last resort, positions can
1225 be disabled via the configuration option Syntax.positions, which is
1226 called "syntax_positions" in Isar attribute syntax.
1228 * Discontinued special status of various ML structures that contribute
1229 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
1230 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
1231 refer directly to Ast.Constant, Lexicon.is_identifier,
1232 Syntax_Trans.mk_binder_tr etc.
1234 * Typed print translation: discontinued show_sorts argument, which is
1235 already available via context of "advanced" translation.
1237 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
1238 goal states; body tactic needs to address all subgoals uniformly.
1240 * Slightly more special eq_list/eq_set, with shortcut involving
1241 pointer equality (assumes that eq relation is reflexive).
1243 * Classical tactics use proper Proof.context instead of historic types
1244 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
1245 operate directly on Proof.context. Raw type claset retains its use as
1246 snapshot of the classical context, which can be recovered via
1247 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
1248 INCOMPATIBILITY, classical tactics and derived proof methods require
1249 proper Proof.context.
1254 * Discontinued support for Poly/ML 5.2, which was the last version
1255 without proper multithreading and TimeLimit implementation.
1257 * Discontinued old lib/scripts/polyml-platform, which has been
1258 obsolete since Isabelle2009-2.
1260 * Various optional external tools are referenced more robustly and
1261 uniformly by explicit Isabelle settings as follows:
1263 ISABELLE_CSDP (formerly CSDP_EXE)
1264 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
1265 ISABELLE_OCAML (formerly EXEC_OCAML)
1266 ISABELLE_SWIPL (formerly EXEC_SWIPL)
1267 ISABELLE_YAP (formerly EXEC_YAP)
1269 Note that automated detection from the file-system or search path has
1270 been discontinued. INCOMPATIBILITY.
1272 * Scala layer provides JVM method invocation service for static
1273 methods of type (String)String, see Invoke_Scala.method in ML. For
1276 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
1278 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
1279 this allows to pass structured values between ML and Scala.
1281 * The IsabelleText fonts includes some further glyphs to support the
1282 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
1283 installed a local copy (which is normally *not* required) need to
1284 delete or update it from ~~/lib/fonts/.
1288 New in Isabelle2011 (January 2011)
1289 ----------------------------------
1293 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
1294 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
1295 useful tooltips and hyperlinks produced from its static analysis. The
1296 bundled component provides an executable Isabelle tool that can be run
1299 Isabelle2011/bin/isabelle jedit
1301 * Significantly improved Isabelle/Isar implementation manual.
1303 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
1304 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
1305 while the default heap location within that directory lacks that extra
1306 suffix. This isolates multiple Isabelle installations from each
1307 other, avoiding problems with old settings in new versions.
1308 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
1310 * Source files are always encoded as UTF-8, instead of old-fashioned
1311 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
1312 the following package declarations:
1314 \usepackage[utf8]{inputenc}
1315 \usepackage{textcomp}
1317 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
1318 a Unicode character is treated as a single symbol, not a sequence of
1319 non-ASCII bytes as before. Since Isabelle/ML string literals may
1320 contain symbols without further backslash escapes, Unicode can now be
1321 used here as well. Recall that Symbol.explode in ML provides a
1322 consistent view on symbols, while raw explode (or String.explode)
1323 merely give a byte-oriented representation.
1325 * Theory loader: source files are primarily located via the master
1326 directory of each theory node (where the .thy file itself resides).
1327 The global load path is still partially available as legacy feature.
1328 Minor INCOMPATIBILITY due to subtle change in file lookup: use
1329 explicit paths, relatively to the theory.
1331 * Special treatment of ML file names has been discontinued.
1332 Historically, optional extensions .ML or .sml were added on demand --
1333 at the cost of clarity of file dependencies. Recall that Isabelle/ML
1334 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
1336 * Various options that affect pretty printing etc. are now properly
1337 handled within the context via configuration options, instead of
1338 unsynchronized references or print modes. There are both ML Config.T
1339 entities and Isar declaration attributes to access these.
1341 ML (Config.T) Isar (attribute)
1343 eta_contract eta_contract
1344 show_brackets show_brackets
1345 show_sorts show_sorts
1346 show_types show_types
1347 show_question_marks show_question_marks
1348 show_consts show_consts
1349 show_abbrevs show_abbrevs
1351 Syntax.ast_trace syntax_ast_trace
1352 Syntax.ast_stat syntax_ast_stat
1353 Syntax.ambiguity_level syntax_ambiguity_level
1355 Goal_Display.goals_limit goals_limit
1356 Goal_Display.show_main_goal show_main_goal
1358 Method.rule_trace rule_trace
1360 Thy_Output.display thy_output_display
1361 Thy_Output.quotes thy_output_quotes
1362 Thy_Output.indent thy_output_indent
1363 Thy_Output.source thy_output_source
1364 Thy_Output.break thy_output_break
1366 Note that corresponding "..._default" references in ML may only be
1367 changed globally at the ROOT session setup, but *not* within a theory.
1368 The option "show_abbrevs" supersedes the former print mode
1369 "no_abbrevs" with inverted meaning.
1371 * More systematic naming of some configuration options.
1374 trace_simp ~> simp_trace
1375 debug_simp ~> simp_debug
1377 * Support for real valued configuration options, using simplistic
1378 floating-point notation that coincides with the inner syntax for
1381 * Support for real valued preferences (with approximative PGIP type):
1382 front-ends need to accept "pgint" values in float notation.
1385 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
1388 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
1393 * Command 'type_synonym' (with single argument) replaces somewhat
1394 outdated 'types', which is still available as legacy feature for some
1397 * Command 'nonterminal' (with 'and' separated list of arguments)
1398 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
1400 * Command 'notepad' replaces former 'example_proof' for
1401 experimentation in Isar without any result. INCOMPATIBILITY.
1403 * Locale interpretation commands 'interpret' and 'sublocale' accept
1404 lists of equations to map definitions in a locale to appropriate
1405 entities in the context of the interpretation. The 'interpretation'
1406 command already provided this functionality.
1408 * Diagnostic command 'print_dependencies' prints the locale instances
1409 that would be activated if the specified expression was interpreted in
1410 the current context. Variant "print_dependencies!" assumes a context
1411 without interpretations.
1413 * Diagnostic command 'print_interps' prints interpretations in proofs
1414 in addition to interpretations in theories.
1416 * Discontinued obsolete 'global' and 'local' commands to manipulate
1417 the theory name space. Rare INCOMPATIBILITY. The ML functions
1418 Sign.root_path and Sign.local_path may be applied directly where this
1419 feature is still required for historical reasons.
1421 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
1422 'definition' instead.
1424 * The "prems" fact, which refers to the accidental collection of
1425 foundational premises in the context, is now explicitly marked as
1426 legacy feature and will be discontinued soon. Consider using "assms"
1427 of the head statement or reference facts by explicit names.
1429 * Document antiquotations @{class} and @{type} print classes and type
1432 * Document antiquotation @{file} checks file/directory entries within
1433 the local file system.
1438 * Coercive subtyping: functions can be declared as coercions and type
1439 inference will add them as necessary upon input of a term. Theory
1440 Complex_Main declares real :: nat => real and real :: int => real as
1441 coercions. A coercion function f is declared like this:
1443 declare [[coercion f]]
1445 To lift coercions through type constructors (e.g. from nat => real to
1446 nat list => real list), map functions can be declared, e.g.
1448 declare [[coercion_map map]]
1450 Currently coercion inference is activated only in theories including
1451 real numbers, i.e. descendants of Complex_Main. This is controlled by
1452 the configuration option "coercion_enabled", e.g. it can be enabled in
1453 other theories like this:
1455 declare [[coercion_enabled]]
1457 * Command 'partial_function' provides basic support for recursive
1458 function definitions over complete partial orders. Concrete instances
1459 are provided for i) the option type, ii) tail recursion on arbitrary
1460 types, and iii) the heap monad of Imperative_HOL. See
1461 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
1464 * Function package: f.psimps rules are no longer implicitly declared
1465 as [simp]. INCOMPATIBILITY.
1467 * Datatype package: theorems generated for executable equality (class
1468 "eq") carry proper names and are treated as default code equations.
1470 * Inductive package: now offers command 'inductive_simps' to
1471 automatically derive instantiated and simplified equations for
1472 inductive predicates, similar to 'inductive_cases'.
1474 * Command 'enriched_type' allows to register properties of the
1475 functorial structure of types.
1477 * Improved infrastructure for term evaluation using code generator
1478 techniques, in particular static evaluation conversions.
1480 * Code generator: Scala (2.8 or higher) has been added to the target
1483 * Code generator: globbing constant expressions "*" and "Theory.*"
1484 have been replaced by the more idiomatic "_" and "Theory._".
1487 * Code generator: export_code without explicit file declaration prints
1488 to standard output. INCOMPATIBILITY.
1490 * Code generator: do not print function definitions for case
1491 combinators any longer.
1493 * Code generator: simplification with rules determined with
1494 src/Tools/Code/code_simp.ML and method "code_simp".
1496 * Code generator for records: more idiomatic representation of record
1497 types. Warning: records are not covered by ancient SML code
1498 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
1499 rep_datatype declaration helps to succeed then:
1503 rep_datatype foo_ext ...
1505 * Records: logical foundation type for records does not carry a
1506 '_type' suffix any longer (obsolete due to authentic syntax).
1509 * Quickcheck now by default uses exhaustive testing instead of random
1510 testing. Random testing can be invoked by "quickcheck [random]",
1511 exhaustive testing by "quickcheck [exhaustive]".
1513 * Quickcheck instantiates polymorphic types with small finite
1514 datatypes by default. This enables a simple execution mechanism to
1515 handle quantifiers and function equality over the finite datatypes.
1517 * Quickcheck random generator has been renamed from "code" to
1518 "random". INCOMPATIBILITY.
1520 * Quickcheck now has a configurable time limit which is set to 30
1521 seconds by default. This can be changed by adding [timeout = n] to the
1522 quickcheck command. The time limit for Auto Quickcheck is still set
1525 * Quickcheck in locales considers interpretations of that locale for
1526 counter example search.
1529 - Added "smt" and "remote_smt" provers based on the "smt" proof
1530 method. See the Sledgehammer manual for details ("isabelle doc
1533 sledgehammer atp_info ~> sledgehammer running_provers
1534 sledgehammer atp_kill ~> sledgehammer kill_provers
1535 sledgehammer available_atps ~> sledgehammer available_provers
1538 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
1539 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
1540 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
1541 (and "ms" and "min" are no longer supported)
1546 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
1547 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
1549 - Added support for partial quotient types.
1550 - Added local versions of the "Nitpick.register_xxx" functions.
1551 - Added "whack" option.
1552 - Allow registration of quotient types as codatatypes.
1553 - Improved "merge_type_vars" option to merge more types.
1554 - Removed unsound "fast_descrs" option.
1555 - Added custom symmetry breaking for datatypes, making it possible to reach
1556 higher cardinalities.
1557 - Prevent the expansion of too large definitions.
1559 * Proof methods "metis" and "meson" now have configuration options
1560 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
1561 to diagnose these tools. E.g.
1563 using [[metis_trace = true]]
1565 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
1566 manually as command 'solve_direct'.
1568 * The default SMT solver Z3 must be enabled explicitly (due to
1569 licensing issues) by setting the environment variable
1570 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
1571 commercial applications, the SMT solver CVC3 is provided as fall-back;
1572 changing the SMT solver is done via the configuration option
1575 * Remote SMT solvers need to be referred to by the "remote_" prefix,
1576 i.e. "remote_cvc3" and "remote_z3".
1578 * Added basic SMT support for datatypes, records, and typedefs using
1579 the oracle mode (no proofs). Direct support of pairs has been dropped
1580 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
1581 support for a similar behavior). Minor INCOMPATIBILITY.
1583 * Changed SMT configuration options:
1585 z3_proofs ~> smt_oracle (with inverted meaning)
1586 z3_trace_assms ~> smt_trace_used_facts
1599 * Boogie output files (.b2i files) need to be declared in the theory
1602 * Simplification procedure "list_to_set_comprehension" rewrites list
1603 comprehensions applied to List.set to set comprehensions. Occasional
1604 INCOMPATIBILITY, may be deactivated like this:
1606 declare [[simproc del: list_to_set_comprehension]]
1608 * Removed old version of primrec package. INCOMPATIBILITY.
1610 * Removed simplifier congruence rule of "prod_case", as has for long
1611 been the case with "split". INCOMPATIBILITY.
1613 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
1615 * Removed [split_format ... and ... and ...] version of
1616 [split_format]. Potential INCOMPATIBILITY.
1618 * Predicate "sorted" now defined inductively, with nice induction
1619 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
1621 * Constant "contents" renamed to "the_elem", to free the generic name
1622 contents for other uses. INCOMPATIBILITY.
1624 * Renamed class eq and constant eq (for code generation) to class
1625 equal and constant equal, plus renaming of related facts and various
1626 tuning. INCOMPATIBILITY.
1628 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
1630 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
1633 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
1634 avoid confusion with finite sets. INCOMPATIBILITY.
1636 * Abandoned locales equiv, congruent and congruent2 for equivalence
1637 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
1640 * Some previously unqualified names have been qualified:
1647 Trueprop ~> HOL.Trueprop
1652 op --> ~> HOL.implies
1664 Pair ~> Product_Type.Pair
1665 fst ~> Product_Type.fst
1666 snd ~> Product_Type.snd
1667 curry ~> Product_Type.curry
1669 Collect ~> Set.Collect
1673 * More canonical naming convention for some fundamental definitions:
1675 bot_bool_eq ~> bot_bool_def
1676 top_bool_eq ~> top_bool_def
1677 inf_bool_eq ~> inf_bool_def
1678 sup_bool_eq ~> sup_bool_def
1679 bot_fun_eq ~> bot_fun_def
1680 top_fun_eq ~> top_fun_def
1681 inf_fun_eq ~> inf_fun_def
1682 sup_fun_eq ~> sup_fun_def
1686 * More stylized fact names:
1688 expand_fun_eq ~> fun_eq_iff
1689 expand_set_eq ~> set_eq_iff
1691 nat_number ~> eval_nat_numeral
1695 * Refactoring of code-generation specific operations in theory List:
1701 mem_iff ~> member_def
1702 null_empty ~> null_def
1704 INCOMPATIBILITY. Note that these were not supposed to be used
1705 regularly unless for striking reasons; their main purpose was code
1708 Various operations from the Haskell prelude are used for generating
1711 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
1712 "surj f" is now an abbreviation of "range f = UNIV". The theorems
1713 bij_def and surj_def are unchanged. INCOMPATIBILITY.
1715 * Abolished some non-alphabetic type names: "prod" and "sum" replace
1716 "*" and "+" respectively. INCOMPATIBILITY.
1718 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
1719 "Sum_Type.Plus" instead.
1721 * Constant "split" has been merged with constant "prod_case"; names of
1722 ML functions, facts etc. involving split have been retained so far,
1723 though. INCOMPATIBILITY.
1725 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
1726 instead. INCOMPATIBILITY.
1728 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
1731 * Former theory Library/Enum is now part of the HOL-Main image.
1732 INCOMPATIBILITY: all constants of the Enum theory now have to be
1733 referred to by its qualified name.
1736 nlists ~> Enum.nlists
1737 product ~> Enum.product
1739 * Theory Library/Monad_Syntax provides do-syntax for monad types.
1740 Syntax in Library/State_Monad has been changed to avoid ambiguities.
1743 * Theory Library/SetsAndFunctions has been split into
1744 Library/Function_Algebras and Library/Set_Algebras; canonical names
1745 for instance definitions for functions; various improvements.
1748 * Theory Library/Multiset provides stable quicksort implementation of
1751 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
1754 * Session Multivariate_Analysis: introduced a type class for euclidean
1755 space. Most theorems are now stated in terms of euclidean spaces
1756 instead of finite cartesian products.
1759 real ^ 'n ~> 'a::real_vector
1760 ~> 'a::euclidean_space
1761 ~> 'a::ordered_euclidean_space
1762 (depends on your needs)
1766 \<chi> x. _ ~> \<chi>\<chi> x. _
1769 Also note that the indices are now natural numbers and not from some
1770 finite type. Finite cartesian products of euclidean spaces, products
1771 of euclidean spaces the real and complex numbers are instantiated to
1772 be euclidean_spaces. INCOMPATIBILITY.
1774 * Session Probability: introduced pextreal as positive extended real
1775 numbers. Use pextreal as value for measures. Introduce the
1776 Radon-Nikodym derivative, product spaces and Fubini's theorem for
1777 arbitrary sigma finite measures. Introduces Lebesgue measure based on
1778 the integral in Multivariate Analysis. INCOMPATIBILITY.
1780 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
1783 * Session SPARK (with image HOL-SPARK) provides commands to load and
1784 prove verification conditions generated by the SPARK Ada program
1785 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
1790 * Theorems for additive ring operations (locale abelian_monoid and
1791 descendants) are generated by interpretation from their multiplicative
1792 counterparts. Names (in particular theorem names) have the mandatory
1793 qualifier 'add'. Previous theorem names are redeclared for
1796 * Structure "int_ring" is now an abbreviation (previously a
1797 definition). This fits more natural with advanced interpretations.
1802 * The domain package now runs in definitional mode by default: The
1803 former command 'new_domain' is now called 'domain'. To use the domain
1804 package in its original axiomatic mode, use 'domain (unsafe)'.
1807 * The new class "domain" is now the default sort. Class "predomain"
1808 is an unpointed version of "domain". Theories can be updated by
1809 replacing sort annotations as shown below. INCOMPATIBILITY.
1811 'a::type ~> 'a::countable
1812 'a::cpo ~> 'a::predomain
1813 'a::pcpo ~> 'a::domain
1815 * The old type class "rep" has been superseded by class "domain".
1816 Accordingly, users of the definitional package must remove any
1817 "default_sort rep" declarations. INCOMPATIBILITY.
1819 * The domain package (definitional mode) now supports unpointed
1820 predomain argument types, as long as they are marked 'lazy'. (Strict
1821 arguments must be in class "domain".) For example, the following
1822 domain definition now works:
1824 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
1826 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
1827 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
1828 'a option, and 'a list. Additionally, it configures fixrec and the
1829 domain package to work with these types. For example:
1831 fixrec isInl :: "('a + 'b) u -> tr"
1832 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
1834 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
1836 * The "(permissive)" option of fixrec has been replaced with a
1837 per-equation "(unchecked)" option. See
1838 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
1840 * The "bifinite" class no longer fixes a constant "approx"; the class
1841 now just asserts that such a function exists. INCOMPATIBILITY.
1843 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
1844 defines an embedding of type 'a defl into udom by default; instances
1845 of "bifinite" and "domain" classes are available in
1846 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
1848 * The syntax "REP('a)" has been replaced with "DEFL('a)".
1850 * The predicate "directed" has been removed. INCOMPATIBILITY.
1852 * The type class "finite_po" has been removed. INCOMPATIBILITY.
1854 * The function "cprod_map" has been renamed to "prod_map".
1857 * The monadic bind operator on each powerdomain has new binder syntax
1858 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
1859 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
1861 * The infix syntax for binary union on each powerdomain has changed
1862 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
1863 syntax. INCOMPATIBILITY.
1865 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
1866 still supported as an input translation.
1868 * Renamed some theorems (the original names are also still available).
1870 expand_fun_below ~> fun_below_iff
1871 below_fun_ext ~> fun_belowI
1872 expand_cfun_eq ~> cfun_eq_iff
1873 ext_cfun ~> cfun_eqI
1874 expand_cfun_below ~> cfun_below_iff
1875 below_cfun_ext ~> cfun_belowI
1876 cont2cont_Rep_CFun ~> cont2cont_APP
1878 * The Abs and Rep functions for various types have changed names.
1879 Related theorem names have also changed to match. INCOMPATIBILITY.
1881 Rep_CFun ~> Rep_cfun
1882 Abs_CFun ~> Abs_cfun
1883 Rep_Sprod ~> Rep_sprod
1884 Abs_Sprod ~> Abs_sprod
1885 Rep_Ssum ~> Rep_ssum
1886 Abs_Ssum ~> Abs_ssum
1888 * Lemmas with names of the form *_defined_iff or *_strict_iff have
1889 been renamed to *_bottom_iff. INCOMPATIBILITY.
1891 * Various changes to bisimulation/coinduction with domain package:
1893 - Definitions of "bisim" constants no longer mention definedness.
1894 - With mutual recursion, "bisim" predicate is now curried.
1895 - With mutual recursion, each type gets a separate coind theorem.
1896 - Variable names in bisim_def and coinduct rules have changed.
1900 * Case combinators generated by the domain package for type "foo" are
1901 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
1903 * Several theorems have been renamed to more accurately reflect the
1904 names of constants and types involved. INCOMPATIBILITY.
1906 thelub_const ~> lub_const
1907 lub_const ~> is_lub_const
1909 is_lub_lub ~> is_lubD2
1911 unique_lub ~> is_lub_unique
1912 is_ub_lub ~> is_lub_rangeD1
1913 lub_bin_chain ~> is_lub_bin_chain
1914 lub_fun ~> is_lub_fun
1915 thelub_fun ~> lub_fun
1916 thelub_cfun ~> lub_cfun
1917 thelub_Pair ~> lub_Pair
1918 lub_cprod ~> is_lub_prod
1919 thelub_cprod ~> lub_prod
1920 minimal_cprod ~> minimal_prod
1921 inst_cprod_pcpo ~> inst_prod_pcpo
1923 compact_UU ~> compact_bottom
1924 deflation_UU ~> deflation_bottom
1925 finite_deflation_UU ~> finite_deflation_bottom
1927 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
1929 sq_ord_less_eq_trans ~> below_eq_trans
1930 sq_ord_eq_less_trans ~> eq_below_trans
1931 refl_less ~> below_refl
1932 trans_less ~> below_trans
1933 antisym_less ~> below_antisym
1934 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
1935 box_less ~> box_below
1936 rev_trans_less ~> rev_below_trans
1937 not_less2not_eq ~> not_below2not_eq
1938 less_UU_iff ~> below_UU_iff
1939 flat_less_iff ~> flat_below_iff
1940 adm_less ~> adm_below
1941 adm_not_less ~> adm_not_below
1942 adm_compact_not_less ~> adm_compact_not_below
1943 less_fun_def ~> below_fun_def
1944 expand_fun_less ~> fun_below_iff
1945 less_fun_ext ~> fun_belowI
1946 less_discr_def ~> below_discr_def
1947 discr_less_eq ~> discr_below_eq
1948 less_unit_def ~> below_unit_def
1949 less_cprod_def ~> below_prod_def
1950 prod_lessI ~> prod_belowI
1951 Pair_less_iff ~> Pair_below_iff
1952 fst_less_iff ~> fst_below_iff
1953 snd_less_iff ~> snd_below_iff
1954 expand_cfun_less ~> cfun_below_iff
1955 less_cfun_ext ~> cfun_belowI
1956 injection_less ~> injection_below
1957 less_up_def ~> below_up_def
1958 not_Iup_less ~> not_Iup_below
1959 Iup_less ~> Iup_below
1961 Def_inject_less_eq ~> Def_below_Def
1962 Def_less_is_eq ~> Def_below_iff
1963 spair_less_iff ~> spair_below_iff
1964 less_sprod ~> below_sprod
1965 spair_less ~> spair_below
1966 sfst_less_iff ~> sfst_below_iff
1967 ssnd_less_iff ~> ssnd_below_iff
1968 fix_least_less ~> fix_least_below
1969 dist_less_one ~> dist_below_one
1970 less_ONE ~> below_ONE
1971 ONE_less_iff ~> ONE_below_iff
1972 less_sinlD ~> below_sinlD
1973 less_sinrD ~> below_sinrD
1978 * All constant names are now qualified internally and use proper
1979 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
1983 * Greater support for structured proofs involving induction or case analysis.
1985 * Much greater use of special symbols.
1987 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1991 * Antiquotation @{assert} inlines a function bool -> unit that raises
1992 Fail if the argument is false. Due to inlining the source position of
1993 failed assertions is included in the error output.
1995 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
1996 text is in practice always evaluated with a stable theory checkpoint.
1997 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
1999 * Antiquotation @{theory A} refers to theory A from the ancestry of
2000 the current context, not any accidental theory loader state as before.
2001 Potential INCOMPATIBILITY, subtle change in semantics.
2003 * Syntax.pretty_priority (default 0) configures the required priority
2004 of pretty-printed output and thus affects insertion of parentheses.
2006 * Syntax.default_root (default "any") configures the inner syntax
2007 category (nonterminal symbol) for parsing of terms.
2009 * Former exception Library.UnequalLengths now coincides with
2010 ListPair.UnequalLengths.
2012 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
2013 main functionality is provided by structure Simplifier.
2015 * Renamed raw "explode" function to "raw_explode" to emphasize its
2016 meaning. Note that internally to Isabelle, Symbol.explode is used in
2017 almost all situations.
2019 * Discontinued obsolete function sys_error and exception SYS_ERROR.
2020 See implementation manual for further details on exceptions in
2023 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
2026 * Renamed structure PureThy to Pure_Thy and moved most of its
2027 operations to structure Global_Theory, to emphasize that this is
2028 rarely-used global-only stuff.
2030 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
2031 instead (or tracing for high-volume output).
2033 * Configuration option show_question_marks only affects regular pretty
2034 printing of types and terms, not raw Term.string_of_vname.
2036 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
2037 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
2038 @{thms} for most purposes.
2040 * ML structure Unsynchronized is never opened, not even in Isar
2041 interaction mode as before. Old Unsynchronized.set etc. have been
2042 discontinued -- use plain := instead. This should be *rare* anyway,
2043 since modern tools always work via official context data, notably
2044 configuration options.
2046 * Parallel and asynchronous execution requires special care concerning
2047 interrupts. Structure Exn provides some convenience functions that
2048 avoid working directly with raw Interrupt. User code must not absorb
2049 interrupts -- intermediate handling (for cleanup etc.) needs to be
2050 followed by re-raising of the original exception. Another common
2051 source of mistakes are "handle _" patterns, which make the meaning of
2052 the program subject to physical effects of the environment.
2056 New in Isabelle2009-2 (June 2010)
2057 ---------------------------------
2061 * Authentic syntax for *all* logical entities (type classes, type
2062 constructors, term constants): provides simple and robust
2063 correspondence between formal entities and concrete syntax. Within
2064 the parse tree / AST representations, "constants" are decorated by
2065 their category (class, type, const) and spelled out explicitly with
2066 their full internal name.
2068 Substantial INCOMPATIBILITY concerning low-level syntax declarations
2069 and translations (translation rules and translation functions in ML).
2070 Some hints on upgrading:
2072 - Many existing uses of 'syntax' and 'translations' can be replaced
2073 by more modern 'type_notation', 'notation' and 'abbreviation',
2074 which are independent of this issue.
2076 - 'translations' require markup within the AST; the term syntax
2077 provides the following special forms:
2079 CONST c -- produces syntax version of constant c from context
2080 XCONST c -- literally c, checked as constant from context
2081 c -- literally c, if declared by 'syntax'
2083 Plain identifiers are treated as AST variables -- occasionally the
2084 system indicates accidental variables via the error "rhs contains
2087 Type classes and type constructors are marked according to their
2088 concrete syntax. Some old translations rules need to be written
2089 for the "type" category, using type constructor application
2090 instead of pseudo-term application of the default category
2093 - 'parse_translation' etc. in ML may use the following
2096 @{class_syntax c} -- type class c within parse tree / AST
2097 @{term_syntax c} -- type constructor c within parse tree / AST
2098 @{const_syntax c} -- ML version of "CONST c" above
2099 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
2101 - Literal types within 'typed_print_translations', i.e. those *not*
2102 represented as pseudo-terms are represented verbatim. Use @{class
2103 c} or @{type_name c} here instead of the above syntax
2106 Note that old non-authentic syntax was based on unqualified base
2107 names, so all of the above "constant" names would coincide. Recall
2108 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
2109 diagnose syntax problems.
2111 * Type constructors admit general mixfix syntax, not just infix.
2113 * Concrete syntax may be attached to local entities without a proof
2114 body, too. This works via regular mixfix annotations for 'fix',
2115 'def', 'obtain' etc. or via the explicit 'write' command, which is
2116 similar to the 'notation' command in theory specifications.
2118 * Discontinued unnamed infix syntax (legacy feature for many years) --
2119 need to specify constant name and syntax separately. Internal ML
2120 datatype constructors have been renamed from InfixName to Infix etc.
2121 Minor INCOMPATIBILITY.
2123 * Schematic theorem statements need to be explicitly markup as such,
2124 via commands 'schematic_lemma', 'schematic_theorem',
2125 'schematic_corollary'. Thus the relevance of the proof is made
2126 syntactically clear, which impacts performance in a parallel or
2127 asynchronous interactive environment. Minor INCOMPATIBILITY.
2129 * Use of cumulative prems via "!" in some proof methods has been
2130 discontinued (old legacy feature).
2132 * References 'trace_simp' and 'debug_simp' have been replaced by
2133 configuration options stored in the context. Enabling tracing (the
2134 case of debugging is similar) in proofs works via
2136 using [[trace_simp = true]]
2138 Tracing is then active for all invocations of the simplifier in
2139 subsequent goal refinement steps. Tracing may also still be enabled or
2140 disabled via the ProofGeneral settings menu.
2142 * Separate commands 'hide_class', 'hide_type', 'hide_const',
2143 'hide_fact' replace the former 'hide' KIND command. Minor
2146 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
2147 more efficient than combinations with -q1 or -q2.
2152 * Proofterms record type-class reasoning explicitly, using the
2153 "unconstrain" operation internally. This eliminates all sort
2154 constraints from a theorem and proof, introducing explicit
2155 OFCLASS-premises. On the proof term level, this operation is
2156 automatically applied at theorem boundaries, such that closed proofs
2157 are always free of sort constraints. INCOMPATIBILITY for tools that
2158 inspect proof terms.
2160 * Local theory specifications may depend on extra type variables that
2161 are not present in the result type -- arguments TYPE('a) :: 'a itself
2162 are added internally. For example:
2164 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
2166 * Predicates of locales introduced by classes carry a mandatory
2167 "class" prefix. INCOMPATIBILITY.
2169 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
2171 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
2174 * Command 'code_reflect' allows to incorporate generated ML code into
2175 runtime environment; replaces immature code_datatype antiquotation.
2178 * Code generator: simple concept for abstract datatypes obeying
2181 * Code generator: details of internal data cache have no impact on the
2182 user space functionality any longer.
2184 * Methods "unfold_locales" and "intro_locales" ignore non-locale
2185 subgoals. This is more appropriate for interpretations with 'where'.
2188 * Command 'example_proof' opens an empty proof body. This allows to
2189 experiment with Isar, without producing any persistent result.
2191 * Commands 'type_notation' and 'no_type_notation' declare type syntax
2192 within a local theory context, with explicit checking of the
2193 constructors involved (in contrast to the raw 'syntax' versions).
2195 * Commands 'types' and 'typedecl' now work within a local theory
2196 context -- without introducing dependencies on parameters or
2197 assumptions, which is not possible in Isabelle/Pure.
2199 * Command 'defaultsort' has been renamed to 'default_sort', it works
2200 within a local theory context. Minor INCOMPATIBILITY.
2205 * Command 'typedef' now works within a local theory context -- without
2206 introducing dependencies on parameters or assumptions, which is not
2207 possible in Isabelle/Pure/HOL. Note that the logical environment may
2208 contain multiple interpretations of local typedefs (with different
2209 non-emptiness proofs), even in a global theory context.
2211 * New package for quotient types. Commands 'quotient_type' and
2212 'quotient_definition' may be used for defining types and constants by
2213 quotient constructions. An example is the type of integers created by
2214 quotienting pairs of natural numbers:
2217 intrel :: "(nat * nat) => (nat * nat) => bool"
2219 "intrel (x, y) (u, v) = (x + v = u + y)"
2221 quotient_type int = "nat * nat" / intrel
2222 by (auto simp add: equivp_def expand_fun_eq)
2225 "0::int" is "(0::nat, 0::nat)"
2227 The method "lifting" can be used to lift of theorems from the
2228 underlying "raw" type to the quotient type. The example
2229 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
2230 construction and provides a reasoning infrastructure for finite sets.
2232 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
2233 clash with new theory Quotient in Main HOL.
2235 * Moved the SMT binding into the main HOL session, eliminating
2236 separate HOL-SMT session.
2238 * List membership infix mem operation is only an input abbreviation.
2241 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
2242 for future developements; former Library/Word.thy is still present in
2243 the AFP entry RSAPPS.
2245 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
2246 longer shadowed. INCOMPATIBILITY.
2248 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
2251 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
2254 * Dropped normalizing_semiring etc; use the facts in semiring classes
2255 instead. INCOMPATIBILITY.
2257 * Dropped several real-specific versions of lemmas about floor and
2258 ceiling; use the generic lemmas from theory "Archimedean_Field"
2259 instead. INCOMPATIBILITY.
2261 floor_number_of_eq ~> floor_number_of
2262 le_floor_eq_number_of ~> number_of_le_floor
2263 le_floor_eq_zero ~> zero_le_floor
2264 le_floor_eq_one ~> one_le_floor
2265 floor_less_eq_number_of ~> floor_less_number_of
2266 floor_less_eq_zero ~> floor_less_zero
2267 floor_less_eq_one ~> floor_less_one
2268 less_floor_eq_number_of ~> number_of_less_floor
2269 less_floor_eq_zero ~> zero_less_floor
2270 less_floor_eq_one ~> one_less_floor
2271 floor_le_eq_number_of ~> floor_le_number_of
2272 floor_le_eq_zero ~> floor_le_zero
2273 floor_le_eq_one ~> floor_le_one
2274 floor_subtract_number_of ~> floor_diff_number_of
2275 floor_subtract_one ~> floor_diff_one
2276 ceiling_number_of_eq ~> ceiling_number_of
2277 ceiling_le_eq_number_of ~> ceiling_le_number_of
2278 ceiling_le_zero_eq ~> ceiling_le_zero
2279 ceiling_le_eq_one ~> ceiling_le_one
2280 less_ceiling_eq_number_of ~> number_of_less_ceiling
2281 less_ceiling_eq_zero ~> zero_less_ceiling
2282 less_ceiling_eq_one ~> one_less_ceiling
2283 ceiling_less_eq_number_of ~> ceiling_less_number_of
2284 ceiling_less_eq_zero ~> ceiling_less_zero
2285 ceiling_less_eq_one ~> ceiling_less_one
2286 le_ceiling_eq_number_of ~> number_of_le_ceiling
2287 le_ceiling_eq_zero ~> zero_le_ceiling
2288 le_ceiling_eq_one ~> one_le_ceiling
2289 ceiling_subtract_number_of ~> ceiling_diff_number_of
2290 ceiling_subtract_one ~> ceiling_diff_one
2292 * Theory "Finite_Set": various folding_XXX locales facilitate the
2293 application of the various fold combinators on finite sets.
2295 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
2296 provides abstract red-black tree type which is backed by "RBT_Impl" as
2297 implementation. INCOMPATIBILTY.
2299 * Theory Library/Coinductive_List has been removed -- superseded by
2300 AFP/thys/Coinductive.
2302 * Theory PReal, including the type "preal" and related operations, has
2303 been removed. INCOMPATIBILITY.
2305 * Real: new development using Cauchy Sequences.
2307 * Split off theory "Big_Operators" containing setsum, setprod,
2308 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
2310 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
2311 "Int" etc. INCOMPATIBILITY.
2313 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
2315 * New set of rules "ac_simps" provides combined assoc / commute
2316 rewrites for all interpretations of the appropriate generic locales.
2318 * Renamed theory "OrderedGroup" to "Groups" and split theory
2319 "Ring_and_Field" into theories "Rings" and "Fields"; for more
2320 appropriate and more consistent names suitable for name prefixes
2321 within the HOL theories. INCOMPATIBILITY.
2323 * Some generic constants have been put to appropriate theories:
2324 - less_eq, less: Orderings
2325 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
2326 - inverse, divide: Rings
2329 * More consistent naming of type classes involving orderings (and
2332 lower_semilattice ~> semilattice_inf
2333 upper_semilattice ~> semilattice_sup
2335 dense_linear_order ~> dense_linorder
2337 pordered_ab_group_add ~> ordered_ab_group_add
2338 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
2339 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
2340 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
2341 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
2342 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
2343 pordered_cancel_semiring ~> ordered_cancel_semiring
2344 pordered_comm_monoid_add ~> ordered_comm_monoid_add
2345 pordered_comm_ring ~> ordered_comm_ring
2346 pordered_comm_semiring ~> ordered_comm_semiring
2347 pordered_ring ~> ordered_ring
2348 pordered_ring_abs ~> ordered_ring_abs
2349 pordered_semiring ~> ordered_semiring
2351 ordered_ab_group_add ~> linordered_ab_group_add
2352 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
2353 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
2354 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
2355 ordered_field ~> linordered_field
2356 ordered_field_no_lb ~> linordered_field_no_lb
2357 ordered_field_no_ub ~> linordered_field_no_ub
2358 ordered_field_dense_linear_order ~> dense_linordered_field
2359 ordered_idom ~> linordered_idom
2360 ordered_ring ~> linordered_ring
2361 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
2362 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
2363 ordered_ring_strict ~> linordered_ring_strict
2364 ordered_semidom ~> linordered_semidom
2365 ordered_semiring ~> linordered_semiring
2366 ordered_semiring_1 ~> linordered_semiring_1
2367 ordered_semiring_1_strict ~> linordered_semiring_1_strict
2368 ordered_semiring_strict ~> linordered_semiring_strict
2370 The following slightly odd type classes have been moved to a
2371 separate theory Library/Lattice_Algebras:
2373 lordered_ab_group_add ~> lattice_ab_group_add
2374 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
2375 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
2376 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
2377 lordered_ring ~> lattice_ring
2381 * Refined field classes:
2382 - classes division_ring_inverse_zero, field_inverse_zero,
2383 linordered_field_inverse_zero include rule inverse 0 = 0 --
2384 subsumes former division_by_zero class;
2385 - numerous lemmas have been ported from field to division_ring.
2388 * Refined algebra theorem collections:
2389 - dropped theorem group group_simps, use algebra_simps instead;
2390 - dropped theorem group ring_simps, use field_simps instead;
2391 - proper theorem collection field_simps subsumes former theorem
2392 groups field_eq_simps and field_simps;
2393 - dropped lemma eq_minus_self_iff which is a duplicate for
2397 * Theory Finite_Set and List: some lemmas have been generalized from
2400 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
2401 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
2402 inter_Inter_fold_inter ~> inf_Inf_fold_inf
2403 union_Union_fold_union ~> sup_Sup_fold_sup
2404 Inter_fold_inter ~> Inf_fold_inf
2405 Union_fold_union ~> Sup_fold_sup
2406 inter_INTER_fold_inter ~> inf_INFI_fold_inf
2407 union_UNION_fold_union ~> sup_SUPR_fold_sup
2408 INTER_fold_inter ~> INFI_fold_inf
2409 UNION_fold_union ~> SUPR_fold_sup
2411 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
2412 replaced by the more convenient lemmas Inf_empty and Sup_empty.
2413 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
2414 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
2415 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
2416 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
2418 * Reorganized theory Multiset: swapped notation of pointwise and
2421 - pointwise ordering is instance of class order with standard syntax
2423 - multiset ordering has syntax <=# and <#; partial order properties
2424 are provided by means of interpretation with prefix
2426 - less duplication, less historical organization of sections,
2427 conversion from associations lists to multisets, rudimentary code
2429 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
2434 multiset_eq_conv_count_eq ~> multiset_ext_iff
2435 multi_count_ext ~> multiset_ext
2436 diff_union_inverse2 ~> diff_union_cancelR
2440 * Theory Permutation: replaced local "remove" by List.remove1.
2442 * Code generation: ML and OCaml code is decorated with signatures.
2444 * Theory List: added transpose.
2446 * Library/Nat_Bijection.thy is a collection of bijective functions
2447 between nat and other types, which supersedes the older libraries
2448 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
2451 Nat_Int_Bij.nat2_to_nat ~> prod_encode
2452 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
2453 Nat_Int_Bij.int_to_nat_bij ~> int_encode
2454 Nat_Int_Bij.nat_to_int_bij ~> int_decode
2455 Countable.pair_encode ~> prod_encode
2456 NatIso.prod2nat ~> prod_encode
2457 NatIso.nat2prod ~> prod_decode
2458 NatIso.sum2nat ~> sum_encode
2459 NatIso.nat2sum ~> sum_decode
2460 NatIso.list2nat ~> list_encode
2461 NatIso.nat2list ~> list_decode
2462 NatIso.set2nat ~> set_encode
2463 NatIso.nat2set ~> set_decode
2466 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
2467 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
2468 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
2469 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
2470 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
2471 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
2472 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
2473 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
2474 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
2475 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
2476 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
2477 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
2478 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
2481 - Renamed ATP commands:
2482 atp_info ~> sledgehammer running_atps
2483 atp_kill ~> sledgehammer kill_atps
2484 atp_messages ~> sledgehammer messages
2485 atp_minimize ~> sledgehammer minimize
2486 print_atps ~> sledgehammer available_atps
2488 - Added user's manual ("isabelle doc sledgehammer").
2489 - Added option syntax and "sledgehammer_params" to customize
2490 Sledgehammer's behavior. See the manual for details.
2491 - Modified the Isar proof reconstruction code so that it produces
2492 direct proofs rather than proofs by contradiction. (This feature
2493 is still experimental.)
2494 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
2496 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
2499 - Added and implemented "binary_ints" and "bits" options.
2500 - Added "std" option and implemented support for nonstandard models.
2501 - Added and implemented "finitize" option to improve the precision
2502 of infinite datatypes based on a monotonicity analysis.
2503 - Added support for quotient types.
2504 - Added support for "specification" and "ax_specification"
2506 - Added support for local definitions (for "function" and
2507 "termination" proofs).
2508 - Added support for term postprocessors.
2509 - Optimized "Multiset.multiset" and "FinFun.finfun".
2510 - Improved efficiency of "destroy_constrs" optimization.
2511 - Fixed soundness bugs related to "destroy_constrs" optimization and
2513 - Fixed soundness bug related to higher-order constructors.
2514 - Fixed soundness bug when "full_descrs" is enabled.
2515 - Improved precision of set constructs.
2516 - Added "atoms" option.
2517 - Added cache to speed up repeated Kodkod invocations on the same
2519 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
2520 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
2521 "SAT4J_Light". INCOMPATIBILITY.
2522 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
2523 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
2524 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
2526 * Method "induct" now takes instantiations of the form t, where t is not
2527 a variable, as a shorthand for "x == t", where x is a fresh variable.
2528 If this is not intended, t has to be enclosed in parentheses.
2529 By default, the equalities generated by definitional instantiations
2530 are pre-simplified, which may cause parameters of inductive cases
2531 to disappear, or may even delete some of the inductive cases.
2532 Use "induct (no_simp)" instead of "induct" to restore the old
2533 behaviour. The (no_simp) option is also understood by the "cases"
2534 and "nominal_induct" methods, which now perform pre-simplification, too.
2540 * Variable names in lemmas generated by the domain package have
2541 changed; the naming scheme is now consistent with the HOL datatype
2542 package. Some proof scripts may be affected, INCOMPATIBILITY.
2544 * The domain package no longer defines the function "foo_copy" for
2545 recursive domain "foo". The reach lemma is now stated directly in
2546 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
2547 be reformulated in terms of "foo_take", INCOMPATIBILITY.
2549 * Most definedness lemmas generated by the domain package (previously
2550 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
2551 like "foo$x = UU <-> x = UU", which works better as a simp rule.
2552 Proofs that used definedness lemmas as intro rules may break,
2553 potential INCOMPATIBILITY.
2555 * Induction and casedist rules generated by the domain package now
2556 declare proper case_names (one called "bottom", and one named for each
2557 constructor). INCOMPATIBILITY.
2559 * For mutually-recursive domains, separate "reach" and "take_lemma"
2560 rules are generated for each domain, INCOMPATIBILITY.
2562 foo_bar.reach ~> foo.reach bar.reach
2563 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
2565 * Some lemmas generated by the domain package have been renamed for
2566 consistency with the datatype package, INCOMPATIBILITY.
2568 foo.ind ~> foo.induct
2569 foo.finite_ind ~> foo.finite_induct
2570 foo.coind ~> foo.coinduct
2571 foo.casedist ~> foo.exhaust
2572 foo.exhaust ~> foo.nchotomy
2574 * For consistency with other definition packages, the fixrec package
2575 now generates qualified theorem names, INCOMPATIBILITY.
2577 foo_simps ~> foo.simps
2578 foo_unfold ~> foo.unfold
2579 foo_induct ~> foo.induct
2581 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
2582 method and internal fixrec proofs now use the default simpset instead.
2585 * The "contlub" predicate has been removed. Proof scripts should use
2586 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
2588 * The "admw" predicate has been removed, INCOMPATIBILITY.
2590 * The constants cpair, cfst, and csnd have been removed in favor of
2591 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
2596 * Antiquotations for basic formal entities:
2598 @{class NAME} -- type class
2599 @{class_syntax NAME} -- syntax representation of the above
2601 @{type_name NAME} -- logical type
2602 @{type_abbrev NAME} -- type abbreviation
2603 @{nonterminal NAME} -- type of concrete syntactic category
2604 @{type_syntax NAME} -- syntax representation of any of the above
2606 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
2607 @{const_abbrev NAME} -- abbreviated constant
2608 @{const_syntax NAME} -- syntax representation of any of the above
2610 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
2611 syntax constant (cf. 'syntax' command).
2613 * Antiquotation @{make_string} inlines a function to print arbitrary
2614 values similar to the ML toplevel. The result is compiler dependent
2615 and may fall back on "?" in certain situations.
2617 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
2618 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
2619 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
2620 not work with the asynchronous Isar document model.
2622 * Configuration options now admit dynamic default values, depending on
2623 the context or even global references.
2625 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
2626 uses an efficient external library if available (for Poly/ML).
2628 * Renamed some important ML structures, while keeping the old names
2629 for some time as aliases within the structure Legacy:
2631 OuterKeyword ~> Keyword
2634 OuterSyntax ~> Outer_Syntax
2635 PrintMode ~> Print_Mode
2636 SpecParse ~> Parse_Spec
2639 ThyOutput ~> Thy_Output
2640 TypeInfer ~> Type_Infer
2642 Note that "open Legacy" simplifies porting of sources, but forgetting
2643 to remove it again will complicate porting again in the future.
2645 * Most operations that refer to a global context are named
2646 accordingly, e.g. Simplifier.global_context or
2647 ProofContext.init_global. There are some situations where a global
2648 context actually works, but under normal circumstances one needs to
2649 pass the proper local context through the code!
2651 * Discontinued old TheoryDataFun with its copy/init operation -- data
2652 needs to be pure. Functor Theory_Data_PP retains the traditional
2653 Pretty.pp argument to merge, which is absent in the standard
2654 Theory_Data version.
2656 * Sorts.certify_sort and derived "cert" operations for types and terms
2657 no longer minimize sorts. Thus certification at the boundary of the
2658 inference kernel becomes invariant under addition of class relations,
2659 which is an important monotonicity principle. Sorts are now minimized
2660 in the syntax layer only, at the boundary between the end-user and the
2661 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
2662 explicitly in rare situations.
2664 * Renamed old-style Drule.standard to Drule.export_without_context, to
2665 emphasize that this is in no way a standard operation.
2668 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
2669 usual for resolution. Rare INCOMPATIBILITY.
2671 * Renamed varify/unvarify operations to varify_global/unvarify_global
2672 to emphasize that these only work in a global situation (which is
2675 * Curried take and drop in library.ML; negative length is interpreted
2676 as infinity (as in chop). Subtle INCOMPATIBILITY.
2678 * Proof terms: type substitutions on proof constants now use canonical
2679 order of type variables. INCOMPATIBILITY for tools working with proof
2682 * Raw axioms/defs may no longer carry sort constraints, and raw defs
2683 may no longer carry premises. User-level specifications are
2684 transformed accordingly by Thm.add_axiom/add_def.
2689 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
2690 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
2691 proof terms are enabled unconditionally in the new HOL-Proofs image.
2693 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
2694 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
2697 * Old lib/scripts/polyml-platform is superseded by the
2698 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
2699 variant, even on a 64 bit machine. The following example setting
2700 prefers 64 bit if available:
2702 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
2704 * The preliminary Isabelle/jEdit application demonstrates the emerging
2705 Isabelle/Scala layer for advanced prover interaction and integration.
2706 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
2709 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
2710 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
2711 similar to the default assignment of the document preparation system
2712 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
2713 provides some operations for direct access to the font without asking
2714 the user for manual installation.
2718 New in Isabelle2009-1 (December 2009)
2719 -------------------------------------
2723 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
2724 one backslash should be used, even in ML sources.
2729 * Locale interpretation propagates mixins along the locale hierarchy.
2730 The currently only available mixins are the equations used to map
2731 local definitions to terms of the target domain of an interpretation.
2733 * Reactivated diagnostic command 'print_interps'. Use "print_interps
2734 loc" to print all interpretations of locale "loc" in the theory.
2735 Interpretations in proofs are not shown.
2737 * Thoroughly revised locales tutorial. New section on conditional
2740 * On instantiation of classes, remaining undefined class parameters
2741 are formally declared. INCOMPATIBILITY.
2744 *** Document preparation ***
2746 * New generalized style concept for printing terms: @{foo (style) ...}
2747 instead of @{foo_style style ...} (old form is still retained for
2748 backward compatibility). Styles can be also applied for
2749 antiquotations prop, term_type and typeof.
2754 * New proof method "smt" for a combination of first-order logic with
2755 equality, linear and nonlinear (natural/integer/real) arithmetic, and
2756 fixed-size bitvectors; there is also basic support for higher-order
2757 features (esp. lambda abstractions). It is an incomplete decision
2758 procedure based on external SMT solvers using the oracle mechanism;
2759 for the SMT solver Z3, this method is proof-producing. Certificates
2760 are provided to avoid calling the external solvers solely for
2761 re-checking proofs. Due to a remote SMT service there is no need for
2762 installing SMT solvers locally. See src/HOL/SMT.
2764 * New commands to load and prove verification conditions generated by
2765 the Boogie program verifier or derived systems (e.g. the Verifying C
2766 Compiler (VCC) or Spec#). See src/HOL/Boogie.
2768 * New counterexample generator tool 'nitpick' based on the Kodkod
2769 relational model finder. See src/HOL/Tools/Nitpick and
2770 src/HOL/Nitpick_Examples.
2772 * New commands 'code_pred' and 'values' to invoke the predicate
2773 compiler and to enumerate values of inductive predicates.
2775 * A tabled implementation of the reflexive transitive closure.
2777 * New implementation of quickcheck uses generic code generator;
2778 default generators are provided for all suitable HOL types, records
2779 and datatypes. Old quickcheck can be re-activated importing theory
2780 Library/SML_Quickcheck.
2782 * New testing tool Mirabelle for automated proof tools. Applies
2783 several tools and tactics like sledgehammer, metis, or quickcheck, to
2784 every proof step in a theory. To be used in batch mode via the
2785 "mirabelle" utility.
2787 * New proof method "sos" (sum of squares) for nonlinear real
2788 arithmetic (originally due to John Harison). It requires theory
2789 Library/Sum_Of_Squares. It is not a complete decision procedure but
2790 works well in practice on quantifier-free real arithmetic with +, -,
2791 *, ^, =, <= and <, i.e. boolean combinations of equalities and
2792 inequalities between polynomials. It makes use of external
2793 semidefinite programming solvers. Method "sos" generates a
2794 certificate that can be pasted into the proof thus avoiding the need
2795 to call an external tool every time the proof is checked. See
2796 src/HOL/Library/Sum_Of_Squares.
2798 * New method "linarith" invokes existing linear arithmetic decision
2801 * New command 'atp_minimal' reduces result produced by Sledgehammer.
2803 * New Sledgehammer option "Full Types" in Proof General settings menu.
2804 Causes full type information to be output to the ATPs. This slows
2805 ATPs down considerably but eliminates a source of unsound "proofs"
2808 * New method "metisFT": A version of metis that uses full type
2809 information in order to avoid failures of proof reconstruction.
2811 * New evaluator "approximate" approximates an real valued term using
2812 the same method as the approximation method.
2814 * Method "approximate" now supports arithmetic expressions as
2815 boundaries of intervals and implements interval splitting and Taylor
2818 * ML antiquotation @{code_datatype} inserts definition of a datatype
2819 generated by the code generator; e.g. see src/HOL/Predicate.thy.
2821 * New theory SupInf of the supremum and infimum operators for sets of
2824 * New theory Probability, which contains a development of measure
2825 theory, eventually leading to Lebesgue integration and probability.
2827 * Extended Multivariate Analysis to include derivation and Brouwer's
2830 * Reorganization of number theory, INCOMPATIBILITY:
2831 - new number theory development for nat and int, in theories Divides
2832 and GCD as well as in new session Number_Theory
2833 - some constants and facts now suffixed with _nat and _int
2835 - former session NumberTheory now named Old_Number_Theory, including
2836 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
2837 - moved theory Pocklington from src/HOL/Library to
2838 src/HOL/Old_Number_Theory
2840 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
2841 lcm of finite and infinite sets. It is shown that they form a complete
2844 * Class semiring_div requires superclass no_zero_divisors and proof of
2845 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
2846 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
2847 generalized to class semiring_div, subsuming former theorems
2848 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
2849 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
2852 * Refinements to lattice classes and sets:
2853 - less default intro/elim rules in locale variant, more default
2854 intro/elim rules in class variant: more uniformity
2855 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
2857 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
2859 - renamed ACI to inf_sup_aci
2860 - new class "boolean_algebra"
2861 - class "complete_lattice" moved to separate theory
2862 "Complete_Lattice"; corresponding constants (and abbreviations)
2863 renamed and with authentic syntax:
2864 Set.Inf ~> Complete_Lattice.Inf
2865 Set.Sup ~> Complete_Lattice.Sup
2866 Set.INFI ~> Complete_Lattice.INFI
2867 Set.SUPR ~> Complete_Lattice.SUPR
2868 Set.Inter ~> Complete_Lattice.Inter
2869 Set.Union ~> Complete_Lattice.Union
2870 Set.INTER ~> Complete_Lattice.INTER
2871 Set.UNION ~> Complete_Lattice.UNION
2872 - authentic syntax for
2875 - mere abbreviations:
2878 Set.inter (for inf, formerly Set.Int)
2879 Set.union (for sup, formerly Set.Un)
2880 Complete_Lattice.Inter (for Inf)
2881 Complete_Lattice.Union (for Sup)
2882 Complete_Lattice.INTER (for INFI)
2883 Complete_Lattice.UNION (for SUPR)
2884 - object-logic definitions as far as appropriate
2886 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
2887 Un_subset_iff are explicitly deleted as default simp rules; then also
2888 their lattice counterparts le_inf_iff and le_sup_iff have to be
2889 deleted to achieve the desired effect.
2891 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
2892 rules by default any longer; the same applies to min_max.inf_absorb1
2893 etc. INCOMPATIBILITY.
2895 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
2896 pred_set_conv by default. INCOMPATIBILITY.
2898 * Power operations on relations and functions are now one dedicated
2899 constant "compow" with infix syntax "^^". Power operation on
2900 multiplicative monoids retains syntax "^" and is now defined generic
2901 in class power. INCOMPATIBILITY.
2903 * Relation composition "R O S" now has a more standard argument order:
2904 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
2905 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
2906 break, since the O_assoc rule was not rewritten like this. Fix using
2907 O_assoc[symmetric]. The same applies to the curried version "R OO S".
2909 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
2910 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
2913 * Most rules produced by inductive and datatype package have mandatory
2914 prefixes. INCOMPATIBILITY.
2916 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
2917 the attribute of the same name. Each of the theorems in the list
2918 DERIV_intros assumes composition with an additional function and
2919 matches a variable to the derivative, which has to be solved by the
2920 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
2921 of most elementary terms. Former Maclauren.DERIV_tac and
2922 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
2925 * Code generator attributes follow the usual underscore convention:
2926 code_unfold replaces code unfold
2927 code_post replaces code post
2932 sizechange -> size_change
2933 induct_scheme -> induction_schema
2936 * Discontinued abbreviation "arbitrary" of constant "undefined".
2937 INCOMPATIBILITY, use "undefined" directly.
2940 Suc_eq_add_numeral_1 -> Suc_eq_plus1
2941 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
2942 Suc_plus1 -> Suc_eq_plus1
2943 *anti_sym -> *antisym*
2944 vector_less_eq_def -> vector_le_def
2947 * Added theorem List.map_map as [simp]. Removed List.map_compose.
2950 * Removed predicate "M hassize n" (<--> card M = n & finite M).
2956 * Theory Representable defines a class "rep" of domains that are
2957 representable (via an ep-pair) in the universal domain type "udom".
2958 Instances are provided for all type constructors defined in HOLCF.
2960 * The 'new_domain' command is a purely definitional version of the
2961 domain package, for representable domains. Syntax is identical to the
2962 old domain package. The 'new_domain' package also supports indirect
2963 recursion using previously-defined type constructors. See
2964 src/HOLCF/ex/New_Domain.thy for examples.
2966 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
2967 on the left-hand side of an equation, and then performs
2968 simplification. Rewriting is done using rules declared with the
2969 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
2970 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
2972 * The pattern-match compiler in 'fixrec' can now handle constructors
2973 with HOL function types. Pattern-match combinators for the Pair
2974 constructor are pre-configured.
2976 * The 'fixrec' package now produces better fixed-point induction rules
2977 for mutually-recursive definitions: Induction rules have conclusions
2978 of the form "P foo bar" instead of "P <foo, bar>".
2980 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
2981 been renamed to "below". The name "below" now replaces "less" in many
2982 theorem names. (Legacy theorem names using "less" are still supported
2985 * The 'fixrec' package now supports "bottom patterns". Bottom
2986 patterns can be used to generate strictness rules, or to make
2987 functions more strict (much like the bang-patterns supported by the
2988 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
2994 * Support for Poly/ML 5.3.0, with improved reporting of compiler
2995 errors and run-time exceptions, including detailed source positions.
2997 * Structure Name_Space (formerly NameSpace) now manages uniquely
2998 identified entries, with some additional information such as source
2999 position, logical grouping etc.
3001 * Theory and context data is now introduced by the simplified and
3002 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
3003 to be pure, but the old TheoryDataFun for mutable data (with explicit
3004 copy operation) is still available for some time.
3006 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
3007 provides a high-level programming interface to synchronized state
3008 variables with atomic update. This works via pure function
3009 application within a critical section -- its runtime should be as
3010 short as possible; beware of deadlocks if critical code is nested,
3011 either directly or indirectly via other synchronized variables!
3013 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
3014 wraps raw ML references, explicitly indicating their non-thread-safe
3015 behaviour. The Isar toplevel keeps this structure open, to
3016 accommodate Proof General as well as quick and dirty interactive
3017 experiments with references.
3019 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
3020 parallel tactical reasoning.
3022 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
3023 are similar to SUBPROOF, but are slightly more flexible: only the
3024 specified parts of the subgoal are imported into the context, and the
3025 body tactic may introduce new subgoals and schematic variables.
3027 * Old tactical METAHYPS, which does not observe the proof context, has
3028 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
3029 or Subgoal.FOCUS etc.
3031 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
3032 functors have their own ML name space there is no point to mark them
3033 separately.) Minor INCOMPATIBILITY.
3035 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
3037 * Renamed several structures FooBar to Foo_Bar. Occasional,
3040 * Operations of structure Skip_Proof no longer require quick_and_dirty
3041 mode, which avoids critical setmp.
3043 * Eliminated old Attrib.add_attributes, Method.add_methods and related
3044 combinators for "args". INCOMPATIBILITY, need to use simplified
3045 Attrib/Method.setup introduced in Isabelle2009.
3047 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
3048 back on global_simpset_of, global_claset_of, global_clasimpset_of as
3049 last resort. INCOMPATIBILITY.
3051 * Display.pretty_thm now requires a proper context (cf. former
3052 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
3053 or even Display.pretty_thm_without_context as last resort.
3056 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
3057 Syntax.pretty_typ/term directly, preferably with proper context
3058 instead of global theory.
3063 * Further fine tuning of parallel proof checking, scales up to 8 cores
3064 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
3067 * Support for additional "Isabelle components" via etc/components, see
3068 also the system manual.
3070 * The isabelle makeall tool now operates on all components with
3071 IsaMakefile, not just hardwired "logics".
3073 * Removed "compress" option from isabelle-process and isabelle usedir;
3074 this is always enabled.
3076 * Discontinued support for Poly/ML 4.x versions.
3078 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
3079 on a given logic image. This requires the lighttpd webserver and is
3080 currently supported on Linux only.
3084 New in Isabelle2009 (April 2009)
3085 --------------------------------
3089 * Simplified main Isabelle executables, with less surprises on
3090 case-insensitive file-systems (such as Mac OS).
3092 - The main Isabelle tool wrapper is now called "isabelle" instead of
3095 - The former "isabelle" alias for "isabelle-process" has been
3096 removed (should rarely occur to regular users).
3098 - The former "isabelle-interface" and its alias "Isabelle" have been
3099 removed (interfaces are now regular Isabelle tools).
3101 Within scripts and make files, the Isabelle environment variables
3102 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
3103 respectively. (The latter are still available as legacy feature.)
3105 The old isabelle-interface wrapper could react in confusing ways if
3106 the interface was uninstalled or changed otherwise. Individual
3107 interface tool configuration is now more explicit, see also the
3108 Isabelle system manual. In particular, Proof General is now available
3109 via "isabelle emacs".
3111 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
3112 purge installed copies of Isabelle executables and re-run "isabelle
3113 install -p ...", or use symlinks.
3115 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
3116 old ~/isabelle, which was slightly non-standard and apt to cause
3117 surprises on case-insensitive file-systems (such as Mac OS).
3119 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
3120 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
3121 care is required when using older releases of Isabelle. Note that
3122 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
3123 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
3125 * Proofs of fully specified statements are run in parallel on
3126 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
3127 a regular 4-core machine, if the initial heap space is made reasonably
3128 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
3130 * The main reference manuals ("isar-ref", "implementation", and
3131 "system") have been updated and extended. Formally checked references
3132 as hyperlinks are now available uniformly.
3137 * Complete re-implementation of locales. INCOMPATIBILITY in several
3138 respects. The most important changes are listed below. See the
3139 Tutorial on Locales ("locales" manual) for details.
3141 - In locale expressions, instantiation replaces renaming. Parameters
3142 must be declared in a for clause. To aid compatibility with previous
3143 parameter inheritance, in locale declarations, parameters that are not
3144 'touched' (instantiation position "_" or omitted) are implicitly added
3145 with their syntax at the beginning of the for clause.
3147 - Syntax from abbreviations and definitions in locales is available in
3148 locale expressions and context elements. The latter is particularly
3149 useful in locale declarations.
3151 - More flexible mechanisms to qualify names generated by locale
3152 expressions. Qualifiers (prefixes) may be specified in locale
3153 expressions, and can be marked as mandatory (syntax: "name!:") or
3154 optional (syntax "name?:"). The default depends for plain "name:"
3155 depends on the situation where a locale expression is used: in
3156 commands 'locale' and 'sublocale' prefixes are optional, in
3157 'interpretation' and 'interpret' prefixes are mandatory. The old
3158 implicit qualifiers derived from the parameter names of a locale are
3159 no longer generated.
3161 - Command "sublocale l < e" replaces "interpretation l < e". The
3162 instantiation clause in "interpretation" and "interpret" (square
3163 brackets) is no longer available. Use locale expressions.
3165 - When converting proof scripts, mandatory qualifiers in
3166 'interpretation' and 'interpret' should be retained by default, even
3167 if this is an INCOMPATIBILITY compared to former behavior. In the
3168 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
3169 in locale expressions range over a single locale instance only.
3171 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
3172 In existing theorem specifications replace the includes element by the
3173 respective context elements of the included locale, omitting those
3174 that are already present in the theorem specification. Multiple
3175 assume elements of a locale should be replaced by a single one
3176 involving the locale predicate. In the proof body, declarations (most
3177 notably theorems) may be regained by interpreting the respective
3178 locales in the proof context as required (command "interpret").
3180 If using "includes" in replacement of a target solely because the
3181 parameter types in the theorem are not as general as in the target,
3182 consider declaring a new locale with additional type constraints on
3183 the parameters (context element "constrains").
3185 - Discontinued "locale (open)". INCOMPATIBILITY.
3187 - Locale interpretation commands no longer attempt to simplify goal.
3188 INCOMPATIBILITY: in rare situations the generated goal differs. Use
3189 methods intro_locales and unfold_locales to clarify.
3191 - Locale interpretation commands no longer accept interpretation
3192 attributes. INCOMPATIBILITY.
3194 * Class declaration: so-called "base sort" must not be given in import
3195 list any longer, but is inferred from the specification. Particularly
3202 class foo = type + ...
3204 * Class target: global versions of theorems stemming do not carry a
3205 parameter prefix any longer. INCOMPATIBILITY.
3207 * Class 'instance' command no longer accepts attached definitions.
3208 INCOMPATIBILITY, use proper 'instantiation' target instead.
3210 * Recovered hiding of consts, which was accidentally broken in
3211 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
3212 makes c inaccessible; consider using ``hide (open) const c'' instead.
3214 * Slightly more coherent Pure syntax, with updated documentation in
3215 isar-ref manual. Removed locales meta_term_syntax and
3216 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
3217 INCOMPATIBILITY in rare situations. Note that &&& should not be used
3218 directly in regular applications.
3220 * There is a new syntactic category "float_const" for signed decimal
3221 fractions (e.g. 123.45 or -123.45).
3223 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
3224 interface with 'setup' command instead.
3226 * Command 'local_setup' is similar to 'setup', but operates on a local
3229 * The 'axiomatization' command now only works within a global theory
3230 context. INCOMPATIBILITY.
3232 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
3233 hypotheses. Sorts required in the course of reasoning need to be
3234 covered by the constraints in the initial statement, completed by the
3235 type instance information of the background theory. Non-trivial sort
3236 hypotheses, which rarely occur in practice, may be specified via
3237 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
3239 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
3241 The result contains an implicit sort hypotheses as before --
3242 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
3245 * Generalized Isar history, with support for linear undo, direct state
3248 * Changed defaults for unify configuration options:
3250 unify_trace_bound = 50 (formerly 25)
3251 unify_search_bound = 60 (formerly 30)
3253 * Different bookkeeping for code equations (INCOMPATIBILITY):
3255 a) On theory merge, the last set of code equations for a particular
3256 constant is taken (in accordance with the policy applied by other
3257 parts of the code generator framework).
3259 b) Code equations stemming from explicit declarations (e.g. code
3260 attribute) gain priority over default code equations stemming
3261 from definition, primrec, fun etc.
3263 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
3265 * Unified theorem tables for both code generators. Thus [code
3266 func] has disappeared and only [code] remains. INCOMPATIBILITY.
3268 * Command 'find_consts' searches for constants based on type and name
3271 find_consts "_ => bool"
3273 By default, matching is against subtypes, but it may be restricted to
3274 the whole type. Searching by name is possible. Multiple queries are
3275 conjunctive and queries may be negated by prefixing them with a
3278 find_consts strict: "_ => bool" name: "Int" -"int => int"
3280 * New 'find_theorems' criterion "solves" matches theorems that
3281 directly solve the current goal (modulo higher-order unification).
3283 * Auto solve feature for main theorem statements: whenever a new goal
3284 is stated, "find_theorems solves" is called; any theorems that could
3285 solve the lemma directly are listed as part of the goal state.
3286 Cf. associated options in Proof General Isabelle settings menu,
3287 enabled by default, with reasonable timeout for pathological cases of
3288 higher-order unification.
3291 *** Document preparation ***
3293 * Antiquotation @{lemma} now imitates a regular terminal proof,
3294 demanding keyword 'by' and supporting the full method expression
3295 syntax just like the Isar command 'by'.
3300 * Integrated main parts of former image HOL-Complex with HOL. Entry
3301 points Main and Complex_Main remain as before.
3303 * Logic image HOL-Plain provides a minimal HOL with the most important
3304 tools available (inductive, datatype, primrec, ...). This facilitates
3305 experimentation and tool development. Note that user applications
3306 (and library theories) should never refer to anything below theory
3309 * Logic image HOL-Main stops at theory Main, and thus facilitates
3310 experimentation due to shorter build times.
3312 * Logic image HOL-NSA contains theories of nonstandard analysis which
3313 were previously part of former HOL-Complex. Entry point Hyperreal
3314 remains valid, but theories formerly using Complex_Main should now use
3315 new entry point Hypercomplex.
3317 * Generic ATP manager for Sledgehammer, based on ML threads instead of
3318 Posix processes. Avoids potentially expensive forking of the ML
3319 process. New thread-based implementation also works on non-Unix
3320 platforms (Cygwin). Provers are no longer hardwired, but defined
3321 within the theory via plain ML wrapper functions. Basic Sledgehammer
3322 commands are covered in the isar-ref manual.
3324 * Wrapper scripts for remote SystemOnTPTP service allows to use
3325 sledgehammer without local ATP installation (Vampire etc.). Other
3326 provers may be included via suitable ML wrappers, see also
3327 src/HOL/ATP_Linkup.thy.
3329 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
3332 * The metis method no longer fails because the theorem is too trivial
3333 (contains the empty clause).
3335 * The metis method now fails in the usual manner, rather than raising
3336 an exception, if it determines that it cannot prove the theorem.
3338 * Method "coherent" implements a prover for coherent logic (see also
3339 src/Tools/coherent.ML).
3341 * Constants "undefined" and "default" replace "arbitrary". Usually
3342 "undefined" is the right choice to replace "arbitrary", though
3343 logically there is no difference. INCOMPATIBILITY.
3345 * Command "value" now integrates different evaluation mechanisms. The
3346 result of the first successful evaluation mechanism is printed. In
3347 square brackets a particular named evaluation mechanisms may be
3348 specified (currently, [SML], [code] or [nbe]). See further
3349 src/HOL/ex/Eval_Examples.thy.
3351 * Normalization by evaluation now allows non-leftlinear equations.
3352 Declare with attribute [code nbe].
3354 * Methods "case_tac" and "induct_tac" now refer to the very same rules
3355 as the structured Isar versions "cases" and "induct", cf. the
3356 corresponding "cases" and "induct" attributes. Mutual induction rules
3357 are now presented as a list of individual projections
3358 (e.g. foo_bar.inducts for types foo and bar); the old format with
3359 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
3360 rare situations a different rule is selected --- notably nested tuple
3361 elimination instead of former prod.exhaust: use explicit (case_tac t
3362 rule: prod.exhaust) here.
3364 * Attributes "cases", "induct", "coinduct" support "del" option.
3366 * Removed fact "case_split_thm", which duplicates "case_split".
3368 * The option datatype has been moved to a new theory Option. Renamed
3369 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
3371 * New predicate "strict_mono" classifies strict functions on partial
3372 orders. With strict functions on linear orders, reasoning about
3373 (in)equalities is facilitated by theorems "strict_mono_eq",
3374 "strict_mono_less_eq" and "strict_mono_less".
3376 * Some set operations are now proper qualified constants with
3377 authentic syntax. INCOMPATIBILITY:
3388 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
3391 * Auxiliary class "itself" has disappeared -- classes without any
3392 parameter are treated as expected by the 'class' command.
3394 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
3396 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
3397 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
3399 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
3400 method "approximation". It proves formulas on real values by using
3401 interval arithmetic. In the formulas are also the transcendental
3402 functions sin, cos, tan, atan, ln, exp and the constant pi are
3403 allowed. For examples see
3404 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
3406 * Theory "Reflection" now resides in HOL/Library.
3408 * Entry point to Word library now simply named "Word".
3411 * Made source layout more coherent with logical distribution
3414 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
3415 src/HOL/Library/Code_Message.thy ~> src/HOL/
3416 src/HOL/Library/GCD.thy ~> src/HOL/
3417 src/HOL/Library/Order_Relation.thy ~> src/HOL/
3418 src/HOL/Library/Parity.thy ~> src/HOL/
3419 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
3420 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
3421 src/HOL/Real/Lubs.thy ~> src/HOL/
3422 src/HOL/Real/PReal.thy ~> src/HOL/
3423 src/HOL/Real/Rational.thy ~> src/HOL/
3424 src/HOL/Real/RComplete.thy ~> src/HOL/
3425 src/HOL/Real/RealDef.thy ~> src/HOL/
3426 src/HOL/Real/RealPow.thy ~> src/HOL/
3427 src/HOL/Real/Real.thy ~> src/HOL/
3428 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
3429 src/HOL/Complex/Complex.thy ~> src/HOL/
3430 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
3431 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
3432 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
3433 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
3434 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
3435 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
3436 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
3437 src/HOL/Hyperreal/Log.thy ~> src/HOL/
3438 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
3439 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
3440 src/HOL/Hyperreal/Series.thy ~> src/HOL/
3441 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
3442 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
3443 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
3444 src/HOL/Real/Float ~> src/HOL/Library/
3445 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
3446 src/HOL/Real/RealVector.thy ~> src/HOL/
3448 src/HOL/arith_data.ML ~> src/HOL/Tools
3449 src/HOL/hologic.ML ~> src/HOL/Tools
3450 src/HOL/simpdata.ML ~> src/HOL/Tools
3451 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
3452 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
3453 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
3454 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
3455 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
3456 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
3457 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
3459 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
3460 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
3461 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
3462 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
3463 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
3464 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
3466 * If methods "eval" and "evaluation" encounter a structured proof
3467 state with !!/==>, only the conclusion is evaluated to True (if
3468 possible), avoiding strange error messages.
3470 * Method "sizechange" automates termination proofs using (a
3471 modification of) the size-change principle. Requires SAT solver. See
3472 src/HOL/ex/Termination.thy for examples.
3474 * Simplifier: simproc for let expressions now unfolds if bound
3475 variable occurs at most once in let expression body. INCOMPATIBILITY.
3477 * Method "arith": Linear arithmetic now ignores all inequalities when
3478 fast_arith_neq_limit is exceeded, instead of giving up entirely.
3480 * New attribute "arith" for facts that should always be used
3481 automatically by arithmetic. It is intended to be used locally in
3484 assumes [arith]: "x > 0"
3486 Global usage is discouraged because of possible performance impact.
3488 * New classes "top" and "bot" with corresponding operations "top" and
3489 "bot" in theory Orderings; instantiation of class "complete_lattice"
3490 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
3492 * Changed definition lemma "less_fun_def" in order to provide an
3493 instance for preorders on functions; use lemma "less_le" instead.
3496 * Theory Orderings: class "wellorder" moved here, with explicit
3497 induction rule "less_induct" as assumption. For instantiation of
3498 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
3501 * Theory Orderings: added class "preorder" as superclass of "order".
3502 INCOMPATIBILITY: Instantiation proofs for order, linorder
3503 etc. slightly changed. Some theorems named order_class.* now named
3506 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
3509 * Theory Finite_Set: added a new fold combinator of type
3511 ('a => 'b => 'b) => 'b => 'a set => 'b
3513 Occasionally this is more convenient than the old fold combinator
3514 which is now defined in terms of the new one and renamed to
3517 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
3518 and "ring_simps" have been replaced by "algebra_simps" (which can be
3519 extended with further lemmas!). At the moment both still exist but
3520 the former will disappear at some point.
3522 * Theory Power: Lemma power_Suc is now declared as a simp rule in
3523 class recpower. Type-specific simp rules for various recpower types
3524 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
3526 rat_power_0 -> power_0
3527 rat_power_Suc -> power_Suc
3528 realpow_0 -> power_0
3529 realpow_Suc -> power_Suc
3530 complexpow_0 -> power_0
3531 complexpow_Suc -> power_Suc
3532 power_poly_0 -> power_0
3533 power_poly_Suc -> power_Suc
3535 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
3536 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
3537 dvd has been generalized to class comm_semiring_1. Likewise a bunch
3538 of lemmas from Divides has been generalized from nat to class
3539 semiring_div. INCOMPATIBILITY. This involves the following theorem
3540 renames resulting from duplicate elimination:
3542 dvd_def_mod ~> dvd_eq_mod_eq_0
3543 zero_dvd_iff ~> dvd_0_left_iff
3544 dvd_0 ~> dvd_0_right
3545 DIVISION_BY_ZERO_DIV ~> div_by_0
3546 DIVISION_BY_ZERO_MOD ~> mod_by_0
3547 mult_div ~> div_mult_self2_is_id
3548 mult_mod ~> mod_mult_self2_is_0
3550 * Theory IntDiv: removed many lemmas that are instances of class-based
3551 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
3552 rename old lemmas as follows:
3554 dvd_diff -> nat_dvd_diff
3555 dvd_zminus_iff -> dvd_minus_iff
3556 mod_add1_eq -> mod_add_eq
3557 mod_mult1_eq -> mod_mult_right_eq
3558 mod_mult1_eq' -> mod_mult_left_eq
3559 mod_mult_distrib_mod -> mod_mult_eq
3560 nat_mod_add_left_eq -> mod_add_left_eq
3561 nat_mod_add_right_eq -> mod_add_right_eq
3562 nat_mod_div_trivial -> mod_div_trivial
3563 nat_mod_mod_trivial -> mod_mod_trivial
3564 zdiv_zadd_self1 -> div_add_self1
3565 zdiv_zadd_self2 -> div_add_self2
3566 zdiv_zmult_self1 -> div_mult_self2_is_id
3567 zdiv_zmult_self2 -> div_mult_self1_is_id
3568 zdvd_triv_left -> dvd_triv_left
3569 zdvd_triv_right -> dvd_triv_right
3570 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
3571 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
3572 zmod_zadd_left_eq -> mod_add_left_eq
3573 zmod_zadd_right_eq -> mod_add_right_eq
3574 zmod_zadd_self1 -> mod_add_self1
3575 zmod_zadd_self2 -> mod_add_self2
3576 zmod_zadd1_eq -> mod_add_eq
3577 zmod_zdiff1_eq -> mod_diff_eq
3578 zmod_zdvd_zmod -> mod_mod_cancel
3579 zmod_zmod_cancel -> mod_mod_cancel
3580 zmod_zmult_self1 -> mod_mult_self2_is_0
3581 zmod_zmult_self2 -> mod_mult_self1_is_0
3584 zdvd_abs1 -> abs_dvd_iff
3585 zdvd_abs2 -> dvd_abs_iff
3586 zdvd_refl -> dvd_refl
3587 zdvd_trans -> dvd_trans
3588 zdvd_zadd -> dvd_add
3589 zdvd_zdiff -> dvd_diff
3590 zdvd_zminus_iff -> dvd_minus_iff
3591 zdvd_zminus2_iff -> minus_dvd_iff
3592 zdvd_zmultD -> dvd_mult_right
3593 zdvd_zmultD2 -> dvd_mult_left
3594 zdvd_zmult_mono -> mult_dvd_mono
3595 zdvd_0_right -> dvd_0_right
3596 zdvd_0_left -> dvd_0_left_iff
3597 zdvd_1_left -> one_dvd
3598 zminus_dvd_iff -> minus_dvd_iff
3600 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
3602 * The real numbers offer decimal input syntax: 12.34 is translated
3603 into 1234/10^2. This translation is not reversed upon output.
3605 * Theory Library/Polynomial defines an abstract type 'a poly of
3606 univariate polynomials with coefficients of type 'a. In addition to
3607 the standard ring operations, it also supports div and mod. Code
3608 generation is also supported, using list-style constructors.
3610 * Theory Library/Inner_Product defines a class of real_inner for real
3611 inner product spaces, with an overloaded operation inner :: 'a => 'a
3612 => real. Class real_inner is a subclass of real_normed_vector from
3615 * Theory Library/Product_Vector provides instances for the product
3616 type 'a * 'b of several classes from RealVector and Inner_Product.
3617 Definitions of addition, subtraction, scalar multiplication, norms,
3618 and inner products are included.
3620 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
3621 addition to the field operations, numerals and case syntax are also
3624 * Theory Library/Diagonalize provides constructive version of Cantor's
3625 first diagonalization argument.
3627 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
3628 zlcm (for int); carried together from various gcd/lcm developements in
3629 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
3630 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
3631 may recover tupled syntax as follows:
3633 hide (open) const gcd
3634 abbreviation gcd where
3635 "gcd == (%(a, b). GCD.gcd a b)"
3637 GCD.gcd ("gcd '(_, _')")
3639 The same works for lcm, zgcd, zlcm.
3641 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
3642 instantiations for algebraic structures. Removed some duplicate
3643 theorems. Changes in simp rules. INCOMPATIBILITY.
3645 * ML antiquotation @{code} takes a constant as argument and generates
3646 corresponding code in background and inserts name of the corresponding
3647 resulting ML value/function/datatype constructor binding in place.
3648 All occurrences of @{code} with a single ML block are generated
3649 simultaneously. Provides a generic and safe interface for
3650 instrumentalizing code generation. See
3651 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
3652 In future you ought to refrain from ad-hoc compiling generated SML
3653 code on the ML toplevel. Note that (for technical reasons) @{code}
3654 cannot refer to constants for which user-defined serializations are
3655 set. Refer to the corresponding ML counterpart directly in that
3658 * Command 'rep_datatype': instead of theorem names the command now
3659 takes a list of terms denoting the constructors of the type to be
3660 represented as datatype. The characteristic theorems have to be
3661 proven. INCOMPATIBILITY. Also observe that the following theorems
3662 have disappeared in favour of existing ones:
3664 unit_induct ~> unit.induct
3665 prod_induct ~> prod.induct
3666 sum_induct ~> sum.induct
3667 Suc_Suc_eq ~> nat.inject
3668 Suc_not_Zero Zero_not_Suc ~> nat.distinct
3673 * New locales for orders and lattices where the equivalence relation
3674 is not restricted to equality. INCOMPATIBILITY: all order and lattice
3675 locales use a record structure with field eq for the equivalence.
3677 * New theory of factorial domains.
3679 * Units_l_inv and Units_r_inv are now simp rules by default.
3680 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
3681 and/or r_inv will now also require deletion of these lemmas.
3683 * Renamed the following theorems, INCOMPATIBILITY:
3685 UpperD ~> Upper_memD
3686 LowerD ~> Lower_memD
3687 least_carrier ~> least_closed
3688 greatest_carrier ~> greatest_closed
3689 greatest_Lower_above ~> greatest_Lower_below
3690 one_zero ~> carrier_one_zero
3691 one_not_zero ~> carrier_one_not_zero (collision with assumption)
3696 * Nominal datatypes can now contain type-variables.
3698 * Commands 'nominal_inductive' and 'equivariance' work with local
3701 * Nominal primrec can now works with local theory targets and its
3702 specification syntax now conforms to the general format as seen in
3705 * Method "perm_simp" honours the standard simplifier attributes
3706 (no_asm), (no_asm_use) etc.
3708 * The new predicate #* is defined like freshness, except that on the
3709 left hand side can be a set or list of atoms.
3711 * Experimental command 'nominal_inductive2' derives strong induction
3712 principles for inductive definitions. In contrast to
3713 'nominal_inductive', which can only deal with a fixed number of
3714 binders, it can deal with arbitrary expressions standing for sets of
3715 atoms to be avoided. The only inductive definition we have at the
3716 moment that needs this generalisation is the typing rule for Lets in
3719 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
3720 -----------------------------------------------------------------
3721 Gamma |- Let x be t1 in t2 : T2
3723 In this rule one wants to avoid all the binders that are introduced by
3724 "close Gamma T1". We are looking for other examples where this
3725 feature might be useful. Please let us know.
3730 * Reimplemented the simplification procedure for proving continuity
3731 subgoals. The new simproc is extensible; users can declare additional
3732 continuity introduction rules with the attribute [cont2cont].
3734 * The continuity simproc now uses a different introduction rule for
3735 solving continuity subgoals on terms with lambda abstractions. In
3736 some rare cases the new simproc may fail to solve subgoals that the
3737 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
3738 Potential INCOMPATIBILITY.
3740 * Command 'fixrec': specification syntax now conforms to the general
3741 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
3742 examples. INCOMPATIBILITY.
3747 * Proof of Zorn's Lemma for partial orders.
3752 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
3753 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
3754 depends on multithreading, so timouts will not work before Poly/ML
3757 * High-level support for concurrent ML programming, see
3758 src/Pure/Cuncurrent. The data-oriented model of "future values" is
3759 particularly convenient to organize independent functional
3760 computations. The concept of "synchronized variables" provides a
3761 higher-order interface for components with shared state, avoiding the
3762 delicate details of mutexes and condition variables. (Requires
3763 Poly/ML 5.2.1 or later.)
3765 * ML bindings produced via Isar commands are stored within the Isar
3766 context (theory or proof). Consequently, commands like 'use' and 'ML'
3767 become thread-safe and work with undo as expected (concerning
3768 top-level bindings, not side-effects on global references).
3769 INCOMPATIBILITY, need to provide proper Isar context when invoking the
3770 compiler at runtime; really global bindings need to be given outside a
3771 theory. (Requires Poly/ML 5.2 or later.)
3773 * Command 'ML_prf' is analogous to 'ML' but works within a proof
3774 context. Top-level ML bindings are stored within the proof context in
3775 a purely sequential fashion, disregarding the nested proof structure.
3776 ML bindings introduced by 'ML_prf' are discarded at the end of the
3777 proof. (Requires Poly/ML 5.2 or later.)
3779 * Simplified ML attribute and method setup, cf. functions Attrib.setup
3780 and Method.setup, as well as Isar commands 'attribute_setup' and
3781 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
3782 existing code accordingly, or use plain 'setup' together with old
3785 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
3786 to 'a -> thm, while results are always tagged with an authentic oracle
3787 name. The Isar command 'oracle' is now polymorphic, no argument type
3788 is specified. INCOMPATIBILITY, need to simplify existing oracle code
3789 accordingly. Note that extra performance may be gained by producing
3790 the cterm carefully, avoiding slow Thm.cterm_of.
3792 * Simplified interface for defining document antiquotations via
3793 ThyOutput.antiquotation, ThyOutput.output, and optionally
3794 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
3795 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
3798 * More systematic treatment of long names, abstract name bindings, and
3799 name space operations. Basic operations on qualified names have been
3800 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
3801 Long_Name.append. Old type bstring has been mostly replaced by
3802 abstract type binding (see structure Binding), which supports precise
3803 qualification by packages and local theory targets, as well as proper
3804 tracking of source positions. INCOMPATIBILITY, need to wrap old
3805 bstring values into Binding.name, or better pass through abstract
3806 bindings everywhere. See further src/Pure/General/long_name.ML,
3807 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
3809 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
3810 LocalTheory.note etc.) now refer to the *full* internal name, not the
3811 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
3813 * Disposed old type and term read functions (Sign.read_def_typ,
3814 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
3815 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
3816 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
3817 Syntax.read_term_global etc.; see also OldGoals.read_term as last
3818 resort for legacy applications.
3820 * Disposed old declarations, tactics, tactic combinators that refer to
3821 the simpset or claset of an implicit theory (such as Addsimps,
3822 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
3823 embedded ML text, or local_simpset_of with a proper context passed as
3824 explicit runtime argument.
3826 * Rules and tactics that read instantiations (read_instantiate,
3827 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
3828 context, which is required for parsing and type-checking. Moreover,
3829 the variables are specified as plain indexnames, not string encodings
3830 thereof. INCOMPATIBILITY.
3832 * Generic Toplevel.add_hook interface allows to analyze the result of
3833 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
3834 for theorem dependency output of transactions resulting in a new
3837 * ML antiquotations: block-structured compilation context indicated by
3838 \<lbrace> ... \<rbrace>; additional antiquotation forms:
3840 @{binding name} - basic name binding
3841 @{let ?pat = term} - term abbreviation (HO matching)
3842 @{note name = fact} - fact abbreviation
3843 @{thm fact} - singleton fact (with attributes)
3844 @{thms fact} - general fact (with attributes)
3845 @{lemma prop by method} - singleton goal
3846 @{lemma prop by meth1 meth2} - singleton goal
3847 @{lemma prop1 ... propN by method} - general goal
3848 @{lemma prop1 ... propN by meth1 meth2} - general goal
3849 @{lemma (open) ...} - open derivation
3854 * The Isabelle "emacs" tool provides a specific interface to invoke
3855 Proof General / Emacs, with more explicit failure if that is not
3856 installed (the old isabelle-interface script silently falls back on
3857 isabelle-process). The PROOFGENERAL_HOME setting determines the
3858 installation location of the Proof General distribution.
3860 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
3861 the Isabelle process into a JVM/Scala application. See
3862 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
3863 process wrapper has been discontinued.)
3865 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
3867 * Various status messages (with exact source position information) are
3868 emitted, if proper markup print mode is enabled. This allows
3869 user-interface components to provide detailed feedback on internal
3874 New in Isabelle2008 (June 2008)
3875 -------------------------------
3879 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
3880 and updated, with formally checked references as hyperlinks.
3882 * Theory loader: use_thy (and similar operations) no longer set the
3883 implicit ML context, which was occasionally hard to predict and in
3884 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
3885 provides a proper context already.
3887 * Theory loader: old-style ML proof scripts being *attached* to a thy
3888 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
3889 'use' within a theory file will do the job.
3891 * Name space merge now observes canonical order, i.e. the second space
3892 is inserted into the first one, while existing entries in the first
3893 space take precedence. INCOMPATIBILITY in rare situations, may try to
3894 swap theory imports.
3896 * Syntax: symbol \<chi> is now considered a letter. Potential
3897 INCOMPATIBILITY in identifier syntax etc.
3899 * Outer syntax: string tokens no longer admit escaped white space,
3900 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
3901 white space without escapes.
3903 * Outer syntax: string tokens may contain arbitrary character codes
3904 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
3910 * Context-dependent token translations. Default setup reverts locally
3911 fixed variables, and adds hilite markup for undeclared frees.
3913 * Unused theorems can be found using the new command 'unused_thms'.
3914 There are three ways of invoking it:
3917 Only finds unused theorems in the current theory.
3919 (2) unused_thms thy_1 ... thy_n -
3920 Finds unused theorems in the current theory and all of its ancestors,
3921 excluding the theories thy_1 ... thy_n and all of their ancestors.
3923 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
3924 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
3925 their ancestors, excluding the theories thy_1 ... thy_n and all of
3928 In order to increase the readability of the list produced by
3929 unused_thms, theorems that have been created by a particular instance
3930 of a theory command such as 'inductive' or 'function' are considered
3931 to belong to the same "group", meaning that if at least one theorem in
3932 this group is used, the other theorems in the same group are no longer
3933 reported as unused. Moreover, if all theorems in the group are
3934 unused, only one theorem in the group is displayed.
3936 Note that proof objects have to be switched on in order for
3937 unused_thms to work properly (i.e. !proofs must be >= 1, which is
3938 usually the case when using Proof General with the default settings).
3940 * Authentic naming of facts disallows ad-hoc overwriting of previous
3941 theorems within the same name space. INCOMPATIBILITY, need to remove
3942 duplicate fact bindings, or even accidental fact duplications. Note
3943 that tools may maintain dynamically scoped facts systematically, using
3944 PureThy.add_thms_dynamic.
3946 * Command 'hide' now allows to hide from "fact" name space as well.
3948 * Eliminated destructive theorem database, simpset, claset, and
3949 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
3950 update of theories within ML code.
3952 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
3953 INCOMPATIBILITY, object-logics depending on former Pure require
3954 additional setup PureThy.old_appl_syntax_setup; object-logics
3955 depending on former CPure need to refer to Pure.
3957 * Commands 'use' and 'ML' are now purely functional, operating on
3958 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
3959 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
3962 * Command 'setup': discontinued implicit version with ML reference.
3964 * Instantiation target allows for simultaneous specification of class
3965 instance operations together with an instantiation proof.
3966 Type-checking phase allows to refer to class operations uniformly.
3967 See src/HOL/Complex/Complex.thy for an Isar example and
3968 src/HOL/Library/Eval.thy for an ML example.
3970 * Indexing of literal facts: be more serious about including only
3971 facts from the visible specification/proof context, but not the
3972 background context (locale etc.). Affects `prop` notation and method
3973 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
3976 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
3977 "(open)" option, which used to expose internal bound variables to the
3980 * Isar statements: removed obsolete case "rule_context".
3981 INCOMPATIBILITY, better use explicit fixes/assumes.
3983 * Locale proofs: default proof step now includes 'unfold_locales';
3984 hence 'proof' without argument may be used to unfold locale
3988 *** Document preparation ***
3990 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
3991 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
3992 obsolete thumbpdf setup (contemporary PDF viewers do this on the
3993 spot); renamed link color from "darkblue" to "linkcolor" (default
3994 value unchanged, can be redefined via \definecolor); no longer sets
3995 "a4paper" option (unnecessary or even intrusive).
3997 * Antiquotation @{lemma A method} proves proposition A by the given
3998 method (either a method name or a method name plus (optional) method
3999 arguments in parentheses) and prints A just like @{prop A}.
4004 * New primrec package. Specification syntax conforms in style to
4005 definition/function/.... No separate induction rule is provided. The
4006 "primrec" command distinguishes old-style and new-style specifications
4007 by syntax. The former primrec package is now named OldPrimrecPackage.
4008 When adjusting theories, beware: constants stemming from new-style
4009 primrec specifications have authentic syntax.
4011 * Metis prover is now an order of magnitude faster, and also works
4012 with multithreading.
4014 * Metis: the maximum number of clauses that can be produced from a
4015 theorem is now given by the attribute max_clauses. Theorems that
4016 exceed this number are ignored, with a warning printed.
4018 * Sledgehammer no longer produces structured proofs by default. To
4019 enable, declare [[sledgehammer_full = true]]. Attributes
4020 reconstruction_modulus, reconstruction_sorts renamed
4021 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
4023 * Method "induct_scheme" derives user-specified induction rules
4024 from well-founded induction and completeness of patterns. This factors
4025 out some operations that are done internally by the function package
4026 and makes them available separately. See
4027 src/HOL/ex/Induction_Scheme.thy for examples.
4029 * More flexible generation of measure functions for termination
4030 proofs: Measure functions can be declared by proving a rule of the
4031 form "is_measure f" and giving it the [measure_function] attribute.
4032 The "is_measure" predicate is logically meaningless (always true), and
4033 just guides the heuristic. To find suitable measure functions, the
4034 termination prover sets up the goal "is_measure ?f" of the appropriate
4035 type and generates all solutions by prolog-style backwards proof using
4038 This setup also deals with rules like
4040 "is_measure f ==> is_measure (list_size f)"
4042 which accommodates nested datatypes that recurse through lists.
4043 Similar rules are predeclared for products and option types.
4045 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
4049 - Definitions of overloaded constants on sets have to be replaced by
4050 definitions on => and bool.
4052 - Some definitions of overloaded operators on sets can now be proved
4053 using the definitions of the operators on => and bool. Therefore,
4054 the following theorems have been renamed:
4056 subset_def -> subset_eq
4057 psubset_def -> psubset_eq
4058 set_diff_def -> set_diff_eq
4059 Compl_def -> Compl_eq
4060 Sup_set_def -> Sup_set_eq
4061 Inf_set_def -> Inf_set_eq
4062 sup_set_def -> sup_set_eq
4063 inf_set_def -> inf_set_eq
4065 - Due to the incompleteness of the HO unification algorithm, some
4066 rules such as subst may require manual instantiation, if some of
4067 the unknowns in the rule is a set.
4069 - Higher order unification and forward proofs:
4072 have "P (S::'a set)" <...>
4073 then have "EX S. P S" ..
4075 no longer works (due to the incompleteness of the HO unification
4076 algorithm) and must be replaced by the pattern
4083 - Calculational reasoning with subst (or similar rules):
4086 have "P (S::'a set)" <...>
4087 also have "S = T" <...>
4088 finally have "P T" .
4090 no longer works (for similar reasons as the previous example) and
4091 must be replaced by something like
4093 have "P (S::'a set)" <...>
4094 moreover have "S = T" <...>
4095 ultimately have "P T" by simp
4097 - Tactics or packages written in ML code:
4098 Code performing pattern matching on types via
4100 Type ("set", [T]) => ...
4102 must be rewritten. Moreover, functions like strip_type or
4103 binder_types no longer return the right value when applied to a
4106 T1 => ... => Tn => U => bool
4110 T1 => ... => Tn => U set
4112 * Merged theories Wellfounded_Recursion, Accessible_Part and
4113 Wellfounded_Relations to theory Wellfounded.
4115 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
4117 * Class finite no longer treats UNIV as class parameter. Use class
4118 enum from theory Library/Enum instead to achieve a similar effect.
4121 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
4122 and "Cons". INCOMPATIBILITY.
4124 * HOL (and FOL): renamed variables in rules imp_elim and swap.
4125 Potential INCOMPATIBILITY.
4127 * Theory Product_Type: duplicated lemmas split_Pair_apply and
4128 injective_fst_snd removed, use split_eta and prod_eqI instead.
4129 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
4131 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
4132 the same name in theory Orderings:
4142 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
4143 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
4144 and different variable names.
4146 * Library/Option_ord.thy: Canonical order on option type.
4148 * Library/RBT.thy: Red-black trees, an efficient implementation of
4151 * Library/Countable.thy: Type class for countable types.
4153 * Theory Int: The representation of numerals has changed. The infix
4154 operator BIT and the bit datatype with constructors B0 and B1 have
4155 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
4156 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
4157 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
4160 * Theory Nat: definition of <= and < on natural numbers no longer
4161 depend on well-founded relations. INCOMPATIBILITY. Definitions
4162 le_def and less_def have disappeared. Consider lemmas not_less
4163 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
4165 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
4166 (whose purpose mainly is for various fold_set functionals) have been
4167 abandoned in favor of the existing algebraic classes
4168 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
4169 lower_semilattice (resp. upper_semilattice) and linorder.
4172 * Theory Transitive_Closure: induct and cases rules now declare proper
4173 case_names ("base" and "step"). INCOMPATIBILITY.
4175 * Theorem Inductive.lfp_ordinal_induct generalized to complete
4176 lattices. The form set-specific version is available as
4177 Inductive.lfp_ordinal_induct_set.
4179 * Renamed theorems "power.simps" to "power_int.simps".
4182 * Class semiring_div provides basic abstract properties of semirings
4183 with division and modulo operations. Subsumes former class dvd_mod.
4185 * Merged theories IntDef, Numeral and IntArith into unified theory
4186 Int. INCOMPATIBILITY.
4188 * Theory Library/Code_Index: type "index" now represents natural
4189 numbers rather than integers. INCOMPATIBILITY.
4191 * New class "uminus" with operation "uminus" (split of from class
4192 "minus" which now only has operation "minus", binary).
4195 * Constants "card", "internal_split", "option_map" now with authentic
4196 syntax. INCOMPATIBILITY.
4198 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
4199 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
4200 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
4201 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
4202 Sup_set_def, le_def, less_def, option_map_def now with object
4203 equality. INCOMPATIBILITY.
4205 * Records. Removed K_record, and replaced it by pure lambda term
4206 %x. c. The simplifier setup is now more robust against eta expansion.
4207 INCOMPATIBILITY: in cases explicitly referring to K_record.
4209 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
4211 * Library/ListVector: new theory of arithmetic vector operations.
4213 * Library/Order_Relation: new theory of various orderings as sets of
4214 pairs. Defines preorders, partial orders, linear orders and
4215 well-orders on sets and on types.
4220 * Renamed some theories to allow to loading both ZF and HOL in the
4223 Datatype -> Datatype_ZF
4224 Inductive -> Inductive_ZF
4231 INCOMPATIBILITY: ZF theories that import individual theories below
4232 Main might need to be adapted. Regular theory Main is still
4233 available, as trivial extension of Main_ZF.
4238 * ML within Isar: antiquotation @{const name} or @{const
4239 name(typargs)} produces statically-checked Const term.
4241 * Functor NamedThmsFun: data is available to the user as dynamic fact
4242 (of the same name). Removed obsolete print command.
4244 * Removed obsolete "use_legacy_bindings" function.
4246 * The ``print mode'' is now a thread-local value derived from a global
4247 template (the former print_mode reference), thus access becomes
4248 non-critical. The global print_mode reference is for session
4249 management only; user-code should use print_mode_value,
4250 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
4252 * Functions system/system_out provide a robust way to invoke external
4253 shell commands, with propagation of interrupts (requires Poly/ML
4254 5.2.1). Do not use OS.Process.system etc. from the basis library!
4259 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
4260 in accordance with Proof General 3.7, which prefers GNU emacs.
4262 * isatool tty runs Isabelle process with plain tty interaction;
4263 optional line editor may be specified via ISABELLE_LINE_EDITOR
4264 setting, the default settings attempt to locate "ledit" and "rlwrap".
4266 * isatool browser now works with Cygwin as well, using general
4267 "javapath" function defined in Isabelle process environment.
4269 * YXML notation provides a simple and efficient alternative to
4270 standard XML transfer syntax. See src/Pure/General/yxml.ML and
4271 isatool yxml as described in the Isabelle system manual.
4273 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
4274 provides general wrapper for managing an Isabelle process in a robust
4275 fashion, with ``cooked'' output from stdin/stderr.
4277 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
4278 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
4280 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
4281 way of changing the user's settings is via
4282 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
4285 * Multithreading.max_threads := 0 refers to the number of actual CPU
4286 cores of the underlying machine, which is a good starting point for
4287 optimal performance tuning. The corresponding usedir option -M allows
4288 "max" as an alias for "0". WARNING: does not work on certain versions
4289 of Mac OS (with Poly/ML 5.1).
4291 * isabelle-process: non-ML sessions are run with "nice", to reduce the
4292 adverse effect of Isabelle flooding interactive front-ends (notably
4293 ProofGeneral / XEmacs).
4297 New in Isabelle2007 (November 2007)
4298 -----------------------------------
4302 * More uniform information about legacy features, notably a
4303 warning/error of "Legacy feature: ...", depending on the state of the
4304 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
4305 legacy features will disappear eventually.
4307 * Theory syntax: the header format ``theory A = B + C:'' has been
4308 discontinued in favour of ``theory A imports B C begin''. Use isatool
4309 fixheaders to convert existing theory files. INCOMPATIBILITY.
4311 * Theory syntax: the old non-Isar theory file format has been
4312 discontinued altogether. Note that ML proof scripts may still be used
4313 with Isar theories; migration is usually quite simple with the ML
4314 function use_legacy_bindings. INCOMPATIBILITY.
4316 * Theory syntax: some popular names (e.g. 'class', 'declaration',
4317 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
4320 * Theory loader: be more serious about observing the static theory
4321 header specifications (including optional directories), but not the
4322 accidental file locations of previously successful loads. The strict
4323 update policy of former update_thy is now already performed by
4324 use_thy, so the former has been removed; use_thys updates several
4325 theories simultaneously, just as 'imports' within a theory header
4326 specification, but without merging the results. Potential
4327 INCOMPATIBILITY: may need to refine theory headers and commands
4328 ROOT.ML which depend on load order.
4330 * Theory loader: optional support for content-based file
4331 identification, instead of the traditional scheme of full physical
4332 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
4333 (cf. the system manual). The new scheme allows to work with
4334 non-finished theories in persistent session images, such that source
4335 files may be moved later on without requiring reloads.
4337 * Theory loader: old-style ML proof scripts being *attached* to a thy
4338 file (with the same base name as the theory) are considered a legacy
4339 feature, which will disappear eventually. Even now, the theory loader
4340 no longer maintains dependencies on such files.
4342 * Syntax: the scope for resolving ambiguities via type-inference is
4343 now limited to individual terms, instead of whole simultaneous
4344 specifications as before. This greatly reduces the complexity of the
4345 syntax module and improves flexibility by separating parsing and
4346 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
4347 'fixes' etc.) are required in rare situations.
4349 * Syntax: constants introduced by new-style packages ('definition',
4350 'abbreviation' etc.) are passed through the syntax module in
4351 ``authentic mode''. This means that associated mixfix annotations
4352 really stick to such constants, independently of potential name space
4353 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
4354 trees are represented slightly differently, may need to adapt syntax
4355 translations accordingly. Use CONST marker in 'translations' and
4356 @{const_syntax} antiquotation in 'parse_translation' etc.
4358 * Legacy goal package: reduced interface to the bare minimum required
4359 to keep existing proof scripts running. Most other user-level
4360 functions are now part of the OldGoals structure, which is *not* open
4361 by default (consider isatool expandshort before open OldGoals).
4362 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
4363 these tend to cause confusion about the actual goal (!) context being
4364 used here, which is not necessarily the same as the_context().
4366 * Command 'find_theorems': supports "*" wild-card in "name:"
4367 criterion; "with_dups" option. Certain ProofGeneral versions might
4368 support a specific search form (see ProofGeneral/CHANGES).
4370 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
4371 by default, which means that "prems" (and also "fixed variables") are
4372 suppressed from proof state output. Note that the ProofGeneral
4373 settings mechanism allows to change and save options persistently, but
4374 older versions of Isabelle will fail to start up if a negative prems
4377 * Local theory targets may be specified by non-nested blocks of
4378 ``context/locale/class ... begin'' followed by ``end''. The body may
4379 contain definitions, theorems etc., including any derived mechanism
4380 that has been implemented on top of these primitives. This concept
4381 generalizes the existing ``theorem (in ...)'' towards more versatility
4384 * Proof General interface: proper undo of final 'end' command;
4385 discontinued Isabelle/classic mode (ML proof scripts).
4388 *** Document preparation ***
4390 * Added antiquotation @{theory name} which prints the given name,
4391 after checking that it refers to a valid ancestor theory in the
4394 * Added antiquotations @{ML_type text} and @{ML_struct text} which
4395 check the given source text as ML type/structure, printing verbatim.
4397 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
4398 "c args == rhs" given in the current context. (Any number of
4399 arguments may be given on the LHS.)
4404 * The 'class' package offers a combination of axclass and locale to
4405 achieve Haskell-like type classes in Isabelle. Definitions and
4406 theorems within a class context produce both relative results (with
4407 implicit parameters according to the locale context), and polymorphic
4408 constants with qualified polymorphism (according to the class
4409 context). Within the body context of a 'class' target, a separate
4410 syntax layer ("user space type system") takes care of converting
4411 between global polymorphic consts and internal locale representation.
4412 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
4413 "isatool doc classes" provides a tutorial.
4415 * Generic code generator framework allows to generate executable
4416 code for ML and Haskell (including Isabelle classes). A short usage
4419 internal compilation:
4420 export_code <list of constants (term syntax)> in SML
4421 writing SML code to a file:
4422 export_code <list of constants (term syntax)> in SML <filename>
4423 writing OCaml code to a file:
4424 export_code <list of constants (term syntax)> in OCaml <filename>
4425 writing Haskell code to a bunch of files:
4426 export_code <list of constants (term syntax)> in Haskell <filename>
4428 evaluating closed propositions to True/False using code generation:
4431 Reasonable default setup of framework in HOL.
4433 Theorem attributs for selecting and transforming function equations theorems:
4435 [code fun]: select a theorem as function equation for a specific constant
4436 [code fun del]: deselect a theorem as function equation for a specific constant
4437 [code inline]: select an equation theorem for unfolding (inlining) in place
4438 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
4440 User-defined serializations (target in {SML, OCaml, Haskell}):
4442 code_const <and-list of constants (term syntax)>
4443 {(target) <and-list of const target syntax>}+
4445 code_type <and-list of type constructors>
4446 {(target) <and-list of type target syntax>}+
4448 code_instance <and-list of instances>
4450 where instance ::= <type constructor> :: <class>
4452 code_class <and_list of classes>
4453 {(target) <and-list of class target syntax>}+
4454 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
4456 code_instance and code_class only are effective to target Haskell.
4458 For example usage see src/HOL/ex/Codegenerator.thy and
4459 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
4460 generation from Isabelle/HOL theories is available via "isatool doc
4463 * Code generator: consts in 'consts_code' Isar commands are now
4464 referred to by usual term syntax (including optional type
4467 * Command 'no_translations' removes translation rules from theory
4470 * Overloaded definitions are now actually checked for acyclic
4471 dependencies. The overloading scheme is slightly more general than
4472 that of Haskell98, although Isabelle does not demand an exact
4473 correspondence to type class and instance declarations.
4474 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
4475 exotic versions of overloading -- at the discretion of the user!
4477 Polymorphic constants are represented via type arguments, i.e. the
4478 instantiation that matches an instance against the most general
4479 declaration given in the signature. For example, with the declaration
4480 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
4481 as c(nat). Overloading is essentially simultaneous structural
4482 recursion over such type arguments. Incomplete specification patterns
4483 impose global constraints on all occurrences, e.g. c('a * 'a) on the
4484 LHS means that more general c('a * 'b) will be disallowed on any RHS.
4485 Command 'print_theory' outputs the normalized system of recursive
4486 equations, see section "definitions".
4488 * Configuration options are maintained within the theory or proof
4489 context (with name and type bool/int/string), providing a very simple
4490 interface to a poor-man's version of general context data. Tools may
4491 declare options in ML (e.g. using Attrib.config_int) and then refer to
4492 these values using Config.get etc. Users may change options via an
4493 associated attribute of the same name. This form of context
4494 declaration works particularly well with commands 'declare' or
4495 'using', for example ``declare [[foo = 42]]''. Thus it has become
4496 very easy to avoid global references, which would not observe Isar
4497 toplevel undo/redo and fail to work with multithreading.
4499 Various global ML references of Pure and HOL have been turned into
4500 configuration options:
4502 Unify.search_bound unify_search_bound
4503 Unify.trace_bound unify_trace_bound
4504 Unify.trace_simp unify_trace_simp
4505 Unify.trace_types unify_trace_types
4506 Simplifier.simp_depth_limit simp_depth_limit
4507 Blast.depth_limit blast_depth_limit
4508 DatatypeProp.dtK datatype_distinctness_limit
4509 fast_arith_neq_limit fast_arith_neq_limit
4510 fast_arith_split_limit fast_arith_split_limit
4512 * Named collections of theorems may be easily installed as context
4513 data using the functor NamedThmsFun (see also
4514 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
4515 attributes; there is also a toplevel print command. This facility is
4516 just a common case of general context data, which is the preferred way
4517 for anything more complex than just a list of facts in canonical
4520 * Isar: command 'declaration' augments a local theory by generic
4521 declaration functions written in ML. This enables arbitrary content
4522 being added to the context, depending on a morphism that tells the
4523 difference of the original declaration context wrt. the application
4524 context encountered later on.
4526 * Isar: proper interfaces for simplification procedures. Command
4527 'simproc_setup' declares named simprocs (with match patterns, and body
4528 text in ML). Attribute "simproc" adds/deletes simprocs in the current
4529 context. ML antiquotation @{simproc name} retrieves named simprocs.
4531 * Isar: an extra pair of brackets around attribute declarations
4532 abbreviates a theorem reference involving an internal dummy fact,
4533 which will be ignored later --- only the effect of the attribute on
4534 the background context will persist. This form of in-place
4535 declarations is particularly useful with commands like 'declare' and
4536 'using', for example ``have A using [[simproc a]] by simp''.
4538 * Isar: method "assumption" (and implicit closing of subproofs) now
4539 takes simple non-atomic goal assumptions into account: after applying
4540 an assumption as a rule the resulting subgoals are solved by atomic
4541 assumption steps. This is particularly useful to finish 'obtain'
4542 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
4543 without referring to the original premise "!!x. P x ==> thesis" in the
4544 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
4547 * Isar: implicit use of prems from the Isar proof context is
4548 considered a legacy feature. Common applications like ``have A .''
4549 may be replaced by ``have A by fact'' or ``note `A`''. In general,
4550 referencing facts explicitly here improves readability and
4551 maintainability of proof texts.
4553 * Isar: improper proof element 'guess' is like 'obtain', but derives
4554 the obtained context from the course of reasoning! For example:
4556 assume "EX x y. A x & B y" -- "any previous fact"
4557 then guess x and y by clarify
4559 This technique is potentially adventurous, depending on the facts and
4560 proof tools being involved here.
4562 * Isar: known facts from the proof context may be specified as literal
4563 propositions, using ASCII back-quote syntax. This works wherever
4564 named facts used to be allowed so far, in proof commands, proof
4565 methods, attributes etc. Literal facts are retrieved from the context
4566 according to unification of type and term parameters. For example,
4567 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
4568 theorems in the current context, then these are valid literal facts:
4569 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
4571 There is also a proof method "fact" which does the same composition
4572 for explicit goal states, e.g. the following proof texts coincide with
4573 certain special cases of literal facts:
4575 have "A" by fact == note `A`
4576 have "A ==> B" by fact == note `A ==> B`
4577 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
4578 have "P a ==> Q a" by fact == note `P a ==> Q a`
4580 * Isar: ":" (colon) is no longer a symbolic identifier character in
4581 outer syntax. Thus symbolic identifiers may be used without
4582 additional white space in declarations like this: ``assume *: A''.
4584 * Isar: 'print_facts' prints all local facts of the current context,
4585 both named and unnamed ones.
4587 * Isar: 'def' now admits simultaneous definitions, e.g.:
4589 def x == "t" and y == "u"
4591 * Isar: added command 'unfolding', which is structurally similar to
4592 'using', but affects both the goal state and facts by unfolding given
4593 rewrite rules. Thus many occurrences of the 'unfold' method or
4594 'unfolded' attribute may be replaced by first-class proof text.
4596 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
4597 and command 'unfolding' now all support object-level equalities
4598 (potentially conditional). The underlying notion of rewrite rule is
4599 analogous to the 'rule_format' attribute, but *not* that of the
4600 Simplifier (which is usually more generous).
4602 * Isar: the new attribute [rotated n] (default n = 1) rotates the
4603 premises of a theorem by n. Useful in conjunction with drule.
4605 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
4606 method expression within a sandbox consisting of the first N
4607 sub-goals, which need to exist. For example, ``simp_all [3]''
4608 simplifies the first three sub-goals, while (rule foo, simp_all)[]
4609 simplifies all new goals that emerge from applying rule foo to the
4610 originally first one.
4612 * Isar: schematic goals are no longer restricted to higher-order
4613 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
4616 * Isar: the conclusion of a long theorem statement is now either
4617 'shows' (a simultaneous conjunction, as before), or 'obtains'
4618 (essentially a disjunction of cases with local parameters and
4619 assumptions). The latter allows to express general elimination rules
4620 adequately; in this notation common elimination rules look like this:
4622 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
4624 obtains x where "P x"
4626 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
4630 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
4636 The subsequent classical rules even refer to the formal "thesis"
4639 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
4642 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
4643 obtains "thesis ==> something"
4645 The actual proof of an 'obtains' statement is analogous to that of the
4646 Isar proof element 'obtain', only that there may be several cases.
4647 Optional case names may be specified in parentheses; these will be
4648 available both in the present proof and as annotations in the
4649 resulting rule, for later use with the 'cases' method (cf. attribute
4652 * Isar: the assumptions of a long theorem statement are available as
4653 "assms" fact in the proof context. This is more appropriate than the
4654 (historical) "prems", which refers to all assumptions of the current
4655 context, including those from the target locale, proof body etc.
4657 * Isar: 'print_statement' prints theorems from the current theory or
4658 proof context in long statement form, according to the syntax of a
4661 * Isar: 'obtain' takes an optional case name for the local context
4662 introduction rule (default "that").
4664 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
4665 explicit (is "_ ==> ?foo") in the rare cases where this still happens
4668 * Pure: syntax "CONST name" produces a fully internalized constant
4669 according to the current context. This is particularly useful for
4670 syntax translations that should refer to internal constant
4671 representations independently of name spaces.
4673 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
4674 instead of "FOO ". This allows multiple binder declarations to coexist
4675 in the same context. INCOMPATIBILITY.
4677 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
4678 primitive that also works in a locale context (both for constants and
4679 fixed variables). Type declaration and internal syntactic representation
4680 of given constants retrieved from the context. Likewise, the
4681 'no_notation' command allows to remove given syntax annotations from the
4684 * Isar/locales: new derived specification elements 'axiomatization',
4685 'definition', 'abbreviation', which support type-inference, admit
4686 object-level specifications (equality, equivalence). See also the
4687 isar-ref manual. Examples:
4690 eq (infix "===" 50) where
4691 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
4693 definition "f x y = x + y + 1"
4694 definition g where "g x = f x x"
4697 neq (infix "=!=" 50) where
4698 "x =!= y == ~ (x === y)"
4700 These specifications may be also used in a locale context. Then the
4701 constants being introduced depend on certain fixed parameters, and the
4702 constant name is qualified by the locale base name. An internal
4703 abbreviation takes care for convenient input and output, making the
4704 parameters implicit and using the original short name. See also
4705 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
4706 entities from a monomorphic theory.
4708 Presently, abbreviations are only available 'in' a target locale, but
4709 not inherited by general import expressions. Also note that
4710 'abbreviation' may be used as a type-safe replacement for 'syntax' +
4711 'translations' in common applications. The "no_abbrevs" print mode
4712 prevents folding of abbreviations in term output.
4714 Concrete syntax is attached to specified constants in internal form,
4715 independently of name spaces. The parse tree representation is
4716 slightly different -- use 'notation' instead of raw 'syntax', and
4717 'translations' with explicit "CONST" markup to accommodate this.
4719 * Pure/Isar: unified syntax for new-style specification mechanisms
4720 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
4721 full type inference and dummy patterns ("_"). For example:
4723 definition "K x _ = x"
4725 inductive conj for A B
4726 where "A ==> B ==> conj A B"
4728 * Pure: command 'print_abbrevs' prints all constant abbreviations of
4729 the current context. Print mode "no_abbrevs" prevents inversion of
4730 abbreviations on output.
4732 * Isar/locales: improved parameter handling: use of locales "var" and
4733 "struct" no longer necessary; - parameter renamings are no longer
4734 required to be injective. For example, this allows to define
4735 endomorphisms as locale endom = homom mult mult h.
4737 * Isar/locales: changed the way locales with predicates are defined.
4738 Instead of accumulating the specification, the imported expression is
4739 now an interpretation. INCOMPATIBILITY: different normal form of
4740 locale expressions. In particular, in interpretations of locales with
4741 predicates, goals repesenting already interpreted fragments are not
4742 removed automatically. Use methods `intro_locales' and
4743 `unfold_locales'; see below.
4745 * Isar/locales: new methods `intro_locales' and `unfold_locales'
4746 provide backward reasoning on locales predicates. The methods are
4747 aware of interpretations and discharge corresponding goals.
4748 `intro_locales' is less aggressive then `unfold_locales' and does not
4749 unfold predicates to assumptions.
4751 * Isar/locales: the order in which locale fragments are accumulated
4752 has changed. This enables to override declarations from fragments due
4753 to interpretations -- for example, unwanted simp rules.
4755 * Isar/locales: interpretation in theories and proof contexts has been
4756 extended. One may now specify (and prove) equations, which are
4757 unfolded in interpreted theorems. This is useful for replacing
4758 defined concepts (constants depending on locale parameters) by
4759 concepts already existing in the target context. Example:
4761 interpretation partial_order ["op <= :: [int, int] => bool"]
4762 where "partial_order.less (op <=) (x::int) y = (x < y)"
4764 Typically, the constant `partial_order.less' is created by a
4765 definition specification element in the context of locale
4768 * Method "induct": improved internal context management to support
4769 local fixes and defines on-the-fly. Thus explicit meta-level
4770 connectives !! and ==> are rarely required anymore in inductive goals
4771 (using object-logic connectives for this purpose has been long
4772 obsolete anyway). Common proof patterns are explained in
4773 src/HOL/Induct/Common_Patterns.thy, see also
4774 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
4777 * Method "induct": improved handling of simultaneous goals. Instead of
4778 introducing object-level conjunction, the statement is now split into
4779 several conclusions, while the corresponding symbolic cases are nested
4780 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
4781 see src/HOL/Induct/Common_Patterns.thy, for example.
4783 * Method "induct": mutual induction rules are now specified as a list
4784 of rule sharing the same induction cases. HOL packages usually provide
4785 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
4786 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
4787 mutual induction rules differently, i.e. like this:
4789 (induct rule: foo_bar.inducts)
4790 (induct set: foo bar)
4791 (induct pred: foo bar)
4792 (induct type: foo bar)
4794 The ML function ProjectRule.projections turns old-style rules into the
4797 * Method "coinduct": dual of induction, see
4798 src/HOL/Library/Coinductive_List.thy for various examples.
4800 * Method "cases", "induct", "coinduct": the ``(open)'' option is
4801 considered a legacy feature.
4803 * Attribute "symmetric" produces result with standardized schematic
4804 variables (index 0). Potential INCOMPATIBILITY.
4806 * Simplifier: by default the simplifier trace only shows top level
4807 rewrites now. That is, trace_simp_depth_limit is set to 1 by
4808 default. Thus there is less danger of being flooded by the trace. The
4809 trace indicates where parts have been suppressed.
4811 * Provers/classical: removed obsolete classical version of elim_format
4812 attribute; classical elim/dest rules are now treated uniformly when
4813 manipulating the claset.
4815 * Provers/classical: stricter checks to ensure that supplied intro,
4816 dest and elim rules are well-formed; dest and elim rules must have at
4819 * Provers/classical: attributes dest/elim/intro take an optional
4820 weight argument for the rule (just as the Pure versions). Weights are
4821 ignored by automated tools, but determine the search order of single
4824 * Syntax: input syntax now supports dummy variable binding "%_. b",
4825 where the body does not mention the bound variable. Note that dummy
4826 patterns implicitly depend on their context of bounds, which makes
4827 "{_. _}" match any set comprehension as expected. Potential
4828 INCOMPATIBILITY -- parse translations need to cope with syntactic
4829 constant "_idtdummy" in the binding position.
4831 * Syntax: removed obsolete syntactic constant "_K" and its associated
4832 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
4833 for example "A -> B" => "Pi A (%_. B)".
4835 * Pure: 'class_deps' command visualizes the subclass relation, using
4836 the graph browser tool.
4838 * Pure: 'print_theory' now suppresses certain internal declarations by
4839 default; use '!' option for full details.
4844 * Method "metis" proves goals by applying the Metis general-purpose
4845 resolution prover (see also http://gilith.com/software/metis/).
4846 Examples are in the directory MetisExamples. WARNING: the
4847 Isabelle/HOL-Metis integration does not yet work properly with
4850 * Command 'sledgehammer' invokes external automatic theorem provers as
4851 background processes. It generates calls to the "metis" method if
4852 successful. These can be pasted into the proof. Users do not have to
4853 wait for the automatic provers to return. WARNING: does not really
4854 work with multi-threading.
4856 * New "auto_quickcheck" feature tests outermost goal statements for
4857 potential counter-examples. Controlled by ML references
4858 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
4859 5000 milliseconds). Fails silently if statements is outside of
4860 executable fragment, or any other codgenerator problem occurs.
4862 * New constant "undefined" with axiom "undefined x = undefined".
4864 * Added class "HOL.eq", allowing for code generation with polymorphic
4867 * Some renaming of class constants due to canonical name prefixing in
4868 the new 'class' package:
4870 HOL.abs ~> HOL.abs_class.abs
4871 HOL.divide ~> HOL.divide_class.divide
4872 0 ~> HOL.zero_class.zero
4873 1 ~> HOL.one_class.one
4874 op + ~> HOL.plus_class.plus
4875 op - ~> HOL.minus_class.minus
4876 uminus ~> HOL.minus_class.uminus
4877 op * ~> HOL.times_class.times
4878 op < ~> HOL.ord_class.less
4879 op <= > HOL.ord_class.less_eq
4880 Nat.power ~> Power.power_class.power
4881 Nat.size ~> Nat.size_class.size
4882 Numeral.number_of ~> Numeral.number_class.number_of
4883 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
4884 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
4885 Orderings.min ~> Orderings.ord_class.min
4886 Orderings.max ~> Orderings.ord_class.max
4887 Divides.op div ~> Divides.div_class.div
4888 Divides.op mod ~> Divides.div_class.mod
4889 Divides.op dvd ~> Divides.div_class.dvd
4891 INCOMPATIBILITY. Adaptions may be required in the following cases:
4893 a) User-defined constants using any of the names "plus", "minus",
4894 "times", "less" or "less_eq". The standard syntax translations for
4895 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
4898 b) Variables named "plus", "minus", "times", "less", "less_eq"
4899 INCOMPATIBILITY: use more specific names.
4901 c) Permutative equations (e.g. "a + b = b + a")
4902 Since the change of names also changes the order of terms, permutative
4903 rewrite rules may get applied in a different order. Experience shows
4904 that this is rarely the case (only two adaptions in the whole Isabelle
4905 distribution). INCOMPATIBILITY: rewrite proofs
4907 d) ML code directly refering to constant names
4908 This in general only affects hand-written proof tactics, simprocs and
4909 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
4910 Consider using @{const_name} antiquotation.
4912 * New class "default" with associated constant "default".
4914 * Function "sgn" is now overloaded and available on int, real, complex
4915 (and other numeric types), using class "sgn". Two possible defs of
4916 sgn are given as equational assumptions in the classes sgn_if and
4917 sgn_div_norm; ordered_idom now also inherits from sgn_if.
4920 * Locale "partial_order" now unified with class "order" (cf. theory
4921 Orderings), added parameter "less". INCOMPATIBILITY.
4923 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
4924 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
4925 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
4927 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
4928 changed order of proof goals in instance proofs.
4930 * The transitivity reasoner for partial and linear orders is set up
4931 for classes "order" and "linorder". Instances of the reasoner are available
4932 in all contexts importing or interpreting the corresponding locales.
4933 Method "order" invokes the reasoner separately; the reasoner
4934 is also integrated with the Simplifier as a solver. Diagnostic
4935 command 'print_orders' shows the available instances of the reasoner
4936 in the current context.
4938 * Localized monotonicity predicate in theory "Orderings"; integrated
4939 lemmas max_of_mono and min_of_mono with this predicate.
4942 * Formulation of theorem "dense" changed slightly due to integration
4943 with new class dense_linear_order.
4945 * Uniform lattice theory development in HOL.
4947 constants "meet" and "join" now named "inf" and "sup"
4948 constant "Meet" now named "Inf"
4950 classes "meet_semilorder" and "join_semilorder" now named
4951 "lower_semilattice" and "upper_semilattice"
4952 class "lorder" now named "lattice"
4953 class "comp_lat" now named "complete_lattice"
4955 Instantiation of lattice classes allows explicit definitions
4956 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
4958 INCOMPATIBILITY. Theorem renames:
4960 meet_left_le ~> inf_le1
4961 meet_right_le ~> inf_le2
4962 join_left_le ~> sup_ge1
4963 join_right_le ~> sup_ge2
4964 meet_join_le ~> inf_sup_ord
4967 le_meet ~> le_inf_iff
4968 le_join ~> ge_sup_conv
4969 meet_idempotent ~> inf_idem
4970 join_idempotent ~> sup_idem
4971 meet_comm ~> inf_commute
4972 join_comm ~> sup_commute
4973 meet_leI1 ~> le_infI1
4974 meet_leI2 ~> le_infI2
4975 le_joinI1 ~> le_supI1
4976 le_joinI2 ~> le_supI2
4977 meet_assoc ~> inf_assoc
4978 join_assoc ~> sup_assoc
4979 meet_left_comm ~> inf_left_commute
4980 meet_left_idempotent ~> inf_left_idem
4981 join_left_comm ~> sup_left_commute
4982 join_left_idempotent ~> sup_left_idem
4985 le_def_meet ~> le_iff_inf
4986 le_def_join ~> le_iff_sup
4987 join_absorp2 ~> sup_absorb2
4988 join_absorp1 ~> sup_absorb1
4989 meet_absorp1 ~> inf_absorb1
4990 meet_absorp2 ~> inf_absorb2
4991 meet_join_absorp ~> inf_sup_absorb
4992 join_meet_absorp ~> sup_inf_absorb
4993 distrib_join_le ~> distrib_sup_le
4994 distrib_meet_le ~> distrib_inf_le
4996 add_meet_distrib_left ~> add_inf_distrib_left
4997 add_join_distrib_left ~> add_sup_distrib_left
4998 is_join_neg_meet ~> is_join_neg_inf
4999 is_meet_neg_join ~> is_meet_neg_sup
5000 add_meet_distrib_right ~> add_inf_distrib_right
5001 add_join_distrib_right ~> add_sup_distrib_right
5002 add_meet_join_distribs ~> add_sup_inf_distribs
5003 join_eq_neg_meet ~> sup_eq_neg_inf
5004 meet_eq_neg_join ~> inf_eq_neg_sup
5005 add_eq_meet_join ~> add_eq_inf_sup
5006 meet_0_imp_0 ~> inf_0_imp_0
5007 join_0_imp_0 ~> sup_0_imp_0
5008 meet_0_eq_0 ~> inf_0_eq_0
5009 join_0_eq_0 ~> sup_0_eq_0
5010 neg_meet_eq_join ~> neg_inf_eq_sup
5011 neg_join_eq_meet ~> neg_sup_eq_inf
5012 join_eq_if ~> sup_eq_if
5014 mono_meet ~> mono_inf
5015 mono_join ~> mono_sup
5016 meet_bool_eq ~> inf_bool_eq
5017 join_bool_eq ~> sup_bool_eq
5018 meet_fun_eq ~> inf_fun_eq
5019 join_fun_eq ~> sup_fun_eq
5020 meet_set_eq ~> inf_set_eq
5021 join_set_eq ~> sup_set_eq
5022 meet1_iff ~> inf1_iff
5023 meet2_iff ~> inf2_iff
5032 join1_iff ~> sup1_iff
5033 join2_iff ~> sup2_iff
5043 is_meet_Meet ~> is_meet_Inf
5044 Meet_bool_def ~> Inf_bool_def
5045 Meet_fun_def ~> Inf_fun_def
5046 Meet_greatest ~> Inf_greatest
5047 Meet_lower ~> Inf_lower
5048 Meet_set_def ~> Inf_set_def
5051 Sup_bool_eq ~> Sup_bool_def
5052 Sup_fun_eq ~> Sup_fun_def
5053 Sup_set_eq ~> Sup_set_def
5055 listsp_meetI ~> listsp_infI
5056 listsp_meet_eq ~> listsp_inf_eq
5061 * Added syntactic class "size"; overloaded constant "size" now has
5062 type "'a::size ==> bool"
5064 * Internal reorganisation of `size' of datatypes: size theorems
5065 "foo.size" are no longer subsumed by "foo.simps" (but are still
5066 simplification rules by default!); theorems "prod.size" now named
5069 * Class "div" now inherits from class "times" rather than "type".
5072 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
5073 Linorder etc. have disappeared; operations defined in terms of
5074 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
5076 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
5078 * HOL-Word: New extensive library and type for generic, fixed size
5079 machine words, with arithmetic, bit-wise, shifting and rotating
5080 operations, reflection into int, nat, and bool lists, automation for
5081 linear arithmetic (by automatic reflection into nat or int), including
5082 lemmas on overflow and monotonicity. Instantiated to all appropriate
5083 arithmetic type classes, supporting automatic simplification of
5084 numerals on all operations.
5086 * Library/Boolean_Algebra: locales for abstract boolean algebras.
5088 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
5090 * Code generator library theories:
5091 - Code_Integer represents HOL integers by big integer literals in target
5093 - Code_Char represents HOL characters by character literals in target
5095 - Code_Char_chr like Code_Char, but also offers treatment of character
5096 codes; includes Code_Integer.
5097 - Executable_Set allows to generate code for finite sets using lists.
5098 - Executable_Rat implements rational numbers as triples (sign, enumerator,
5100 - Executable_Real implements a subset of real numbers, namly those
5101 representable by rational numbers.
5102 - Efficient_Nat implements natural numbers by integers, which in general will
5103 result in higher efficency; pattern matching with 0/Suc is eliminated;
5104 includes Code_Integer.
5105 - Code_Index provides an additional datatype index which is mapped to
5106 target-language built-in integers.
5107 - Code_Message provides an additional datatype message_string which is isomorphic to
5108 strings; messages are mapped to target-language strings.
5110 * New package for inductive predicates
5112 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
5115 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5116 for z_1 :: U_1 and ... and z_n :: U_m
5118 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5121 with full support for type-inference, rather than
5123 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5125 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5126 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5128 inductive "s z_1 ... z_m"
5130 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5133 For backward compatibility, there is a wrapper allowing inductive
5134 sets to be defined with the new package via
5137 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5138 for z_1 :: U_1 and ... and z_n :: U_m
5140 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5146 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5147 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5148 for z_1 :: U_1 and ... and z_n :: U_m
5150 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5151 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5154 if the additional syntax "p ..." is required.
5156 Numerous examples can be found in the subdirectories src/HOL/Auth,
5157 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
5161 - Since declaration and definition of inductive sets or predicates
5162 is no longer separated, abbreviations involving the newly
5163 introduced sets or predicates must be specified together with the
5164 introduction rules after the 'where' keyword (see above), rather
5165 than before the actual inductive definition.
5167 - The variables in induction and elimination rules are now
5168 quantified in the order of their occurrence in the introduction
5169 rules, rather than in alphabetical order. Since this may break
5170 some proofs, these proofs either have to be repaired, e.g. by
5171 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
5172 statements of the form
5174 case (rule_i a_i_1 ... a_i_{k_i})
5176 or the old order of quantification has to be restored by explicitly adding
5177 meta-level quantifiers in the introduction rules, i.e.
5179 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
5181 - The format of the elimination rules is now
5183 p z_1 ... z_m x_1 ... x_n ==>
5184 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5189 (x_1, ..., x_n) : s z_1 ... z_m ==>
5190 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5193 for sets rather than
5195 x : s z_1 ... z_m ==>
5196 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
5199 This may require terms in goals to be expanded to n-tuples
5200 (e.g. using case_tac or simplification with the split_paired_all
5201 rule) before the above elimination rule is applicable.
5203 - The elimination or case analysis rules for (mutually) inductive
5204 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
5205 list of rules "p_1_..._p_k.elims" is no longer available.
5207 * New package "function"/"fun" for general recursive functions,
5208 supporting mutual and nested recursion, definitions in local contexts,
5209 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
5210 for small examples, and the separate tutorial on the function
5211 package. The old recdef "package" is still available as before, but
5212 users are encouraged to use the new package.
5214 * Method "lexicographic_order" automatically synthesizes termination
5215 relations as lexicographic combinations of size measures.
5217 * Case-expressions allow arbitrary constructor-patterns (including
5218 "_") and take their order into account, like in functional
5219 programming. Internally, this is translated into nested
5220 case-expressions; missing cases are added and mapped to the predefined
5221 constant "undefined". In complicated cases printing may no longer show
5222 the original input but the internal form. Lambda-abstractions allow
5223 the same form of pattern matching: "% pat1 => e1 | ..." is an
5224 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
5227 * IntDef: The constant "int :: nat => int" has been removed; now "int"
5228 is an abbreviation for "of_nat :: nat => int". The simplification
5229 rules for "of_nat" have been changed to work like "int" did
5230 previously. Potential INCOMPATIBILITY:
5231 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
5232 - of_nat_diff and of_nat_mult are no longer default simp rules
5234 * Method "algebra" solves polynomial equations over (semi)rings using
5235 Groebner bases. The (semi)ring structure is defined by locales and the
5236 tool setup depends on that generic context. Installing the method for
5237 a specific type involves instantiating the locale and possibly adding
5238 declarations for computation on the coefficients. The method is
5239 already instantiated for natural numbers and for the axiomatic class
5240 of idoms with numerals. See also the paper by Chaieb and Wenzel at
5241 CALCULEMUS 2007 for the general principles underlying this
5242 architecture of context-aware proof-tools.
5244 * Method "ferrack" implements quantifier elimination over
5245 special-purpose dense linear orders using locales (analogous to
5246 "algebra"). The method is already installed for class
5247 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
5250 * Former constant "List.op @" now named "List.append". Use ML
5251 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
5252 circumvent possible incompatibilities when working on ML level.
5254 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
5256 * New function listsum :: 'a list => 'a for arbitrary monoids.
5257 Special syntax: "SUM x <- xs. f x" (and latex variants)
5259 * New syntax for Haskell-like list comprehension (input only), eg.
5260 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
5262 * The special syntax for function "filter" has changed from [x :
5263 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
5264 comprehension syntax, and for uniformity. INCOMPATIBILITY.
5266 * [a..b] is now defined for arbitrary linear orders. It used to be
5267 defined on nat only, as an abbreviation for [a..<Suc b]
5270 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
5272 * New functions "sorted" and "sort" in src/HOL/List.thy.
5274 * New lemma collection field_simps (an extension of ring_simps) for
5275 manipulating (in)equations involving division. Multiplies with all
5276 denominators that can be proved to be non-zero (in equations) or
5277 positive/negative (in inequations).
5279 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
5280 have been improved and renamed to ring_simps, group_simps and
5281 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
5282 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
5284 * Theory Library/Commutative_Ring: switched from recdef to function
5285 package; constants add, mul, pow now curried. Infix syntax for
5286 algebraic operations.
5288 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
5291 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
5294 * HOL/records: generalised field-update to take a function on the
5295 field rather than the new value: r(|A := x|) is translated to A_update
5296 (K x) r The K-combinator that is internally used is called K_record.
5297 INCOMPATIBILITY: Usage of the plain update functions has to be
5300 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
5301 * x = 0, which are required for a semiring. Richer structures do not
5302 inherit from semiring_0 anymore, because this property is a theorem
5303 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
5304 there is more to prove, but this is mostly trivial.
5306 * Class "recpower" is generalized to arbitrary monoids, not just
5307 commutative semirings. INCOMPATIBILITY: may need to incorporate
5308 commutativity or semiring properties additionally.
5310 * Constant "List.list_all2" in List.thy now uses authentic syntax.
5311 INCOMPATIBILITY: translations containing list_all2 may go wrong,
5312 better use 'abbreviation'.
5314 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
5316 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
5317 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
5318 significant changes for setting up numeral syntax for types:
5319 - New constants Numeral.pred and Numeral.succ instead
5320 of former Numeral.bin_pred and Numeral.bin_succ.
5321 - Use integer operations instead of bin_add, bin_mult and so on.
5322 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
5323 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
5325 See src/HOL/Integ/IntArith.thy for an example setup.
5327 * Command 'normal_form' computes the normal form of a term that may
5328 contain free variables. For example ``normal_form "rev [a, b, c]"''
5329 produces ``[b, c, a]'' (without proof). This command is suitable for
5330 heavy-duty computations because the functions are compiled to ML
5331 first. Correspondingly, a method "normalization" is provided. See
5332 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
5334 * Alternative iff syntax "A <-> B" for equality on bool (with priority
5335 25 like -->); output depends on the "iff" print_mode, the default is
5336 "A = B" (with priority 50).
5338 * Relations less (<) and less_eq (<=) are also available on type bool.
5339 Modified syntax to disallow nesting without explicit parentheses,
5340 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
5343 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
5345 * Relation composition operator "op O" now has precedence 75 and binds
5346 stronger than union and intersection. INCOMPATIBILITY.
5348 * The old set interval syntax "{m..n(}" (and relatives) has been
5349 removed. Use "{m..<n}" (and relatives) instead.
5351 * In the context of the assumption "~(s = t)" the Simplifier rewrites
5352 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
5353 ``declare [[simproc del: neq]]''.
5355 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
5358 * Theorem Cons_eq_map_conv no longer declared as "simp".
5360 * Theorem setsum_mult renamed to setsum_right_distrib.
5362 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
5365 * Reimplemented methods "sat" and "satx", with several improvements:
5366 goals no longer need to be stated as "<prems> ==> False", equivalences
5367 (i.e. "=" on type bool) are handled, variable names of the form
5368 "lit_<n>" are no longer reserved, significant speedup.
5370 * Methods "sat" and "satx" can now replay MiniSat proof traces.
5371 zChaff is still supported as well.
5373 * 'inductive' and 'datatype': provide projections of mutual rules,
5374 bundled as foo_bar.inducts;
5376 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
5379 * Library: moved theory Accessible_Part to main HOL.
5381 * Library: added theory Coinductive_List of potentially infinite lists
5382 as greatest fixed-point.
5384 * Library: added theory AssocList which implements (finite) maps as
5387 * Method "evaluation" solves goals (i.e. a boolean expression)
5388 efficiently by compiling it to ML. The goal is "proved" (via an
5389 oracle) if it evaluates to True.
5391 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
5392 also when invoked by the simplifier. This results in the Simplifier
5393 being more powerful on arithmetic goals. INCOMPATIBILITY.
5394 Configuration option fast_arith_split_limit=0 recovers the old
5397 * Support for hex (0x20) and binary (0b1001) numerals.
5399 * New method: reify eqs (t), where eqs are equations for an
5400 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
5401 parameter, computes a term s::'b and a list xs::'a list and proves the
5402 theorem I xs s = t. This is also known as reification or quoting. The
5403 resulting theorem is applied to the subgoal to substitute t with I xs
5404 s. If t is omitted, the subgoal itself is reified.
5406 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
5407 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
5408 where f is supposed to be a computable function (in the sense of code
5409 generattion). The method uses reify to compute s and xs as above then
5410 applies corr_thm and uses normalization by evaluation to "prove" f s =
5411 r and finally gets the theorem t = r, which is again applied to the
5412 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
5414 * Reflection: Automatic reification now handels binding, an example is
5415 available in src/HOL/ex/ReflectionEx.thy
5417 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
5418 command 'statespace' that is similar to 'record', but introduces an
5419 abstract specification based on the locale infrastructure instead of
5420 HOL types. This leads to extra flexibility in composing state spaces,
5421 in particular multiple inheritance and renaming of components.
5426 * Hyperreal: Functions root and sqrt are now defined on negative real
5427 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
5428 Nonnegativity side conditions have been removed from many lemmas, so
5429 that more subgoals may now be solved by simplification; potential
5432 * Real: new type classes formalize real normed vector spaces and
5433 algebras, using new overloaded constants scaleR :: real => 'a => 'a
5434 and norm :: 'a => real.
5436 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
5437 reals into other types. The overloaded constant Reals :: 'a set is now
5438 defined as range of_real; potential INCOMPATIBILITY.
5440 * Real: proper support for ML code generation, including 'quickcheck'.
5441 Reals are implemented as arbitrary precision rationals.
5443 * Hyperreal: Several constants that previously worked only for the
5444 reals have been generalized, so they now work over arbitrary vector
5445 spaces. Type annotations may need to be added in some cases; potential
5448 Infinitesimal :: ('a::real_normed_vector) star set
5449 HFinite :: ('a::real_normed_vector) star set
5450 HInfinite :: ('a::real_normed_vector) star set
5451 approx :: ('a::real_normed_vector) star => 'a star => bool
5452 monad :: ('a::real_normed_vector) star => 'a star set
5453 galaxy :: ('a::real_normed_vector) star => 'a star set
5454 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
5455 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
5456 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
5457 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
5458 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
5459 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
5460 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
5461 sgn :: 'a::real_normed_vector => 'a
5462 exp :: 'a::{recpower,real_normed_field,banach} => 'a
5464 * Complex: Some complex-specific constants are now abbreviations for
5465 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
5466 hnorm. Other constants have been entirely removed in favor of the
5467 polymorphic versions (INCOMPATIBILITY):
5471 HInfinite <-- CInfinite
5472 Infinitesimal <-- CInfinitesimal
5475 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
5476 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
5477 (ns)deriv <-- (ns)cderiv
5482 * Formalisation of ideals and the quotient construction over rings.
5484 * Order and lattice theory no longer based on records.
5487 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
5488 greatest_closed. INCOMPATIBILITY.
5490 * Method algebra is now set up via an attribute. For examples see
5491 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
5492 of algebraic structures.
5494 * Renamed theory CRing to Ring.
5499 * Substantial, yet incomplete support for nominal datatypes (binding
5500 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
5501 src/HOL/Nominal/Examples. Prospective users should consult
5502 http://isabelle.in.tum.de/nominal/
5507 * ML basics: just one true type int, which coincides with IntInf.int
5510 * ML within Isar: antiquotations allow to embed statically-checked
5511 formal entities in the source, referring to the context available at
5512 compile-time. For example:
5514 ML {* @{sort "{zero,one}"} *}
5515 ML {* @{typ "'a => 'b"} *}
5516 ML {* @{term "%x. x"} *}
5517 ML {* @{prop "x == y"} *}
5518 ML {* @{ctyp "'a => 'b"} *}
5519 ML {* @{cterm "%x. x"} *}
5520 ML {* @{cprop "x == y"} *}
5521 ML {* @{thm asm_rl} *}
5522 ML {* @{thms asm_rl} *}
5523 ML {* @{type_name c} *}
5524 ML {* @{type_syntax c} *}
5525 ML {* @{const_name c} *}
5526 ML {* @{const_syntax c} *}
5529 ML {* @{theory Pure} *}
5530 ML {* @{theory_ref} *}
5531 ML {* @{theory_ref Pure} *}
5534 ML {* @{clasimpset} *}
5536 The same works for sources being ``used'' within an Isar context.
5538 * ML in Isar: improved error reporting; extra verbosity with
5539 ML_Context.trace enabled.
5541 * Pure/General/table.ML: the join operations now works via exceptions
5542 DUP/SAME instead of type option. This is simpler in simple cases, and
5543 admits slightly more efficient complex applications.
5545 * Pure: 'advanced' translation functions (parse_translation etc.) now
5546 use Context.generic instead of just theory.
5548 * Pure: datatype Context.generic joins theory/Proof.context and
5549 provides some facilities for code that works in either kind of
5550 context, notably GenericDataFun for uniform theory and proof data.
5552 * Pure: simplified internal attribute type, which is now always
5553 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
5554 local (Proof.context) attributes have been discontinued, while
5555 minimizing code duplication. Thm.rule_attribute and
5556 Thm.declaration_attribute build canonical attributes; see also structure
5557 Context for further operations on Context.generic, notably
5558 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
5559 declarations and definitions.
5561 * Context data interfaces (Theory/Proof/GenericDataFun): removed
5562 name/print, uninitialized data defaults to ad-hoc copy of empty value,
5563 init only required for impure data. INCOMPATIBILITY: empty really need
5564 to be empty (no dependencies on theory content!)
5566 * Pure/kernel: consts certification ignores sort constraints given in
5567 signature declarations. (This information is not relevant to the
5568 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
5569 potential INCOMPATIBILITY.
5571 * Pure: axiomatic type classes are now purely definitional, with
5572 explicit proofs of class axioms and super class relations performed
5573 internally. See Pure/axclass.ML for the main internal interfaces --
5574 notably AxClass.define_class supercedes AxClass.add_axclass, and
5575 AxClass.axiomatize_class/classrel/arity supersede
5576 Sign.add_classes/classrel/arities.
5578 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
5579 global/local versions on theory vs. Proof.context have been
5580 discontinued; Attrib.syntax and Method.syntax have been adapted
5581 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
5582 attributes, methods, etc.
5584 * Pure: several functions of signature "... -> theory -> theory * ..."
5585 have been reoriented to "... -> theory -> ... * theory" in order to
5586 allow natural usage in combination with the ||>, ||>>, |-> and
5587 fold_map combinators.
5589 * Pure: official theorem names (closed derivations) and additional
5590 comments (tags) are now strictly separate. Name hints -- which are
5591 maintained as tags -- may be attached any time without affecting the
5594 * Pure: primitive rule lift_rule now takes goal cterm instead of an
5595 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
5596 achieve the old behaviour.
5598 * Pure: the "Goal" constant is now called "prop", supporting a
5599 slightly more general idea of ``protecting'' meta-level rule
5602 * Pure: Logic.(un)varify only works in a global context, which is now
5603 enforced instead of silently assumed. INCOMPATIBILITY, may use
5604 Logic.legacy_(un)varify as temporary workaround.
5606 * Pure: structure Name provides scalable operations for generating
5607 internal variable names, notably Name.variants etc. This replaces
5608 some popular functions from term.ML:
5610 Term.variant -> Name.variant
5611 Term.variantlist -> Name.variant_list
5612 Term.invent_names -> Name.invent_list
5614 Note that low-level renaming rarely occurs in new code -- operations
5615 from structure Variable are used instead (see below).
5617 * Pure: structure Variable provides fundamental operations for proper
5618 treatment of fixed/schematic variables in a context. For example,
5619 Variable.import introduces fixes for schematics of given facts and
5620 Variable.export reverses the effect (up to renaming) -- this replaces
5621 various freeze_thaw operations.
5623 * Pure: structure Goal provides simple interfaces for
5624 init/conclude/finish and tactical prove operations (replacing former
5625 Tactic.prove). Goal.prove is the canonical way to prove results
5626 within a given context; Goal.prove_global is a degraded version for
5627 theory level goals, including a global Drule.standard. Note that
5628 OldGoals.prove_goalw_cterm has long been obsolete, since it is
5629 ill-behaved in a local proof context (e.g. with local fixes/assumes or
5630 in a locale context).
5632 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
5633 and type checking (Syntax.check_term etc.), with common combinations
5634 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
5635 which are considered legacy and await removal.
5637 * Pure/Syntax: generic interfaces for type unchecking
5638 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
5639 with common combinations (Syntax.pretty_term, Syntax.string_of_term
5640 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
5641 available for convenience, but refer to the very same operations using
5642 a mere theory instead of a full context.
5644 * Isar: simplified treatment of user-level errors, using exception
5645 ERROR of string uniformly. Function error now merely raises ERROR,
5646 without any side effect on output channels. The Isar toplevel takes
5647 care of proper display of ERROR exceptions. ML code may use plain
5648 handle/can/try; cat_error may be used to concatenate errors like this:
5650 ... handle ERROR msg => cat_error msg "..."
5652 Toplevel ML code (run directly or through the Isar toplevel) may be
5653 embedded into the Isar toplevel with exception display/debug like
5656 Isar.toplevel (fn () => ...)
5658 INCOMPATIBILITY, removed special transform_error facilities, removed
5659 obsolete variants of user-level exceptions (ERROR_MESSAGE,
5660 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
5661 -- use plain ERROR instead.
5663 * Isar: theory setup now has type (theory -> theory), instead of a
5664 list. INCOMPATIBILITY, may use #> to compose setup functions.
5666 * Isar: ML toplevel pretty printer for type Proof.context, subject to
5667 ProofContext.debug/verbose flags.
5669 * Isar: Toplevel.theory_to_proof admits transactions that modify the
5670 theory before entering a proof state. Transactions now always see a
5671 quasi-functional intermediate checkpoint, both in interactive and
5674 * Isar: simplified interfaces for outer syntax. Renamed
5675 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
5676 OuterSyntax.add_parsers -- this functionality is now included in
5677 OuterSyntax.command etc. INCOMPATIBILITY.
5679 * Simplifier: the simpset of a running simplification process now
5680 contains a proof context (cf. Simplifier.the_context), which is the
5681 very context that the initial simpset has been retrieved from (by
5682 simpset_of/local_simpset_of). Consequently, all plug-in components
5683 (solver, looper etc.) may depend on arbitrary proof data.
5685 * Simplifier.inherit_context inherits the proof context (plus the
5686 local bounds) of the current simplification process; any simproc
5687 etc. that calls the Simplifier recursively should do this! Removed
5688 former Simplifier.inherit_bounds, which is already included here --
5689 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
5690 specify an explicit context using Simplifier.context/theory_context.
5692 * Simplifier/Classical Reasoner: more abstract interfaces
5693 change_simpset/claset for modifying the simpset/claset reference of a
5694 theory; raw versions simpset/claset_ref etc. have been discontinued --
5697 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
5703 * settings: the default heap location within ISABELLE_HOME_USER now
5704 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
5705 Isabelle installations.
5707 * isabelle-process: option -S (secure mode) disables some critical
5708 operations, notably runtime compilation and evaluation of ML source
5711 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
5713 * Support for parallel execution, using native multicore support of
5714 Poly/ML 5.1. The theory loader exploits parallelism when processing
5715 independent theories, according to the given theory header
5716 specifications. The maximum number of worker threads is specified via
5717 usedir option -M or the "max-threads" setting in Proof General. A
5718 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
5719 to 6 on a 8-core machine. User-code needs to observe certain
5720 guidelines for thread-safe programming, see appendix A in the Isar
5721 Implementation manual.
5725 New in Isabelle2005 (October 2005)
5726 ----------------------------------
5730 * Theory headers: the new header syntax for Isar theories is
5733 imports <theory1> ... <theoryN>
5734 uses <file1> ... <fileM>
5737 where the 'uses' part is optional. The previous syntax
5739 theory <name> = <theory1> + ... + <theoryN>:
5741 will disappear in the next release. Use isatool fixheaders to convert
5742 existing theory files. Note that there is no change in ancient
5743 non-Isar theories now, but these will disappear soon.
5745 * Theory loader: parent theories can now also be referred to via
5746 relative and absolute paths.
5748 * Command 'find_theorems' searches for a list of criteria instead of a
5749 list of constants. Known criteria are: intro, elim, dest, name:string,
5750 simp:term, and any term. Criteria can be preceded by '-' to select
5751 theorems that do not match. Intro, elim, dest select theorems that
5752 match the current goal, name:s selects theorems whose fully qualified
5753 name contain s, and simp:term selects all simplification rules whose
5754 lhs match term. Any other term is interpreted as pattern and selects
5755 all theorems matching the pattern. Available in ProofGeneral under
5756 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
5758 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
5760 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
5761 matching the current goal as introduction rule and not having "HOL."
5762 in their name (i.e. not being defined in theory HOL).
5764 * Command 'thms_containing' has been discontinued in favour of
5765 'find_theorems'; INCOMPATIBILITY.
5767 * Communication with Proof General is now 8bit clean, which means that
5768 Unicode text in UTF-8 encoding may be used within theory texts (both
5769 formal and informal parts). Cf. option -U of the Isabelle Proof
5770 General interface. Here are some simple examples (cf. src/HOL/ex):
5772 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
5773 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
5775 * Improved efficiency of the Simplifier and, to a lesser degree, the
5776 Classical Reasoner. Typical big applications run around 2 times
5780 *** Document preparation ***
5782 * Commands 'display_drafts' and 'print_drafts' perform simple output
5783 of raw sources. Only those symbols that do not require additional
5784 LaTeX packages (depending on comments in isabellesym.sty) are
5785 displayed properly, everything else is left verbatim. isatool display
5786 and isatool print are used as front ends (these are subject to the
5787 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
5789 * Command tags control specific markup of certain regions of text,
5790 notably folding and hiding. Predefined tags include "theory" (for
5791 theory begin and end), "proof" for proof commands, and "ML" for
5792 commands involving ML code; the additional tags "visible" and
5793 "invisible" are unused by default. Users may give explicit tag
5794 specifications in the text, e.g. ''by %invisible (auto)''. The
5795 interpretation of tags is determined by the LaTeX job during document
5796 preparation: see option -V of isatool usedir, or options -n and -t of
5797 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
5800 Several document versions may be produced at the same time via isatool
5801 usedir (the generated index.html will link all of them). Typical
5802 specifications include ''-V document=theory,proof,ML'' to present
5803 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
5804 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
5805 these parts without any formal replacement text. The Isabelle site
5806 default settings produce ''document'' and ''outline'' versions as
5809 * Several new antiquotations:
5811 @{term_type term} prints a term with its type annotated;
5813 @{typeof term} prints the type of a term;
5815 @{const const} is the same as @{term const}, but checks that the
5816 argument is a known logical constant;
5818 @{term_style style term} and @{thm_style style thm} print a term or
5819 theorem applying a "style" to it
5823 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
5824 definitions, equations, inequations etc., 'concl' printing only the
5825 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
5826 to print the specified premise. TermStyle.add_style provides an ML
5827 interface for introducing further styles. See also the "LaTeX Sugar"
5828 document practical applications. The ML antiquotation prints
5829 type-checked ML expressions verbatim.
5831 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
5832 and 'text' support optional locale specification '(in loc)', which
5833 specifies the default context for interpreting antiquotations. For
5834 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
5836 * Option 'locale=NAME' of antiquotations specifies an alternative
5837 context interpreting the subsequent argument. For example: @{thm
5838 [locale=lattice] inf_assoc}.
5840 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
5843 * Proper output of antiquotations for theory commands involving a
5844 proof context (such as 'locale' or 'theorem (in loc) ...').
5846 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
5847 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
5849 * isatool usedir: new option -C (default true) controls whether option
5850 -D should include a copy of the original document directory; -C false
5851 prevents unwanted effects such as copying of administrative CVS data.
5856 * Considerably improved version of 'constdefs' command. Now performs
5857 automatic type-inference of declared constants; additional support for
5858 local structure declarations (cf. locales and HOL records), see also
5859 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
5860 sequential dependencies of definitions within a single 'constdefs'
5861 section; moreover, the declared name needs to be an identifier. If
5862 all fails, consider to fall back on 'consts' and 'defs' separately.
5864 * Improved indexed syntax and implicit structures. First of all,
5865 indexed syntax provides a notational device for subscripted
5866 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
5867 expressions. Secondly, in a local context with structure
5868 declarations, number indexes \<^sub>n or the empty index (default
5869 number 1) refer to a certain fixed variable implicitly; option
5870 show_structs controls printing of implicit structures. Typical
5871 applications of these concepts involve record types and locales.
5873 * New command 'no_syntax' removes grammar declarations (and
5874 translations) resulting from the given syntax specification, which is
5875 interpreted in the same manner as for the 'syntax' command.
5877 * 'Advanced' translation functions (parse_translation etc.) may depend
5878 on the signature of the theory context being presently used for
5879 parsing/printing, see also isar-ref manual.
5881 * Improved 'oracle' command provides a type-safe interface to turn an
5882 ML expression of type theory -> T -> term into a primitive rule of
5883 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
5884 is already included here); see also FOL/ex/IffExample.thy;
5887 * axclass: name space prefix for class "c" is now "c_class" (was "c"
5888 before); "cI" is no longer bound, use "c.intro" instead.
5889 INCOMPATIBILITY. This change avoids clashes of fact bindings for
5890 axclasses vs. locales.
5892 * Improved internal renaming of symbolic identifiers -- attach primes
5893 instead of base 26 numbers.
5895 * New flag show_question_marks controls printing of leading question
5896 marks in schematic variable names.
5898 * In schematic variable names, *any* symbol following \<^isub> or
5899 \<^isup> is now treated as part of the base name. For example, the
5900 following works without printing of awkward ".0" indexes:
5902 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
5905 * Inner syntax includes (*(*nested*) comments*).
5907 * Pretty printer now supports unbreakable blocks, specified in mixfix
5908 annotations as "(00...)".
5910 * Clear separation of logical types and nonterminals, where the latter
5911 may only occur in 'syntax' specifications or type abbreviations.
5912 Before that distinction was only partially implemented via type class
5913 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
5914 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
5915 exotic syntax specifications may require further adaption
5916 (e.g. Cube/Cube.thy).
5918 * Removed obsolete type class "logic", use the top sort {} instead.
5919 Note that non-logical types should be declared as 'nonterminals'
5920 rather than 'types'. INCOMPATIBILITY for new object-logic
5923 * Attributes 'induct' and 'cases': type or set names may now be
5924 locally fixed variables as well.
5926 * Simplifier: can now control the depth to which conditional rewriting
5927 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
5930 * Simplifier: simplification procedures may now take the current
5931 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
5932 interface), which is very useful for calling the Simplifier
5933 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
5934 is gone -- use prems_of_ss on the simpset instead. Moreover, the
5935 low-level mk_simproc no longer applies Logic.varify internally, to
5936 allow for use in a context of fixed variables.
5938 * thin_tac now works even if the assumption being deleted contains !!
5939 or ==>. More generally, erule now works even if the major premise of
5940 the elimination rule contains !! or ==>.
5942 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
5944 * Reorganized bootstrapping of the Pure theories; CPure is now derived
5945 from Pure, which contains all common declarations already. Both
5946 theories are defined via plain Isabelle/Isar .thy files.
5947 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
5948 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
5949 use isatool fixcpure to adapt your theory and ML sources.
5951 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
5952 selections of theorems in named facts via index ranges.
5954 * 'print_theorems': in theory mode, really print the difference
5955 wrt. the last state (works for interactive theory development only),
5956 in proof mode print all local facts (cf. 'print_facts');
5958 * 'hide': option '(open)' hides only base names.
5960 * More efficient treatment of intermediate checkpoints in interactive
5963 * Code generator is now invoked via code_module (incremental code
5964 generation) and code_library (modular code generation, ML structures
5965 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
5966 must be quoted when used as identifiers.
5968 * New 'value' command for reading, evaluating and printing terms using
5969 the code generator. INCOMPATIBILITY: command keyword 'value' must be
5970 quoted when used as identifier.
5975 * New commands for the interpretation of locale expressions in
5976 theories (1), locales (2) and proof contexts (3). These generate
5977 proof obligations from the expression specification. After the
5978 obligations have been discharged, theorems of the expression are added
5979 to the theory, target locale or proof context. The synopsis of the
5980 commands is a follows:
5982 (1) interpretation expr inst
5983 (2) interpretation target < expr
5984 (3) interpret expr inst
5986 Interpretation in theories and proof contexts require a parameter
5987 instantiation of terms from the current context. This is applied to
5988 specifications and theorems of the interpreted expression.
5989 Interpretation in locales only permits parameter renaming through the
5990 locale expression. Interpretation is smart in that interpretations
5991 that are active already do not occur in proof obligations, neither are
5992 instantiated theorems stored in duplicate. Use 'print_interps' to
5993 inspect active interpretations of a particular locale. For details,
5994 see the Isar Reference manual. Examples can be found in
5995 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
5997 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
5998 'interpret' instead.
6000 * New context element 'constrains' for adding type constraints to
6003 * Context expressions: renaming of parameters with syntax
6006 * Locale declaration: 'includes' disallowed.
6008 * Proper static binding of attribute syntax -- i.e. types / terms /
6009 facts mentioned as arguments are always those of the locale definition
6010 context, independently of the context of later invocations. Moreover,
6011 locale operations (renaming and type / term instantiation) are applied
6012 to attribute arguments as expected.
6014 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
6015 actual attributes; rare situations may require Attrib.attribute to
6016 embed those attributes into Attrib.src that lack concrete syntax.
6017 Attribute implementations need to cooperate properly with the static
6018 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
6019 Attrib.XXX_thm etc. already do the right thing without further
6020 intervention. Only unusual applications -- such as "where" or "of"
6021 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
6022 on the context and the facts involved -- may have to assign parsed
6023 values to argument tokens explicitly.
6025 * Changed parameter management in theorem generation for long goal
6026 statements with 'includes'. INCOMPATIBILITY: produces a different
6027 theorem statement in rare situations.
6029 * Locale inspection command 'print_locale' omits notes elements. Use
6030 'print_locale!' to have them included in the output.
6035 * Provers/hypsubst.ML: improved version of the subst method, for
6036 single-step rewriting: it now works in bound variable contexts. New is
6037 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
6038 rewrite a different subterm than the original subst method, which is
6039 still available as 'simplesubst'.
6041 * Provers/quasi.ML: new transitivity reasoners for transitivity only
6044 * Provers/trancl.ML: new transitivity reasoner for transitive and
6045 reflexive-transitive closure of relations.
6047 * Provers/blast.ML: new reference depth_limit to make blast's depth
6048 limit (previously hard-coded with a value of 20) user-definable.
6050 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
6051 is peformed already. Object-logics merely need to finish their
6052 initial simpset configuration as before. INCOMPATIBILITY.
6057 * Symbolic syntax of Hilbert Choice Operator is now as follows:
6060 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
6062 The symbol \<some> is displayed as the alternative epsilon of LaTeX
6063 and x-symbol; use option '-m epsilon' to get it actually printed.
6064 Moreover, the mathematically important symbolic identifier \<epsilon>
6065 becomes available as variable, constant etc. INCOMPATIBILITY,
6067 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
6068 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
6069 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
6070 support corresponding Isar calculations.
6072 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
6075 * theory SetInterval: changed the syntax for open intervals:
6084 The old syntax is still supported but will disappear in the next
6085 release. For conversion use the following Emacs search and replace
6086 patterns (these are not perfect but work quite well):
6088 {)\([^\.]*\)\.\. -> {\1<\.\.}
6089 \.\.\([^(}]*\)(} -> \.\.<\1}
6091 * Theory Commutative_Ring (in Library): method comm_ring for proving
6092 equalities in commutative rings; method 'algebra' provides a generic
6095 * Theory Finite_Set: changed the syntax for 'setsum', summation over
6096 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
6097 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
6100 Some new syntax forms are available:
6102 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
6103 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
6104 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
6105 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
6107 The latter form "\<Sum>x < k. e" used to be based on a separate
6108 function "Summation", which has been discontinued.
6110 * theory Finite_Set: in structured induction proofs, the insert case
6111 is now 'case (insert x F)' instead of the old counterintuitive 'case
6114 * The 'refute' command has been extended to support a much larger
6115 fragment of HOL, including axiomatic type classes, constdefs and
6116 typedefs, inductive datatypes and recursion.
6118 * New tactics 'sat' and 'satx' to prove propositional tautologies.
6119 Requires zChaff with proof generation to be installed. See
6120 HOL/ex/SAT_Examples.thy for examples.
6122 * Datatype induction via method 'induct' now preserves the name of the
6123 induction variable. For example, when proving P(xs::'a list) by
6124 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
6125 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
6126 in unstructured proof scripts.
6128 * Reworked implementation of records. Improved scalability for
6129 records with many fields, avoiding performance problems for type
6130 inference. Records are no longer composed of nested field types, but
6131 of nested extension types. Therefore the record type only grows linear
6132 in the number of extensions and not in the number of fields. The
6133 top-level (users) view on records is preserved. Potential
6134 INCOMPATIBILITY only in strange cases, where the theory depends on the
6135 old record representation. The type generated for a record is called
6136 <record_name>_ext_type.
6138 Flag record_quick_and_dirty_sensitive can be enabled to skip the
6139 proofs triggered by a record definition or a simproc (if
6140 quick_and_dirty is enabled). Definitions of large records can take
6143 New simproc record_upd_simproc for simplification of multiple record
6144 updates enabled by default. Moreover, trivial updates are also
6145 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
6146 occasionally, since simplification is more powerful by default.
6148 * typedef: proper support for polymorphic sets, which contain extra
6149 type-variables in the term.
6151 * Simplifier: automatically reasons about transitivity chains
6152 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
6153 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
6154 old proofs break occasionally as simplification may now solve more
6155 goals than previously.
6157 * Simplifier: converts x <= y into x = y if assumption y <= x is
6158 present. Works for all partial orders (class "order"), in particular
6159 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
6162 * Simplifier: new simproc for "let x = a in f x". If a is a free or
6163 bound variable or a constant then the let is unfolded. Otherwise
6164 first a is simplified to b, and then f b is simplified to g. If
6165 possible we abstract b from g arriving at "let x = b in h x",
6166 otherwise we unfold the let and arrive at g. The simproc can be
6167 enabled/disabled by the reference use_let_simproc. Potential
6168 INCOMPATIBILITY since simplification is more powerful by default.
6170 * Classical reasoning: the meson method now accepts theorems as arguments.
6172 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
6173 jobs to provide advice on the provability of subgoals.
6175 * Theory OrderedGroup and Ring_and_Field: various additions and
6176 improvements to faciliate calculations involving equalities and
6179 The following theorems have been eliminated or modified
6182 abs_eq now named abs_of_nonneg
6183 abs_of_ge_0 now named abs_of_nonneg
6184 abs_minus_eq now named abs_of_nonpos
6185 imp_abs_id now named abs_of_nonneg
6186 imp_abs_neg_id now named abs_of_nonpos
6187 mult_pos now named mult_pos_pos
6188 mult_pos_le now named mult_nonneg_nonneg
6189 mult_pos_neg_le now named mult_nonneg_nonpos
6190 mult_pos_neg2_le now named mult_nonneg_nonpos2
6191 mult_neg now named mult_neg_neg
6192 mult_neg_le now named mult_nonpos_nonpos
6194 * The following lemmas in Ring_and_Field have been added to the simplifier:
6197 not_square_less_zero
6199 The following lemmas have been deleted from Real/RealPow:
6209 * Theory Parity: added rules for simplifying exponents.
6213 The following theorems have been eliminated or modified
6216 list_all_Nil now named list_all.simps(1)
6217 list_all_Cons now named list_all.simps(2)
6218 list_all_conv now named list_all_iff
6219 set_mem_eq now named mem_iff
6221 * Theories SetsAndFunctions and BigO (see HOL/Library) support
6222 asymptotic "big O" calculations. See the notes in BigO.thy.
6227 * Theory RealDef: better support for embedding natural numbers and
6228 integers in the reals.
6230 The following theorems have been eliminated or modified
6233 exp_ge_add_one_self now requires no hypotheses
6234 real_of_int_add reversed direction of equality (use [symmetric])
6235 real_of_int_minus reversed direction of equality (use [symmetric])
6236 real_of_int_diff reversed direction of equality (use [symmetric])
6237 real_of_int_mult reversed direction of equality (use [symmetric])
6239 * Theory RComplete: expanded support for floor and ceiling functions.
6241 * Theory Ln is new, with properties of the natural logarithm
6243 * Hyperreal: There is a new type constructor "star" for making
6244 nonstandard types. The old type names are now type synonyms:
6248 hcomplex = complex star
6250 * Hyperreal: Many groups of similarly-defined constants have been
6251 replaced by polymorphic versions (INCOMPATIBILITY):
6253 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
6255 starset <-- starsetNat, starsetC
6256 *s* <-- *sNat*, *sc*
6257 starset_n <-- starsetNat_n, starsetC_n
6258 *sn* <-- *sNatn*, *scn*
6259 InternalSets <-- InternalNatSets, InternalCSets
6261 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6262 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
6263 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
6264 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
6265 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
6267 * Hyperreal: Many type-specific theorems have been removed in favor of
6268 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
6270 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
6271 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
6272 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
6273 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
6274 right_minus <-- hypreal_add_minus
6275 left_minus <-- {hypreal,hcomplex}_add_minus_left
6276 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
6277 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
6278 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
6279 mult_1_right <-- hcomplex_mult_one_right
6280 mult_zero_left <-- hcomplex_mult_zero_left
6281 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
6282 right_distrib <-- hypnat_add_mult_distrib2
6283 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
6284 right_inverse <-- hypreal_mult_inverse
6285 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
6286 order_refl <-- {hypreal,hypnat}_le_refl
6287 order_trans <-- {hypreal,hypnat}_le_trans
6288 order_antisym <-- {hypreal,hypnat}_le_anti_sym
6289 order_less_le <-- {hypreal,hypnat}_less_le
6290 linorder_linear <-- {hypreal,hypnat}_le_linear
6291 add_left_mono <-- {hypreal,hypnat}_add_left_mono
6292 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
6293 add_nonneg_nonneg <-- hypreal_le_add_order
6295 * Hyperreal: Separate theorems having to do with type-specific
6296 versions of constants have been merged into theorems that apply to the
6297 new polymorphic constants (INCOMPATIBILITY):
6299 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
6300 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
6301 STAR_Un <-- {STAR,NatStar,STARC}_Un
6302 STAR_Int <-- {STAR,NatStar,STARC}_Int
6303 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
6304 STAR_subset <-- {STAR,NatStar,STARC}_subset
6305 STAR_mem <-- {STAR,NatStar,STARC}_mem
6306 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
6307 STAR_diff <-- {STAR,STARC}_diff
6308 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
6309 STARC_hcomplex_of_complex}_image_subset
6310 starset_n_Un <-- starset{Nat,C}_n_Un
6311 starset_n_Int <-- starset{Nat,C}_n_Int
6312 starset_n_Compl <-- starset{Nat,C}_n_Compl
6313 starset_n_diff <-- starset{Nat,C}_n_diff
6314 InternalSets_Un <-- Internal{Nat,C}Sets_Un
6315 InternalSets_Int <-- Internal{Nat,C}Sets_Int
6316 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
6317 InternalSets_diff <-- Internal{Nat,C}Sets_diff
6318 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
6319 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
6320 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
6321 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
6322 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
6323 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6324 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
6325 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
6326 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
6327 starfun_diff <-- starfun{C,RC,CR}_diff
6328 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
6329 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
6330 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
6331 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
6332 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
6333 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
6334 starfun_Id <-- starfunC_Id
6335 starfun_approx <-- starfun{Nat,CR}_approx
6336 starfun_capprox <-- starfun{C,RC}_capprox
6337 starfun_abs <-- starfunNat_rabs
6338 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
6339 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
6340 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
6341 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
6342 starfun_add_capprox <-- starfun{C,RC}_add_capprox
6343 starfun_add_approx <-- starfunCR_add_approx
6344 starfun_inverse_inverse <-- starfunC_inverse_inverse
6345 starfun_divide <-- starfun{C,CR,RC}_divide
6346 starfun_n <-- starfun{Nat,C}_n
6347 starfun_n_mult <-- starfun{Nat,C}_n_mult
6348 starfun_n_add <-- starfun{Nat,C}_n_add
6349 starfun_n_add_minus <-- starfunNat_n_add_minus
6350 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
6351 starfun_n_minus <-- starfun{Nat,C}_n_minus
6352 starfun_n_eq <-- starfun{Nat,C}_n_eq
6354 star_n_add <-- {hypreal,hypnat,hcomplex}_add
6355 star_n_minus <-- {hypreal,hcomplex}_minus
6356 star_n_diff <-- {hypreal,hcomplex}_diff
6357 star_n_mult <-- {hypreal,hcomplex}_mult
6358 star_n_inverse <-- {hypreal,hcomplex}_inverse
6359 star_n_le <-- {hypreal,hypnat}_le
6360 star_n_less <-- {hypreal,hypnat}_less
6361 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
6362 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
6363 star_n_abs <-- hypreal_hrabs
6364 star_n_divide <-- hcomplex_divide
6366 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
6367 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
6368 star_of_diff <-- hypreal_of_real_diff
6369 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
6370 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
6371 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
6372 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
6373 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
6374 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
6375 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
6376 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
6377 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
6378 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
6379 star_of_number_of <-- {hypreal,hcomplex}_number_of
6380 star_of_number_less <-- number_of_less_hypreal_of_real_iff
6381 star_of_number_le <-- number_of_le_hypreal_of_real_iff
6382 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
6383 star_of_less_number <-- hypreal_of_real_less_number_of_iff
6384 star_of_le_number <-- hypreal_of_real_le_number_of_iff
6385 star_of_power <-- hypreal_of_real_power
6386 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
6388 * Hyperreal: new method "transfer" that implements the transfer
6389 principle of nonstandard analysis. With a subgoal that mentions
6390 nonstandard types like "'a star", the command "apply transfer"
6391 replaces it with an equivalent one that mentions only standard types.
6392 To be successful, all free variables must have standard types; non-
6393 standard variables must have explicit universal quantifiers.
6395 * Hyperreal: A theory of Taylor series.
6400 * Discontinued special version of 'constdefs' (which used to support
6401 continuous functions) in favor of the general Pure one with full
6404 * New simplification procedure for solving continuity conditions; it
6405 is much faster on terms with many nested lambda abstractions (cubic
6406 instead of exponential time).
6408 * New syntax for domain package: selector names are now optional.
6409 Parentheses should be omitted unless argument is lazy, for example:
6411 domain 'a stream = cons "'a" (lazy "'a stream")
6413 * New command 'fixrec' for defining recursive functions with pattern
6414 matching; defining multiple functions with mutual recursion is also
6415 supported. Patterns may include the constants cpair, spair, up, sinl,
6416 sinr, or any data constructor defined by the domain package. The given
6417 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
6418 syntax and examples.
6420 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
6421 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
6422 but the proof obligation additionally includes an admissibility
6423 requirement. The packages generate instances of class cpo or pcpo,
6424 with continuity and strictness theorems for Rep and Abs.
6426 * HOLCF: Many theorems have been renamed according to a more standard naming
6427 scheme (INCOMPATIBILITY):
6429 foo_inject: "foo$x = foo$y ==> x = y"
6430 foo_eq: "(foo$x = foo$y) = (x = y)"
6431 foo_less: "(foo$x << foo$y) = (x << y)"
6432 foo_strict: "foo$UU = UU"
6433 foo_defined: "... ==> foo$x ~= UU"
6434 foo_defined_iff: "(foo$x = UU) = (x = UU)"
6439 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
6440 including the First Isomorphism Theorem (on quotienting by the kernel
6443 * ZF/Simplifier: install second copy of type solver that actually
6444 makes use of TC rules declared to Isar proof contexts (or locales);
6445 the old version is still required for ML proof scripts.
6450 * Converted to Isar theory format; use locales instead of axiomatic
6456 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
6459 * Pure/library.ML no longer defines its own option datatype, but uses
6460 that of the SML basis, which has constructors NONE and SOME instead of
6461 None and Some, as well as exception Option.Option instead of OPTION.
6462 The functions the, if_none, is_some, is_none have been adapted
6463 accordingly, while Option.map replaces apsome.
6465 * Pure/library.ML: the exception LIST has been given up in favour of
6466 the standard exceptions Empty and Subscript, as well as
6467 Library.UnequalLengths. Function like Library.hd and Library.tl are
6468 superceded by the standard hd and tl functions etc.
6470 A number of basic list functions are no longer exported to the ML
6471 toplevel, as they are variants of predefined functions. The following
6472 suggests how one can translate existing code:
6474 rev_append xs ys = List.revAppend (xs, ys)
6475 nth_elem (i, xs) = List.nth (xs, i)
6476 last_elem xs = List.last xs
6477 flat xss = List.concat xss
6478 seq fs = List.app fs
6479 partition P xs = List.partition P xs
6480 mapfilter f xs = List.mapPartial f xs
6482 * Pure/library.ML: several combinators for linear functional
6483 transformations, notably reverse application and composition:
6486 (x, y) |-> f f #-> g
6488 * Pure/library.ML: introduced/changed precedence of infix operators:
6490 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
6492 infix 3 o oo ooo oooo;
6493 infix 4 ~~ upto downto;
6495 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
6498 * Pure/library.ML: natural list combinators fold, fold_rev, and
6499 fold_map support linear functional transformations and nesting. For
6502 fold f [x1, ..., xN] y =
6503 y |> f x1 |> ... |> f xN
6505 (fold o fold) f [xs1, ..., xsN] y =
6506 y |> fold f xs1 |> ... |> fold f xsN
6508 fold f [x1, ..., xN] =
6511 (fold o fold) f [xs1, ..., xsN] =
6512 fold f xs1 #> ... #> fold f xsN
6514 * Pure/library.ML: the following selectors on type 'a option are
6517 the: 'a option -> 'a (*partial*)
6518 these: 'a option -> 'a where 'a = 'b list
6519 the_default: 'a -> 'a option -> 'a
6520 the_list: 'a option -> 'a list
6522 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6523 basic operations for association lists, following natural argument
6524 order; moreover the explicit equality predicate passed here avoids
6525 potentially expensive polymorphic runtime equality checks.
6526 The old functions may be expressed as follows:
6528 assoc = uncurry (AList.lookup (op =))
6529 assocs = these oo AList.lookup (op =)
6530 overwrite = uncurry (AList.update (op =)) o swap
6532 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6534 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
6535 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
6537 replacing make_keylist and keyfilter (occassionally used)
6540 make_keylist = AList.make
6541 keyfilter = AList.find (op =)
6543 * eq_fst and eq_snd now take explicit equality parameter, thus
6544 avoiding eqtypes. Naive rewrites:
6546 eq_fst = eq_fst (op =)
6547 eq_snd = eq_snd (op =)
6549 * Removed deprecated apl and apr (rarely used).
6552 apl (n, op) =>>= curry op n
6553 apr (op, m) =>>= fn n => op (n, m)
6555 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
6556 provides a reasonably efficient light-weight implementation of sets as
6559 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
6560 few new operations; existing lookup and update are now curried to
6561 follow natural argument order (for use with fold etc.);
6562 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
6564 * Pure/General: output via the Isabelle channels of
6565 writeln/warning/error etc. is now passed through Output.output, with a
6566 hook for arbitrary transformations depending on the print_mode
6567 (cf. Output.add_mode -- the first active mode that provides a output
6568 function wins). Already formatted output may be embedded into further
6569 text via Output.raw; the result of Pretty.string_of/str_of and derived
6570 functions (string_of_term/cterm/thm etc.) is already marked raw to
6571 accommodate easy composition of diagnostic messages etc. Programmers
6572 rarely need to care about Output.output or Output.raw at all, with
6573 some notable exceptions: Output.output is required when bypassing the
6574 standard channels (writeln etc.), or in token translations to produce
6575 properly formatted results; Output.raw is required when capturing
6576 already output material that will eventually be presented to the user
6577 a second time. For the default print mode, both Output.output and
6578 Output.raw have no effect.
6580 * Pure/General: Output.time_accumulator NAME creates an operator ('a
6581 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
6582 cumulative results are displayed at the end of a batch session.
6584 * Pure/General: File.sysify_path and File.quote_sysify path have been
6585 replaced by File.platform_path and File.shell_path (with appropriate
6586 hooks). This provides a clean interface for unusual systems where the
6587 internal and external process view of file names are different.
6589 * Pure: more efficient orders for basic syntactic entities: added
6590 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
6591 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
6592 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
6593 orders now -- potential INCOMPATIBILITY for code that depends on a
6594 particular order for Symtab.keys, Symtab.dest, etc. (consider using
6595 Library.sort_strings on result).
6597 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
6598 fold_types traverse types/terms from left to right, observing natural
6599 argument order. Supercedes previous foldl_XXX versions, add_frees,
6600 add_vars etc. have been adapted as well: INCOMPATIBILITY.
6602 * Pure: name spaces have been refined, with significant changes of the
6603 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
6604 to extern(_table). The plain name entry path is superceded by a
6605 general 'naming' context, which also includes the 'policy' to produce
6606 a fully qualified name and external accesses of a fully qualified
6607 name; NameSpace.extend is superceded by context dependent
6608 Sign.declare_name. Several theory and proof context operations modify
6609 the naming context. Especially note Theory.restore_naming and
6610 ProofContext.restore_naming to get back to a sane state; note that
6611 Theory.add_path is no longer sufficient to recover from
6612 Theory.absolute_path in particular.
6614 * Pure: new flags short_names (default false) and unique_names
6615 (default true) for controlling output of qualified names. If
6616 short_names is set, names are printed unqualified. If unique_names is
6617 reset, the name prefix is reduced to the minimum required to achieve
6618 the original result when interning again, even if there is an overlap
6619 with earlier declarations.
6621 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
6622 now 'extend', and 'merge' gets an additional Pretty.pp argument
6623 (useful for printing error messages). INCOMPATIBILITY.
6625 * Pure: major reorganization of the theory context. Type Sign.sg and
6626 Theory.theory are now identified, referring to the universal
6627 Context.theory (see Pure/context.ML). Actual signature and theory
6628 content is managed as theory data. The old code and interfaces were
6629 spread over many files and structures; the new arrangement introduces
6630 considerable INCOMPATIBILITY to gain more clarity:
6632 Context -- theory management operations (name, identity, inclusion,
6633 parents, ancestors, merge, etc.), plus generic theory data;
6635 Sign -- logical signature and syntax operations (declaring consts,
6636 types, etc.), plus certify/read for common entities;
6638 Theory -- logical theory operations (stating axioms, definitions,
6639 oracles), plus a copy of logical signature operations (consts,
6640 types, etc.); also a few basic management operations (Theory.copy,
6643 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
6644 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
6645 for convenience -- they merely return the theory.
6647 * Pure: type Type.tsig is superceded by theory in most interfaces.
6649 * Pure: the Isar proof context type is already defined early in Pure
6650 as Context.proof (note that ProofContext.context and Proof.context are
6651 aliases, where the latter is the preferred name). This enables other
6652 Isabelle components to refer to that type even before Isar is present.
6654 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
6655 typeK, constK, axiomK, oracleK), but provide explicit operations for
6656 any of these kinds. For example, Sign.intern typeK is now
6657 Sign.intern_type, Theory.hide_space Sign.typeK is now
6658 Theory.hide_types. Also note that former
6659 Theory.hide_classes/types/consts are now
6660 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
6661 internalize their arguments! INCOMPATIBILITY.
6663 * Pure: get_thm interface (of PureThy and ProofContext) expects
6664 datatype thmref (with constructors Name and NameSelection) instead of
6665 plain string -- INCOMPATIBILITY;
6667 * Pure: cases produced by proof methods specify options, where NONE
6668 means to remove case bindings -- INCOMPATIBILITY in
6671 * Pure: the following operations retrieve axioms or theorems from a
6672 theory node or theory hierarchy, respectively:
6674 Theory.axioms_of: theory -> (string * term) list
6675 Theory.all_axioms_of: theory -> (string * term) list
6676 PureThy.thms_of: theory -> (string * thm) list
6677 PureThy.all_thms_of: theory -> (string * thm) list
6679 * Pure: print_tac now outputs the goal through the trace channel.
6681 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
6682 Reference Toplevel.debug (default false) controls detailed printing
6683 and tracing of low-level exceptions; Toplevel.profiling (default 0)
6684 controls execution profiling -- set to 1 for time and 2 for space
6685 (both increase the runtime).
6687 * Isar session: The initial use of ROOT.ML is now always timed,
6688 i.e. the log will show the actual process times, in contrast to the
6689 elapsed wall-clock time that the outer shell wrapper produces.
6691 * Simplifier: improved handling of bound variables (nameless
6692 representation, avoid allocating new strings). Simprocs that invoke
6693 the Simplifier recursively should use Simplifier.inherit_bounds to
6694 avoid local name clashes. Failure to do so produces warnings
6695 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
6696 for further details.
6698 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
6699 bindings for all theorems stored within a given theory; this may help
6700 in porting non-Isar theories to Isar ones, while keeping ML proof
6701 scripts for the time being.
6703 * ML operator HTML.with_charset specifies the charset begin used for
6704 generated HTML files. For example:
6706 HTML.with_charset "utf-8" use_thy "Hebrew";
6707 HTML.with_charset "utf-8" use_thy "Chinese";
6712 * Allow symlinks to all proper Isabelle executables (Isabelle,
6713 isabelle, isatool etc.).
6715 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
6716 isatool doc, isatool mkdir, display_drafts etc.).
6718 * isatool usedir: option -f allows specification of the ML file to be
6719 used by Isabelle; default is ROOT.ML.
6721 * New isatool version outputs the version identifier of the Isabelle
6722 distribution being used.
6724 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
6725 (containing Boolean satisfiability problems) into Isabelle/HOL
6730 New in Isabelle2004 (April 2004)
6731 --------------------------------
6735 * Provers/order.ML: new efficient reasoner for partial and linear orders.
6736 Replaces linorder.ML.
6738 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
6739 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
6740 (\<a>...\<z>), are now considered normal letters, and can therefore
6741 be used anywhere where an ASCII letter (a...zA...Z) has until
6742 now. COMPATIBILITY: This obviously changes the parsing of some
6743 terms, especially where a symbol has been used as a binder, say
6744 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
6745 as an identifier. Fix it by inserting a space around former
6746 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
6747 existing theory and ML files.
6749 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
6751 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
6752 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
6753 a normal (but invisible) letter. For multiple letter subscripts repeat
6754 \<^isub> like this: x\<^isub>1\<^isub>2.
6756 * Pure: There are now sub-/superscripts that can span more than one
6757 character. Text between \<^bsub> and \<^esub> is set in subscript in
6758 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
6759 superscript. The new control characters are not identifier parts.
6761 * Pure: Control-symbols of the form \<^raw:...> will literally print the
6762 content of "..." to the latex file instead of \isacntrl... . The "..."
6763 may consist of any printable characters excluding the end bracket >.
6765 * Pure: Using new Isar command "finalconsts" (or the ML functions
6766 Theory.add_finals or Theory.add_finals_i) it is now possible to
6767 declare constants "final", which prevents their being given a definition
6768 later. It is useful for constants whose behaviour is fixed axiomatically
6769 rather than definitionally, such as the meta-logic connectives.
6771 * Pure: 'instance' now handles general arities with general sorts
6772 (i.e. intersections of classes),
6774 * Presentation: generated HTML now uses a CSS style sheet to make layout
6775 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
6776 It can be changed to alter the colors/layout of generated pages.
6781 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
6782 cut_tac, subgoal_tac and thin_tac:
6783 - Now understand static (Isar) contexts. As a consequence, users of Isar
6784 locales are no longer forced to write Isar proof scripts.
6785 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
6787 - INCOMPATIBILITY: names of variables to be instantiated may no
6788 longer be enclosed in quotes. Instead, precede variable name with `?'.
6789 This is consistent with the instantiation attribute "where".
6791 * Attributes "where" and "of":
6792 - Now take type variables of instantiated theorem into account when reading
6793 the instantiation string. This fixes a bug that caused instantiated
6794 theorems to have too special types in some circumstances.
6795 - "where" permits explicit instantiations of type variables.
6797 * Calculation commands "moreover" and "also" no longer interfere with
6798 current facts ("this"), admitting arbitrary combinations with "then"
6802 - Goal statements involving the context element "includes" no longer
6803 generate theorems with internal delta predicates (those ending on
6804 "_axioms") in the premise.
6805 Resolve particular premise with <locale>.intro to obtain old form.
6806 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
6807 specification and "includes" elements in goal statement.
6808 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
6809 [intro?] and [elim?] (respectively) by default.
6810 - Experimental command for instantiation of locales in proof contexts:
6811 instantiate <label>[<attrs>]: <loc>
6812 Instantiates locale <loc> and adds all its theorems to the current context
6813 taking into account their attributes. Label and attrs are optional
6814 modifiers, like in theorem declarations. If present, names of
6815 instantiated theorems are qualified with <label>, and the attributes
6816 <attrs> are applied after any attributes these theorems might have already.
6817 If the locale has assumptions, a chained fact of the form
6818 "<loc> t1 ... tn" is expected from which instantiations of the parameters
6819 are derived. The command does not support old-style locales declared
6820 with "locale (open)".
6821 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
6823 * HOL: Tactic emulation methods induct_tac and case_tac understand static
6829 * Proof import: new image HOL4 contains the imported library from
6830 the HOL4 system with about 2500 theorems. It is imported by
6831 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
6832 can be used like any other Isabelle image. See
6833 HOL/Import/HOL/README for more information.
6836 - Much improved handling of linear and partial orders.
6837 Reasoners for linear and partial orders are set up for type classes
6838 "linorder" and "order" respectively, and are added to the default simpset
6839 as solvers. This means that the simplifier can build transitivity chains
6840 to solve goals from the assumptions.
6841 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
6842 of blast or auto after simplification become unnecessary because the goal
6843 is solved by simplification already.
6845 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
6846 all proved in axiomatic type classes for semirings, rings and fields.
6849 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
6850 now formalized using the Ring_and_Field theory mentioned above.
6851 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
6852 than before, because now they are set up once in a generic manner.
6853 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
6854 Look for the general versions in Ring_and_Field (and Power if they concern
6857 * Type "rat" of the rational numbers is now available in HOL-Complex.
6860 - Record types are now by default printed with their type abbreviation
6861 instead of the list of all field types. This can be configured via
6862 the reference "print_record_type_abbr".
6863 - Simproc "record_upd_simproc" for simplification of multiple updates added
6864 (not enabled by default).
6865 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
6866 EX x. x = sel r to True (not enabled by default).
6867 - Tactic "record_split_simp_tac" to split and simplify records added.
6869 * 'specification' command added, allowing for definition by
6870 specification. There is also an 'ax_specification' command that
6871 introduces the new constants axiomatically.
6873 * arith(_tac) is now able to generate counterexamples for reals as well.
6875 * HOL-Algebra: new locale "ring" for non-commutative rings.
6877 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
6878 definitions, thanks to Sava Krsti\'{c} and John Matthews.
6880 * HOL-Matrix: a first theory for matrices in HOL with an application of
6881 matrix theory to linear programming.
6883 * Unions and Intersections:
6884 The latex output syntax of UN and INT has been changed
6885 from "\Union x \in A. B" to "\Union_{x \in A} B"
6886 i.e. the index formulae has become a subscript.
6887 Similarly for "\Union x. B", and for \Inter instead of \Union.
6889 * Unions and Intersections over Intervals:
6890 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
6891 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
6892 like in normal math, and corresponding versions for < and for intersection.
6894 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
6895 lexicographic dictonary ordering has been added as "lexord".
6897 * ML: the legacy theory structures Int and List have been removed. They had
6898 conflicted with ML Basis Library structures having the same names.
6900 * 'refute' command added to search for (finite) countermodels. Only works
6901 for a fragment of HOL. The installation of an external SAT solver is
6902 highly recommended. See "HOL/Refute.thy" for details.
6904 * 'quickcheck' command: Allows to find counterexamples by evaluating
6905 formulae under an assignment of free variables to random values.
6906 In contrast to 'refute', it can deal with inductive datatypes,
6907 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
6913 * Streams now come with concatenation and are part of the HOLCF image
6917 New in Isabelle2003 (May 2003)
6918 ------------------------------
6922 * Provers/simplifier:
6924 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
6925 Assumptions are now subject to complete mutual simplification,
6926 not just from left to right. The simplifier now preserves
6927 the order of assumptions.
6929 Potential INCOMPATIBILITY:
6931 -- simp sometimes diverges where the old version did
6932 not, e.g. invoking simp on the goal
6934 [| P (f x); y = x; f x = f y |] ==> Q
6936 now gives rise to the infinite reduction sequence
6938 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
6940 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
6943 -- Tactics combining classical reasoner and simplification (such as auto)
6944 are also affected by this change, because many of them rely on
6945 simp. They may sometimes diverge as well or yield a different numbers
6946 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
6947 in case of problems. Sometimes subsequent calls to the classical
6948 reasoner will fail because a preceeding call to the simplifier too
6949 eagerly simplified the goal, e.g. deleted redundant premises.
6951 - The simplifier trace now shows the names of the applied rewrite rules
6953 - You can limit the number of recursive invocations of the simplifier
6954 during conditional rewriting (where the simplifie tries to solve the
6955 conditions before applying the rewrite rule):
6956 ML "simp_depth_limit := n"
6957 where n is an integer. Thus you can force termination where previously
6958 the simplifier would diverge.
6960 - Accepts free variables as head terms in congruence rules. Useful in Isar.
6962 - No longer aborts on failed congruence proof. Instead, the
6963 congruence is ignored.
6965 * Pure: New generic framework for extracting programs from constructive
6966 proofs. See HOL/Extraction.thy for an example instantiation, as well
6967 as HOL/Extraction for some case studies.
6969 * Pure: The main goal of the proof state is no longer shown by default, only
6970 the subgoals. This behaviour is controlled by a new flag.
6971 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
6972 (ML: Proof.show_main_goal).
6974 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
6975 rules whose conclusion matches subgoal 1:
6976 PG menu: Isabelle/Isar -> Show me -> matching rules
6977 The rules are ordered by how closely they match the subgoal.
6978 In particular, rules that solve a subgoal outright are displayed first
6979 (or rather last, the way they are printed).
6980 (ML: ProofGeneral.print_intros())
6982 * Pure: New flag trace_unify_fail causes unification to print
6983 diagnostic information (PG: in trace buffer) when it fails. This is
6984 useful for figuring out why single step proofs like rule, erule or
6987 * Pure: Locale specifications now produce predicate definitions
6988 according to the body of text (covering assumptions modulo local
6989 definitions); predicate "loc_axioms" covers newly introduced text,
6990 while "loc" is cumulative wrt. all included locale expressions; the
6991 latter view is presented only on export into the global theory
6992 context; potential INCOMPATIBILITY, use "(open)" option to fall back
6993 on the old view without predicates;
6995 * Pure: predefined locales "var" and "struct" are useful for sharing
6996 parameters (as in CASL, for example); just specify something like
6997 ``var x + var y + struct M'' as import;
6999 * Pure: improved thms_containing: proper indexing of facts instead of
7000 raw theorems; check validity of results wrt. current name space;
7001 include local facts of proof configuration (also covers active
7002 locales), cover fixed variables in index; may use "_" in term
7003 specification; an optional limit for the number of printed facts may
7004 be given (the default is 40);
7006 * Pure: disallow duplicate fact bindings within new-style theory files
7009 * Provers: improved induct method: assumptions introduced by case
7010 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
7011 the goal statement); "foo" still refers to all facts collectively;
7013 * Provers: the function blast.overloaded has been removed: all constants
7014 are regarded as potentially overloaded, which improves robustness in exchange
7015 for slight decrease in efficiency;
7017 * Provers/linorder: New generic prover for transitivity reasoning over
7018 linear orders. Note: this prover is not efficient!
7020 * Isar: preview of problems to finish 'show' now produce an error
7021 rather than just a warning (in interactive mode);
7028 - Produces a counter example if it cannot prove a goal.
7029 Note that the counter example may be spurious if the goal is not a formula
7030 of quantifier-free linear arithmetic.
7031 In ProofGeneral the counter example appears in the trace buffer.
7033 - Knows about div k and mod k where k is a numeral of type nat or int.
7035 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
7036 linear arithmetic fails. This takes account of quantifiers and divisibility.
7037 Presburger arithmetic can also be called explicitly via presburger(_tac).
7039 * simp's arithmetic capabilities have been enhanced a bit: it now
7040 takes ~= in premises into account (by performing a case split);
7042 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
7043 are distributed over a sum of terms;
7045 * New tactic "trans_tac" and method "trans" instantiate
7046 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
7049 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
7050 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
7052 * 'typedef' command has new option "open" to suppress the set
7055 * functions Min and Max on finite sets have been introduced (theory
7058 * attribute [symmetric] now works for relations as well; it turns
7059 (x,y) : R^-1 into (y,x) : R, and vice versa;
7061 * induct over a !!-quantified statement (say !!x1..xn):
7062 each "case" automatically performs "fix x1 .. xn" with exactly those names.
7064 * Map: `empty' is no longer a constant but a syntactic abbreviation for
7065 %x. None. Warning: empty_def now refers to the previously hidden definition
7068 * Algebra: formalization of classical algebra. Intended as base for
7069 any algebraic development in Isabelle. Currently covers group theory
7070 (up to Sylow's theorem) and ring theory (Universal Property of
7071 Univariate Polynomials). Contributions welcome;
7073 * GroupTheory: deleted, since its material has been moved to Algebra;
7075 * Complex: new directory of the complex numbers with numeric constants,
7076 nonstandard complex numbers, and some complex analysis, standard and
7077 nonstandard (Jacques Fleuriot);
7079 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
7081 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
7084 * Real/HahnBanach: updated and adapted to locales;
7086 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
7089 * UNITY: added the Meier-Sanders theory of progress sets;
7091 * MicroJava: bytecode verifier and lightweight bytecode verifier
7092 as abstract algorithms, instantiated to the JVM;
7094 * Bali: Java source language formalization. Type system, operational
7095 semantics, axiomatic semantics. Supported language features:
7096 classes, interfaces, objects,virtual methods, static methods,
7097 static/instance fields, arrays, access modifiers, definite
7098 assignment, exceptions.
7103 * ZF/Constructible: consistency proof for AC (Gdel's constructible
7106 * Main ZF: virtually all theories converted to new-style format;
7111 * Pure: Tactic.prove provides sane interface for internal proofs;
7112 omits the infamous "standard" operation, so this is more appropriate
7113 than prove_goalw_cterm in many situations (e.g. in simprocs);
7115 * Pure: improved error reporting of simprocs;
7117 * Provers: Simplifier.simproc(_i) provides sane interface for setting
7121 *** Document preparation ***
7123 * uses \par instead of \\ for line breaks in theory text. This may
7124 shift some page breaks in large documents. To get the old behaviour
7125 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
7127 * minimized dependencies of isabelle.sty and isabellesym.sty on
7130 * \<euro> now needs package babel/greek instead of marvosym (which
7133 * normal size for \<zero>...\<nine> (uses \mathbf instead of
7138 New in Isabelle2002 (March 2002)
7139 --------------------------------
7141 *** Document preparation ***
7143 * greatly simplified document preparation setup, including more
7144 graceful interpretation of isatool usedir -i/-d/-D options, and more
7145 instructive isatool mkdir; users should basically be able to get
7146 started with "isatool mkdir HOL Test && isatool make"; alternatively,
7147 users may run a separate document processing stage manually like this:
7148 "isatool usedir -D output HOL Test && isatool document Test/output";
7150 * theory dependency graph may now be incorporated into documents;
7151 isatool usedir -g true will produce session_graph.eps/.pdf for use
7152 with \includegraphics of LaTeX;
7154 * proper spacing of consecutive markup elements, especially text
7155 blocks after section headings;
7157 * support bold style (for single symbols only), input syntax is like
7158 this: "\<^bold>\<alpha>" or "\<^bold>A";
7160 * \<bullet> is now output as bold \cdot by default, which looks much
7161 better in printed text;
7163 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
7164 note that these symbols are currently unavailable in Proof General /
7165 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
7167 * isatool latex no longer depends on changed TEXINPUTS, instead
7168 isatool document copies the Isabelle style files to the target
7174 * Pure/Provers: improved proof by cases and induction;
7175 - 'case' command admits impromptu naming of parameters (such as
7177 - 'induct' method divinates rule instantiation from the inductive
7178 claim; no longer requires excessive ?P bindings for proper
7179 instantiation of cases;
7180 - 'induct' method properly enumerates all possibilities of set/type
7181 rules; as a consequence facts may be also passed through *type*
7182 rules without further ado;
7183 - 'induct' method now derives symbolic cases from the *rulified*
7184 rule (before it used to rulify cases stemming from the internal
7185 atomized version); this means that the context of a non-atomic
7186 statement becomes is included in the hypothesis, avoiding the
7187 slightly cumbersome show "PROP ?case" form;
7188 - 'induct' may now use elim-style induction rules without chaining
7189 facts, using ``missing'' premises from the goal state; this allows
7190 rules stemming from inductive sets to be applied in unstructured
7191 scripts, while still benefitting from proper handling of non-atomic
7192 statements; NB: major inductive premises need to be put first, all
7193 the rest of the goal is passed through the induction;
7194 - 'induct' proper support for mutual induction involving non-atomic
7195 rule statements (uses the new concept of simultaneous goals, see
7197 - append all possible rule selections, but only use the first
7198 success (no backtracking);
7199 - removed obsolete "(simplified)" and "(stripped)" options of methods;
7200 - undeclared rule case names default to numbers 1, 2, 3, ...;
7201 - added 'print_induct_rules' (covered by help item in recent Proof
7203 - moved induct/cases attributes to Pure, methods to Provers;
7204 - generic method setup instantiated for FOL and HOL;
7206 * Pure: support multiple simultaneous goal statements, for example
7207 "have a: A and b: B" (same for 'theorem' etc.); being a pure
7208 meta-level mechanism, this acts as if several individual goals had
7209 been stated separately; in particular common proof methods need to be
7210 repeated in order to cover all claims; note that a single elimination
7211 step is *not* sufficient to establish the two conjunctions, so this
7214 assume "A & B" then have A and B .. (*".." fails*)
7216 better use "obtain" in situations as above; alternative refer to
7217 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
7219 * Pure: proper integration with ``locales''; unlike the original
7220 version by Florian Kammller, Isar locales package high-level proof
7221 contexts rather than raw logical ones (e.g. we admit to include
7222 attributes everywhere); operations on locales include merge and
7223 rename; support for implicit arguments (``structures''); simultaneous
7224 type-inference over imports and text; see also HOL/ex/Locales.thy for
7227 * Pure: the following commands have been ``localized'', supporting a
7228 target locale specification "(in name)": 'lemma', 'theorem',
7229 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
7230 stored both within the locale and at the theory level (exported and
7231 qualified by the locale name);
7233 * Pure: theory goals may now be specified in ``long'' form, with
7234 ad-hoc contexts consisting of arbitrary locale elements. for example
7235 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
7236 definitions may be given, too); the result is a meta-level rule with
7237 the context elements being discharged in the obvious way;
7239 * Pure: new proof command 'using' allows to augment currently used
7240 facts after a goal statement ('using' is syntactically analogous to
7241 'apply', but acts on the goal's facts only); this allows chained facts
7242 to be separated into parts given before and after a claim, as in
7243 ``from a and b have C using d and e <proof>'';
7245 * Pure: renamed "antecedent" case to "rule_context";
7247 * Pure: new 'judgment' command records explicit information about the
7248 object-logic embedding (used by several tools internally); no longer
7249 use hard-wired "Trueprop";
7251 * Pure: added 'corollary' command;
7253 * Pure: fixed 'token_translation' command;
7255 * Pure: removed obsolete 'exported' attribute;
7257 * Pure: dummy pattern "_" in is/let is now automatically lifted over
7258 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
7259 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
7261 * Pure: method 'atomize' presents local goal premises as object-level
7262 statements (atomic meta-level propositions); setup controlled via
7263 rewrite rules declarations of 'atomize' attribute; example
7264 application: 'induct' method with proper rule statements in improper
7267 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
7268 now consider the syntactic context of assumptions, giving a better
7269 chance to get type-inference of the arguments right (this is
7270 especially important for locales);
7272 * Pure: "sorry" no longer requires quick_and_dirty in interactive
7275 * Pure/obtain: the formal conclusion "thesis", being marked as
7276 ``internal'', may no longer be reference directly in the text;
7277 potential INCOMPATIBILITY, may need to use "?thesis" in rare
7280 * Pure: generic 'sym' attribute which declares a rule both as pure
7281 'elim?' and for the 'symmetric' operation;
7283 * Pure: marginal comments ``--'' may now occur just anywhere in the
7284 text; the fixed correlation with particular command syntax has been
7287 * Pure: new method 'rules' is particularly well-suited for proof
7288 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
7289 but often produces more compact proof terms with less detours;
7291 * Pure/Provers/classical: simplified integration with pure rule
7292 attributes and methods; the classical "intro?/elim?/dest?"
7293 declarations coincide with the pure ones; the "rule" method no longer
7294 includes classically swapped intros; "intro" and "elim" methods no
7295 longer pick rules from the context; also got rid of ML declarations
7296 AddXIs/AddXEs/AddXDs; all of this has some potential for
7299 * Provers/classical: attribute 'swapped' produces classical inversions
7300 of introduction rules;
7302 * Provers/simplifier: 'simplified' attribute may refer to explicit
7303 rules instead of full simplifier context; 'iff' attribute handles
7306 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
7308 * HOL: 'recdef' now fails on unfinished automated proofs, use
7309 "(permissive)" option to recover old behavior;
7311 * HOL: 'inductive' no longer features separate (collective) attributes
7312 for 'intros' (was found too confusing);
7314 * HOL: properly declared induction rules less_induct and
7320 * HOL: moved over to sane numeral syntax; the new policy is as
7323 - 0 and 1 are polymorphic constants, which are defined on any
7324 numeric type (nat, int, real etc.);
7326 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
7327 binary representation internally;
7329 - type nat has special constructor Suc, and generally prefers Suc 0
7330 over 1::nat and Suc (Suc 0) over 2::nat;
7332 This change may cause significant problems of INCOMPATIBILITY; here
7333 are some hints on converting existing sources:
7335 - due to the new "num" token, "-0" and "-1" etc. are now atomic
7336 entities, so expressions involving "-" (unary or binary minus) need
7337 to be spaced properly;
7339 - existing occurrences of "1" may need to be constraint "1::nat" or
7340 even replaced by Suc 0; similar for old "2";
7342 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
7344 - remove all special provisions on numerals in proofs;
7346 * HOL: simp rules nat_number expand numerals on nat to Suc/0
7347 representation (depends on bin_arith_simps in the default context);
7349 * HOL: symbolic syntax for x^2 (numeral 2);
7351 * HOL: the class of all HOL types is now called "type" rather than
7352 "term"; INCOMPATIBILITY, need to adapt references to this type class
7353 in axclass/classes, instance/arities, and (usually rare) occurrences
7354 in typings (of consts etc.); internally the class is called
7355 "HOL.type", ML programs should refer to HOLogic.typeS;
7357 * HOL/record package improvements:
7358 - new derived operations "fields" to build a partial record section,
7359 "extend" to promote a fixed record to a record scheme, and
7360 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
7361 declared as simp by default;
7362 - shared operations ("more", "fields", etc.) now need to be always
7363 qualified) --- potential INCOMPATIBILITY;
7364 - removed "make_scheme" operations (use "make" with "extend") --
7366 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
7367 - provides cases/induct rules for use with corresponding Isar
7368 methods (for concrete records, record schemes, concrete more
7369 parts, and schematic more parts -- in that order);
7370 - internal definitions directly based on a light-weight abstract
7371 theory of product types over typedef rather than datatype;
7373 * HOL: generic code generator for generating executable ML code from
7374 specifications; specific support for HOL constructs such as inductive
7375 datatypes and sets, as well as recursive functions; can be invoked
7376 via 'generate_code' theory section;
7378 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
7380 * HOL: consolidated and renamed several theories. In particular:
7381 Ord.thy has been absorbed into HOL.thy
7382 String.thy has been absorbed into List.thy
7384 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
7385 (beware of argument permutation!);
7387 * HOL: linorder_less_split superseded by linorder_cases;
7389 * HOL/List: "nodups" renamed to "distinct";
7391 * HOL: added "The" definite description operator; move Hilbert's "Eps"
7392 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
7393 - Ex_def has changed, now need to use some_eq_ex
7395 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
7396 in this (rare) case use:
7398 delSWrapper "split_all_tac"
7399 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
7401 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
7404 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
7405 Isabelle's type classes, ^ on functions and relations has too general
7406 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
7407 necessary to attach explicit type constraints;
7409 * HOL/Relation: the prefix name of the infix "O" has been changed from
7410 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
7411 renamed accordingly (eg "compI" -> "rel_compI").
7413 * HOL: syntax translations now work properly with numerals and records
7416 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
7417 of "lam" -- INCOMPATIBILITY;
7419 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
7420 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
7421 renamed "Product_Type.unit";
7423 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
7425 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
7426 the "cases" method);
7428 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
7431 * HOL/IMP: updated and converted to new-style theory format; several
7432 parts turned into readable document, with proper Isar proof texts and
7433 some explanations (by Gerwin Klein);
7435 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
7437 * HOL-Hyperreal is now a logic image;
7442 * Isar: consts/constdefs supports mixfix syntax for continuous
7445 * Isar: domain package adapted to new-style theory format, e.g. see
7448 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
7449 potential INCOMPATIBILITY; now use plain induct_tac instead of former
7450 lift.induct_tac, always use UU instead of Undef;
7452 * HOLCF/IMP: updated and converted to new-style theory;
7457 * Isar: proper integration of logic-specific tools and packages,
7458 including theory commands '(co)inductive', '(co)datatype',
7459 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
7460 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
7462 * theory Main no longer includes AC; for the Axiom of Choice, base
7463 your theory on Main_ZFC;
7465 * the integer library now covers quotients and remainders, with many
7466 laws relating division to addition, multiplication, etc.;
7468 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
7469 typeless version of the formalism;
7471 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
7474 * ZF/Induct: new directory for examples of inductive definitions,
7475 including theory Multiset for multiset orderings; converted to
7476 new-style theory format;
7478 * ZF: many new theorems about lists, ordinals, etc.;
7483 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
7484 variable proof controls level of detail: 0 = no proofs (only oracle
7485 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
7486 also ref manual for further ML interfaces;
7488 * Pure/axclass: removed obsolete ML interface
7489 goal_subclass/goal_arity;
7491 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
7492 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
7493 separate tokens, so expressions involving minus need to be spaced
7496 * Pure/syntax: support non-oriented infixes, using keyword "infix"
7497 rather than "infixl" or "infixr";
7499 * Pure/syntax: concrete syntax for dummy type variables admits genuine
7500 sort constraint specifications in type inference; e.g. "x::_::foo"
7501 ensures that the type of "x" is of sort "foo" (but not necessarily a
7504 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
7505 control output of nested => (types); the default behavior is
7508 * Pure/syntax: builtin parse translation for "_constify" turns valued
7509 tokens into AST constants;
7511 * Pure/syntax: prefer later declarations of translations and print
7512 translation functions; potential INCOMPATIBILITY: need to reverse
7513 multiple declarations for same syntax element constant;
7515 * Pure/show_hyps reset by default (in accordance to existing Isar
7518 * Provers/classical: renamed addaltern to addafter, addSaltern to
7521 * Provers/clasimp: ``iff'' declarations now handle conditional rules
7524 * system: tested support for MacOS X; should be able to get Isabelle +
7525 Proof General to work in a plain Terminal after installing Poly/ML
7526 (e.g. from the Isabelle distribution area) and GNU bash alone
7527 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
7528 support requires further installations, e.g. from
7529 http://fink.sourceforge.net/);
7531 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
7533 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
7534 of 40 MB), cf. ML_OPTIONS;
7536 * system: Proof General keywords specification is now part of the
7537 Isabelle distribution (see etc/isar-keywords.el);
7539 * system: support for persistent Proof General sessions (refrain from
7540 outdating all loaded theories on startup); user may create writable
7541 logic images like this: ``isabelle -q HOL Test'';
7543 * system: smart selection of Isabelle process versus Isabelle
7544 interface, accommodates case-insensitive file systems (e.g. HFS+); may
7545 run both "isabelle" and "Isabelle" even if file names are badly
7546 damaged (executable inspects the case of the first letter of its own
7547 name); added separate "isabelle-process" and "isabelle-interface";
7549 * system: refrain from any attempt at filtering input streams; no
7550 longer support ``8bit'' encoding of old isabelle font, instead proper
7551 iso-latin characters may now be used; the related isatools
7552 "symbolinput" and "nonascii" have disappeared as well;
7554 * system: removed old "xterm" interface (the print modes "xterm" and
7555 "xterm_color" are still available for direct use in a suitable
7560 New in Isabelle99-2 (February 2001)
7561 -----------------------------------
7563 *** Overview of INCOMPATIBILITIES ***
7565 * HOL: please note that theories in the Library and elsewhere often use the
7566 new-style (Isar) format; to refer to their theorems in an ML script you must
7567 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
7569 * HOL: inductive package no longer splits induction rule aggressively,
7570 but only as far as specified by the introductions given; the old
7571 format may be recovered via ML function complete_split_rule or attribute
7572 'split_rule (complete)';
7574 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
7575 gfp_Tarski to gfp_unfold;
7577 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
7579 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
7580 relation); infix "^^" has been renamed "``"; infix "``" has been
7581 renamed "`"; "univalent" has been renamed "single_valued";
7583 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
7586 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
7588 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
7590 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
7591 consequence, it is no longer monotonic wrt. the local goal context
7592 (which is now passed through the inductive cases);
7594 * Document preparation: renamed standard symbols \<ll> to \<lless> and
7595 \<gg> to \<ggreater>;
7598 *** Document preparation ***
7600 * \isabellestyle{NAME} selects version of Isabelle output (currently
7601 available: are "it" for near math-mode best-style output, "sl" for
7602 slanted text style, and "tt" for plain type-writer; if no
7603 \isabellestyle command is given, output is according to slanted
7606 * support sub/super scripts (for single symbols only), input syntax is
7607 like this: "A\<^sup>*" or "A\<^sup>\<star>";
7609 * some more standard symbols; see Appendix A of the system manual for
7610 the complete list of symbols defined in isabellesym.sty;
7612 * improved isabelle style files; more abstract symbol implementation
7613 (should now use \isamath{...} and \isatext{...} in custom symbol
7616 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
7617 state; Note that presentation of goal states does not conform to
7618 actual human-readable proof documents. Please do not include goal
7619 states into document output unless you really know what you are doing!
7621 * proper indentation of antiquoted output with proportional LaTeX
7624 * no_document ML operator temporarily disables LaTeX document
7627 * isatool unsymbolize tunes sources for plain ASCII communication;
7632 * Pure: Isar now suffers initial goal statements to contain unbound
7633 schematic variables (this does not conform to actual readable proof
7634 documents, due to unpredictable outcome and non-compositional proof
7635 checking); users who know what they are doing may use schematic goals
7636 for Prolog-style synthesis of proven results;
7638 * Pure: assumption method (an implicit finishing) now handles actual
7641 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
7642 initial goal, declare "that" only as Pure intro (only for single
7643 steps); the "that" rule assumption may now be involved in implicit
7644 finishing, thus ".." becomes a feasible for trivial obtains;
7646 * Pure: default proof step now includes 'intro_classes'; thus trivial
7647 instance proofs may be performed by "..";
7649 * Pure: ?thesis / ?this / "..." now work for pure meta-level
7652 * Pure: more robust selection of calculational rules;
7654 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
7655 rule (as well as the assumption rule);
7657 * Pure: 'thm_deps' command visualizes dependencies of theorems and
7658 lemmas, using the graph browser tool;
7660 * Pure: predict failure of "show" in interactive mode;
7662 * Pure: 'thms_containing' now takes actual terms as arguments;
7664 * HOL: improved method 'induct' --- now handles non-atomic goals
7665 (potential INCOMPATIBILITY); tuned error handling;
7667 * HOL: cases and induct rules now provide explicit hints about the
7668 number of facts to be consumed (0 for "type" and 1 for "set" rules);
7669 any remaining facts are inserted into the goal verbatim;
7671 * HOL: local contexts (aka cases) may now contain term bindings as
7672 well; the 'cases' and 'induct' methods new provide a ?case binding for
7673 the result to be shown in each case;
7675 * HOL: added 'recdef_tc' command;
7677 * isatool convert assists in eliminating legacy ML scripts;
7682 * HOL/Library: a collection of generic theories to be used together
7683 with main HOL; the theory loader path already includes this directory
7684 by default; the following existing theories have been moved here:
7685 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
7686 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
7688 * HOL/Unix: "Some aspects of Unix file-system security", a typical
7689 modelling and verification task performed in Isabelle/HOL +
7690 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
7692 * HOL/Algebra: special summation operator SUM no longer exists, it has
7693 been replaced by setsum; infix 'assoc' now has priority 50 (like
7694 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
7695 'domain', this makes the theory consistent with mathematical
7698 * HOL basics: added overloaded operations "inverse" and "divide"
7699 (infix "/"), syntax for generic "abs" operation, generic summation
7702 * HOL/typedef: simplified package, provide more useful rules (see also
7705 * HOL/datatype: induction rule for arbitrarily branching datatypes is
7706 now expressed as a proper nested rule (old-style tactic scripts may
7707 require atomize_strip_tac to cope with non-atomic premises);
7709 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
7710 to "split_conv" (old name still available for compatibility);
7712 * HOL: improved concrete syntax for strings (e.g. allows translation
7713 rules with string literals);
7715 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
7716 and Fleuriot's mechanization of analysis, including the transcendental
7717 functions for the reals;
7719 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
7724 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
7725 "lam" is displayed as TWO lambda-symbols
7727 * CTT: theory Main now available, containing everything (that is, Bool
7733 * Pure: the Simplifier has been implemented properly as a derived rule
7734 outside of the actual kernel (at last!); the overall performance
7735 penalty in practical applications is about 50%, while reliability of
7736 the Isabelle inference kernel has been greatly improved;
7738 * print modes "brackets" and "no_brackets" control output of nested =>
7739 (types) and ==> (props); the default behaviour is "brackets";
7741 * Provers: fast_tac (and friends) now handle actual object-logic rules
7742 as assumptions as well;
7744 * system: support Poly/ML 4.0;
7746 * system: isatool install handles KDE version 1 or 2;
7750 New in Isabelle99-1 (October 2000)
7751 ----------------------------------
7753 *** Overview of INCOMPATIBILITIES ***
7755 * HOL: simplification of natural numbers is much changed; to partly
7756 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
7757 issue the following ML commands:
7759 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
7760 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
7762 * HOL: simplification no longer dives into case-expressions; this is
7763 controlled by "t.weak_case_cong" for each datatype t;
7765 * HOL: nat_less_induct renamed to less_induct;
7767 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
7768 fixsome to patch .thy and .ML sources automatically;
7770 select_equality -> some_equality
7771 select_eq_Ex -> some_eq_ex
7772 selectI2EX -> someI2_ex
7775 select1_equality -> some1_equality
7776 Eps_sym_eq -> some_sym_eq_trivial
7777 Eps_eq -> some_eq_trivial
7779 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
7781 * HOL: removed obsolete theorem binding expand_if (refer to split_if
7784 * HOL: the recursion equations generated by 'recdef' are now called
7785 f.simps instead of f.rules;
7787 * HOL: qed_spec_mp now also handles bounded ALL as well;
7789 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
7790 sometimes be needed;
7792 * HOL: the constant for "f``x" is now "image" rather than "op ``";
7794 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
7796 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
7797 product is now "<*>" instead of "Times"; the lexicographic product is
7798 now "<*lex*>" instead of "**";
7800 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
7801 of main HOL, but was unused); better use HOL's datatype package;
7803 * HOL: removed "symbols" syntax for constant "override" of theory Map;
7804 the old syntax may be recovered as follows:
7807 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
7808 (infixl "\\<oplus>" 100)
7810 * HOL/Real: "rabs" replaced by overloaded "abs" function;
7812 * HOL/ML: even fewer consts are declared as global (see theories Ord,
7813 Lfp, Gfp, WF); this only affects ML packages that refer to const names
7816 * HOL and ZF: syntax for quotienting wrt an equivalence relation
7817 changed from A/r to A//r;
7819 * ZF: new treatment of arithmetic (nat & int) may break some old
7822 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
7823 rulify -> rule_format, elimify -> elim_format, ...);
7825 * Isar/Provers: intro/elim/dest attributes changed; renamed
7826 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
7827 should have to change intro!! to intro? only); replaced "delrule" by
7830 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
7832 * Provers: strengthened force_tac by using new first_best_tac;
7834 * LaTeX document preparation: several changes of isabelle.sty (see
7838 *** Document preparation ***
7840 * formal comments (text blocks etc.) in new-style theories may now
7841 contain antiquotations of thm/prop/term/typ/text to be presented
7842 according to latex print mode; concrete syntax is like this:
7843 @{term[show_types] "f(x) = a + x"};
7845 * isatool mkdir provides easy setup of Isabelle session directories,
7846 including proper document sources;
7848 * generated LaTeX sources are now deleted after successful run
7849 (isatool document -c); may retain a copy somewhere else via -D option
7852 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
7853 style files, achieving self-contained LaTeX sources and simplifying
7856 * old-style theories now produce (crude) LaTeX output as well;
7858 * browser info session directories are now self-contained (may be put
7859 on WWW server seperately); improved graphs of nested sessions; removed
7860 graph for 'all sessions';
7862 * several improvements in isabelle style files; \isabellestyle{it}
7863 produces fake math mode output; \isamarkupheader is now \section by
7864 default; see lib/texinputs/isabelle.sty etc.;
7869 * Isar/Pure: local results and corresponding term bindings are now
7870 subject to Hindley-Milner polymorphism (similar to ML); this
7871 accommodates incremental type-inference very nicely;
7873 * Isar/Pure: new derived language element 'obtain' supports
7874 generalized existence reasoning;
7876 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
7877 support accumulation of results, without applying any rules yet;
7878 useful to collect intermediate results without explicit name
7879 references, and for use with transitivity rules with more than 2
7882 * Isar/Pure: scalable support for case-analysis type proofs: new
7883 'case' language element refers to local contexts symbolically, as
7884 produced by certain proof methods; internally, case names are attached
7885 to theorems as "tags";
7887 * Isar/Pure: theory command 'hide' removes declarations from
7888 class/type/const name spaces;
7890 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
7891 indicate potential overloading;
7893 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
7895 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
7896 "{a,b,c}" instead of {a,b,c};
7898 * Isar/Pure now provides its own version of intro/elim/dest
7899 attributes; useful for building new logics, but beware of confusion
7900 with the version in Provers/classical;
7902 * Isar/Pure: the local context of (non-atomic) goals is provided via
7903 case name 'antecedent';
7905 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
7906 to the current context is now done automatically);
7908 * Isar/Pure: theory command 'method_setup' provides a simple interface
7909 for definining proof methods in ML;
7911 * Isar/Provers: intro/elim/dest attributes changed; renamed
7912 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
7913 most cases, one should have to change intro!! to intro? only);
7914 replaced "delrule" by "rule del";
7916 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
7917 'symmetric' attribute (the latter supercedes [RS sym]);
7919 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
7920 method modifier); 'simp' method: 'only:' modifier removes loopers as
7921 well (including splits);
7923 * Isar/Provers: Simplifier and Classical methods now support all kind
7924 of modifiers used in the past, including 'cong', 'iff', etc.
7926 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
7927 of Simplifier and Classical reasoner);
7929 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
7930 now support named cases; major packages (inductive, datatype, primrec,
7931 recdef) support case names and properly name parameters;
7933 * Isar/HOL: new transitivity rules for substitution in inequalities --
7934 monotonicity conditions are extracted to be proven at end of
7937 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
7940 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
7941 split_if split_if_asm; datatype package provides theorems foo.splits =
7942 foo.split foo.split_asm for each datatype;
7944 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
7945 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
7946 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
7947 use "(cases (simplified))" method in proper proof texts);
7949 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
7951 * Isar: names of theorems etc. may be natural numbers as well;
7953 * Isar: 'pr' command: optional arguments for goals_limit and
7954 ProofContext.prems_limit; no longer prints theory contexts, but only
7957 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
7958 additional print modes to be specified; e.g. "pr(latex)" will print
7959 proof state according to the Isabelle LaTeX style;
7961 * Isar: improved support for emulating tactic scripts, including proof
7962 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
7963 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
7964 (for HOL datatypes);
7966 * Isar: simplified (more robust) goal selection of proof methods: 1st
7967 goal, all goals, or explicit goal specifier (tactic emulation); thus
7968 'proof method scripts' have to be in depth-first order;
7970 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
7972 * Isar: removed 'help' command, which hasn't been too helpful anyway;
7973 should instead use individual commands for printing items
7974 (print_commands, print_methods etc.);
7976 * Isar: added 'nothing' --- the empty list of theorems;
7981 * HOL/MicroJava: formalization of a fragment of Java, together with a
7982 corresponding virtual machine and a specification of its bytecode
7983 verifier and a lightweight bytecode verifier, including proofs of
7984 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
7985 Cornelia Pusch (see also the homepage of project Bali at
7986 http://isabelle.in.tum.de/Bali/);
7988 * HOL/Algebra: new theory of rings and univariate polynomials, by
7991 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
7992 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
7995 * HOL/Lattice: fundamental concepts of lattice theory and order
7996 structures, including duals, properties of bounds versus algebraic
7997 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
7998 Theorem for complete lattices etc.; may also serve as a demonstration
7999 for abstract algebraic reasoning using axiomatic type classes, and
8000 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
8002 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
8005 * HOL/IMPP: extension of IMP with local variables and mutually
8006 recursive procedures, by David von Oheimb;
8008 * HOL/Lambda: converted into new-style theory and document;
8010 * HOL/ex/Multiquote: example of multiple nested quotations and
8011 anti-quotations -- basically a generalized version of de-Bruijn
8012 representation; very useful in avoiding lifting of operations;
8014 * HOL/record: added general record equality rule to simpset; fixed
8015 select-update simplification procedure to handle extended records as
8016 well; admit "r" as field name;
8018 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
8019 other numeric types and also as the identity of groups, rings, etc.;
8021 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
8022 Types nat and int belong to this axclass;
8024 * HOL: greatly improved simplification involving numerals of type nat, int, real:
8025 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
8026 i*j + k + j*#3*i simplifies to #4*(i*j) + k
8027 two terms #m*u and #n*u are replaced by #(m+n)*u
8028 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
8029 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
8030 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
8032 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
8033 powerful prover for predicate logic but knows nothing of clasets; see
8034 ex/mesontest.ML and ex/mesontest2.ML for example applications;
8036 * HOL: new version of "case_tac" subsumes both boolean case split and
8037 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
8038 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
8040 * HOL: simplification no longer dives into case-expressions: only the
8041 selector expression is simplified, but not the remaining arms; to
8042 enable full simplification of case-expressions for datatype t, you may
8043 remove t.weak_case_cong from the simpset, either globally (Delcongs
8044 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
8046 * HOL/recdef: the recursion equations generated by 'recdef' for
8047 function 'f' are now called f.simps instead of f.rules; if all
8048 termination conditions are proved automatically, these simplification
8049 rules are added to the simpset, as in primrec; rules may be named
8050 individually as well, resulting in a separate list of theorems for
8053 * HOL/While is a new theory that provides a while-combinator. It
8054 permits the definition of tail-recursive functions without the
8055 provision of a termination measure. The latter is necessary once the
8056 invariant proof rule for while is applied.
8058 * HOL: new (overloaded) notation for the set of elements below/above
8059 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
8061 * HOL: theorems impI, allI, ballI bound as "strip";
8063 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
8064 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
8065 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
8067 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8069 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
8070 main HOL, but was unused);
8072 * HOL: fewer consts declared as global (e.g. have to refer to
8073 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
8075 * HOL: tuned AST representation of nested pairs, avoiding bogus output
8076 in case of overlap with user translations (e.g. judgements over
8077 tuples); (note that the underlying logical represenation is still
8083 * ZF: simplification automatically cancels common terms in arithmetic
8084 expressions over nat and int;
8086 * ZF: new treatment of nat to minimize type-checking: all operators
8087 coerce their operands to a natural number using the function natify,
8088 making the algebraic laws unconditional;
8090 * ZF: as above, for int: operators coerce their operands to an integer
8091 using the function intify;
8093 * ZF: the integer library now contains many of the usual laws for the
8094 orderings, including $<=, and monotonicity laws for $+ and $*;
8096 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
8099 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
8100 to the simplifier and classical reasoner simultaneously;
8105 * Provers: blast_tac now handles actual object-logic rules as
8106 assumptions; note that auto_tac uses blast_tac internally as well;
8108 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
8109 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
8111 * Provers: delrules now handles destruct rules as well (no longer need
8112 explicit make_elim);
8114 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
8115 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8116 use instead the strong form,
8117 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8118 in HOL, FOL and ZF the function cla_make_elim will create such rules
8119 from destruct-rules;
8121 * Provers: Simplifier.easy_setup provides a fast path to basic
8122 Simplifier setup for new object-logics;
8124 * Pure: AST translation rules no longer require constant head on LHS;
8126 * Pure: improved name spaces: ambiguous output is qualified; support
8127 for hiding of names;
8129 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
8130 XSYMBOL_HOME; no longer need to do manual configuration in most
8133 * system: compression of ML heaps images may now be controlled via -c
8134 option of isabelle and isatool usedir (currently only observed by
8137 * system: isatool installfonts may handle X-Symbol fonts as well (very
8138 useful for remote X11);
8140 * system: provide TAGS file for Isabelle sources;
8142 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
8145 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
8146 timing flag supersedes proof_timing and Toplevel.trace;
8148 * ML: new combinators |>> and |>>> for incremental transformations
8149 with secondary results (e.g. certain theory extensions):
8151 * ML: PureThy.add_defs gets additional argument to indicate potential
8152 overloading (usually false);
8154 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
8159 New in Isabelle99 (October 1999)
8160 --------------------------------
8162 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8164 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
8165 are no longer simplified. (This allows the simplifier to unfold recursive
8166 functional programs.) To restore the old behaviour, declare
8168 Delcongs [if_weak_cong];
8170 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
8173 * HOL: the predicate "inj" is now defined by translation to "inj_on";
8175 * HOL/datatype: mutual_induct_tac no longer exists --
8176 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
8178 * HOL/typedef: fixed type inference for representing set; type
8179 arguments now have to occur explicitly on the rhs as type constraints;
8181 * ZF: The con_defs part of an inductive definition may no longer refer
8182 to constants declared in the same theory;
8184 * HOL, ZF: the function mk_cases, generated by the inductive
8185 definition package, has lost an argument. To simplify its result, it
8186 uses the default simpset instead of a supplied list of theorems.
8188 * HOL/List: the constructors of type list are now Nil and Cons;
8190 * Simplifier: the type of the infix ML functions
8191 setSSolver addSSolver setSolver addSolver
8192 is now simpset * solver -> simpset where `solver' is a new abstract type
8193 for packaging solvers. A solver is created via
8194 mk_solver: string -> (thm list -> int -> tactic) -> solver
8195 where the string argument is only a comment.
8200 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
8201 decision procedure for linear arithmetic. Currently it is used for
8202 types `nat', `int', and `real' in HOL (see below); it can, should and
8203 will be instantiated for other types and logics as well.
8205 * The simplifier now accepts rewrite rules with flexible heads, eg
8206 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
8207 They are applied like any rule with a non-pattern lhs, i.e. by first-order
8213 * New Isabelle/Isar subsystem provides an alternative to traditional
8214 tactical theorem proving; together with the ProofGeneral/isar user
8215 interface it offers an interactive environment for developing human
8216 readable proof documents (Isar == Intelligible semi-automated
8217 reasoning); for further information see isatool doc isar-ref,
8218 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
8220 * improved and simplified presentation of theories: better HTML markup
8221 (including colors), graph views in several sizes; isatool usedir now
8222 provides a proper interface for user theories (via -P option); actual
8223 document preparation based on (PDF)LaTeX is available as well (for
8224 new-style theories only); see isatool doc system for more information;
8226 * native support for Proof General, both for classic Isabelle and
8229 * ML function thm_deps visualizes dependencies of theorems and lemmas,
8230 using the graph browser tool;
8232 * Isabelle manuals now also available as PDF;
8234 * theory loader rewritten from scratch (may not be fully
8235 bug-compatible); old loadpath variable has been replaced by show_path,
8236 add_path, del_path, reset_path functions; new operations such as
8237 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
8240 * improved isatool install: option -k creates KDE application icon,
8241 option -p DIR installs standalone binaries;
8243 * added ML_PLATFORM setting (useful for cross-platform installations);
8244 more robust handling of platform specific ML images for SML/NJ;
8246 * the settings environment is now statically scoped, i.e. it is never
8247 created again in sub-processes invoked from isabelle, isatool, or
8250 * path element specification '~~' refers to '$ISABELLE_HOME';
8252 * in locales, the "assumes" and "defines" parts may be omitted if
8255 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
8258 * new print_mode "HTML";
8260 * new flag show_tags controls display of tags of theorems (which are
8261 basically just comments that may be attached by some tools);
8263 * Isamode 2.6 requires patch to accomodate change of Isabelle font
8264 mode and goal output format:
8266 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
8268 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
8270 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
8271 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
8273 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
8275 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
8277 * function bind_thms stores lists of theorems (cf. bind_thm);
8279 * new shorthand tactics ftac, eatac, datac, fatac;
8281 * qed (and friends) now accept "" as result name; in that case the
8282 theorem is not stored, but proper checks and presentation of the
8285 * theorem database now also indexes constants "Trueprop", "all",
8286 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
8291 ** HOL arithmetic **
8293 * There are now decision procedures for linear arithmetic over nat and
8296 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
8297 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
8298 are treated as atomic; subformulae not involving type `nat' or `int'
8299 are ignored; quantified subformulae are ignored unless they are
8300 positive universal or negative existential. The tactic has to be
8301 invoked by hand and can be a little bit slow. In particular, the
8302 running time is exponential in the number of occurrences of `min' and
8303 `max', and `-' on `nat'.
8305 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
8306 (negated) (in)equalities among the premises and the conclusion into
8307 account (i.e. no compound formulae) and does not know about `min' and
8308 `max', and `-' on `nat'. It is fast and is used automatically by the
8311 NB: At the moment, these decision procedures do not cope with mixed
8312 nat/int formulae where the two parts interact, such as `m < n ==>
8315 * HOL/Numeral provides a generic theory of numerals (encoded
8316 efficiently as bit strings); setup for types nat/int/real is in place;
8317 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
8318 int, existing theories and proof scripts may require a few additional
8321 * integer division and remainder can now be performed on constant
8324 * many properties of integer multiplication, division and remainder
8327 * An interface to the Stanford Validity Checker (SVC) is available through the
8328 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
8329 are proved automatically. SVC must be installed separately, and its results
8330 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
8331 invocation of the underlying oracle). For SVC see
8332 http://verify.stanford.edu/SVC
8334 * IsaMakefile: the HOL-Real target now builds an actual image;
8339 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
8340 (in Isabelle/Isar) -- by Gertrud Bauer;
8342 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
8343 analysis for assembly languages with subtypes;
8345 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
8346 -- avoids syntactic ambiguities and treats state, transition, and
8347 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
8348 changed syntax and (many) tactics;
8350 * HOL/inductive: Now also handles more general introduction rules such
8351 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
8352 theorems are now maintained within the theory (maintained via the
8355 * HOL/datatype: Now also handles arbitrarily branching datatypes
8356 (using function types) such as
8358 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
8360 * HOL/record: record_simproc (part of the default simpset) takes care
8361 of selectors applied to updated records; record_split_tac is no longer
8362 part of the default claset; update_defs may now be removed from the
8363 simpset in many cases; COMPATIBILITY: old behavior achieved by
8365 claset_ref () := claset() addSWrapper record_split_wrapper;
8366 Delsimprocs [record_simproc]
8368 * HOL/typedef: fixed type inference for representing set; type
8369 arguments now have to occur explicitly on the rhs as type constraints;
8371 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
8372 names rather than an ML expression;
8374 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
8375 supplied later. Program schemes can be defined, such as
8376 "While B C s = (if B s then While B C (C s) else s)"
8377 where the well-founded relation can be chosen after B and C have been given.
8379 * HOL/List: the constructors of type list are now Nil and Cons;
8380 INCOMPATIBILITY: while [] and infix # syntax is still there, of
8381 course, ML tools referring to List.list.op # etc. have to be adapted;
8383 * HOL_quantifiers flag superseded by "HOL" print mode, which is
8384 disabled by default; run isabelle with option -m HOL to get back to
8385 the original Gordon/HOL-style output;
8387 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
8388 ALL x<=y. P, EX x<y. P, EX x<=y. P;
8390 * HOL basic syntax simplified (more orthogonal): all variants of
8391 All/Ex now support plain / symbolic / HOL notation; plain syntax for
8392 Eps operator is provided as well: "SOME x. P[x]";
8394 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
8396 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
8397 thus available for user theories;
8399 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
8400 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
8403 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
8404 several times and then mp;
8409 * the notation <<...>> is now available as a notation for sequences of
8412 * the simplifier is now installed
8414 * the axiom system has been generalized (thanks to Soren Heilmann)
8416 * the classical reasoner now has a default rule database
8421 * new primrec section allows primitive recursive functions to be given
8422 directly (as in HOL) over datatypes and the natural numbers;
8424 * new tactics induct_tac and exhaust_tac for induction (or case
8425 analysis) over datatypes and the natural numbers;
8427 * the datatype declaration of type T now defines the recursor T_rec;
8429 * simplification automatically does freeness reasoning for datatype
8432 * automatic type-inference, with AddTCs command to insert new
8433 type-checking rules;
8435 * datatype introduction rules are now added as Safe Introduction rules
8438 * the syntax "if P then x else y" is now available in addition to
8442 *** Internal programming interfaces ***
8444 * tuned simplifier trace output; new flag debug_simp;
8446 * structures Vartab / Termtab (instances of TableFun) offer efficient
8447 tables indexed by indexname_ord / term_ord (compatible with aconv);
8449 * AxClass.axclass_tac lost the theory argument;
8451 * tuned current_goals_markers semantics: begin / end goal avoids
8452 printing empty lines;
8454 * removed prs and prs_fn hook, which was broken because it did not
8455 include \n in its semantics, forcing writeln to add one
8456 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
8457 string -> unit if you really want to output text without newline;
8459 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
8460 plain output, interface builders may have to enable 'isabelle_font'
8461 mode to get Isabelle font glyphs as before;
8463 * refined token_translation interface; INCOMPATIBILITY: output length
8464 now of type real instead of int;
8466 * theory loader actions may be traced via new ThyInfo.add_hook
8467 interface (see src/Pure/Thy/thy_info.ML); example application: keep
8468 your own database of information attached to *whole* theories -- as
8469 opposed to intra-theory data slots offered via TheoryDataFun;
8471 * proper handling of dangling sort hypotheses (at last!);
8472 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
8473 extra sort hypotheses that can be witnessed from the type signature;
8474 the force_strip_shyps flag is gone, any remaining shyps are simply
8475 left in the theorem (with a warning issued by strip_shyps_warning);
8479 New in Isabelle98-1 (October 1998)
8480 ----------------------------------
8482 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8484 * several changes of automated proof tools;
8486 * HOL: major changes to the inductive and datatype packages, including
8487 some minor incompatibilities of theory syntax;
8489 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
8492 * HOL: removed duplicate thms in Arith:
8493 less_imp_add_less should be replaced by trans_less_add1
8494 le_imp_add_le should be replaced by trans_le_add1
8496 * HOL: unary minus is now overloaded (new type constraints may be
8499 * HOL and ZF: unary minus for integers is now #- instead of #~. In
8500 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
8501 now taken as an integer constant.
8503 * Pure: ML function 'theory_of' renamed to 'theory';
8509 1. Asm_full_simp_tac is now more aggressive.
8510 1. It will sometimes reorient premises if that increases their power to
8512 2. It does no longer proceed strictly from left to right but may also
8513 rotate premises to achieve further simplification.
8514 For compatibility reasons there is now Asm_lr_simp_tac which is like the
8515 old Asm_full_simp_tac in that it does not rotate premises.
8516 2. The simplifier now knows a little bit about nat-arithmetic.
8518 * Classical reasoner: wrapper mechanism for the classical reasoner now
8519 allows for selected deletion of wrappers, by introduction of names for
8520 wrapper functionals. This implies that addbefore, addSbefore,
8521 addaltern, and addSaltern now take a pair (name, tactic) as argument,
8522 and that adding two tactics with the same name overwrites the first
8523 one (emitting a warning).
8524 type wrapper = (int -> tactic) -> (int -> tactic)
8525 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
8526 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
8527 delWrapper, delSWrapper: claset * string -> claset
8528 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
8530 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
8531 semantics; addbefore now affects only the unsafe part of step_tac
8532 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
8533 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
8536 * Classical reasoner: setwrapper to setWrapper and compwrapper to
8537 compWrapper; added safe wrapper (and access functions for it);
8539 * HOL/split_all_tac is now much faster and fails if there is nothing
8540 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
8541 and the names of the automatically generated variables have changed.
8542 split_all_tac has moved within claset() from unsafe wrappers to safe
8543 wrappers, which means that !!-bound variables are split much more
8544 aggressively, and safe_tac and clarify_tac now split such variables.
8545 If this splitting is not appropriate, use delSWrapper "split_all_tac".
8546 Note: the same holds for record_split_tac, which does the job of
8547 split_all_tac for record fields.
8549 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
8550 permanently to the default simpset using Addsplits just like
8551 Addsimps. They can be removed via Delsplits just like
8552 Delsimps. Lower-case versions are also available.
8554 * HOL/Simplifier: The rule split_if is now part of the default
8555 simpset. This means that the simplifier will eliminate all occurrences
8556 of if-then-else in the conclusion of a goal. To prevent this, you can
8557 either remove split_if completely from the default simpset by
8558 `Delsplits [split_if]' or remove it in a specific call of the
8559 simplifier using `... delsplits [split_if]'. You can also add/delete
8560 other case splitting rules to/from the default simpset: every datatype
8561 generates suitable rules `split_t_case' and `split_t_case_asm' (where
8562 t is the name of the datatype).
8564 * Classical reasoner / Simplifier combination: new force_tac (and
8565 derivatives Force_tac, force) combines rewriting and classical
8566 reasoning (and whatever other tools) similarly to auto_tac, but is
8567 aimed to solve the given subgoal completely.
8572 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
8573 and `goalw': the theory is no longer needed as an explicit argument -
8574 the current theory context is used; assumptions are no longer returned
8575 at the ML-level unless one of them starts with ==> or !!; it is
8576 recommended to convert to these new commands using isatool fixgoal
8577 (backup your sources first!);
8579 * new top-level commands 'thm' and 'thms' for retrieving theorems from
8580 the current theory context, and 'theory' to lookup stored theories;
8582 * new theory section 'locale' for declaring constants, assumptions and
8583 definitions that have local scope;
8585 * new theory section 'nonterminals' for purely syntactic types;
8587 * new theory section 'setup' for generic ML setup functions
8588 (e.g. package initialization);
8590 * the distribution now includes Isabelle icons: see
8591 lib/logo/isabelle-{small,tiny}.xpm;
8593 * isatool install - install binaries with absolute references to
8596 * isatool logo -- create instances of the Isabelle logo (as EPS);
8598 * print mode 'emacs' reserved for Isamode;
8600 * support multiple print (ast) translations per constant name;
8602 * theorems involving oracles are now printed with a suffixed [!];
8607 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
8609 * HOL/inductive package reorganized and improved: now supports mutual
8615 oddI "n : EVEN ==> Suc n : ODD"
8616 evenI "n : ODD ==> Suc n : EVEN"
8618 new theorem list "elims" contains an elimination rule for each of the
8619 recursive sets; inductive definitions now handle disjunctive premises
8620 correctly (also ZF);
8622 INCOMPATIBILITIES: requires Inductive as an ancestor; component
8623 "mutual_induct" no longer exists - the induction rule is always
8624 contained in "induct";
8627 * HOL/datatype package re-implemented and greatly improved: now
8628 supports mutually recursive datatypes such as
8631 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
8632 | SUM ('a aexp) ('a aexp)
8633 | DIFF ('a aexp) ('a aexp)
8636 'a bexp = LESS ('a aexp) ('a aexp)
8637 | AND ('a bexp) ('a bexp)
8638 | OR ('a bexp) ('a bexp)
8640 as well as indirectly recursive datatypes such as
8643 ('a, 'b) term = Var 'a
8644 | App 'b ((('a, 'b) term) list)
8646 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
8647 induction on mutually / indirectly recursive datatypes.
8649 Primrec equations are now stored in theory and can be accessed via
8650 <function_name>.simps.
8654 - Theories using datatypes must now have theory Datatype as an
8656 - The specific <typename>.induct_tac no longer exists - use the
8657 generic induct_tac instead.
8658 - natE has been renamed to nat.exhaust - use exhaust_tac
8659 instead of res_inst_tac ... natE. Note that the variable
8660 names in nat.exhaust differ from the names in natE, this
8661 may cause some "fragile" proofs to fail.
8662 - The theorems split_<typename>_case and split_<typename>_case_asm
8663 have been renamed to <typename>.split and <typename>.split_asm.
8664 - Since default sorts of type variables are now handled correctly,
8665 some datatype definitions may have to be annotated with explicit
8667 - Primrec definitions no longer require function name and type
8668 of recursive argument.
8670 Consider using isatool fixdatatype to adapt your theories and proof
8671 scripts to the new package (backup your sources first!).
8674 * HOL/record package: considerably improved implementation; now
8675 includes concrete syntax for record types, terms, updates; theorems
8676 for surjective pairing and splitting !!-bound record variables; proof
8677 support is as follows:
8679 1) standard conversions (selectors or updates applied to record
8680 constructor terms) are part of the standard simpset;
8682 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
8683 made part of standard simpset and claset via addIffs;
8685 3) a tactic for record field splitting (record_split_tac) is part of
8686 the standard claset (addSWrapper);
8688 To get a better idea about these rules you may retrieve them via
8689 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
8690 the name of your record type.
8692 The split tactic 3) conceptually simplifies by the following rule:
8694 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
8696 Thus any record variable that is bound by meta-all will automatically
8697 blow up into some record constructor term, consequently the
8698 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
8699 solve record problems automatically.
8702 * reorganized the main HOL image: HOL/Integ and String loaded by
8703 default; theory Main includes everything;
8705 * automatic simplification of integer sums and comparisons, using cancellation;
8707 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
8709 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
8711 * many new identities for unions, intersections, set difference, etc.;
8713 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
8714 called split_if, split_split, split_sum_case and split_nat_case (to go
8715 with add/delsplits);
8717 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
8718 (?x::unit) = (); this is made part of the default simpset, which COULD
8719 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
8720 'Delsimprocs [unit_eq_proc];' as last resort); also note that
8721 unit_abs_eta_conv is added in order to counter the effect of
8722 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
8725 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
8728 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
8729 It and 'sym RS equals0D' are now in the default claset, giving automatic
8730 disjointness reasoning but breaking a few old proofs.
8732 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
8733 to 'converse' from 'inverse' (for compatibility with ZF and some
8736 * HOL/recdef can now declare non-recursive functions, with {} supplied as
8737 the well-founded relation;
8739 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
8740 Compl A. The "Compl" syntax remains available as input syntax for this
8743 * HOL/Update: new theory of function updates:
8744 f(a:=b) == %x. if x=a then b else f x
8745 may also be iterated as in f(a:=b,c:=d,...);
8747 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
8750 - new function list_update written xs[i:=v] that updates the i-th
8751 list position. May also be iterated as in xs[i:=a,j:=b,...].
8752 - new function `upt' written [i..j(] which generates the list
8753 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
8754 bound write [i..j], which is a shorthand for [i..j+1(].
8755 - new lexicographic orderings and corresponding wellfoundedness theorems.
8758 - removed 'pred' (predecessor) function;
8759 - generalized some theorems about n-1;
8760 - many new laws about "div" and "mod";
8761 - new laws about greatest common divisors (see theory ex/Primes);
8763 * HOL/Relation: renamed the relational operator r^-1 "converse"
8764 instead of "inverse";
8766 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
8767 of the multiset ordering;
8769 * directory HOL/Real: a construction of the reals using Dedekind cuts
8770 (not included by default);
8772 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
8774 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
8775 programs, i.e. different program variables may have different types.
8777 * calling (stac rew i) now fails if "rew" has no effect on the goal
8778 [previously, this check worked only if the rewrite rule was unconditional]
8779 Now rew can involve either definitions or equalities (either == or =).
8784 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
8785 only the theorems proved on ZF.ML;
8787 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
8788 It and 'sym RS equals0D' are now in the default claset, giving automatic
8789 disjointness reasoning but breaking a few old proofs.
8791 * ZF/Update: new theory of function updates
8792 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
8793 may also be iterated as in f(a:=b,c:=d,...);
8795 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
8797 * calling (stac rew i) now fails if "rew" has no effect on the goal
8798 [previously, this check worked only if the rewrite rule was unconditional]
8799 Now rew can involve either definitions or equalities (either == or =).
8801 * case_tac provided for compatibility with HOL
8802 (like the old excluded_middle_tac, but with subgoals swapped)
8805 *** Internal programming interfaces ***
8807 * Pure: several new basic modules made available for general use, see
8808 also src/Pure/README;
8810 * improved the theory data mechanism to support encapsulation (data
8811 kind name replaced by private Object.kind, acting as authorization
8812 key); new type-safe user interface via functor TheoryDataFun; generic
8813 print_data function becomes basically useless;
8815 * removed global_names compatibility flag -- all theory declarations
8816 are qualified by default;
8818 * module Pure/Syntax now offers quote / antiquote translation
8819 functions (useful for Hoare logic etc. with implicit dependencies);
8820 see HOL/ex/Antiquote for an example use;
8822 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
8825 * new tactical CHANGED_GOAL for checking that a tactic modifies a
8828 * Display.print_goals function moved to Locale.print_goals;
8830 * standard print function for goals supports current_goals_markers
8831 variable for marking begin of proof, end of proof, start of goal; the
8832 default is ("", "", ""); setting current_goals_markers := ("<proof>",
8833 "</proof>", "<goal>") causes SGML like tagged proof state printing,
8838 New in Isabelle98 (January 1998)
8839 --------------------------------
8841 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8843 * changed lexical syntax of terms / types: dots made part of long
8844 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
8846 * simpset (and claset) reference variable replaced by functions
8847 simpset / simpset_ref;
8849 * no longer supports theory aliases (via merge) and non-trivial
8850 implicit merge of thms' signatures;
8852 * most internal names of constants changed due to qualified names;
8854 * changed Pure/Sequence interface (see Pure/seq.ML);
8857 *** General Changes ***
8859 * hierachically structured name spaces (for consts, types, axms, thms
8860 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
8861 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
8862 isatool fixdots ensures space after dots (e.g. "%x. x"); set
8863 long_names for fully qualified output names; NOTE: ML programs
8864 (special tactics, packages etc.) referring to internal names may have
8865 to be adapted to cope with fully qualified names; in case of severe
8866 backward campatibility problems try setting 'global_names' at compile
8867 time to have enrything declared within a flat name space; one may also
8868 fine tune name declarations in theories via the 'global' and 'local'
8871 * reimplemented the implicit simpset and claset using the new anytype
8872 data filed in signatures; references simpset:simpset ref etc. are
8873 replaced by functions simpset:unit->simpset and
8874 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
8875 to patch your ML files accordingly;
8877 * HTML output now includes theory graph data for display with Java
8878 applet or isatool browser; data generated automatically via isatool
8879 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
8881 * defs may now be conditional; improved rewrite_goals_tac to handle
8882 conditional equations;
8884 * defs now admits additional type arguments, using TYPE('a) syntax;
8886 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
8887 creates a new theory node; implicit merge of thms' signatures is
8888 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
8889 transfer:theory->thm->thm in (rare) cases;
8891 * improved handling of draft signatures / theories; draft thms (and
8892 ctyps, cterms) are automatically promoted to real ones;
8894 * slightly changed interfaces for oracles: admit many per theory, named
8895 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
8897 * print_goals: optional output of const types (set show_consts and
8900 * improved output of warnings (###) and errors (***);
8902 * subgoal_tac displays a warning if the new subgoal has type variables;
8904 * removed old README and Makefiles;
8906 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
8908 * removed obsolete init_pps and init_database;
8910 * deleted the obsolete tactical STATE, which was declared by
8911 fun STATE tacfun st = tacfun st st;
8913 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
8914 (which abbreviates $HOME);
8916 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
8917 use isatool fixseq to adapt your ML programs (this works for fully
8918 qualified references to the Sequence structure only!);
8920 * use_thy no longer requires writable current directory; it always
8921 reloads .ML *and* .thy file, if either one is out of date;
8924 *** Classical Reasoner ***
8926 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
8927 tactics that use classical reasoning to simplify a subgoal without
8928 splitting it into several subgoals;
8930 * Safe_tac: like safe_tac but uses the default claset;
8935 * added simplification meta rules:
8936 (asm_)(full_)simplify: simpset -> thm -> thm;
8938 * simplifier.ML no longer part of Pure -- has to be loaded by object
8941 * added prems argument to simplification procedures;
8943 * HOL, FOL, ZF: added infix function `addsplits':
8944 instead of `<simpset> setloop (split_tac <thms>)'
8945 you can simply write `<simpset> addsplits <thms>'
8950 * TYPE('a) syntax for type reflection terms;
8952 * no longer handles consts with name "" -- declare as 'syntax' instead;
8954 * pretty printer: changed order of mixfix annotation preference (again!);
8956 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
8961 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
8962 with `addloop' of the simplifier to faciliate case splitting in premises.
8964 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
8966 * HOL/Auth: new protocol proofs including some for the Internet
8969 * HOL/Map: new theory of `maps' a la VDM;
8971 * HOL/simplifier: simplification procedures nat_cancel_sums for
8972 cancelling out common nat summands from =, <, <= (in)equalities, or
8973 differences; simplification procedures nat_cancel_factor for
8974 cancelling common factor from =, <, <= (in)equalities over natural
8975 sums; nat_cancel contains both kinds of procedures, it is installed by
8976 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
8978 * HOL/simplifier: terms of the form
8979 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
8981 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
8982 and those of the form
8983 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
8985 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
8988 Each datatype `t' now comes with a theorem `split_t_case' of the form
8990 P(t_case f1 ... fn x) =
8991 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
8993 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
8996 and a theorem `split_t_case_asm' of the form
8998 P(t_case f1 ... fn x) =
8999 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
9001 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
9003 which can be added to a simpset via `addsplits'. The existing theorems
9004 expand_list_case and expand_option_case have been renamed to
9005 split_list_case and split_option_case.
9008 - `pred n' is automatically converted to `n-1'.
9009 Users are strongly encouraged not to use `pred' any longer,
9010 because it will disappear altogether at some point.
9011 - Users are strongly encouraged to write "0 < n" rather than
9012 "n ~= 0". Theorems and proof tools have been modified towards this
9016 the function "set_of_list" has been renamed "set" (and its theorems too);
9017 the function "nth" now takes its arguments in the reverse order and
9018 has acquired the infix notation "!" as in "xs!n".
9020 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
9022 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
9023 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
9025 * HOL/record: extensible records with schematic structural subtyping
9026 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
9027 still lacks various theorems and concrete record syntax;
9032 * removed "axioms" and "generated by" sections;
9034 * replaced "ops" section by extended "consts" section, which is capable of
9035 handling the continuous function space "->" directly;
9038 . proves theorems immediately and stores them in the theory,
9039 . creates hierachical name space,
9040 . now uses normal mixfix annotations (instead of cinfix...),
9041 . minor changes to some names and values (for consistency),
9042 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
9043 . separator between mutual domain defs: changed "," to "and",
9044 . improved handling of sort constraints; now they have to
9045 appear on the left-hand side of the equations only;
9047 * fixed LAM <x,y,zs>.b syntax;
9049 * added extended adm_tac to simplifier in HOLCF -- can now discharge
9050 adm (%x. P (t x)), where P is chainfinite and t continuous;
9055 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
9056 with `addloop' of the simplifier to faciliate case splitting in premises.
9058 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
9059 in HOL, they strip ALL and --> from proved theorems;
9063 New in Isabelle94-8 (May 1997)
9064 ------------------------------
9066 *** General Changes ***
9068 * new utilities to build / run / maintain Isabelle etc. (in parts
9069 still somewhat experimental); old Makefiles etc. still functional;
9071 * new 'Isabelle System Manual';
9073 * INSTALL text, together with ./configure and ./build scripts;
9075 * reimplemented type inference for greater efficiency, better error
9076 messages and clean internal interface;
9078 * prlim command for dealing with lots of subgoals (an easier way of
9079 setting goals_limit);
9084 * supports alternative (named) syntax tables (parser and pretty
9085 printer); internal interface is provided by add_modesyntax(_i);
9087 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
9088 be used in conjunction with the Isabelle symbol font; uses the
9089 "symbols" syntax table;
9091 * added token_translation interface (may translate name tokens in
9092 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
9093 the current print_mode); IMPORTANT: user print translation functions
9094 are responsible for marking newly introduced bounds
9095 (Syntax.mark_boundT);
9097 * token translations for modes "xterm" and "xterm_color" that display
9098 names in bold, underline etc. or colors (which requires a color
9101 * infixes may now be declared with names independent of their syntax;
9103 * added typed_print_translation (like print_translation, but may
9104 access type of constant);
9107 *** Classical Reasoner ***
9109 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
9110 some limitations. Blast_tac...
9111 + ignores addss, addbefore, addafter; this restriction is intrinsic
9112 + ignores elimination rules that don't have the correct format
9113 (the conclusion MUST be a formula variable)
9114 + ignores types, which can make HOL proofs fail
9115 + rules must not require higher-order unification, e.g. apply_type in ZF
9116 [message "Function Var's argument not a bound variable" relates to this]
9117 + its proof strategy is more general but can actually be slower
9119 * substitution with equality assumptions no longer permutes other
9122 * minor changes in semantics of addafter (now called addaltern); renamed
9123 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
9124 (and access functions for it);
9126 * improved combination of classical reasoner and simplifier:
9127 + functions for handling clasimpsets
9128 + improvement of addss: now the simplifier is called _after_ the
9130 + safe variant of addss called addSss: uses safe simplifications
9131 _during_ the safe steps. It is more complete as it allows multiple
9132 instantiations of unknowns (e.g. with slow_tac).
9136 * added interface for simplification procedures (functions that
9137 produce *proven* rewrite rules on the fly, depending on current
9140 * ordering on terms as parameter (used for ordered rewriting);
9142 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
9144 * the solver is now split into a safe and an unsafe part.
9145 This should be invisible for the normal user, except that the
9146 functions setsolver and addsolver have been renamed to setSolver and
9147 addSolver; added safe_asm_full_simp_tac;
9152 * a generic induction tactic `induct_tac' which works for all datatypes and
9153 also for type `nat';
9155 * a generic case distinction tactic `exhaust_tac' which works for all
9156 datatypes and also for type `nat';
9158 * each datatype comes with a function `size';
9160 * patterns in case expressions allow tuple patterns as arguments to
9161 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
9163 * primrec now also works with type nat;
9165 * recdef: a new declaration form, allows general recursive functions to be
9166 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
9168 * the constant for negation has been renamed from "not" to "Not" to
9169 harmonize with FOL, ZF, LK, etc.;
9171 * HOL/ex/LFilter theory of a corecursive "filter" functional for
9174 * HOL/Modelcheck demonstrates invocation of model checker oracle;
9176 * HOL/ex/Ring.thy declares cring_simp, which solves equational
9177 problems in commutative rings, using axiomatic type classes for + and *;
9179 * more examples in HOL/MiniML and HOL/Auth;
9181 * more default rewrite rules for quantifiers, union/intersection;
9183 * a new constant `arbitrary == @x.False';
9185 * HOLCF/IOA replaces old HOL/IOA;
9187 * HOLCF changes: derived all rules and arities
9188 + axiomatic type classes instead of classes
9189 + typedef instead of faking type definitions
9190 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
9191 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
9192 + eliminated the types void, one, tr
9193 + use unit lift and bool lift (with translations) instead of one and tr
9194 + eliminated blift from Lift3.thy (use Def instead of blift)
9195 all eliminated rules are derived as theorems --> no visible changes ;
9200 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
9201 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
9202 as ZF_cs addSIs [equalityI];
9206 New in Isabelle94-7 (November 96)
9207 ---------------------------------
9209 * allowing negative levels (as offsets) in prlev and choplev;
9211 * super-linear speedup for large simplifications;
9213 * FOL, ZF and HOL now use miniscoping: rewriting pushes
9214 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
9215 FAIL); can suppress it using the command Delsimps (ex_simps @
9216 all_simps); De Morgan laws are also now included, by default;
9218 * improved printing of ==> : ~:
9220 * new object-logic "Sequents" adds linear logic, while replacing LK
9221 and Modal (thanks to Sara Kalvala);
9223 * HOL/Auth: correctness proofs for authentication protocols;
9225 * HOL: new auto_tac combines rewriting and classical reasoning (many
9226 examples on HOL/Auth);
9228 * HOL: new command AddIffs for declaring theorems of the form P=Q to
9229 the rewriter and classical reasoner simultaneously;
9231 * function uresult no longer returns theorems in "standard" format;
9232 regain previous version by: val uresult = standard o uresult;
9239 * oracles -- these establish an interface between Isabelle and trusted
9240 external reasoners, which may deliver results as theorems;
9242 * proof objects (in particular record all uses of oracles);
9244 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
9246 * "constdefs" section in theory files;
9248 * "primrec" section (HOL) no longer requires names;
9250 * internal type "tactic" now simply "thm -> thm Sequence.seq";
9257 * reduced space requirements;
9259 * automatic HTML generation from theories;
9261 * theory files no longer require "..." (quotes) around most types;
9263 * new examples, including two proofs of the Church-Rosser theorem;
9265 * non-curried (1994) version of HOL is no longer distributed;
9272 * greatly reduced space requirements;
9274 * theory files (.thy) no longer require \...\ escapes at line breaks;
9276 * searchable theorem database (see the section "Retrieving theorems" on
9277 page 8 of the Reference Manual);
9279 * new examples, including Grabczewski's monumental case study of the
9282 * The previous version of HOL renamed to Old_HOL;
9284 * The new version of HOL (previously called CHOL) uses a curried syntax
9285 for functions. Application looks like f a b instead of f(a,b);
9287 * Mutually recursive inductive definitions finally work in HOL;
9289 * In ZF, pattern-matching on tuples is now available in all abstractions and
9290 translates to the operator "split";
9297 * new infix operator, addss, allowing the classical reasoner to
9298 perform simplification at each step of its search. Example:
9299 fast_tac (cs addss ss)
9301 * a new logic, CHOL, the same as HOL, but with a curried syntax
9302 for functions. Application looks like f a b instead of f(a,b). Also pairs
9303 look like (a,b) instead of <a,b>;
9305 * PLEASE NOTE: CHOL will eventually replace HOL!
9307 * In CHOL, pattern-matching on tuples is now available in all abstractions.
9308 It translates to the operator "split". A new theory of integers is available;
9310 * In ZF, integer numerals now denote two's-complement binary integers.
9311 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
9313 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
9314 of the Axiom of Choice;
9321 * Significantly faster resolution;
9323 * the different sections in a .thy file can now be mixed and repeated
9326 * Database of theorems for FOL, HOL and ZF. New
9327 commands including qed, qed_goal and bind_thm store theorems in the database.
9329 * Simple database queries: return a named theorem (get_thm) or all theorems of
9330 a given theory (thms_of), or find out what theory a theorem was proved in
9333 * Bugs fixed in the inductive definition and datatype packages;
9335 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
9336 and HOL_dup_cs obsolete;
9338 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
9341 * Simpler definition of function space in ZF;
9343 * new results about cardinal and ordinal arithmetic in ZF;
9345 * 'subtype' facility in HOL for introducing new types as subsets of existing
9348 :mode=text:wrap=hard:maxLineLen=72: