1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
10 is called fastforce / fast_force_tac already since Isabelle2011-1.
15 * Discontinued support for Poly/ML 5.2.1, which was the last version
16 without exception positions and advanced ML compiler/toplevel
24 - added an optimisation for equality premises.
25 It is switched on by default, and can be switched off by setting
26 the configuration quickcheck_optimise_equality to false.
28 * The SMT solver Z3 has now by default a restricted set of directly
29 supported features. For the full set of features (div/mod, nonlinear
30 arithmetic, datatypes/records) with potential proof reconstruction
31 failures, enable the configuration option "z3_with_extensions".
32 Minor INCOMPATIBILITY.
36 - Rationalized type encodings ("type_enc" option).
38 New in Isabelle2012 (May 2012)
39 ------------------------------
43 * Prover IDE (PIDE) improvements:
45 - more robust Sledgehammer integration (as before the sledgehammer
46 command-line needs to be typed into the source buffer)
47 - markup for bound variables
48 - markup for types of term variables (displayed as tooltips)
49 - support for user-defined Isar commands within the running session
50 - improved support for Unicode outside original 16bit range
51 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
53 * Forward declaration of outer syntax keywords within the theory
54 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
55 commands to be used in the same theory where defined.
57 * Auxiliary contexts indicate block structure for specifications with
58 additional parameters and assumptions. Such unnamed contexts may be
59 nested within other targets, like 'theory', 'locale', 'class',
60 'instantiation' etc. Results from the local context are generalized
61 accordingly and applied to the enclosing target context. Example:
65 assumes xy: "x = y" and yz: "y = z"
68 lemma my_trans: "x = z" using xy yz by simp
74 The most basic application is to factor-out context elements of
75 several fixes/assumes/shows theorem statements, e.g. see
76 ~~/src/HOL/Isar_Examples/Group_Context.thy
78 Any other local theory specification element works within the "context
79 ... begin ... end" block as well.
81 * Bundled declarations associate attributed fact expressions with a
82 given name in the context. These may be later included in other
83 contexts. This allows to manage context extensions casually, without
84 the logical dependencies of locales and locale interpretation. See
85 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
87 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
88 declaration, and results are standardized before being stored. Thus
89 old-style "standard" after instantiation or composition of facts
90 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
91 indices of schematic variables.
93 * Rule attributes in local theory declarations (e.g. locale or class)
94 are now statically evaluated: the resulting theorem is stored instead
95 of the original expression. INCOMPATIBILITY in rare situations, where
96 the historic accident of dynamic re-evaluation in interpretations
99 * New tutorial "Programming and Proving in Isabelle/HOL"
100 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
101 Structured Isar Proofs" ("isar-overview"), which has been removed. It
102 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
103 Logic" as the recommended beginners tutorial, but does not cover all
104 of the material of that old tutorial.
106 * Updated and extended reference manuals: "isar-ref",
107 "implementation", "system"; reduced remaining material in old "ref"
113 * Command 'definition' no longer exports the foundational "raw_def"
114 into the user context. Minor INCOMPATIBILITY, may use the regular
115 "def" result with attribute "abs_def" to imitate the old version.
117 * Attribute "abs_def" turns an equation of the form "f x y == t" into
118 "f == %x y. t", which ensures that "simp" or "unfold" steps always
119 expand it. This also works for object-logic equality. (Formerly
120 undocumented feature.)
122 * Sort constraints are now propagated in simultaneous statements, just
123 like type constraints. INCOMPATIBILITY in rare situations, where
124 distinct sorts used to be assigned accidentally. For example:
126 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
128 lemma "P (x::'a)" and "Q (y::'a::bar)"
129 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
131 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
132 tolerant against multiple unifiers, as long as the final result is
133 unique. (As before, rules are composed in canonical right-to-left
134 order to accommodate newly introduced premises.)
136 * Renamed some inner syntax categories:
142 Minor INCOMPATIBILITY. Note that in practice "num_const" or
143 "num_position" etc. are mainly used instead (which also include
144 position information via constraints).
146 * Simplified configuration options for syntax ambiguity: see
147 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
148 manual. Minor INCOMPATIBILITY.
150 * Discontinued configuration option "syntax_positions": atomic terms
151 in parse trees are always annotated by position constraints.
153 * Old code generator for SML and its commands 'code_module',
154 'code_library', 'consts_code', 'types_code' have been discontinued.
155 Use commands of the generic code generator instead. INCOMPATIBILITY.
157 * Redundant attribute "code_inline" has been discontinued. Use
158 "code_unfold" instead. INCOMPATIBILITY.
160 * Dropped attribute "code_unfold_post" in favor of the its dual
161 "code_abbrev", which yields a common pattern in definitions like
163 definition [code_abbrev]: "f = t"
167 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
168 instead. INCOMPATIBILITY.
170 * Discontinued old "prems" fact, which used to refer to the accidental
171 collection of foundational premises in the context (already marked as
172 legacy since Isabelle2011).
177 * Type 'a set is now a proper type constructor (just as before
178 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
179 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
180 sets separate, it is often sufficient to rephrase some set S that has
181 been accidentally used as predicates by "%x. x : S", and some
182 predicate P that has been accidentally used as set by "{x. P x}".
183 Corresponding proofs in a first step should be pruned from any
184 tinkering with former theorems mem_def and Collect_def as far as
187 For developments which deliberately mix predicates and sets, a
188 planning step is necessary to determine what should become a predicate
189 and what a set. It can be helpful to carry out that step in
190 Isabelle2011-1 before jumping right into the current release.
192 * Code generation by default implements sets as container type rather
193 than predicates. INCOMPATIBILITY.
195 * New type synonym 'a rel = ('a * 'a) set
197 * The representation of numerals has changed. Datatype "num"
198 represents strictly positive binary numerals, along with functions
199 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
200 positive and negated numeric literals, respectively. See also
201 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
202 user theories may require adaptations as follows:
204 - Theorems with number_ring or number_semiring constraints: These
205 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
207 - Theories defining numeric types: Remove number, number_semiring,
208 and number_ring instances. Defer all theorems about numerals until
209 after classes one and semigroup_add have been instantiated.
211 - Numeral-only simp rules: Replace each rule having a "number_of v"
212 pattern with two copies, one for numeral and one for neg_numeral.
214 - Theorems about subclasses of semiring_1 or ring_1: These classes
215 automatically support numerals now, so more simp rules and
216 simprocs may now apply within the proof.
218 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
219 Redefine using other integer operations.
221 * Transfer: New package intended to generalize the existing
222 "descending" method and related theorem attributes from the Quotient
223 package. (Not all functionality is implemented yet, but future
224 development will focus on Transfer as an eventual replacement for the
225 corresponding parts of the Quotient package.)
227 - transfer_rule attribute: Maintains a collection of transfer rules,
228 which relate constants at two different types. Transfer rules may
229 relate different type instances of the same polymorphic constant,
230 or they may relate an operation on a raw type to a corresponding
231 operation on an abstract type (quotient or subtype). For example:
233 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
234 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
236 - transfer method: Replaces a subgoal on abstract types with an
237 equivalent subgoal on the corresponding raw types. Constants are
238 replaced with corresponding ones according to the transfer rules.
239 Goals are generalized over all free variables by default; this is
240 necessary for variables whose types change, but can be overridden
241 for specific variables with e.g. "transfer fixing: x y z". The
242 variant transfer' method allows replacing a subgoal with one that
243 is logically stronger (rather than equivalent).
245 - relator_eq attribute: Collects identity laws for relators of
246 various type constructors, e.g. "list_all2 (op =) = (op =)". The
247 transfer method uses these lemmas to infer transfer rules for
248 non-polymorphic constants on the fly.
250 - transfer_prover method: Assists with proving a transfer rule for a
251 new constant, provided the constant is defined in terms of other
252 constants that already have transfer rules. It should be applied
253 after unfolding the constant definitions.
255 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
256 from type nat to type int.
258 * Lifting: New package intended to generalize the quotient_definition
259 facility of the Quotient package; designed to work with Transfer.
261 - lift_definition command: Defines operations on an abstract type in
262 terms of a corresponding operation on a representation
263 type. Example syntax:
265 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
268 Users must discharge a respectfulness proof obligation when each
269 constant is defined. (For a type copy, i.e. a typedef with UNIV,
270 the proof is discharged automatically.) The obligation is
271 presented in a user-friendly, readable form; a respectfulness
272 theorem in the standard format and a transfer rule are generated
275 - Integration with code_abstype: For typedefs (e.g. subtypes
276 corresponding to a datatype invariant, such as dlist),
277 lift_definition generates a code certificate theorem and sets up
278 code generation for each constant.
280 - setup_lifting command: Sets up the Lifting package to work with a
281 user-defined type. The user must provide either a quotient theorem
282 or a type_definition theorem. The package configures transfer
283 rules for equality and quantifiers on the type, and sets up the
284 lift_definition command to work with the type.
286 - Usage examples: See Quotient_Examples/Lift_DList.thy,
287 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
288 Word/Word.thy and Library/Float.thy.
292 - The 'quotient_type' command now supports a 'morphisms' option with
293 rep and abs functions, similar to typedef.
295 - 'quotient_type' sets up new types to work with the Lifting and
296 Transfer packages, as with 'setup_lifting'.
298 - The 'quotient_definition' command now requires the user to prove a
299 respectfulness property at the point where the constant is
300 defined, similar to lift_definition; INCOMPATIBILITY.
302 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
303 accordingly, INCOMPATIBILITY.
305 * New diagnostic command 'find_unused_assms' to find potentially
306 superfluous assumptions in theorems using Quickcheck.
310 - Quickcheck returns variable assignments as counterexamples, which
311 allows to reveal the underspecification of functions under test.
312 For example, refuting "hd xs = x", it presents the variable
313 assignment xs = [] and x = a1 as a counterexample, assuming that
314 any property is false whenever "hd []" occurs in it.
316 These counterexample are marked as potentially spurious, as
317 Quickcheck also returns "xs = []" as a counterexample to the
318 obvious theorem "hd xs = hd xs".
320 After finding a potentially spurious counterexample, Quickcheck
321 continues searching for genuine ones.
323 By default, Quickcheck shows potentially spurious and genuine
324 counterexamples. The option "genuine_only" sets quickcheck to only
325 show genuine counterexamples.
327 - The command 'quickcheck_generator' creates random and exhaustive
328 value generators for a given type and operations.
330 It generates values by using the operations as if they were
331 constructors of that type.
333 - Support for multisets.
335 - Added "use_subtype" options.
337 - Added "quickcheck_locale" configuration to specify how to process
338 conjectures in a locale context.
340 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
341 and affecting 'rat' and 'real'.
344 - Integrated more tightly with SPASS, as described in the ITP 2012
345 paper "More SPASS with Isabelle".
346 - Made it try "smt" as a fallback if "metis" fails or times out.
347 - Added support for the following provers: Alt-Ergo (via Why3 and
348 TFF1), iProver, iProver-Eq.
349 - Replaced remote E-SInE with remote Satallax in the default setup.
350 - Sped up the minimizer.
351 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
352 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
353 - Renamed "sound" option to "strict".
355 * Metis: Added possibility to specify lambda translations scheme as a
356 parenthesized argument (e.g., "by (metis (lifting) ...)").
358 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
360 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
362 * New "case_product" attribute to generate a case rule doing multiple
363 case distinctions at the same time. E.g.
365 list.exhaust [case_product nat.exhaust]
367 produces a rule which can be used to perform case distinction on both
370 * New "eventually_elim" method as a generalized variant of the
371 eventually_elim* rules. Supports structured proofs.
373 * Typedef with implicit set definition is considered legacy. Use
374 "typedef (open)" form instead, which will eventually become the
377 * Record: code generation can be switched off manually with
379 declare [[record_coden = false]] -- "default true"
381 * Datatype: type parameters allow explicit sort constraints.
383 * Concrete syntax for case expressions includes constraints for source
384 positions, and thus produces Prover IDE markup for its bindings.
385 INCOMPATIBILITY for old-style syntax translations that augment the
386 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
389 * Clarified attribute "mono_set": pure declaration without modifying
390 the result of the fact expression.
392 * More default pred/set conversions on a couple of relation operations
393 and predicates. Added powers of predicate relations. Consolidation
394 of some relation theorems:
396 converse_def ~> converse_unfold
397 rel_comp_def ~> relcomp_unfold
398 symp_def ~> (modified, use symp_def and sym_def instead)
399 transp_def ~> transp_trans
400 Domain_def ~> Domain_unfold
401 Range_def ~> Domain_converse [symmetric]
403 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
405 See theory "Relation" for examples for making use of pred/set
406 conversions by means of attributes "to_set" and "to_pred".
410 * Renamed facts about the power operation on relations, i.e., relpow
411 to match the constant's name:
413 rel_pow_1 ~> relpow_1
414 rel_pow_0_I ~> relpow_0_I
415 rel_pow_Suc_I ~> relpow_Suc_I
416 rel_pow_Suc_I2 ~> relpow_Suc_I2
417 rel_pow_0_E ~> relpow_0_E
418 rel_pow_Suc_E ~> relpow_Suc_E
419 rel_pow_E ~> relpow_E
420 rel_pow_Suc_D2 ~> relpow_Suc_D2
421 rel_pow_Suc_E2 ~> relpow_Suc_E2
422 rel_pow_Suc_D2' ~> relpow_Suc_D2'
423 rel_pow_E2 ~> relpow_E2
424 rel_pow_add ~> relpow_add
425 rel_pow_commute ~> relpow
426 rel_pow_empty ~> relpow_empty:
427 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
428 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
429 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
430 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
431 rel_pow_fun_conv ~> relpow_fun_conv
432 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
433 rel_pow_finite_bounded ~> relpow_finite_bounded
434 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
435 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
436 single_valued_rel_pow ~> single_valued_relpow
440 * Theory Relation: Consolidated constant name for relation composition
441 and corresponding theorem names:
443 - Renamed constant rel_comp to relcomp.
445 - Dropped abbreviation pred_comp. Use relcompp instead.
449 rel_compI ~> relcompI
450 rel_compEpair ~> relcompEpair
451 rel_compE ~> relcompE
452 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
453 rel_comp_empty1 ~> relcomp_empty1
454 rel_comp_mono ~> relcomp_mono
455 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
456 rel_comp_distrib ~> relcomp_distrib
457 rel_comp_distrib2 ~> relcomp_distrib2
458 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
459 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
460 single_valued_rel_comp ~> single_valued_relcomp
461 rel_comp_def ~> relcomp_unfold
462 converse_rel_comp ~> converse_relcomp
463 pred_compI ~> relcomppI
464 pred_compE ~> relcomppE
465 pred_comp_bot1 ~> relcompp_bot1
466 pred_comp_bot2 ~> relcompp_bot2
467 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
468 pred_comp_mono ~> relcompp_mono
469 pred_comp_distrib ~> relcompp_distrib
470 pred_comp_distrib2 ~> relcompp_distrib2
471 converse_pred_comp ~> converse_relcompp
473 finite_rel_comp ~> finite_relcomp
475 set_rel_comp ~> set_relcomp
479 * Theory Divides: Discontinued redundant theorems about div and mod.
480 INCOMPATIBILITY, use the corresponding generic theorems instead.
482 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
483 zdiv_self ~> div_self
484 zmod_self ~> mod_self
487 zdiv_zmod_equality ~> div_mod_equality2
488 zdiv_zmod_equality2 ~> div_mod_equality
489 zmod_zdiv_trivial ~> mod_div_trivial
490 zdiv_zminus_zminus ~> div_minus_minus
491 zmod_zminus_zminus ~> mod_minus_minus
492 zdiv_zminus2 ~> div_minus_right
493 zmod_zminus2 ~> mod_minus_right
494 zdiv_minus1_right ~> div_minus1_right
495 zmod_minus1_right ~> mod_minus1_right
496 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
497 zmod_zmult1_eq ~> mod_mult_right_eq
498 zpower_zmod ~> power_mod
500 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
501 mod_mult_distrib ~> mult_mod_left
502 mod_mult_distrib2 ~> mult_mod_right
504 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
505 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
507 * Finite_Set.fold now qualified. INCOMPATIBILITY.
509 * Consolidated theorem names concerning fold combinators:
511 inf_INFI_fold_inf ~> inf_INF_fold_inf
512 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
513 INFI_fold_inf ~> INF_fold_inf
514 SUPR_fold_sup ~> SUP_fold_sup
515 union_set ~> union_set_fold
516 minus_set ~> minus_set_fold
517 INFI_set_fold ~> INF_set_fold
518 SUPR_set_fold ~> SUP_set_fold
519 INF_code ~> INF_set_foldr
520 SUP_code ~> SUP_set_foldr
521 foldr.simps ~> foldr.simps (in point-free formulation)
522 foldr_fold_rev ~> foldr_conv_fold
523 foldl_fold ~> foldl_conv_fold
524 foldr_foldr ~> foldr_conv_foldl
525 foldl_foldr ~> foldl_conv_foldr
526 fold_set_remdups ~> fold_set_fold_remdups
527 fold_set ~> fold_set_fold
528 fold1_set ~> fold1_set_fold
532 * Dropped rarely useful theorems concerning fold combinators:
533 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
534 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
535 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
536 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
537 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
538 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
539 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
540 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
541 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
542 unfolding "foldr_conv_fold" and "foldl_conv_fold".
544 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
545 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
546 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
547 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
548 lemmas over fold rather than foldr, or make use of lemmas
549 fold_conv_foldr and fold_rev.
551 * Congruence rules Option.map_cong and Option.bind_cong for recursion
552 through option types.
554 * "Transitive_Closure.ntrancl": bounded transitive closure on
557 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
559 * Theory Int: Discontinued many legacy theorems specific to type int.
560 INCOMPATIBILITY, use the corresponding generic theorems instead.
562 zminus_zminus ~> minus_minus
563 zminus_0 ~> minus_zero
564 zminus_zadd_distrib ~> minus_add_distrib
565 zadd_commute ~> add_commute
566 zadd_assoc ~> add_assoc
567 zadd_left_commute ~> add_left_commute
571 zadd_0_right ~> add_0_right
572 zadd_zminus_inverse2 ~> left_minus
573 zmult_zminus ~> mult_minus_left
574 zmult_commute ~> mult_commute
575 zmult_assoc ~> mult_assoc
576 zadd_zmult_distrib ~> left_distrib
577 zadd_zmult_distrib2 ~> right_distrib
578 zdiff_zmult_distrib ~> left_diff_distrib
579 zdiff_zmult_distrib2 ~> right_diff_distrib
580 zmult_1 ~> mult_1_left
581 zmult_1_right ~> mult_1_right
582 zle_refl ~> order_refl
583 zle_trans ~> order_trans
584 zle_antisym ~> order_antisym
585 zle_linear ~> linorder_linear
586 zless_linear ~> linorder_less_linear
587 zadd_left_mono ~> add_left_mono
588 zadd_strict_right_mono ~> add_strict_right_mono
589 zadd_zless_mono ~> add_less_le_mono
590 int_0_less_1 ~> zero_less_one
591 int_0_neq_1 ~> zero_neq_one
593 zpower_zadd_distrib ~> power_add
594 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
595 zero_le_zpower_abs ~> zero_le_power_abs
597 * Theory Deriv: Renamed
599 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
601 * Theory Library/Multiset: Improved code generation of multisets.
603 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
604 are expressed via type classes again. The special syntax
605 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
606 setsum_set, which is now subsumed by Big_Operators.setsum.
609 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
610 use theory HOL/Library/Nat_Bijection instead.
612 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
613 trees is now inside a type class context. Names of affected
614 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
615 theories working directly with raw red-black trees, adapt the names as
619 bulkload -> rbt_bulkload
620 del_from_left -> rbt_del_from_left
621 del_from_right -> rbt_del_from_right
626 insertw -> rbt_insert_with
627 insert_with_key -> rbt_insert_with_key
628 map_entry -> rbt_map_entry
631 tree_greater -> rbt_greater
632 tree_less -> rbt_less
633 tree_less_symbol -> rbt_less_symbol
635 union_with -> rbt_union_with
636 union_with_key -> rbt_union_with_key
639 balance_left_sorted -> balance_left_rbt_sorted
640 balance_left_tree_greater -> balance_left_rbt_greater
641 balance_left_tree_less -> balance_left_rbt_less
642 balance_right_sorted -> balance_right_rbt_sorted
643 balance_right_tree_greater -> balance_right_rbt_greater
644 balance_right_tree_less -> balance_right_rbt_less
645 balance_sorted -> balance_rbt_sorted
646 balance_tree_greater -> balance_rbt_greater
647 balance_tree_less -> balance_rbt_less
648 bulkload_is_rbt -> rbt_bulkload_is_rbt
649 combine_sorted -> combine_rbt_sorted
650 combine_tree_greater -> combine_rbt_greater
651 combine_tree_less -> combine_rbt_less
652 delete_in_tree -> rbt_delete_in_tree
653 delete_is_rbt -> rbt_delete_is_rbt
654 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
655 del_from_left_tree_less -> rbt_del_from_left_rbt_less
656 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
657 del_from_right_tree_less -> rbt_del_from_right_rbt_less
658 del_in_tree -> rbt_del_in_tree
659 del_inv1_inv2 -> rbt_del_inv1_inv2
660 del_sorted -> rbt_del_rbt_sorted
661 del_tree_greater -> rbt_del_rbt_greater
662 del_tree_less -> rbt_del_rbt_less
663 dom_lookup_Branch -> dom_rbt_lookup_Branch
664 entries_lookup -> entries_rbt_lookup
665 finite_dom_lookup -> finite_dom_rbt_lookup
666 insert_sorted -> rbt_insert_rbt_sorted
667 insertw_is_rbt -> rbt_insertw_is_rbt
668 insertwk_is_rbt -> rbt_insertwk_is_rbt
669 insertwk_sorted -> rbt_insertwk_rbt_sorted
670 insertw_sorted -> rbt_insertw_rbt_sorted
671 ins_sorted -> ins_rbt_sorted
672 ins_tree_greater -> ins_rbt_greater
673 ins_tree_less -> ins_rbt_less
674 is_rbt_sorted -> is_rbt_rbt_sorted
675 lookup_balance -> rbt_lookup_balance
676 lookup_bulkload -> rbt_lookup_rbt_bulkload
677 lookup_delete -> rbt_lookup_rbt_delete
678 lookup_Empty -> rbt_lookup_Empty
679 lookup_from_in_tree -> rbt_lookup_from_in_tree
680 lookup_in_tree -> rbt_lookup_in_tree
681 lookup_ins -> rbt_lookup_ins
682 lookup_insert -> rbt_lookup_rbt_insert
683 lookup_insertw -> rbt_lookup_rbt_insertw
684 lookup_insertwk -> rbt_lookup_rbt_insertwk
685 lookup_keys -> rbt_lookup_keys
686 lookup_map -> rbt_lookup_map
687 lookup_map_entry -> rbt_lookup_rbt_map_entry
688 lookup_tree_greater -> rbt_lookup_rbt_greater
689 lookup_tree_less -> rbt_lookup_rbt_less
690 lookup_union -> rbt_lookup_rbt_union
691 map_entry_color_of -> rbt_map_entry_color_of
692 map_entry_inv1 -> rbt_map_entry_inv1
693 map_entry_inv2 -> rbt_map_entry_inv2
694 map_entry_is_rbt -> rbt_map_entry_is_rbt
695 map_entry_sorted -> rbt_map_entry_rbt_sorted
696 map_entry_tree_greater -> rbt_map_entry_rbt_greater
697 map_entry_tree_less -> rbt_map_entry_rbt_less
698 map_tree_greater -> map_rbt_greater
699 map_tree_less -> map_rbt_less
700 map_sorted -> map_rbt_sorted
701 paint_sorted -> paint_rbt_sorted
702 paint_lookup -> paint_rbt_lookup
703 paint_tree_greater -> paint_rbt_greater
704 paint_tree_less -> paint_rbt_less
705 sorted_entries -> rbt_sorted_entries
706 tree_greater_eq_trans -> rbt_greater_eq_trans
707 tree_greater_nit -> rbt_greater_nit
708 tree_greater_prop -> rbt_greater_prop
709 tree_greater_simps -> rbt_greater_simps
710 tree_greater_trans -> rbt_greater_trans
711 tree_less_eq_trans -> rbt_less_eq_trans
712 tree_less_nit -> rbt_less_nit
713 tree_less_prop -> rbt_less_prop
714 tree_less_simps -> rbt_less_simps
715 tree_less_trans -> rbt_less_trans
716 tree_ord_props -> rbt_ord_props
717 union_Branch -> rbt_union_Branch
718 union_is_rbt -> rbt_union_is_rbt
719 unionw_is_rbt -> rbt_unionw_is_rbt
720 unionwk_is_rbt -> rbt_unionwk_is_rbt
721 unionwk_sorted -> rbt_unionwk_rbt_sorted
723 * Theory HOL/Library/Float: Floating point numbers are now defined as
724 a subset of the real numbers. All operations are defined using the
725 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
732 round_down -> float_round_down
733 round_up -> float_round_up
737 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
740 abs_float_def -> Float.compute_float_abs
741 bitlen_ge0 -> bitlen_nonneg
742 bitlen.simps -> Float.compute_bitlen
743 float_components -> Float_mantissa_exponent
744 float_divl.simps -> Float.compute_float_divl
745 float_divr.simps -> Float.compute_float_divr
746 float_eq_odd -> mult_powr_eq_mult_powr_iff
747 float_power -> real_of_float_power
748 lapprox_posrat_def -> Float.compute_lapprox_posrat
749 lapprox_rat.simps -> Float.compute_lapprox_rat
750 le_float_def' -> Float.compute_float_le
751 le_float_def -> less_eq_float.rep_eq
752 less_float_def' -> Float.compute_float_less
753 less_float_def -> less_float.rep_eq
754 normfloat_def -> Float.compute_normfloat
755 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
756 normfloat -> normfloat_def
757 normfloat_unique -> use normfloat_def
758 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
759 one_float_def -> Float.compute_float_one
760 plus_float_def -> Float.compute_float_plus
761 rapprox_posrat_def -> Float.compute_rapprox_posrat
762 rapprox_rat.simps -> Float.compute_rapprox_rat
763 real_of_float_0 -> zero_float.rep_eq
764 real_of_float_1 -> one_float.rep_eq
765 real_of_float_abs -> abs_float.rep_eq
766 real_of_float_add -> plus_float.rep_eq
767 real_of_float_minus -> uminus_float.rep_eq
768 real_of_float_mult -> times_float.rep_eq
769 real_of_float_simp -> Float.rep_eq
770 real_of_float_sub -> minus_float.rep_eq
771 round_down.simps -> Float.compute_float_round_down
772 round_up.simps -> Float.compute_float_round_up
773 times_float_def -> Float.compute_float_times
774 uminus_float_def -> Float.compute_float_uminus
775 zero_float_def -> Float.compute_float_zero
777 Lemmas not necessary anymore, use the transfer method:
778 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
779 float_divr, float_le_simp, float_less1_mantissa_bound,
780 float_less_simp, float_less_zero, float_le_zero,
781 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
782 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
783 lapprox_rat_bottom, normalized_float, rapprox_posrat,
784 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
785 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
786 round_up, zero_le_float, zero_less_float
788 * New theory HOL/Library/DAList provides an abstract type for
789 association lists with distinct keys.
791 * Session HOL/IMP: Added new theory of abstract interpretation of
794 * Session HOL-Import: Re-implementation from scratch is faster,
795 simpler, and more scalable. Requires a proof bundle, which is
796 available as an external component. Discontinued old (and mostly
797 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
799 * Session HOL-Word: Discontinued many redundant theorems specific to
800 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
803 word_sub_alt ~> word_sub_wi
804 word_add_alt ~> word_add_def
805 word_mult_alt ~> word_mult_def
806 word_minus_alt ~> word_minus_def
807 word_0_alt ~> word_0_wi
808 word_1_alt ~> word_1_wi
809 word_add_0 ~> add_0_left
810 word_add_0_right ~> add_0_right
811 word_mult_1 ~> mult_1_left
812 word_mult_1_right ~> mult_1_right
813 word_add_commute ~> add_commute
814 word_add_assoc ~> add_assoc
815 word_add_left_commute ~> add_left_commute
816 word_mult_commute ~> mult_commute
817 word_mult_assoc ~> mult_assoc
818 word_mult_left_commute ~> mult_left_commute
819 word_left_distrib ~> left_distrib
820 word_right_distrib ~> right_distrib
821 word_left_minus ~> left_minus
822 word_diff_0_right ~> diff_0_right
823 word_diff_self ~> diff_self
824 word_sub_def ~> diff_minus
825 word_diff_minus ~> diff_minus
826 word_add_ac ~> add_ac
827 word_mult_ac ~> mult_ac
828 word_plus_ac0 ~> add_0_left add_0_right add_ac
829 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
830 word_order_trans ~> order_trans
831 word_order_refl ~> order_refl
832 word_order_antisym ~> order_antisym
833 word_order_linear ~> linorder_linear
834 lenw1_zero_neq_one ~> zero_neq_one
835 word_number_of_eq ~> number_of_eq
836 word_of_int_add_hom ~> wi_hom_add
837 word_of_int_sub_hom ~> wi_hom_sub
838 word_of_int_mult_hom ~> wi_hom_mult
839 word_of_int_minus_hom ~> wi_hom_neg
840 word_of_int_succ_hom ~> wi_hom_succ
841 word_of_int_pred_hom ~> wi_hom_pred
842 word_of_int_0_hom ~> word_0_wi
843 word_of_int_1_hom ~> word_1_wi
845 * Session HOL-Word: New proof method "word_bitwise" for splitting
846 machine word equalities and inequalities into logical circuits,
847 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
848 multiplication, shifting by constants, bitwise operators and numeric
849 constants. Requires fixed-length word types, not 'a word. Solves
850 many standard word identities outright and converts more into first
851 order problems amenable to blast or similar. See also examples in
852 HOL/Word/Examples/WordExamples.thy.
854 * Session HOL-Probability: Introduced the type "'a measure" to
855 represent measures, this replaces the records 'a algebra and 'a
856 measure_space. The locales based on subset_class now have two
857 locale-parameters the space \<Omega> and the set of measurable sets M.
858 The product of probability spaces uses now the same constant as the
859 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
860 measure". Most constants are defined now outside of locales and gain
861 an additional parameter, like null_sets, almost_eventually or \<mu>'.
862 Measure space constructions for distributions and densities now got
863 their own constants distr and density. Instead of using locales to
864 describe measure spaces with a finite space, the measure count_space
865 and point_measure is introduced. INCOMPATIBILITY.
869 finite_measure.\<mu>' -> measure
870 product_algebra_generator -> prod_algebra
871 product_prob_space.emb -> prod_emb
872 product_prob_space.infprod_algebra -> PiM
875 completeable_measure_space
878 finite_product_finite_prob_space
879 finite_product_sigma_algebra
882 pair_finite_prob_space
883 pair_finite_sigma_algebra
886 product_sigma_algebra
890 distribution -> use distr measure, or distributed predicate
892 joint_distribution -> use distr measure, or distributed predicate
893 pair_measure_generator
894 product_prob_space.infprod_algebra -> use PiM
897 Replacement theorems:
898 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
899 finite_measure.empty_measure -> measure_empty
900 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
901 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
902 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
903 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
904 finite_measure.finite_measure -> finite_measure.emeasure_finite
905 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
906 finite_measure.positive_measure' -> measure_nonneg
907 finite_measure.real_measure -> finite_measure.emeasure_real
908 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
909 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
910 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
911 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
912 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
913 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
914 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
915 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
916 information_space.entropy_commute -> information_space.entropy_commute_simple
917 information_space.entropy_eq -> information_space.entropy_simple_distributed
918 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
919 information_space.entropy_positive -> information_space.entropy_nonneg_simple
920 information_space.entropy_uniform_max -> information_space.entropy_uniform
921 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
922 information_space.KL_eq_0 -> information_space.KL_same_eq_0
923 information_space.KL_ge_0 -> information_space.KL_nonneg
924 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
925 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
926 Int_stable_cuboids -> Int_stable_atLeastAtMost
927 Int_stable_product_algebra_generator -> positive_integral
928 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
929 measure_space.additive -> emeasure_additive
930 measure_space.AE_iff_null_set -> AE_iff_null
931 measure_space.almost_everywhere_def -> eventually_ae_filter
932 measure_space.almost_everywhere_vimage -> AE_distrD
933 measure_space.continuity_from_above -> INF_emeasure_decseq
934 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
935 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
936 measure_space.continuity_from_below -> SUP_emeasure_incseq
937 measure_space_density -> emeasure_density
938 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
939 measure_space.integrable_vimage -> integrable_distr
940 measure_space.integral_translated_density -> integral_density
941 measure_space.integral_vimage -> integral_distr
942 measure_space.measure_additive -> plus_emeasure
943 measure_space.measure_compl -> emeasure_compl
944 measure_space.measure_countable_increasing -> emeasure_countable_increasing
945 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
946 measure_space.measure_decseq -> decseq_emeasure
947 measure_space.measure_Diff -> emeasure_Diff
948 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
949 measure_space.measure_eq_0 -> emeasure_eq_0
950 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
951 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
952 measure_space.measure_incseq -> incseq_emeasure
953 measure_space.measure_insert -> emeasure_insert
954 measure_space.measure_mono -> emeasure_mono
955 measure_space.measure_not_negative -> emeasure_not_MInf
956 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
957 measure_space.measure_setsum -> setsum_emeasure
958 measure_space.measure_setsum_split -> setsum_emeasure_cover
959 measure_space.measure_space_vimage -> emeasure_distr
960 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
961 measure_space.measure_subadditive -> subadditive
962 measure_space.measure_top -> emeasure_space
963 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
964 measure_space.measure_Un_null_set -> emeasure_Un_null_set
965 measure_space.positive_integral_translated_density -> positive_integral_density
966 measure_space.positive_integral_vimage -> positive_integral_distr
967 measure_space.real_continuity_from_above -> Lim_measure_decseq
968 measure_space.real_continuity_from_below -> Lim_measure_incseq
969 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
970 measure_space.real_measure_Diff -> measure_Diff
971 measure_space.real_measure_finite_Union -> measure_finite_Union
972 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
973 measure_space.real_measure_subadditive -> measure_subadditive
974 measure_space.real_measure_Union -> measure_Union
975 measure_space.real_measure_UNION -> measure_UNION
976 measure_space.simple_function_vimage -> simple_function_comp
977 measure_space.simple_integral_vimage -> simple_integral_distr
978 measure_space.simple_integral_vimage -> simple_integral_distr
979 measure_unique_Int_stable -> measure_eqI_generator_eq
980 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
981 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
982 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
983 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
984 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
985 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
986 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
987 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
988 pair_sigma_algebra.sets_swap -> sets_pair_swap
989 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
990 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
991 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
992 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
993 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
994 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
995 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
996 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
997 prob_space.measure_space_1 -> prob_space.emeasure_space_1
998 prob_space.prob_space_vimage -> prob_space_distr
999 prob_space.random_variable_restrict -> measurable_restrict
1000 prob_space_unique_Int_stable -> measure_eqI_prob_space
1001 product_algebraE -> prod_algebraE_all
1002 product_algebra_generator_der -> prod_algebra_eq_finite
1003 product_algebra_generator_into_space -> prod_algebra_sets_into_space
1004 product_algebraI -> sets_PiM_I_finite
1005 product_measure_exists -> product_sigma_finite.sigma_finite
1006 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
1007 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
1008 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
1009 product_prob_space.measurable_component -> measurable_component_singleton
1010 product_prob_space.measurable_emb -> measurable_prod_emb
1011 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
1012 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
1013 product_prob_space.measure_emb -> emeasure_prod_emb
1014 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
1015 product_sigma_algebra.product_algebra_into_space -> space_closed
1016 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
1017 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
1018 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
1019 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
1020 sets_product_algebra -> sets_PiM
1021 sigma_algebra.measurable_sigma -> measurable_measure_of
1022 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
1023 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
1024 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
1025 space_product_algebra -> space_PiM
1027 * Session HOL-TPTP: support to parse and import TPTP problems (all
1028 languages) into Isabelle/HOL.
1033 * New "case_product" attribute (see HOL).
1038 * Greater support for structured proofs involving induction or case
1041 * Much greater use of mathematical symbols.
1043 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1048 * Antiquotation @{keyword "name"} produces a parser for outer syntax
1049 from a minor keyword introduced via theory header declaration.
1051 * Antiquotation @{command_spec "name"} produces the
1052 Outer_Syntax.command_spec from a major keyword introduced via theory
1053 header declaration; it can be passed to Outer_Syntax.command etc.
1055 * Local_Theory.define no longer hard-wires default theorem name
1056 "foo_def", but retains the binding as given. If that is Binding.empty
1057 / Attrib.empty_binding, the result is not registered as user-level
1058 fact. The Local_Theory.define_internal variant allows to specify a
1059 non-empty name (used for the foundation in the background theory),
1060 while omitting the fact binding in the user-context. Potential
1061 INCOMPATIBILITY for derived definitional packages: need to specify
1062 naming policy for primitive definitions more explicitly.
1064 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
1065 conformance with similar operations in structure Term and Logic.
1067 * Antiquotation @{attributes [...]} embeds attribute source
1068 representation into the ML text, which is particularly useful with
1069 declarations like Local_Theory.note.
1071 * Structure Proof_Context follows standard naming scheme. Old
1072 ProofContext has been discontinued. INCOMPATIBILITY.
1074 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
1075 change of semantics: update is applied to auxiliary local theory
1078 * Modernized some old-style infix operations:
1080 addeqcongs ~> Simplifier.add_eqcong
1081 deleqcongs ~> Simplifier.del_eqcong
1082 addcongs ~> Simplifier.add_cong
1083 delcongs ~> Simplifier.del_cong
1084 setmksimps ~> Simplifier.set_mksimps
1085 setmkcong ~> Simplifier.set_mkcong
1086 setmksym ~> Simplifier.set_mksym
1087 setmkeqTrue ~> Simplifier.set_mkeqTrue
1088 settermless ~> Simplifier.set_termless
1089 setsubgoaler ~> Simplifier.set_subgoaler
1090 addsplits ~> Splitter.add_split
1091 delsplits ~> Splitter.del_split
1096 * USER_HOME settings variable points to cross-platform user home
1097 directory, which coincides with HOME on POSIX systems only. Likewise,
1098 the Isabelle path specification "~" now expands to $USER_HOME, instead
1099 of former $HOME. A different default for USER_HOME may be set
1100 explicitly in shell environment, before Isabelle settings are
1101 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
1102 the generic user home was intended.
1104 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
1105 notation, which is useful for the jEdit file browser, for example.
1107 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
1112 New in Isabelle2011-1 (October 2011)
1113 ------------------------------------
1117 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
1118 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
1120 - Management of multiple theory files directly from the editor
1121 buffer store -- bypassing the file-system (no requirement to save
1122 files for checking).
1124 - Markup of formal entities within the text buffer, with semantic
1125 highlighting, tooltips and hyperlinks to jump to defining source
1128 - Improved text rendering, with sub/superscripts in the source
1129 buffer (including support for copy/paste wrt. output panel, HTML
1130 theory output and other non-Isabelle text boxes).
1132 - Refined scheduling of proof checking and printing of results,
1133 based on interactive editor view. (Note: jEdit folding and
1134 narrowing allows to restrict buffer perspectives explicitly.)
1136 - Reduced CPU performance requirements, usable on machines with few
1139 - Reduced memory requirements due to pruning of unused document
1140 versions (garbage collection).
1142 See also ~~/src/Tools/jEdit/README.html for further information,
1143 including some remaining limitations.
1145 * Theory loader: source files are exclusively located via the master
1146 directory of each theory node (where the .thy file itself resides).
1147 The global load path (such as src/HOL/Library) has been discontinued.
1148 Note that the path element ~~ may be used to reference theories in the
1149 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
1152 * Theory loader: source files are identified by content via SHA1
1153 digests. Discontinued former path/modtime identification and optional
1154 ISABELLE_FILE_IDENT plugin scripts.
1156 * Parallelization of nested Isar proofs is subject to
1157 Goal.parallel_proofs_threshold (default 100). See also isabelle
1160 * Name space: former unsynchronized references are now proper
1161 configuration options, with more conventional names:
1163 long_names ~> names_long
1164 short_names ~> names_short
1165 unique_names ~> names_unique
1167 Minor INCOMPATIBILITY, need to declare options in context like this:
1169 declare [[names_unique = false]]
1171 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
1172 that the result needs to be unique, which means fact specifications
1173 may have to be refined after enriching a proof context.
1175 * Attribute "case_names" has been refined: the assumptions in each case
1176 can be named now by following the case name with [name1 name2 ...].
1178 * Isabelle/Isar reference manual has been updated and extended:
1179 - "Synopsis" provides a catalog of main Isar language concepts.
1180 - Formal references in syntax diagrams, via @{rail} antiquotation.
1181 - Updated material from classic "ref" manual, notably about
1182 "Classical Reasoner".
1187 * Class bot and top require underlying partial order rather than
1188 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
1190 * Class complete_lattice: generalized a couple of lemmas from sets;
1191 generalized theorems INF_cong and SUP_cong. New type classes for
1192 complete boolean algebras and complete linear orders. Lemmas
1193 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
1194 class complete_linorder.
1196 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
1197 Sup_fun_def, Inf_apply, Sup_apply.
1199 Removed redundant lemmas (the right hand side gives hints how to
1200 replace them for (metis ...), or (simp only: ...) proofs):
1202 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
1203 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
1204 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
1205 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
1206 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
1207 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
1208 Inter_def ~> INF_def, image_def
1209 Union_def ~> SUP_def, image_def
1210 INT_eq ~> INF_def, and image_def
1211 UN_eq ~> SUP_def, and image_def
1212 INF_subset ~> INF_superset_mono [OF _ order_refl]
1214 More consistent and comprehensive names:
1216 INTER_eq_Inter_image ~> INF_def
1217 UNION_eq_Union_image ~> SUP_def
1220 INF_leI ~> INF_lower
1221 INF_leI2 ~> INF_lower2
1222 le_INFI ~> INF_greatest
1223 le_SUPI ~> SUP_upper
1224 le_SUPI2 ~> SUP_upper2
1225 SUP_leI ~> SUP_least
1226 INFI_bool_eq ~> INF_bool_eq
1227 SUPR_bool_eq ~> SUP_bool_eq
1228 INFI_apply ~> INF_apply
1229 SUPR_apply ~> SUP_apply
1230 INTER_def ~> INTER_eq
1231 UNION_def ~> UNION_eq
1235 * Renamed theory Complete_Lattice to Complete_Lattices.
1238 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
1239 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
1240 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
1241 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
1243 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
1244 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
1245 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
1248 * Added syntactic classes "inf" and "sup" for the respective
1249 constants. INCOMPATIBILITY: Changes in the argument order of the
1250 (mostly internal) locale predicates for some derived classes.
1252 * Theorem collections ball_simps and bex_simps do not contain theorems
1253 referring to UNION any longer; these have been moved to collection
1254 UN_ball_bex_simps. INCOMPATIBILITY.
1256 * Theory Archimedean_Field: floor now is defined as parameter of a
1257 separate type class floor_ceiling.
1259 * Theory Finite_Set: more coherent development of fold_set locales:
1261 locale fun_left_comm ~> locale comp_fun_commute
1262 locale fun_left_comm_idem ~> locale comp_fun_idem
1264 Both use point-free characterization; interpretation proofs may need
1265 adjustment. INCOMPATIBILITY.
1267 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
1268 accordance with standard mathematical terminology. INCOMPATIBILITY.
1270 * Theory Complex_Main: The locale interpretations for the
1271 bounded_linear and bounded_bilinear locales have been removed, in
1272 order to reduce the number of duplicate lemmas. Users must use the
1273 original names for distributivity theorems, potential INCOMPATIBILITY.
1275 divide.add ~> add_divide_distrib
1276 divide.diff ~> diff_divide_distrib
1277 divide.setsum ~> setsum_divide_distrib
1278 mult.add_right ~> right_distrib
1279 mult.diff_right ~> right_diff_distrib
1280 mult_right.setsum ~> setsum_right_distrib
1281 mult_left.diff ~> left_diff_distrib
1283 * Theory Complex_Main: Several redundant theorems have been removed or
1284 replaced by more general versions. INCOMPATIBILITY.
1286 real_diff_def ~> minus_real_def
1287 real_divide_def ~> divide_real_def
1288 real_less_def ~> less_le
1289 real_abs_def ~> abs_real_def
1290 real_sgn_def ~> sgn_real_def
1291 real_mult_commute ~> mult_commute
1292 real_mult_assoc ~> mult_assoc
1293 real_mult_1 ~> mult_1_left
1294 real_add_mult_distrib ~> left_distrib
1295 real_zero_not_eq_one ~> zero_neq_one
1296 real_mult_inverse_left ~> left_inverse
1297 INVERSE_ZERO ~> inverse_zero
1298 real_le_refl ~> order_refl
1299 real_le_antisym ~> order_antisym
1300 real_le_trans ~> order_trans
1301 real_le_linear ~> linear
1302 real_le_eq_diff ~> le_iff_diff_le_0
1303 real_add_left_mono ~> add_left_mono
1304 real_mult_order ~> mult_pos_pos
1305 real_mult_less_mono2 ~> mult_strict_left_mono
1306 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
1307 real_0_le_divide_iff ~> zero_le_divide_iff
1308 realpow_two_disj ~> power2_eq_iff
1309 real_squared_diff_one_factored ~> square_diff_one_factored
1310 realpow_two_diff ~> square_diff_square_factored
1311 reals_complete2 ~> complete_real
1312 real_sum_squared_expand ~> power2_sum
1313 exp_ln_eq ~> ln_unique
1315 expi_zero ~> exp_zero
1316 lemma_DERIV_subst ~> DERIV_cong
1317 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
1318 LIMSEQ_const ~> tendsto_const
1319 LIMSEQ_norm ~> tendsto_norm
1320 LIMSEQ_add ~> tendsto_add
1321 LIMSEQ_minus ~> tendsto_minus
1322 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
1323 LIMSEQ_diff ~> tendsto_diff
1324 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
1325 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
1326 LIMSEQ_mult ~> tendsto_mult
1327 LIMSEQ_inverse ~> tendsto_inverse
1328 LIMSEQ_divide ~> tendsto_divide
1329 LIMSEQ_pow ~> tendsto_power
1330 LIMSEQ_setsum ~> tendsto_setsum
1331 LIMSEQ_setprod ~> tendsto_setprod
1332 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
1333 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
1334 LIMSEQ_imp_rabs ~> tendsto_rabs
1335 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
1336 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
1337 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
1338 LIMSEQ_Complex ~> tendsto_Complex
1339 LIM_ident ~> tendsto_ident_at
1340 LIM_const ~> tendsto_const
1341 LIM_add ~> tendsto_add
1342 LIM_add_zero ~> tendsto_add_zero
1343 LIM_minus ~> tendsto_minus
1344 LIM_diff ~> tendsto_diff
1345 LIM_norm ~> tendsto_norm
1346 LIM_norm_zero ~> tendsto_norm_zero
1347 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
1348 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
1349 LIM_rabs ~> tendsto_rabs
1350 LIM_rabs_zero ~> tendsto_rabs_zero
1351 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
1352 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
1353 LIM_compose ~> tendsto_compose
1354 LIM_mult ~> tendsto_mult
1355 LIM_scaleR ~> tendsto_scaleR
1356 LIM_of_real ~> tendsto_of_real
1357 LIM_power ~> tendsto_power
1358 LIM_inverse ~> tendsto_inverse
1359 LIM_sgn ~> tendsto_sgn
1360 isCont_LIM_compose ~> isCont_tendsto_compose
1361 bounded_linear.LIM ~> bounded_linear.tendsto
1362 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
1363 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
1364 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
1365 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
1366 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
1367 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
1369 * Theory Complex_Main: The definition of infinite series was
1370 generalized. Now it is defined on the type class {topological_space,
1371 comm_monoid_add}. Hence it is useable also for extended real numbers.
1373 * Theory Complex_Main: The complex exponential function "expi" is now
1374 a type-constrained abbreviation for "exp :: complex => complex"; thus
1375 several polymorphic lemmas about "exp" are now applicable to "expi".
1379 - Theory Library/Code_Char_ord provides native ordering of
1380 characters in the target language.
1382 - Commands code_module and code_library are legacy, use export_code
1385 - Method "evaluation" is legacy, use method "eval" instead.
1387 - Legacy evaluator "SML" is deactivated by default. May be
1388 reactivated by the following theory command:
1390 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
1392 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
1394 * New proof method "induction" that gives induction hypotheses the
1395 name "IH", thus distinguishing them from further hypotheses that come
1396 from rule induction. The latter are still called "hyps". Method
1397 "induction" is a thin wrapper around "induct" and follows the same
1400 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
1401 still available as a legacy feature for some time.
1404 - Added "need" and "total_consts" options.
1405 - Reintroduced "show_skolems" option by popular demand.
1406 - Renamed attribute: nitpick_def ~> nitpick_unfold.
1410 - Use quasi-sound (and efficient) translations by default.
1411 - Added support for the following provers: E-ToFoF, LEO-II,
1412 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
1413 - Automatically preplay and minimize proofs before showing them if
1414 this can be done within reasonable time.
1415 - sledgehammer available_provers ~> sledgehammer supported_provers.
1417 - Added "preplay_timeout", "slicing", "type_enc", "sound",
1418 "max_mono_iters", and "max_new_mono_instances" options.
1419 - Removed "explicit_apply" and "full_types" options as well as "Full
1420 Types" Proof General menu item. INCOMPATIBILITY.
1423 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
1424 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
1428 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
1429 "elim:" options. INCOMPATIBILITY.
1430 - Introduced 'try' that not only runs 'try_methods' but also
1431 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
1434 - Added "eval" option to evaluate terms for the found counterexample
1435 (currently only supported by the default (exhaustive) tester).
1436 - Added post-processing of terms to obtain readable counterexamples
1437 (currently only supported by the default (exhaustive) tester).
1438 - New counterexample generator quickcheck[narrowing] enables
1439 narrowing-based testing. Requires the Glasgow Haskell compiler
1440 with its installation location defined in the Isabelle settings
1441 environment as ISABELLE_GHC.
1442 - Removed quickcheck tester "SML" based on the SML code generator
1443 (formly in HOL/Library).
1445 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
1446 use 'partial_function' instead.
1448 * Theory Library/Extended_Reals replaces now the positive extended
1449 reals found in probability theory. This file is extended by
1450 Multivariate_Analysis/Extended_Real_Limits.
1452 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
1453 from where it must be imported explicitly if it is really required.
1456 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
1457 been moved here. INCOMPATIBILITY.
1459 * Theory Library/Saturated provides type of numbers with saturated
1462 * Theory Library/Product_Lattice defines a pointwise ordering for the
1463 product type 'a * 'b, and provides instance proofs for various order
1464 and lattice type classes.
1466 * Theory Library/Countable now provides the "countable_datatype" proof
1467 method for proving "countable" class instances for datatypes.
1469 * Theory Library/Cset_Monad allows do notation for computable sets
1470 (cset) via the generic monad ad-hoc overloading facility.
1472 * Library: Theories of common data structures are split into theories
1473 for implementation, an invariant-ensuring type, and connection to an
1474 abstract type. INCOMPATIBILITY.
1476 - RBT is split into RBT and RBT_Mapping.
1477 - AssocList is split and renamed into AList and AList_Mapping.
1478 - DList is split into DList_Impl, DList, and DList_Cset.
1479 - Cset is split into Cset and List_Cset.
1481 * Theory Library/Nat_Infinity has been renamed to
1482 Library/Extended_Nat, with name changes of the following types and
1485 type inat ~> type enat
1487 Infty ~> infinity (overloaded)
1491 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
1492 been renamed accordingly. INCOMPATIBILITY.
1494 * Session Multivariate_Analysis: The euclidean_space type class now
1495 fixes a constant "Basis :: 'a set" consisting of the standard
1496 orthonormal basis for the type. Users now have the option of
1497 quantifying over this set instead of using the "basis" function, e.g.
1498 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
1500 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
1501 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
1502 "Cart_nth" and "Cart_lambda" have been respectively renamed to
1503 "vec_nth" and "vec_lambda"; theorems mentioning those names have
1504 changed to match. Definition theorems for overloaded constants now use
1505 the standard "foo_vec_def" naming scheme. A few other theorems have
1506 been renamed as follows (INCOMPATIBILITY):
1508 Cart_eq ~> vec_eq_iff
1509 dist_nth_le_cart ~> dist_vec_nth_le
1510 tendsto_vector ~> vec_tendstoI
1511 Cauchy_vector ~> vec_CauchyI
1513 * Session Multivariate_Analysis: Several duplicate theorems have been
1514 removed, and other theorems have been renamed or replaced with more
1515 general versions. INCOMPATIBILITY.
1517 finite_choice ~> finite_set_choice
1518 eventually_conjI ~> eventually_conj
1519 eventually_and ~> eventually_conj_iff
1520 eventually_false ~> eventually_False
1521 setsum_norm ~> norm_setsum
1522 Lim_sequentially ~> LIMSEQ_def
1523 Lim_ident_at ~> LIM_ident
1524 Lim_const ~> tendsto_const
1525 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
1526 Lim_neg ~> tendsto_minus
1527 Lim_add ~> tendsto_add
1528 Lim_sub ~> tendsto_diff
1529 Lim_mul ~> tendsto_scaleR
1530 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
1531 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
1532 Lim_linear ~> bounded_linear.tendsto
1533 Lim_component ~> tendsto_euclidean_component
1534 Lim_component_cart ~> tendsto_vec_nth
1535 Lim_inner ~> tendsto_inner [OF tendsto_const]
1536 dot_lsum ~> inner_setsum_left
1537 dot_rsum ~> inner_setsum_right
1538 continuous_cmul ~> continuous_scaleR [OF continuous_const]
1539 continuous_neg ~> continuous_minus
1540 continuous_sub ~> continuous_diff
1541 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
1542 continuous_mul ~> continuous_scaleR
1543 continuous_inv ~> continuous_inverse
1544 continuous_at_within_inv ~> continuous_at_within_inverse
1545 continuous_at_inv ~> continuous_at_inverse
1546 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
1547 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
1548 continuous_at_component ~> continuous_component [OF continuous_at_id]
1549 continuous_on_neg ~> continuous_on_minus
1550 continuous_on_sub ~> continuous_on_diff
1551 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
1552 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
1553 continuous_on_mul ~> continuous_on_scaleR
1554 continuous_on_mul_real ~> continuous_on_mult
1555 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
1556 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
1557 continuous_on_inverse ~> continuous_on_inv
1558 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
1559 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
1560 subset_interior ~> interior_mono
1561 subset_closure ~> closure_mono
1562 closure_univ ~> closure_UNIV
1563 real_arch_lt ~> reals_Archimedean2
1564 real_arch ~> reals_Archimedean3
1565 real_abs_norm ~> abs_norm_cancel
1566 real_abs_sub_norm ~> norm_triangle_ineq3
1567 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
1569 * Session HOL-Probability:
1570 - Caratheodory's extension lemma is now proved for ring_of_sets.
1571 - Infinite products of probability measures are now available.
1572 - Sigma closure is independent, if the generator is independent
1573 - Use extended reals instead of positive extended
1574 reals. INCOMPATIBILITY.
1576 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
1578 expand_fun_below ~> fun_below_iff
1579 below_fun_ext ~> fun_belowI
1580 expand_cfun_eq ~> cfun_eq_iff
1581 ext_cfun ~> cfun_eqI
1582 expand_cfun_below ~> cfun_below_iff
1583 below_cfun_ext ~> cfun_belowI
1584 monofun_fun_fun ~> fun_belowD
1585 monofun_fun_arg ~> monofunE
1586 monofun_lub_fun ~> adm_monofun [THEN admD]
1587 cont_lub_fun ~> adm_cont [THEN admD]
1588 cont2cont_Rep_CFun ~> cont2cont_APP
1589 cont_Rep_CFun_app ~> cont_APP_app
1590 cont_Rep_CFun_app_app ~> cont_APP_app_app
1591 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
1592 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
1593 contlub_cfun ~> lub_APP [symmetric]
1594 contlub_LAM ~> lub_LAM [symmetric]
1597 lift_distinct1 ~> lift.distinct(1)
1598 lift_distinct2 ~> lift.distinct(2)
1599 Def_not_UU ~> lift.distinct(2)
1600 Def_inject ~> lift.inject
1601 below_UU_iff ~> below_bottom_iff
1602 eq_UU_iff ~> eq_bottom_iff
1605 *** Document preparation ***
1607 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
1608 isar-ref manual, both for description and actual application of the
1611 * Antiquotation @{value} evaluates the given term and presents its
1614 * Antiquotations: term style "isub" provides ad-hoc conversion of
1615 variables x1, y23 into subscripted form x\<^isub>1,
1616 y\<^isub>2\<^isub>3.
1618 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
1619 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
1621 * Localized \isabellestyle switch can be used within blocks or groups
1624 \isabellestyle{it} %preferred default
1625 {\isabellestylett @{text "typewriter stuff"}}
1627 * Discontinued special treatment of hard tabulators. Implicit
1628 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
1634 * The inner syntax of sort/type/term/prop supports inlined YXML
1635 representations within quoted string tokens. By encoding logical
1636 entities via Term_XML (in ML or Scala) concrete syntax can be
1637 bypassed, which is particularly useful for producing bits of text
1638 under external program control.
1640 * Antiquotations for ML and document preparation are managed as theory
1641 data, which requires explicit setup.
1643 * Isabelle_Process.is_active allows tools to check if the official
1644 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
1645 (better known as Proof General).
1647 * Structure Proof_Context follows standard naming scheme. Old
1648 ProofContext is still available for some time as legacy alias.
1650 * Structure Timing provides various operations for timing; supersedes
1651 former start_timing/end_timing etc.
1653 * Path.print is the official way to show file-system paths to users
1654 (including quotes etc.).
1656 * Inner syntax: identifiers in parse trees of generic categories
1657 "logic", "aprop", "idt" etc. carry position information (disguised as
1658 type constraints). Occasional INCOMPATIBILITY with non-compliant
1659 translations that choke on unexpected type constraints. Positions can
1660 be stripped in ML translations via Syntax.strip_positions /
1661 Syntax.strip_positions_ast, or via the syntax constant
1662 "_strip_positions" within parse trees. As last resort, positions can
1663 be disabled via the configuration option Syntax.positions, which is
1664 called "syntax_positions" in Isar attribute syntax.
1666 * Discontinued special status of various ML structures that contribute
1667 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
1668 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
1669 refer directly to Ast.Constant, Lexicon.is_identifier,
1670 Syntax_Trans.mk_binder_tr etc.
1672 * Typed print translation: discontinued show_sorts argument, which is
1673 already available via context of "advanced" translation.
1675 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
1676 goal states; body tactic needs to address all subgoals uniformly.
1678 * Slightly more special eq_list/eq_set, with shortcut involving
1679 pointer equality (assumes that eq relation is reflexive).
1681 * Classical tactics use proper Proof.context instead of historic types
1682 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
1683 operate directly on Proof.context. Raw type claset retains its use as
1684 snapshot of the classical context, which can be recovered via
1685 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
1686 INCOMPATIBILITY, classical tactics and derived proof methods require
1687 proper Proof.context.
1692 * Discontinued support for Poly/ML 5.2, which was the last version
1693 without proper multithreading and TimeLimit implementation.
1695 * Discontinued old lib/scripts/polyml-platform, which has been
1696 obsolete since Isabelle2009-2.
1698 * Various optional external tools are referenced more robustly and
1699 uniformly by explicit Isabelle settings as follows:
1701 ISABELLE_CSDP (formerly CSDP_EXE)
1702 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
1703 ISABELLE_OCAML (formerly EXEC_OCAML)
1704 ISABELLE_SWIPL (formerly EXEC_SWIPL)
1705 ISABELLE_YAP (formerly EXEC_YAP)
1707 Note that automated detection from the file-system or search path has
1708 been discontinued. INCOMPATIBILITY.
1710 * Scala layer provides JVM method invocation service for static
1711 methods of type (String)String, see Invoke_Scala.method in ML. For
1714 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
1716 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
1717 this allows to pass structured values between ML and Scala.
1719 * The IsabelleText fonts includes some further glyphs to support the
1720 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
1721 installed a local copy (which is normally *not* required) need to
1722 delete or update it from ~~/lib/fonts/.
1726 New in Isabelle2011 (January 2011)
1727 ----------------------------------
1731 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
1732 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
1733 useful tooltips and hyperlinks produced from its static analysis. The
1734 bundled component provides an executable Isabelle tool that can be run
1737 Isabelle2011/bin/isabelle jedit
1739 * Significantly improved Isabelle/Isar implementation manual.
1741 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
1742 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
1743 while the default heap location within that directory lacks that extra
1744 suffix. This isolates multiple Isabelle installations from each
1745 other, avoiding problems with old settings in new versions.
1746 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
1748 * Source files are always encoded as UTF-8, instead of old-fashioned
1749 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
1750 the following package declarations:
1752 \usepackage[utf8]{inputenc}
1753 \usepackage{textcomp}
1755 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
1756 a Unicode character is treated as a single symbol, not a sequence of
1757 non-ASCII bytes as before. Since Isabelle/ML string literals may
1758 contain symbols without further backslash escapes, Unicode can now be
1759 used here as well. Recall that Symbol.explode in ML provides a
1760 consistent view on symbols, while raw explode (or String.explode)
1761 merely give a byte-oriented representation.
1763 * Theory loader: source files are primarily located via the master
1764 directory of each theory node (where the .thy file itself resides).
1765 The global load path is still partially available as legacy feature.
1766 Minor INCOMPATIBILITY due to subtle change in file lookup: use
1767 explicit paths, relatively to the theory.
1769 * Special treatment of ML file names has been discontinued.
1770 Historically, optional extensions .ML or .sml were added on demand --
1771 at the cost of clarity of file dependencies. Recall that Isabelle/ML
1772 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
1774 * Various options that affect pretty printing etc. are now properly
1775 handled within the context via configuration options, instead of
1776 unsynchronized references or print modes. There are both ML Config.T
1777 entities and Isar declaration attributes to access these.
1779 ML (Config.T) Isar (attribute)
1781 eta_contract eta_contract
1782 show_brackets show_brackets
1783 show_sorts show_sorts
1784 show_types show_types
1785 show_question_marks show_question_marks
1786 show_consts show_consts
1787 show_abbrevs show_abbrevs
1789 Syntax.ast_trace syntax_ast_trace
1790 Syntax.ast_stat syntax_ast_stat
1791 Syntax.ambiguity_level syntax_ambiguity_level
1793 Goal_Display.goals_limit goals_limit
1794 Goal_Display.show_main_goal show_main_goal
1796 Method.rule_trace rule_trace
1798 Thy_Output.display thy_output_display
1799 Thy_Output.quotes thy_output_quotes
1800 Thy_Output.indent thy_output_indent
1801 Thy_Output.source thy_output_source
1802 Thy_Output.break thy_output_break
1804 Note that corresponding "..._default" references in ML may only be
1805 changed globally at the ROOT session setup, but *not* within a theory.
1806 The option "show_abbrevs" supersedes the former print mode
1807 "no_abbrevs" with inverted meaning.
1809 * More systematic naming of some configuration options.
1812 trace_simp ~> simp_trace
1813 debug_simp ~> simp_debug
1815 * Support for real valued configuration options, using simplistic
1816 floating-point notation that coincides with the inner syntax for
1819 * Support for real valued preferences (with approximative PGIP type):
1820 front-ends need to accept "pgint" values in float notation.
1823 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
1826 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
1831 * Command 'type_synonym' (with single argument) replaces somewhat
1832 outdated 'types', which is still available as legacy feature for some
1835 * Command 'nonterminal' (with 'and' separated list of arguments)
1836 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
1838 * Command 'notepad' replaces former 'example_proof' for
1839 experimentation in Isar without any result. INCOMPATIBILITY.
1841 * Locale interpretation commands 'interpret' and 'sublocale' accept
1842 lists of equations to map definitions in a locale to appropriate
1843 entities in the context of the interpretation. The 'interpretation'
1844 command already provided this functionality.
1846 * Diagnostic command 'print_dependencies' prints the locale instances
1847 that would be activated if the specified expression was interpreted in
1848 the current context. Variant "print_dependencies!" assumes a context
1849 without interpretations.
1851 * Diagnostic command 'print_interps' prints interpretations in proofs
1852 in addition to interpretations in theories.
1854 * Discontinued obsolete 'global' and 'local' commands to manipulate
1855 the theory name space. Rare INCOMPATIBILITY. The ML functions
1856 Sign.root_path and Sign.local_path may be applied directly where this
1857 feature is still required for historical reasons.
1859 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
1860 'definition' instead.
1862 * The "prems" fact, which refers to the accidental collection of
1863 foundational premises in the context, is now explicitly marked as
1864 legacy feature and will be discontinued soon. Consider using "assms"
1865 of the head statement or reference facts by explicit names.
1867 * Document antiquotations @{class} and @{type} print classes and type
1870 * Document antiquotation @{file} checks file/directory entries within
1871 the local file system.
1876 * Coercive subtyping: functions can be declared as coercions and type
1877 inference will add them as necessary upon input of a term. Theory
1878 Complex_Main declares real :: nat => real and real :: int => real as
1879 coercions. A coercion function f is declared like this:
1881 declare [[coercion f]]
1883 To lift coercions through type constructors (e.g. from nat => real to
1884 nat list => real list), map functions can be declared, e.g.
1886 declare [[coercion_map map]]
1888 Currently coercion inference is activated only in theories including
1889 real numbers, i.e. descendants of Complex_Main. This is controlled by
1890 the configuration option "coercion_enabled", e.g. it can be enabled in
1891 other theories like this:
1893 declare [[coercion_enabled]]
1895 * Command 'partial_function' provides basic support for recursive
1896 function definitions over complete partial orders. Concrete instances
1897 are provided for i) the option type, ii) tail recursion on arbitrary
1898 types, and iii) the heap monad of Imperative_HOL. See
1899 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
1902 * Function package: f.psimps rules are no longer implicitly declared
1903 as [simp]. INCOMPATIBILITY.
1905 * Datatype package: theorems generated for executable equality (class
1906 "eq") carry proper names and are treated as default code equations.
1908 * Inductive package: now offers command 'inductive_simps' to
1909 automatically derive instantiated and simplified equations for
1910 inductive predicates, similar to 'inductive_cases'.
1912 * Command 'enriched_type' allows to register properties of the
1913 functorial structure of types.
1915 * Improved infrastructure for term evaluation using code generator
1916 techniques, in particular static evaluation conversions.
1918 * Code generator: Scala (2.8 or higher) has been added to the target
1921 * Code generator: globbing constant expressions "*" and "Theory.*"
1922 have been replaced by the more idiomatic "_" and "Theory._".
1925 * Code generator: export_code without explicit file declaration prints
1926 to standard output. INCOMPATIBILITY.
1928 * Code generator: do not print function definitions for case
1929 combinators any longer.
1931 * Code generator: simplification with rules determined with
1932 src/Tools/Code/code_simp.ML and method "code_simp".
1934 * Code generator for records: more idiomatic representation of record
1935 types. Warning: records are not covered by ancient SML code
1936 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
1937 rep_datatype declaration helps to succeed then:
1941 rep_datatype foo_ext ...
1943 * Records: logical foundation type for records does not carry a
1944 '_type' suffix any longer (obsolete due to authentic syntax).
1947 * Quickcheck now by default uses exhaustive testing instead of random
1948 testing. Random testing can be invoked by "quickcheck [random]",
1949 exhaustive testing by "quickcheck [exhaustive]".
1951 * Quickcheck instantiates polymorphic types with small finite
1952 datatypes by default. This enables a simple execution mechanism to
1953 handle quantifiers and function equality over the finite datatypes.
1955 * Quickcheck random generator has been renamed from "code" to
1956 "random". INCOMPATIBILITY.
1958 * Quickcheck now has a configurable time limit which is set to 30
1959 seconds by default. This can be changed by adding [timeout = n] to the
1960 quickcheck command. The time limit for Auto Quickcheck is still set
1963 * Quickcheck in locales considers interpretations of that locale for
1964 counter example search.
1967 - Added "smt" and "remote_smt" provers based on the "smt" proof
1968 method. See the Sledgehammer manual for details ("isabelle doc
1971 sledgehammer atp_info ~> sledgehammer running_provers
1972 sledgehammer atp_kill ~> sledgehammer kill_provers
1973 sledgehammer available_atps ~> sledgehammer available_provers
1976 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
1977 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
1978 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
1979 (and "ms" and "min" are no longer supported)
1984 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
1985 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
1987 - Added support for partial quotient types.
1988 - Added local versions of the "Nitpick.register_xxx" functions.
1989 - Added "whack" option.
1990 - Allow registration of quotient types as codatatypes.
1991 - Improved "merge_type_vars" option to merge more types.
1992 - Removed unsound "fast_descrs" option.
1993 - Added custom symmetry breaking for datatypes, making it possible to reach
1994 higher cardinalities.
1995 - Prevent the expansion of too large definitions.
1997 * Proof methods "metis" and "meson" now have configuration options
1998 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
1999 to diagnose these tools. E.g.
2001 using [[metis_trace = true]]
2003 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
2004 manually as command 'solve_direct'.
2006 * The default SMT solver Z3 must be enabled explicitly (due to
2007 licensing issues) by setting the environment variable
2008 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
2009 commercial applications, the SMT solver CVC3 is provided as fall-back;
2010 changing the SMT solver is done via the configuration option
2013 * Remote SMT solvers need to be referred to by the "remote_" prefix,
2014 i.e. "remote_cvc3" and "remote_z3".
2016 * Added basic SMT support for datatypes, records, and typedefs using
2017 the oracle mode (no proofs). Direct support of pairs has been dropped
2018 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
2019 support for a similar behavior). Minor INCOMPATIBILITY.
2021 * Changed SMT configuration options:
2023 z3_proofs ~> smt_oracle (with inverted meaning)
2024 z3_trace_assms ~> smt_trace_used_facts
2037 * Boogie output files (.b2i files) need to be declared in the theory
2040 * Simplification procedure "list_to_set_comprehension" rewrites list
2041 comprehensions applied to List.set to set comprehensions. Occasional
2042 INCOMPATIBILITY, may be deactivated like this:
2044 declare [[simproc del: list_to_set_comprehension]]
2046 * Removed old version of primrec package. INCOMPATIBILITY.
2048 * Removed simplifier congruence rule of "prod_case", as has for long
2049 been the case with "split". INCOMPATIBILITY.
2051 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
2053 * Removed [split_format ... and ... and ...] version of
2054 [split_format]. Potential INCOMPATIBILITY.
2056 * Predicate "sorted" now defined inductively, with nice induction
2057 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
2059 * Constant "contents" renamed to "the_elem", to free the generic name
2060 contents for other uses. INCOMPATIBILITY.
2062 * Renamed class eq and constant eq (for code generation) to class
2063 equal and constant equal, plus renaming of related facts and various
2064 tuning. INCOMPATIBILITY.
2066 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
2068 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
2071 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
2072 avoid confusion with finite sets. INCOMPATIBILITY.
2074 * Abandoned locales equiv, congruent and congruent2 for equivalence
2075 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
2078 * Some previously unqualified names have been qualified:
2085 Trueprop ~> HOL.Trueprop
2090 op --> ~> HOL.implies
2102 Pair ~> Product_Type.Pair
2103 fst ~> Product_Type.fst
2104 snd ~> Product_Type.snd
2105 curry ~> Product_Type.curry
2107 Collect ~> Set.Collect
2111 * More canonical naming convention for some fundamental definitions:
2113 bot_bool_eq ~> bot_bool_def
2114 top_bool_eq ~> top_bool_def
2115 inf_bool_eq ~> inf_bool_def
2116 sup_bool_eq ~> sup_bool_def
2117 bot_fun_eq ~> bot_fun_def
2118 top_fun_eq ~> top_fun_def
2119 inf_fun_eq ~> inf_fun_def
2120 sup_fun_eq ~> sup_fun_def
2124 * More stylized fact names:
2126 expand_fun_eq ~> fun_eq_iff
2127 expand_set_eq ~> set_eq_iff
2129 nat_number ~> eval_nat_numeral
2133 * Refactoring of code-generation specific operations in theory List:
2139 mem_iff ~> member_def
2140 null_empty ~> null_def
2142 INCOMPATIBILITY. Note that these were not supposed to be used
2143 regularly unless for striking reasons; their main purpose was code
2146 Various operations from the Haskell prelude are used for generating
2149 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
2150 "surj f" is now an abbreviation of "range f = UNIV". The theorems
2151 bij_def and surj_def are unchanged. INCOMPATIBILITY.
2153 * Abolished some non-alphabetic type names: "prod" and "sum" replace
2154 "*" and "+" respectively. INCOMPATIBILITY.
2156 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
2157 "Sum_Type.Plus" instead.
2159 * Constant "split" has been merged with constant "prod_case"; names of
2160 ML functions, facts etc. involving split have been retained so far,
2161 though. INCOMPATIBILITY.
2163 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
2164 instead. INCOMPATIBILITY.
2166 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
2169 * Former theory Library/Enum is now part of the HOL-Main image.
2170 INCOMPATIBILITY: all constants of the Enum theory now have to be
2171 referred to by its qualified name.
2174 nlists ~> Enum.nlists
2175 product ~> Enum.product
2177 * Theory Library/Monad_Syntax provides do-syntax for monad types.
2178 Syntax in Library/State_Monad has been changed to avoid ambiguities.
2181 * Theory Library/SetsAndFunctions has been split into
2182 Library/Function_Algebras and Library/Set_Algebras; canonical names
2183 for instance definitions for functions; various improvements.
2186 * Theory Library/Multiset provides stable quicksort implementation of
2189 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
2192 * Session Multivariate_Analysis: introduced a type class for euclidean
2193 space. Most theorems are now stated in terms of euclidean spaces
2194 instead of finite cartesian products.
2197 real ^ 'n ~> 'a::real_vector
2198 ~> 'a::euclidean_space
2199 ~> 'a::ordered_euclidean_space
2200 (depends on your needs)
2204 \<chi> x. _ ~> \<chi>\<chi> x. _
2207 Also note that the indices are now natural numbers and not from some
2208 finite type. Finite cartesian products of euclidean spaces, products
2209 of euclidean spaces the real and complex numbers are instantiated to
2210 be euclidean_spaces. INCOMPATIBILITY.
2212 * Session Probability: introduced pextreal as positive extended real
2213 numbers. Use pextreal as value for measures. Introduce the
2214 Radon-Nikodym derivative, product spaces and Fubini's theorem for
2215 arbitrary sigma finite measures. Introduces Lebesgue measure based on
2216 the integral in Multivariate Analysis. INCOMPATIBILITY.
2218 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
2221 * Session SPARK (with image HOL-SPARK) provides commands to load and
2222 prove verification conditions generated by the SPARK Ada program
2223 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
2228 * Theorems for additive ring operations (locale abelian_monoid and
2229 descendants) are generated by interpretation from their multiplicative
2230 counterparts. Names (in particular theorem names) have the mandatory
2231 qualifier 'add'. Previous theorem names are redeclared for
2234 * Structure "int_ring" is now an abbreviation (previously a
2235 definition). This fits more natural with advanced interpretations.
2240 * The domain package now runs in definitional mode by default: The
2241 former command 'new_domain' is now called 'domain'. To use the domain
2242 package in its original axiomatic mode, use 'domain (unsafe)'.
2245 * The new class "domain" is now the default sort. Class "predomain"
2246 is an unpointed version of "domain". Theories can be updated by
2247 replacing sort annotations as shown below. INCOMPATIBILITY.
2249 'a::type ~> 'a::countable
2250 'a::cpo ~> 'a::predomain
2251 'a::pcpo ~> 'a::domain
2253 * The old type class "rep" has been superseded by class "domain".
2254 Accordingly, users of the definitional package must remove any
2255 "default_sort rep" declarations. INCOMPATIBILITY.
2257 * The domain package (definitional mode) now supports unpointed
2258 predomain argument types, as long as they are marked 'lazy'. (Strict
2259 arguments must be in class "domain".) For example, the following
2260 domain definition now works:
2262 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
2264 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
2265 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
2266 'a option, and 'a list. Additionally, it configures fixrec and the
2267 domain package to work with these types. For example:
2269 fixrec isInl :: "('a + 'b) u -> tr"
2270 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
2272 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
2274 * The "(permissive)" option of fixrec has been replaced with a
2275 per-equation "(unchecked)" option. See
2276 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
2278 * The "bifinite" class no longer fixes a constant "approx"; the class
2279 now just asserts that such a function exists. INCOMPATIBILITY.
2281 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
2282 defines an embedding of type 'a defl into udom by default; instances
2283 of "bifinite" and "domain" classes are available in
2284 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
2286 * The syntax "REP('a)" has been replaced with "DEFL('a)".
2288 * The predicate "directed" has been removed. INCOMPATIBILITY.
2290 * The type class "finite_po" has been removed. INCOMPATIBILITY.
2292 * The function "cprod_map" has been renamed to "prod_map".
2295 * The monadic bind operator on each powerdomain has new binder syntax
2296 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
2297 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
2299 * The infix syntax for binary union on each powerdomain has changed
2300 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
2301 syntax. INCOMPATIBILITY.
2303 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
2304 still supported as an input translation.
2306 * Renamed some theorems (the original names are also still available).
2308 expand_fun_below ~> fun_below_iff
2309 below_fun_ext ~> fun_belowI
2310 expand_cfun_eq ~> cfun_eq_iff
2311 ext_cfun ~> cfun_eqI
2312 expand_cfun_below ~> cfun_below_iff
2313 below_cfun_ext ~> cfun_belowI
2314 cont2cont_Rep_CFun ~> cont2cont_APP
2316 * The Abs and Rep functions for various types have changed names.
2317 Related theorem names have also changed to match. INCOMPATIBILITY.
2319 Rep_CFun ~> Rep_cfun
2320 Abs_CFun ~> Abs_cfun
2321 Rep_Sprod ~> Rep_sprod
2322 Abs_Sprod ~> Abs_sprod
2323 Rep_Ssum ~> Rep_ssum
2324 Abs_Ssum ~> Abs_ssum
2326 * Lemmas with names of the form *_defined_iff or *_strict_iff have
2327 been renamed to *_bottom_iff. INCOMPATIBILITY.
2329 * Various changes to bisimulation/coinduction with domain package:
2331 - Definitions of "bisim" constants no longer mention definedness.
2332 - With mutual recursion, "bisim" predicate is now curried.
2333 - With mutual recursion, each type gets a separate coind theorem.
2334 - Variable names in bisim_def and coinduct rules have changed.
2338 * Case combinators generated by the domain package for type "foo" are
2339 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
2341 * Several theorems have been renamed to more accurately reflect the
2342 names of constants and types involved. INCOMPATIBILITY.
2344 thelub_const ~> lub_const
2345 lub_const ~> is_lub_const
2347 is_lub_lub ~> is_lubD2
2349 unique_lub ~> is_lub_unique
2350 is_ub_lub ~> is_lub_rangeD1
2351 lub_bin_chain ~> is_lub_bin_chain
2352 lub_fun ~> is_lub_fun
2353 thelub_fun ~> lub_fun
2354 thelub_cfun ~> lub_cfun
2355 thelub_Pair ~> lub_Pair
2356 lub_cprod ~> is_lub_prod
2357 thelub_cprod ~> lub_prod
2358 minimal_cprod ~> minimal_prod
2359 inst_cprod_pcpo ~> inst_prod_pcpo
2361 compact_UU ~> compact_bottom
2362 deflation_UU ~> deflation_bottom
2363 finite_deflation_UU ~> finite_deflation_bottom
2365 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
2367 sq_ord_less_eq_trans ~> below_eq_trans
2368 sq_ord_eq_less_trans ~> eq_below_trans
2369 refl_less ~> below_refl
2370 trans_less ~> below_trans
2371 antisym_less ~> below_antisym
2372 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
2373 box_less ~> box_below
2374 rev_trans_less ~> rev_below_trans
2375 not_less2not_eq ~> not_below2not_eq
2376 less_UU_iff ~> below_UU_iff
2377 flat_less_iff ~> flat_below_iff
2378 adm_less ~> adm_below
2379 adm_not_less ~> adm_not_below
2380 adm_compact_not_less ~> adm_compact_not_below
2381 less_fun_def ~> below_fun_def
2382 expand_fun_less ~> fun_below_iff
2383 less_fun_ext ~> fun_belowI
2384 less_discr_def ~> below_discr_def
2385 discr_less_eq ~> discr_below_eq
2386 less_unit_def ~> below_unit_def
2387 less_cprod_def ~> below_prod_def
2388 prod_lessI ~> prod_belowI
2389 Pair_less_iff ~> Pair_below_iff
2390 fst_less_iff ~> fst_below_iff
2391 snd_less_iff ~> snd_below_iff
2392 expand_cfun_less ~> cfun_below_iff
2393 less_cfun_ext ~> cfun_belowI
2394 injection_less ~> injection_below
2395 less_up_def ~> below_up_def
2396 not_Iup_less ~> not_Iup_below
2397 Iup_less ~> Iup_below
2399 Def_inject_less_eq ~> Def_below_Def
2400 Def_less_is_eq ~> Def_below_iff
2401 spair_less_iff ~> spair_below_iff
2402 less_sprod ~> below_sprod
2403 spair_less ~> spair_below
2404 sfst_less_iff ~> sfst_below_iff
2405 ssnd_less_iff ~> ssnd_below_iff
2406 fix_least_less ~> fix_least_below
2407 dist_less_one ~> dist_below_one
2408 less_ONE ~> below_ONE
2409 ONE_less_iff ~> ONE_below_iff
2410 less_sinlD ~> below_sinlD
2411 less_sinrD ~> below_sinrD
2416 * All constant names are now qualified internally and use proper
2417 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
2422 * Antiquotation @{assert} inlines a function bool -> unit that raises
2423 Fail if the argument is false. Due to inlining the source position of
2424 failed assertions is included in the error output.
2426 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
2427 text is in practice always evaluated with a stable theory checkpoint.
2428 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
2430 * Antiquotation @{theory A} refers to theory A from the ancestry of
2431 the current context, not any accidental theory loader state as before.
2432 Potential INCOMPATIBILITY, subtle change in semantics.
2434 * Syntax.pretty_priority (default 0) configures the required priority
2435 of pretty-printed output and thus affects insertion of parentheses.
2437 * Syntax.default_root (default "any") configures the inner syntax
2438 category (nonterminal symbol) for parsing of terms.
2440 * Former exception Library.UnequalLengths now coincides with
2441 ListPair.UnequalLengths.
2443 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
2444 main functionality is provided by structure Simplifier.
2446 * Renamed raw "explode" function to "raw_explode" to emphasize its
2447 meaning. Note that internally to Isabelle, Symbol.explode is used in
2448 almost all situations.
2450 * Discontinued obsolete function sys_error and exception SYS_ERROR.
2451 See implementation manual for further details on exceptions in
2454 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
2457 * Renamed structure PureThy to Pure_Thy and moved most of its
2458 operations to structure Global_Theory, to emphasize that this is
2459 rarely-used global-only stuff.
2461 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
2462 instead (or tracing for high-volume output).
2464 * Configuration option show_question_marks only affects regular pretty
2465 printing of types and terms, not raw Term.string_of_vname.
2467 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
2468 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
2469 @{thms} for most purposes.
2471 * ML structure Unsynchronized is never opened, not even in Isar
2472 interaction mode as before. Old Unsynchronized.set etc. have been
2473 discontinued -- use plain := instead. This should be *rare* anyway,
2474 since modern tools always work via official context data, notably
2475 configuration options.
2477 * Parallel and asynchronous execution requires special care concerning
2478 interrupts. Structure Exn provides some convenience functions that
2479 avoid working directly with raw Interrupt. User code must not absorb
2480 interrupts -- intermediate handling (for cleanup etc.) needs to be
2481 followed by re-raising of the original exception. Another common
2482 source of mistakes are "handle _" patterns, which make the meaning of
2483 the program subject to physical effects of the environment.
2487 New in Isabelle2009-2 (June 2010)
2488 ---------------------------------
2492 * Authentic syntax for *all* logical entities (type classes, type
2493 constructors, term constants): provides simple and robust
2494 correspondence between formal entities and concrete syntax. Within
2495 the parse tree / AST representations, "constants" are decorated by
2496 their category (class, type, const) and spelled out explicitly with
2497 their full internal name.
2499 Substantial INCOMPATIBILITY concerning low-level syntax declarations
2500 and translations (translation rules and translation functions in ML).
2501 Some hints on upgrading:
2503 - Many existing uses of 'syntax' and 'translations' can be replaced
2504 by more modern 'type_notation', 'notation' and 'abbreviation',
2505 which are independent of this issue.
2507 - 'translations' require markup within the AST; the term syntax
2508 provides the following special forms:
2510 CONST c -- produces syntax version of constant c from context
2511 XCONST c -- literally c, checked as constant from context
2512 c -- literally c, if declared by 'syntax'
2514 Plain identifiers are treated as AST variables -- occasionally the
2515 system indicates accidental variables via the error "rhs contains
2518 Type classes and type constructors are marked according to their
2519 concrete syntax. Some old translations rules need to be written
2520 for the "type" category, using type constructor application
2521 instead of pseudo-term application of the default category
2524 - 'parse_translation' etc. in ML may use the following
2527 @{class_syntax c} -- type class c within parse tree / AST
2528 @{term_syntax c} -- type constructor c within parse tree / AST
2529 @{const_syntax c} -- ML version of "CONST c" above
2530 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
2532 - Literal types within 'typed_print_translations', i.e. those *not*
2533 represented as pseudo-terms are represented verbatim. Use @{class
2534 c} or @{type_name c} here instead of the above syntax
2537 Note that old non-authentic syntax was based on unqualified base
2538 names, so all of the above "constant" names would coincide. Recall
2539 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
2540 diagnose syntax problems.
2542 * Type constructors admit general mixfix syntax, not just infix.
2544 * Concrete syntax may be attached to local entities without a proof
2545 body, too. This works via regular mixfix annotations for 'fix',
2546 'def', 'obtain' etc. or via the explicit 'write' command, which is
2547 similar to the 'notation' command in theory specifications.
2549 * Discontinued unnamed infix syntax (legacy feature for many years) --
2550 need to specify constant name and syntax separately. Internal ML
2551 datatype constructors have been renamed from InfixName to Infix etc.
2552 Minor INCOMPATIBILITY.
2554 * Schematic theorem statements need to be explicitly markup as such,
2555 via commands 'schematic_lemma', 'schematic_theorem',
2556 'schematic_corollary'. Thus the relevance of the proof is made
2557 syntactically clear, which impacts performance in a parallel or
2558 asynchronous interactive environment. Minor INCOMPATIBILITY.
2560 * Use of cumulative prems via "!" in some proof methods has been
2561 discontinued (old legacy feature).
2563 * References 'trace_simp' and 'debug_simp' have been replaced by
2564 configuration options stored in the context. Enabling tracing (the
2565 case of debugging is similar) in proofs works via
2567 using [[trace_simp = true]]
2569 Tracing is then active for all invocations of the simplifier in
2570 subsequent goal refinement steps. Tracing may also still be enabled or
2571 disabled via the ProofGeneral settings menu.
2573 * Separate commands 'hide_class', 'hide_type', 'hide_const',
2574 'hide_fact' replace the former 'hide' KIND command. Minor
2577 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
2578 more efficient than combinations with -q1 or -q2.
2583 * Proofterms record type-class reasoning explicitly, using the
2584 "unconstrain" operation internally. This eliminates all sort
2585 constraints from a theorem and proof, introducing explicit
2586 OFCLASS-premises. On the proof term level, this operation is
2587 automatically applied at theorem boundaries, such that closed proofs
2588 are always free of sort constraints. INCOMPATIBILITY for tools that
2589 inspect proof terms.
2591 * Local theory specifications may depend on extra type variables that
2592 are not present in the result type -- arguments TYPE('a) :: 'a itself
2593 are added internally. For example:
2595 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
2597 * Predicates of locales introduced by classes carry a mandatory
2598 "class" prefix. INCOMPATIBILITY.
2600 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
2602 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
2605 * Command 'code_reflect' allows to incorporate generated ML code into
2606 runtime environment; replaces immature code_datatype antiquotation.
2609 * Code generator: simple concept for abstract datatypes obeying
2612 * Code generator: details of internal data cache have no impact on the
2613 user space functionality any longer.
2615 * Methods "unfold_locales" and "intro_locales" ignore non-locale
2616 subgoals. This is more appropriate for interpretations with 'where'.
2619 * Command 'example_proof' opens an empty proof body. This allows to
2620 experiment with Isar, without producing any persistent result.
2622 * Commands 'type_notation' and 'no_type_notation' declare type syntax
2623 within a local theory context, with explicit checking of the
2624 constructors involved (in contrast to the raw 'syntax' versions).
2626 * Commands 'types' and 'typedecl' now work within a local theory
2627 context -- without introducing dependencies on parameters or
2628 assumptions, which is not possible in Isabelle/Pure.
2630 * Command 'defaultsort' has been renamed to 'default_sort', it works
2631 within a local theory context. Minor INCOMPATIBILITY.
2636 * Command 'typedef' now works within a local theory context -- without
2637 introducing dependencies on parameters or assumptions, which is not
2638 possible in Isabelle/Pure/HOL. Note that the logical environment may
2639 contain multiple interpretations of local typedefs (with different
2640 non-emptiness proofs), even in a global theory context.
2642 * New package for quotient types. Commands 'quotient_type' and
2643 'quotient_definition' may be used for defining types and constants by
2644 quotient constructions. An example is the type of integers created by
2645 quotienting pairs of natural numbers:
2648 intrel :: "(nat * nat) => (nat * nat) => bool"
2650 "intrel (x, y) (u, v) = (x + v = u + y)"
2652 quotient_type int = "nat * nat" / intrel
2653 by (auto simp add: equivp_def expand_fun_eq)
2656 "0::int" is "(0::nat, 0::nat)"
2658 The method "lifting" can be used to lift of theorems from the
2659 underlying "raw" type to the quotient type. The example
2660 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
2661 construction and provides a reasoning infrastructure for finite sets.
2663 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
2664 clash with new theory Quotient in Main HOL.
2666 * Moved the SMT binding into the main HOL session, eliminating
2667 separate HOL-SMT session.
2669 * List membership infix mem operation is only an input abbreviation.
2672 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
2673 for future developements; former Library/Word.thy is still present in
2674 the AFP entry RSAPPS.
2676 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
2677 longer shadowed. INCOMPATIBILITY.
2679 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
2682 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
2685 * Dropped normalizing_semiring etc; use the facts in semiring classes
2686 instead. INCOMPATIBILITY.
2688 * Dropped several real-specific versions of lemmas about floor and
2689 ceiling; use the generic lemmas from theory "Archimedean_Field"
2690 instead. INCOMPATIBILITY.
2692 floor_number_of_eq ~> floor_number_of
2693 le_floor_eq_number_of ~> number_of_le_floor
2694 le_floor_eq_zero ~> zero_le_floor
2695 le_floor_eq_one ~> one_le_floor
2696 floor_less_eq_number_of ~> floor_less_number_of
2697 floor_less_eq_zero ~> floor_less_zero
2698 floor_less_eq_one ~> floor_less_one
2699 less_floor_eq_number_of ~> number_of_less_floor
2700 less_floor_eq_zero ~> zero_less_floor
2701 less_floor_eq_one ~> one_less_floor
2702 floor_le_eq_number_of ~> floor_le_number_of
2703 floor_le_eq_zero ~> floor_le_zero
2704 floor_le_eq_one ~> floor_le_one
2705 floor_subtract_number_of ~> floor_diff_number_of
2706 floor_subtract_one ~> floor_diff_one
2707 ceiling_number_of_eq ~> ceiling_number_of
2708 ceiling_le_eq_number_of ~> ceiling_le_number_of
2709 ceiling_le_zero_eq ~> ceiling_le_zero
2710 ceiling_le_eq_one ~> ceiling_le_one
2711 less_ceiling_eq_number_of ~> number_of_less_ceiling
2712 less_ceiling_eq_zero ~> zero_less_ceiling
2713 less_ceiling_eq_one ~> one_less_ceiling
2714 ceiling_less_eq_number_of ~> ceiling_less_number_of
2715 ceiling_less_eq_zero ~> ceiling_less_zero
2716 ceiling_less_eq_one ~> ceiling_less_one
2717 le_ceiling_eq_number_of ~> number_of_le_ceiling
2718 le_ceiling_eq_zero ~> zero_le_ceiling
2719 le_ceiling_eq_one ~> one_le_ceiling
2720 ceiling_subtract_number_of ~> ceiling_diff_number_of
2721 ceiling_subtract_one ~> ceiling_diff_one
2723 * Theory "Finite_Set": various folding_XXX locales facilitate the
2724 application of the various fold combinators on finite sets.
2726 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
2727 provides abstract red-black tree type which is backed by "RBT_Impl" as
2728 implementation. INCOMPATIBILTY.
2730 * Theory Library/Coinductive_List has been removed -- superseded by
2731 AFP/thys/Coinductive.
2733 * Theory PReal, including the type "preal" and related operations, has
2734 been removed. INCOMPATIBILITY.
2736 * Real: new development using Cauchy Sequences.
2738 * Split off theory "Big_Operators" containing setsum, setprod,
2739 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
2741 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
2742 "Int" etc. INCOMPATIBILITY.
2744 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
2746 * New set of rules "ac_simps" provides combined assoc / commute
2747 rewrites for all interpretations of the appropriate generic locales.
2749 * Renamed theory "OrderedGroup" to "Groups" and split theory
2750 "Ring_and_Field" into theories "Rings" and "Fields"; for more
2751 appropriate and more consistent names suitable for name prefixes
2752 within the HOL theories. INCOMPATIBILITY.
2754 * Some generic constants have been put to appropriate theories:
2755 - less_eq, less: Orderings
2756 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
2757 - inverse, divide: Rings
2760 * More consistent naming of type classes involving orderings (and
2763 lower_semilattice ~> semilattice_inf
2764 upper_semilattice ~> semilattice_sup
2766 dense_linear_order ~> dense_linorder
2768 pordered_ab_group_add ~> ordered_ab_group_add
2769 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
2770 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
2771 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
2772 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
2773 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
2774 pordered_cancel_semiring ~> ordered_cancel_semiring
2775 pordered_comm_monoid_add ~> ordered_comm_monoid_add
2776 pordered_comm_ring ~> ordered_comm_ring
2777 pordered_comm_semiring ~> ordered_comm_semiring
2778 pordered_ring ~> ordered_ring
2779 pordered_ring_abs ~> ordered_ring_abs
2780 pordered_semiring ~> ordered_semiring
2782 ordered_ab_group_add ~> linordered_ab_group_add
2783 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
2784 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
2785 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
2786 ordered_field ~> linordered_field
2787 ordered_field_no_lb ~> linordered_field_no_lb
2788 ordered_field_no_ub ~> linordered_field_no_ub
2789 ordered_field_dense_linear_order ~> dense_linordered_field
2790 ordered_idom ~> linordered_idom
2791 ordered_ring ~> linordered_ring
2792 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
2793 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
2794 ordered_ring_strict ~> linordered_ring_strict
2795 ordered_semidom ~> linordered_semidom
2796 ordered_semiring ~> linordered_semiring
2797 ordered_semiring_1 ~> linordered_semiring_1
2798 ordered_semiring_1_strict ~> linordered_semiring_1_strict
2799 ordered_semiring_strict ~> linordered_semiring_strict
2801 The following slightly odd type classes have been moved to a
2802 separate theory Library/Lattice_Algebras:
2804 lordered_ab_group_add ~> lattice_ab_group_add
2805 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
2806 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
2807 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
2808 lordered_ring ~> lattice_ring
2812 * Refined field classes:
2813 - classes division_ring_inverse_zero, field_inverse_zero,
2814 linordered_field_inverse_zero include rule inverse 0 = 0 --
2815 subsumes former division_by_zero class;
2816 - numerous lemmas have been ported from field to division_ring.
2819 * Refined algebra theorem collections:
2820 - dropped theorem group group_simps, use algebra_simps instead;
2821 - dropped theorem group ring_simps, use field_simps instead;
2822 - proper theorem collection field_simps subsumes former theorem
2823 groups field_eq_simps and field_simps;
2824 - dropped lemma eq_minus_self_iff which is a duplicate for
2828 * Theory Finite_Set and List: some lemmas have been generalized from
2831 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
2832 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
2833 inter_Inter_fold_inter ~> inf_Inf_fold_inf
2834 union_Union_fold_union ~> sup_Sup_fold_sup
2835 Inter_fold_inter ~> Inf_fold_inf
2836 Union_fold_union ~> Sup_fold_sup
2837 inter_INTER_fold_inter ~> inf_INFI_fold_inf
2838 union_UNION_fold_union ~> sup_SUPR_fold_sup
2839 INTER_fold_inter ~> INFI_fold_inf
2840 UNION_fold_union ~> SUPR_fold_sup
2842 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
2843 replaced by the more convenient lemmas Inf_empty and Sup_empty.
2844 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
2845 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
2846 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
2847 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
2849 * Reorganized theory Multiset: swapped notation of pointwise and
2852 - pointwise ordering is instance of class order with standard syntax
2854 - multiset ordering has syntax <=# and <#; partial order properties
2855 are provided by means of interpretation with prefix
2857 - less duplication, less historical organization of sections,
2858 conversion from associations lists to multisets, rudimentary code
2860 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
2865 multiset_eq_conv_count_eq ~> multiset_ext_iff
2866 multi_count_ext ~> multiset_ext
2867 diff_union_inverse2 ~> diff_union_cancelR
2871 * Theory Permutation: replaced local "remove" by List.remove1.
2873 * Code generation: ML and OCaml code is decorated with signatures.
2875 * Theory List: added transpose.
2877 * Library/Nat_Bijection.thy is a collection of bijective functions
2878 between nat and other types, which supersedes the older libraries
2879 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
2882 Nat_Int_Bij.nat2_to_nat ~> prod_encode
2883 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
2884 Nat_Int_Bij.int_to_nat_bij ~> int_encode
2885 Nat_Int_Bij.nat_to_int_bij ~> int_decode
2886 Countable.pair_encode ~> prod_encode
2887 NatIso.prod2nat ~> prod_encode
2888 NatIso.nat2prod ~> prod_decode
2889 NatIso.sum2nat ~> sum_encode
2890 NatIso.nat2sum ~> sum_decode
2891 NatIso.list2nat ~> list_encode
2892 NatIso.nat2list ~> list_decode
2893 NatIso.set2nat ~> set_encode
2894 NatIso.nat2set ~> set_decode
2897 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
2898 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
2899 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
2900 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
2901 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
2902 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
2903 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
2904 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
2905 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
2906 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
2907 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
2908 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
2909 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
2912 - Renamed ATP commands:
2913 atp_info ~> sledgehammer running_atps
2914 atp_kill ~> sledgehammer kill_atps
2915 atp_messages ~> sledgehammer messages
2916 atp_minimize ~> sledgehammer minimize
2917 print_atps ~> sledgehammer available_atps
2919 - Added user's manual ("isabelle doc sledgehammer").
2920 - Added option syntax and "sledgehammer_params" to customize
2921 Sledgehammer's behavior. See the manual for details.
2922 - Modified the Isar proof reconstruction code so that it produces
2923 direct proofs rather than proofs by contradiction. (This feature
2924 is still experimental.)
2925 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
2927 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
2930 - Added and implemented "binary_ints" and "bits" options.
2931 - Added "std" option and implemented support for nonstandard models.
2932 - Added and implemented "finitize" option to improve the precision
2933 of infinite datatypes based on a monotonicity analysis.
2934 - Added support for quotient types.
2935 - Added support for "specification" and "ax_specification"
2937 - Added support for local definitions (for "function" and
2938 "termination" proofs).
2939 - Added support for term postprocessors.
2940 - Optimized "Multiset.multiset" and "FinFun.finfun".
2941 - Improved efficiency of "destroy_constrs" optimization.
2942 - Fixed soundness bugs related to "destroy_constrs" optimization and
2944 - Fixed soundness bug related to higher-order constructors.
2945 - Fixed soundness bug when "full_descrs" is enabled.
2946 - Improved precision of set constructs.
2947 - Added "atoms" option.
2948 - Added cache to speed up repeated Kodkod invocations on the same
2950 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
2951 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
2952 "SAT4J_Light". INCOMPATIBILITY.
2953 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
2954 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
2955 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
2957 * Method "induct" now takes instantiations of the form t, where t is not
2958 a variable, as a shorthand for "x == t", where x is a fresh variable.
2959 If this is not intended, t has to be enclosed in parentheses.
2960 By default, the equalities generated by definitional instantiations
2961 are pre-simplified, which may cause parameters of inductive cases
2962 to disappear, or may even delete some of the inductive cases.
2963 Use "induct (no_simp)" instead of "induct" to restore the old
2964 behaviour. The (no_simp) option is also understood by the "cases"
2965 and "nominal_induct" methods, which now perform pre-simplification, too.
2971 * Variable names in lemmas generated by the domain package have
2972 changed; the naming scheme is now consistent with the HOL datatype
2973 package. Some proof scripts may be affected, INCOMPATIBILITY.
2975 * The domain package no longer defines the function "foo_copy" for
2976 recursive domain "foo". The reach lemma is now stated directly in
2977 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
2978 be reformulated in terms of "foo_take", INCOMPATIBILITY.
2980 * Most definedness lemmas generated by the domain package (previously
2981 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
2982 like "foo$x = UU <-> x = UU", which works better as a simp rule.
2983 Proofs that used definedness lemmas as intro rules may break,
2984 potential INCOMPATIBILITY.
2986 * Induction and casedist rules generated by the domain package now
2987 declare proper case_names (one called "bottom", and one named for each
2988 constructor). INCOMPATIBILITY.
2990 * For mutually-recursive domains, separate "reach" and "take_lemma"
2991 rules are generated for each domain, INCOMPATIBILITY.
2993 foo_bar.reach ~> foo.reach bar.reach
2994 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
2996 * Some lemmas generated by the domain package have been renamed for
2997 consistency with the datatype package, INCOMPATIBILITY.
2999 foo.ind ~> foo.induct
3000 foo.finite_ind ~> foo.finite_induct
3001 foo.coind ~> foo.coinduct
3002 foo.casedist ~> foo.exhaust
3003 foo.exhaust ~> foo.nchotomy
3005 * For consistency with other definition packages, the fixrec package
3006 now generates qualified theorem names, INCOMPATIBILITY.
3008 foo_simps ~> foo.simps
3009 foo_unfold ~> foo.unfold
3010 foo_induct ~> foo.induct
3012 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
3013 method and internal fixrec proofs now use the default simpset instead.
3016 * The "contlub" predicate has been removed. Proof scripts should use
3017 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
3019 * The "admw" predicate has been removed, INCOMPATIBILITY.
3021 * The constants cpair, cfst, and csnd have been removed in favor of
3022 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
3027 * Antiquotations for basic formal entities:
3029 @{class NAME} -- type class
3030 @{class_syntax NAME} -- syntax representation of the above
3032 @{type_name NAME} -- logical type
3033 @{type_abbrev NAME} -- type abbreviation
3034 @{nonterminal NAME} -- type of concrete syntactic category
3035 @{type_syntax NAME} -- syntax representation of any of the above
3037 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
3038 @{const_abbrev NAME} -- abbreviated constant
3039 @{const_syntax NAME} -- syntax representation of any of the above
3041 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
3042 syntax constant (cf. 'syntax' command).
3044 * Antiquotation @{make_string} inlines a function to print arbitrary
3045 values similar to the ML toplevel. The result is compiler dependent
3046 and may fall back on "?" in certain situations.
3048 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
3049 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
3050 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
3051 not work with the asynchronous Isar document model.
3053 * Configuration options now admit dynamic default values, depending on
3054 the context or even global references.
3056 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
3057 uses an efficient external library if available (for Poly/ML).
3059 * Renamed some important ML structures, while keeping the old names
3060 for some time as aliases within the structure Legacy:
3062 OuterKeyword ~> Keyword
3065 OuterSyntax ~> Outer_Syntax
3066 PrintMode ~> Print_Mode
3067 SpecParse ~> Parse_Spec
3070 ThyOutput ~> Thy_Output
3071 TypeInfer ~> Type_Infer
3073 Note that "open Legacy" simplifies porting of sources, but forgetting
3074 to remove it again will complicate porting again in the future.
3076 * Most operations that refer to a global context are named
3077 accordingly, e.g. Simplifier.global_context or
3078 ProofContext.init_global. There are some situations where a global
3079 context actually works, but under normal circumstances one needs to
3080 pass the proper local context through the code!
3082 * Discontinued old TheoryDataFun with its copy/init operation -- data
3083 needs to be pure. Functor Theory_Data_PP retains the traditional
3084 Pretty.pp argument to merge, which is absent in the standard
3085 Theory_Data version.
3087 * Sorts.certify_sort and derived "cert" operations for types and terms
3088 no longer minimize sorts. Thus certification at the boundary of the
3089 inference kernel becomes invariant under addition of class relations,
3090 which is an important monotonicity principle. Sorts are now minimized
3091 in the syntax layer only, at the boundary between the end-user and the
3092 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
3093 explicitly in rare situations.
3095 * Renamed old-style Drule.standard to Drule.export_without_context, to
3096 emphasize that this is in no way a standard operation.
3099 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
3100 usual for resolution. Rare INCOMPATIBILITY.
3102 * Renamed varify/unvarify operations to varify_global/unvarify_global
3103 to emphasize that these only work in a global situation (which is
3106 * Curried take and drop in library.ML; negative length is interpreted
3107 as infinity (as in chop). Subtle INCOMPATIBILITY.
3109 * Proof terms: type substitutions on proof constants now use canonical
3110 order of type variables. INCOMPATIBILITY for tools working with proof
3113 * Raw axioms/defs may no longer carry sort constraints, and raw defs
3114 may no longer carry premises. User-level specifications are
3115 transformed accordingly by Thm.add_axiom/add_def.
3120 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
3121 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
3122 proof terms are enabled unconditionally in the new HOL-Proofs image.
3124 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
3125 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
3128 * Old lib/scripts/polyml-platform is superseded by the
3129 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
3130 variant, even on a 64 bit machine. The following example setting
3131 prefers 64 bit if available:
3133 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
3135 * The preliminary Isabelle/jEdit application demonstrates the emerging
3136 Isabelle/Scala layer for advanced prover interaction and integration.
3137 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
3140 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
3141 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
3142 similar to the default assignment of the document preparation system
3143 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
3144 provides some operations for direct access to the font without asking
3145 the user for manual installation.
3149 New in Isabelle2009-1 (December 2009)
3150 -------------------------------------
3154 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
3155 one backslash should be used, even in ML sources.
3160 * Locale interpretation propagates mixins along the locale hierarchy.
3161 The currently only available mixins are the equations used to map
3162 local definitions to terms of the target domain of an interpretation.
3164 * Reactivated diagnostic command 'print_interps'. Use "print_interps
3165 loc" to print all interpretations of locale "loc" in the theory.
3166 Interpretations in proofs are not shown.
3168 * Thoroughly revised locales tutorial. New section on conditional
3171 * On instantiation of classes, remaining undefined class parameters
3172 are formally declared. INCOMPATIBILITY.
3175 *** Document preparation ***
3177 * New generalized style concept for printing terms: @{foo (style) ...}
3178 instead of @{foo_style style ...} (old form is still retained for
3179 backward compatibility). Styles can be also applied for
3180 antiquotations prop, term_type and typeof.
3185 * New proof method "smt" for a combination of first-order logic with
3186 equality, linear and nonlinear (natural/integer/real) arithmetic, and
3187 fixed-size bitvectors; there is also basic support for higher-order
3188 features (esp. lambda abstractions). It is an incomplete decision
3189 procedure based on external SMT solvers using the oracle mechanism;
3190 for the SMT solver Z3, this method is proof-producing. Certificates
3191 are provided to avoid calling the external solvers solely for
3192 re-checking proofs. Due to a remote SMT service there is no need for
3193 installing SMT solvers locally. See src/HOL/SMT.
3195 * New commands to load and prove verification conditions generated by
3196 the Boogie program verifier or derived systems (e.g. the Verifying C
3197 Compiler (VCC) or Spec#). See src/HOL/Boogie.
3199 * New counterexample generator tool 'nitpick' based on the Kodkod
3200 relational model finder. See src/HOL/Tools/Nitpick and
3201 src/HOL/Nitpick_Examples.
3203 * New commands 'code_pred' and 'values' to invoke the predicate
3204 compiler and to enumerate values of inductive predicates.
3206 * A tabled implementation of the reflexive transitive closure.
3208 * New implementation of quickcheck uses generic code generator;
3209 default generators are provided for all suitable HOL types, records
3210 and datatypes. Old quickcheck can be re-activated importing theory
3211 Library/SML_Quickcheck.
3213 * New testing tool Mirabelle for automated proof tools. Applies
3214 several tools and tactics like sledgehammer, metis, or quickcheck, to
3215 every proof step in a theory. To be used in batch mode via the
3216 "mirabelle" utility.
3218 * New proof method "sos" (sum of squares) for nonlinear real
3219 arithmetic (originally due to John Harison). It requires theory
3220 Library/Sum_Of_Squares. It is not a complete decision procedure but
3221 works well in practice on quantifier-free real arithmetic with +, -,
3222 *, ^, =, <= and <, i.e. boolean combinations of equalities and
3223 inequalities between polynomials. It makes use of external
3224 semidefinite programming solvers. Method "sos" generates a
3225 certificate that can be pasted into the proof thus avoiding the need
3226 to call an external tool every time the proof is checked. See
3227 src/HOL/Library/Sum_Of_Squares.
3229 * New method "linarith" invokes existing linear arithmetic decision
3232 * New command 'atp_minimal' reduces result produced by Sledgehammer.
3234 * New Sledgehammer option "Full Types" in Proof General settings menu.
3235 Causes full type information to be output to the ATPs. This slows
3236 ATPs down considerably but eliminates a source of unsound "proofs"
3239 * New method "metisFT": A version of metis that uses full type
3240 information in order to avoid failures of proof reconstruction.
3242 * New evaluator "approximate" approximates an real valued term using
3243 the same method as the approximation method.
3245 * Method "approximate" now supports arithmetic expressions as
3246 boundaries of intervals and implements interval splitting and Taylor
3249 * ML antiquotation @{code_datatype} inserts definition of a datatype
3250 generated by the code generator; e.g. see src/HOL/Predicate.thy.
3252 * New theory SupInf of the supremum and infimum operators for sets of
3255 * New theory Probability, which contains a development of measure
3256 theory, eventually leading to Lebesgue integration and probability.
3258 * Extended Multivariate Analysis to include derivation and Brouwer's
3261 * Reorganization of number theory, INCOMPATIBILITY:
3262 - new number theory development for nat and int, in theories Divides
3263 and GCD as well as in new session Number_Theory
3264 - some constants and facts now suffixed with _nat and _int
3266 - former session NumberTheory now named Old_Number_Theory, including
3267 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
3268 - moved theory Pocklington from src/HOL/Library to
3269 src/HOL/Old_Number_Theory
3271 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
3272 lcm of finite and infinite sets. It is shown that they form a complete
3275 * Class semiring_div requires superclass no_zero_divisors and proof of
3276 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
3277 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
3278 generalized to class semiring_div, subsuming former theorems
3279 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
3280 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
3283 * Refinements to lattice classes and sets:
3284 - less default intro/elim rules in locale variant, more default
3285 intro/elim rules in class variant: more uniformity
3286 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
3288 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
3290 - renamed ACI to inf_sup_aci
3291 - new class "boolean_algebra"
3292 - class "complete_lattice" moved to separate theory
3293 "Complete_Lattice"; corresponding constants (and abbreviations)
3294 renamed and with authentic syntax:
3295 Set.Inf ~> Complete_Lattice.Inf
3296 Set.Sup ~> Complete_Lattice.Sup
3297 Set.INFI ~> Complete_Lattice.INFI
3298 Set.SUPR ~> Complete_Lattice.SUPR
3299 Set.Inter ~> Complete_Lattice.Inter
3300 Set.Union ~> Complete_Lattice.Union
3301 Set.INTER ~> Complete_Lattice.INTER
3302 Set.UNION ~> Complete_Lattice.UNION
3303 - authentic syntax for
3306 - mere abbreviations:
3309 Set.inter (for inf, formerly Set.Int)
3310 Set.union (for sup, formerly Set.Un)
3311 Complete_Lattice.Inter (for Inf)
3312 Complete_Lattice.Union (for Sup)
3313 Complete_Lattice.INTER (for INFI)
3314 Complete_Lattice.UNION (for SUPR)
3315 - object-logic definitions as far as appropriate
3317 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
3318 Un_subset_iff are explicitly deleted as default simp rules; then also
3319 their lattice counterparts le_inf_iff and le_sup_iff have to be
3320 deleted to achieve the desired effect.
3322 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
3323 rules by default any longer; the same applies to min_max.inf_absorb1
3324 etc. INCOMPATIBILITY.
3326 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
3327 pred_set_conv by default. INCOMPATIBILITY.
3329 * Power operations on relations and functions are now one dedicated
3330 constant "compow" with infix syntax "^^". Power operation on
3331 multiplicative monoids retains syntax "^" and is now defined generic
3332 in class power. INCOMPATIBILITY.
3334 * Relation composition "R O S" now has a more standard argument order:
3335 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
3336 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
3337 break, since the O_assoc rule was not rewritten like this. Fix using
3338 O_assoc[symmetric]. The same applies to the curried version "R OO S".
3340 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
3341 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
3344 * Most rules produced by inductive and datatype package have mandatory
3345 prefixes. INCOMPATIBILITY.
3347 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
3348 the attribute of the same name. Each of the theorems in the list
3349 DERIV_intros assumes composition with an additional function and
3350 matches a variable to the derivative, which has to be solved by the
3351 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
3352 of most elementary terms. Former Maclauren.DERIV_tac and
3353 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
3356 * Code generator attributes follow the usual underscore convention:
3357 code_unfold replaces code unfold
3358 code_post replaces code post
3363 sizechange -> size_change
3364 induct_scheme -> induction_schema
3367 * Discontinued abbreviation "arbitrary" of constant "undefined".
3368 INCOMPATIBILITY, use "undefined" directly.
3371 Suc_eq_add_numeral_1 -> Suc_eq_plus1
3372 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
3373 Suc_plus1 -> Suc_eq_plus1
3374 *anti_sym -> *antisym*
3375 vector_less_eq_def -> vector_le_def
3378 * Added theorem List.map_map as [simp]. Removed List.map_compose.
3381 * Removed predicate "M hassize n" (<--> card M = n & finite M).
3387 * Theory Representable defines a class "rep" of domains that are
3388 representable (via an ep-pair) in the universal domain type "udom".
3389 Instances are provided for all type constructors defined in HOLCF.
3391 * The 'new_domain' command is a purely definitional version of the
3392 domain package, for representable domains. Syntax is identical to the
3393 old domain package. The 'new_domain' package also supports indirect
3394 recursion using previously-defined type constructors. See
3395 src/HOLCF/ex/New_Domain.thy for examples.
3397 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
3398 on the left-hand side of an equation, and then performs
3399 simplification. Rewriting is done using rules declared with the
3400 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
3401 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
3403 * The pattern-match compiler in 'fixrec' can now handle constructors
3404 with HOL function types. Pattern-match combinators for the Pair
3405 constructor are pre-configured.
3407 * The 'fixrec' package now produces better fixed-point induction rules
3408 for mutually-recursive definitions: Induction rules have conclusions
3409 of the form "P foo bar" instead of "P <foo, bar>".
3411 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
3412 been renamed to "below". The name "below" now replaces "less" in many
3413 theorem names. (Legacy theorem names using "less" are still supported
3416 * The 'fixrec' package now supports "bottom patterns". Bottom
3417 patterns can be used to generate strictness rules, or to make
3418 functions more strict (much like the bang-patterns supported by the
3419 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
3425 * Support for Poly/ML 5.3.0, with improved reporting of compiler
3426 errors and run-time exceptions, including detailed source positions.
3428 * Structure Name_Space (formerly NameSpace) now manages uniquely
3429 identified entries, with some additional information such as source
3430 position, logical grouping etc.
3432 * Theory and context data is now introduced by the simplified and
3433 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
3434 to be pure, but the old TheoryDataFun for mutable data (with explicit
3435 copy operation) is still available for some time.
3437 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
3438 provides a high-level programming interface to synchronized state
3439 variables with atomic update. This works via pure function
3440 application within a critical section -- its runtime should be as
3441 short as possible; beware of deadlocks if critical code is nested,
3442 either directly or indirectly via other synchronized variables!
3444 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
3445 wraps raw ML references, explicitly indicating their non-thread-safe
3446 behaviour. The Isar toplevel keeps this structure open, to
3447 accommodate Proof General as well as quick and dirty interactive
3448 experiments with references.
3450 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
3451 parallel tactical reasoning.
3453 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
3454 are similar to SUBPROOF, but are slightly more flexible: only the
3455 specified parts of the subgoal are imported into the context, and the
3456 body tactic may introduce new subgoals and schematic variables.
3458 * Old tactical METAHYPS, which does not observe the proof context, has
3459 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
3460 or Subgoal.FOCUS etc.
3462 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
3463 functors have their own ML name space there is no point to mark them
3464 separately.) Minor INCOMPATIBILITY.
3466 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
3468 * Renamed several structures FooBar to Foo_Bar. Occasional,
3471 * Operations of structure Skip_Proof no longer require quick_and_dirty
3472 mode, which avoids critical setmp.
3474 * Eliminated old Attrib.add_attributes, Method.add_methods and related
3475 combinators for "args". INCOMPATIBILITY, need to use simplified
3476 Attrib/Method.setup introduced in Isabelle2009.
3478 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
3479 back on global_simpset_of, global_claset_of, global_clasimpset_of as
3480 last resort. INCOMPATIBILITY.
3482 * Display.pretty_thm now requires a proper context (cf. former
3483 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
3484 or even Display.pretty_thm_without_context as last resort.
3487 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
3488 Syntax.pretty_typ/term directly, preferably with proper context
3489 instead of global theory.
3494 * Further fine tuning of parallel proof checking, scales up to 8 cores
3495 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
3498 * Support for additional "Isabelle components" via etc/components, see
3499 also the system manual.
3501 * The isabelle makeall tool now operates on all components with
3502 IsaMakefile, not just hardwired "logics".
3504 * Removed "compress" option from isabelle-process and isabelle usedir;
3505 this is always enabled.
3507 * Discontinued support for Poly/ML 4.x versions.
3509 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
3510 on a given logic image. This requires the lighttpd webserver and is
3511 currently supported on Linux only.
3515 New in Isabelle2009 (April 2009)
3516 --------------------------------
3520 * Simplified main Isabelle executables, with less surprises on
3521 case-insensitive file-systems (such as Mac OS).
3523 - The main Isabelle tool wrapper is now called "isabelle" instead of
3526 - The former "isabelle" alias for "isabelle-process" has been
3527 removed (should rarely occur to regular users).
3529 - The former "isabelle-interface" and its alias "Isabelle" have been
3530 removed (interfaces are now regular Isabelle tools).
3532 Within scripts and make files, the Isabelle environment variables
3533 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
3534 respectively. (The latter are still available as legacy feature.)
3536 The old isabelle-interface wrapper could react in confusing ways if
3537 the interface was uninstalled or changed otherwise. Individual
3538 interface tool configuration is now more explicit, see also the
3539 Isabelle system manual. In particular, Proof General is now available
3540 via "isabelle emacs".
3542 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
3543 purge installed copies of Isabelle executables and re-run "isabelle
3544 install -p ...", or use symlinks.
3546 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
3547 old ~/isabelle, which was slightly non-standard and apt to cause
3548 surprises on case-insensitive file-systems (such as Mac OS).
3550 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
3551 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
3552 care is required when using older releases of Isabelle. Note that
3553 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
3554 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
3556 * Proofs of fully specified statements are run in parallel on
3557 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
3558 a regular 4-core machine, if the initial heap space is made reasonably
3559 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
3561 * The main reference manuals ("isar-ref", "implementation", and
3562 "system") have been updated and extended. Formally checked references
3563 as hyperlinks are now available uniformly.
3568 * Complete re-implementation of locales. INCOMPATIBILITY in several
3569 respects. The most important changes are listed below. See the
3570 Tutorial on Locales ("locales" manual) for details.
3572 - In locale expressions, instantiation replaces renaming. Parameters
3573 must be declared in a for clause. To aid compatibility with previous
3574 parameter inheritance, in locale declarations, parameters that are not
3575 'touched' (instantiation position "_" or omitted) are implicitly added
3576 with their syntax at the beginning of the for clause.
3578 - Syntax from abbreviations and definitions in locales is available in
3579 locale expressions and context elements. The latter is particularly
3580 useful in locale declarations.
3582 - More flexible mechanisms to qualify names generated by locale
3583 expressions. Qualifiers (prefixes) may be specified in locale
3584 expressions, and can be marked as mandatory (syntax: "name!:") or
3585 optional (syntax "name?:"). The default depends for plain "name:"
3586 depends on the situation where a locale expression is used: in
3587 commands 'locale' and 'sublocale' prefixes are optional, in
3588 'interpretation' and 'interpret' prefixes are mandatory. The old
3589 implicit qualifiers derived from the parameter names of a locale are
3590 no longer generated.
3592 - Command "sublocale l < e" replaces "interpretation l < e". The
3593 instantiation clause in "interpretation" and "interpret" (square
3594 brackets) is no longer available. Use locale expressions.
3596 - When converting proof scripts, mandatory qualifiers in
3597 'interpretation' and 'interpret' should be retained by default, even
3598 if this is an INCOMPATIBILITY compared to former behavior. In the
3599 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
3600 in locale expressions range over a single locale instance only.
3602 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
3603 In existing theorem specifications replace the includes element by the
3604 respective context elements of the included locale, omitting those
3605 that are already present in the theorem specification. Multiple
3606 assume elements of a locale should be replaced by a single one
3607 involving the locale predicate. In the proof body, declarations (most
3608 notably theorems) may be regained by interpreting the respective
3609 locales in the proof context as required (command "interpret").
3611 If using "includes" in replacement of a target solely because the
3612 parameter types in the theorem are not as general as in the target,
3613 consider declaring a new locale with additional type constraints on
3614 the parameters (context element "constrains").
3616 - Discontinued "locale (open)". INCOMPATIBILITY.
3618 - Locale interpretation commands no longer attempt to simplify goal.
3619 INCOMPATIBILITY: in rare situations the generated goal differs. Use
3620 methods intro_locales and unfold_locales to clarify.
3622 - Locale interpretation commands no longer accept interpretation
3623 attributes. INCOMPATIBILITY.
3625 * Class declaration: so-called "base sort" must not be given in import
3626 list any longer, but is inferred from the specification. Particularly
3633 class foo = type + ...
3635 * Class target: global versions of theorems stemming do not carry a
3636 parameter prefix any longer. INCOMPATIBILITY.
3638 * Class 'instance' command no longer accepts attached definitions.
3639 INCOMPATIBILITY, use proper 'instantiation' target instead.
3641 * Recovered hiding of consts, which was accidentally broken in
3642 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
3643 makes c inaccessible; consider using ``hide (open) const c'' instead.
3645 * Slightly more coherent Pure syntax, with updated documentation in
3646 isar-ref manual. Removed locales meta_term_syntax and
3647 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
3648 INCOMPATIBILITY in rare situations. Note that &&& should not be used
3649 directly in regular applications.
3651 * There is a new syntactic category "float_const" for signed decimal
3652 fractions (e.g. 123.45 or -123.45).
3654 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
3655 interface with 'setup' command instead.
3657 * Command 'local_setup' is similar to 'setup', but operates on a local
3660 * The 'axiomatization' command now only works within a global theory
3661 context. INCOMPATIBILITY.
3663 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
3664 hypotheses. Sorts required in the course of reasoning need to be
3665 covered by the constraints in the initial statement, completed by the
3666 type instance information of the background theory. Non-trivial sort
3667 hypotheses, which rarely occur in practice, may be specified via
3668 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
3670 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
3672 The result contains an implicit sort hypotheses as before --
3673 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
3676 * Generalized Isar history, with support for linear undo, direct state
3679 * Changed defaults for unify configuration options:
3681 unify_trace_bound = 50 (formerly 25)
3682 unify_search_bound = 60 (formerly 30)
3684 * Different bookkeeping for code equations (INCOMPATIBILITY):
3686 a) On theory merge, the last set of code equations for a particular
3687 constant is taken (in accordance with the policy applied by other
3688 parts of the code generator framework).
3690 b) Code equations stemming from explicit declarations (e.g. code
3691 attribute) gain priority over default code equations stemming
3692 from definition, primrec, fun etc.
3694 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
3696 * Unified theorem tables for both code generators. Thus [code
3697 func] has disappeared and only [code] remains. INCOMPATIBILITY.
3699 * Command 'find_consts' searches for constants based on type and name
3702 find_consts "_ => bool"
3704 By default, matching is against subtypes, but it may be restricted to
3705 the whole type. Searching by name is possible. Multiple queries are
3706 conjunctive and queries may be negated by prefixing them with a
3709 find_consts strict: "_ => bool" name: "Int" -"int => int"
3711 * New 'find_theorems' criterion "solves" matches theorems that
3712 directly solve the current goal (modulo higher-order unification).
3714 * Auto solve feature for main theorem statements: whenever a new goal
3715 is stated, "find_theorems solves" is called; any theorems that could
3716 solve the lemma directly are listed as part of the goal state.
3717 Cf. associated options in Proof General Isabelle settings menu,
3718 enabled by default, with reasonable timeout for pathological cases of
3719 higher-order unification.
3722 *** Document preparation ***
3724 * Antiquotation @{lemma} now imitates a regular terminal proof,
3725 demanding keyword 'by' and supporting the full method expression
3726 syntax just like the Isar command 'by'.
3731 * Integrated main parts of former image HOL-Complex with HOL. Entry
3732 points Main and Complex_Main remain as before.
3734 * Logic image HOL-Plain provides a minimal HOL with the most important
3735 tools available (inductive, datatype, primrec, ...). This facilitates
3736 experimentation and tool development. Note that user applications
3737 (and library theories) should never refer to anything below theory
3740 * Logic image HOL-Main stops at theory Main, and thus facilitates
3741 experimentation due to shorter build times.
3743 * Logic image HOL-NSA contains theories of nonstandard analysis which
3744 were previously part of former HOL-Complex. Entry point Hyperreal
3745 remains valid, but theories formerly using Complex_Main should now use
3746 new entry point Hypercomplex.
3748 * Generic ATP manager for Sledgehammer, based on ML threads instead of
3749 Posix processes. Avoids potentially expensive forking of the ML
3750 process. New thread-based implementation also works on non-Unix
3751 platforms (Cygwin). Provers are no longer hardwired, but defined
3752 within the theory via plain ML wrapper functions. Basic Sledgehammer
3753 commands are covered in the isar-ref manual.
3755 * Wrapper scripts for remote SystemOnTPTP service allows to use
3756 sledgehammer without local ATP installation (Vampire etc.). Other
3757 provers may be included via suitable ML wrappers, see also
3758 src/HOL/ATP_Linkup.thy.
3760 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
3763 * The metis method no longer fails because the theorem is too trivial
3764 (contains the empty clause).
3766 * The metis method now fails in the usual manner, rather than raising
3767 an exception, if it determines that it cannot prove the theorem.
3769 * Method "coherent" implements a prover for coherent logic (see also
3770 src/Tools/coherent.ML).
3772 * Constants "undefined" and "default" replace "arbitrary". Usually
3773 "undefined" is the right choice to replace "arbitrary", though
3774 logically there is no difference. INCOMPATIBILITY.
3776 * Command "value" now integrates different evaluation mechanisms. The
3777 result of the first successful evaluation mechanism is printed. In
3778 square brackets a particular named evaluation mechanisms may be
3779 specified (currently, [SML], [code] or [nbe]). See further
3780 src/HOL/ex/Eval_Examples.thy.
3782 * Normalization by evaluation now allows non-leftlinear equations.
3783 Declare with attribute [code nbe].
3785 * Methods "case_tac" and "induct_tac" now refer to the very same rules
3786 as the structured Isar versions "cases" and "induct", cf. the
3787 corresponding "cases" and "induct" attributes. Mutual induction rules
3788 are now presented as a list of individual projections
3789 (e.g. foo_bar.inducts for types foo and bar); the old format with
3790 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
3791 rare situations a different rule is selected --- notably nested tuple
3792 elimination instead of former prod.exhaust: use explicit (case_tac t
3793 rule: prod.exhaust) here.
3795 * Attributes "cases", "induct", "coinduct" support "del" option.
3797 * Removed fact "case_split_thm", which duplicates "case_split".
3799 * The option datatype has been moved to a new theory Option. Renamed
3800 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
3802 * New predicate "strict_mono" classifies strict functions on partial
3803 orders. With strict functions on linear orders, reasoning about
3804 (in)equalities is facilitated by theorems "strict_mono_eq",
3805 "strict_mono_less_eq" and "strict_mono_less".
3807 * Some set operations are now proper qualified constants with
3808 authentic syntax. INCOMPATIBILITY:
3819 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
3822 * Auxiliary class "itself" has disappeared -- classes without any
3823 parameter are treated as expected by the 'class' command.
3825 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
3827 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
3828 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
3830 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
3831 method "approximation". It proves formulas on real values by using
3832 interval arithmetic. In the formulas are also the transcendental
3833 functions sin, cos, tan, atan, ln, exp and the constant pi are
3834 allowed. For examples see
3835 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
3837 * Theory "Reflection" now resides in HOL/Library.
3839 * Entry point to Word library now simply named "Word".
3842 * Made source layout more coherent with logical distribution
3845 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
3846 src/HOL/Library/Code_Message.thy ~> src/HOL/
3847 src/HOL/Library/GCD.thy ~> src/HOL/
3848 src/HOL/Library/Order_Relation.thy ~> src/HOL/
3849 src/HOL/Library/Parity.thy ~> src/HOL/
3850 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
3851 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
3852 src/HOL/Real/Lubs.thy ~> src/HOL/
3853 src/HOL/Real/PReal.thy ~> src/HOL/
3854 src/HOL/Real/Rational.thy ~> src/HOL/
3855 src/HOL/Real/RComplete.thy ~> src/HOL/
3856 src/HOL/Real/RealDef.thy ~> src/HOL/
3857 src/HOL/Real/RealPow.thy ~> src/HOL/
3858 src/HOL/Real/Real.thy ~> src/HOL/
3859 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
3860 src/HOL/Complex/Complex.thy ~> src/HOL/
3861 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
3862 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
3863 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
3864 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
3865 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
3866 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
3867 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
3868 src/HOL/Hyperreal/Log.thy ~> src/HOL/
3869 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
3870 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
3871 src/HOL/Hyperreal/Series.thy ~> src/HOL/
3872 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
3873 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
3874 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
3875 src/HOL/Real/Float ~> src/HOL/Library/
3876 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
3877 src/HOL/Real/RealVector.thy ~> src/HOL/
3879 src/HOL/arith_data.ML ~> src/HOL/Tools
3880 src/HOL/hologic.ML ~> src/HOL/Tools
3881 src/HOL/simpdata.ML ~> src/HOL/Tools
3882 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
3883 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
3884 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
3885 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
3886 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
3887 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
3888 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
3890 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
3891 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
3892 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
3893 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
3894 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
3895 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
3897 * If methods "eval" and "evaluation" encounter a structured proof
3898 state with !!/==>, only the conclusion is evaluated to True (if
3899 possible), avoiding strange error messages.
3901 * Method "sizechange" automates termination proofs using (a
3902 modification of) the size-change principle. Requires SAT solver. See
3903 src/HOL/ex/Termination.thy for examples.
3905 * Simplifier: simproc for let expressions now unfolds if bound
3906 variable occurs at most once in let expression body. INCOMPATIBILITY.
3908 * Method "arith": Linear arithmetic now ignores all inequalities when
3909 fast_arith_neq_limit is exceeded, instead of giving up entirely.
3911 * New attribute "arith" for facts that should always be used
3912 automatically by arithmetic. It is intended to be used locally in
3915 assumes [arith]: "x > 0"
3917 Global usage is discouraged because of possible performance impact.
3919 * New classes "top" and "bot" with corresponding operations "top" and
3920 "bot" in theory Orderings; instantiation of class "complete_lattice"
3921 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
3923 * Changed definition lemma "less_fun_def" in order to provide an
3924 instance for preorders on functions; use lemma "less_le" instead.
3927 * Theory Orderings: class "wellorder" moved here, with explicit
3928 induction rule "less_induct" as assumption. For instantiation of
3929 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
3932 * Theory Orderings: added class "preorder" as superclass of "order".
3933 INCOMPATIBILITY: Instantiation proofs for order, linorder
3934 etc. slightly changed. Some theorems named order_class.* now named
3937 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
3940 * Theory Finite_Set: added a new fold combinator of type
3942 ('a => 'b => 'b) => 'b => 'a set => 'b
3944 Occasionally this is more convenient than the old fold combinator
3945 which is now defined in terms of the new one and renamed to
3948 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
3949 and "ring_simps" have been replaced by "algebra_simps" (which can be
3950 extended with further lemmas!). At the moment both still exist but
3951 the former will disappear at some point.
3953 * Theory Power: Lemma power_Suc is now declared as a simp rule in
3954 class recpower. Type-specific simp rules for various recpower types
3955 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
3957 rat_power_0 -> power_0
3958 rat_power_Suc -> power_Suc
3959 realpow_0 -> power_0
3960 realpow_Suc -> power_Suc
3961 complexpow_0 -> power_0
3962 complexpow_Suc -> power_Suc
3963 power_poly_0 -> power_0
3964 power_poly_Suc -> power_Suc
3966 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
3967 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
3968 dvd has been generalized to class comm_semiring_1. Likewise a bunch
3969 of lemmas from Divides has been generalized from nat to class
3970 semiring_div. INCOMPATIBILITY. This involves the following theorem
3971 renames resulting from duplicate elimination:
3973 dvd_def_mod ~> dvd_eq_mod_eq_0
3974 zero_dvd_iff ~> dvd_0_left_iff
3975 dvd_0 ~> dvd_0_right
3976 DIVISION_BY_ZERO_DIV ~> div_by_0
3977 DIVISION_BY_ZERO_MOD ~> mod_by_0
3978 mult_div ~> div_mult_self2_is_id
3979 mult_mod ~> mod_mult_self2_is_0
3981 * Theory IntDiv: removed many lemmas that are instances of class-based
3982 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
3983 rename old lemmas as follows:
3985 dvd_diff -> nat_dvd_diff
3986 dvd_zminus_iff -> dvd_minus_iff
3987 mod_add1_eq -> mod_add_eq
3988 mod_mult1_eq -> mod_mult_right_eq
3989 mod_mult1_eq' -> mod_mult_left_eq
3990 mod_mult_distrib_mod -> mod_mult_eq
3991 nat_mod_add_left_eq -> mod_add_left_eq
3992 nat_mod_add_right_eq -> mod_add_right_eq
3993 nat_mod_div_trivial -> mod_div_trivial
3994 nat_mod_mod_trivial -> mod_mod_trivial
3995 zdiv_zadd_self1 -> div_add_self1
3996 zdiv_zadd_self2 -> div_add_self2
3997 zdiv_zmult_self1 -> div_mult_self2_is_id
3998 zdiv_zmult_self2 -> div_mult_self1_is_id
3999 zdvd_triv_left -> dvd_triv_left
4000 zdvd_triv_right -> dvd_triv_right
4001 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
4002 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
4003 zmod_zadd_left_eq -> mod_add_left_eq
4004 zmod_zadd_right_eq -> mod_add_right_eq
4005 zmod_zadd_self1 -> mod_add_self1
4006 zmod_zadd_self2 -> mod_add_self2
4007 zmod_zadd1_eq -> mod_add_eq
4008 zmod_zdiff1_eq -> mod_diff_eq
4009 zmod_zdvd_zmod -> mod_mod_cancel
4010 zmod_zmod_cancel -> mod_mod_cancel
4011 zmod_zmult_self1 -> mod_mult_self2_is_0
4012 zmod_zmult_self2 -> mod_mult_self1_is_0
4015 zdvd_abs1 -> abs_dvd_iff
4016 zdvd_abs2 -> dvd_abs_iff
4017 zdvd_refl -> dvd_refl
4018 zdvd_trans -> dvd_trans
4019 zdvd_zadd -> dvd_add
4020 zdvd_zdiff -> dvd_diff
4021 zdvd_zminus_iff -> dvd_minus_iff
4022 zdvd_zminus2_iff -> minus_dvd_iff
4023 zdvd_zmultD -> dvd_mult_right
4024 zdvd_zmultD2 -> dvd_mult_left
4025 zdvd_zmult_mono -> mult_dvd_mono
4026 zdvd_0_right -> dvd_0_right
4027 zdvd_0_left -> dvd_0_left_iff
4028 zdvd_1_left -> one_dvd
4029 zminus_dvd_iff -> minus_dvd_iff
4031 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
4033 * The real numbers offer decimal input syntax: 12.34 is translated
4034 into 1234/10^2. This translation is not reversed upon output.
4036 * Theory Library/Polynomial defines an abstract type 'a poly of
4037 univariate polynomials with coefficients of type 'a. In addition to
4038 the standard ring operations, it also supports div and mod. Code
4039 generation is also supported, using list-style constructors.
4041 * Theory Library/Inner_Product defines a class of real_inner for real
4042 inner product spaces, with an overloaded operation inner :: 'a => 'a
4043 => real. Class real_inner is a subclass of real_normed_vector from
4046 * Theory Library/Product_Vector provides instances for the product
4047 type 'a * 'b of several classes from RealVector and Inner_Product.
4048 Definitions of addition, subtraction, scalar multiplication, norms,
4049 and inner products are included.
4051 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
4052 addition to the field operations, numerals and case syntax are also
4055 * Theory Library/Diagonalize provides constructive version of Cantor's
4056 first diagonalization argument.
4058 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
4059 zlcm (for int); carried together from various gcd/lcm developements in
4060 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
4061 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
4062 may recover tupled syntax as follows:
4064 hide (open) const gcd
4065 abbreviation gcd where
4066 "gcd == (%(a, b). GCD.gcd a b)"
4068 GCD.gcd ("gcd '(_, _')")
4070 The same works for lcm, zgcd, zlcm.
4072 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
4073 instantiations for algebraic structures. Removed some duplicate
4074 theorems. Changes in simp rules. INCOMPATIBILITY.
4076 * ML antiquotation @{code} takes a constant as argument and generates
4077 corresponding code in background and inserts name of the corresponding
4078 resulting ML value/function/datatype constructor binding in place.
4079 All occurrences of @{code} with a single ML block are generated
4080 simultaneously. Provides a generic and safe interface for
4081 instrumentalizing code generation. See
4082 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
4083 In future you ought to refrain from ad-hoc compiling generated SML
4084 code on the ML toplevel. Note that (for technical reasons) @{code}
4085 cannot refer to constants for which user-defined serializations are
4086 set. Refer to the corresponding ML counterpart directly in that
4089 * Command 'rep_datatype': instead of theorem names the command now
4090 takes a list of terms denoting the constructors of the type to be
4091 represented as datatype. The characteristic theorems have to be
4092 proven. INCOMPATIBILITY. Also observe that the following theorems
4093 have disappeared in favour of existing ones:
4095 unit_induct ~> unit.induct
4096 prod_induct ~> prod.induct
4097 sum_induct ~> sum.induct
4098 Suc_Suc_eq ~> nat.inject
4099 Suc_not_Zero Zero_not_Suc ~> nat.distinct
4104 * New locales for orders and lattices where the equivalence relation
4105 is not restricted to equality. INCOMPATIBILITY: all order and lattice
4106 locales use a record structure with field eq for the equivalence.
4108 * New theory of factorial domains.
4110 * Units_l_inv and Units_r_inv are now simp rules by default.
4111 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
4112 and/or r_inv will now also require deletion of these lemmas.
4114 * Renamed the following theorems, INCOMPATIBILITY:
4116 UpperD ~> Upper_memD
4117 LowerD ~> Lower_memD
4118 least_carrier ~> least_closed
4119 greatest_carrier ~> greatest_closed
4120 greatest_Lower_above ~> greatest_Lower_below
4121 one_zero ~> carrier_one_zero
4122 one_not_zero ~> carrier_one_not_zero (collision with assumption)
4127 * Nominal datatypes can now contain type-variables.
4129 * Commands 'nominal_inductive' and 'equivariance' work with local
4132 * Nominal primrec can now works with local theory targets and its
4133 specification syntax now conforms to the general format as seen in
4136 * Method "perm_simp" honours the standard simplifier attributes
4137 (no_asm), (no_asm_use) etc.
4139 * The new predicate #* is defined like freshness, except that on the
4140 left hand side can be a set or list of atoms.
4142 * Experimental command 'nominal_inductive2' derives strong induction
4143 principles for inductive definitions. In contrast to
4144 'nominal_inductive', which can only deal with a fixed number of
4145 binders, it can deal with arbitrary expressions standing for sets of
4146 atoms to be avoided. The only inductive definition we have at the
4147 moment that needs this generalisation is the typing rule for Lets in
4150 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
4151 -----------------------------------------------------------------
4152 Gamma |- Let x be t1 in t2 : T2
4154 In this rule one wants to avoid all the binders that are introduced by
4155 "close Gamma T1". We are looking for other examples where this
4156 feature might be useful. Please let us know.
4161 * Reimplemented the simplification procedure for proving continuity
4162 subgoals. The new simproc is extensible; users can declare additional
4163 continuity introduction rules with the attribute [cont2cont].
4165 * The continuity simproc now uses a different introduction rule for
4166 solving continuity subgoals on terms with lambda abstractions. In
4167 some rare cases the new simproc may fail to solve subgoals that the
4168 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
4169 Potential INCOMPATIBILITY.
4171 * Command 'fixrec': specification syntax now conforms to the general
4172 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
4173 examples. INCOMPATIBILITY.
4178 * Proof of Zorn's Lemma for partial orders.
4183 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
4184 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
4185 depends on multithreading, so timouts will not work before Poly/ML
4188 * High-level support for concurrent ML programming, see
4189 src/Pure/Cuncurrent. The data-oriented model of "future values" is
4190 particularly convenient to organize independent functional
4191 computations. The concept of "synchronized variables" provides a
4192 higher-order interface for components with shared state, avoiding the
4193 delicate details of mutexes and condition variables. (Requires
4194 Poly/ML 5.2.1 or later.)
4196 * ML bindings produced via Isar commands are stored within the Isar
4197 context (theory or proof). Consequently, commands like 'use' and 'ML'
4198 become thread-safe and work with undo as expected (concerning
4199 top-level bindings, not side-effects on global references).
4200 INCOMPATIBILITY, need to provide proper Isar context when invoking the
4201 compiler at runtime; really global bindings need to be given outside a
4202 theory. (Requires Poly/ML 5.2 or later.)
4204 * Command 'ML_prf' is analogous to 'ML' but works within a proof
4205 context. Top-level ML bindings are stored within the proof context in
4206 a purely sequential fashion, disregarding the nested proof structure.
4207 ML bindings introduced by 'ML_prf' are discarded at the end of the
4208 proof. (Requires Poly/ML 5.2 or later.)
4210 * Simplified ML attribute and method setup, cf. functions Attrib.setup
4211 and Method.setup, as well as Isar commands 'attribute_setup' and
4212 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
4213 existing code accordingly, or use plain 'setup' together with old
4216 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
4217 to 'a -> thm, while results are always tagged with an authentic oracle
4218 name. The Isar command 'oracle' is now polymorphic, no argument type
4219 is specified. INCOMPATIBILITY, need to simplify existing oracle code
4220 accordingly. Note that extra performance may be gained by producing
4221 the cterm carefully, avoiding slow Thm.cterm_of.
4223 * Simplified interface for defining document antiquotations via
4224 ThyOutput.antiquotation, ThyOutput.output, and optionally
4225 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
4226 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
4229 * More systematic treatment of long names, abstract name bindings, and
4230 name space operations. Basic operations on qualified names have been
4231 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
4232 Long_Name.append. Old type bstring has been mostly replaced by
4233 abstract type binding (see structure Binding), which supports precise
4234 qualification by packages and local theory targets, as well as proper
4235 tracking of source positions. INCOMPATIBILITY, need to wrap old
4236 bstring values into Binding.name, or better pass through abstract
4237 bindings everywhere. See further src/Pure/General/long_name.ML,
4238 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
4240 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
4241 LocalTheory.note etc.) now refer to the *full* internal name, not the
4242 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
4244 * Disposed old type and term read functions (Sign.read_def_typ,
4245 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
4246 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
4247 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
4248 Syntax.read_term_global etc.; see also OldGoals.read_term as last
4249 resort for legacy applications.
4251 * Disposed old declarations, tactics, tactic combinators that refer to
4252 the simpset or claset of an implicit theory (such as Addsimps,
4253 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
4254 embedded ML text, or local_simpset_of with a proper context passed as
4255 explicit runtime argument.
4257 * Rules and tactics that read instantiations (read_instantiate,
4258 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
4259 context, which is required for parsing and type-checking. Moreover,
4260 the variables are specified as plain indexnames, not string encodings
4261 thereof. INCOMPATIBILITY.
4263 * Generic Toplevel.add_hook interface allows to analyze the result of
4264 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
4265 for theorem dependency output of transactions resulting in a new
4268 * ML antiquotations: block-structured compilation context indicated by
4269 \<lbrace> ... \<rbrace>; additional antiquotation forms:
4271 @{binding name} - basic name binding
4272 @{let ?pat = term} - term abbreviation (HO matching)
4273 @{note name = fact} - fact abbreviation
4274 @{thm fact} - singleton fact (with attributes)
4275 @{thms fact} - general fact (with attributes)
4276 @{lemma prop by method} - singleton goal
4277 @{lemma prop by meth1 meth2} - singleton goal
4278 @{lemma prop1 ... propN by method} - general goal
4279 @{lemma prop1 ... propN by meth1 meth2} - general goal
4280 @{lemma (open) ...} - open derivation
4285 * The Isabelle "emacs" tool provides a specific interface to invoke
4286 Proof General / Emacs, with more explicit failure if that is not
4287 installed (the old isabelle-interface script silently falls back on
4288 isabelle-process). The PROOFGENERAL_HOME setting determines the
4289 installation location of the Proof General distribution.
4291 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
4292 the Isabelle process into a JVM/Scala application. See
4293 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
4294 process wrapper has been discontinued.)
4296 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
4298 * Various status messages (with exact source position information) are
4299 emitted, if proper markup print mode is enabled. This allows
4300 user-interface components to provide detailed feedback on internal
4305 New in Isabelle2008 (June 2008)
4306 -------------------------------
4310 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
4311 and updated, with formally checked references as hyperlinks.
4313 * Theory loader: use_thy (and similar operations) no longer set the
4314 implicit ML context, which was occasionally hard to predict and in
4315 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
4316 provides a proper context already.
4318 * Theory loader: old-style ML proof scripts being *attached* to a thy
4319 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
4320 'use' within a theory file will do the job.
4322 * Name space merge now observes canonical order, i.e. the second space
4323 is inserted into the first one, while existing entries in the first
4324 space take precedence. INCOMPATIBILITY in rare situations, may try to
4325 swap theory imports.
4327 * Syntax: symbol \<chi> is now considered a letter. Potential
4328 INCOMPATIBILITY in identifier syntax etc.
4330 * Outer syntax: string tokens no longer admit escaped white space,
4331 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
4332 white space without escapes.
4334 * Outer syntax: string tokens may contain arbitrary character codes
4335 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
4341 * Context-dependent token translations. Default setup reverts locally
4342 fixed variables, and adds hilite markup for undeclared frees.
4344 * Unused theorems can be found using the new command 'unused_thms'.
4345 There are three ways of invoking it:
4348 Only finds unused theorems in the current theory.
4350 (2) unused_thms thy_1 ... thy_n -
4351 Finds unused theorems in the current theory and all of its ancestors,
4352 excluding the theories thy_1 ... thy_n and all of their ancestors.
4354 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
4355 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
4356 their ancestors, excluding the theories thy_1 ... thy_n and all of
4359 In order to increase the readability of the list produced by
4360 unused_thms, theorems that have been created by a particular instance
4361 of a theory command such as 'inductive' or 'function' are considered
4362 to belong to the same "group", meaning that if at least one theorem in
4363 this group is used, the other theorems in the same group are no longer
4364 reported as unused. Moreover, if all theorems in the group are
4365 unused, only one theorem in the group is displayed.
4367 Note that proof objects have to be switched on in order for
4368 unused_thms to work properly (i.e. !proofs must be >= 1, which is
4369 usually the case when using Proof General with the default settings).
4371 * Authentic naming of facts disallows ad-hoc overwriting of previous
4372 theorems within the same name space. INCOMPATIBILITY, need to remove
4373 duplicate fact bindings, or even accidental fact duplications. Note
4374 that tools may maintain dynamically scoped facts systematically, using
4375 PureThy.add_thms_dynamic.
4377 * Command 'hide' now allows to hide from "fact" name space as well.
4379 * Eliminated destructive theorem database, simpset, claset, and
4380 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
4381 update of theories within ML code.
4383 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
4384 INCOMPATIBILITY, object-logics depending on former Pure require
4385 additional setup PureThy.old_appl_syntax_setup; object-logics
4386 depending on former CPure need to refer to Pure.
4388 * Commands 'use' and 'ML' are now purely functional, operating on
4389 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
4390 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
4393 * Command 'setup': discontinued implicit version with ML reference.
4395 * Instantiation target allows for simultaneous specification of class
4396 instance operations together with an instantiation proof.
4397 Type-checking phase allows to refer to class operations uniformly.
4398 See src/HOL/Complex/Complex.thy for an Isar example and
4399 src/HOL/Library/Eval.thy for an ML example.
4401 * Indexing of literal facts: be more serious about including only
4402 facts from the visible specification/proof context, but not the
4403 background context (locale etc.). Affects `prop` notation and method
4404 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
4407 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
4408 "(open)" option, which used to expose internal bound variables to the
4411 * Isar statements: removed obsolete case "rule_context".
4412 INCOMPATIBILITY, better use explicit fixes/assumes.
4414 * Locale proofs: default proof step now includes 'unfold_locales';
4415 hence 'proof' without argument may be used to unfold locale
4419 *** Document preparation ***
4421 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
4422 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
4423 obsolete thumbpdf setup (contemporary PDF viewers do this on the
4424 spot); renamed link color from "darkblue" to "linkcolor" (default
4425 value unchanged, can be redefined via \definecolor); no longer sets
4426 "a4paper" option (unnecessary or even intrusive).
4428 * Antiquotation @{lemma A method} proves proposition A by the given
4429 method (either a method name or a method name plus (optional) method
4430 arguments in parentheses) and prints A just like @{prop A}.
4435 * New primrec package. Specification syntax conforms in style to
4436 definition/function/.... No separate induction rule is provided. The
4437 "primrec" command distinguishes old-style and new-style specifications
4438 by syntax. The former primrec package is now named OldPrimrecPackage.
4439 When adjusting theories, beware: constants stemming from new-style
4440 primrec specifications have authentic syntax.
4442 * Metis prover is now an order of magnitude faster, and also works
4443 with multithreading.
4445 * Metis: the maximum number of clauses that can be produced from a
4446 theorem is now given by the attribute max_clauses. Theorems that
4447 exceed this number are ignored, with a warning printed.
4449 * Sledgehammer no longer produces structured proofs by default. To
4450 enable, declare [[sledgehammer_full = true]]. Attributes
4451 reconstruction_modulus, reconstruction_sorts renamed
4452 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
4454 * Method "induct_scheme" derives user-specified induction rules
4455 from well-founded induction and completeness of patterns. This factors
4456 out some operations that are done internally by the function package
4457 and makes them available separately. See
4458 src/HOL/ex/Induction_Scheme.thy for examples.
4460 * More flexible generation of measure functions for termination
4461 proofs: Measure functions can be declared by proving a rule of the
4462 form "is_measure f" and giving it the [measure_function] attribute.
4463 The "is_measure" predicate is logically meaningless (always true), and
4464 just guides the heuristic. To find suitable measure functions, the
4465 termination prover sets up the goal "is_measure ?f" of the appropriate
4466 type and generates all solutions by prolog-style backwards proof using
4469 This setup also deals with rules like
4471 "is_measure f ==> is_measure (list_size f)"
4473 which accommodates nested datatypes that recurse through lists.
4474 Similar rules are predeclared for products and option types.
4476 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
4480 - Definitions of overloaded constants on sets have to be replaced by
4481 definitions on => and bool.
4483 - Some definitions of overloaded operators on sets can now be proved
4484 using the definitions of the operators on => and bool. Therefore,
4485 the following theorems have been renamed:
4487 subset_def -> subset_eq
4488 psubset_def -> psubset_eq
4489 set_diff_def -> set_diff_eq
4490 Compl_def -> Compl_eq
4491 Sup_set_def -> Sup_set_eq
4492 Inf_set_def -> Inf_set_eq
4493 sup_set_def -> sup_set_eq
4494 inf_set_def -> inf_set_eq
4496 - Due to the incompleteness of the HO unification algorithm, some
4497 rules such as subst may require manual instantiation, if some of
4498 the unknowns in the rule is a set.
4500 - Higher order unification and forward proofs:
4503 have "P (S::'a set)" <...>
4504 then have "EX S. P S" ..
4506 no longer works (due to the incompleteness of the HO unification
4507 algorithm) and must be replaced by the pattern
4514 - Calculational reasoning with subst (or similar rules):
4517 have "P (S::'a set)" <...>
4518 also have "S = T" <...>
4519 finally have "P T" .
4521 no longer works (for similar reasons as the previous example) and
4522 must be replaced by something like
4524 have "P (S::'a set)" <...>
4525 moreover have "S = T" <...>
4526 ultimately have "P T" by simp
4528 - Tactics or packages written in ML code:
4529 Code performing pattern matching on types via
4531 Type ("set", [T]) => ...
4533 must be rewritten. Moreover, functions like strip_type or
4534 binder_types no longer return the right value when applied to a
4537 T1 => ... => Tn => U => bool
4541 T1 => ... => Tn => U set
4543 * Merged theories Wellfounded_Recursion, Accessible_Part and
4544 Wellfounded_Relations to theory Wellfounded.
4546 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
4548 * Class finite no longer treats UNIV as class parameter. Use class
4549 enum from theory Library/Enum instead to achieve a similar effect.
4552 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
4553 and "Cons". INCOMPATIBILITY.
4555 * HOL (and FOL): renamed variables in rules imp_elim and swap.
4556 Potential INCOMPATIBILITY.
4558 * Theory Product_Type: duplicated lemmas split_Pair_apply and
4559 injective_fst_snd removed, use split_eta and prod_eqI instead.
4560 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
4562 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
4563 the same name in theory Orderings:
4573 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
4574 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
4575 and different variable names.
4577 * Library/Option_ord.thy: Canonical order on option type.
4579 * Library/RBT.thy: Red-black trees, an efficient implementation of
4582 * Library/Countable.thy: Type class for countable types.
4584 * Theory Int: The representation of numerals has changed. The infix
4585 operator BIT and the bit datatype with constructors B0 and B1 have
4586 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
4587 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
4588 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
4591 * Theory Nat: definition of <= and < on natural numbers no longer
4592 depend on well-founded relations. INCOMPATIBILITY. Definitions
4593 le_def and less_def have disappeared. Consider lemmas not_less
4594 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
4596 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
4597 (whose purpose mainly is for various fold_set functionals) have been
4598 abandoned in favor of the existing algebraic classes
4599 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
4600 lower_semilattice (resp. upper_semilattice) and linorder.
4603 * Theory Transitive_Closure: induct and cases rules now declare proper
4604 case_names ("base" and "step"). INCOMPATIBILITY.
4606 * Theorem Inductive.lfp_ordinal_induct generalized to complete
4607 lattices. The form set-specific version is available as
4608 Inductive.lfp_ordinal_induct_set.
4610 * Renamed theorems "power.simps" to "power_int.simps".
4613 * Class semiring_div provides basic abstract properties of semirings
4614 with division and modulo operations. Subsumes former class dvd_mod.
4616 * Merged theories IntDef, Numeral and IntArith into unified theory
4617 Int. INCOMPATIBILITY.
4619 * Theory Library/Code_Index: type "index" now represents natural
4620 numbers rather than integers. INCOMPATIBILITY.
4622 * New class "uminus" with operation "uminus" (split of from class
4623 "minus" which now only has operation "minus", binary).
4626 * Constants "card", "internal_split", "option_map" now with authentic
4627 syntax. INCOMPATIBILITY.
4629 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
4630 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
4631 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
4632 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
4633 Sup_set_def, le_def, less_def, option_map_def now with object
4634 equality. INCOMPATIBILITY.
4636 * Records. Removed K_record, and replaced it by pure lambda term
4637 %x. c. The simplifier setup is now more robust against eta expansion.
4638 INCOMPATIBILITY: in cases explicitly referring to K_record.
4640 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
4642 * Library/ListVector: new theory of arithmetic vector operations.
4644 * Library/Order_Relation: new theory of various orderings as sets of
4645 pairs. Defines preorders, partial orders, linear orders and
4646 well-orders on sets and on types.
4651 * Renamed some theories to allow to loading both ZF and HOL in the
4654 Datatype -> Datatype_ZF
4655 Inductive -> Inductive_ZF
4662 INCOMPATIBILITY: ZF theories that import individual theories below
4663 Main might need to be adapted. Regular theory Main is still
4664 available, as trivial extension of Main_ZF.
4669 * ML within Isar: antiquotation @{const name} or @{const
4670 name(typargs)} produces statically-checked Const term.
4672 * Functor NamedThmsFun: data is available to the user as dynamic fact
4673 (of the same name). Removed obsolete print command.
4675 * Removed obsolete "use_legacy_bindings" function.
4677 * The ``print mode'' is now a thread-local value derived from a global
4678 template (the former print_mode reference), thus access becomes
4679 non-critical. The global print_mode reference is for session
4680 management only; user-code should use print_mode_value,
4681 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
4683 * Functions system/system_out provide a robust way to invoke external
4684 shell commands, with propagation of interrupts (requires Poly/ML
4685 5.2.1). Do not use OS.Process.system etc. from the basis library!
4690 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
4691 in accordance with Proof General 3.7, which prefers GNU emacs.
4693 * isatool tty runs Isabelle process with plain tty interaction;
4694 optional line editor may be specified via ISABELLE_LINE_EDITOR
4695 setting, the default settings attempt to locate "ledit" and "rlwrap".
4697 * isatool browser now works with Cygwin as well, using general
4698 "javapath" function defined in Isabelle process environment.
4700 * YXML notation provides a simple and efficient alternative to
4701 standard XML transfer syntax. See src/Pure/General/yxml.ML and
4702 isatool yxml as described in the Isabelle system manual.
4704 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
4705 provides general wrapper for managing an Isabelle process in a robust
4706 fashion, with ``cooked'' output from stdin/stderr.
4708 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
4709 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
4711 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
4712 way of changing the user's settings is via
4713 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
4716 * Multithreading.max_threads := 0 refers to the number of actual CPU
4717 cores of the underlying machine, which is a good starting point for
4718 optimal performance tuning. The corresponding usedir option -M allows
4719 "max" as an alias for "0". WARNING: does not work on certain versions
4720 of Mac OS (with Poly/ML 5.1).
4722 * isabelle-process: non-ML sessions are run with "nice", to reduce the
4723 adverse effect of Isabelle flooding interactive front-ends (notably
4724 ProofGeneral / XEmacs).
4728 New in Isabelle2007 (November 2007)
4729 -----------------------------------
4733 * More uniform information about legacy features, notably a
4734 warning/error of "Legacy feature: ...", depending on the state of the
4735 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
4736 legacy features will disappear eventually.
4738 * Theory syntax: the header format ``theory A = B + C:'' has been
4739 discontinued in favour of ``theory A imports B C begin''. Use isatool
4740 fixheaders to convert existing theory files. INCOMPATIBILITY.
4742 * Theory syntax: the old non-Isar theory file format has been
4743 discontinued altogether. Note that ML proof scripts may still be used
4744 with Isar theories; migration is usually quite simple with the ML
4745 function use_legacy_bindings. INCOMPATIBILITY.
4747 * Theory syntax: some popular names (e.g. 'class', 'declaration',
4748 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
4751 * Theory loader: be more serious about observing the static theory
4752 header specifications (including optional directories), but not the
4753 accidental file locations of previously successful loads. The strict
4754 update policy of former update_thy is now already performed by
4755 use_thy, so the former has been removed; use_thys updates several
4756 theories simultaneously, just as 'imports' within a theory header
4757 specification, but without merging the results. Potential
4758 INCOMPATIBILITY: may need to refine theory headers and commands
4759 ROOT.ML which depend on load order.
4761 * Theory loader: optional support for content-based file
4762 identification, instead of the traditional scheme of full physical
4763 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
4764 (cf. the system manual). The new scheme allows to work with
4765 non-finished theories in persistent session images, such that source
4766 files may be moved later on without requiring reloads.
4768 * Theory loader: old-style ML proof scripts being *attached* to a thy
4769 file (with the same base name as the theory) are considered a legacy
4770 feature, which will disappear eventually. Even now, the theory loader
4771 no longer maintains dependencies on such files.
4773 * Syntax: the scope for resolving ambiguities via type-inference is
4774 now limited to individual terms, instead of whole simultaneous
4775 specifications as before. This greatly reduces the complexity of the
4776 syntax module and improves flexibility by separating parsing and
4777 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
4778 'fixes' etc.) are required in rare situations.
4780 * Syntax: constants introduced by new-style packages ('definition',
4781 'abbreviation' etc.) are passed through the syntax module in
4782 ``authentic mode''. This means that associated mixfix annotations
4783 really stick to such constants, independently of potential name space
4784 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
4785 trees are represented slightly differently, may need to adapt syntax
4786 translations accordingly. Use CONST marker in 'translations' and
4787 @{const_syntax} antiquotation in 'parse_translation' etc.
4789 * Legacy goal package: reduced interface to the bare minimum required
4790 to keep existing proof scripts running. Most other user-level
4791 functions are now part of the OldGoals structure, which is *not* open
4792 by default (consider isatool expandshort before open OldGoals).
4793 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
4794 these tend to cause confusion about the actual goal (!) context being
4795 used here, which is not necessarily the same as the_context().
4797 * Command 'find_theorems': supports "*" wild-card in "name:"
4798 criterion; "with_dups" option. Certain ProofGeneral versions might
4799 support a specific search form (see ProofGeneral/CHANGES).
4801 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
4802 by default, which means that "prems" (and also "fixed variables") are
4803 suppressed from proof state output. Note that the ProofGeneral
4804 settings mechanism allows to change and save options persistently, but
4805 older versions of Isabelle will fail to start up if a negative prems
4808 * Local theory targets may be specified by non-nested blocks of
4809 ``context/locale/class ... begin'' followed by ``end''. The body may
4810 contain definitions, theorems etc., including any derived mechanism
4811 that has been implemented on top of these primitives. This concept
4812 generalizes the existing ``theorem (in ...)'' towards more versatility
4815 * Proof General interface: proper undo of final 'end' command;
4816 discontinued Isabelle/classic mode (ML proof scripts).
4819 *** Document preparation ***
4821 * Added antiquotation @{theory name} which prints the given name,
4822 after checking that it refers to a valid ancestor theory in the
4825 * Added antiquotations @{ML_type text} and @{ML_struct text} which
4826 check the given source text as ML type/structure, printing verbatim.
4828 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
4829 "c args == rhs" given in the current context. (Any number of
4830 arguments may be given on the LHS.)
4835 * The 'class' package offers a combination of axclass and locale to
4836 achieve Haskell-like type classes in Isabelle. Definitions and
4837 theorems within a class context produce both relative results (with
4838 implicit parameters according to the locale context), and polymorphic
4839 constants with qualified polymorphism (according to the class
4840 context). Within the body context of a 'class' target, a separate
4841 syntax layer ("user space type system") takes care of converting
4842 between global polymorphic consts and internal locale representation.
4843 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
4844 "isatool doc classes" provides a tutorial.
4846 * Generic code generator framework allows to generate executable
4847 code for ML and Haskell (including Isabelle classes). A short usage
4850 internal compilation:
4851 export_code <list of constants (term syntax)> in SML
4852 writing SML code to a file:
4853 export_code <list of constants (term syntax)> in SML <filename>
4854 writing OCaml code to a file:
4855 export_code <list of constants (term syntax)> in OCaml <filename>
4856 writing Haskell code to a bunch of files:
4857 export_code <list of constants (term syntax)> in Haskell <filename>
4859 evaluating closed propositions to True/False using code generation:
4862 Reasonable default setup of framework in HOL.
4864 Theorem attributs for selecting and transforming function equations theorems:
4866 [code fun]: select a theorem as function equation for a specific constant
4867 [code fun del]: deselect a theorem as function equation for a specific constant
4868 [code inline]: select an equation theorem for unfolding (inlining) in place
4869 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
4871 User-defined serializations (target in {SML, OCaml, Haskell}):
4873 code_const <and-list of constants (term syntax)>
4874 {(target) <and-list of const target syntax>}+
4876 code_type <and-list of type constructors>
4877 {(target) <and-list of type target syntax>}+
4879 code_instance <and-list of instances>
4881 where instance ::= <type constructor> :: <class>
4883 code_class <and_list of classes>
4884 {(target) <and-list of class target syntax>}+
4885 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
4887 code_instance and code_class only are effective to target Haskell.
4889 For example usage see src/HOL/ex/Codegenerator.thy and
4890 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
4891 generation from Isabelle/HOL theories is available via "isatool doc
4894 * Code generator: consts in 'consts_code' Isar commands are now
4895 referred to by usual term syntax (including optional type
4898 * Command 'no_translations' removes translation rules from theory
4901 * Overloaded definitions are now actually checked for acyclic
4902 dependencies. The overloading scheme is slightly more general than
4903 that of Haskell98, although Isabelle does not demand an exact
4904 correspondence to type class and instance declarations.
4905 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
4906 exotic versions of overloading -- at the discretion of the user!
4908 Polymorphic constants are represented via type arguments, i.e. the
4909 instantiation that matches an instance against the most general
4910 declaration given in the signature. For example, with the declaration
4911 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
4912 as c(nat). Overloading is essentially simultaneous structural
4913 recursion over such type arguments. Incomplete specification patterns
4914 impose global constraints on all occurrences, e.g. c('a * 'a) on the
4915 LHS means that more general c('a * 'b) will be disallowed on any RHS.
4916 Command 'print_theory' outputs the normalized system of recursive
4917 equations, see section "definitions".
4919 * Configuration options are maintained within the theory or proof
4920 context (with name and type bool/int/string), providing a very simple
4921 interface to a poor-man's version of general context data. Tools may
4922 declare options in ML (e.g. using Attrib.config_int) and then refer to
4923 these values using Config.get etc. Users may change options via an
4924 associated attribute of the same name. This form of context
4925 declaration works particularly well with commands 'declare' or
4926 'using', for example ``declare [[foo = 42]]''. Thus it has become
4927 very easy to avoid global references, which would not observe Isar
4928 toplevel undo/redo and fail to work with multithreading.
4930 Various global ML references of Pure and HOL have been turned into
4931 configuration options:
4933 Unify.search_bound unify_search_bound
4934 Unify.trace_bound unify_trace_bound
4935 Unify.trace_simp unify_trace_simp
4936 Unify.trace_types unify_trace_types
4937 Simplifier.simp_depth_limit simp_depth_limit
4938 Blast.depth_limit blast_depth_limit
4939 DatatypeProp.dtK datatype_distinctness_limit
4940 fast_arith_neq_limit fast_arith_neq_limit
4941 fast_arith_split_limit fast_arith_split_limit
4943 * Named collections of theorems may be easily installed as context
4944 data using the functor NamedThmsFun (see also
4945 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
4946 attributes; there is also a toplevel print command. This facility is
4947 just a common case of general context data, which is the preferred way
4948 for anything more complex than just a list of facts in canonical
4951 * Isar: command 'declaration' augments a local theory by generic
4952 declaration functions written in ML. This enables arbitrary content
4953 being added to the context, depending on a morphism that tells the
4954 difference of the original declaration context wrt. the application
4955 context encountered later on.
4957 * Isar: proper interfaces for simplification procedures. Command
4958 'simproc_setup' declares named simprocs (with match patterns, and body
4959 text in ML). Attribute "simproc" adds/deletes simprocs in the current
4960 context. ML antiquotation @{simproc name} retrieves named simprocs.
4962 * Isar: an extra pair of brackets around attribute declarations
4963 abbreviates a theorem reference involving an internal dummy fact,
4964 which will be ignored later --- only the effect of the attribute on
4965 the background context will persist. This form of in-place
4966 declarations is particularly useful with commands like 'declare' and
4967 'using', for example ``have A using [[simproc a]] by simp''.
4969 * Isar: method "assumption" (and implicit closing of subproofs) now
4970 takes simple non-atomic goal assumptions into account: after applying
4971 an assumption as a rule the resulting subgoals are solved by atomic
4972 assumption steps. This is particularly useful to finish 'obtain'
4973 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
4974 without referring to the original premise "!!x. P x ==> thesis" in the
4975 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
4978 * Isar: implicit use of prems from the Isar proof context is
4979 considered a legacy feature. Common applications like ``have A .''
4980 may be replaced by ``have A by fact'' or ``note `A`''. In general,
4981 referencing facts explicitly here improves readability and
4982 maintainability of proof texts.
4984 * Isar: improper proof element 'guess' is like 'obtain', but derives
4985 the obtained context from the course of reasoning! For example:
4987 assume "EX x y. A x & B y" -- "any previous fact"
4988 then guess x and y by clarify
4990 This technique is potentially adventurous, depending on the facts and
4991 proof tools being involved here.
4993 * Isar: known facts from the proof context may be specified as literal
4994 propositions, using ASCII back-quote syntax. This works wherever
4995 named facts used to be allowed so far, in proof commands, proof
4996 methods, attributes etc. Literal facts are retrieved from the context
4997 according to unification of type and term parameters. For example,
4998 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
4999 theorems in the current context, then these are valid literal facts:
5000 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
5002 There is also a proof method "fact" which does the same composition
5003 for explicit goal states, e.g. the following proof texts coincide with
5004 certain special cases of literal facts:
5006 have "A" by fact == note `A`
5007 have "A ==> B" by fact == note `A ==> B`
5008 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
5009 have "P a ==> Q a" by fact == note `P a ==> Q a`
5011 * Isar: ":" (colon) is no longer a symbolic identifier character in
5012 outer syntax. Thus symbolic identifiers may be used without
5013 additional white space in declarations like this: ``assume *: A''.
5015 * Isar: 'print_facts' prints all local facts of the current context,
5016 both named and unnamed ones.
5018 * Isar: 'def' now admits simultaneous definitions, e.g.:
5020 def x == "t" and y == "u"
5022 * Isar: added command 'unfolding', which is structurally similar to
5023 'using', but affects both the goal state and facts by unfolding given
5024 rewrite rules. Thus many occurrences of the 'unfold' method or
5025 'unfolded' attribute may be replaced by first-class proof text.
5027 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
5028 and command 'unfolding' now all support object-level equalities
5029 (potentially conditional). The underlying notion of rewrite rule is
5030 analogous to the 'rule_format' attribute, but *not* that of the
5031 Simplifier (which is usually more generous).
5033 * Isar: the new attribute [rotated n] (default n = 1) rotates the
5034 premises of a theorem by n. Useful in conjunction with drule.
5036 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
5037 method expression within a sandbox consisting of the first N
5038 sub-goals, which need to exist. For example, ``simp_all [3]''
5039 simplifies the first three sub-goals, while (rule foo, simp_all)[]
5040 simplifies all new goals that emerge from applying rule foo to the
5041 originally first one.
5043 * Isar: schematic goals are no longer restricted to higher-order
5044 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
5047 * Isar: the conclusion of a long theorem statement is now either
5048 'shows' (a simultaneous conjunction, as before), or 'obtains'
5049 (essentially a disjunction of cases with local parameters and
5050 assumptions). The latter allows to express general elimination rules
5051 adequately; in this notation common elimination rules look like this:
5053 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
5055 obtains x where "P x"
5057 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
5061 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
5067 The subsequent classical rules even refer to the formal "thesis"
5070 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
5073 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
5074 obtains "thesis ==> something"
5076 The actual proof of an 'obtains' statement is analogous to that of the
5077 Isar proof element 'obtain', only that there may be several cases.
5078 Optional case names may be specified in parentheses; these will be
5079 available both in the present proof and as annotations in the
5080 resulting rule, for later use with the 'cases' method (cf. attribute
5083 * Isar: the assumptions of a long theorem statement are available as
5084 "assms" fact in the proof context. This is more appropriate than the
5085 (historical) "prems", which refers to all assumptions of the current
5086 context, including those from the target locale, proof body etc.
5088 * Isar: 'print_statement' prints theorems from the current theory or
5089 proof context in long statement form, according to the syntax of a
5092 * Isar: 'obtain' takes an optional case name for the local context
5093 introduction rule (default "that").
5095 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
5096 explicit (is "_ ==> ?foo") in the rare cases where this still happens
5099 * Pure: syntax "CONST name" produces a fully internalized constant
5100 according to the current context. This is particularly useful for
5101 syntax translations that should refer to internal constant
5102 representations independently of name spaces.
5104 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
5105 instead of "FOO ". This allows multiple binder declarations to coexist
5106 in the same context. INCOMPATIBILITY.
5108 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
5109 primitive that also works in a locale context (both for constants and
5110 fixed variables). Type declaration and internal syntactic representation
5111 of given constants retrieved from the context. Likewise, the
5112 'no_notation' command allows to remove given syntax annotations from the
5115 * Isar/locales: new derived specification elements 'axiomatization',
5116 'definition', 'abbreviation', which support type-inference, admit
5117 object-level specifications (equality, equivalence). See also the
5118 isar-ref manual. Examples:
5121 eq (infix "===" 50) where
5122 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
5124 definition "f x y = x + y + 1"
5125 definition g where "g x = f x x"
5128 neq (infix "=!=" 50) where
5129 "x =!= y == ~ (x === y)"
5131 These specifications may be also used in a locale context. Then the
5132 constants being introduced depend on certain fixed parameters, and the
5133 constant name is qualified by the locale base name. An internal
5134 abbreviation takes care for convenient input and output, making the
5135 parameters implicit and using the original short name. See also
5136 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
5137 entities from a monomorphic theory.
5139 Presently, abbreviations are only available 'in' a target locale, but
5140 not inherited by general import expressions. Also note that
5141 'abbreviation' may be used as a type-safe replacement for 'syntax' +
5142 'translations' in common applications. The "no_abbrevs" print mode
5143 prevents folding of abbreviations in term output.
5145 Concrete syntax is attached to specified constants in internal form,
5146 independently of name spaces. The parse tree representation is
5147 slightly different -- use 'notation' instead of raw 'syntax', and
5148 'translations' with explicit "CONST" markup to accommodate this.
5150 * Pure/Isar: unified syntax for new-style specification mechanisms
5151 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
5152 full type inference and dummy patterns ("_"). For example:
5154 definition "K x _ = x"
5156 inductive conj for A B
5157 where "A ==> B ==> conj A B"
5159 * Pure: command 'print_abbrevs' prints all constant abbreviations of
5160 the current context. Print mode "no_abbrevs" prevents inversion of
5161 abbreviations on output.
5163 * Isar/locales: improved parameter handling: use of locales "var" and
5164 "struct" no longer necessary; - parameter renamings are no longer
5165 required to be injective. For example, this allows to define
5166 endomorphisms as locale endom = homom mult mult h.
5168 * Isar/locales: changed the way locales with predicates are defined.
5169 Instead of accumulating the specification, the imported expression is
5170 now an interpretation. INCOMPATIBILITY: different normal form of
5171 locale expressions. In particular, in interpretations of locales with
5172 predicates, goals repesenting already interpreted fragments are not
5173 removed automatically. Use methods `intro_locales' and
5174 `unfold_locales'; see below.
5176 * Isar/locales: new methods `intro_locales' and `unfold_locales'
5177 provide backward reasoning on locales predicates. The methods are
5178 aware of interpretations and discharge corresponding goals.
5179 `intro_locales' is less aggressive then `unfold_locales' and does not
5180 unfold predicates to assumptions.
5182 * Isar/locales: the order in which locale fragments are accumulated
5183 has changed. This enables to override declarations from fragments due
5184 to interpretations -- for example, unwanted simp rules.
5186 * Isar/locales: interpretation in theories and proof contexts has been
5187 extended. One may now specify (and prove) equations, which are
5188 unfolded in interpreted theorems. This is useful for replacing
5189 defined concepts (constants depending on locale parameters) by
5190 concepts already existing in the target context. Example:
5192 interpretation partial_order ["op <= :: [int, int] => bool"]
5193 where "partial_order.less (op <=) (x::int) y = (x < y)"
5195 Typically, the constant `partial_order.less' is created by a
5196 definition specification element in the context of locale
5199 * Method "induct": improved internal context management to support
5200 local fixes and defines on-the-fly. Thus explicit meta-level
5201 connectives !! and ==> are rarely required anymore in inductive goals
5202 (using object-logic connectives for this purpose has been long
5203 obsolete anyway). Common proof patterns are explained in
5204 src/HOL/Induct/Common_Patterns.thy, see also
5205 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
5208 * Method "induct": improved handling of simultaneous goals. Instead of
5209 introducing object-level conjunction, the statement is now split into
5210 several conclusions, while the corresponding symbolic cases are nested
5211 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
5212 see src/HOL/Induct/Common_Patterns.thy, for example.
5214 * Method "induct": mutual induction rules are now specified as a list
5215 of rule sharing the same induction cases. HOL packages usually provide
5216 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
5217 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
5218 mutual induction rules differently, i.e. like this:
5220 (induct rule: foo_bar.inducts)
5221 (induct set: foo bar)
5222 (induct pred: foo bar)
5223 (induct type: foo bar)
5225 The ML function ProjectRule.projections turns old-style rules into the
5228 * Method "coinduct": dual of induction, see
5229 src/HOL/Library/Coinductive_List.thy for various examples.
5231 * Method "cases", "induct", "coinduct": the ``(open)'' option is
5232 considered a legacy feature.
5234 * Attribute "symmetric" produces result with standardized schematic
5235 variables (index 0). Potential INCOMPATIBILITY.
5237 * Simplifier: by default the simplifier trace only shows top level
5238 rewrites now. That is, trace_simp_depth_limit is set to 1 by
5239 default. Thus there is less danger of being flooded by the trace. The
5240 trace indicates where parts have been suppressed.
5242 * Provers/classical: removed obsolete classical version of elim_format
5243 attribute; classical elim/dest rules are now treated uniformly when
5244 manipulating the claset.
5246 * Provers/classical: stricter checks to ensure that supplied intro,
5247 dest and elim rules are well-formed; dest and elim rules must have at
5250 * Provers/classical: attributes dest/elim/intro take an optional
5251 weight argument for the rule (just as the Pure versions). Weights are
5252 ignored by automated tools, but determine the search order of single
5255 * Syntax: input syntax now supports dummy variable binding "%_. b",
5256 where the body does not mention the bound variable. Note that dummy
5257 patterns implicitly depend on their context of bounds, which makes
5258 "{_. _}" match any set comprehension as expected. Potential
5259 INCOMPATIBILITY -- parse translations need to cope with syntactic
5260 constant "_idtdummy" in the binding position.
5262 * Syntax: removed obsolete syntactic constant "_K" and its associated
5263 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
5264 for example "A -> B" => "Pi A (%_. B)".
5266 * Pure: 'class_deps' command visualizes the subclass relation, using
5267 the graph browser tool.
5269 * Pure: 'print_theory' now suppresses certain internal declarations by
5270 default; use '!' option for full details.
5275 * Method "metis" proves goals by applying the Metis general-purpose
5276 resolution prover (see also http://gilith.com/software/metis/).
5277 Examples are in the directory MetisExamples. WARNING: the
5278 Isabelle/HOL-Metis integration does not yet work properly with
5281 * Command 'sledgehammer' invokes external automatic theorem provers as
5282 background processes. It generates calls to the "metis" method if
5283 successful. These can be pasted into the proof. Users do not have to
5284 wait for the automatic provers to return. WARNING: does not really
5285 work with multi-threading.
5287 * New "auto_quickcheck" feature tests outermost goal statements for
5288 potential counter-examples. Controlled by ML references
5289 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
5290 5000 milliseconds). Fails silently if statements is outside of
5291 executable fragment, or any other codgenerator problem occurs.
5293 * New constant "undefined" with axiom "undefined x = undefined".
5295 * Added class "HOL.eq", allowing for code generation with polymorphic
5298 * Some renaming of class constants due to canonical name prefixing in
5299 the new 'class' package:
5301 HOL.abs ~> HOL.abs_class.abs
5302 HOL.divide ~> HOL.divide_class.divide
5303 0 ~> HOL.zero_class.zero
5304 1 ~> HOL.one_class.one
5305 op + ~> HOL.plus_class.plus
5306 op - ~> HOL.minus_class.minus
5307 uminus ~> HOL.minus_class.uminus
5308 op * ~> HOL.times_class.times
5309 op < ~> HOL.ord_class.less
5310 op <= > HOL.ord_class.less_eq
5311 Nat.power ~> Power.power_class.power
5312 Nat.size ~> Nat.size_class.size
5313 Numeral.number_of ~> Numeral.number_class.number_of
5314 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
5315 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
5316 Orderings.min ~> Orderings.ord_class.min
5317 Orderings.max ~> Orderings.ord_class.max
5318 Divides.op div ~> Divides.div_class.div
5319 Divides.op mod ~> Divides.div_class.mod
5320 Divides.op dvd ~> Divides.div_class.dvd
5322 INCOMPATIBILITY. Adaptions may be required in the following cases:
5324 a) User-defined constants using any of the names "plus", "minus",
5325 "times", "less" or "less_eq". The standard syntax translations for
5326 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
5329 b) Variables named "plus", "minus", "times", "less", "less_eq"
5330 INCOMPATIBILITY: use more specific names.
5332 c) Permutative equations (e.g. "a + b = b + a")
5333 Since the change of names also changes the order of terms, permutative
5334 rewrite rules may get applied in a different order. Experience shows
5335 that this is rarely the case (only two adaptions in the whole Isabelle
5336 distribution). INCOMPATIBILITY: rewrite proofs
5338 d) ML code directly refering to constant names
5339 This in general only affects hand-written proof tactics, simprocs and
5340 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
5341 Consider using @{const_name} antiquotation.
5343 * New class "default" with associated constant "default".
5345 * Function "sgn" is now overloaded and available on int, real, complex
5346 (and other numeric types), using class "sgn". Two possible defs of
5347 sgn are given as equational assumptions in the classes sgn_if and
5348 sgn_div_norm; ordered_idom now also inherits from sgn_if.
5351 * Locale "partial_order" now unified with class "order" (cf. theory
5352 Orderings), added parameter "less". INCOMPATIBILITY.
5354 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
5355 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
5356 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
5358 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
5359 changed order of proof goals in instance proofs.
5361 * The transitivity reasoner for partial and linear orders is set up
5362 for classes "order" and "linorder". Instances of the reasoner are available
5363 in all contexts importing or interpreting the corresponding locales.
5364 Method "order" invokes the reasoner separately; the reasoner
5365 is also integrated with the Simplifier as a solver. Diagnostic
5366 command 'print_orders' shows the available instances of the reasoner
5367 in the current context.
5369 * Localized monotonicity predicate in theory "Orderings"; integrated
5370 lemmas max_of_mono and min_of_mono with this predicate.
5373 * Formulation of theorem "dense" changed slightly due to integration
5374 with new class dense_linear_order.
5376 * Uniform lattice theory development in HOL.
5378 constants "meet" and "join" now named "inf" and "sup"
5379 constant "Meet" now named "Inf"
5381 classes "meet_semilorder" and "join_semilorder" now named
5382 "lower_semilattice" and "upper_semilattice"
5383 class "lorder" now named "lattice"
5384 class "comp_lat" now named "complete_lattice"
5386 Instantiation of lattice classes allows explicit definitions
5387 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
5389 INCOMPATIBILITY. Theorem renames:
5391 meet_left_le ~> inf_le1
5392 meet_right_le ~> inf_le2
5393 join_left_le ~> sup_ge1
5394 join_right_le ~> sup_ge2
5395 meet_join_le ~> inf_sup_ord
5398 le_meet ~> le_inf_iff
5399 le_join ~> ge_sup_conv
5400 meet_idempotent ~> inf_idem
5401 join_idempotent ~> sup_idem
5402 meet_comm ~> inf_commute
5403 join_comm ~> sup_commute
5404 meet_leI1 ~> le_infI1
5405 meet_leI2 ~> le_infI2
5406 le_joinI1 ~> le_supI1
5407 le_joinI2 ~> le_supI2
5408 meet_assoc ~> inf_assoc
5409 join_assoc ~> sup_assoc
5410 meet_left_comm ~> inf_left_commute
5411 meet_left_idempotent ~> inf_left_idem
5412 join_left_comm ~> sup_left_commute
5413 join_left_idempotent ~> sup_left_idem
5416 le_def_meet ~> le_iff_inf
5417 le_def_join ~> le_iff_sup
5418 join_absorp2 ~> sup_absorb2
5419 join_absorp1 ~> sup_absorb1
5420 meet_absorp1 ~> inf_absorb1
5421 meet_absorp2 ~> inf_absorb2
5422 meet_join_absorp ~> inf_sup_absorb
5423 join_meet_absorp ~> sup_inf_absorb
5424 distrib_join_le ~> distrib_sup_le
5425 distrib_meet_le ~> distrib_inf_le
5427 add_meet_distrib_left ~> add_inf_distrib_left
5428 add_join_distrib_left ~> add_sup_distrib_left
5429 is_join_neg_meet ~> is_join_neg_inf
5430 is_meet_neg_join ~> is_meet_neg_sup
5431 add_meet_distrib_right ~> add_inf_distrib_right
5432 add_join_distrib_right ~> add_sup_distrib_right
5433 add_meet_join_distribs ~> add_sup_inf_distribs
5434 join_eq_neg_meet ~> sup_eq_neg_inf
5435 meet_eq_neg_join ~> inf_eq_neg_sup
5436 add_eq_meet_join ~> add_eq_inf_sup
5437 meet_0_imp_0 ~> inf_0_imp_0
5438 join_0_imp_0 ~> sup_0_imp_0
5439 meet_0_eq_0 ~> inf_0_eq_0
5440 join_0_eq_0 ~> sup_0_eq_0
5441 neg_meet_eq_join ~> neg_inf_eq_sup
5442 neg_join_eq_meet ~> neg_sup_eq_inf
5443 join_eq_if ~> sup_eq_if
5445 mono_meet ~> mono_inf
5446 mono_join ~> mono_sup
5447 meet_bool_eq ~> inf_bool_eq
5448 join_bool_eq ~> sup_bool_eq
5449 meet_fun_eq ~> inf_fun_eq
5450 join_fun_eq ~> sup_fun_eq
5451 meet_set_eq ~> inf_set_eq
5452 join_set_eq ~> sup_set_eq
5453 meet1_iff ~> inf1_iff
5454 meet2_iff ~> inf2_iff
5463 join1_iff ~> sup1_iff
5464 join2_iff ~> sup2_iff
5474 is_meet_Meet ~> is_meet_Inf
5475 Meet_bool_def ~> Inf_bool_def
5476 Meet_fun_def ~> Inf_fun_def
5477 Meet_greatest ~> Inf_greatest
5478 Meet_lower ~> Inf_lower
5479 Meet_set_def ~> Inf_set_def
5482 Sup_bool_eq ~> Sup_bool_def
5483 Sup_fun_eq ~> Sup_fun_def
5484 Sup_set_eq ~> Sup_set_def
5486 listsp_meetI ~> listsp_infI
5487 listsp_meet_eq ~> listsp_inf_eq
5492 * Added syntactic class "size"; overloaded constant "size" now has
5493 type "'a::size ==> bool"
5495 * Internal reorganisation of `size' of datatypes: size theorems
5496 "foo.size" are no longer subsumed by "foo.simps" (but are still
5497 simplification rules by default!); theorems "prod.size" now named
5500 * Class "div" now inherits from class "times" rather than "type".
5503 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
5504 Linorder etc. have disappeared; operations defined in terms of
5505 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
5507 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
5509 * HOL-Word: New extensive library and type for generic, fixed size
5510 machine words, with arithmetic, bit-wise, shifting and rotating
5511 operations, reflection into int, nat, and bool lists, automation for
5512 linear arithmetic (by automatic reflection into nat or int), including
5513 lemmas on overflow and monotonicity. Instantiated to all appropriate
5514 arithmetic type classes, supporting automatic simplification of
5515 numerals on all operations.
5517 * Library/Boolean_Algebra: locales for abstract boolean algebras.
5519 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
5521 * Code generator library theories:
5522 - Code_Integer represents HOL integers by big integer literals in target
5524 - Code_Char represents HOL characters by character literals in target
5526 - Code_Char_chr like Code_Char, but also offers treatment of character
5527 codes; includes Code_Integer.
5528 - Executable_Set allows to generate code for finite sets using lists.
5529 - Executable_Rat implements rational numbers as triples (sign, enumerator,
5531 - Executable_Real implements a subset of real numbers, namly those
5532 representable by rational numbers.
5533 - Efficient_Nat implements natural numbers by integers, which in general will
5534 result in higher efficency; pattern matching with 0/Suc is eliminated;
5535 includes Code_Integer.
5536 - Code_Index provides an additional datatype index which is mapped to
5537 target-language built-in integers.
5538 - Code_Message provides an additional datatype message_string which is isomorphic to
5539 strings; messages are mapped to target-language strings.
5541 * New package for inductive predicates
5543 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
5546 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5547 for z_1 :: U_1 and ... and z_n :: U_m
5549 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5552 with full support for type-inference, rather than
5554 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5556 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5557 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5559 inductive "s z_1 ... z_m"
5561 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5564 For backward compatibility, there is a wrapper allowing inductive
5565 sets to be defined with the new package via
5568 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5569 for z_1 :: U_1 and ... and z_n :: U_m
5571 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5577 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5578 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5579 for z_1 :: U_1 and ... and z_n :: U_m
5581 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5582 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5585 if the additional syntax "p ..." is required.
5587 Numerous examples can be found in the subdirectories src/HOL/Auth,
5588 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
5592 - Since declaration and definition of inductive sets or predicates
5593 is no longer separated, abbreviations involving the newly
5594 introduced sets or predicates must be specified together with the
5595 introduction rules after the 'where' keyword (see above), rather
5596 than before the actual inductive definition.
5598 - The variables in induction and elimination rules are now
5599 quantified in the order of their occurrence in the introduction
5600 rules, rather than in alphabetical order. Since this may break
5601 some proofs, these proofs either have to be repaired, e.g. by
5602 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
5603 statements of the form
5605 case (rule_i a_i_1 ... a_i_{k_i})
5607 or the old order of quantification has to be restored by explicitly adding
5608 meta-level quantifiers in the introduction rules, i.e.
5610 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
5612 - The format of the elimination rules is now
5614 p z_1 ... z_m x_1 ... x_n ==>
5615 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5620 (x_1, ..., x_n) : s z_1 ... z_m ==>
5621 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5624 for sets rather than
5626 x : s z_1 ... z_m ==>
5627 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
5630 This may require terms in goals to be expanded to n-tuples
5631 (e.g. using case_tac or simplification with the split_paired_all
5632 rule) before the above elimination rule is applicable.
5634 - The elimination or case analysis rules for (mutually) inductive
5635 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
5636 list of rules "p_1_..._p_k.elims" is no longer available.
5638 * New package "function"/"fun" for general recursive functions,
5639 supporting mutual and nested recursion, definitions in local contexts,
5640 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
5641 for small examples, and the separate tutorial on the function
5642 package. The old recdef "package" is still available as before, but
5643 users are encouraged to use the new package.
5645 * Method "lexicographic_order" automatically synthesizes termination
5646 relations as lexicographic combinations of size measures.
5648 * Case-expressions allow arbitrary constructor-patterns (including
5649 "_") and take their order into account, like in functional
5650 programming. Internally, this is translated into nested
5651 case-expressions; missing cases are added and mapped to the predefined
5652 constant "undefined". In complicated cases printing may no longer show
5653 the original input but the internal form. Lambda-abstractions allow
5654 the same form of pattern matching: "% pat1 => e1 | ..." is an
5655 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
5658 * IntDef: The constant "int :: nat => int" has been removed; now "int"
5659 is an abbreviation for "of_nat :: nat => int". The simplification
5660 rules for "of_nat" have been changed to work like "int" did
5661 previously. Potential INCOMPATIBILITY:
5662 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
5663 - of_nat_diff and of_nat_mult are no longer default simp rules
5665 * Method "algebra" solves polynomial equations over (semi)rings using
5666 Groebner bases. The (semi)ring structure is defined by locales and the
5667 tool setup depends on that generic context. Installing the method for
5668 a specific type involves instantiating the locale and possibly adding
5669 declarations for computation on the coefficients. The method is
5670 already instantiated for natural numbers and for the axiomatic class
5671 of idoms with numerals. See also the paper by Chaieb and Wenzel at
5672 CALCULEMUS 2007 for the general principles underlying this
5673 architecture of context-aware proof-tools.
5675 * Method "ferrack" implements quantifier elimination over
5676 special-purpose dense linear orders using locales (analogous to
5677 "algebra"). The method is already installed for class
5678 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
5681 * Former constant "List.op @" now named "List.append". Use ML
5682 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
5683 circumvent possible incompatibilities when working on ML level.
5685 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
5687 * New function listsum :: 'a list => 'a for arbitrary monoids.
5688 Special syntax: "SUM x <- xs. f x" (and latex variants)
5690 * New syntax for Haskell-like list comprehension (input only), eg.
5691 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
5693 * The special syntax for function "filter" has changed from [x :
5694 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
5695 comprehension syntax, and for uniformity. INCOMPATIBILITY.
5697 * [a..b] is now defined for arbitrary linear orders. It used to be
5698 defined on nat only, as an abbreviation for [a..<Suc b]
5701 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
5703 * New functions "sorted" and "sort" in src/HOL/List.thy.
5705 * New lemma collection field_simps (an extension of ring_simps) for
5706 manipulating (in)equations involving division. Multiplies with all
5707 denominators that can be proved to be non-zero (in equations) or
5708 positive/negative (in inequations).
5710 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
5711 have been improved and renamed to ring_simps, group_simps and
5712 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
5713 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
5715 * Theory Library/Commutative_Ring: switched from recdef to function
5716 package; constants add, mul, pow now curried. Infix syntax for
5717 algebraic operations.
5719 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
5722 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
5725 * HOL/records: generalised field-update to take a function on the
5726 field rather than the new value: r(|A := x|) is translated to A_update
5727 (K x) r The K-combinator that is internally used is called K_record.
5728 INCOMPATIBILITY: Usage of the plain update functions has to be
5731 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
5732 * x = 0, which are required for a semiring. Richer structures do not
5733 inherit from semiring_0 anymore, because this property is a theorem
5734 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
5735 there is more to prove, but this is mostly trivial.
5737 * Class "recpower" is generalized to arbitrary monoids, not just
5738 commutative semirings. INCOMPATIBILITY: may need to incorporate
5739 commutativity or semiring properties additionally.
5741 * Constant "List.list_all2" in List.thy now uses authentic syntax.
5742 INCOMPATIBILITY: translations containing list_all2 may go wrong,
5743 better use 'abbreviation'.
5745 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
5747 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
5748 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
5749 significant changes for setting up numeral syntax for types:
5750 - New constants Numeral.pred and Numeral.succ instead
5751 of former Numeral.bin_pred and Numeral.bin_succ.
5752 - Use integer operations instead of bin_add, bin_mult and so on.
5753 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
5754 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
5756 See src/HOL/Integ/IntArith.thy for an example setup.
5758 * Command 'normal_form' computes the normal form of a term that may
5759 contain free variables. For example ``normal_form "rev [a, b, c]"''
5760 produces ``[b, c, a]'' (without proof). This command is suitable for
5761 heavy-duty computations because the functions are compiled to ML
5762 first. Correspondingly, a method "normalization" is provided. See
5763 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
5765 * Alternative iff syntax "A <-> B" for equality on bool (with priority
5766 25 like -->); output depends on the "iff" print_mode, the default is
5767 "A = B" (with priority 50).
5769 * Relations less (<) and less_eq (<=) are also available on type bool.
5770 Modified syntax to disallow nesting without explicit parentheses,
5771 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
5774 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
5776 * Relation composition operator "op O" now has precedence 75 and binds
5777 stronger than union and intersection. INCOMPATIBILITY.
5779 * The old set interval syntax "{m..n(}" (and relatives) has been
5780 removed. Use "{m..<n}" (and relatives) instead.
5782 * In the context of the assumption "~(s = t)" the Simplifier rewrites
5783 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
5784 ``declare [[simproc del: neq]]''.
5786 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
5789 * Theorem Cons_eq_map_conv no longer declared as "simp".
5791 * Theorem setsum_mult renamed to setsum_right_distrib.
5793 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
5796 * Reimplemented methods "sat" and "satx", with several improvements:
5797 goals no longer need to be stated as "<prems> ==> False", equivalences
5798 (i.e. "=" on type bool) are handled, variable names of the form
5799 "lit_<n>" are no longer reserved, significant speedup.
5801 * Methods "sat" and "satx" can now replay MiniSat proof traces.
5802 zChaff is still supported as well.
5804 * 'inductive' and 'datatype': provide projections of mutual rules,
5805 bundled as foo_bar.inducts;
5807 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
5810 * Library: moved theory Accessible_Part to main HOL.
5812 * Library: added theory Coinductive_List of potentially infinite lists
5813 as greatest fixed-point.
5815 * Library: added theory AssocList which implements (finite) maps as
5818 * Method "evaluation" solves goals (i.e. a boolean expression)
5819 efficiently by compiling it to ML. The goal is "proved" (via an
5820 oracle) if it evaluates to True.
5822 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
5823 also when invoked by the simplifier. This results in the Simplifier
5824 being more powerful on arithmetic goals. INCOMPATIBILITY.
5825 Configuration option fast_arith_split_limit=0 recovers the old
5828 * Support for hex (0x20) and binary (0b1001) numerals.
5830 * New method: reify eqs (t), where eqs are equations for an
5831 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
5832 parameter, computes a term s::'b and a list xs::'a list and proves the
5833 theorem I xs s = t. This is also known as reification or quoting. The
5834 resulting theorem is applied to the subgoal to substitute t with I xs
5835 s. If t is omitted, the subgoal itself is reified.
5837 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
5838 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
5839 where f is supposed to be a computable function (in the sense of code
5840 generattion). The method uses reify to compute s and xs as above then
5841 applies corr_thm and uses normalization by evaluation to "prove" f s =
5842 r and finally gets the theorem t = r, which is again applied to the
5843 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
5845 * Reflection: Automatic reification now handels binding, an example is
5846 available in src/HOL/ex/ReflectionEx.thy
5848 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
5849 command 'statespace' that is similar to 'record', but introduces an
5850 abstract specification based on the locale infrastructure instead of
5851 HOL types. This leads to extra flexibility in composing state spaces,
5852 in particular multiple inheritance and renaming of components.
5857 * Hyperreal: Functions root and sqrt are now defined on negative real
5858 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
5859 Nonnegativity side conditions have been removed from many lemmas, so
5860 that more subgoals may now be solved by simplification; potential
5863 * Real: new type classes formalize real normed vector spaces and
5864 algebras, using new overloaded constants scaleR :: real => 'a => 'a
5865 and norm :: 'a => real.
5867 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
5868 reals into other types. The overloaded constant Reals :: 'a set is now
5869 defined as range of_real; potential INCOMPATIBILITY.
5871 * Real: proper support for ML code generation, including 'quickcheck'.
5872 Reals are implemented as arbitrary precision rationals.
5874 * Hyperreal: Several constants that previously worked only for the
5875 reals have been generalized, so they now work over arbitrary vector
5876 spaces. Type annotations may need to be added in some cases; potential
5879 Infinitesimal :: ('a::real_normed_vector) star set
5880 HFinite :: ('a::real_normed_vector) star set
5881 HInfinite :: ('a::real_normed_vector) star set
5882 approx :: ('a::real_normed_vector) star => 'a star => bool
5883 monad :: ('a::real_normed_vector) star => 'a star set
5884 galaxy :: ('a::real_normed_vector) star => 'a star set
5885 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
5886 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
5887 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
5888 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
5889 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
5890 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
5891 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
5892 sgn :: 'a::real_normed_vector => 'a
5893 exp :: 'a::{recpower,real_normed_field,banach} => 'a
5895 * Complex: Some complex-specific constants are now abbreviations for
5896 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
5897 hnorm. Other constants have been entirely removed in favor of the
5898 polymorphic versions (INCOMPATIBILITY):
5902 HInfinite <-- CInfinite
5903 Infinitesimal <-- CInfinitesimal
5906 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
5907 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
5908 (ns)deriv <-- (ns)cderiv
5913 * Formalisation of ideals and the quotient construction over rings.
5915 * Order and lattice theory no longer based on records.
5918 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
5919 greatest_closed. INCOMPATIBILITY.
5921 * Method algebra is now set up via an attribute. For examples see
5922 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
5923 of algebraic structures.
5925 * Renamed theory CRing to Ring.
5930 * Substantial, yet incomplete support for nominal datatypes (binding
5931 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
5932 src/HOL/Nominal/Examples. Prospective users should consult
5933 http://isabelle.in.tum.de/nominal/
5938 * ML basics: just one true type int, which coincides with IntInf.int
5941 * ML within Isar: antiquotations allow to embed statically-checked
5942 formal entities in the source, referring to the context available at
5943 compile-time. For example:
5945 ML {* @{sort "{zero,one}"} *}
5946 ML {* @{typ "'a => 'b"} *}
5947 ML {* @{term "%x. x"} *}
5948 ML {* @{prop "x == y"} *}
5949 ML {* @{ctyp "'a => 'b"} *}
5950 ML {* @{cterm "%x. x"} *}
5951 ML {* @{cprop "x == y"} *}
5952 ML {* @{thm asm_rl} *}
5953 ML {* @{thms asm_rl} *}
5954 ML {* @{type_name c} *}
5955 ML {* @{type_syntax c} *}
5956 ML {* @{const_name c} *}
5957 ML {* @{const_syntax c} *}
5960 ML {* @{theory Pure} *}
5961 ML {* @{theory_ref} *}
5962 ML {* @{theory_ref Pure} *}
5965 ML {* @{clasimpset} *}
5967 The same works for sources being ``used'' within an Isar context.
5969 * ML in Isar: improved error reporting; extra verbosity with
5970 ML_Context.trace enabled.
5972 * Pure/General/table.ML: the join operations now works via exceptions
5973 DUP/SAME instead of type option. This is simpler in simple cases, and
5974 admits slightly more efficient complex applications.
5976 * Pure: 'advanced' translation functions (parse_translation etc.) now
5977 use Context.generic instead of just theory.
5979 * Pure: datatype Context.generic joins theory/Proof.context and
5980 provides some facilities for code that works in either kind of
5981 context, notably GenericDataFun for uniform theory and proof data.
5983 * Pure: simplified internal attribute type, which is now always
5984 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
5985 local (Proof.context) attributes have been discontinued, while
5986 minimizing code duplication. Thm.rule_attribute and
5987 Thm.declaration_attribute build canonical attributes; see also structure
5988 Context for further operations on Context.generic, notably
5989 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
5990 declarations and definitions.
5992 * Context data interfaces (Theory/Proof/GenericDataFun): removed
5993 name/print, uninitialized data defaults to ad-hoc copy of empty value,
5994 init only required for impure data. INCOMPATIBILITY: empty really need
5995 to be empty (no dependencies on theory content!)
5997 * Pure/kernel: consts certification ignores sort constraints given in
5998 signature declarations. (This information is not relevant to the
5999 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
6000 potential INCOMPATIBILITY.
6002 * Pure: axiomatic type classes are now purely definitional, with
6003 explicit proofs of class axioms and super class relations performed
6004 internally. See Pure/axclass.ML for the main internal interfaces --
6005 notably AxClass.define_class supercedes AxClass.add_axclass, and
6006 AxClass.axiomatize_class/classrel/arity supersede
6007 Sign.add_classes/classrel/arities.
6009 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
6010 global/local versions on theory vs. Proof.context have been
6011 discontinued; Attrib.syntax and Method.syntax have been adapted
6012 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
6013 attributes, methods, etc.
6015 * Pure: several functions of signature "... -> theory -> theory * ..."
6016 have been reoriented to "... -> theory -> ... * theory" in order to
6017 allow natural usage in combination with the ||>, ||>>, |-> and
6018 fold_map combinators.
6020 * Pure: official theorem names (closed derivations) and additional
6021 comments (tags) are now strictly separate. Name hints -- which are
6022 maintained as tags -- may be attached any time without affecting the
6025 * Pure: primitive rule lift_rule now takes goal cterm instead of an
6026 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
6027 achieve the old behaviour.
6029 * Pure: the "Goal" constant is now called "prop", supporting a
6030 slightly more general idea of ``protecting'' meta-level rule
6033 * Pure: Logic.(un)varify only works in a global context, which is now
6034 enforced instead of silently assumed. INCOMPATIBILITY, may use
6035 Logic.legacy_(un)varify as temporary workaround.
6037 * Pure: structure Name provides scalable operations for generating
6038 internal variable names, notably Name.variants etc. This replaces
6039 some popular functions from term.ML:
6041 Term.variant -> Name.variant
6042 Term.variantlist -> Name.variant_list
6043 Term.invent_names -> Name.invent_list
6045 Note that low-level renaming rarely occurs in new code -- operations
6046 from structure Variable are used instead (see below).
6048 * Pure: structure Variable provides fundamental operations for proper
6049 treatment of fixed/schematic variables in a context. For example,
6050 Variable.import introduces fixes for schematics of given facts and
6051 Variable.export reverses the effect (up to renaming) -- this replaces
6052 various freeze_thaw operations.
6054 * Pure: structure Goal provides simple interfaces for
6055 init/conclude/finish and tactical prove operations (replacing former
6056 Tactic.prove). Goal.prove is the canonical way to prove results
6057 within a given context; Goal.prove_global is a degraded version for
6058 theory level goals, including a global Drule.standard. Note that
6059 OldGoals.prove_goalw_cterm has long been obsolete, since it is
6060 ill-behaved in a local proof context (e.g. with local fixes/assumes or
6061 in a locale context).
6063 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
6064 and type checking (Syntax.check_term etc.), with common combinations
6065 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
6066 which are considered legacy and await removal.
6068 * Pure/Syntax: generic interfaces for type unchecking
6069 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
6070 with common combinations (Syntax.pretty_term, Syntax.string_of_term
6071 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
6072 available for convenience, but refer to the very same operations using
6073 a mere theory instead of a full context.
6075 * Isar: simplified treatment of user-level errors, using exception
6076 ERROR of string uniformly. Function error now merely raises ERROR,
6077 without any side effect on output channels. The Isar toplevel takes
6078 care of proper display of ERROR exceptions. ML code may use plain
6079 handle/can/try; cat_error may be used to concatenate errors like this:
6081 ... handle ERROR msg => cat_error msg "..."
6083 Toplevel ML code (run directly or through the Isar toplevel) may be
6084 embedded into the Isar toplevel with exception display/debug like
6087 Isar.toplevel (fn () => ...)
6089 INCOMPATIBILITY, removed special transform_error facilities, removed
6090 obsolete variants of user-level exceptions (ERROR_MESSAGE,
6091 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
6092 -- use plain ERROR instead.
6094 * Isar: theory setup now has type (theory -> theory), instead of a
6095 list. INCOMPATIBILITY, may use #> to compose setup functions.
6097 * Isar: ML toplevel pretty printer for type Proof.context, subject to
6098 ProofContext.debug/verbose flags.
6100 * Isar: Toplevel.theory_to_proof admits transactions that modify the
6101 theory before entering a proof state. Transactions now always see a
6102 quasi-functional intermediate checkpoint, both in interactive and
6105 * Isar: simplified interfaces for outer syntax. Renamed
6106 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
6107 OuterSyntax.add_parsers -- this functionality is now included in
6108 OuterSyntax.command etc. INCOMPATIBILITY.
6110 * Simplifier: the simpset of a running simplification process now
6111 contains a proof context (cf. Simplifier.the_context), which is the
6112 very context that the initial simpset has been retrieved from (by
6113 simpset_of/local_simpset_of). Consequently, all plug-in components
6114 (solver, looper etc.) may depend on arbitrary proof data.
6116 * Simplifier.inherit_context inherits the proof context (plus the
6117 local bounds) of the current simplification process; any simproc
6118 etc. that calls the Simplifier recursively should do this! Removed
6119 former Simplifier.inherit_bounds, which is already included here --
6120 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
6121 specify an explicit context using Simplifier.context/theory_context.
6123 * Simplifier/Classical Reasoner: more abstract interfaces
6124 change_simpset/claset for modifying the simpset/claset reference of a
6125 theory; raw versions simpset/claset_ref etc. have been discontinued --
6128 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
6134 * settings: the default heap location within ISABELLE_HOME_USER now
6135 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
6136 Isabelle installations.
6138 * isabelle-process: option -S (secure mode) disables some critical
6139 operations, notably runtime compilation and evaluation of ML source
6142 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
6144 * Support for parallel execution, using native multicore support of
6145 Poly/ML 5.1. The theory loader exploits parallelism when processing
6146 independent theories, according to the given theory header
6147 specifications. The maximum number of worker threads is specified via
6148 usedir option -M or the "max-threads" setting in Proof General. A
6149 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
6150 to 6 on a 8-core machine. User-code needs to observe certain
6151 guidelines for thread-safe programming, see appendix A in the Isar
6152 Implementation manual.
6156 New in Isabelle2005 (October 2005)
6157 ----------------------------------
6161 * Theory headers: the new header syntax for Isar theories is
6164 imports <theory1> ... <theoryN>
6165 uses <file1> ... <fileM>
6168 where the 'uses' part is optional. The previous syntax
6170 theory <name> = <theory1> + ... + <theoryN>:
6172 will disappear in the next release. Use isatool fixheaders to convert
6173 existing theory files. Note that there is no change in ancient
6174 non-Isar theories now, but these will disappear soon.
6176 * Theory loader: parent theories can now also be referred to via
6177 relative and absolute paths.
6179 * Command 'find_theorems' searches for a list of criteria instead of a
6180 list of constants. Known criteria are: intro, elim, dest, name:string,
6181 simp:term, and any term. Criteria can be preceded by '-' to select
6182 theorems that do not match. Intro, elim, dest select theorems that
6183 match the current goal, name:s selects theorems whose fully qualified
6184 name contain s, and simp:term selects all simplification rules whose
6185 lhs match term. Any other term is interpreted as pattern and selects
6186 all theorems matching the pattern. Available in ProofGeneral under
6187 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
6189 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
6191 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
6192 matching the current goal as introduction rule and not having "HOL."
6193 in their name (i.e. not being defined in theory HOL).
6195 * Command 'thms_containing' has been discontinued in favour of
6196 'find_theorems'; INCOMPATIBILITY.
6198 * Communication with Proof General is now 8bit clean, which means that
6199 Unicode text in UTF-8 encoding may be used within theory texts (both
6200 formal and informal parts). Cf. option -U of the Isabelle Proof
6201 General interface. Here are some simple examples (cf. src/HOL/ex):
6203 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
6204 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
6206 * Improved efficiency of the Simplifier and, to a lesser degree, the
6207 Classical Reasoner. Typical big applications run around 2 times
6211 *** Document preparation ***
6213 * Commands 'display_drafts' and 'print_drafts' perform simple output
6214 of raw sources. Only those symbols that do not require additional
6215 LaTeX packages (depending on comments in isabellesym.sty) are
6216 displayed properly, everything else is left verbatim. isatool display
6217 and isatool print are used as front ends (these are subject to the
6218 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
6220 * Command tags control specific markup of certain regions of text,
6221 notably folding and hiding. Predefined tags include "theory" (for
6222 theory begin and end), "proof" for proof commands, and "ML" for
6223 commands involving ML code; the additional tags "visible" and
6224 "invisible" are unused by default. Users may give explicit tag
6225 specifications in the text, e.g. ''by %invisible (auto)''. The
6226 interpretation of tags is determined by the LaTeX job during document
6227 preparation: see option -V of isatool usedir, or options -n and -t of
6228 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
6231 Several document versions may be produced at the same time via isatool
6232 usedir (the generated index.html will link all of them). Typical
6233 specifications include ''-V document=theory,proof,ML'' to present
6234 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
6235 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
6236 these parts without any formal replacement text. The Isabelle site
6237 default settings produce ''document'' and ''outline'' versions as
6240 * Several new antiquotations:
6242 @{term_type term} prints a term with its type annotated;
6244 @{typeof term} prints the type of a term;
6246 @{const const} is the same as @{term const}, but checks that the
6247 argument is a known logical constant;
6249 @{term_style style term} and @{thm_style style thm} print a term or
6250 theorem applying a "style" to it
6254 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
6255 definitions, equations, inequations etc., 'concl' printing only the
6256 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
6257 to print the specified premise. TermStyle.add_style provides an ML
6258 interface for introducing further styles. See also the "LaTeX Sugar"
6259 document practical applications. The ML antiquotation prints
6260 type-checked ML expressions verbatim.
6262 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
6263 and 'text' support optional locale specification '(in loc)', which
6264 specifies the default context for interpreting antiquotations. For
6265 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
6267 * Option 'locale=NAME' of antiquotations specifies an alternative
6268 context interpreting the subsequent argument. For example: @{thm
6269 [locale=lattice] inf_assoc}.
6271 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
6274 * Proper output of antiquotations for theory commands involving a
6275 proof context (such as 'locale' or 'theorem (in loc) ...').
6277 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
6278 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
6280 * isatool usedir: new option -C (default true) controls whether option
6281 -D should include a copy of the original document directory; -C false
6282 prevents unwanted effects such as copying of administrative CVS data.
6287 * Considerably improved version of 'constdefs' command. Now performs
6288 automatic type-inference of declared constants; additional support for
6289 local structure declarations (cf. locales and HOL records), see also
6290 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
6291 sequential dependencies of definitions within a single 'constdefs'
6292 section; moreover, the declared name needs to be an identifier. If
6293 all fails, consider to fall back on 'consts' and 'defs' separately.
6295 * Improved indexed syntax and implicit structures. First of all,
6296 indexed syntax provides a notational device for subscripted
6297 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
6298 expressions. Secondly, in a local context with structure
6299 declarations, number indexes \<^sub>n or the empty index (default
6300 number 1) refer to a certain fixed variable implicitly; option
6301 show_structs controls printing of implicit structures. Typical
6302 applications of these concepts involve record types and locales.
6304 * New command 'no_syntax' removes grammar declarations (and
6305 translations) resulting from the given syntax specification, which is
6306 interpreted in the same manner as for the 'syntax' command.
6308 * 'Advanced' translation functions (parse_translation etc.) may depend
6309 on the signature of the theory context being presently used for
6310 parsing/printing, see also isar-ref manual.
6312 * Improved 'oracle' command provides a type-safe interface to turn an
6313 ML expression of type theory -> T -> term into a primitive rule of
6314 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
6315 is already included here); see also FOL/ex/IffExample.thy;
6318 * axclass: name space prefix for class "c" is now "c_class" (was "c"
6319 before); "cI" is no longer bound, use "c.intro" instead.
6320 INCOMPATIBILITY. This change avoids clashes of fact bindings for
6321 axclasses vs. locales.
6323 * Improved internal renaming of symbolic identifiers -- attach primes
6324 instead of base 26 numbers.
6326 * New flag show_question_marks controls printing of leading question
6327 marks in schematic variable names.
6329 * In schematic variable names, *any* symbol following \<^isub> or
6330 \<^isup> is now treated as part of the base name. For example, the
6331 following works without printing of awkward ".0" indexes:
6333 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
6336 * Inner syntax includes (*(*nested*) comments*).
6338 * Pretty printer now supports unbreakable blocks, specified in mixfix
6339 annotations as "(00...)".
6341 * Clear separation of logical types and nonterminals, where the latter
6342 may only occur in 'syntax' specifications or type abbreviations.
6343 Before that distinction was only partially implemented via type class
6344 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
6345 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
6346 exotic syntax specifications may require further adaption
6347 (e.g. Cube/Cube.thy).
6349 * Removed obsolete type class "logic", use the top sort {} instead.
6350 Note that non-logical types should be declared as 'nonterminals'
6351 rather than 'types'. INCOMPATIBILITY for new object-logic
6354 * Attributes 'induct' and 'cases': type or set names may now be
6355 locally fixed variables as well.
6357 * Simplifier: can now control the depth to which conditional rewriting
6358 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
6361 * Simplifier: simplification procedures may now take the current
6362 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
6363 interface), which is very useful for calling the Simplifier
6364 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
6365 is gone -- use prems_of_ss on the simpset instead. Moreover, the
6366 low-level mk_simproc no longer applies Logic.varify internally, to
6367 allow for use in a context of fixed variables.
6369 * thin_tac now works even if the assumption being deleted contains !!
6370 or ==>. More generally, erule now works even if the major premise of
6371 the elimination rule contains !! or ==>.
6373 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
6375 * Reorganized bootstrapping of the Pure theories; CPure is now derived
6376 from Pure, which contains all common declarations already. Both
6377 theories are defined via plain Isabelle/Isar .thy files.
6378 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
6379 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
6380 use isatool fixcpure to adapt your theory and ML sources.
6382 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
6383 selections of theorems in named facts via index ranges.
6385 * 'print_theorems': in theory mode, really print the difference
6386 wrt. the last state (works for interactive theory development only),
6387 in proof mode print all local facts (cf. 'print_facts');
6389 * 'hide': option '(open)' hides only base names.
6391 * More efficient treatment of intermediate checkpoints in interactive
6394 * Code generator is now invoked via code_module (incremental code
6395 generation) and code_library (modular code generation, ML structures
6396 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
6397 must be quoted when used as identifiers.
6399 * New 'value' command for reading, evaluating and printing terms using
6400 the code generator. INCOMPATIBILITY: command keyword 'value' must be
6401 quoted when used as identifier.
6406 * New commands for the interpretation of locale expressions in
6407 theories (1), locales (2) and proof contexts (3). These generate
6408 proof obligations from the expression specification. After the
6409 obligations have been discharged, theorems of the expression are added
6410 to the theory, target locale or proof context. The synopsis of the
6411 commands is a follows:
6413 (1) interpretation expr inst
6414 (2) interpretation target < expr
6415 (3) interpret expr inst
6417 Interpretation in theories and proof contexts require a parameter
6418 instantiation of terms from the current context. This is applied to
6419 specifications and theorems of the interpreted expression.
6420 Interpretation in locales only permits parameter renaming through the
6421 locale expression. Interpretation is smart in that interpretations
6422 that are active already do not occur in proof obligations, neither are
6423 instantiated theorems stored in duplicate. Use 'print_interps' to
6424 inspect active interpretations of a particular locale. For details,
6425 see the Isar Reference manual. Examples can be found in
6426 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
6428 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
6429 'interpret' instead.
6431 * New context element 'constrains' for adding type constraints to
6434 * Context expressions: renaming of parameters with syntax
6437 * Locale declaration: 'includes' disallowed.
6439 * Proper static binding of attribute syntax -- i.e. types / terms /
6440 facts mentioned as arguments are always those of the locale definition
6441 context, independently of the context of later invocations. Moreover,
6442 locale operations (renaming and type / term instantiation) are applied
6443 to attribute arguments as expected.
6445 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
6446 actual attributes; rare situations may require Attrib.attribute to
6447 embed those attributes into Attrib.src that lack concrete syntax.
6448 Attribute implementations need to cooperate properly with the static
6449 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
6450 Attrib.XXX_thm etc. already do the right thing without further
6451 intervention. Only unusual applications -- such as "where" or "of"
6452 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
6453 on the context and the facts involved -- may have to assign parsed
6454 values to argument tokens explicitly.
6456 * Changed parameter management in theorem generation for long goal
6457 statements with 'includes'. INCOMPATIBILITY: produces a different
6458 theorem statement in rare situations.
6460 * Locale inspection command 'print_locale' omits notes elements. Use
6461 'print_locale!' to have them included in the output.
6466 * Provers/hypsubst.ML: improved version of the subst method, for
6467 single-step rewriting: it now works in bound variable contexts. New is
6468 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
6469 rewrite a different subterm than the original subst method, which is
6470 still available as 'simplesubst'.
6472 * Provers/quasi.ML: new transitivity reasoners for transitivity only
6475 * Provers/trancl.ML: new transitivity reasoner for transitive and
6476 reflexive-transitive closure of relations.
6478 * Provers/blast.ML: new reference depth_limit to make blast's depth
6479 limit (previously hard-coded with a value of 20) user-definable.
6481 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
6482 is peformed already. Object-logics merely need to finish their
6483 initial simpset configuration as before. INCOMPATIBILITY.
6488 * Symbolic syntax of Hilbert Choice Operator is now as follows:
6491 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
6493 The symbol \<some> is displayed as the alternative epsilon of LaTeX
6494 and x-symbol; use option '-m epsilon' to get it actually printed.
6495 Moreover, the mathematically important symbolic identifier \<epsilon>
6496 becomes available as variable, constant etc. INCOMPATIBILITY,
6498 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
6499 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
6500 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
6501 support corresponding Isar calculations.
6503 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
6506 * theory SetInterval: changed the syntax for open intervals:
6515 The old syntax is still supported but will disappear in the next
6516 release. For conversion use the following Emacs search and replace
6517 patterns (these are not perfect but work quite well):
6519 {)\([^\.]*\)\.\. -> {\1<\.\.}
6520 \.\.\([^(}]*\)(} -> \.\.<\1}
6522 * Theory Commutative_Ring (in Library): method comm_ring for proving
6523 equalities in commutative rings; method 'algebra' provides a generic
6526 * Theory Finite_Set: changed the syntax for 'setsum', summation over
6527 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
6528 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
6531 Some new syntax forms are available:
6533 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
6534 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
6535 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
6536 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
6538 The latter form "\<Sum>x < k. e" used to be based on a separate
6539 function "Summation", which has been discontinued.
6541 * theory Finite_Set: in structured induction proofs, the insert case
6542 is now 'case (insert x F)' instead of the old counterintuitive 'case
6545 * The 'refute' command has been extended to support a much larger
6546 fragment of HOL, including axiomatic type classes, constdefs and
6547 typedefs, inductive datatypes and recursion.
6549 * New tactics 'sat' and 'satx' to prove propositional tautologies.
6550 Requires zChaff with proof generation to be installed. See
6551 HOL/ex/SAT_Examples.thy for examples.
6553 * Datatype induction via method 'induct' now preserves the name of the
6554 induction variable. For example, when proving P(xs::'a list) by
6555 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
6556 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
6557 in unstructured proof scripts.
6559 * Reworked implementation of records. Improved scalability for
6560 records with many fields, avoiding performance problems for type
6561 inference. Records are no longer composed of nested field types, but
6562 of nested extension types. Therefore the record type only grows linear
6563 in the number of extensions and not in the number of fields. The
6564 top-level (users) view on records is preserved. Potential
6565 INCOMPATIBILITY only in strange cases, where the theory depends on the
6566 old record representation. The type generated for a record is called
6567 <record_name>_ext_type.
6569 Flag record_quick_and_dirty_sensitive can be enabled to skip the
6570 proofs triggered by a record definition or a simproc (if
6571 quick_and_dirty is enabled). Definitions of large records can take
6574 New simproc record_upd_simproc for simplification of multiple record
6575 updates enabled by default. Moreover, trivial updates are also
6576 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
6577 occasionally, since simplification is more powerful by default.
6579 * typedef: proper support for polymorphic sets, which contain extra
6580 type-variables in the term.
6582 * Simplifier: automatically reasons about transitivity chains
6583 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
6584 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
6585 old proofs break occasionally as simplification may now solve more
6586 goals than previously.
6588 * Simplifier: converts x <= y into x = y if assumption y <= x is
6589 present. Works for all partial orders (class "order"), in particular
6590 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
6593 * Simplifier: new simproc for "let x = a in f x". If a is a free or
6594 bound variable or a constant then the let is unfolded. Otherwise
6595 first a is simplified to b, and then f b is simplified to g. If
6596 possible we abstract b from g arriving at "let x = b in h x",
6597 otherwise we unfold the let and arrive at g. The simproc can be
6598 enabled/disabled by the reference use_let_simproc. Potential
6599 INCOMPATIBILITY since simplification is more powerful by default.
6601 * Classical reasoning: the meson method now accepts theorems as arguments.
6603 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
6604 jobs to provide advice on the provability of subgoals.
6606 * Theory OrderedGroup and Ring_and_Field: various additions and
6607 improvements to faciliate calculations involving equalities and
6610 The following theorems have been eliminated or modified
6613 abs_eq now named abs_of_nonneg
6614 abs_of_ge_0 now named abs_of_nonneg
6615 abs_minus_eq now named abs_of_nonpos
6616 imp_abs_id now named abs_of_nonneg
6617 imp_abs_neg_id now named abs_of_nonpos
6618 mult_pos now named mult_pos_pos
6619 mult_pos_le now named mult_nonneg_nonneg
6620 mult_pos_neg_le now named mult_nonneg_nonpos
6621 mult_pos_neg2_le now named mult_nonneg_nonpos2
6622 mult_neg now named mult_neg_neg
6623 mult_neg_le now named mult_nonpos_nonpos
6625 * The following lemmas in Ring_and_Field have been added to the simplifier:
6628 not_square_less_zero
6630 The following lemmas have been deleted from Real/RealPow:
6640 * Theory Parity: added rules for simplifying exponents.
6644 The following theorems have been eliminated or modified
6647 list_all_Nil now named list_all.simps(1)
6648 list_all_Cons now named list_all.simps(2)
6649 list_all_conv now named list_all_iff
6650 set_mem_eq now named mem_iff
6652 * Theories SetsAndFunctions and BigO (see HOL/Library) support
6653 asymptotic "big O" calculations. See the notes in BigO.thy.
6658 * Theory RealDef: better support for embedding natural numbers and
6659 integers in the reals.
6661 The following theorems have been eliminated or modified
6664 exp_ge_add_one_self now requires no hypotheses
6665 real_of_int_add reversed direction of equality (use [symmetric])
6666 real_of_int_minus reversed direction of equality (use [symmetric])
6667 real_of_int_diff reversed direction of equality (use [symmetric])
6668 real_of_int_mult reversed direction of equality (use [symmetric])
6670 * Theory RComplete: expanded support for floor and ceiling functions.
6672 * Theory Ln is new, with properties of the natural logarithm
6674 * Hyperreal: There is a new type constructor "star" for making
6675 nonstandard types. The old type names are now type synonyms:
6679 hcomplex = complex star
6681 * Hyperreal: Many groups of similarly-defined constants have been
6682 replaced by polymorphic versions (INCOMPATIBILITY):
6684 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
6686 starset <-- starsetNat, starsetC
6687 *s* <-- *sNat*, *sc*
6688 starset_n <-- starsetNat_n, starsetC_n
6689 *sn* <-- *sNatn*, *scn*
6690 InternalSets <-- InternalNatSets, InternalCSets
6692 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6693 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
6694 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
6695 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
6696 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
6698 * Hyperreal: Many type-specific theorems have been removed in favor of
6699 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
6701 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
6702 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
6703 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
6704 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
6705 right_minus <-- hypreal_add_minus
6706 left_minus <-- {hypreal,hcomplex}_add_minus_left
6707 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
6708 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
6709 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
6710 mult_1_right <-- hcomplex_mult_one_right
6711 mult_zero_left <-- hcomplex_mult_zero_left
6712 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
6713 right_distrib <-- hypnat_add_mult_distrib2
6714 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
6715 right_inverse <-- hypreal_mult_inverse
6716 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
6717 order_refl <-- {hypreal,hypnat}_le_refl
6718 order_trans <-- {hypreal,hypnat}_le_trans
6719 order_antisym <-- {hypreal,hypnat}_le_anti_sym
6720 order_less_le <-- {hypreal,hypnat}_less_le
6721 linorder_linear <-- {hypreal,hypnat}_le_linear
6722 add_left_mono <-- {hypreal,hypnat}_add_left_mono
6723 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
6724 add_nonneg_nonneg <-- hypreal_le_add_order
6726 * Hyperreal: Separate theorems having to do with type-specific
6727 versions of constants have been merged into theorems that apply to the
6728 new polymorphic constants (INCOMPATIBILITY):
6730 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
6731 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
6732 STAR_Un <-- {STAR,NatStar,STARC}_Un
6733 STAR_Int <-- {STAR,NatStar,STARC}_Int
6734 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
6735 STAR_subset <-- {STAR,NatStar,STARC}_subset
6736 STAR_mem <-- {STAR,NatStar,STARC}_mem
6737 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
6738 STAR_diff <-- {STAR,STARC}_diff
6739 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
6740 STARC_hcomplex_of_complex}_image_subset
6741 starset_n_Un <-- starset{Nat,C}_n_Un
6742 starset_n_Int <-- starset{Nat,C}_n_Int
6743 starset_n_Compl <-- starset{Nat,C}_n_Compl
6744 starset_n_diff <-- starset{Nat,C}_n_diff
6745 InternalSets_Un <-- Internal{Nat,C}Sets_Un
6746 InternalSets_Int <-- Internal{Nat,C}Sets_Int
6747 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
6748 InternalSets_diff <-- Internal{Nat,C}Sets_diff
6749 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
6750 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
6751 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
6752 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
6753 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
6754 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6755 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
6756 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
6757 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
6758 starfun_diff <-- starfun{C,RC,CR}_diff
6759 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
6760 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
6761 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
6762 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
6763 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
6764 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
6765 starfun_Id <-- starfunC_Id
6766 starfun_approx <-- starfun{Nat,CR}_approx
6767 starfun_capprox <-- starfun{C,RC}_capprox
6768 starfun_abs <-- starfunNat_rabs
6769 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
6770 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
6771 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
6772 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
6773 starfun_add_capprox <-- starfun{C,RC}_add_capprox
6774 starfun_add_approx <-- starfunCR_add_approx
6775 starfun_inverse_inverse <-- starfunC_inverse_inverse
6776 starfun_divide <-- starfun{C,CR,RC}_divide
6777 starfun_n <-- starfun{Nat,C}_n
6778 starfun_n_mult <-- starfun{Nat,C}_n_mult
6779 starfun_n_add <-- starfun{Nat,C}_n_add
6780 starfun_n_add_minus <-- starfunNat_n_add_minus
6781 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
6782 starfun_n_minus <-- starfun{Nat,C}_n_minus
6783 starfun_n_eq <-- starfun{Nat,C}_n_eq
6785 star_n_add <-- {hypreal,hypnat,hcomplex}_add
6786 star_n_minus <-- {hypreal,hcomplex}_minus
6787 star_n_diff <-- {hypreal,hcomplex}_diff
6788 star_n_mult <-- {hypreal,hcomplex}_mult
6789 star_n_inverse <-- {hypreal,hcomplex}_inverse
6790 star_n_le <-- {hypreal,hypnat}_le
6791 star_n_less <-- {hypreal,hypnat}_less
6792 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
6793 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
6794 star_n_abs <-- hypreal_hrabs
6795 star_n_divide <-- hcomplex_divide
6797 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
6798 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
6799 star_of_diff <-- hypreal_of_real_diff
6800 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
6801 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
6802 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
6803 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
6804 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
6805 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
6806 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
6807 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
6808 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
6809 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
6810 star_of_number_of <-- {hypreal,hcomplex}_number_of
6811 star_of_number_less <-- number_of_less_hypreal_of_real_iff
6812 star_of_number_le <-- number_of_le_hypreal_of_real_iff
6813 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
6814 star_of_less_number <-- hypreal_of_real_less_number_of_iff
6815 star_of_le_number <-- hypreal_of_real_le_number_of_iff
6816 star_of_power <-- hypreal_of_real_power
6817 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
6819 * Hyperreal: new method "transfer" that implements the transfer
6820 principle of nonstandard analysis. With a subgoal that mentions
6821 nonstandard types like "'a star", the command "apply transfer"
6822 replaces it with an equivalent one that mentions only standard types.
6823 To be successful, all free variables must have standard types; non-
6824 standard variables must have explicit universal quantifiers.
6826 * Hyperreal: A theory of Taylor series.
6831 * Discontinued special version of 'constdefs' (which used to support
6832 continuous functions) in favor of the general Pure one with full
6835 * New simplification procedure for solving continuity conditions; it
6836 is much faster on terms with many nested lambda abstractions (cubic
6837 instead of exponential time).
6839 * New syntax for domain package: selector names are now optional.
6840 Parentheses should be omitted unless argument is lazy, for example:
6842 domain 'a stream = cons "'a" (lazy "'a stream")
6844 * New command 'fixrec' for defining recursive functions with pattern
6845 matching; defining multiple functions with mutual recursion is also
6846 supported. Patterns may include the constants cpair, spair, up, sinl,
6847 sinr, or any data constructor defined by the domain package. The given
6848 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
6849 syntax and examples.
6851 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
6852 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
6853 but the proof obligation additionally includes an admissibility
6854 requirement. The packages generate instances of class cpo or pcpo,
6855 with continuity and strictness theorems for Rep and Abs.
6857 * HOLCF: Many theorems have been renamed according to a more standard naming
6858 scheme (INCOMPATIBILITY):
6860 foo_inject: "foo$x = foo$y ==> x = y"
6861 foo_eq: "(foo$x = foo$y) = (x = y)"
6862 foo_less: "(foo$x << foo$y) = (x << y)"
6863 foo_strict: "foo$UU = UU"
6864 foo_defined: "... ==> foo$x ~= UU"
6865 foo_defined_iff: "(foo$x = UU) = (x = UU)"
6870 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
6871 including the First Isomorphism Theorem (on quotienting by the kernel
6874 * ZF/Simplifier: install second copy of type solver that actually
6875 makes use of TC rules declared to Isar proof contexts (or locales);
6876 the old version is still required for ML proof scripts.
6881 * Converted to Isar theory format; use locales instead of axiomatic
6887 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
6890 * Pure/library.ML no longer defines its own option datatype, but uses
6891 that of the SML basis, which has constructors NONE and SOME instead of
6892 None and Some, as well as exception Option.Option instead of OPTION.
6893 The functions the, if_none, is_some, is_none have been adapted
6894 accordingly, while Option.map replaces apsome.
6896 * Pure/library.ML: the exception LIST has been given up in favour of
6897 the standard exceptions Empty and Subscript, as well as
6898 Library.UnequalLengths. Function like Library.hd and Library.tl are
6899 superceded by the standard hd and tl functions etc.
6901 A number of basic list functions are no longer exported to the ML
6902 toplevel, as they are variants of predefined functions. The following
6903 suggests how one can translate existing code:
6905 rev_append xs ys = List.revAppend (xs, ys)
6906 nth_elem (i, xs) = List.nth (xs, i)
6907 last_elem xs = List.last xs
6908 flat xss = List.concat xss
6909 seq fs = List.app fs
6910 partition P xs = List.partition P xs
6911 mapfilter f xs = List.mapPartial f xs
6913 * Pure/library.ML: several combinators for linear functional
6914 transformations, notably reverse application and composition:
6917 (x, y) |-> f f #-> g
6919 * Pure/library.ML: introduced/changed precedence of infix operators:
6921 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
6923 infix 3 o oo ooo oooo;
6924 infix 4 ~~ upto downto;
6926 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
6929 * Pure/library.ML: natural list combinators fold, fold_rev, and
6930 fold_map support linear functional transformations and nesting. For
6933 fold f [x1, ..., xN] y =
6934 y |> f x1 |> ... |> f xN
6936 (fold o fold) f [xs1, ..., xsN] y =
6937 y |> fold f xs1 |> ... |> fold f xsN
6939 fold f [x1, ..., xN] =
6942 (fold o fold) f [xs1, ..., xsN] =
6943 fold f xs1 #> ... #> fold f xsN
6945 * Pure/library.ML: the following selectors on type 'a option are
6948 the: 'a option -> 'a (*partial*)
6949 these: 'a option -> 'a where 'a = 'b list
6950 the_default: 'a -> 'a option -> 'a
6951 the_list: 'a option -> 'a list
6953 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6954 basic operations for association lists, following natural argument
6955 order; moreover the explicit equality predicate passed here avoids
6956 potentially expensive polymorphic runtime equality checks.
6957 The old functions may be expressed as follows:
6959 assoc = uncurry (AList.lookup (op =))
6960 assocs = these oo AList.lookup (op =)
6961 overwrite = uncurry (AList.update (op =)) o swap
6963 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6965 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
6966 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
6968 replacing make_keylist and keyfilter (occassionally used)
6971 make_keylist = AList.make
6972 keyfilter = AList.find (op =)
6974 * eq_fst and eq_snd now take explicit equality parameter, thus
6975 avoiding eqtypes. Naive rewrites:
6977 eq_fst = eq_fst (op =)
6978 eq_snd = eq_snd (op =)
6980 * Removed deprecated apl and apr (rarely used).
6983 apl (n, op) =>>= curry op n
6984 apr (op, m) =>>= fn n => op (n, m)
6986 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
6987 provides a reasonably efficient light-weight implementation of sets as
6990 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
6991 few new operations; existing lookup and update are now curried to
6992 follow natural argument order (for use with fold etc.);
6993 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
6995 * Pure/General: output via the Isabelle channels of
6996 writeln/warning/error etc. is now passed through Output.output, with a
6997 hook for arbitrary transformations depending on the print_mode
6998 (cf. Output.add_mode -- the first active mode that provides a output
6999 function wins). Already formatted output may be embedded into further
7000 text via Output.raw; the result of Pretty.string_of/str_of and derived
7001 functions (string_of_term/cterm/thm etc.) is already marked raw to
7002 accommodate easy composition of diagnostic messages etc. Programmers
7003 rarely need to care about Output.output or Output.raw at all, with
7004 some notable exceptions: Output.output is required when bypassing the
7005 standard channels (writeln etc.), or in token translations to produce
7006 properly formatted results; Output.raw is required when capturing
7007 already output material that will eventually be presented to the user
7008 a second time. For the default print mode, both Output.output and
7009 Output.raw have no effect.
7011 * Pure/General: Output.time_accumulator NAME creates an operator ('a
7012 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
7013 cumulative results are displayed at the end of a batch session.
7015 * Pure/General: File.sysify_path and File.quote_sysify path have been
7016 replaced by File.platform_path and File.shell_path (with appropriate
7017 hooks). This provides a clean interface for unusual systems where the
7018 internal and external process view of file names are different.
7020 * Pure: more efficient orders for basic syntactic entities: added
7021 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
7022 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
7023 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
7024 orders now -- potential INCOMPATIBILITY for code that depends on a
7025 particular order for Symtab.keys, Symtab.dest, etc. (consider using
7026 Library.sort_strings on result).
7028 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
7029 fold_types traverse types/terms from left to right, observing natural
7030 argument order. Supercedes previous foldl_XXX versions, add_frees,
7031 add_vars etc. have been adapted as well: INCOMPATIBILITY.
7033 * Pure: name spaces have been refined, with significant changes of the
7034 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
7035 to extern(_table). The plain name entry path is superceded by a
7036 general 'naming' context, which also includes the 'policy' to produce
7037 a fully qualified name and external accesses of a fully qualified
7038 name; NameSpace.extend is superceded by context dependent
7039 Sign.declare_name. Several theory and proof context operations modify
7040 the naming context. Especially note Theory.restore_naming and
7041 ProofContext.restore_naming to get back to a sane state; note that
7042 Theory.add_path is no longer sufficient to recover from
7043 Theory.absolute_path in particular.
7045 * Pure: new flags short_names (default false) and unique_names
7046 (default true) for controlling output of qualified names. If
7047 short_names is set, names are printed unqualified. If unique_names is
7048 reset, the name prefix is reduced to the minimum required to achieve
7049 the original result when interning again, even if there is an overlap
7050 with earlier declarations.
7052 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
7053 now 'extend', and 'merge' gets an additional Pretty.pp argument
7054 (useful for printing error messages). INCOMPATIBILITY.
7056 * Pure: major reorganization of the theory context. Type Sign.sg and
7057 Theory.theory are now identified, referring to the universal
7058 Context.theory (see Pure/context.ML). Actual signature and theory
7059 content is managed as theory data. The old code and interfaces were
7060 spread over many files and structures; the new arrangement introduces
7061 considerable INCOMPATIBILITY to gain more clarity:
7063 Context -- theory management operations (name, identity, inclusion,
7064 parents, ancestors, merge, etc.), plus generic theory data;
7066 Sign -- logical signature and syntax operations (declaring consts,
7067 types, etc.), plus certify/read for common entities;
7069 Theory -- logical theory operations (stating axioms, definitions,
7070 oracles), plus a copy of logical signature operations (consts,
7071 types, etc.); also a few basic management operations (Theory.copy,
7074 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
7075 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
7076 for convenience -- they merely return the theory.
7078 * Pure: type Type.tsig is superceded by theory in most interfaces.
7080 * Pure: the Isar proof context type is already defined early in Pure
7081 as Context.proof (note that ProofContext.context and Proof.context are
7082 aliases, where the latter is the preferred name). This enables other
7083 Isabelle components to refer to that type even before Isar is present.
7085 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
7086 typeK, constK, axiomK, oracleK), but provide explicit operations for
7087 any of these kinds. For example, Sign.intern typeK is now
7088 Sign.intern_type, Theory.hide_space Sign.typeK is now
7089 Theory.hide_types. Also note that former
7090 Theory.hide_classes/types/consts are now
7091 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
7092 internalize their arguments! INCOMPATIBILITY.
7094 * Pure: get_thm interface (of PureThy and ProofContext) expects
7095 datatype thmref (with constructors Name and NameSelection) instead of
7096 plain string -- INCOMPATIBILITY;
7098 * Pure: cases produced by proof methods specify options, where NONE
7099 means to remove case bindings -- INCOMPATIBILITY in
7102 * Pure: the following operations retrieve axioms or theorems from a
7103 theory node or theory hierarchy, respectively:
7105 Theory.axioms_of: theory -> (string * term) list
7106 Theory.all_axioms_of: theory -> (string * term) list
7107 PureThy.thms_of: theory -> (string * thm) list
7108 PureThy.all_thms_of: theory -> (string * thm) list
7110 * Pure: print_tac now outputs the goal through the trace channel.
7112 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
7113 Reference Toplevel.debug (default false) controls detailed printing
7114 and tracing of low-level exceptions; Toplevel.profiling (default 0)
7115 controls execution profiling -- set to 1 for time and 2 for space
7116 (both increase the runtime).
7118 * Isar session: The initial use of ROOT.ML is now always timed,
7119 i.e. the log will show the actual process times, in contrast to the
7120 elapsed wall-clock time that the outer shell wrapper produces.
7122 * Simplifier: improved handling of bound variables (nameless
7123 representation, avoid allocating new strings). Simprocs that invoke
7124 the Simplifier recursively should use Simplifier.inherit_bounds to
7125 avoid local name clashes. Failure to do so produces warnings
7126 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
7127 for further details.
7129 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
7130 bindings for all theorems stored within a given theory; this may help
7131 in porting non-Isar theories to Isar ones, while keeping ML proof
7132 scripts for the time being.
7134 * ML operator HTML.with_charset specifies the charset begin used for
7135 generated HTML files. For example:
7137 HTML.with_charset "utf-8" use_thy "Hebrew";
7138 HTML.with_charset "utf-8" use_thy "Chinese";
7143 * Allow symlinks to all proper Isabelle executables (Isabelle,
7144 isabelle, isatool etc.).
7146 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
7147 isatool doc, isatool mkdir, display_drafts etc.).
7149 * isatool usedir: option -f allows specification of the ML file to be
7150 used by Isabelle; default is ROOT.ML.
7152 * New isatool version outputs the version identifier of the Isabelle
7153 distribution being used.
7155 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
7156 (containing Boolean satisfiability problems) into Isabelle/HOL
7161 New in Isabelle2004 (April 2004)
7162 --------------------------------
7166 * Provers/order.ML: new efficient reasoner for partial and linear orders.
7167 Replaces linorder.ML.
7169 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
7170 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
7171 (\<a>...\<z>), are now considered normal letters, and can therefore
7172 be used anywhere where an ASCII letter (a...zA...Z) has until
7173 now. COMPATIBILITY: This obviously changes the parsing of some
7174 terms, especially where a symbol has been used as a binder, say
7175 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
7176 as an identifier. Fix it by inserting a space around former
7177 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
7178 existing theory and ML files.
7180 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
7182 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
7183 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
7184 a normal (but invisible) letter. For multiple letter subscripts repeat
7185 \<^isub> like this: x\<^isub>1\<^isub>2.
7187 * Pure: There are now sub-/superscripts that can span more than one
7188 character. Text between \<^bsub> and \<^esub> is set in subscript in
7189 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
7190 superscript. The new control characters are not identifier parts.
7192 * Pure: Control-symbols of the form \<^raw:...> will literally print the
7193 content of "..." to the latex file instead of \isacntrl... . The "..."
7194 may consist of any printable characters excluding the end bracket >.
7196 * Pure: Using new Isar command "finalconsts" (or the ML functions
7197 Theory.add_finals or Theory.add_finals_i) it is now possible to
7198 declare constants "final", which prevents their being given a definition
7199 later. It is useful for constants whose behaviour is fixed axiomatically
7200 rather than definitionally, such as the meta-logic connectives.
7202 * Pure: 'instance' now handles general arities with general sorts
7203 (i.e. intersections of classes),
7205 * Presentation: generated HTML now uses a CSS style sheet to make layout
7206 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
7207 It can be changed to alter the colors/layout of generated pages.
7212 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
7213 cut_tac, subgoal_tac and thin_tac:
7214 - Now understand static (Isar) contexts. As a consequence, users of Isar
7215 locales are no longer forced to write Isar proof scripts.
7216 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
7218 - INCOMPATIBILITY: names of variables to be instantiated may no
7219 longer be enclosed in quotes. Instead, precede variable name with `?'.
7220 This is consistent with the instantiation attribute "where".
7222 * Attributes "where" and "of":
7223 - Now take type variables of instantiated theorem into account when reading
7224 the instantiation string. This fixes a bug that caused instantiated
7225 theorems to have too special types in some circumstances.
7226 - "where" permits explicit instantiations of type variables.
7228 * Calculation commands "moreover" and "also" no longer interfere with
7229 current facts ("this"), admitting arbitrary combinations with "then"
7233 - Goal statements involving the context element "includes" no longer
7234 generate theorems with internal delta predicates (those ending on
7235 "_axioms") in the premise.
7236 Resolve particular premise with <locale>.intro to obtain old form.
7237 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
7238 specification and "includes" elements in goal statement.
7239 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
7240 [intro?] and [elim?] (respectively) by default.
7241 - Experimental command for instantiation of locales in proof contexts:
7242 instantiate <label>[<attrs>]: <loc>
7243 Instantiates locale <loc> and adds all its theorems to the current context
7244 taking into account their attributes. Label and attrs are optional
7245 modifiers, like in theorem declarations. If present, names of
7246 instantiated theorems are qualified with <label>, and the attributes
7247 <attrs> are applied after any attributes these theorems might have already.
7248 If the locale has assumptions, a chained fact of the form
7249 "<loc> t1 ... tn" is expected from which instantiations of the parameters
7250 are derived. The command does not support old-style locales declared
7251 with "locale (open)".
7252 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
7254 * HOL: Tactic emulation methods induct_tac and case_tac understand static
7260 * Proof import: new image HOL4 contains the imported library from
7261 the HOL4 system with about 2500 theorems. It is imported by
7262 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
7263 can be used like any other Isabelle image. See
7264 HOL/Import/HOL/README for more information.
7267 - Much improved handling of linear and partial orders.
7268 Reasoners for linear and partial orders are set up for type classes
7269 "linorder" and "order" respectively, and are added to the default simpset
7270 as solvers. This means that the simplifier can build transitivity chains
7271 to solve goals from the assumptions.
7272 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
7273 of blast or auto after simplification become unnecessary because the goal
7274 is solved by simplification already.
7276 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
7277 all proved in axiomatic type classes for semirings, rings and fields.
7280 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
7281 now formalized using the Ring_and_Field theory mentioned above.
7282 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
7283 than before, because now they are set up once in a generic manner.
7284 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
7285 Look for the general versions in Ring_and_Field (and Power if they concern
7288 * Type "rat" of the rational numbers is now available in HOL-Complex.
7291 - Record types are now by default printed with their type abbreviation
7292 instead of the list of all field types. This can be configured via
7293 the reference "print_record_type_abbr".
7294 - Simproc "record_upd_simproc" for simplification of multiple updates added
7295 (not enabled by default).
7296 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
7297 EX x. x = sel r to True (not enabled by default).
7298 - Tactic "record_split_simp_tac" to split and simplify records added.
7300 * 'specification' command added, allowing for definition by
7301 specification. There is also an 'ax_specification' command that
7302 introduces the new constants axiomatically.
7304 * arith(_tac) is now able to generate counterexamples for reals as well.
7306 * HOL-Algebra: new locale "ring" for non-commutative rings.
7308 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
7309 definitions, thanks to Sava Krsti\'{c} and John Matthews.
7311 * HOL-Matrix: a first theory for matrices in HOL with an application of
7312 matrix theory to linear programming.
7314 * Unions and Intersections:
7315 The latex output syntax of UN and INT has been changed
7316 from "\Union x \in A. B" to "\Union_{x \in A} B"
7317 i.e. the index formulae has become a subscript.
7318 Similarly for "\Union x. B", and for \Inter instead of \Union.
7320 * Unions and Intersections over Intervals:
7321 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
7322 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
7323 like in normal math, and corresponding versions for < and for intersection.
7325 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
7326 lexicographic dictonary ordering has been added as "lexord".
7328 * ML: the legacy theory structures Int and List have been removed. They had
7329 conflicted with ML Basis Library structures having the same names.
7331 * 'refute' command added to search for (finite) countermodels. Only works
7332 for a fragment of HOL. The installation of an external SAT solver is
7333 highly recommended. See "HOL/Refute.thy" for details.
7335 * 'quickcheck' command: Allows to find counterexamples by evaluating
7336 formulae under an assignment of free variables to random values.
7337 In contrast to 'refute', it can deal with inductive datatypes,
7338 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
7344 * Streams now come with concatenation and are part of the HOLCF image
7348 New in Isabelle2003 (May 2003)
7349 ------------------------------
7353 * Provers/simplifier:
7355 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
7356 Assumptions are now subject to complete mutual simplification,
7357 not just from left to right. The simplifier now preserves
7358 the order of assumptions.
7360 Potential INCOMPATIBILITY:
7362 -- simp sometimes diverges where the old version did
7363 not, e.g. invoking simp on the goal
7365 [| P (f x); y = x; f x = f y |] ==> Q
7367 now gives rise to the infinite reduction sequence
7369 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
7371 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
7374 -- Tactics combining classical reasoner and simplification (such as auto)
7375 are also affected by this change, because many of them rely on
7376 simp. They may sometimes diverge as well or yield a different numbers
7377 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
7378 in case of problems. Sometimes subsequent calls to the classical
7379 reasoner will fail because a preceeding call to the simplifier too
7380 eagerly simplified the goal, e.g. deleted redundant premises.
7382 - The simplifier trace now shows the names of the applied rewrite rules
7384 - You can limit the number of recursive invocations of the simplifier
7385 during conditional rewriting (where the simplifie tries to solve the
7386 conditions before applying the rewrite rule):
7387 ML "simp_depth_limit := n"
7388 where n is an integer. Thus you can force termination where previously
7389 the simplifier would diverge.
7391 - Accepts free variables as head terms in congruence rules. Useful in Isar.
7393 - No longer aborts on failed congruence proof. Instead, the
7394 congruence is ignored.
7396 * Pure: New generic framework for extracting programs from constructive
7397 proofs. See HOL/Extraction.thy for an example instantiation, as well
7398 as HOL/Extraction for some case studies.
7400 * Pure: The main goal of the proof state is no longer shown by default, only
7401 the subgoals. This behaviour is controlled by a new flag.
7402 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
7403 (ML: Proof.show_main_goal).
7405 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
7406 rules whose conclusion matches subgoal 1:
7407 PG menu: Isabelle/Isar -> Show me -> matching rules
7408 The rules are ordered by how closely they match the subgoal.
7409 In particular, rules that solve a subgoal outright are displayed first
7410 (or rather last, the way they are printed).
7411 (ML: ProofGeneral.print_intros())
7413 * Pure: New flag trace_unify_fail causes unification to print
7414 diagnostic information (PG: in trace buffer) when it fails. This is
7415 useful for figuring out why single step proofs like rule, erule or
7418 * Pure: Locale specifications now produce predicate definitions
7419 according to the body of text (covering assumptions modulo local
7420 definitions); predicate "loc_axioms" covers newly introduced text,
7421 while "loc" is cumulative wrt. all included locale expressions; the
7422 latter view is presented only on export into the global theory
7423 context; potential INCOMPATIBILITY, use "(open)" option to fall back
7424 on the old view without predicates;
7426 * Pure: predefined locales "var" and "struct" are useful for sharing
7427 parameters (as in CASL, for example); just specify something like
7428 ``var x + var y + struct M'' as import;
7430 * Pure: improved thms_containing: proper indexing of facts instead of
7431 raw theorems; check validity of results wrt. current name space;
7432 include local facts of proof configuration (also covers active
7433 locales), cover fixed variables in index; may use "_" in term
7434 specification; an optional limit for the number of printed facts may
7435 be given (the default is 40);
7437 * Pure: disallow duplicate fact bindings within new-style theory files
7440 * Provers: improved induct method: assumptions introduced by case
7441 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
7442 the goal statement); "foo" still refers to all facts collectively;
7444 * Provers: the function blast.overloaded has been removed: all constants
7445 are regarded as potentially overloaded, which improves robustness in exchange
7446 for slight decrease in efficiency;
7448 * Provers/linorder: New generic prover for transitivity reasoning over
7449 linear orders. Note: this prover is not efficient!
7451 * Isar: preview of problems to finish 'show' now produce an error
7452 rather than just a warning (in interactive mode);
7459 - Produces a counter example if it cannot prove a goal.
7460 Note that the counter example may be spurious if the goal is not a formula
7461 of quantifier-free linear arithmetic.
7462 In ProofGeneral the counter example appears in the trace buffer.
7464 - Knows about div k and mod k where k is a numeral of type nat or int.
7466 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
7467 linear arithmetic fails. This takes account of quantifiers and divisibility.
7468 Presburger arithmetic can also be called explicitly via presburger(_tac).
7470 * simp's arithmetic capabilities have been enhanced a bit: it now
7471 takes ~= in premises into account (by performing a case split);
7473 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
7474 are distributed over a sum of terms;
7476 * New tactic "trans_tac" and method "trans" instantiate
7477 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
7480 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
7481 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
7483 * 'typedef' command has new option "open" to suppress the set
7486 * functions Min and Max on finite sets have been introduced (theory
7489 * attribute [symmetric] now works for relations as well; it turns
7490 (x,y) : R^-1 into (y,x) : R, and vice versa;
7492 * induct over a !!-quantified statement (say !!x1..xn):
7493 each "case" automatically performs "fix x1 .. xn" with exactly those names.
7495 * Map: `empty' is no longer a constant but a syntactic abbreviation for
7496 %x. None. Warning: empty_def now refers to the previously hidden definition
7499 * Algebra: formalization of classical algebra. Intended as base for
7500 any algebraic development in Isabelle. Currently covers group theory
7501 (up to Sylow's theorem) and ring theory (Universal Property of
7502 Univariate Polynomials). Contributions welcome;
7504 * GroupTheory: deleted, since its material has been moved to Algebra;
7506 * Complex: new directory of the complex numbers with numeric constants,
7507 nonstandard complex numbers, and some complex analysis, standard and
7508 nonstandard (Jacques Fleuriot);
7510 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
7512 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
7515 * Real/HahnBanach: updated and adapted to locales;
7517 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
7520 * UNITY: added the Meier-Sanders theory of progress sets;
7522 * MicroJava: bytecode verifier and lightweight bytecode verifier
7523 as abstract algorithms, instantiated to the JVM;
7525 * Bali: Java source language formalization. Type system, operational
7526 semantics, axiomatic semantics. Supported language features:
7527 classes, interfaces, objects,virtual methods, static methods,
7528 static/instance fields, arrays, access modifiers, definite
7529 assignment, exceptions.
7534 * ZF/Constructible: consistency proof for AC (Gdel's constructible
7537 * Main ZF: virtually all theories converted to new-style format;
7542 * Pure: Tactic.prove provides sane interface for internal proofs;
7543 omits the infamous "standard" operation, so this is more appropriate
7544 than prove_goalw_cterm in many situations (e.g. in simprocs);
7546 * Pure: improved error reporting of simprocs;
7548 * Provers: Simplifier.simproc(_i) provides sane interface for setting
7552 *** Document preparation ***
7554 * uses \par instead of \\ for line breaks in theory text. This may
7555 shift some page breaks in large documents. To get the old behaviour
7556 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
7558 * minimized dependencies of isabelle.sty and isabellesym.sty on
7561 * \<euro> now needs package babel/greek instead of marvosym (which
7564 * normal size for \<zero>...\<nine> (uses \mathbf instead of
7569 New in Isabelle2002 (March 2002)
7570 --------------------------------
7572 *** Document preparation ***
7574 * greatly simplified document preparation setup, including more
7575 graceful interpretation of isatool usedir -i/-d/-D options, and more
7576 instructive isatool mkdir; users should basically be able to get
7577 started with "isatool mkdir HOL Test && isatool make"; alternatively,
7578 users may run a separate document processing stage manually like this:
7579 "isatool usedir -D output HOL Test && isatool document Test/output";
7581 * theory dependency graph may now be incorporated into documents;
7582 isatool usedir -g true will produce session_graph.eps/.pdf for use
7583 with \includegraphics of LaTeX;
7585 * proper spacing of consecutive markup elements, especially text
7586 blocks after section headings;
7588 * support bold style (for single symbols only), input syntax is like
7589 this: "\<^bold>\<alpha>" or "\<^bold>A";
7591 * \<bullet> is now output as bold \cdot by default, which looks much
7592 better in printed text;
7594 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
7595 note that these symbols are currently unavailable in Proof General /
7596 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
7598 * isatool latex no longer depends on changed TEXINPUTS, instead
7599 isatool document copies the Isabelle style files to the target
7605 * Pure/Provers: improved proof by cases and induction;
7606 - 'case' command admits impromptu naming of parameters (such as
7608 - 'induct' method divinates rule instantiation from the inductive
7609 claim; no longer requires excessive ?P bindings for proper
7610 instantiation of cases;
7611 - 'induct' method properly enumerates all possibilities of set/type
7612 rules; as a consequence facts may be also passed through *type*
7613 rules without further ado;
7614 - 'induct' method now derives symbolic cases from the *rulified*
7615 rule (before it used to rulify cases stemming from the internal
7616 atomized version); this means that the context of a non-atomic
7617 statement becomes is included in the hypothesis, avoiding the
7618 slightly cumbersome show "PROP ?case" form;
7619 - 'induct' may now use elim-style induction rules without chaining
7620 facts, using ``missing'' premises from the goal state; this allows
7621 rules stemming from inductive sets to be applied in unstructured
7622 scripts, while still benefitting from proper handling of non-atomic
7623 statements; NB: major inductive premises need to be put first, all
7624 the rest of the goal is passed through the induction;
7625 - 'induct' proper support for mutual induction involving non-atomic
7626 rule statements (uses the new concept of simultaneous goals, see
7628 - append all possible rule selections, but only use the first
7629 success (no backtracking);
7630 - removed obsolete "(simplified)" and "(stripped)" options of methods;
7631 - undeclared rule case names default to numbers 1, 2, 3, ...;
7632 - added 'print_induct_rules' (covered by help item in recent Proof
7634 - moved induct/cases attributes to Pure, methods to Provers;
7635 - generic method setup instantiated for FOL and HOL;
7637 * Pure: support multiple simultaneous goal statements, for example
7638 "have a: A and b: B" (same for 'theorem' etc.); being a pure
7639 meta-level mechanism, this acts as if several individual goals had
7640 been stated separately; in particular common proof methods need to be
7641 repeated in order to cover all claims; note that a single elimination
7642 step is *not* sufficient to establish the two conjunctions, so this
7645 assume "A & B" then have A and B .. (*".." fails*)
7647 better use "obtain" in situations as above; alternative refer to
7648 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
7650 * Pure: proper integration with ``locales''; unlike the original
7651 version by Florian Kammller, Isar locales package high-level proof
7652 contexts rather than raw logical ones (e.g. we admit to include
7653 attributes everywhere); operations on locales include merge and
7654 rename; support for implicit arguments (``structures''); simultaneous
7655 type-inference over imports and text; see also HOL/ex/Locales.thy for
7658 * Pure: the following commands have been ``localized'', supporting a
7659 target locale specification "(in name)": 'lemma', 'theorem',
7660 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
7661 stored both within the locale and at the theory level (exported and
7662 qualified by the locale name);
7664 * Pure: theory goals may now be specified in ``long'' form, with
7665 ad-hoc contexts consisting of arbitrary locale elements. for example
7666 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
7667 definitions may be given, too); the result is a meta-level rule with
7668 the context elements being discharged in the obvious way;
7670 * Pure: new proof command 'using' allows to augment currently used
7671 facts after a goal statement ('using' is syntactically analogous to
7672 'apply', but acts on the goal's facts only); this allows chained facts
7673 to be separated into parts given before and after a claim, as in
7674 ``from a and b have C using d and e <proof>'';
7676 * Pure: renamed "antecedent" case to "rule_context";
7678 * Pure: new 'judgment' command records explicit information about the
7679 object-logic embedding (used by several tools internally); no longer
7680 use hard-wired "Trueprop";
7682 * Pure: added 'corollary' command;
7684 * Pure: fixed 'token_translation' command;
7686 * Pure: removed obsolete 'exported' attribute;
7688 * Pure: dummy pattern "_" in is/let is now automatically lifted over
7689 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
7690 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
7692 * Pure: method 'atomize' presents local goal premises as object-level
7693 statements (atomic meta-level propositions); setup controlled via
7694 rewrite rules declarations of 'atomize' attribute; example
7695 application: 'induct' method with proper rule statements in improper
7698 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
7699 now consider the syntactic context of assumptions, giving a better
7700 chance to get type-inference of the arguments right (this is
7701 especially important for locales);
7703 * Pure: "sorry" no longer requires quick_and_dirty in interactive
7706 * Pure/obtain: the formal conclusion "thesis", being marked as
7707 ``internal'', may no longer be reference directly in the text;
7708 potential INCOMPATIBILITY, may need to use "?thesis" in rare
7711 * Pure: generic 'sym' attribute which declares a rule both as pure
7712 'elim?' and for the 'symmetric' operation;
7714 * Pure: marginal comments ``--'' may now occur just anywhere in the
7715 text; the fixed correlation with particular command syntax has been
7718 * Pure: new method 'rules' is particularly well-suited for proof
7719 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
7720 but often produces more compact proof terms with less detours;
7722 * Pure/Provers/classical: simplified integration with pure rule
7723 attributes and methods; the classical "intro?/elim?/dest?"
7724 declarations coincide with the pure ones; the "rule" method no longer
7725 includes classically swapped intros; "intro" and "elim" methods no
7726 longer pick rules from the context; also got rid of ML declarations
7727 AddXIs/AddXEs/AddXDs; all of this has some potential for
7730 * Provers/classical: attribute 'swapped' produces classical inversions
7731 of introduction rules;
7733 * Provers/simplifier: 'simplified' attribute may refer to explicit
7734 rules instead of full simplifier context; 'iff' attribute handles
7737 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
7739 * HOL: 'recdef' now fails on unfinished automated proofs, use
7740 "(permissive)" option to recover old behavior;
7742 * HOL: 'inductive' no longer features separate (collective) attributes
7743 for 'intros' (was found too confusing);
7745 * HOL: properly declared induction rules less_induct and
7751 * HOL: moved over to sane numeral syntax; the new policy is as
7754 - 0 and 1 are polymorphic constants, which are defined on any
7755 numeric type (nat, int, real etc.);
7757 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
7758 binary representation internally;
7760 - type nat has special constructor Suc, and generally prefers Suc 0
7761 over 1::nat and Suc (Suc 0) over 2::nat;
7763 This change may cause significant problems of INCOMPATIBILITY; here
7764 are some hints on converting existing sources:
7766 - due to the new "num" token, "-0" and "-1" etc. are now atomic
7767 entities, so expressions involving "-" (unary or binary minus) need
7768 to be spaced properly;
7770 - existing occurrences of "1" may need to be constraint "1::nat" or
7771 even replaced by Suc 0; similar for old "2";
7773 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
7775 - remove all special provisions on numerals in proofs;
7777 * HOL: simp rules nat_number expand numerals on nat to Suc/0
7778 representation (depends on bin_arith_simps in the default context);
7780 * HOL: symbolic syntax for x^2 (numeral 2);
7782 * HOL: the class of all HOL types is now called "type" rather than
7783 "term"; INCOMPATIBILITY, need to adapt references to this type class
7784 in axclass/classes, instance/arities, and (usually rare) occurrences
7785 in typings (of consts etc.); internally the class is called
7786 "HOL.type", ML programs should refer to HOLogic.typeS;
7788 * HOL/record package improvements:
7789 - new derived operations "fields" to build a partial record section,
7790 "extend" to promote a fixed record to a record scheme, and
7791 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
7792 declared as simp by default;
7793 - shared operations ("more", "fields", etc.) now need to be always
7794 qualified) --- potential INCOMPATIBILITY;
7795 - removed "make_scheme" operations (use "make" with "extend") --
7797 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
7798 - provides cases/induct rules for use with corresponding Isar
7799 methods (for concrete records, record schemes, concrete more
7800 parts, and schematic more parts -- in that order);
7801 - internal definitions directly based on a light-weight abstract
7802 theory of product types over typedef rather than datatype;
7804 * HOL: generic code generator for generating executable ML code from
7805 specifications; specific support for HOL constructs such as inductive
7806 datatypes and sets, as well as recursive functions; can be invoked
7807 via 'generate_code' theory section;
7809 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
7811 * HOL: consolidated and renamed several theories. In particular:
7812 Ord.thy has been absorbed into HOL.thy
7813 String.thy has been absorbed into List.thy
7815 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
7816 (beware of argument permutation!);
7818 * HOL: linorder_less_split superseded by linorder_cases;
7820 * HOL/List: "nodups" renamed to "distinct";
7822 * HOL: added "The" definite description operator; move Hilbert's "Eps"
7823 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
7824 - Ex_def has changed, now need to use some_eq_ex
7826 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
7827 in this (rare) case use:
7829 delSWrapper "split_all_tac"
7830 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
7832 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
7835 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
7836 Isabelle's type classes, ^ on functions and relations has too general
7837 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
7838 necessary to attach explicit type constraints;
7840 * HOL/Relation: the prefix name of the infix "O" has been changed from
7841 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
7842 renamed accordingly (eg "compI" -> "rel_compI").
7844 * HOL: syntax translations now work properly with numerals and records
7847 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
7848 of "lam" -- INCOMPATIBILITY;
7850 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
7851 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
7852 renamed "Product_Type.unit";
7854 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
7856 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
7857 the "cases" method);
7859 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
7862 * HOL/IMP: updated and converted to new-style theory format; several
7863 parts turned into readable document, with proper Isar proof texts and
7864 some explanations (by Gerwin Klein);
7866 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
7868 * HOL-Hyperreal is now a logic image;
7873 * Isar: consts/constdefs supports mixfix syntax for continuous
7876 * Isar: domain package adapted to new-style theory format, e.g. see
7879 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
7880 potential INCOMPATIBILITY; now use plain induct_tac instead of former
7881 lift.induct_tac, always use UU instead of Undef;
7883 * HOLCF/IMP: updated and converted to new-style theory;
7888 * Isar: proper integration of logic-specific tools and packages,
7889 including theory commands '(co)inductive', '(co)datatype',
7890 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
7891 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
7893 * theory Main no longer includes AC; for the Axiom of Choice, base
7894 your theory on Main_ZFC;
7896 * the integer library now covers quotients and remainders, with many
7897 laws relating division to addition, multiplication, etc.;
7899 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
7900 typeless version of the formalism;
7902 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
7905 * ZF/Induct: new directory for examples of inductive definitions,
7906 including theory Multiset for multiset orderings; converted to
7907 new-style theory format;
7909 * ZF: many new theorems about lists, ordinals, etc.;
7914 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
7915 variable proof controls level of detail: 0 = no proofs (only oracle
7916 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
7917 also ref manual for further ML interfaces;
7919 * Pure/axclass: removed obsolete ML interface
7920 goal_subclass/goal_arity;
7922 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
7923 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
7924 separate tokens, so expressions involving minus need to be spaced
7927 * Pure/syntax: support non-oriented infixes, using keyword "infix"
7928 rather than "infixl" or "infixr";
7930 * Pure/syntax: concrete syntax for dummy type variables admits genuine
7931 sort constraint specifications in type inference; e.g. "x::_::foo"
7932 ensures that the type of "x" is of sort "foo" (but not necessarily a
7935 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
7936 control output of nested => (types); the default behavior is
7939 * Pure/syntax: builtin parse translation for "_constify" turns valued
7940 tokens into AST constants;
7942 * Pure/syntax: prefer later declarations of translations and print
7943 translation functions; potential INCOMPATIBILITY: need to reverse
7944 multiple declarations for same syntax element constant;
7946 * Pure/show_hyps reset by default (in accordance to existing Isar
7949 * Provers/classical: renamed addaltern to addafter, addSaltern to
7952 * Provers/clasimp: ``iff'' declarations now handle conditional rules
7955 * system: tested support for MacOS X; should be able to get Isabelle +
7956 Proof General to work in a plain Terminal after installing Poly/ML
7957 (e.g. from the Isabelle distribution area) and GNU bash alone
7958 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
7959 support requires further installations, e.g. from
7960 http://fink.sourceforge.net/);
7962 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
7964 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
7965 of 40 MB), cf. ML_OPTIONS;
7967 * system: Proof General keywords specification is now part of the
7968 Isabelle distribution (see etc/isar-keywords.el);
7970 * system: support for persistent Proof General sessions (refrain from
7971 outdating all loaded theories on startup); user may create writable
7972 logic images like this: ``isabelle -q HOL Test'';
7974 * system: smart selection of Isabelle process versus Isabelle
7975 interface, accommodates case-insensitive file systems (e.g. HFS+); may
7976 run both "isabelle" and "Isabelle" even if file names are badly
7977 damaged (executable inspects the case of the first letter of its own
7978 name); added separate "isabelle-process" and "isabelle-interface";
7980 * system: refrain from any attempt at filtering input streams; no
7981 longer support ``8bit'' encoding of old isabelle font, instead proper
7982 iso-latin characters may now be used; the related isatools
7983 "symbolinput" and "nonascii" have disappeared as well;
7985 * system: removed old "xterm" interface (the print modes "xterm" and
7986 "xterm_color" are still available for direct use in a suitable
7991 New in Isabelle99-2 (February 2001)
7992 -----------------------------------
7994 *** Overview of INCOMPATIBILITIES ***
7996 * HOL: please note that theories in the Library and elsewhere often use the
7997 new-style (Isar) format; to refer to their theorems in an ML script you must
7998 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
8000 * HOL: inductive package no longer splits induction rule aggressively,
8001 but only as far as specified by the introductions given; the old
8002 format may be recovered via ML function complete_split_rule or attribute
8003 'split_rule (complete)';
8005 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
8006 gfp_Tarski to gfp_unfold;
8008 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
8010 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
8011 relation); infix "^^" has been renamed "``"; infix "``" has been
8012 renamed "`"; "univalent" has been renamed "single_valued";
8014 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
8017 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
8019 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
8021 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
8022 consequence, it is no longer monotonic wrt. the local goal context
8023 (which is now passed through the inductive cases);
8025 * Document preparation: renamed standard symbols \<ll> to \<lless> and
8026 \<gg> to \<ggreater>;
8029 *** Document preparation ***
8031 * \isabellestyle{NAME} selects version of Isabelle output (currently
8032 available: are "it" for near math-mode best-style output, "sl" for
8033 slanted text style, and "tt" for plain type-writer; if no
8034 \isabellestyle command is given, output is according to slanted
8037 * support sub/super scripts (for single symbols only), input syntax is
8038 like this: "A\<^sup>*" or "A\<^sup>\<star>";
8040 * some more standard symbols; see Appendix A of the system manual for
8041 the complete list of symbols defined in isabellesym.sty;
8043 * improved isabelle style files; more abstract symbol implementation
8044 (should now use \isamath{...} and \isatext{...} in custom symbol
8047 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
8048 state; Note that presentation of goal states does not conform to
8049 actual human-readable proof documents. Please do not include goal
8050 states into document output unless you really know what you are doing!
8052 * proper indentation of antiquoted output with proportional LaTeX
8055 * no_document ML operator temporarily disables LaTeX document
8058 * isatool unsymbolize tunes sources for plain ASCII communication;
8063 * Pure: Isar now suffers initial goal statements to contain unbound
8064 schematic variables (this does not conform to actual readable proof
8065 documents, due to unpredictable outcome and non-compositional proof
8066 checking); users who know what they are doing may use schematic goals
8067 for Prolog-style synthesis of proven results;
8069 * Pure: assumption method (an implicit finishing) now handles actual
8072 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
8073 initial goal, declare "that" only as Pure intro (only for single
8074 steps); the "that" rule assumption may now be involved in implicit
8075 finishing, thus ".." becomes a feasible for trivial obtains;
8077 * Pure: default proof step now includes 'intro_classes'; thus trivial
8078 instance proofs may be performed by "..";
8080 * Pure: ?thesis / ?this / "..." now work for pure meta-level
8083 * Pure: more robust selection of calculational rules;
8085 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
8086 rule (as well as the assumption rule);
8088 * Pure: 'thm_deps' command visualizes dependencies of theorems and
8089 lemmas, using the graph browser tool;
8091 * Pure: predict failure of "show" in interactive mode;
8093 * Pure: 'thms_containing' now takes actual terms as arguments;
8095 * HOL: improved method 'induct' --- now handles non-atomic goals
8096 (potential INCOMPATIBILITY); tuned error handling;
8098 * HOL: cases and induct rules now provide explicit hints about the
8099 number of facts to be consumed (0 for "type" and 1 for "set" rules);
8100 any remaining facts are inserted into the goal verbatim;
8102 * HOL: local contexts (aka cases) may now contain term bindings as
8103 well; the 'cases' and 'induct' methods new provide a ?case binding for
8104 the result to be shown in each case;
8106 * HOL: added 'recdef_tc' command;
8108 * isatool convert assists in eliminating legacy ML scripts;
8113 * HOL/Library: a collection of generic theories to be used together
8114 with main HOL; the theory loader path already includes this directory
8115 by default; the following existing theories have been moved here:
8116 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
8117 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
8119 * HOL/Unix: "Some aspects of Unix file-system security", a typical
8120 modelling and verification task performed in Isabelle/HOL +
8121 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
8123 * HOL/Algebra: special summation operator SUM no longer exists, it has
8124 been replaced by setsum; infix 'assoc' now has priority 50 (like
8125 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
8126 'domain', this makes the theory consistent with mathematical
8129 * HOL basics: added overloaded operations "inverse" and "divide"
8130 (infix "/"), syntax for generic "abs" operation, generic summation
8133 * HOL/typedef: simplified package, provide more useful rules (see also
8136 * HOL/datatype: induction rule for arbitrarily branching datatypes is
8137 now expressed as a proper nested rule (old-style tactic scripts may
8138 require atomize_strip_tac to cope with non-atomic premises);
8140 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
8141 to "split_conv" (old name still available for compatibility);
8143 * HOL: improved concrete syntax for strings (e.g. allows translation
8144 rules with string literals);
8146 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
8147 and Fleuriot's mechanization of analysis, including the transcendental
8148 functions for the reals;
8150 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
8155 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
8156 "lam" is displayed as TWO lambda-symbols
8158 * CTT: theory Main now available, containing everything (that is, Bool
8164 * Pure: the Simplifier has been implemented properly as a derived rule
8165 outside of the actual kernel (at last!); the overall performance
8166 penalty in practical applications is about 50%, while reliability of
8167 the Isabelle inference kernel has been greatly improved;
8169 * print modes "brackets" and "no_brackets" control output of nested =>
8170 (types) and ==> (props); the default behaviour is "brackets";
8172 * Provers: fast_tac (and friends) now handle actual object-logic rules
8173 as assumptions as well;
8175 * system: support Poly/ML 4.0;
8177 * system: isatool install handles KDE version 1 or 2;
8181 New in Isabelle99-1 (October 2000)
8182 ----------------------------------
8184 *** Overview of INCOMPATIBILITIES ***
8186 * HOL: simplification of natural numbers is much changed; to partly
8187 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
8188 issue the following ML commands:
8190 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
8191 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
8193 * HOL: simplification no longer dives into case-expressions; this is
8194 controlled by "t.weak_case_cong" for each datatype t;
8196 * HOL: nat_less_induct renamed to less_induct;
8198 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
8199 fixsome to patch .thy and .ML sources automatically;
8201 select_equality -> some_equality
8202 select_eq_Ex -> some_eq_ex
8203 selectI2EX -> someI2_ex
8206 select1_equality -> some1_equality
8207 Eps_sym_eq -> some_sym_eq_trivial
8208 Eps_eq -> some_eq_trivial
8210 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
8212 * HOL: removed obsolete theorem binding expand_if (refer to split_if
8215 * HOL: the recursion equations generated by 'recdef' are now called
8216 f.simps instead of f.rules;
8218 * HOL: qed_spec_mp now also handles bounded ALL as well;
8220 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
8221 sometimes be needed;
8223 * HOL: the constant for "f``x" is now "image" rather than "op ``";
8225 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
8227 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
8228 product is now "<*>" instead of "Times"; the lexicographic product is
8229 now "<*lex*>" instead of "**";
8231 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
8232 of main HOL, but was unused); better use HOL's datatype package;
8234 * HOL: removed "symbols" syntax for constant "override" of theory Map;
8235 the old syntax may be recovered as follows:
8238 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
8239 (infixl "\\<oplus>" 100)
8241 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8243 * HOL/ML: even fewer consts are declared as global (see theories Ord,
8244 Lfp, Gfp, WF); this only affects ML packages that refer to const names
8247 * HOL and ZF: syntax for quotienting wrt an equivalence relation
8248 changed from A/r to A//r;
8250 * ZF: new treatment of arithmetic (nat & int) may break some old
8253 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
8254 rulify -> rule_format, elimify -> elim_format, ...);
8256 * Isar/Provers: intro/elim/dest attributes changed; renamed
8257 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
8258 should have to change intro!! to intro? only); replaced "delrule" by
8261 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
8263 * Provers: strengthened force_tac by using new first_best_tac;
8265 * LaTeX document preparation: several changes of isabelle.sty (see
8269 *** Document preparation ***
8271 * formal comments (text blocks etc.) in new-style theories may now
8272 contain antiquotations of thm/prop/term/typ/text to be presented
8273 according to latex print mode; concrete syntax is like this:
8274 @{term[show_types] "f(x) = a + x"};
8276 * isatool mkdir provides easy setup of Isabelle session directories,
8277 including proper document sources;
8279 * generated LaTeX sources are now deleted after successful run
8280 (isatool document -c); may retain a copy somewhere else via -D option
8283 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
8284 style files, achieving self-contained LaTeX sources and simplifying
8287 * old-style theories now produce (crude) LaTeX output as well;
8289 * browser info session directories are now self-contained (may be put
8290 on WWW server seperately); improved graphs of nested sessions; removed
8291 graph for 'all sessions';
8293 * several improvements in isabelle style files; \isabellestyle{it}
8294 produces fake math mode output; \isamarkupheader is now \section by
8295 default; see lib/texinputs/isabelle.sty etc.;
8300 * Isar/Pure: local results and corresponding term bindings are now
8301 subject to Hindley-Milner polymorphism (similar to ML); this
8302 accommodates incremental type-inference very nicely;
8304 * Isar/Pure: new derived language element 'obtain' supports
8305 generalized existence reasoning;
8307 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
8308 support accumulation of results, without applying any rules yet;
8309 useful to collect intermediate results without explicit name
8310 references, and for use with transitivity rules with more than 2
8313 * Isar/Pure: scalable support for case-analysis type proofs: new
8314 'case' language element refers to local contexts symbolically, as
8315 produced by certain proof methods; internally, case names are attached
8316 to theorems as "tags";
8318 * Isar/Pure: theory command 'hide' removes declarations from
8319 class/type/const name spaces;
8321 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
8322 indicate potential overloading;
8324 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
8326 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
8327 "{a,b,c}" instead of {a,b,c};
8329 * Isar/Pure now provides its own version of intro/elim/dest
8330 attributes; useful for building new logics, but beware of confusion
8331 with the version in Provers/classical;
8333 * Isar/Pure: the local context of (non-atomic) goals is provided via
8334 case name 'antecedent';
8336 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
8337 to the current context is now done automatically);
8339 * Isar/Pure: theory command 'method_setup' provides a simple interface
8340 for definining proof methods in ML;
8342 * Isar/Provers: intro/elim/dest attributes changed; renamed
8343 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
8344 most cases, one should have to change intro!! to intro? only);
8345 replaced "delrule" by "rule del";
8347 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
8348 'symmetric' attribute (the latter supercedes [RS sym]);
8350 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
8351 method modifier); 'simp' method: 'only:' modifier removes loopers as
8352 well (including splits);
8354 * Isar/Provers: Simplifier and Classical methods now support all kind
8355 of modifiers used in the past, including 'cong', 'iff', etc.
8357 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
8358 of Simplifier and Classical reasoner);
8360 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
8361 now support named cases; major packages (inductive, datatype, primrec,
8362 recdef) support case names and properly name parameters;
8364 * Isar/HOL: new transitivity rules for substitution in inequalities --
8365 monotonicity conditions are extracted to be proven at end of
8368 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
8371 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
8372 split_if split_if_asm; datatype package provides theorems foo.splits =
8373 foo.split foo.split_asm for each datatype;
8375 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
8376 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
8377 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
8378 use "(cases (simplified))" method in proper proof texts);
8380 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
8382 * Isar: names of theorems etc. may be natural numbers as well;
8384 * Isar: 'pr' command: optional arguments for goals_limit and
8385 ProofContext.prems_limit; no longer prints theory contexts, but only
8388 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
8389 additional print modes to be specified; e.g. "pr(latex)" will print
8390 proof state according to the Isabelle LaTeX style;
8392 * Isar: improved support for emulating tactic scripts, including proof
8393 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
8394 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
8395 (for HOL datatypes);
8397 * Isar: simplified (more robust) goal selection of proof methods: 1st
8398 goal, all goals, or explicit goal specifier (tactic emulation); thus
8399 'proof method scripts' have to be in depth-first order;
8401 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
8403 * Isar: removed 'help' command, which hasn't been too helpful anyway;
8404 should instead use individual commands for printing items
8405 (print_commands, print_methods etc.);
8407 * Isar: added 'nothing' --- the empty list of theorems;
8412 * HOL/MicroJava: formalization of a fragment of Java, together with a
8413 corresponding virtual machine and a specification of its bytecode
8414 verifier and a lightweight bytecode verifier, including proofs of
8415 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
8416 Cornelia Pusch (see also the homepage of project Bali at
8417 http://isabelle.in.tum.de/Bali/);
8419 * HOL/Algebra: new theory of rings and univariate polynomials, by
8422 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
8423 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
8426 * HOL/Lattice: fundamental concepts of lattice theory and order
8427 structures, including duals, properties of bounds versus algebraic
8428 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
8429 Theorem for complete lattices etc.; may also serve as a demonstration
8430 for abstract algebraic reasoning using axiomatic type classes, and
8431 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
8433 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
8436 * HOL/IMPP: extension of IMP with local variables and mutually
8437 recursive procedures, by David von Oheimb;
8439 * HOL/Lambda: converted into new-style theory and document;
8441 * HOL/ex/Multiquote: example of multiple nested quotations and
8442 anti-quotations -- basically a generalized version of de-Bruijn
8443 representation; very useful in avoiding lifting of operations;
8445 * HOL/record: added general record equality rule to simpset; fixed
8446 select-update simplification procedure to handle extended records as
8447 well; admit "r" as field name;
8449 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
8450 other numeric types and also as the identity of groups, rings, etc.;
8452 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
8453 Types nat and int belong to this axclass;
8455 * HOL: greatly improved simplification involving numerals of type nat, int, real:
8456 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
8457 i*j + k + j*#3*i simplifies to #4*(i*j) + k
8458 two terms #m*u and #n*u are replaced by #(m+n)*u
8459 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
8460 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
8461 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
8463 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
8464 powerful prover for predicate logic but knows nothing of clasets; see
8465 ex/mesontest.ML and ex/mesontest2.ML for example applications;
8467 * HOL: new version of "case_tac" subsumes both boolean case split and
8468 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
8469 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
8471 * HOL: simplification no longer dives into case-expressions: only the
8472 selector expression is simplified, but not the remaining arms; to
8473 enable full simplification of case-expressions for datatype t, you may
8474 remove t.weak_case_cong from the simpset, either globally (Delcongs
8475 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
8477 * HOL/recdef: the recursion equations generated by 'recdef' for
8478 function 'f' are now called f.simps instead of f.rules; if all
8479 termination conditions are proved automatically, these simplification
8480 rules are added to the simpset, as in primrec; rules may be named
8481 individually as well, resulting in a separate list of theorems for
8484 * HOL/While is a new theory that provides a while-combinator. It
8485 permits the definition of tail-recursive functions without the
8486 provision of a termination measure. The latter is necessary once the
8487 invariant proof rule for while is applied.
8489 * HOL: new (overloaded) notation for the set of elements below/above
8490 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
8492 * HOL: theorems impI, allI, ballI bound as "strip";
8494 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
8495 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
8496 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
8498 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8500 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
8501 main HOL, but was unused);
8503 * HOL: fewer consts declared as global (e.g. have to refer to
8504 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
8506 * HOL: tuned AST representation of nested pairs, avoiding bogus output
8507 in case of overlap with user translations (e.g. judgements over
8508 tuples); (note that the underlying logical represenation is still
8514 * ZF: simplification automatically cancels common terms in arithmetic
8515 expressions over nat and int;
8517 * ZF: new treatment of nat to minimize type-checking: all operators
8518 coerce their operands to a natural number using the function natify,
8519 making the algebraic laws unconditional;
8521 * ZF: as above, for int: operators coerce their operands to an integer
8522 using the function intify;
8524 * ZF: the integer library now contains many of the usual laws for the
8525 orderings, including $<=, and monotonicity laws for $+ and $*;
8527 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
8530 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
8531 to the simplifier and classical reasoner simultaneously;
8536 * Provers: blast_tac now handles actual object-logic rules as
8537 assumptions; note that auto_tac uses blast_tac internally as well;
8539 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
8540 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
8542 * Provers: delrules now handles destruct rules as well (no longer need
8543 explicit make_elim);
8545 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
8546 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8547 use instead the strong form,
8548 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8549 in HOL, FOL and ZF the function cla_make_elim will create such rules
8550 from destruct-rules;
8552 * Provers: Simplifier.easy_setup provides a fast path to basic
8553 Simplifier setup for new object-logics;
8555 * Pure: AST translation rules no longer require constant head on LHS;
8557 * Pure: improved name spaces: ambiguous output is qualified; support
8558 for hiding of names;
8560 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
8561 XSYMBOL_HOME; no longer need to do manual configuration in most
8564 * system: compression of ML heaps images may now be controlled via -c
8565 option of isabelle and isatool usedir (currently only observed by
8568 * system: isatool installfonts may handle X-Symbol fonts as well (very
8569 useful for remote X11);
8571 * system: provide TAGS file for Isabelle sources;
8573 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
8576 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
8577 timing flag supersedes proof_timing and Toplevel.trace;
8579 * ML: new combinators |>> and |>>> for incremental transformations
8580 with secondary results (e.g. certain theory extensions):
8582 * ML: PureThy.add_defs gets additional argument to indicate potential
8583 overloading (usually false);
8585 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
8590 New in Isabelle99 (October 1999)
8591 --------------------------------
8593 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8595 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
8596 are no longer simplified. (This allows the simplifier to unfold recursive
8597 functional programs.) To restore the old behaviour, declare
8599 Delcongs [if_weak_cong];
8601 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
8604 * HOL: the predicate "inj" is now defined by translation to "inj_on";
8606 * HOL/datatype: mutual_induct_tac no longer exists --
8607 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
8609 * HOL/typedef: fixed type inference for representing set; type
8610 arguments now have to occur explicitly on the rhs as type constraints;
8612 * ZF: The con_defs part of an inductive definition may no longer refer
8613 to constants declared in the same theory;
8615 * HOL, ZF: the function mk_cases, generated by the inductive
8616 definition package, has lost an argument. To simplify its result, it
8617 uses the default simpset instead of a supplied list of theorems.
8619 * HOL/List: the constructors of type list are now Nil and Cons;
8621 * Simplifier: the type of the infix ML functions
8622 setSSolver addSSolver setSolver addSolver
8623 is now simpset * solver -> simpset where `solver' is a new abstract type
8624 for packaging solvers. A solver is created via
8625 mk_solver: string -> (thm list -> int -> tactic) -> solver
8626 where the string argument is only a comment.
8631 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
8632 decision procedure for linear arithmetic. Currently it is used for
8633 types `nat', `int', and `real' in HOL (see below); it can, should and
8634 will be instantiated for other types and logics as well.
8636 * The simplifier now accepts rewrite rules with flexible heads, eg
8637 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
8638 They are applied like any rule with a non-pattern lhs, i.e. by first-order
8644 * New Isabelle/Isar subsystem provides an alternative to traditional
8645 tactical theorem proving; together with the ProofGeneral/isar user
8646 interface it offers an interactive environment for developing human
8647 readable proof documents (Isar == Intelligible semi-automated
8648 reasoning); for further information see isatool doc isar-ref,
8649 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
8651 * improved and simplified presentation of theories: better HTML markup
8652 (including colors), graph views in several sizes; isatool usedir now
8653 provides a proper interface for user theories (via -P option); actual
8654 document preparation based on (PDF)LaTeX is available as well (for
8655 new-style theories only); see isatool doc system for more information;
8657 * native support for Proof General, both for classic Isabelle and
8660 * ML function thm_deps visualizes dependencies of theorems and lemmas,
8661 using the graph browser tool;
8663 * Isabelle manuals now also available as PDF;
8665 * theory loader rewritten from scratch (may not be fully
8666 bug-compatible); old loadpath variable has been replaced by show_path,
8667 add_path, del_path, reset_path functions; new operations such as
8668 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
8671 * improved isatool install: option -k creates KDE application icon,
8672 option -p DIR installs standalone binaries;
8674 * added ML_PLATFORM setting (useful for cross-platform installations);
8675 more robust handling of platform specific ML images for SML/NJ;
8677 * the settings environment is now statically scoped, i.e. it is never
8678 created again in sub-processes invoked from isabelle, isatool, or
8681 * path element specification '~~' refers to '$ISABELLE_HOME';
8683 * in locales, the "assumes" and "defines" parts may be omitted if
8686 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
8689 * new print_mode "HTML";
8691 * new flag show_tags controls display of tags of theorems (which are
8692 basically just comments that may be attached by some tools);
8694 * Isamode 2.6 requires patch to accomodate change of Isabelle font
8695 mode and goal output format:
8697 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
8699 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
8701 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
8702 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
8704 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
8706 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
8708 * function bind_thms stores lists of theorems (cf. bind_thm);
8710 * new shorthand tactics ftac, eatac, datac, fatac;
8712 * qed (and friends) now accept "" as result name; in that case the
8713 theorem is not stored, but proper checks and presentation of the
8716 * theorem database now also indexes constants "Trueprop", "all",
8717 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
8722 ** HOL arithmetic **
8724 * There are now decision procedures for linear arithmetic over nat and
8727 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
8728 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
8729 are treated as atomic; subformulae not involving type `nat' or `int'
8730 are ignored; quantified subformulae are ignored unless they are
8731 positive universal or negative existential. The tactic has to be
8732 invoked by hand and can be a little bit slow. In particular, the
8733 running time is exponential in the number of occurrences of `min' and
8734 `max', and `-' on `nat'.
8736 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
8737 (negated) (in)equalities among the premises and the conclusion into
8738 account (i.e. no compound formulae) and does not know about `min' and
8739 `max', and `-' on `nat'. It is fast and is used automatically by the
8742 NB: At the moment, these decision procedures do not cope with mixed
8743 nat/int formulae where the two parts interact, such as `m < n ==>
8746 * HOL/Numeral provides a generic theory of numerals (encoded
8747 efficiently as bit strings); setup for types nat/int/real is in place;
8748 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
8749 int, existing theories and proof scripts may require a few additional
8752 * integer division and remainder can now be performed on constant
8755 * many properties of integer multiplication, division and remainder
8758 * An interface to the Stanford Validity Checker (SVC) is available through the
8759 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
8760 are proved automatically. SVC must be installed separately, and its results
8761 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
8762 invocation of the underlying oracle). For SVC see
8763 http://verify.stanford.edu/SVC
8765 * IsaMakefile: the HOL-Real target now builds an actual image;
8770 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
8771 (in Isabelle/Isar) -- by Gertrud Bauer;
8773 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
8774 analysis for assembly languages with subtypes;
8776 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
8777 -- avoids syntactic ambiguities and treats state, transition, and
8778 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
8779 changed syntax and (many) tactics;
8781 * HOL/inductive: Now also handles more general introduction rules such
8782 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
8783 theorems are now maintained within the theory (maintained via the
8786 * HOL/datatype: Now also handles arbitrarily branching datatypes
8787 (using function types) such as
8789 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
8791 * HOL/record: record_simproc (part of the default simpset) takes care
8792 of selectors applied to updated records; record_split_tac is no longer
8793 part of the default claset; update_defs may now be removed from the
8794 simpset in many cases; COMPATIBILITY: old behavior achieved by
8796 claset_ref () := claset() addSWrapper record_split_wrapper;
8797 Delsimprocs [record_simproc]
8799 * HOL/typedef: fixed type inference for representing set; type
8800 arguments now have to occur explicitly on the rhs as type constraints;
8802 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
8803 names rather than an ML expression;
8805 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
8806 supplied later. Program schemes can be defined, such as
8807 "While B C s = (if B s then While B C (C s) else s)"
8808 where the well-founded relation can be chosen after B and C have been given.
8810 * HOL/List: the constructors of type list are now Nil and Cons;
8811 INCOMPATIBILITY: while [] and infix # syntax is still there, of
8812 course, ML tools referring to List.list.op # etc. have to be adapted;
8814 * HOL_quantifiers flag superseded by "HOL" print mode, which is
8815 disabled by default; run isabelle with option -m HOL to get back to
8816 the original Gordon/HOL-style output;
8818 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
8819 ALL x<=y. P, EX x<y. P, EX x<=y. P;
8821 * HOL basic syntax simplified (more orthogonal): all variants of
8822 All/Ex now support plain / symbolic / HOL notation; plain syntax for
8823 Eps operator is provided as well: "SOME x. P[x]";
8825 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
8827 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
8828 thus available for user theories;
8830 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
8831 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
8834 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
8835 several times and then mp;
8840 * the notation <<...>> is now available as a notation for sequences of
8843 * the simplifier is now installed
8845 * the axiom system has been generalized (thanks to Soren Heilmann)
8847 * the classical reasoner now has a default rule database
8852 * new primrec section allows primitive recursive functions to be given
8853 directly (as in HOL) over datatypes and the natural numbers;
8855 * new tactics induct_tac and exhaust_tac for induction (or case
8856 analysis) over datatypes and the natural numbers;
8858 * the datatype declaration of type T now defines the recursor T_rec;
8860 * simplification automatically does freeness reasoning for datatype
8863 * automatic type-inference, with AddTCs command to insert new
8864 type-checking rules;
8866 * datatype introduction rules are now added as Safe Introduction rules
8869 * the syntax "if P then x else y" is now available in addition to
8873 *** Internal programming interfaces ***
8875 * tuned simplifier trace output; new flag debug_simp;
8877 * structures Vartab / Termtab (instances of TableFun) offer efficient
8878 tables indexed by indexname_ord / term_ord (compatible with aconv);
8880 * AxClass.axclass_tac lost the theory argument;
8882 * tuned current_goals_markers semantics: begin / end goal avoids
8883 printing empty lines;
8885 * removed prs and prs_fn hook, which was broken because it did not
8886 include \n in its semantics, forcing writeln to add one
8887 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
8888 string -> unit if you really want to output text without newline;
8890 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
8891 plain output, interface builders may have to enable 'isabelle_font'
8892 mode to get Isabelle font glyphs as before;
8894 * refined token_translation interface; INCOMPATIBILITY: output length
8895 now of type real instead of int;
8897 * theory loader actions may be traced via new ThyInfo.add_hook
8898 interface (see src/Pure/Thy/thy_info.ML); example application: keep
8899 your own database of information attached to *whole* theories -- as
8900 opposed to intra-theory data slots offered via TheoryDataFun;
8902 * proper handling of dangling sort hypotheses (at last!);
8903 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
8904 extra sort hypotheses that can be witnessed from the type signature;
8905 the force_strip_shyps flag is gone, any remaining shyps are simply
8906 left in the theorem (with a warning issued by strip_shyps_warning);
8910 New in Isabelle98-1 (October 1998)
8911 ----------------------------------
8913 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8915 * several changes of automated proof tools;
8917 * HOL: major changes to the inductive and datatype packages, including
8918 some minor incompatibilities of theory syntax;
8920 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
8923 * HOL: removed duplicate thms in Arith:
8924 less_imp_add_less should be replaced by trans_less_add1
8925 le_imp_add_le should be replaced by trans_le_add1
8927 * HOL: unary minus is now overloaded (new type constraints may be
8930 * HOL and ZF: unary minus for integers is now #- instead of #~. In
8931 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
8932 now taken as an integer constant.
8934 * Pure: ML function 'theory_of' renamed to 'theory';
8940 1. Asm_full_simp_tac is now more aggressive.
8941 1. It will sometimes reorient premises if that increases their power to
8943 2. It does no longer proceed strictly from left to right but may also
8944 rotate premises to achieve further simplification.
8945 For compatibility reasons there is now Asm_lr_simp_tac which is like the
8946 old Asm_full_simp_tac in that it does not rotate premises.
8947 2. The simplifier now knows a little bit about nat-arithmetic.
8949 * Classical reasoner: wrapper mechanism for the classical reasoner now
8950 allows for selected deletion of wrappers, by introduction of names for
8951 wrapper functionals. This implies that addbefore, addSbefore,
8952 addaltern, and addSaltern now take a pair (name, tactic) as argument,
8953 and that adding two tactics with the same name overwrites the first
8954 one (emitting a warning).
8955 type wrapper = (int -> tactic) -> (int -> tactic)
8956 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
8957 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
8958 delWrapper, delSWrapper: claset * string -> claset
8959 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
8961 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
8962 semantics; addbefore now affects only the unsafe part of step_tac
8963 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
8964 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
8967 * Classical reasoner: setwrapper to setWrapper and compwrapper to
8968 compWrapper; added safe wrapper (and access functions for it);
8970 * HOL/split_all_tac is now much faster and fails if there is nothing
8971 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
8972 and the names of the automatically generated variables have changed.
8973 split_all_tac has moved within claset() from unsafe wrappers to safe
8974 wrappers, which means that !!-bound variables are split much more
8975 aggressively, and safe_tac and clarify_tac now split such variables.
8976 If this splitting is not appropriate, use delSWrapper "split_all_tac".
8977 Note: the same holds for record_split_tac, which does the job of
8978 split_all_tac for record fields.
8980 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
8981 permanently to the default simpset using Addsplits just like
8982 Addsimps. They can be removed via Delsplits just like
8983 Delsimps. Lower-case versions are also available.
8985 * HOL/Simplifier: The rule split_if is now part of the default
8986 simpset. This means that the simplifier will eliminate all occurrences
8987 of if-then-else in the conclusion of a goal. To prevent this, you can
8988 either remove split_if completely from the default simpset by
8989 `Delsplits [split_if]' or remove it in a specific call of the
8990 simplifier using `... delsplits [split_if]'. You can also add/delete
8991 other case splitting rules to/from the default simpset: every datatype
8992 generates suitable rules `split_t_case' and `split_t_case_asm' (where
8993 t is the name of the datatype).
8995 * Classical reasoner / Simplifier combination: new force_tac (and
8996 derivatives Force_tac, force) combines rewriting and classical
8997 reasoning (and whatever other tools) similarly to auto_tac, but is
8998 aimed to solve the given subgoal completely.
9003 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
9004 and `goalw': the theory is no longer needed as an explicit argument -
9005 the current theory context is used; assumptions are no longer returned
9006 at the ML-level unless one of them starts with ==> or !!; it is
9007 recommended to convert to these new commands using isatool fixgoal
9008 (backup your sources first!);
9010 * new top-level commands 'thm' and 'thms' for retrieving theorems from
9011 the current theory context, and 'theory' to lookup stored theories;
9013 * new theory section 'locale' for declaring constants, assumptions and
9014 definitions that have local scope;
9016 * new theory section 'nonterminals' for purely syntactic types;
9018 * new theory section 'setup' for generic ML setup functions
9019 (e.g. package initialization);
9021 * the distribution now includes Isabelle icons: see
9022 lib/logo/isabelle-{small,tiny}.xpm;
9024 * isatool install - install binaries with absolute references to
9027 * isatool logo -- create instances of the Isabelle logo (as EPS);
9029 * print mode 'emacs' reserved for Isamode;
9031 * support multiple print (ast) translations per constant name;
9033 * theorems involving oracles are now printed with a suffixed [!];
9038 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
9040 * HOL/inductive package reorganized and improved: now supports mutual
9046 oddI "n : EVEN ==> Suc n : ODD"
9047 evenI "n : ODD ==> Suc n : EVEN"
9049 new theorem list "elims" contains an elimination rule for each of the
9050 recursive sets; inductive definitions now handle disjunctive premises
9051 correctly (also ZF);
9053 INCOMPATIBILITIES: requires Inductive as an ancestor; component
9054 "mutual_induct" no longer exists - the induction rule is always
9055 contained in "induct";
9058 * HOL/datatype package re-implemented and greatly improved: now
9059 supports mutually recursive datatypes such as
9062 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
9063 | SUM ('a aexp) ('a aexp)
9064 | DIFF ('a aexp) ('a aexp)
9067 'a bexp = LESS ('a aexp) ('a aexp)
9068 | AND ('a bexp) ('a bexp)
9069 | OR ('a bexp) ('a bexp)
9071 as well as indirectly recursive datatypes such as
9074 ('a, 'b) term = Var 'a
9075 | App 'b ((('a, 'b) term) list)
9077 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
9078 induction on mutually / indirectly recursive datatypes.
9080 Primrec equations are now stored in theory and can be accessed via
9081 <function_name>.simps.
9085 - Theories using datatypes must now have theory Datatype as an
9087 - The specific <typename>.induct_tac no longer exists - use the
9088 generic induct_tac instead.
9089 - natE has been renamed to nat.exhaust - use exhaust_tac
9090 instead of res_inst_tac ... natE. Note that the variable
9091 names in nat.exhaust differ from the names in natE, this
9092 may cause some "fragile" proofs to fail.
9093 - The theorems split_<typename>_case and split_<typename>_case_asm
9094 have been renamed to <typename>.split and <typename>.split_asm.
9095 - Since default sorts of type variables are now handled correctly,
9096 some datatype definitions may have to be annotated with explicit
9098 - Primrec definitions no longer require function name and type
9099 of recursive argument.
9101 Consider using isatool fixdatatype to adapt your theories and proof
9102 scripts to the new package (backup your sources first!).
9105 * HOL/record package: considerably improved implementation; now
9106 includes concrete syntax for record types, terms, updates; theorems
9107 for surjective pairing and splitting !!-bound record variables; proof
9108 support is as follows:
9110 1) standard conversions (selectors or updates applied to record
9111 constructor terms) are part of the standard simpset;
9113 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
9114 made part of standard simpset and claset via addIffs;
9116 3) a tactic for record field splitting (record_split_tac) is part of
9117 the standard claset (addSWrapper);
9119 To get a better idea about these rules you may retrieve them via
9120 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
9121 the name of your record type.
9123 The split tactic 3) conceptually simplifies by the following rule:
9125 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
9127 Thus any record variable that is bound by meta-all will automatically
9128 blow up into some record constructor term, consequently the
9129 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
9130 solve record problems automatically.
9133 * reorganized the main HOL image: HOL/Integ and String loaded by
9134 default; theory Main includes everything;
9136 * automatic simplification of integer sums and comparisons, using cancellation;
9138 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
9140 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
9142 * many new identities for unions, intersections, set difference, etc.;
9144 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
9145 called split_if, split_split, split_sum_case and split_nat_case (to go
9146 with add/delsplits);
9148 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
9149 (?x::unit) = (); this is made part of the default simpset, which COULD
9150 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
9151 'Delsimprocs [unit_eq_proc];' as last resort); also note that
9152 unit_abs_eta_conv is added in order to counter the effect of
9153 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
9156 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
9159 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9160 It and 'sym RS equals0D' are now in the default claset, giving automatic
9161 disjointness reasoning but breaking a few old proofs.
9163 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
9164 to 'converse' from 'inverse' (for compatibility with ZF and some
9167 * HOL/recdef can now declare non-recursive functions, with {} supplied as
9168 the well-founded relation;
9170 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
9171 Compl A. The "Compl" syntax remains available as input syntax for this
9174 * HOL/Update: new theory of function updates:
9175 f(a:=b) == %x. if x=a then b else f x
9176 may also be iterated as in f(a:=b,c:=d,...);
9178 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
9181 - new function list_update written xs[i:=v] that updates the i-th
9182 list position. May also be iterated as in xs[i:=a,j:=b,...].
9183 - new function `upt' written [i..j(] which generates the list
9184 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
9185 bound write [i..j], which is a shorthand for [i..j+1(].
9186 - new lexicographic orderings and corresponding wellfoundedness theorems.
9189 - removed 'pred' (predecessor) function;
9190 - generalized some theorems about n-1;
9191 - many new laws about "div" and "mod";
9192 - new laws about greatest common divisors (see theory ex/Primes);
9194 * HOL/Relation: renamed the relational operator r^-1 "converse"
9195 instead of "inverse";
9197 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
9198 of the multiset ordering;
9200 * directory HOL/Real: a construction of the reals using Dedekind cuts
9201 (not included by default);
9203 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
9205 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
9206 programs, i.e. different program variables may have different types.
9208 * calling (stac rew i) now fails if "rew" has no effect on the goal
9209 [previously, this check worked only if the rewrite rule was unconditional]
9210 Now rew can involve either definitions or equalities (either == or =).
9215 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
9216 only the theorems proved on ZF.ML;
9218 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9219 It and 'sym RS equals0D' are now in the default claset, giving automatic
9220 disjointness reasoning but breaking a few old proofs.
9222 * ZF/Update: new theory of function updates
9223 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
9224 may also be iterated as in f(a:=b,c:=d,...);
9226 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
9228 * calling (stac rew i) now fails if "rew" has no effect on the goal
9229 [previously, this check worked only if the rewrite rule was unconditional]
9230 Now rew can involve either definitions or equalities (either == or =).
9232 * case_tac provided for compatibility with HOL
9233 (like the old excluded_middle_tac, but with subgoals swapped)
9236 *** Internal programming interfaces ***
9238 * Pure: several new basic modules made available for general use, see
9239 also src/Pure/README;
9241 * improved the theory data mechanism to support encapsulation (data
9242 kind name replaced by private Object.kind, acting as authorization
9243 key); new type-safe user interface via functor TheoryDataFun; generic
9244 print_data function becomes basically useless;
9246 * removed global_names compatibility flag -- all theory declarations
9247 are qualified by default;
9249 * module Pure/Syntax now offers quote / antiquote translation
9250 functions (useful for Hoare logic etc. with implicit dependencies);
9251 see HOL/ex/Antiquote for an example use;
9253 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
9256 * new tactical CHANGED_GOAL for checking that a tactic modifies a
9259 * Display.print_goals function moved to Locale.print_goals;
9261 * standard print function for goals supports current_goals_markers
9262 variable for marking begin of proof, end of proof, start of goal; the
9263 default is ("", "", ""); setting current_goals_markers := ("<proof>",
9264 "</proof>", "<goal>") causes SGML like tagged proof state printing,
9269 New in Isabelle98 (January 1998)
9270 --------------------------------
9272 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9274 * changed lexical syntax of terms / types: dots made part of long
9275 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
9277 * simpset (and claset) reference variable replaced by functions
9278 simpset / simpset_ref;
9280 * no longer supports theory aliases (via merge) and non-trivial
9281 implicit merge of thms' signatures;
9283 * most internal names of constants changed due to qualified names;
9285 * changed Pure/Sequence interface (see Pure/seq.ML);
9288 *** General Changes ***
9290 * hierachically structured name spaces (for consts, types, axms, thms
9291 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
9292 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
9293 isatool fixdots ensures space after dots (e.g. "%x. x"); set
9294 long_names for fully qualified output names; NOTE: ML programs
9295 (special tactics, packages etc.) referring to internal names may have
9296 to be adapted to cope with fully qualified names; in case of severe
9297 backward campatibility problems try setting 'global_names' at compile
9298 time to have enrything declared within a flat name space; one may also
9299 fine tune name declarations in theories via the 'global' and 'local'
9302 * reimplemented the implicit simpset and claset using the new anytype
9303 data filed in signatures; references simpset:simpset ref etc. are
9304 replaced by functions simpset:unit->simpset and
9305 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
9306 to patch your ML files accordingly;
9308 * HTML output now includes theory graph data for display with Java
9309 applet or isatool browser; data generated automatically via isatool
9310 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
9312 * defs may now be conditional; improved rewrite_goals_tac to handle
9313 conditional equations;
9315 * defs now admits additional type arguments, using TYPE('a) syntax;
9317 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
9318 creates a new theory node; implicit merge of thms' signatures is
9319 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
9320 transfer:theory->thm->thm in (rare) cases;
9322 * improved handling of draft signatures / theories; draft thms (and
9323 ctyps, cterms) are automatically promoted to real ones;
9325 * slightly changed interfaces for oracles: admit many per theory, named
9326 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
9328 * print_goals: optional output of const types (set show_consts and
9331 * improved output of warnings (###) and errors (***);
9333 * subgoal_tac displays a warning if the new subgoal has type variables;
9335 * removed old README and Makefiles;
9337 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
9339 * removed obsolete init_pps and init_database;
9341 * deleted the obsolete tactical STATE, which was declared by
9342 fun STATE tacfun st = tacfun st st;
9344 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
9345 (which abbreviates $HOME);
9347 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
9348 use isatool fixseq to adapt your ML programs (this works for fully
9349 qualified references to the Sequence structure only!);
9351 * use_thy no longer requires writable current directory; it always
9352 reloads .ML *and* .thy file, if either one is out of date;
9355 *** Classical Reasoner ***
9357 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
9358 tactics that use classical reasoning to simplify a subgoal without
9359 splitting it into several subgoals;
9361 * Safe_tac: like safe_tac but uses the default claset;
9366 * added simplification meta rules:
9367 (asm_)(full_)simplify: simpset -> thm -> thm;
9369 * simplifier.ML no longer part of Pure -- has to be loaded by object
9372 * added prems argument to simplification procedures;
9374 * HOL, FOL, ZF: added infix function `addsplits':
9375 instead of `<simpset> setloop (split_tac <thms>)'
9376 you can simply write `<simpset> addsplits <thms>'
9381 * TYPE('a) syntax for type reflection terms;
9383 * no longer handles consts with name "" -- declare as 'syntax' instead;
9385 * pretty printer: changed order of mixfix annotation preference (again!);
9387 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
9392 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
9393 with `addloop' of the simplifier to faciliate case splitting in premises.
9395 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
9397 * HOL/Auth: new protocol proofs including some for the Internet
9400 * HOL/Map: new theory of `maps' a la VDM;
9402 * HOL/simplifier: simplification procedures nat_cancel_sums for
9403 cancelling out common nat summands from =, <, <= (in)equalities, or
9404 differences; simplification procedures nat_cancel_factor for
9405 cancelling common factor from =, <, <= (in)equalities over natural
9406 sums; nat_cancel contains both kinds of procedures, it is installed by
9407 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
9409 * HOL/simplifier: terms of the form
9410 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
9412 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
9413 and those of the form
9414 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
9416 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
9419 Each datatype `t' now comes with a theorem `split_t_case' of the form
9421 P(t_case f1 ... fn x) =
9422 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
9424 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
9427 and a theorem `split_t_case_asm' of the form
9429 P(t_case f1 ... fn x) =
9430 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
9432 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
9434 which can be added to a simpset via `addsplits'. The existing theorems
9435 expand_list_case and expand_option_case have been renamed to
9436 split_list_case and split_option_case.
9439 - `pred n' is automatically converted to `n-1'.
9440 Users are strongly encouraged not to use `pred' any longer,
9441 because it will disappear altogether at some point.
9442 - Users are strongly encouraged to write "0 < n" rather than
9443 "n ~= 0". Theorems and proof tools have been modified towards this
9447 the function "set_of_list" has been renamed "set" (and its theorems too);
9448 the function "nth" now takes its arguments in the reverse order and
9449 has acquired the infix notation "!" as in "xs!n".
9451 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
9453 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
9454 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
9456 * HOL/record: extensible records with schematic structural subtyping
9457 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
9458 still lacks various theorems and concrete record syntax;
9463 * removed "axioms" and "generated by" sections;
9465 * replaced "ops" section by extended "consts" section, which is capable of
9466 handling the continuous function space "->" directly;
9469 . proves theorems immediately and stores them in the theory,
9470 . creates hierachical name space,
9471 . now uses normal mixfix annotations (instead of cinfix...),
9472 . minor changes to some names and values (for consistency),
9473 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
9474 . separator between mutual domain defs: changed "," to "and",
9475 . improved handling of sort constraints; now they have to
9476 appear on the left-hand side of the equations only;
9478 * fixed LAM <x,y,zs>.b syntax;
9480 * added extended adm_tac to simplifier in HOLCF -- can now discharge
9481 adm (%x. P (t x)), where P is chainfinite and t continuous;
9486 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
9487 with `addloop' of the simplifier to faciliate case splitting in premises.
9489 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
9490 in HOL, they strip ALL and --> from proved theorems;
9494 New in Isabelle94-8 (May 1997)
9495 ------------------------------
9497 *** General Changes ***
9499 * new utilities to build / run / maintain Isabelle etc. (in parts
9500 still somewhat experimental); old Makefiles etc. still functional;
9502 * new 'Isabelle System Manual';
9504 * INSTALL text, together with ./configure and ./build scripts;
9506 * reimplemented type inference for greater efficiency, better error
9507 messages and clean internal interface;
9509 * prlim command for dealing with lots of subgoals (an easier way of
9510 setting goals_limit);
9515 * supports alternative (named) syntax tables (parser and pretty
9516 printer); internal interface is provided by add_modesyntax(_i);
9518 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
9519 be used in conjunction with the Isabelle symbol font; uses the
9520 "symbols" syntax table;
9522 * added token_translation interface (may translate name tokens in
9523 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
9524 the current print_mode); IMPORTANT: user print translation functions
9525 are responsible for marking newly introduced bounds
9526 (Syntax.mark_boundT);
9528 * token translations for modes "xterm" and "xterm_color" that display
9529 names in bold, underline etc. or colors (which requires a color
9532 * infixes may now be declared with names independent of their syntax;
9534 * added typed_print_translation (like print_translation, but may
9535 access type of constant);
9538 *** Classical Reasoner ***
9540 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
9541 some limitations. Blast_tac...
9542 + ignores addss, addbefore, addafter; this restriction is intrinsic
9543 + ignores elimination rules that don't have the correct format
9544 (the conclusion MUST be a formula variable)
9545 + ignores types, which can make HOL proofs fail
9546 + rules must not require higher-order unification, e.g. apply_type in ZF
9547 [message "Function Var's argument not a bound variable" relates to this]
9548 + its proof strategy is more general but can actually be slower
9550 * substitution with equality assumptions no longer permutes other
9553 * minor changes in semantics of addafter (now called addaltern); renamed
9554 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
9555 (and access functions for it);
9557 * improved combination of classical reasoner and simplifier:
9558 + functions for handling clasimpsets
9559 + improvement of addss: now the simplifier is called _after_ the
9561 + safe variant of addss called addSss: uses safe simplifications
9562 _during_ the safe steps. It is more complete as it allows multiple
9563 instantiations of unknowns (e.g. with slow_tac).
9567 * added interface for simplification procedures (functions that
9568 produce *proven* rewrite rules on the fly, depending on current
9571 * ordering on terms as parameter (used for ordered rewriting);
9573 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
9575 * the solver is now split into a safe and an unsafe part.
9576 This should be invisible for the normal user, except that the
9577 functions setsolver and addsolver have been renamed to setSolver and
9578 addSolver; added safe_asm_full_simp_tac;
9583 * a generic induction tactic `induct_tac' which works for all datatypes and
9584 also for type `nat';
9586 * a generic case distinction tactic `exhaust_tac' which works for all
9587 datatypes and also for type `nat';
9589 * each datatype comes with a function `size';
9591 * patterns in case expressions allow tuple patterns as arguments to
9592 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
9594 * primrec now also works with type nat;
9596 * recdef: a new declaration form, allows general recursive functions to be
9597 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
9599 * the constant for negation has been renamed from "not" to "Not" to
9600 harmonize with FOL, ZF, LK, etc.;
9602 * HOL/ex/LFilter theory of a corecursive "filter" functional for
9605 * HOL/Modelcheck demonstrates invocation of model checker oracle;
9607 * HOL/ex/Ring.thy declares cring_simp, which solves equational
9608 problems in commutative rings, using axiomatic type classes for + and *;
9610 * more examples in HOL/MiniML and HOL/Auth;
9612 * more default rewrite rules for quantifiers, union/intersection;
9614 * a new constant `arbitrary == @x.False';
9616 * HOLCF/IOA replaces old HOL/IOA;
9618 * HOLCF changes: derived all rules and arities
9619 + axiomatic type classes instead of classes
9620 + typedef instead of faking type definitions
9621 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
9622 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
9623 + eliminated the types void, one, tr
9624 + use unit lift and bool lift (with translations) instead of one and tr
9625 + eliminated blift from Lift3.thy (use Def instead of blift)
9626 all eliminated rules are derived as theorems --> no visible changes ;
9631 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
9632 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
9633 as ZF_cs addSIs [equalityI];
9637 New in Isabelle94-7 (November 96)
9638 ---------------------------------
9640 * allowing negative levels (as offsets) in prlev and choplev;
9642 * super-linear speedup for large simplifications;
9644 * FOL, ZF and HOL now use miniscoping: rewriting pushes
9645 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
9646 FAIL); can suppress it using the command Delsimps (ex_simps @
9647 all_simps); De Morgan laws are also now included, by default;
9649 * improved printing of ==> : ~:
9651 * new object-logic "Sequents" adds linear logic, while replacing LK
9652 and Modal (thanks to Sara Kalvala);
9654 * HOL/Auth: correctness proofs for authentication protocols;
9656 * HOL: new auto_tac combines rewriting and classical reasoning (many
9657 examples on HOL/Auth);
9659 * HOL: new command AddIffs for declaring theorems of the form P=Q to
9660 the rewriter and classical reasoner simultaneously;
9662 * function uresult no longer returns theorems in "standard" format;
9663 regain previous version by: val uresult = standard o uresult;
9670 * oracles -- these establish an interface between Isabelle and trusted
9671 external reasoners, which may deliver results as theorems;
9673 * proof objects (in particular record all uses of oracles);
9675 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
9677 * "constdefs" section in theory files;
9679 * "primrec" section (HOL) no longer requires names;
9681 * internal type "tactic" now simply "thm -> thm Sequence.seq";
9688 * reduced space requirements;
9690 * automatic HTML generation from theories;
9692 * theory files no longer require "..." (quotes) around most types;
9694 * new examples, including two proofs of the Church-Rosser theorem;
9696 * non-curried (1994) version of HOL is no longer distributed;
9703 * greatly reduced space requirements;
9705 * theory files (.thy) no longer require \...\ escapes at line breaks;
9707 * searchable theorem database (see the section "Retrieving theorems" on
9708 page 8 of the Reference Manual);
9710 * new examples, including Grabczewski's monumental case study of the
9713 * The previous version of HOL renamed to Old_HOL;
9715 * The new version of HOL (previously called CHOL) uses a curried syntax
9716 for functions. Application looks like f a b instead of f(a,b);
9718 * Mutually recursive inductive definitions finally work in HOL;
9720 * In ZF, pattern-matching on tuples is now available in all abstractions and
9721 translates to the operator "split";
9728 * new infix operator, addss, allowing the classical reasoner to
9729 perform simplification at each step of its search. Example:
9730 fast_tac (cs addss ss)
9732 * a new logic, CHOL, the same as HOL, but with a curried syntax
9733 for functions. Application looks like f a b instead of f(a,b). Also pairs
9734 look like (a,b) instead of <a,b>;
9736 * PLEASE NOTE: CHOL will eventually replace HOL!
9738 * In CHOL, pattern-matching on tuples is now available in all abstractions.
9739 It translates to the operator "split". A new theory of integers is available;
9741 * In ZF, integer numerals now denote two's-complement binary integers.
9742 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
9744 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
9745 of the Axiom of Choice;
9752 * Significantly faster resolution;
9754 * the different sections in a .thy file can now be mixed and repeated
9757 * Database of theorems for FOL, HOL and ZF. New
9758 commands including qed, qed_goal and bind_thm store theorems in the database.
9760 * Simple database queries: return a named theorem (get_thm) or all theorems of
9761 a given theory (thms_of), or find out what theory a theorem was proved in
9764 * Bugs fixed in the inductive definition and datatype packages;
9766 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
9767 and HOL_dup_cs obsolete;
9769 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
9772 * Simpler definition of function space in ZF;
9774 * new results about cardinal and ordinal arithmetic in ZF;
9776 * 'subtype' facility in HOL for introducing new types as subsets of existing
9779 :mode=text:wrap=hard:maxLineLen=72: