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.
12 * Updated and extended "isar-ref" manual, reduced remaining material
18 * Command "export_code": relative file names are interpreted
19 relatively to master directory of current theory rather than
20 the rather arbitrary current working directory.
23 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
24 use regular rule composition via "OF" / "THEN", or explicit proof
25 structure instead. Note that Isabelle/ML provides a variety of
26 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
27 with some care where this is really required.
32 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
37 - added an optimisation for equality premises.
38 It is switched on by default, and can be switched off by setting
39 the configuration quickcheck_optimise_equality to false.
41 * The SMT solver Z3 has now by default a restricted set of directly
42 supported features. For the full set of features (div/mod, nonlinear
43 arithmetic, datatypes/records) with potential proof reconstruction
44 failures, enable the configuration option "z3_with_extensions".
45 Minor INCOMPATIBILITY.
49 - Added MaSh relevance filter based on machine-learning; see the
50 Sledgehammer manual for details.
51 - Rationalized type encodings ("type_enc" option).
53 max_relevant ~> max_facts
54 relevance_thresholds ~> fact_thresholds
57 *** Document preparation ***
59 * Default for \<euro> is now based on eurosym package, instead of
60 slightly exotic babel/greek.
65 * Discontinued support for Poly/ML 5.2.1, which was the last version
66 without exception positions and advanced ML compiler/toplevel
71 New in Isabelle2012 (May 2012)
72 ------------------------------
76 * Prover IDE (PIDE) improvements:
78 - more robust Sledgehammer integration (as before the sledgehammer
79 command-line needs to be typed into the source buffer)
80 - markup for bound variables
81 - markup for types of term variables (displayed as tooltips)
82 - support for user-defined Isar commands within the running session
83 - improved support for Unicode outside original 16bit range
84 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
86 * Forward declaration of outer syntax keywords within the theory
87 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
88 commands to be used in the same theory where defined.
90 * Auxiliary contexts indicate block structure for specifications with
91 additional parameters and assumptions. Such unnamed contexts may be
92 nested within other targets, like 'theory', 'locale', 'class',
93 'instantiation' etc. Results from the local context are generalized
94 accordingly and applied to the enclosing target context. Example:
98 assumes xy: "x = y" and yz: "y = z"
101 lemma my_trans: "x = z" using xy yz by simp
107 The most basic application is to factor-out context elements of
108 several fixes/assumes/shows theorem statements, e.g. see
109 ~~/src/HOL/Isar_Examples/Group_Context.thy
111 Any other local theory specification element works within the "context
112 ... begin ... end" block as well.
114 * Bundled declarations associate attributed fact expressions with a
115 given name in the context. These may be later included in other
116 contexts. This allows to manage context extensions casually, without
117 the logical dependencies of locales and locale interpretation. See
118 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
120 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
121 declaration, and results are standardized before being stored. Thus
122 old-style "standard" after instantiation or composition of facts
123 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
124 indices of schematic variables.
126 * Rule attributes in local theory declarations (e.g. locale or class)
127 are now statically evaluated: the resulting theorem is stored instead
128 of the original expression. INCOMPATIBILITY in rare situations, where
129 the historic accident of dynamic re-evaluation in interpretations
132 * New tutorial "Programming and Proving in Isabelle/HOL"
133 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
134 Structured Isar Proofs" ("isar-overview"), which has been removed. It
135 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
136 Logic" as the recommended beginners tutorial, but does not cover all
137 of the material of that old tutorial.
139 * Updated and extended reference manuals: "isar-ref",
140 "implementation", "system"; reduced remaining material in old "ref"
146 * Command 'definition' no longer exports the foundational "raw_def"
147 into the user context. Minor INCOMPATIBILITY, may use the regular
148 "def" result with attribute "abs_def" to imitate the old version.
150 * Attribute "abs_def" turns an equation of the form "f x y == t" into
151 "f == %x y. t", which ensures that "simp" or "unfold" steps always
152 expand it. This also works for object-logic equality. (Formerly
153 undocumented feature.)
155 * Sort constraints are now propagated in simultaneous statements, just
156 like type constraints. INCOMPATIBILITY in rare situations, where
157 distinct sorts used to be assigned accidentally. For example:
159 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
161 lemma "P (x::'a)" and "Q (y::'a::bar)"
162 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
164 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
165 tolerant against multiple unifiers, as long as the final result is
166 unique. (As before, rules are composed in canonical right-to-left
167 order to accommodate newly introduced premises.)
169 * Renamed some inner syntax categories:
175 Minor INCOMPATIBILITY. Note that in practice "num_const" or
176 "num_position" etc. are mainly used instead (which also include
177 position information via constraints).
179 * Simplified configuration options for syntax ambiguity: see
180 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
181 manual. Minor INCOMPATIBILITY.
183 * Discontinued configuration option "syntax_positions": atomic terms
184 in parse trees are always annotated by position constraints.
186 * Old code generator for SML and its commands 'code_module',
187 'code_library', 'consts_code', 'types_code' have been discontinued.
188 Use commands of the generic code generator instead. INCOMPATIBILITY.
190 * Redundant attribute "code_inline" has been discontinued. Use
191 "code_unfold" instead. INCOMPATIBILITY.
193 * Dropped attribute "code_unfold_post" in favor of the its dual
194 "code_abbrev", which yields a common pattern in definitions like
196 definition [code_abbrev]: "f = t"
200 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
201 instead. INCOMPATIBILITY.
203 * Discontinued old "prems" fact, which used to refer to the accidental
204 collection of foundational premises in the context (already marked as
205 legacy since Isabelle2011).
210 * Type 'a set is now a proper type constructor (just as before
211 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
212 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
213 sets separate, it is often sufficient to rephrase some set S that has
214 been accidentally used as predicates by "%x. x : S", and some
215 predicate P that has been accidentally used as set by "{x. P x}".
216 Corresponding proofs in a first step should be pruned from any
217 tinkering with former theorems mem_def and Collect_def as far as
220 For developments which deliberately mix predicates and sets, a
221 planning step is necessary to determine what should become a predicate
222 and what a set. It can be helpful to carry out that step in
223 Isabelle2011-1 before jumping right into the current release.
225 * Code generation by default implements sets as container type rather
226 than predicates. INCOMPATIBILITY.
228 * New type synonym 'a rel = ('a * 'a) set
230 * The representation of numerals has changed. Datatype "num"
231 represents strictly positive binary numerals, along with functions
232 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
233 positive and negated numeric literals, respectively. See also
234 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
235 user theories may require adaptations as follows:
237 - Theorems with number_ring or number_semiring constraints: These
238 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
240 - Theories defining numeric types: Remove number, number_semiring,
241 and number_ring instances. Defer all theorems about numerals until
242 after classes one and semigroup_add have been instantiated.
244 - Numeral-only simp rules: Replace each rule having a "number_of v"
245 pattern with two copies, one for numeral and one for neg_numeral.
247 - Theorems about subclasses of semiring_1 or ring_1: These classes
248 automatically support numerals now, so more simp rules and
249 simprocs may now apply within the proof.
251 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
252 Redefine using other integer operations.
254 * Transfer: New package intended to generalize the existing
255 "descending" method and related theorem attributes from the Quotient
256 package. (Not all functionality is implemented yet, but future
257 development will focus on Transfer as an eventual replacement for the
258 corresponding parts of the Quotient package.)
260 - transfer_rule attribute: Maintains a collection of transfer rules,
261 which relate constants at two different types. Transfer rules may
262 relate different type instances of the same polymorphic constant,
263 or they may relate an operation on a raw type to a corresponding
264 operation on an abstract type (quotient or subtype). For example:
266 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
267 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
269 - transfer method: Replaces a subgoal on abstract types with an
270 equivalent subgoal on the corresponding raw types. Constants are
271 replaced with corresponding ones according to the transfer rules.
272 Goals are generalized over all free variables by default; this is
273 necessary for variables whose types change, but can be overridden
274 for specific variables with e.g. "transfer fixing: x y z". The
275 variant transfer' method allows replacing a subgoal with one that
276 is logically stronger (rather than equivalent).
278 - relator_eq attribute: Collects identity laws for relators of
279 various type constructors, e.g. "list_all2 (op =) = (op =)". The
280 transfer method uses these lemmas to infer transfer rules for
281 non-polymorphic constants on the fly.
283 - transfer_prover method: Assists with proving a transfer rule for a
284 new constant, provided the constant is defined in terms of other
285 constants that already have transfer rules. It should be applied
286 after unfolding the constant definitions.
288 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
289 from type nat to type int.
291 * Lifting: New package intended to generalize the quotient_definition
292 facility of the Quotient package; designed to work with Transfer.
294 - lift_definition command: Defines operations on an abstract type in
295 terms of a corresponding operation on a representation
296 type. Example syntax:
298 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
301 Users must discharge a respectfulness proof obligation when each
302 constant is defined. (For a type copy, i.e. a typedef with UNIV,
303 the proof is discharged automatically.) The obligation is
304 presented in a user-friendly, readable form; a respectfulness
305 theorem in the standard format and a transfer rule are generated
308 - Integration with code_abstype: For typedefs (e.g. subtypes
309 corresponding to a datatype invariant, such as dlist),
310 lift_definition generates a code certificate theorem and sets up
311 code generation for each constant.
313 - setup_lifting command: Sets up the Lifting package to work with a
314 user-defined type. The user must provide either a quotient theorem
315 or a type_definition theorem. The package configures transfer
316 rules for equality and quantifiers on the type, and sets up the
317 lift_definition command to work with the type.
319 - Usage examples: See Quotient_Examples/Lift_DList.thy,
320 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
321 Word/Word.thy and Library/Float.thy.
325 - The 'quotient_type' command now supports a 'morphisms' option with
326 rep and abs functions, similar to typedef.
328 - 'quotient_type' sets up new types to work with the Lifting and
329 Transfer packages, as with 'setup_lifting'.
331 - The 'quotient_definition' command now requires the user to prove a
332 respectfulness property at the point where the constant is
333 defined, similar to lift_definition; INCOMPATIBILITY.
335 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
336 accordingly, INCOMPATIBILITY.
338 * New diagnostic command 'find_unused_assms' to find potentially
339 superfluous assumptions in theorems using Quickcheck.
343 - Quickcheck returns variable assignments as counterexamples, which
344 allows to reveal the underspecification of functions under test.
345 For example, refuting "hd xs = x", it presents the variable
346 assignment xs = [] and x = a1 as a counterexample, assuming that
347 any property is false whenever "hd []" occurs in it.
349 These counterexample are marked as potentially spurious, as
350 Quickcheck also returns "xs = []" as a counterexample to the
351 obvious theorem "hd xs = hd xs".
353 After finding a potentially spurious counterexample, Quickcheck
354 continues searching for genuine ones.
356 By default, Quickcheck shows potentially spurious and genuine
357 counterexamples. The option "genuine_only" sets quickcheck to only
358 show genuine counterexamples.
360 - The command 'quickcheck_generator' creates random and exhaustive
361 value generators for a given type and operations.
363 It generates values by using the operations as if they were
364 constructors of that type.
366 - Support for multisets.
368 - Added "use_subtype" options.
370 - Added "quickcheck_locale" configuration to specify how to process
371 conjectures in a locale context.
373 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
374 and affecting 'rat' and 'real'.
377 - Integrated more tightly with SPASS, as described in the ITP 2012
378 paper "More SPASS with Isabelle".
379 - Made it try "smt" as a fallback if "metis" fails or times out.
380 - Added support for the following provers: Alt-Ergo (via Why3 and
381 TFF1), iProver, iProver-Eq.
382 - Sped up the minimizer.
383 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
384 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
385 - Renamed "sound" option to "strict".
387 * Metis: Added possibility to specify lambda translations scheme as a
388 parenthesized argument (e.g., "by (metis (lifting) ...)").
390 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
392 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
394 * New "case_product" attribute to generate a case rule doing multiple
395 case distinctions at the same time. E.g.
397 list.exhaust [case_product nat.exhaust]
399 produces a rule which can be used to perform case distinction on both
402 * New "eventually_elim" method as a generalized variant of the
403 eventually_elim* rules. Supports structured proofs.
405 * Typedef with implicit set definition is considered legacy. Use
406 "typedef (open)" form instead, which will eventually become the
409 * Record: code generation can be switched off manually with
411 declare [[record_coden = false]] -- "default true"
413 * Datatype: type parameters allow explicit sort constraints.
415 * Concrete syntax for case expressions includes constraints for source
416 positions, and thus produces Prover IDE markup for its bindings.
417 INCOMPATIBILITY for old-style syntax translations that augment the
418 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
421 * Clarified attribute "mono_set": pure declaration without modifying
422 the result of the fact expression.
424 * More default pred/set conversions on a couple of relation operations
425 and predicates. Added powers of predicate relations. Consolidation
426 of some relation theorems:
428 converse_def ~> converse_unfold
429 rel_comp_def ~> relcomp_unfold
430 symp_def ~> (modified, use symp_def and sym_def instead)
431 transp_def ~> transp_trans
432 Domain_def ~> Domain_unfold
433 Range_def ~> Domain_converse [symmetric]
435 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
437 See theory "Relation" for examples for making use of pred/set
438 conversions by means of attributes "to_set" and "to_pred".
442 * Renamed facts about the power operation on relations, i.e., relpow
443 to match the constant's name:
445 rel_pow_1 ~> relpow_1
446 rel_pow_0_I ~> relpow_0_I
447 rel_pow_Suc_I ~> relpow_Suc_I
448 rel_pow_Suc_I2 ~> relpow_Suc_I2
449 rel_pow_0_E ~> relpow_0_E
450 rel_pow_Suc_E ~> relpow_Suc_E
451 rel_pow_E ~> relpow_E
452 rel_pow_Suc_D2 ~> relpow_Suc_D2
453 rel_pow_Suc_E2 ~> relpow_Suc_E2
454 rel_pow_Suc_D2' ~> relpow_Suc_D2'
455 rel_pow_E2 ~> relpow_E2
456 rel_pow_add ~> relpow_add
457 rel_pow_commute ~> relpow
458 rel_pow_empty ~> relpow_empty:
459 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
460 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
461 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
462 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
463 rel_pow_fun_conv ~> relpow_fun_conv
464 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
465 rel_pow_finite_bounded ~> relpow_finite_bounded
466 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
467 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
468 single_valued_rel_pow ~> single_valued_relpow
472 * Theory Relation: Consolidated constant name for relation composition
473 and corresponding theorem names:
475 - Renamed constant rel_comp to relcomp.
477 - Dropped abbreviation pred_comp. Use relcompp instead.
481 rel_compI ~> relcompI
482 rel_compEpair ~> relcompEpair
483 rel_compE ~> relcompE
484 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
485 rel_comp_empty1 ~> relcomp_empty1
486 rel_comp_mono ~> relcomp_mono
487 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
488 rel_comp_distrib ~> relcomp_distrib
489 rel_comp_distrib2 ~> relcomp_distrib2
490 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
491 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
492 single_valued_rel_comp ~> single_valued_relcomp
493 rel_comp_def ~> relcomp_unfold
494 converse_rel_comp ~> converse_relcomp
495 pred_compI ~> relcomppI
496 pred_compE ~> relcomppE
497 pred_comp_bot1 ~> relcompp_bot1
498 pred_comp_bot2 ~> relcompp_bot2
499 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
500 pred_comp_mono ~> relcompp_mono
501 pred_comp_distrib ~> relcompp_distrib
502 pred_comp_distrib2 ~> relcompp_distrib2
503 converse_pred_comp ~> converse_relcompp
505 finite_rel_comp ~> finite_relcomp
507 set_rel_comp ~> set_relcomp
511 * Theory Divides: Discontinued redundant theorems about div and mod.
512 INCOMPATIBILITY, use the corresponding generic theorems instead.
514 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
515 zdiv_self ~> div_self
516 zmod_self ~> mod_self
519 zdiv_zmod_equality ~> div_mod_equality2
520 zdiv_zmod_equality2 ~> div_mod_equality
521 zmod_zdiv_trivial ~> mod_div_trivial
522 zdiv_zminus_zminus ~> div_minus_minus
523 zmod_zminus_zminus ~> mod_minus_minus
524 zdiv_zminus2 ~> div_minus_right
525 zmod_zminus2 ~> mod_minus_right
526 zdiv_minus1_right ~> div_minus1_right
527 zmod_minus1_right ~> mod_minus1_right
528 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
529 zmod_zmult1_eq ~> mod_mult_right_eq
530 zpower_zmod ~> power_mod
532 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
533 mod_mult_distrib ~> mult_mod_left
534 mod_mult_distrib2 ~> mult_mod_right
536 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
537 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
539 * Finite_Set.fold now qualified. INCOMPATIBILITY.
541 * Consolidated theorem names concerning fold combinators:
543 inf_INFI_fold_inf ~> inf_INF_fold_inf
544 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
545 INFI_fold_inf ~> INF_fold_inf
546 SUPR_fold_sup ~> SUP_fold_sup
547 union_set ~> union_set_fold
548 minus_set ~> minus_set_fold
549 INFI_set_fold ~> INF_set_fold
550 SUPR_set_fold ~> SUP_set_fold
551 INF_code ~> INF_set_foldr
552 SUP_code ~> SUP_set_foldr
553 foldr.simps ~> foldr.simps (in point-free formulation)
554 foldr_fold_rev ~> foldr_conv_fold
555 foldl_fold ~> foldl_conv_fold
556 foldr_foldr ~> foldr_conv_foldl
557 foldl_foldr ~> foldl_conv_foldr
558 fold_set_remdups ~> fold_set_fold_remdups
559 fold_set ~> fold_set_fold
560 fold1_set ~> fold1_set_fold
564 * Dropped rarely useful theorems concerning fold combinators:
565 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
566 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
567 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
568 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
569 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
570 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
571 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
572 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
573 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
574 unfolding "foldr_conv_fold" and "foldl_conv_fold".
576 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
577 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
578 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
579 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
580 lemmas over fold rather than foldr, or make use of lemmas
581 fold_conv_foldr and fold_rev.
583 * Congruence rules Option.map_cong and Option.bind_cong for recursion
584 through option types.
586 * "Transitive_Closure.ntrancl": bounded transitive closure on
589 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
591 * Theory Int: Discontinued many legacy theorems specific to type int.
592 INCOMPATIBILITY, use the corresponding generic theorems instead.
594 zminus_zminus ~> minus_minus
595 zminus_0 ~> minus_zero
596 zminus_zadd_distrib ~> minus_add_distrib
597 zadd_commute ~> add_commute
598 zadd_assoc ~> add_assoc
599 zadd_left_commute ~> add_left_commute
603 zadd_0_right ~> add_0_right
604 zadd_zminus_inverse2 ~> left_minus
605 zmult_zminus ~> mult_minus_left
606 zmult_commute ~> mult_commute
607 zmult_assoc ~> mult_assoc
608 zadd_zmult_distrib ~> left_distrib
609 zadd_zmult_distrib2 ~> right_distrib
610 zdiff_zmult_distrib ~> left_diff_distrib
611 zdiff_zmult_distrib2 ~> right_diff_distrib
612 zmult_1 ~> mult_1_left
613 zmult_1_right ~> mult_1_right
614 zle_refl ~> order_refl
615 zle_trans ~> order_trans
616 zle_antisym ~> order_antisym
617 zle_linear ~> linorder_linear
618 zless_linear ~> linorder_less_linear
619 zadd_left_mono ~> add_left_mono
620 zadd_strict_right_mono ~> add_strict_right_mono
621 zadd_zless_mono ~> add_less_le_mono
622 int_0_less_1 ~> zero_less_one
623 int_0_neq_1 ~> zero_neq_one
625 zpower_zadd_distrib ~> power_add
626 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
627 zero_le_zpower_abs ~> zero_le_power_abs
629 * Theory Deriv: Renamed
631 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
633 * Theory Library/Multiset: Improved code generation of multisets.
635 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
636 are expressed via type classes again. The special syntax
637 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
638 setsum_set, which is now subsumed by Big_Operators.setsum.
641 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
642 use theory HOL/Library/Nat_Bijection instead.
644 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
645 trees is now inside a type class context. Names of affected
646 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
647 theories working directly with raw red-black trees, adapt the names as
651 bulkload -> rbt_bulkload
652 del_from_left -> rbt_del_from_left
653 del_from_right -> rbt_del_from_right
658 insertw -> rbt_insert_with
659 insert_with_key -> rbt_insert_with_key
660 map_entry -> rbt_map_entry
663 tree_greater -> rbt_greater
664 tree_less -> rbt_less
665 tree_less_symbol -> rbt_less_symbol
667 union_with -> rbt_union_with
668 union_with_key -> rbt_union_with_key
671 balance_left_sorted -> balance_left_rbt_sorted
672 balance_left_tree_greater -> balance_left_rbt_greater
673 balance_left_tree_less -> balance_left_rbt_less
674 balance_right_sorted -> balance_right_rbt_sorted
675 balance_right_tree_greater -> balance_right_rbt_greater
676 balance_right_tree_less -> balance_right_rbt_less
677 balance_sorted -> balance_rbt_sorted
678 balance_tree_greater -> balance_rbt_greater
679 balance_tree_less -> balance_rbt_less
680 bulkload_is_rbt -> rbt_bulkload_is_rbt
681 combine_sorted -> combine_rbt_sorted
682 combine_tree_greater -> combine_rbt_greater
683 combine_tree_less -> combine_rbt_less
684 delete_in_tree -> rbt_delete_in_tree
685 delete_is_rbt -> rbt_delete_is_rbt
686 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
687 del_from_left_tree_less -> rbt_del_from_left_rbt_less
688 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
689 del_from_right_tree_less -> rbt_del_from_right_rbt_less
690 del_in_tree -> rbt_del_in_tree
691 del_inv1_inv2 -> rbt_del_inv1_inv2
692 del_sorted -> rbt_del_rbt_sorted
693 del_tree_greater -> rbt_del_rbt_greater
694 del_tree_less -> rbt_del_rbt_less
695 dom_lookup_Branch -> dom_rbt_lookup_Branch
696 entries_lookup -> entries_rbt_lookup
697 finite_dom_lookup -> finite_dom_rbt_lookup
698 insert_sorted -> rbt_insert_rbt_sorted
699 insertw_is_rbt -> rbt_insertw_is_rbt
700 insertwk_is_rbt -> rbt_insertwk_is_rbt
701 insertwk_sorted -> rbt_insertwk_rbt_sorted
702 insertw_sorted -> rbt_insertw_rbt_sorted
703 ins_sorted -> ins_rbt_sorted
704 ins_tree_greater -> ins_rbt_greater
705 ins_tree_less -> ins_rbt_less
706 is_rbt_sorted -> is_rbt_rbt_sorted
707 lookup_balance -> rbt_lookup_balance
708 lookup_bulkload -> rbt_lookup_rbt_bulkload
709 lookup_delete -> rbt_lookup_rbt_delete
710 lookup_Empty -> rbt_lookup_Empty
711 lookup_from_in_tree -> rbt_lookup_from_in_tree
712 lookup_in_tree -> rbt_lookup_in_tree
713 lookup_ins -> rbt_lookup_ins
714 lookup_insert -> rbt_lookup_rbt_insert
715 lookup_insertw -> rbt_lookup_rbt_insertw
716 lookup_insertwk -> rbt_lookup_rbt_insertwk
717 lookup_keys -> rbt_lookup_keys
718 lookup_map -> rbt_lookup_map
719 lookup_map_entry -> rbt_lookup_rbt_map_entry
720 lookup_tree_greater -> rbt_lookup_rbt_greater
721 lookup_tree_less -> rbt_lookup_rbt_less
722 lookup_union -> rbt_lookup_rbt_union
723 map_entry_color_of -> rbt_map_entry_color_of
724 map_entry_inv1 -> rbt_map_entry_inv1
725 map_entry_inv2 -> rbt_map_entry_inv2
726 map_entry_is_rbt -> rbt_map_entry_is_rbt
727 map_entry_sorted -> rbt_map_entry_rbt_sorted
728 map_entry_tree_greater -> rbt_map_entry_rbt_greater
729 map_entry_tree_less -> rbt_map_entry_rbt_less
730 map_tree_greater -> map_rbt_greater
731 map_tree_less -> map_rbt_less
732 map_sorted -> map_rbt_sorted
733 paint_sorted -> paint_rbt_sorted
734 paint_lookup -> paint_rbt_lookup
735 paint_tree_greater -> paint_rbt_greater
736 paint_tree_less -> paint_rbt_less
737 sorted_entries -> rbt_sorted_entries
738 tree_greater_eq_trans -> rbt_greater_eq_trans
739 tree_greater_nit -> rbt_greater_nit
740 tree_greater_prop -> rbt_greater_prop
741 tree_greater_simps -> rbt_greater_simps
742 tree_greater_trans -> rbt_greater_trans
743 tree_less_eq_trans -> rbt_less_eq_trans
744 tree_less_nit -> rbt_less_nit
745 tree_less_prop -> rbt_less_prop
746 tree_less_simps -> rbt_less_simps
747 tree_less_trans -> rbt_less_trans
748 tree_ord_props -> rbt_ord_props
749 union_Branch -> rbt_union_Branch
750 union_is_rbt -> rbt_union_is_rbt
751 unionw_is_rbt -> rbt_unionw_is_rbt
752 unionwk_is_rbt -> rbt_unionwk_is_rbt
753 unionwk_sorted -> rbt_unionwk_rbt_sorted
755 * Theory HOL/Library/Float: Floating point numbers are now defined as
756 a subset of the real numbers. All operations are defined using the
757 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
764 round_down -> float_round_down
765 round_up -> float_round_up
769 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
772 abs_float_def -> Float.compute_float_abs
773 bitlen_ge0 -> bitlen_nonneg
774 bitlen.simps -> Float.compute_bitlen
775 float_components -> Float_mantissa_exponent
776 float_divl.simps -> Float.compute_float_divl
777 float_divr.simps -> Float.compute_float_divr
778 float_eq_odd -> mult_powr_eq_mult_powr_iff
779 float_power -> real_of_float_power
780 lapprox_posrat_def -> Float.compute_lapprox_posrat
781 lapprox_rat.simps -> Float.compute_lapprox_rat
782 le_float_def' -> Float.compute_float_le
783 le_float_def -> less_eq_float.rep_eq
784 less_float_def' -> Float.compute_float_less
785 less_float_def -> less_float.rep_eq
786 normfloat_def -> Float.compute_normfloat
787 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
788 normfloat -> normfloat_def
789 normfloat_unique -> use normfloat_def
790 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
791 one_float_def -> Float.compute_float_one
792 plus_float_def -> Float.compute_float_plus
793 rapprox_posrat_def -> Float.compute_rapprox_posrat
794 rapprox_rat.simps -> Float.compute_rapprox_rat
795 real_of_float_0 -> zero_float.rep_eq
796 real_of_float_1 -> one_float.rep_eq
797 real_of_float_abs -> abs_float.rep_eq
798 real_of_float_add -> plus_float.rep_eq
799 real_of_float_minus -> uminus_float.rep_eq
800 real_of_float_mult -> times_float.rep_eq
801 real_of_float_simp -> Float.rep_eq
802 real_of_float_sub -> minus_float.rep_eq
803 round_down.simps -> Float.compute_float_round_down
804 round_up.simps -> Float.compute_float_round_up
805 times_float_def -> Float.compute_float_times
806 uminus_float_def -> Float.compute_float_uminus
807 zero_float_def -> Float.compute_float_zero
809 Lemmas not necessary anymore, use the transfer method:
810 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
811 float_divr, float_le_simp, float_less1_mantissa_bound,
812 float_less_simp, float_less_zero, float_le_zero,
813 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
814 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
815 lapprox_rat_bottom, normalized_float, rapprox_posrat,
816 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
817 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
818 round_up, zero_le_float, zero_less_float
820 * New theory HOL/Library/DAList provides an abstract type for
821 association lists with distinct keys.
823 * Session HOL/IMP: Added new theory of abstract interpretation of
826 * Session HOL-Import: Re-implementation from scratch is faster,
827 simpler, and more scalable. Requires a proof bundle, which is
828 available as an external component. Discontinued old (and mostly
829 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
831 * Session HOL-Word: Discontinued many redundant theorems specific to
832 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
835 word_sub_alt ~> word_sub_wi
836 word_add_alt ~> word_add_def
837 word_mult_alt ~> word_mult_def
838 word_minus_alt ~> word_minus_def
839 word_0_alt ~> word_0_wi
840 word_1_alt ~> word_1_wi
841 word_add_0 ~> add_0_left
842 word_add_0_right ~> add_0_right
843 word_mult_1 ~> mult_1_left
844 word_mult_1_right ~> mult_1_right
845 word_add_commute ~> add_commute
846 word_add_assoc ~> add_assoc
847 word_add_left_commute ~> add_left_commute
848 word_mult_commute ~> mult_commute
849 word_mult_assoc ~> mult_assoc
850 word_mult_left_commute ~> mult_left_commute
851 word_left_distrib ~> left_distrib
852 word_right_distrib ~> right_distrib
853 word_left_minus ~> left_minus
854 word_diff_0_right ~> diff_0_right
855 word_diff_self ~> diff_self
856 word_sub_def ~> diff_minus
857 word_diff_minus ~> diff_minus
858 word_add_ac ~> add_ac
859 word_mult_ac ~> mult_ac
860 word_plus_ac0 ~> add_0_left add_0_right add_ac
861 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
862 word_order_trans ~> order_trans
863 word_order_refl ~> order_refl
864 word_order_antisym ~> order_antisym
865 word_order_linear ~> linorder_linear
866 lenw1_zero_neq_one ~> zero_neq_one
867 word_number_of_eq ~> number_of_eq
868 word_of_int_add_hom ~> wi_hom_add
869 word_of_int_sub_hom ~> wi_hom_sub
870 word_of_int_mult_hom ~> wi_hom_mult
871 word_of_int_minus_hom ~> wi_hom_neg
872 word_of_int_succ_hom ~> wi_hom_succ
873 word_of_int_pred_hom ~> wi_hom_pred
874 word_of_int_0_hom ~> word_0_wi
875 word_of_int_1_hom ~> word_1_wi
877 * Session HOL-Word: New proof method "word_bitwise" for splitting
878 machine word equalities and inequalities into logical circuits,
879 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
880 multiplication, shifting by constants, bitwise operators and numeric
881 constants. Requires fixed-length word types, not 'a word. Solves
882 many standard word identities outright and converts more into first
883 order problems amenable to blast or similar. See also examples in
884 HOL/Word/Examples/WordExamples.thy.
886 * Session HOL-Probability: Introduced the type "'a measure" to
887 represent measures, this replaces the records 'a algebra and 'a
888 measure_space. The locales based on subset_class now have two
889 locale-parameters the space \<Omega> and the set of measurable sets M.
890 The product of probability spaces uses now the same constant as the
891 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
892 measure". Most constants are defined now outside of locales and gain
893 an additional parameter, like null_sets, almost_eventually or \<mu>'.
894 Measure space constructions for distributions and densities now got
895 their own constants distr and density. Instead of using locales to
896 describe measure spaces with a finite space, the measure count_space
897 and point_measure is introduced. INCOMPATIBILITY.
901 finite_measure.\<mu>' -> measure
902 product_algebra_generator -> prod_algebra
903 product_prob_space.emb -> prod_emb
904 product_prob_space.infprod_algebra -> PiM
907 completeable_measure_space
910 finite_product_finite_prob_space
911 finite_product_sigma_algebra
914 pair_finite_prob_space
915 pair_finite_sigma_algebra
918 product_sigma_algebra
922 distribution -> use distr measure, or distributed predicate
924 joint_distribution -> use distr measure, or distributed predicate
925 pair_measure_generator
926 product_prob_space.infprod_algebra -> use PiM
929 Replacement theorems:
930 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
931 finite_measure.empty_measure -> measure_empty
932 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
933 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
934 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
935 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
936 finite_measure.finite_measure -> finite_measure.emeasure_finite
937 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
938 finite_measure.positive_measure' -> measure_nonneg
939 finite_measure.real_measure -> finite_measure.emeasure_real
940 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
941 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
942 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
943 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
944 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
945 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
946 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
947 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
948 information_space.entropy_commute -> information_space.entropy_commute_simple
949 information_space.entropy_eq -> information_space.entropy_simple_distributed
950 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
951 information_space.entropy_positive -> information_space.entropy_nonneg_simple
952 information_space.entropy_uniform_max -> information_space.entropy_uniform
953 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
954 information_space.KL_eq_0 -> information_space.KL_same_eq_0
955 information_space.KL_ge_0 -> information_space.KL_nonneg
956 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
957 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
958 Int_stable_cuboids -> Int_stable_atLeastAtMost
959 Int_stable_product_algebra_generator -> positive_integral
960 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
961 measure_space.additive -> emeasure_additive
962 measure_space.AE_iff_null_set -> AE_iff_null
963 measure_space.almost_everywhere_def -> eventually_ae_filter
964 measure_space.almost_everywhere_vimage -> AE_distrD
965 measure_space.continuity_from_above -> INF_emeasure_decseq
966 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
967 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
968 measure_space.continuity_from_below -> SUP_emeasure_incseq
969 measure_space_density -> emeasure_density
970 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
971 measure_space.integrable_vimage -> integrable_distr
972 measure_space.integral_translated_density -> integral_density
973 measure_space.integral_vimage -> integral_distr
974 measure_space.measure_additive -> plus_emeasure
975 measure_space.measure_compl -> emeasure_compl
976 measure_space.measure_countable_increasing -> emeasure_countable_increasing
977 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
978 measure_space.measure_decseq -> decseq_emeasure
979 measure_space.measure_Diff -> emeasure_Diff
980 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
981 measure_space.measure_eq_0 -> emeasure_eq_0
982 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
983 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
984 measure_space.measure_incseq -> incseq_emeasure
985 measure_space.measure_insert -> emeasure_insert
986 measure_space.measure_mono -> emeasure_mono
987 measure_space.measure_not_negative -> emeasure_not_MInf
988 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
989 measure_space.measure_setsum -> setsum_emeasure
990 measure_space.measure_setsum_split -> setsum_emeasure_cover
991 measure_space.measure_space_vimage -> emeasure_distr
992 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
993 measure_space.measure_subadditive -> subadditive
994 measure_space.measure_top -> emeasure_space
995 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
996 measure_space.measure_Un_null_set -> emeasure_Un_null_set
997 measure_space.positive_integral_translated_density -> positive_integral_density
998 measure_space.positive_integral_vimage -> positive_integral_distr
999 measure_space.real_continuity_from_above -> Lim_measure_decseq
1000 measure_space.real_continuity_from_below -> Lim_measure_incseq
1001 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
1002 measure_space.real_measure_Diff -> measure_Diff
1003 measure_space.real_measure_finite_Union -> measure_finite_Union
1004 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
1005 measure_space.real_measure_subadditive -> measure_subadditive
1006 measure_space.real_measure_Union -> measure_Union
1007 measure_space.real_measure_UNION -> measure_UNION
1008 measure_space.simple_function_vimage -> simple_function_comp
1009 measure_space.simple_integral_vimage -> simple_integral_distr
1010 measure_space.simple_integral_vimage -> simple_integral_distr
1011 measure_unique_Int_stable -> measure_eqI_generator_eq
1012 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
1013 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
1014 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
1015 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
1016 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
1017 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
1018 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
1019 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
1020 pair_sigma_algebra.sets_swap -> sets_pair_swap
1021 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
1022 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
1023 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
1024 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
1025 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
1026 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
1027 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
1028 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
1029 prob_space.measure_space_1 -> prob_space.emeasure_space_1
1030 prob_space.prob_space_vimage -> prob_space_distr
1031 prob_space.random_variable_restrict -> measurable_restrict
1032 prob_space_unique_Int_stable -> measure_eqI_prob_space
1033 product_algebraE -> prod_algebraE_all
1034 product_algebra_generator_der -> prod_algebra_eq_finite
1035 product_algebra_generator_into_space -> prod_algebra_sets_into_space
1036 product_algebraI -> sets_PiM_I_finite
1037 product_measure_exists -> product_sigma_finite.sigma_finite
1038 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
1039 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
1040 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
1041 product_prob_space.measurable_component -> measurable_component_singleton
1042 product_prob_space.measurable_emb -> measurable_prod_emb
1043 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
1044 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
1045 product_prob_space.measure_emb -> emeasure_prod_emb
1046 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
1047 product_sigma_algebra.product_algebra_into_space -> space_closed
1048 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
1049 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
1050 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
1051 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
1052 sets_product_algebra -> sets_PiM
1053 sigma_algebra.measurable_sigma -> measurable_measure_of
1054 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
1055 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
1056 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
1057 space_product_algebra -> space_PiM
1059 * Session HOL-TPTP: support to parse and import TPTP problems (all
1060 languages) into Isabelle/HOL.
1065 * New "case_product" attribute (see HOL).
1070 * Greater support for structured proofs involving induction or case
1073 * Much greater use of mathematical symbols.
1075 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1080 * Antiquotation @{keyword "name"} produces a parser for outer syntax
1081 from a minor keyword introduced via theory header declaration.
1083 * Antiquotation @{command_spec "name"} produces the
1084 Outer_Syntax.command_spec from a major keyword introduced via theory
1085 header declaration; it can be passed to Outer_Syntax.command etc.
1087 * Local_Theory.define no longer hard-wires default theorem name
1088 "foo_def", but retains the binding as given. If that is Binding.empty
1089 / Attrib.empty_binding, the result is not registered as user-level
1090 fact. The Local_Theory.define_internal variant allows to specify a
1091 non-empty name (used for the foundation in the background theory),
1092 while omitting the fact binding in the user-context. Potential
1093 INCOMPATIBILITY for derived definitional packages: need to specify
1094 naming policy for primitive definitions more explicitly.
1096 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
1097 conformance with similar operations in structure Term and Logic.
1099 * Antiquotation @{attributes [...]} embeds attribute source
1100 representation into the ML text, which is particularly useful with
1101 declarations like Local_Theory.note.
1103 * Structure Proof_Context follows standard naming scheme. Old
1104 ProofContext has been discontinued. INCOMPATIBILITY.
1106 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
1107 change of semantics: update is applied to auxiliary local theory
1110 * Modernized some old-style infix operations:
1112 addeqcongs ~> Simplifier.add_eqcong
1113 deleqcongs ~> Simplifier.del_eqcong
1114 addcongs ~> Simplifier.add_cong
1115 delcongs ~> Simplifier.del_cong
1116 setmksimps ~> Simplifier.set_mksimps
1117 setmkcong ~> Simplifier.set_mkcong
1118 setmksym ~> Simplifier.set_mksym
1119 setmkeqTrue ~> Simplifier.set_mkeqTrue
1120 settermless ~> Simplifier.set_termless
1121 setsubgoaler ~> Simplifier.set_subgoaler
1122 addsplits ~> Splitter.add_split
1123 delsplits ~> Splitter.del_split
1128 * USER_HOME settings variable points to cross-platform user home
1129 directory, which coincides with HOME on POSIX systems only. Likewise,
1130 the Isabelle path specification "~" now expands to $USER_HOME, instead
1131 of former $HOME. A different default for USER_HOME may be set
1132 explicitly in shell environment, before Isabelle settings are
1133 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
1134 the generic user home was intended.
1136 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
1137 notation, which is useful for the jEdit file browser, for example.
1139 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
1144 New in Isabelle2011-1 (October 2011)
1145 ------------------------------------
1149 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
1150 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
1152 - Management of multiple theory files directly from the editor
1153 buffer store -- bypassing the file-system (no requirement to save
1154 files for checking).
1156 - Markup of formal entities within the text buffer, with semantic
1157 highlighting, tooltips and hyperlinks to jump to defining source
1160 - Improved text rendering, with sub/superscripts in the source
1161 buffer (including support for copy/paste wrt. output panel, HTML
1162 theory output and other non-Isabelle text boxes).
1164 - Refined scheduling of proof checking and printing of results,
1165 based on interactive editor view. (Note: jEdit folding and
1166 narrowing allows to restrict buffer perspectives explicitly.)
1168 - Reduced CPU performance requirements, usable on machines with few
1171 - Reduced memory requirements due to pruning of unused document
1172 versions (garbage collection).
1174 See also ~~/src/Tools/jEdit/README.html for further information,
1175 including some remaining limitations.
1177 * Theory loader: source files are exclusively located via the master
1178 directory of each theory node (where the .thy file itself resides).
1179 The global load path (such as src/HOL/Library) has been discontinued.
1180 Note that the path element ~~ may be used to reference theories in the
1181 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
1184 * Theory loader: source files are identified by content via SHA1
1185 digests. Discontinued former path/modtime identification and optional
1186 ISABELLE_FILE_IDENT plugin scripts.
1188 * Parallelization of nested Isar proofs is subject to
1189 Goal.parallel_proofs_threshold (default 100). See also isabelle
1192 * Name space: former unsynchronized references are now proper
1193 configuration options, with more conventional names:
1195 long_names ~> names_long
1196 short_names ~> names_short
1197 unique_names ~> names_unique
1199 Minor INCOMPATIBILITY, need to declare options in context like this:
1201 declare [[names_unique = false]]
1203 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
1204 that the result needs to be unique, which means fact specifications
1205 may have to be refined after enriching a proof context.
1207 * Attribute "case_names" has been refined: the assumptions in each case
1208 can be named now by following the case name with [name1 name2 ...].
1210 * Isabelle/Isar reference manual has been updated and extended:
1211 - "Synopsis" provides a catalog of main Isar language concepts.
1212 - Formal references in syntax diagrams, via @{rail} antiquotation.
1213 - Updated material from classic "ref" manual, notably about
1214 "Classical Reasoner".
1219 * Class bot and top require underlying partial order rather than
1220 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
1222 * Class complete_lattice: generalized a couple of lemmas from sets;
1223 generalized theorems INF_cong and SUP_cong. New type classes for
1224 complete boolean algebras and complete linear orders. Lemmas
1225 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
1226 class complete_linorder.
1228 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
1229 Sup_fun_def, Inf_apply, Sup_apply.
1231 Removed redundant lemmas (the right hand side gives hints how to
1232 replace them for (metis ...), or (simp only: ...) proofs):
1234 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
1235 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
1236 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
1237 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
1238 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
1239 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
1240 Inter_def ~> INF_def, image_def
1241 Union_def ~> SUP_def, image_def
1242 INT_eq ~> INF_def, and image_def
1243 UN_eq ~> SUP_def, and image_def
1244 INF_subset ~> INF_superset_mono [OF _ order_refl]
1246 More consistent and comprehensive names:
1248 INTER_eq_Inter_image ~> INF_def
1249 UNION_eq_Union_image ~> SUP_def
1252 INF_leI ~> INF_lower
1253 INF_leI2 ~> INF_lower2
1254 le_INFI ~> INF_greatest
1255 le_SUPI ~> SUP_upper
1256 le_SUPI2 ~> SUP_upper2
1257 SUP_leI ~> SUP_least
1258 INFI_bool_eq ~> INF_bool_eq
1259 SUPR_bool_eq ~> SUP_bool_eq
1260 INFI_apply ~> INF_apply
1261 SUPR_apply ~> SUP_apply
1262 INTER_def ~> INTER_eq
1263 UNION_def ~> UNION_eq
1267 * Renamed theory Complete_Lattice to Complete_Lattices.
1270 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
1271 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
1272 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
1273 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
1275 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
1276 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
1277 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
1280 * Added syntactic classes "inf" and "sup" for the respective
1281 constants. INCOMPATIBILITY: Changes in the argument order of the
1282 (mostly internal) locale predicates for some derived classes.
1284 * Theorem collections ball_simps and bex_simps do not contain theorems
1285 referring to UNION any longer; these have been moved to collection
1286 UN_ball_bex_simps. INCOMPATIBILITY.
1288 * Theory Archimedean_Field: floor now is defined as parameter of a
1289 separate type class floor_ceiling.
1291 * Theory Finite_Set: more coherent development of fold_set locales:
1293 locale fun_left_comm ~> locale comp_fun_commute
1294 locale fun_left_comm_idem ~> locale comp_fun_idem
1296 Both use point-free characterization; interpretation proofs may need
1297 adjustment. INCOMPATIBILITY.
1299 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
1300 accordance with standard mathematical terminology. INCOMPATIBILITY.
1302 * Theory Complex_Main: The locale interpretations for the
1303 bounded_linear and bounded_bilinear locales have been removed, in
1304 order to reduce the number of duplicate lemmas. Users must use the
1305 original names for distributivity theorems, potential INCOMPATIBILITY.
1307 divide.add ~> add_divide_distrib
1308 divide.diff ~> diff_divide_distrib
1309 divide.setsum ~> setsum_divide_distrib
1310 mult.add_right ~> right_distrib
1311 mult.diff_right ~> right_diff_distrib
1312 mult_right.setsum ~> setsum_right_distrib
1313 mult_left.diff ~> left_diff_distrib
1315 * Theory Complex_Main: Several redundant theorems have been removed or
1316 replaced by more general versions. INCOMPATIBILITY.
1318 real_diff_def ~> minus_real_def
1319 real_divide_def ~> divide_real_def
1320 real_less_def ~> less_le
1321 real_abs_def ~> abs_real_def
1322 real_sgn_def ~> sgn_real_def
1323 real_mult_commute ~> mult_commute
1324 real_mult_assoc ~> mult_assoc
1325 real_mult_1 ~> mult_1_left
1326 real_add_mult_distrib ~> left_distrib
1327 real_zero_not_eq_one ~> zero_neq_one
1328 real_mult_inverse_left ~> left_inverse
1329 INVERSE_ZERO ~> inverse_zero
1330 real_le_refl ~> order_refl
1331 real_le_antisym ~> order_antisym
1332 real_le_trans ~> order_trans
1333 real_le_linear ~> linear
1334 real_le_eq_diff ~> le_iff_diff_le_0
1335 real_add_left_mono ~> add_left_mono
1336 real_mult_order ~> mult_pos_pos
1337 real_mult_less_mono2 ~> mult_strict_left_mono
1338 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
1339 real_0_le_divide_iff ~> zero_le_divide_iff
1340 realpow_two_disj ~> power2_eq_iff
1341 real_squared_diff_one_factored ~> square_diff_one_factored
1342 realpow_two_diff ~> square_diff_square_factored
1343 reals_complete2 ~> complete_real
1344 real_sum_squared_expand ~> power2_sum
1345 exp_ln_eq ~> ln_unique
1347 expi_zero ~> exp_zero
1348 lemma_DERIV_subst ~> DERIV_cong
1349 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
1350 LIMSEQ_const ~> tendsto_const
1351 LIMSEQ_norm ~> tendsto_norm
1352 LIMSEQ_add ~> tendsto_add
1353 LIMSEQ_minus ~> tendsto_minus
1354 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
1355 LIMSEQ_diff ~> tendsto_diff
1356 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
1357 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
1358 LIMSEQ_mult ~> tendsto_mult
1359 LIMSEQ_inverse ~> tendsto_inverse
1360 LIMSEQ_divide ~> tendsto_divide
1361 LIMSEQ_pow ~> tendsto_power
1362 LIMSEQ_setsum ~> tendsto_setsum
1363 LIMSEQ_setprod ~> tendsto_setprod
1364 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
1365 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
1366 LIMSEQ_imp_rabs ~> tendsto_rabs
1367 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
1368 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
1369 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
1370 LIMSEQ_Complex ~> tendsto_Complex
1371 LIM_ident ~> tendsto_ident_at
1372 LIM_const ~> tendsto_const
1373 LIM_add ~> tendsto_add
1374 LIM_add_zero ~> tendsto_add_zero
1375 LIM_minus ~> tendsto_minus
1376 LIM_diff ~> tendsto_diff
1377 LIM_norm ~> tendsto_norm
1378 LIM_norm_zero ~> tendsto_norm_zero
1379 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
1380 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
1381 LIM_rabs ~> tendsto_rabs
1382 LIM_rabs_zero ~> tendsto_rabs_zero
1383 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
1384 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
1385 LIM_compose ~> tendsto_compose
1386 LIM_mult ~> tendsto_mult
1387 LIM_scaleR ~> tendsto_scaleR
1388 LIM_of_real ~> tendsto_of_real
1389 LIM_power ~> tendsto_power
1390 LIM_inverse ~> tendsto_inverse
1391 LIM_sgn ~> tendsto_sgn
1392 isCont_LIM_compose ~> isCont_tendsto_compose
1393 bounded_linear.LIM ~> bounded_linear.tendsto
1394 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
1395 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
1396 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
1397 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
1398 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
1399 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
1401 * Theory Complex_Main: The definition of infinite series was
1402 generalized. Now it is defined on the type class {topological_space,
1403 comm_monoid_add}. Hence it is useable also for extended real numbers.
1405 * Theory Complex_Main: The complex exponential function "expi" is now
1406 a type-constrained abbreviation for "exp :: complex => complex"; thus
1407 several polymorphic lemmas about "exp" are now applicable to "expi".
1411 - Theory Library/Code_Char_ord provides native ordering of
1412 characters in the target language.
1414 - Commands code_module and code_library are legacy, use export_code
1417 - Method "evaluation" is legacy, use method "eval" instead.
1419 - Legacy evaluator "SML" is deactivated by default. May be
1420 reactivated by the following theory command:
1422 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
1424 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
1426 * New proof method "induction" that gives induction hypotheses the
1427 name "IH", thus distinguishing them from further hypotheses that come
1428 from rule induction. The latter are still called "hyps". Method
1429 "induction" is a thin wrapper around "induct" and follows the same
1432 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
1433 still available as a legacy feature for some time.
1436 - Added "need" and "total_consts" options.
1437 - Reintroduced "show_skolems" option by popular demand.
1438 - Renamed attribute: nitpick_def ~> nitpick_unfold.
1442 - Use quasi-sound (and efficient) translations by default.
1443 - Added support for the following provers: E-ToFoF, LEO-II,
1444 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
1445 - Automatically preplay and minimize proofs before showing them if
1446 this can be done within reasonable time.
1447 - sledgehammer available_provers ~> sledgehammer supported_provers.
1449 - Added "preplay_timeout", "slicing", "type_enc", "sound",
1450 "max_mono_iters", and "max_new_mono_instances" options.
1451 - Removed "explicit_apply" and "full_types" options as well as "Full
1452 Types" Proof General menu item. INCOMPATIBILITY.
1455 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
1456 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
1460 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
1461 "elim:" options. INCOMPATIBILITY.
1462 - Introduced 'try' that not only runs 'try_methods' but also
1463 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
1466 - Added "eval" option to evaluate terms for the found counterexample
1467 (currently only supported by the default (exhaustive) tester).
1468 - Added post-processing of terms to obtain readable counterexamples
1469 (currently only supported by the default (exhaustive) tester).
1470 - New counterexample generator quickcheck[narrowing] enables
1471 narrowing-based testing. Requires the Glasgow Haskell compiler
1472 with its installation location defined in the Isabelle settings
1473 environment as ISABELLE_GHC.
1474 - Removed quickcheck tester "SML" based on the SML code generator
1475 (formly in HOL/Library).
1477 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
1478 use 'partial_function' instead.
1480 * Theory Library/Extended_Reals replaces now the positive extended
1481 reals found in probability theory. This file is extended by
1482 Multivariate_Analysis/Extended_Real_Limits.
1484 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
1485 from where it must be imported explicitly if it is really required.
1488 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
1489 been moved here. INCOMPATIBILITY.
1491 * Theory Library/Saturated provides type of numbers with saturated
1494 * Theory Library/Product_Lattice defines a pointwise ordering for the
1495 product type 'a * 'b, and provides instance proofs for various order
1496 and lattice type classes.
1498 * Theory Library/Countable now provides the "countable_datatype" proof
1499 method for proving "countable" class instances for datatypes.
1501 * Theory Library/Cset_Monad allows do notation for computable sets
1502 (cset) via the generic monad ad-hoc overloading facility.
1504 * Library: Theories of common data structures are split into theories
1505 for implementation, an invariant-ensuring type, and connection to an
1506 abstract type. INCOMPATIBILITY.
1508 - RBT is split into RBT and RBT_Mapping.
1509 - AssocList is split and renamed into AList and AList_Mapping.
1510 - DList is split into DList_Impl, DList, and DList_Cset.
1511 - Cset is split into Cset and List_Cset.
1513 * Theory Library/Nat_Infinity has been renamed to
1514 Library/Extended_Nat, with name changes of the following types and
1517 type inat ~> type enat
1519 Infty ~> infinity (overloaded)
1523 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
1524 been renamed accordingly. INCOMPATIBILITY.
1526 * Session Multivariate_Analysis: The euclidean_space type class now
1527 fixes a constant "Basis :: 'a set" consisting of the standard
1528 orthonormal basis for the type. Users now have the option of
1529 quantifying over this set instead of using the "basis" function, e.g.
1530 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
1532 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
1533 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
1534 "Cart_nth" and "Cart_lambda" have been respectively renamed to
1535 "vec_nth" and "vec_lambda"; theorems mentioning those names have
1536 changed to match. Definition theorems for overloaded constants now use
1537 the standard "foo_vec_def" naming scheme. A few other theorems have
1538 been renamed as follows (INCOMPATIBILITY):
1540 Cart_eq ~> vec_eq_iff
1541 dist_nth_le_cart ~> dist_vec_nth_le
1542 tendsto_vector ~> vec_tendstoI
1543 Cauchy_vector ~> vec_CauchyI
1545 * Session Multivariate_Analysis: Several duplicate theorems have been
1546 removed, and other theorems have been renamed or replaced with more
1547 general versions. INCOMPATIBILITY.
1549 finite_choice ~> finite_set_choice
1550 eventually_conjI ~> eventually_conj
1551 eventually_and ~> eventually_conj_iff
1552 eventually_false ~> eventually_False
1553 setsum_norm ~> norm_setsum
1554 Lim_sequentially ~> LIMSEQ_def
1555 Lim_ident_at ~> LIM_ident
1556 Lim_const ~> tendsto_const
1557 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
1558 Lim_neg ~> tendsto_minus
1559 Lim_add ~> tendsto_add
1560 Lim_sub ~> tendsto_diff
1561 Lim_mul ~> tendsto_scaleR
1562 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
1563 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
1564 Lim_linear ~> bounded_linear.tendsto
1565 Lim_component ~> tendsto_euclidean_component
1566 Lim_component_cart ~> tendsto_vec_nth
1567 Lim_inner ~> tendsto_inner [OF tendsto_const]
1568 dot_lsum ~> inner_setsum_left
1569 dot_rsum ~> inner_setsum_right
1570 continuous_cmul ~> continuous_scaleR [OF continuous_const]
1571 continuous_neg ~> continuous_minus
1572 continuous_sub ~> continuous_diff
1573 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
1574 continuous_mul ~> continuous_scaleR
1575 continuous_inv ~> continuous_inverse
1576 continuous_at_within_inv ~> continuous_at_within_inverse
1577 continuous_at_inv ~> continuous_at_inverse
1578 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
1579 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
1580 continuous_at_component ~> continuous_component [OF continuous_at_id]
1581 continuous_on_neg ~> continuous_on_minus
1582 continuous_on_sub ~> continuous_on_diff
1583 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
1584 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
1585 continuous_on_mul ~> continuous_on_scaleR
1586 continuous_on_mul_real ~> continuous_on_mult
1587 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
1588 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
1589 continuous_on_inverse ~> continuous_on_inv
1590 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
1591 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
1592 subset_interior ~> interior_mono
1593 subset_closure ~> closure_mono
1594 closure_univ ~> closure_UNIV
1595 real_arch_lt ~> reals_Archimedean2
1596 real_arch ~> reals_Archimedean3
1597 real_abs_norm ~> abs_norm_cancel
1598 real_abs_sub_norm ~> norm_triangle_ineq3
1599 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
1601 * Session HOL-Probability:
1602 - Caratheodory's extension lemma is now proved for ring_of_sets.
1603 - Infinite products of probability measures are now available.
1604 - Sigma closure is independent, if the generator is independent
1605 - Use extended reals instead of positive extended
1606 reals. INCOMPATIBILITY.
1608 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
1610 expand_fun_below ~> fun_below_iff
1611 below_fun_ext ~> fun_belowI
1612 expand_cfun_eq ~> cfun_eq_iff
1613 ext_cfun ~> cfun_eqI
1614 expand_cfun_below ~> cfun_below_iff
1615 below_cfun_ext ~> cfun_belowI
1616 monofun_fun_fun ~> fun_belowD
1617 monofun_fun_arg ~> monofunE
1618 monofun_lub_fun ~> adm_monofun [THEN admD]
1619 cont_lub_fun ~> adm_cont [THEN admD]
1620 cont2cont_Rep_CFun ~> cont2cont_APP
1621 cont_Rep_CFun_app ~> cont_APP_app
1622 cont_Rep_CFun_app_app ~> cont_APP_app_app
1623 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
1624 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
1625 contlub_cfun ~> lub_APP [symmetric]
1626 contlub_LAM ~> lub_LAM [symmetric]
1629 lift_distinct1 ~> lift.distinct(1)
1630 lift_distinct2 ~> lift.distinct(2)
1631 Def_not_UU ~> lift.distinct(2)
1632 Def_inject ~> lift.inject
1633 below_UU_iff ~> below_bottom_iff
1634 eq_UU_iff ~> eq_bottom_iff
1637 *** Document preparation ***
1639 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
1640 isar-ref manual, both for description and actual application of the
1643 * Antiquotation @{value} evaluates the given term and presents its
1646 * Antiquotations: term style "isub" provides ad-hoc conversion of
1647 variables x1, y23 into subscripted form x\<^isub>1,
1648 y\<^isub>2\<^isub>3.
1650 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
1651 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
1653 * Localized \isabellestyle switch can be used within blocks or groups
1656 \isabellestyle{it} %preferred default
1657 {\isabellestylett @{text "typewriter stuff"}}
1659 * Discontinued special treatment of hard tabulators. Implicit
1660 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
1666 * The inner syntax of sort/type/term/prop supports inlined YXML
1667 representations within quoted string tokens. By encoding logical
1668 entities via Term_XML (in ML or Scala) concrete syntax can be
1669 bypassed, which is particularly useful for producing bits of text
1670 under external program control.
1672 * Antiquotations for ML and document preparation are managed as theory
1673 data, which requires explicit setup.
1675 * Isabelle_Process.is_active allows tools to check if the official
1676 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
1677 (better known as Proof General).
1679 * Structure Proof_Context follows standard naming scheme. Old
1680 ProofContext is still available for some time as legacy alias.
1682 * Structure Timing provides various operations for timing; supersedes
1683 former start_timing/end_timing etc.
1685 * Path.print is the official way to show file-system paths to users
1686 (including quotes etc.).
1688 * Inner syntax: identifiers in parse trees of generic categories
1689 "logic", "aprop", "idt" etc. carry position information (disguised as
1690 type constraints). Occasional INCOMPATIBILITY with non-compliant
1691 translations that choke on unexpected type constraints. Positions can
1692 be stripped in ML translations via Syntax.strip_positions /
1693 Syntax.strip_positions_ast, or via the syntax constant
1694 "_strip_positions" within parse trees. As last resort, positions can
1695 be disabled via the configuration option Syntax.positions, which is
1696 called "syntax_positions" in Isar attribute syntax.
1698 * Discontinued special status of various ML structures that contribute
1699 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
1700 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
1701 refer directly to Ast.Constant, Lexicon.is_identifier,
1702 Syntax_Trans.mk_binder_tr etc.
1704 * Typed print translation: discontinued show_sorts argument, which is
1705 already available via context of "advanced" translation.
1707 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
1708 goal states; body tactic needs to address all subgoals uniformly.
1710 * Slightly more special eq_list/eq_set, with shortcut involving
1711 pointer equality (assumes that eq relation is reflexive).
1713 * Classical tactics use proper Proof.context instead of historic types
1714 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
1715 operate directly on Proof.context. Raw type claset retains its use as
1716 snapshot of the classical context, which can be recovered via
1717 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
1718 INCOMPATIBILITY, classical tactics and derived proof methods require
1719 proper Proof.context.
1724 * Discontinued support for Poly/ML 5.2, which was the last version
1725 without proper multithreading and TimeLimit implementation.
1727 * Discontinued old lib/scripts/polyml-platform, which has been
1728 obsolete since Isabelle2009-2.
1730 * Various optional external tools are referenced more robustly and
1731 uniformly by explicit Isabelle settings as follows:
1733 ISABELLE_CSDP (formerly CSDP_EXE)
1734 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
1735 ISABELLE_OCAML (formerly EXEC_OCAML)
1736 ISABELLE_SWIPL (formerly EXEC_SWIPL)
1737 ISABELLE_YAP (formerly EXEC_YAP)
1739 Note that automated detection from the file-system or search path has
1740 been discontinued. INCOMPATIBILITY.
1742 * Scala layer provides JVM method invocation service for static
1743 methods of type (String)String, see Invoke_Scala.method in ML. For
1746 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
1748 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
1749 this allows to pass structured values between ML and Scala.
1751 * The IsabelleText fonts includes some further glyphs to support the
1752 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
1753 installed a local copy (which is normally *not* required) need to
1754 delete or update it from ~~/lib/fonts/.
1758 New in Isabelle2011 (January 2011)
1759 ----------------------------------
1763 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
1764 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
1765 useful tooltips and hyperlinks produced from its static analysis. The
1766 bundled component provides an executable Isabelle tool that can be run
1769 Isabelle2011/bin/isabelle jedit
1771 * Significantly improved Isabelle/Isar implementation manual.
1773 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
1774 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
1775 while the default heap location within that directory lacks that extra
1776 suffix. This isolates multiple Isabelle installations from each
1777 other, avoiding problems with old settings in new versions.
1778 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
1780 * Source files are always encoded as UTF-8, instead of old-fashioned
1781 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
1782 the following package declarations:
1784 \usepackage[utf8]{inputenc}
1785 \usepackage{textcomp}
1787 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
1788 a Unicode character is treated as a single symbol, not a sequence of
1789 non-ASCII bytes as before. Since Isabelle/ML string literals may
1790 contain symbols without further backslash escapes, Unicode can now be
1791 used here as well. Recall that Symbol.explode in ML provides a
1792 consistent view on symbols, while raw explode (or String.explode)
1793 merely give a byte-oriented representation.
1795 * Theory loader: source files are primarily located via the master
1796 directory of each theory node (where the .thy file itself resides).
1797 The global load path is still partially available as legacy feature.
1798 Minor INCOMPATIBILITY due to subtle change in file lookup: use
1799 explicit paths, relatively to the theory.
1801 * Special treatment of ML file names has been discontinued.
1802 Historically, optional extensions .ML or .sml were added on demand --
1803 at the cost of clarity of file dependencies. Recall that Isabelle/ML
1804 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
1806 * Various options that affect pretty printing etc. are now properly
1807 handled within the context via configuration options, instead of
1808 unsynchronized references or print modes. There are both ML Config.T
1809 entities and Isar declaration attributes to access these.
1811 ML (Config.T) Isar (attribute)
1813 eta_contract eta_contract
1814 show_brackets show_brackets
1815 show_sorts show_sorts
1816 show_types show_types
1817 show_question_marks show_question_marks
1818 show_consts show_consts
1819 show_abbrevs show_abbrevs
1821 Syntax.ast_trace syntax_ast_trace
1822 Syntax.ast_stat syntax_ast_stat
1823 Syntax.ambiguity_level syntax_ambiguity_level
1825 Goal_Display.goals_limit goals_limit
1826 Goal_Display.show_main_goal show_main_goal
1828 Method.rule_trace rule_trace
1830 Thy_Output.display thy_output_display
1831 Thy_Output.quotes thy_output_quotes
1832 Thy_Output.indent thy_output_indent
1833 Thy_Output.source thy_output_source
1834 Thy_Output.break thy_output_break
1836 Note that corresponding "..._default" references in ML may only be
1837 changed globally at the ROOT session setup, but *not* within a theory.
1838 The option "show_abbrevs" supersedes the former print mode
1839 "no_abbrevs" with inverted meaning.
1841 * More systematic naming of some configuration options.
1844 trace_simp ~> simp_trace
1845 debug_simp ~> simp_debug
1847 * Support for real valued configuration options, using simplistic
1848 floating-point notation that coincides with the inner syntax for
1851 * Support for real valued preferences (with approximative PGIP type):
1852 front-ends need to accept "pgint" values in float notation.
1855 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
1858 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
1863 * Command 'type_synonym' (with single argument) replaces somewhat
1864 outdated 'types', which is still available as legacy feature for some
1867 * Command 'nonterminal' (with 'and' separated list of arguments)
1868 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
1870 * Command 'notepad' replaces former 'example_proof' for
1871 experimentation in Isar without any result. INCOMPATIBILITY.
1873 * Locale interpretation commands 'interpret' and 'sublocale' accept
1874 lists of equations to map definitions in a locale to appropriate
1875 entities in the context of the interpretation. The 'interpretation'
1876 command already provided this functionality.
1878 * Diagnostic command 'print_dependencies' prints the locale instances
1879 that would be activated if the specified expression was interpreted in
1880 the current context. Variant "print_dependencies!" assumes a context
1881 without interpretations.
1883 * Diagnostic command 'print_interps' prints interpretations in proofs
1884 in addition to interpretations in theories.
1886 * Discontinued obsolete 'global' and 'local' commands to manipulate
1887 the theory name space. Rare INCOMPATIBILITY. The ML functions
1888 Sign.root_path and Sign.local_path may be applied directly where this
1889 feature is still required for historical reasons.
1891 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
1892 'definition' instead.
1894 * The "prems" fact, which refers to the accidental collection of
1895 foundational premises in the context, is now explicitly marked as
1896 legacy feature and will be discontinued soon. Consider using "assms"
1897 of the head statement or reference facts by explicit names.
1899 * Document antiquotations @{class} and @{type} print classes and type
1902 * Document antiquotation @{file} checks file/directory entries within
1903 the local file system.
1908 * Coercive subtyping: functions can be declared as coercions and type
1909 inference will add them as necessary upon input of a term. Theory
1910 Complex_Main declares real :: nat => real and real :: int => real as
1911 coercions. A coercion function f is declared like this:
1913 declare [[coercion f]]
1915 To lift coercions through type constructors (e.g. from nat => real to
1916 nat list => real list), map functions can be declared, e.g.
1918 declare [[coercion_map map]]
1920 Currently coercion inference is activated only in theories including
1921 real numbers, i.e. descendants of Complex_Main. This is controlled by
1922 the configuration option "coercion_enabled", e.g. it can be enabled in
1923 other theories like this:
1925 declare [[coercion_enabled]]
1927 * Command 'partial_function' provides basic support for recursive
1928 function definitions over complete partial orders. Concrete instances
1929 are provided for i) the option type, ii) tail recursion on arbitrary
1930 types, and iii) the heap monad of Imperative_HOL. See
1931 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
1934 * Function package: f.psimps rules are no longer implicitly declared
1935 as [simp]. INCOMPATIBILITY.
1937 * Datatype package: theorems generated for executable equality (class
1938 "eq") carry proper names and are treated as default code equations.
1940 * Inductive package: now offers command 'inductive_simps' to
1941 automatically derive instantiated and simplified equations for
1942 inductive predicates, similar to 'inductive_cases'.
1944 * Command 'enriched_type' allows to register properties of the
1945 functorial structure of types.
1947 * Improved infrastructure for term evaluation using code generator
1948 techniques, in particular static evaluation conversions.
1950 * Code generator: Scala (2.8 or higher) has been added to the target
1953 * Code generator: globbing constant expressions "*" and "Theory.*"
1954 have been replaced by the more idiomatic "_" and "Theory._".
1957 * Code generator: export_code without explicit file declaration prints
1958 to standard output. INCOMPATIBILITY.
1960 * Code generator: do not print function definitions for case
1961 combinators any longer.
1963 * Code generator: simplification with rules determined with
1964 src/Tools/Code/code_simp.ML and method "code_simp".
1966 * Code generator for records: more idiomatic representation of record
1967 types. Warning: records are not covered by ancient SML code
1968 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
1969 rep_datatype declaration helps to succeed then:
1973 rep_datatype foo_ext ...
1975 * Records: logical foundation type for records does not carry a
1976 '_type' suffix any longer (obsolete due to authentic syntax).
1979 * Quickcheck now by default uses exhaustive testing instead of random
1980 testing. Random testing can be invoked by "quickcheck [random]",
1981 exhaustive testing by "quickcheck [exhaustive]".
1983 * Quickcheck instantiates polymorphic types with small finite
1984 datatypes by default. This enables a simple execution mechanism to
1985 handle quantifiers and function equality over the finite datatypes.
1987 * Quickcheck random generator has been renamed from "code" to
1988 "random". INCOMPATIBILITY.
1990 * Quickcheck now has a configurable time limit which is set to 30
1991 seconds by default. This can be changed by adding [timeout = n] to the
1992 quickcheck command. The time limit for Auto Quickcheck is still set
1995 * Quickcheck in locales considers interpretations of that locale for
1996 counter example search.
1999 - Added "smt" and "remote_smt" provers based on the "smt" proof
2000 method. See the Sledgehammer manual for details ("isabelle doc
2003 sledgehammer atp_info ~> sledgehammer running_provers
2004 sledgehammer atp_kill ~> sledgehammer kill_provers
2005 sledgehammer available_atps ~> sledgehammer available_provers
2008 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
2009 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
2010 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
2011 (and "ms" and "min" are no longer supported)
2016 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
2017 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
2019 - Added support for partial quotient types.
2020 - Added local versions of the "Nitpick.register_xxx" functions.
2021 - Added "whack" option.
2022 - Allow registration of quotient types as codatatypes.
2023 - Improved "merge_type_vars" option to merge more types.
2024 - Removed unsound "fast_descrs" option.
2025 - Added custom symmetry breaking for datatypes, making it possible to reach
2026 higher cardinalities.
2027 - Prevent the expansion of too large definitions.
2029 * Proof methods "metis" and "meson" now have configuration options
2030 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
2031 to diagnose these tools. E.g.
2033 using [[metis_trace = true]]
2035 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
2036 manually as command 'solve_direct'.
2038 * The default SMT solver Z3 must be enabled explicitly (due to
2039 licensing issues) by setting the environment variable
2040 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
2041 commercial applications, the SMT solver CVC3 is provided as fall-back;
2042 changing the SMT solver is done via the configuration option
2045 * Remote SMT solvers need to be referred to by the "remote_" prefix,
2046 i.e. "remote_cvc3" and "remote_z3".
2048 * Added basic SMT support for datatypes, records, and typedefs using
2049 the oracle mode (no proofs). Direct support of pairs has been dropped
2050 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
2051 support for a similar behavior). Minor INCOMPATIBILITY.
2053 * Changed SMT configuration options:
2055 z3_proofs ~> smt_oracle (with inverted meaning)
2056 z3_trace_assms ~> smt_trace_used_facts
2069 * Boogie output files (.b2i files) need to be declared in the theory
2072 * Simplification procedure "list_to_set_comprehension" rewrites list
2073 comprehensions applied to List.set to set comprehensions. Occasional
2074 INCOMPATIBILITY, may be deactivated like this:
2076 declare [[simproc del: list_to_set_comprehension]]
2078 * Removed old version of primrec package. INCOMPATIBILITY.
2080 * Removed simplifier congruence rule of "prod_case", as has for long
2081 been the case with "split". INCOMPATIBILITY.
2083 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
2085 * Removed [split_format ... and ... and ...] version of
2086 [split_format]. Potential INCOMPATIBILITY.
2088 * Predicate "sorted" now defined inductively, with nice induction
2089 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
2091 * Constant "contents" renamed to "the_elem", to free the generic name
2092 contents for other uses. INCOMPATIBILITY.
2094 * Renamed class eq and constant eq (for code generation) to class
2095 equal and constant equal, plus renaming of related facts and various
2096 tuning. INCOMPATIBILITY.
2098 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
2100 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
2103 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
2104 avoid confusion with finite sets. INCOMPATIBILITY.
2106 * Abandoned locales equiv, congruent and congruent2 for equivalence
2107 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
2110 * Some previously unqualified names have been qualified:
2117 Trueprop ~> HOL.Trueprop
2122 op --> ~> HOL.implies
2134 Pair ~> Product_Type.Pair
2135 fst ~> Product_Type.fst
2136 snd ~> Product_Type.snd
2137 curry ~> Product_Type.curry
2139 Collect ~> Set.Collect
2143 * More canonical naming convention for some fundamental definitions:
2145 bot_bool_eq ~> bot_bool_def
2146 top_bool_eq ~> top_bool_def
2147 inf_bool_eq ~> inf_bool_def
2148 sup_bool_eq ~> sup_bool_def
2149 bot_fun_eq ~> bot_fun_def
2150 top_fun_eq ~> top_fun_def
2151 inf_fun_eq ~> inf_fun_def
2152 sup_fun_eq ~> sup_fun_def
2156 * More stylized fact names:
2158 expand_fun_eq ~> fun_eq_iff
2159 expand_set_eq ~> set_eq_iff
2161 nat_number ~> eval_nat_numeral
2165 * Refactoring of code-generation specific operations in theory List:
2171 mem_iff ~> member_def
2172 null_empty ~> null_def
2174 INCOMPATIBILITY. Note that these were not supposed to be used
2175 regularly unless for striking reasons; their main purpose was code
2178 Various operations from the Haskell prelude are used for generating
2181 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
2182 "surj f" is now an abbreviation of "range f = UNIV". The theorems
2183 bij_def and surj_def are unchanged. INCOMPATIBILITY.
2185 * Abolished some non-alphabetic type names: "prod" and "sum" replace
2186 "*" and "+" respectively. INCOMPATIBILITY.
2188 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
2189 "Sum_Type.Plus" instead.
2191 * Constant "split" has been merged with constant "prod_case"; names of
2192 ML functions, facts etc. involving split have been retained so far,
2193 though. INCOMPATIBILITY.
2195 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
2196 instead. INCOMPATIBILITY.
2198 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
2201 * Former theory Library/Enum is now part of the HOL-Main image.
2202 INCOMPATIBILITY: all constants of the Enum theory now have to be
2203 referred to by its qualified name.
2206 nlists ~> Enum.nlists
2207 product ~> Enum.product
2209 * Theory Library/Monad_Syntax provides do-syntax for monad types.
2210 Syntax in Library/State_Monad has been changed to avoid ambiguities.
2213 * Theory Library/SetsAndFunctions has been split into
2214 Library/Function_Algebras and Library/Set_Algebras; canonical names
2215 for instance definitions for functions; various improvements.
2218 * Theory Library/Multiset provides stable quicksort implementation of
2221 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
2224 * Session Multivariate_Analysis: introduced a type class for euclidean
2225 space. Most theorems are now stated in terms of euclidean spaces
2226 instead of finite cartesian products.
2229 real ^ 'n ~> 'a::real_vector
2230 ~> 'a::euclidean_space
2231 ~> 'a::ordered_euclidean_space
2232 (depends on your needs)
2236 \<chi> x. _ ~> \<chi>\<chi> x. _
2239 Also note that the indices are now natural numbers and not from some
2240 finite type. Finite cartesian products of euclidean spaces, products
2241 of euclidean spaces the real and complex numbers are instantiated to
2242 be euclidean_spaces. INCOMPATIBILITY.
2244 * Session Probability: introduced pextreal as positive extended real
2245 numbers. Use pextreal as value for measures. Introduce the
2246 Radon-Nikodym derivative, product spaces and Fubini's theorem for
2247 arbitrary sigma finite measures. Introduces Lebesgue measure based on
2248 the integral in Multivariate Analysis. INCOMPATIBILITY.
2250 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
2253 * Session SPARK (with image HOL-SPARK) provides commands to load and
2254 prove verification conditions generated by the SPARK Ada program
2255 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
2260 * Theorems for additive ring operations (locale abelian_monoid and
2261 descendants) are generated by interpretation from their multiplicative
2262 counterparts. Names (in particular theorem names) have the mandatory
2263 qualifier 'add'. Previous theorem names are redeclared for
2266 * Structure "int_ring" is now an abbreviation (previously a
2267 definition). This fits more natural with advanced interpretations.
2272 * The domain package now runs in definitional mode by default: The
2273 former command 'new_domain' is now called 'domain'. To use the domain
2274 package in its original axiomatic mode, use 'domain (unsafe)'.
2277 * The new class "domain" is now the default sort. Class "predomain"
2278 is an unpointed version of "domain". Theories can be updated by
2279 replacing sort annotations as shown below. INCOMPATIBILITY.
2281 'a::type ~> 'a::countable
2282 'a::cpo ~> 'a::predomain
2283 'a::pcpo ~> 'a::domain
2285 * The old type class "rep" has been superseded by class "domain".
2286 Accordingly, users of the definitional package must remove any
2287 "default_sort rep" declarations. INCOMPATIBILITY.
2289 * The domain package (definitional mode) now supports unpointed
2290 predomain argument types, as long as they are marked 'lazy'. (Strict
2291 arguments must be in class "domain".) For example, the following
2292 domain definition now works:
2294 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
2296 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
2297 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
2298 'a option, and 'a list. Additionally, it configures fixrec and the
2299 domain package to work with these types. For example:
2301 fixrec isInl :: "('a + 'b) u -> tr"
2302 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
2304 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
2306 * The "(permissive)" option of fixrec has been replaced with a
2307 per-equation "(unchecked)" option. See
2308 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
2310 * The "bifinite" class no longer fixes a constant "approx"; the class
2311 now just asserts that such a function exists. INCOMPATIBILITY.
2313 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
2314 defines an embedding of type 'a defl into udom by default; instances
2315 of "bifinite" and "domain" classes are available in
2316 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
2318 * The syntax "REP('a)" has been replaced with "DEFL('a)".
2320 * The predicate "directed" has been removed. INCOMPATIBILITY.
2322 * The type class "finite_po" has been removed. INCOMPATIBILITY.
2324 * The function "cprod_map" has been renamed to "prod_map".
2327 * The monadic bind operator on each powerdomain has new binder syntax
2328 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
2329 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
2331 * The infix syntax for binary union on each powerdomain has changed
2332 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
2333 syntax. INCOMPATIBILITY.
2335 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
2336 still supported as an input translation.
2338 * Renamed some theorems (the original names are also still available).
2340 expand_fun_below ~> fun_below_iff
2341 below_fun_ext ~> fun_belowI
2342 expand_cfun_eq ~> cfun_eq_iff
2343 ext_cfun ~> cfun_eqI
2344 expand_cfun_below ~> cfun_below_iff
2345 below_cfun_ext ~> cfun_belowI
2346 cont2cont_Rep_CFun ~> cont2cont_APP
2348 * The Abs and Rep functions for various types have changed names.
2349 Related theorem names have also changed to match. INCOMPATIBILITY.
2351 Rep_CFun ~> Rep_cfun
2352 Abs_CFun ~> Abs_cfun
2353 Rep_Sprod ~> Rep_sprod
2354 Abs_Sprod ~> Abs_sprod
2355 Rep_Ssum ~> Rep_ssum
2356 Abs_Ssum ~> Abs_ssum
2358 * Lemmas with names of the form *_defined_iff or *_strict_iff have
2359 been renamed to *_bottom_iff. INCOMPATIBILITY.
2361 * Various changes to bisimulation/coinduction with domain package:
2363 - Definitions of "bisim" constants no longer mention definedness.
2364 - With mutual recursion, "bisim" predicate is now curried.
2365 - With mutual recursion, each type gets a separate coind theorem.
2366 - Variable names in bisim_def and coinduct rules have changed.
2370 * Case combinators generated by the domain package for type "foo" are
2371 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
2373 * Several theorems have been renamed to more accurately reflect the
2374 names of constants and types involved. INCOMPATIBILITY.
2376 thelub_const ~> lub_const
2377 lub_const ~> is_lub_const
2379 is_lub_lub ~> is_lubD2
2381 unique_lub ~> is_lub_unique
2382 is_ub_lub ~> is_lub_rangeD1
2383 lub_bin_chain ~> is_lub_bin_chain
2384 lub_fun ~> is_lub_fun
2385 thelub_fun ~> lub_fun
2386 thelub_cfun ~> lub_cfun
2387 thelub_Pair ~> lub_Pair
2388 lub_cprod ~> is_lub_prod
2389 thelub_cprod ~> lub_prod
2390 minimal_cprod ~> minimal_prod
2391 inst_cprod_pcpo ~> inst_prod_pcpo
2393 compact_UU ~> compact_bottom
2394 deflation_UU ~> deflation_bottom
2395 finite_deflation_UU ~> finite_deflation_bottom
2397 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
2399 sq_ord_less_eq_trans ~> below_eq_trans
2400 sq_ord_eq_less_trans ~> eq_below_trans
2401 refl_less ~> below_refl
2402 trans_less ~> below_trans
2403 antisym_less ~> below_antisym
2404 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
2405 box_less ~> box_below
2406 rev_trans_less ~> rev_below_trans
2407 not_less2not_eq ~> not_below2not_eq
2408 less_UU_iff ~> below_UU_iff
2409 flat_less_iff ~> flat_below_iff
2410 adm_less ~> adm_below
2411 adm_not_less ~> adm_not_below
2412 adm_compact_not_less ~> adm_compact_not_below
2413 less_fun_def ~> below_fun_def
2414 expand_fun_less ~> fun_below_iff
2415 less_fun_ext ~> fun_belowI
2416 less_discr_def ~> below_discr_def
2417 discr_less_eq ~> discr_below_eq
2418 less_unit_def ~> below_unit_def
2419 less_cprod_def ~> below_prod_def
2420 prod_lessI ~> prod_belowI
2421 Pair_less_iff ~> Pair_below_iff
2422 fst_less_iff ~> fst_below_iff
2423 snd_less_iff ~> snd_below_iff
2424 expand_cfun_less ~> cfun_below_iff
2425 less_cfun_ext ~> cfun_belowI
2426 injection_less ~> injection_below
2427 less_up_def ~> below_up_def
2428 not_Iup_less ~> not_Iup_below
2429 Iup_less ~> Iup_below
2431 Def_inject_less_eq ~> Def_below_Def
2432 Def_less_is_eq ~> Def_below_iff
2433 spair_less_iff ~> spair_below_iff
2434 less_sprod ~> below_sprod
2435 spair_less ~> spair_below
2436 sfst_less_iff ~> sfst_below_iff
2437 ssnd_less_iff ~> ssnd_below_iff
2438 fix_least_less ~> fix_least_below
2439 dist_less_one ~> dist_below_one
2440 less_ONE ~> below_ONE
2441 ONE_less_iff ~> ONE_below_iff
2442 less_sinlD ~> below_sinlD
2443 less_sinrD ~> below_sinrD
2448 * All constant names are now qualified internally and use proper
2449 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
2454 * Antiquotation @{assert} inlines a function bool -> unit that raises
2455 Fail if the argument is false. Due to inlining the source position of
2456 failed assertions is included in the error output.
2458 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
2459 text is in practice always evaluated with a stable theory checkpoint.
2460 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
2462 * Antiquotation @{theory A} refers to theory A from the ancestry of
2463 the current context, not any accidental theory loader state as before.
2464 Potential INCOMPATIBILITY, subtle change in semantics.
2466 * Syntax.pretty_priority (default 0) configures the required priority
2467 of pretty-printed output and thus affects insertion of parentheses.
2469 * Syntax.default_root (default "any") configures the inner syntax
2470 category (nonterminal symbol) for parsing of terms.
2472 * Former exception Library.UnequalLengths now coincides with
2473 ListPair.UnequalLengths.
2475 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
2476 main functionality is provided by structure Simplifier.
2478 * Renamed raw "explode" function to "raw_explode" to emphasize its
2479 meaning. Note that internally to Isabelle, Symbol.explode is used in
2480 almost all situations.
2482 * Discontinued obsolete function sys_error and exception SYS_ERROR.
2483 See implementation manual for further details on exceptions in
2486 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
2489 * Renamed structure PureThy to Pure_Thy and moved most of its
2490 operations to structure Global_Theory, to emphasize that this is
2491 rarely-used global-only stuff.
2493 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
2494 instead (or tracing for high-volume output).
2496 * Configuration option show_question_marks only affects regular pretty
2497 printing of types and terms, not raw Term.string_of_vname.
2499 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
2500 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
2501 @{thms} for most purposes.
2503 * ML structure Unsynchronized is never opened, not even in Isar
2504 interaction mode as before. Old Unsynchronized.set etc. have been
2505 discontinued -- use plain := instead. This should be *rare* anyway,
2506 since modern tools always work via official context data, notably
2507 configuration options.
2509 * Parallel and asynchronous execution requires special care concerning
2510 interrupts. Structure Exn provides some convenience functions that
2511 avoid working directly with raw Interrupt. User code must not absorb
2512 interrupts -- intermediate handling (for cleanup etc.) needs to be
2513 followed by re-raising of the original exception. Another common
2514 source of mistakes are "handle _" patterns, which make the meaning of
2515 the program subject to physical effects of the environment.
2519 New in Isabelle2009-2 (June 2010)
2520 ---------------------------------
2524 * Authentic syntax for *all* logical entities (type classes, type
2525 constructors, term constants): provides simple and robust
2526 correspondence between formal entities and concrete syntax. Within
2527 the parse tree / AST representations, "constants" are decorated by
2528 their category (class, type, const) and spelled out explicitly with
2529 their full internal name.
2531 Substantial INCOMPATIBILITY concerning low-level syntax declarations
2532 and translations (translation rules and translation functions in ML).
2533 Some hints on upgrading:
2535 - Many existing uses of 'syntax' and 'translations' can be replaced
2536 by more modern 'type_notation', 'notation' and 'abbreviation',
2537 which are independent of this issue.
2539 - 'translations' require markup within the AST; the term syntax
2540 provides the following special forms:
2542 CONST c -- produces syntax version of constant c from context
2543 XCONST c -- literally c, checked as constant from context
2544 c -- literally c, if declared by 'syntax'
2546 Plain identifiers are treated as AST variables -- occasionally the
2547 system indicates accidental variables via the error "rhs contains
2550 Type classes and type constructors are marked according to their
2551 concrete syntax. Some old translations rules need to be written
2552 for the "type" category, using type constructor application
2553 instead of pseudo-term application of the default category
2556 - 'parse_translation' etc. in ML may use the following
2559 @{class_syntax c} -- type class c within parse tree / AST
2560 @{term_syntax c} -- type constructor c within parse tree / AST
2561 @{const_syntax c} -- ML version of "CONST c" above
2562 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
2564 - Literal types within 'typed_print_translations', i.e. those *not*
2565 represented as pseudo-terms are represented verbatim. Use @{class
2566 c} or @{type_name c} here instead of the above syntax
2569 Note that old non-authentic syntax was based on unqualified base
2570 names, so all of the above "constant" names would coincide. Recall
2571 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
2572 diagnose syntax problems.
2574 * Type constructors admit general mixfix syntax, not just infix.
2576 * Concrete syntax may be attached to local entities without a proof
2577 body, too. This works via regular mixfix annotations for 'fix',
2578 'def', 'obtain' etc. or via the explicit 'write' command, which is
2579 similar to the 'notation' command in theory specifications.
2581 * Discontinued unnamed infix syntax (legacy feature for many years) --
2582 need to specify constant name and syntax separately. Internal ML
2583 datatype constructors have been renamed from InfixName to Infix etc.
2584 Minor INCOMPATIBILITY.
2586 * Schematic theorem statements need to be explicitly markup as such,
2587 via commands 'schematic_lemma', 'schematic_theorem',
2588 'schematic_corollary'. Thus the relevance of the proof is made
2589 syntactically clear, which impacts performance in a parallel or
2590 asynchronous interactive environment. Minor INCOMPATIBILITY.
2592 * Use of cumulative prems via "!" in some proof methods has been
2593 discontinued (old legacy feature).
2595 * References 'trace_simp' and 'debug_simp' have been replaced by
2596 configuration options stored in the context. Enabling tracing (the
2597 case of debugging is similar) in proofs works via
2599 using [[trace_simp = true]]
2601 Tracing is then active for all invocations of the simplifier in
2602 subsequent goal refinement steps. Tracing may also still be enabled or
2603 disabled via the ProofGeneral settings menu.
2605 * Separate commands 'hide_class', 'hide_type', 'hide_const',
2606 'hide_fact' replace the former 'hide' KIND command. Minor
2609 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
2610 more efficient than combinations with -q1 or -q2.
2615 * Proofterms record type-class reasoning explicitly, using the
2616 "unconstrain" operation internally. This eliminates all sort
2617 constraints from a theorem and proof, introducing explicit
2618 OFCLASS-premises. On the proof term level, this operation is
2619 automatically applied at theorem boundaries, such that closed proofs
2620 are always free of sort constraints. INCOMPATIBILITY for tools that
2621 inspect proof terms.
2623 * Local theory specifications may depend on extra type variables that
2624 are not present in the result type -- arguments TYPE('a) :: 'a itself
2625 are added internally. For example:
2627 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
2629 * Predicates of locales introduced by classes carry a mandatory
2630 "class" prefix. INCOMPATIBILITY.
2632 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
2634 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
2637 * Command 'code_reflect' allows to incorporate generated ML code into
2638 runtime environment; replaces immature code_datatype antiquotation.
2641 * Code generator: simple concept for abstract datatypes obeying
2644 * Code generator: details of internal data cache have no impact on the
2645 user space functionality any longer.
2647 * Methods "unfold_locales" and "intro_locales" ignore non-locale
2648 subgoals. This is more appropriate for interpretations with 'where'.
2651 * Command 'example_proof' opens an empty proof body. This allows to
2652 experiment with Isar, without producing any persistent result.
2654 * Commands 'type_notation' and 'no_type_notation' declare type syntax
2655 within a local theory context, with explicit checking of the
2656 constructors involved (in contrast to the raw 'syntax' versions).
2658 * Commands 'types' and 'typedecl' now work within a local theory
2659 context -- without introducing dependencies on parameters or
2660 assumptions, which is not possible in Isabelle/Pure.
2662 * Command 'defaultsort' has been renamed to 'default_sort', it works
2663 within a local theory context. Minor INCOMPATIBILITY.
2668 * Command 'typedef' now works within a local theory context -- without
2669 introducing dependencies on parameters or assumptions, which is not
2670 possible in Isabelle/Pure/HOL. Note that the logical environment may
2671 contain multiple interpretations of local typedefs (with different
2672 non-emptiness proofs), even in a global theory context.
2674 * New package for quotient types. Commands 'quotient_type' and
2675 'quotient_definition' may be used for defining types and constants by
2676 quotient constructions. An example is the type of integers created by
2677 quotienting pairs of natural numbers:
2680 intrel :: "(nat * nat) => (nat * nat) => bool"
2682 "intrel (x, y) (u, v) = (x + v = u + y)"
2684 quotient_type int = "nat * nat" / intrel
2685 by (auto simp add: equivp_def expand_fun_eq)
2688 "0::int" is "(0::nat, 0::nat)"
2690 The method "lifting" can be used to lift of theorems from the
2691 underlying "raw" type to the quotient type. The example
2692 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
2693 construction and provides a reasoning infrastructure for finite sets.
2695 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
2696 clash with new theory Quotient in Main HOL.
2698 * Moved the SMT binding into the main HOL session, eliminating
2699 separate HOL-SMT session.
2701 * List membership infix mem operation is only an input abbreviation.
2704 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
2705 for future developements; former Library/Word.thy is still present in
2706 the AFP entry RSAPPS.
2708 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
2709 longer shadowed. INCOMPATIBILITY.
2711 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
2714 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
2717 * Dropped normalizing_semiring etc; use the facts in semiring classes
2718 instead. INCOMPATIBILITY.
2720 * Dropped several real-specific versions of lemmas about floor and
2721 ceiling; use the generic lemmas from theory "Archimedean_Field"
2722 instead. INCOMPATIBILITY.
2724 floor_number_of_eq ~> floor_number_of
2725 le_floor_eq_number_of ~> number_of_le_floor
2726 le_floor_eq_zero ~> zero_le_floor
2727 le_floor_eq_one ~> one_le_floor
2728 floor_less_eq_number_of ~> floor_less_number_of
2729 floor_less_eq_zero ~> floor_less_zero
2730 floor_less_eq_one ~> floor_less_one
2731 less_floor_eq_number_of ~> number_of_less_floor
2732 less_floor_eq_zero ~> zero_less_floor
2733 less_floor_eq_one ~> one_less_floor
2734 floor_le_eq_number_of ~> floor_le_number_of
2735 floor_le_eq_zero ~> floor_le_zero
2736 floor_le_eq_one ~> floor_le_one
2737 floor_subtract_number_of ~> floor_diff_number_of
2738 floor_subtract_one ~> floor_diff_one
2739 ceiling_number_of_eq ~> ceiling_number_of
2740 ceiling_le_eq_number_of ~> ceiling_le_number_of
2741 ceiling_le_zero_eq ~> ceiling_le_zero
2742 ceiling_le_eq_one ~> ceiling_le_one
2743 less_ceiling_eq_number_of ~> number_of_less_ceiling
2744 less_ceiling_eq_zero ~> zero_less_ceiling
2745 less_ceiling_eq_one ~> one_less_ceiling
2746 ceiling_less_eq_number_of ~> ceiling_less_number_of
2747 ceiling_less_eq_zero ~> ceiling_less_zero
2748 ceiling_less_eq_one ~> ceiling_less_one
2749 le_ceiling_eq_number_of ~> number_of_le_ceiling
2750 le_ceiling_eq_zero ~> zero_le_ceiling
2751 le_ceiling_eq_one ~> one_le_ceiling
2752 ceiling_subtract_number_of ~> ceiling_diff_number_of
2753 ceiling_subtract_one ~> ceiling_diff_one
2755 * Theory "Finite_Set": various folding_XXX locales facilitate the
2756 application of the various fold combinators on finite sets.
2758 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
2759 provides abstract red-black tree type which is backed by "RBT_Impl" as
2760 implementation. INCOMPATIBILTY.
2762 * Theory Library/Coinductive_List has been removed -- superseded by
2763 AFP/thys/Coinductive.
2765 * Theory PReal, including the type "preal" and related operations, has
2766 been removed. INCOMPATIBILITY.
2768 * Real: new development using Cauchy Sequences.
2770 * Split off theory "Big_Operators" containing setsum, setprod,
2771 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
2773 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
2774 "Int" etc. INCOMPATIBILITY.
2776 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
2778 * New set of rules "ac_simps" provides combined assoc / commute
2779 rewrites for all interpretations of the appropriate generic locales.
2781 * Renamed theory "OrderedGroup" to "Groups" and split theory
2782 "Ring_and_Field" into theories "Rings" and "Fields"; for more
2783 appropriate and more consistent names suitable for name prefixes
2784 within the HOL theories. INCOMPATIBILITY.
2786 * Some generic constants have been put to appropriate theories:
2787 - less_eq, less: Orderings
2788 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
2789 - inverse, divide: Rings
2792 * More consistent naming of type classes involving orderings (and
2795 lower_semilattice ~> semilattice_inf
2796 upper_semilattice ~> semilattice_sup
2798 dense_linear_order ~> dense_linorder
2800 pordered_ab_group_add ~> ordered_ab_group_add
2801 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
2802 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
2803 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
2804 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
2805 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
2806 pordered_cancel_semiring ~> ordered_cancel_semiring
2807 pordered_comm_monoid_add ~> ordered_comm_monoid_add
2808 pordered_comm_ring ~> ordered_comm_ring
2809 pordered_comm_semiring ~> ordered_comm_semiring
2810 pordered_ring ~> ordered_ring
2811 pordered_ring_abs ~> ordered_ring_abs
2812 pordered_semiring ~> ordered_semiring
2814 ordered_ab_group_add ~> linordered_ab_group_add
2815 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
2816 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
2817 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
2818 ordered_field ~> linordered_field
2819 ordered_field_no_lb ~> linordered_field_no_lb
2820 ordered_field_no_ub ~> linordered_field_no_ub
2821 ordered_field_dense_linear_order ~> dense_linordered_field
2822 ordered_idom ~> linordered_idom
2823 ordered_ring ~> linordered_ring
2824 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
2825 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
2826 ordered_ring_strict ~> linordered_ring_strict
2827 ordered_semidom ~> linordered_semidom
2828 ordered_semiring ~> linordered_semiring
2829 ordered_semiring_1 ~> linordered_semiring_1
2830 ordered_semiring_1_strict ~> linordered_semiring_1_strict
2831 ordered_semiring_strict ~> linordered_semiring_strict
2833 The following slightly odd type classes have been moved to a
2834 separate theory Library/Lattice_Algebras:
2836 lordered_ab_group_add ~> lattice_ab_group_add
2837 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
2838 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
2839 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
2840 lordered_ring ~> lattice_ring
2844 * Refined field classes:
2845 - classes division_ring_inverse_zero, field_inverse_zero,
2846 linordered_field_inverse_zero include rule inverse 0 = 0 --
2847 subsumes former division_by_zero class;
2848 - numerous lemmas have been ported from field to division_ring.
2851 * Refined algebra theorem collections:
2852 - dropped theorem group group_simps, use algebra_simps instead;
2853 - dropped theorem group ring_simps, use field_simps instead;
2854 - proper theorem collection field_simps subsumes former theorem
2855 groups field_eq_simps and field_simps;
2856 - dropped lemma eq_minus_self_iff which is a duplicate for
2860 * Theory Finite_Set and List: some lemmas have been generalized from
2863 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
2864 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
2865 inter_Inter_fold_inter ~> inf_Inf_fold_inf
2866 union_Union_fold_union ~> sup_Sup_fold_sup
2867 Inter_fold_inter ~> Inf_fold_inf
2868 Union_fold_union ~> Sup_fold_sup
2869 inter_INTER_fold_inter ~> inf_INFI_fold_inf
2870 union_UNION_fold_union ~> sup_SUPR_fold_sup
2871 INTER_fold_inter ~> INFI_fold_inf
2872 UNION_fold_union ~> SUPR_fold_sup
2874 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
2875 replaced by the more convenient lemmas Inf_empty and Sup_empty.
2876 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
2877 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
2878 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
2879 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
2881 * Reorganized theory Multiset: swapped notation of pointwise and
2884 - pointwise ordering is instance of class order with standard syntax
2886 - multiset ordering has syntax <=# and <#; partial order properties
2887 are provided by means of interpretation with prefix
2889 - less duplication, less historical organization of sections,
2890 conversion from associations lists to multisets, rudimentary code
2892 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
2897 multiset_eq_conv_count_eq ~> multiset_ext_iff
2898 multi_count_ext ~> multiset_ext
2899 diff_union_inverse2 ~> diff_union_cancelR
2903 * Theory Permutation: replaced local "remove" by List.remove1.
2905 * Code generation: ML and OCaml code is decorated with signatures.
2907 * Theory List: added transpose.
2909 * Library/Nat_Bijection.thy is a collection of bijective functions
2910 between nat and other types, which supersedes the older libraries
2911 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
2914 Nat_Int_Bij.nat2_to_nat ~> prod_encode
2915 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
2916 Nat_Int_Bij.int_to_nat_bij ~> int_encode
2917 Nat_Int_Bij.nat_to_int_bij ~> int_decode
2918 Countable.pair_encode ~> prod_encode
2919 NatIso.prod2nat ~> prod_encode
2920 NatIso.nat2prod ~> prod_decode
2921 NatIso.sum2nat ~> sum_encode
2922 NatIso.nat2sum ~> sum_decode
2923 NatIso.list2nat ~> list_encode
2924 NatIso.nat2list ~> list_decode
2925 NatIso.set2nat ~> set_encode
2926 NatIso.nat2set ~> set_decode
2929 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
2930 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
2931 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
2932 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
2933 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
2934 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
2935 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
2936 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
2937 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
2938 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
2939 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
2940 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
2941 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
2944 - Renamed ATP commands:
2945 atp_info ~> sledgehammer running_atps
2946 atp_kill ~> sledgehammer kill_atps
2947 atp_messages ~> sledgehammer messages
2948 atp_minimize ~> sledgehammer minimize
2949 print_atps ~> sledgehammer available_atps
2951 - Added user's manual ("isabelle doc sledgehammer").
2952 - Added option syntax and "sledgehammer_params" to customize
2953 Sledgehammer's behavior. See the manual for details.
2954 - Modified the Isar proof reconstruction code so that it produces
2955 direct proofs rather than proofs by contradiction. (This feature
2956 is still experimental.)
2957 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
2959 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
2962 - Added and implemented "binary_ints" and "bits" options.
2963 - Added "std" option and implemented support for nonstandard models.
2964 - Added and implemented "finitize" option to improve the precision
2965 of infinite datatypes based on a monotonicity analysis.
2966 - Added support for quotient types.
2967 - Added support for "specification" and "ax_specification"
2969 - Added support for local definitions (for "function" and
2970 "termination" proofs).
2971 - Added support for term postprocessors.
2972 - Optimized "Multiset.multiset" and "FinFun.finfun".
2973 - Improved efficiency of "destroy_constrs" optimization.
2974 - Fixed soundness bugs related to "destroy_constrs" optimization and
2976 - Fixed soundness bug related to higher-order constructors.
2977 - Fixed soundness bug when "full_descrs" is enabled.
2978 - Improved precision of set constructs.
2979 - Added "atoms" option.
2980 - Added cache to speed up repeated Kodkod invocations on the same
2982 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
2983 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
2984 "SAT4J_Light". INCOMPATIBILITY.
2985 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
2986 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
2987 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
2989 * Method "induct" now takes instantiations of the form t, where t is not
2990 a variable, as a shorthand for "x == t", where x is a fresh variable.
2991 If this is not intended, t has to be enclosed in parentheses.
2992 By default, the equalities generated by definitional instantiations
2993 are pre-simplified, which may cause parameters of inductive cases
2994 to disappear, or may even delete some of the inductive cases.
2995 Use "induct (no_simp)" instead of "induct" to restore the old
2996 behaviour. The (no_simp) option is also understood by the "cases"
2997 and "nominal_induct" methods, which now perform pre-simplification, too.
3003 * Variable names in lemmas generated by the domain package have
3004 changed; the naming scheme is now consistent with the HOL datatype
3005 package. Some proof scripts may be affected, INCOMPATIBILITY.
3007 * The domain package no longer defines the function "foo_copy" for
3008 recursive domain "foo". The reach lemma is now stated directly in
3009 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
3010 be reformulated in terms of "foo_take", INCOMPATIBILITY.
3012 * Most definedness lemmas generated by the domain package (previously
3013 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
3014 like "foo$x = UU <-> x = UU", which works better as a simp rule.
3015 Proofs that used definedness lemmas as intro rules may break,
3016 potential INCOMPATIBILITY.
3018 * Induction and casedist rules generated by the domain package now
3019 declare proper case_names (one called "bottom", and one named for each
3020 constructor). INCOMPATIBILITY.
3022 * For mutually-recursive domains, separate "reach" and "take_lemma"
3023 rules are generated for each domain, INCOMPATIBILITY.
3025 foo_bar.reach ~> foo.reach bar.reach
3026 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
3028 * Some lemmas generated by the domain package have been renamed for
3029 consistency with the datatype package, INCOMPATIBILITY.
3031 foo.ind ~> foo.induct
3032 foo.finite_ind ~> foo.finite_induct
3033 foo.coind ~> foo.coinduct
3034 foo.casedist ~> foo.exhaust
3035 foo.exhaust ~> foo.nchotomy
3037 * For consistency with other definition packages, the fixrec package
3038 now generates qualified theorem names, INCOMPATIBILITY.
3040 foo_simps ~> foo.simps
3041 foo_unfold ~> foo.unfold
3042 foo_induct ~> foo.induct
3044 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
3045 method and internal fixrec proofs now use the default simpset instead.
3048 * The "contlub" predicate has been removed. Proof scripts should use
3049 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
3051 * The "admw" predicate has been removed, INCOMPATIBILITY.
3053 * The constants cpair, cfst, and csnd have been removed in favor of
3054 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
3059 * Antiquotations for basic formal entities:
3061 @{class NAME} -- type class
3062 @{class_syntax NAME} -- syntax representation of the above
3064 @{type_name NAME} -- logical type
3065 @{type_abbrev NAME} -- type abbreviation
3066 @{nonterminal NAME} -- type of concrete syntactic category
3067 @{type_syntax NAME} -- syntax representation of any of the above
3069 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
3070 @{const_abbrev NAME} -- abbreviated constant
3071 @{const_syntax NAME} -- syntax representation of any of the above
3073 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
3074 syntax constant (cf. 'syntax' command).
3076 * Antiquotation @{make_string} inlines a function to print arbitrary
3077 values similar to the ML toplevel. The result is compiler dependent
3078 and may fall back on "?" in certain situations.
3080 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
3081 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
3082 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
3083 not work with the asynchronous Isar document model.
3085 * Configuration options now admit dynamic default values, depending on
3086 the context or even global references.
3088 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
3089 uses an efficient external library if available (for Poly/ML).
3091 * Renamed some important ML structures, while keeping the old names
3092 for some time as aliases within the structure Legacy:
3094 OuterKeyword ~> Keyword
3097 OuterSyntax ~> Outer_Syntax
3098 PrintMode ~> Print_Mode
3099 SpecParse ~> Parse_Spec
3102 ThyOutput ~> Thy_Output
3103 TypeInfer ~> Type_Infer
3105 Note that "open Legacy" simplifies porting of sources, but forgetting
3106 to remove it again will complicate porting again in the future.
3108 * Most operations that refer to a global context are named
3109 accordingly, e.g. Simplifier.global_context or
3110 ProofContext.init_global. There are some situations where a global
3111 context actually works, but under normal circumstances one needs to
3112 pass the proper local context through the code!
3114 * Discontinued old TheoryDataFun with its copy/init operation -- data
3115 needs to be pure. Functor Theory_Data_PP retains the traditional
3116 Pretty.pp argument to merge, which is absent in the standard
3117 Theory_Data version.
3119 * Sorts.certify_sort and derived "cert" operations for types and terms
3120 no longer minimize sorts. Thus certification at the boundary of the
3121 inference kernel becomes invariant under addition of class relations,
3122 which is an important monotonicity principle. Sorts are now minimized
3123 in the syntax layer only, at the boundary between the end-user and the
3124 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
3125 explicitly in rare situations.
3127 * Renamed old-style Drule.standard to Drule.export_without_context, to
3128 emphasize that this is in no way a standard operation.
3131 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
3132 usual for resolution. Rare INCOMPATIBILITY.
3134 * Renamed varify/unvarify operations to varify_global/unvarify_global
3135 to emphasize that these only work in a global situation (which is
3138 * Curried take and drop in library.ML; negative length is interpreted
3139 as infinity (as in chop). Subtle INCOMPATIBILITY.
3141 * Proof terms: type substitutions on proof constants now use canonical
3142 order of type variables. INCOMPATIBILITY for tools working with proof
3145 * Raw axioms/defs may no longer carry sort constraints, and raw defs
3146 may no longer carry premises. User-level specifications are
3147 transformed accordingly by Thm.add_axiom/add_def.
3152 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
3153 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
3154 proof terms are enabled unconditionally in the new HOL-Proofs image.
3156 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
3157 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
3160 * Old lib/scripts/polyml-platform is superseded by the
3161 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
3162 variant, even on a 64 bit machine. The following example setting
3163 prefers 64 bit if available:
3165 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
3167 * The preliminary Isabelle/jEdit application demonstrates the emerging
3168 Isabelle/Scala layer for advanced prover interaction and integration.
3169 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
3172 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
3173 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
3174 similar to the default assignment of the document preparation system
3175 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
3176 provides some operations for direct access to the font without asking
3177 the user for manual installation.
3181 New in Isabelle2009-1 (December 2009)
3182 -------------------------------------
3186 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
3187 one backslash should be used, even in ML sources.
3192 * Locale interpretation propagates mixins along the locale hierarchy.
3193 The currently only available mixins are the equations used to map
3194 local definitions to terms of the target domain of an interpretation.
3196 * Reactivated diagnostic command 'print_interps'. Use "print_interps
3197 loc" to print all interpretations of locale "loc" in the theory.
3198 Interpretations in proofs are not shown.
3200 * Thoroughly revised locales tutorial. New section on conditional
3203 * On instantiation of classes, remaining undefined class parameters
3204 are formally declared. INCOMPATIBILITY.
3207 *** Document preparation ***
3209 * New generalized style concept for printing terms: @{foo (style) ...}
3210 instead of @{foo_style style ...} (old form is still retained for
3211 backward compatibility). Styles can be also applied for
3212 antiquotations prop, term_type and typeof.
3217 * New proof method "smt" for a combination of first-order logic with
3218 equality, linear and nonlinear (natural/integer/real) arithmetic, and
3219 fixed-size bitvectors; there is also basic support for higher-order
3220 features (esp. lambda abstractions). It is an incomplete decision
3221 procedure based on external SMT solvers using the oracle mechanism;
3222 for the SMT solver Z3, this method is proof-producing. Certificates
3223 are provided to avoid calling the external solvers solely for
3224 re-checking proofs. Due to a remote SMT service there is no need for
3225 installing SMT solvers locally. See src/HOL/SMT.
3227 * New commands to load and prove verification conditions generated by
3228 the Boogie program verifier or derived systems (e.g. the Verifying C
3229 Compiler (VCC) or Spec#). See src/HOL/Boogie.
3231 * New counterexample generator tool 'nitpick' based on the Kodkod
3232 relational model finder. See src/HOL/Tools/Nitpick and
3233 src/HOL/Nitpick_Examples.
3235 * New commands 'code_pred' and 'values' to invoke the predicate
3236 compiler and to enumerate values of inductive predicates.
3238 * A tabled implementation of the reflexive transitive closure.
3240 * New implementation of quickcheck uses generic code generator;
3241 default generators are provided for all suitable HOL types, records
3242 and datatypes. Old quickcheck can be re-activated importing theory
3243 Library/SML_Quickcheck.
3245 * New testing tool Mirabelle for automated proof tools. Applies
3246 several tools and tactics like sledgehammer, metis, or quickcheck, to
3247 every proof step in a theory. To be used in batch mode via the
3248 "mirabelle" utility.
3250 * New proof method "sos" (sum of squares) for nonlinear real
3251 arithmetic (originally due to John Harison). It requires theory
3252 Library/Sum_Of_Squares. It is not a complete decision procedure but
3253 works well in practice on quantifier-free real arithmetic with +, -,
3254 *, ^, =, <= and <, i.e. boolean combinations of equalities and
3255 inequalities between polynomials. It makes use of external
3256 semidefinite programming solvers. Method "sos" generates a
3257 certificate that can be pasted into the proof thus avoiding the need
3258 to call an external tool every time the proof is checked. See
3259 src/HOL/Library/Sum_Of_Squares.
3261 * New method "linarith" invokes existing linear arithmetic decision
3264 * New command 'atp_minimal' reduces result produced by Sledgehammer.
3266 * New Sledgehammer option "Full Types" in Proof General settings menu.
3267 Causes full type information to be output to the ATPs. This slows
3268 ATPs down considerably but eliminates a source of unsound "proofs"
3271 * New method "metisFT": A version of metis that uses full type
3272 information in order to avoid failures of proof reconstruction.
3274 * New evaluator "approximate" approximates an real valued term using
3275 the same method as the approximation method.
3277 * Method "approximate" now supports arithmetic expressions as
3278 boundaries of intervals and implements interval splitting and Taylor
3281 * ML antiquotation @{code_datatype} inserts definition of a datatype
3282 generated by the code generator; e.g. see src/HOL/Predicate.thy.
3284 * New theory SupInf of the supremum and infimum operators for sets of
3287 * New theory Probability, which contains a development of measure
3288 theory, eventually leading to Lebesgue integration and probability.
3290 * Extended Multivariate Analysis to include derivation and Brouwer's
3293 * Reorganization of number theory, INCOMPATIBILITY:
3294 - new number theory development for nat and int, in theories Divides
3295 and GCD as well as in new session Number_Theory
3296 - some constants and facts now suffixed with _nat and _int
3298 - former session NumberTheory now named Old_Number_Theory, including
3299 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
3300 - moved theory Pocklington from src/HOL/Library to
3301 src/HOL/Old_Number_Theory
3303 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
3304 lcm of finite and infinite sets. It is shown that they form a complete
3307 * Class semiring_div requires superclass no_zero_divisors and proof of
3308 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
3309 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
3310 generalized to class semiring_div, subsuming former theorems
3311 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
3312 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
3315 * Refinements to lattice classes and sets:
3316 - less default intro/elim rules in locale variant, more default
3317 intro/elim rules in class variant: more uniformity
3318 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
3320 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
3322 - renamed ACI to inf_sup_aci
3323 - new class "boolean_algebra"
3324 - class "complete_lattice" moved to separate theory
3325 "Complete_Lattice"; corresponding constants (and abbreviations)
3326 renamed and with authentic syntax:
3327 Set.Inf ~> Complete_Lattice.Inf
3328 Set.Sup ~> Complete_Lattice.Sup
3329 Set.INFI ~> Complete_Lattice.INFI
3330 Set.SUPR ~> Complete_Lattice.SUPR
3331 Set.Inter ~> Complete_Lattice.Inter
3332 Set.Union ~> Complete_Lattice.Union
3333 Set.INTER ~> Complete_Lattice.INTER
3334 Set.UNION ~> Complete_Lattice.UNION
3335 - authentic syntax for
3338 - mere abbreviations:
3341 Set.inter (for inf, formerly Set.Int)
3342 Set.union (for sup, formerly Set.Un)
3343 Complete_Lattice.Inter (for Inf)
3344 Complete_Lattice.Union (for Sup)
3345 Complete_Lattice.INTER (for INFI)
3346 Complete_Lattice.UNION (for SUPR)
3347 - object-logic definitions as far as appropriate
3349 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
3350 Un_subset_iff are explicitly deleted as default simp rules; then also
3351 their lattice counterparts le_inf_iff and le_sup_iff have to be
3352 deleted to achieve the desired effect.
3354 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
3355 rules by default any longer; the same applies to min_max.inf_absorb1
3356 etc. INCOMPATIBILITY.
3358 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
3359 pred_set_conv by default. INCOMPATIBILITY.
3361 * Power operations on relations and functions are now one dedicated
3362 constant "compow" with infix syntax "^^". Power operation on
3363 multiplicative monoids retains syntax "^" and is now defined generic
3364 in class power. INCOMPATIBILITY.
3366 * Relation composition "R O S" now has a more standard argument order:
3367 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
3368 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
3369 break, since the O_assoc rule was not rewritten like this. Fix using
3370 O_assoc[symmetric]. The same applies to the curried version "R OO S".
3372 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
3373 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
3376 * Most rules produced by inductive and datatype package have mandatory
3377 prefixes. INCOMPATIBILITY.
3379 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
3380 the attribute of the same name. Each of the theorems in the list
3381 DERIV_intros assumes composition with an additional function and
3382 matches a variable to the derivative, which has to be solved by the
3383 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
3384 of most elementary terms. Former Maclauren.DERIV_tac and
3385 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
3388 * Code generator attributes follow the usual underscore convention:
3389 code_unfold replaces code unfold
3390 code_post replaces code post
3395 sizechange -> size_change
3396 induct_scheme -> induction_schema
3399 * Discontinued abbreviation "arbitrary" of constant "undefined".
3400 INCOMPATIBILITY, use "undefined" directly.
3403 Suc_eq_add_numeral_1 -> Suc_eq_plus1
3404 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
3405 Suc_plus1 -> Suc_eq_plus1
3406 *anti_sym -> *antisym*
3407 vector_less_eq_def -> vector_le_def
3410 * Added theorem List.map_map as [simp]. Removed List.map_compose.
3413 * Removed predicate "M hassize n" (<--> card M = n & finite M).
3419 * Theory Representable defines a class "rep" of domains that are
3420 representable (via an ep-pair) in the universal domain type "udom".
3421 Instances are provided for all type constructors defined in HOLCF.
3423 * The 'new_domain' command is a purely definitional version of the
3424 domain package, for representable domains. Syntax is identical to the
3425 old domain package. The 'new_domain' package also supports indirect
3426 recursion using previously-defined type constructors. See
3427 src/HOLCF/ex/New_Domain.thy for examples.
3429 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
3430 on the left-hand side of an equation, and then performs
3431 simplification. Rewriting is done using rules declared with the
3432 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
3433 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
3435 * The pattern-match compiler in 'fixrec' can now handle constructors
3436 with HOL function types. Pattern-match combinators for the Pair
3437 constructor are pre-configured.
3439 * The 'fixrec' package now produces better fixed-point induction rules
3440 for mutually-recursive definitions: Induction rules have conclusions
3441 of the form "P foo bar" instead of "P <foo, bar>".
3443 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
3444 been renamed to "below". The name "below" now replaces "less" in many
3445 theorem names. (Legacy theorem names using "less" are still supported
3448 * The 'fixrec' package now supports "bottom patterns". Bottom
3449 patterns can be used to generate strictness rules, or to make
3450 functions more strict (much like the bang-patterns supported by the
3451 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
3457 * Support for Poly/ML 5.3.0, with improved reporting of compiler
3458 errors and run-time exceptions, including detailed source positions.
3460 * Structure Name_Space (formerly NameSpace) now manages uniquely
3461 identified entries, with some additional information such as source
3462 position, logical grouping etc.
3464 * Theory and context data is now introduced by the simplified and
3465 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
3466 to be pure, but the old TheoryDataFun for mutable data (with explicit
3467 copy operation) is still available for some time.
3469 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
3470 provides a high-level programming interface to synchronized state
3471 variables with atomic update. This works via pure function
3472 application within a critical section -- its runtime should be as
3473 short as possible; beware of deadlocks if critical code is nested,
3474 either directly or indirectly via other synchronized variables!
3476 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
3477 wraps raw ML references, explicitly indicating their non-thread-safe
3478 behaviour. The Isar toplevel keeps this structure open, to
3479 accommodate Proof General as well as quick and dirty interactive
3480 experiments with references.
3482 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
3483 parallel tactical reasoning.
3485 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
3486 are similar to SUBPROOF, but are slightly more flexible: only the
3487 specified parts of the subgoal are imported into the context, and the
3488 body tactic may introduce new subgoals and schematic variables.
3490 * Old tactical METAHYPS, which does not observe the proof context, has
3491 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
3492 or Subgoal.FOCUS etc.
3494 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
3495 functors have their own ML name space there is no point to mark them
3496 separately.) Minor INCOMPATIBILITY.
3498 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
3500 * Renamed several structures FooBar to Foo_Bar. Occasional,
3503 * Operations of structure Skip_Proof no longer require quick_and_dirty
3504 mode, which avoids critical setmp.
3506 * Eliminated old Attrib.add_attributes, Method.add_methods and related
3507 combinators for "args". INCOMPATIBILITY, need to use simplified
3508 Attrib/Method.setup introduced in Isabelle2009.
3510 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
3511 back on global_simpset_of, global_claset_of, global_clasimpset_of as
3512 last resort. INCOMPATIBILITY.
3514 * Display.pretty_thm now requires a proper context (cf. former
3515 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
3516 or even Display.pretty_thm_without_context as last resort.
3519 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
3520 Syntax.pretty_typ/term directly, preferably with proper context
3521 instead of global theory.
3526 * Further fine tuning of parallel proof checking, scales up to 8 cores
3527 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
3530 * Support for additional "Isabelle components" via etc/components, see
3531 also the system manual.
3533 * The isabelle makeall tool now operates on all components with
3534 IsaMakefile, not just hardwired "logics".
3536 * Removed "compress" option from isabelle-process and isabelle usedir;
3537 this is always enabled.
3539 * Discontinued support for Poly/ML 4.x versions.
3541 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
3542 on a given logic image. This requires the lighttpd webserver and is
3543 currently supported on Linux only.
3547 New in Isabelle2009 (April 2009)
3548 --------------------------------
3552 * Simplified main Isabelle executables, with less surprises on
3553 case-insensitive file-systems (such as Mac OS).
3555 - The main Isabelle tool wrapper is now called "isabelle" instead of
3558 - The former "isabelle" alias for "isabelle-process" has been
3559 removed (should rarely occur to regular users).
3561 - The former "isabelle-interface" and its alias "Isabelle" have been
3562 removed (interfaces are now regular Isabelle tools).
3564 Within scripts and make files, the Isabelle environment variables
3565 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
3566 respectively. (The latter are still available as legacy feature.)
3568 The old isabelle-interface wrapper could react in confusing ways if
3569 the interface was uninstalled or changed otherwise. Individual
3570 interface tool configuration is now more explicit, see also the
3571 Isabelle system manual. In particular, Proof General is now available
3572 via "isabelle emacs".
3574 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
3575 purge installed copies of Isabelle executables and re-run "isabelle
3576 install -p ...", or use symlinks.
3578 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
3579 old ~/isabelle, which was slightly non-standard and apt to cause
3580 surprises on case-insensitive file-systems (such as Mac OS).
3582 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
3583 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
3584 care is required when using older releases of Isabelle. Note that
3585 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
3586 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
3588 * Proofs of fully specified statements are run in parallel on
3589 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
3590 a regular 4-core machine, if the initial heap space is made reasonably
3591 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
3593 * The main reference manuals ("isar-ref", "implementation", and
3594 "system") have been updated and extended. Formally checked references
3595 as hyperlinks are now available uniformly.
3600 * Complete re-implementation of locales. INCOMPATIBILITY in several
3601 respects. The most important changes are listed below. See the
3602 Tutorial on Locales ("locales" manual) for details.
3604 - In locale expressions, instantiation replaces renaming. Parameters
3605 must be declared in a for clause. To aid compatibility with previous
3606 parameter inheritance, in locale declarations, parameters that are not
3607 'touched' (instantiation position "_" or omitted) are implicitly added
3608 with their syntax at the beginning of the for clause.
3610 - Syntax from abbreviations and definitions in locales is available in
3611 locale expressions and context elements. The latter is particularly
3612 useful in locale declarations.
3614 - More flexible mechanisms to qualify names generated by locale
3615 expressions. Qualifiers (prefixes) may be specified in locale
3616 expressions, and can be marked as mandatory (syntax: "name!:") or
3617 optional (syntax "name?:"). The default depends for plain "name:"
3618 depends on the situation where a locale expression is used: in
3619 commands 'locale' and 'sublocale' prefixes are optional, in
3620 'interpretation' and 'interpret' prefixes are mandatory. The old
3621 implicit qualifiers derived from the parameter names of a locale are
3622 no longer generated.
3624 - Command "sublocale l < e" replaces "interpretation l < e". The
3625 instantiation clause in "interpretation" and "interpret" (square
3626 brackets) is no longer available. Use locale expressions.
3628 - When converting proof scripts, mandatory qualifiers in
3629 'interpretation' and 'interpret' should be retained by default, even
3630 if this is an INCOMPATIBILITY compared to former behavior. In the
3631 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
3632 in locale expressions range over a single locale instance only.
3634 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
3635 In existing theorem specifications replace the includes element by the
3636 respective context elements of the included locale, omitting those
3637 that are already present in the theorem specification. Multiple
3638 assume elements of a locale should be replaced by a single one
3639 involving the locale predicate. In the proof body, declarations (most
3640 notably theorems) may be regained by interpreting the respective
3641 locales in the proof context as required (command "interpret").
3643 If using "includes" in replacement of a target solely because the
3644 parameter types in the theorem are not as general as in the target,
3645 consider declaring a new locale with additional type constraints on
3646 the parameters (context element "constrains").
3648 - Discontinued "locale (open)". INCOMPATIBILITY.
3650 - Locale interpretation commands no longer attempt to simplify goal.
3651 INCOMPATIBILITY: in rare situations the generated goal differs. Use
3652 methods intro_locales and unfold_locales to clarify.
3654 - Locale interpretation commands no longer accept interpretation
3655 attributes. INCOMPATIBILITY.
3657 * Class declaration: so-called "base sort" must not be given in import
3658 list any longer, but is inferred from the specification. Particularly
3665 class foo = type + ...
3667 * Class target: global versions of theorems stemming do not carry a
3668 parameter prefix any longer. INCOMPATIBILITY.
3670 * Class 'instance' command no longer accepts attached definitions.
3671 INCOMPATIBILITY, use proper 'instantiation' target instead.
3673 * Recovered hiding of consts, which was accidentally broken in
3674 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
3675 makes c inaccessible; consider using ``hide (open) const c'' instead.
3677 * Slightly more coherent Pure syntax, with updated documentation in
3678 isar-ref manual. Removed locales meta_term_syntax and
3679 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
3680 INCOMPATIBILITY in rare situations. Note that &&& should not be used
3681 directly in regular applications.
3683 * There is a new syntactic category "float_const" for signed decimal
3684 fractions (e.g. 123.45 or -123.45).
3686 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
3687 interface with 'setup' command instead.
3689 * Command 'local_setup' is similar to 'setup', but operates on a local
3692 * The 'axiomatization' command now only works within a global theory
3693 context. INCOMPATIBILITY.
3695 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
3696 hypotheses. Sorts required in the course of reasoning need to be
3697 covered by the constraints in the initial statement, completed by the
3698 type instance information of the background theory. Non-trivial sort
3699 hypotheses, which rarely occur in practice, may be specified via
3700 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
3702 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
3704 The result contains an implicit sort hypotheses as before --
3705 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
3708 * Generalized Isar history, with support for linear undo, direct state
3711 * Changed defaults for unify configuration options:
3713 unify_trace_bound = 50 (formerly 25)
3714 unify_search_bound = 60 (formerly 30)
3716 * Different bookkeeping for code equations (INCOMPATIBILITY):
3718 a) On theory merge, the last set of code equations for a particular
3719 constant is taken (in accordance with the policy applied by other
3720 parts of the code generator framework).
3722 b) Code equations stemming from explicit declarations (e.g. code
3723 attribute) gain priority over default code equations stemming
3724 from definition, primrec, fun etc.
3726 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
3728 * Unified theorem tables for both code generators. Thus [code
3729 func] has disappeared and only [code] remains. INCOMPATIBILITY.
3731 * Command 'find_consts' searches for constants based on type and name
3734 find_consts "_ => bool"
3736 By default, matching is against subtypes, but it may be restricted to
3737 the whole type. Searching by name is possible. Multiple queries are
3738 conjunctive and queries may be negated by prefixing them with a
3741 find_consts strict: "_ => bool" name: "Int" -"int => int"
3743 * New 'find_theorems' criterion "solves" matches theorems that
3744 directly solve the current goal (modulo higher-order unification).
3746 * Auto solve feature for main theorem statements: whenever a new goal
3747 is stated, "find_theorems solves" is called; any theorems that could
3748 solve the lemma directly are listed as part of the goal state.
3749 Cf. associated options in Proof General Isabelle settings menu,
3750 enabled by default, with reasonable timeout for pathological cases of
3751 higher-order unification.
3754 *** Document preparation ***
3756 * Antiquotation @{lemma} now imitates a regular terminal proof,
3757 demanding keyword 'by' and supporting the full method expression
3758 syntax just like the Isar command 'by'.
3763 * Integrated main parts of former image HOL-Complex with HOL. Entry
3764 points Main and Complex_Main remain as before.
3766 * Logic image HOL-Plain provides a minimal HOL with the most important
3767 tools available (inductive, datatype, primrec, ...). This facilitates
3768 experimentation and tool development. Note that user applications
3769 (and library theories) should never refer to anything below theory
3772 * Logic image HOL-Main stops at theory Main, and thus facilitates
3773 experimentation due to shorter build times.
3775 * Logic image HOL-NSA contains theories of nonstandard analysis which
3776 were previously part of former HOL-Complex. Entry point Hyperreal
3777 remains valid, but theories formerly using Complex_Main should now use
3778 new entry point Hypercomplex.
3780 * Generic ATP manager for Sledgehammer, based on ML threads instead of
3781 Posix processes. Avoids potentially expensive forking of the ML
3782 process. New thread-based implementation also works on non-Unix
3783 platforms (Cygwin). Provers are no longer hardwired, but defined
3784 within the theory via plain ML wrapper functions. Basic Sledgehammer
3785 commands are covered in the isar-ref manual.
3787 * Wrapper scripts for remote SystemOnTPTP service allows to use
3788 sledgehammer without local ATP installation (Vampire etc.). Other
3789 provers may be included via suitable ML wrappers, see also
3790 src/HOL/ATP_Linkup.thy.
3792 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
3795 * The metis method no longer fails because the theorem is too trivial
3796 (contains the empty clause).
3798 * The metis method now fails in the usual manner, rather than raising
3799 an exception, if it determines that it cannot prove the theorem.
3801 * Method "coherent" implements a prover for coherent logic (see also
3802 src/Tools/coherent.ML).
3804 * Constants "undefined" and "default" replace "arbitrary". Usually
3805 "undefined" is the right choice to replace "arbitrary", though
3806 logically there is no difference. INCOMPATIBILITY.
3808 * Command "value" now integrates different evaluation mechanisms. The
3809 result of the first successful evaluation mechanism is printed. In
3810 square brackets a particular named evaluation mechanisms may be
3811 specified (currently, [SML], [code] or [nbe]). See further
3812 src/HOL/ex/Eval_Examples.thy.
3814 * Normalization by evaluation now allows non-leftlinear equations.
3815 Declare with attribute [code nbe].
3817 * Methods "case_tac" and "induct_tac" now refer to the very same rules
3818 as the structured Isar versions "cases" and "induct", cf. the
3819 corresponding "cases" and "induct" attributes. Mutual induction rules
3820 are now presented as a list of individual projections
3821 (e.g. foo_bar.inducts for types foo and bar); the old format with
3822 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
3823 rare situations a different rule is selected --- notably nested tuple
3824 elimination instead of former prod.exhaust: use explicit (case_tac t
3825 rule: prod.exhaust) here.
3827 * Attributes "cases", "induct", "coinduct" support "del" option.
3829 * Removed fact "case_split_thm", which duplicates "case_split".
3831 * The option datatype has been moved to a new theory Option. Renamed
3832 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
3834 * New predicate "strict_mono" classifies strict functions on partial
3835 orders. With strict functions on linear orders, reasoning about
3836 (in)equalities is facilitated by theorems "strict_mono_eq",
3837 "strict_mono_less_eq" and "strict_mono_less".
3839 * Some set operations are now proper qualified constants with
3840 authentic syntax. INCOMPATIBILITY:
3851 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
3854 * Auxiliary class "itself" has disappeared -- classes without any
3855 parameter are treated as expected by the 'class' command.
3857 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
3859 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
3860 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
3862 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
3863 method "approximation". It proves formulas on real values by using
3864 interval arithmetic. In the formulas are also the transcendental
3865 functions sin, cos, tan, atan, ln, exp and the constant pi are
3866 allowed. For examples see
3867 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
3869 * Theory "Reflection" now resides in HOL/Library.
3871 * Entry point to Word library now simply named "Word".
3874 * Made source layout more coherent with logical distribution
3877 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
3878 src/HOL/Library/Code_Message.thy ~> src/HOL/
3879 src/HOL/Library/GCD.thy ~> src/HOL/
3880 src/HOL/Library/Order_Relation.thy ~> src/HOL/
3881 src/HOL/Library/Parity.thy ~> src/HOL/
3882 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
3883 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
3884 src/HOL/Real/Lubs.thy ~> src/HOL/
3885 src/HOL/Real/PReal.thy ~> src/HOL/
3886 src/HOL/Real/Rational.thy ~> src/HOL/
3887 src/HOL/Real/RComplete.thy ~> src/HOL/
3888 src/HOL/Real/RealDef.thy ~> src/HOL/
3889 src/HOL/Real/RealPow.thy ~> src/HOL/
3890 src/HOL/Real/Real.thy ~> src/HOL/
3891 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
3892 src/HOL/Complex/Complex.thy ~> src/HOL/
3893 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
3894 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
3895 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
3896 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
3897 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
3898 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
3899 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
3900 src/HOL/Hyperreal/Log.thy ~> src/HOL/
3901 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
3902 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
3903 src/HOL/Hyperreal/Series.thy ~> src/HOL/
3904 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
3905 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
3906 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
3907 src/HOL/Real/Float ~> src/HOL/Library/
3908 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
3909 src/HOL/Real/RealVector.thy ~> src/HOL/
3911 src/HOL/arith_data.ML ~> src/HOL/Tools
3912 src/HOL/hologic.ML ~> src/HOL/Tools
3913 src/HOL/simpdata.ML ~> src/HOL/Tools
3914 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
3915 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
3916 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
3917 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
3918 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
3919 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
3920 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
3922 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
3923 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
3924 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
3925 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
3926 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
3927 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
3929 * If methods "eval" and "evaluation" encounter a structured proof
3930 state with !!/==>, only the conclusion is evaluated to True (if
3931 possible), avoiding strange error messages.
3933 * Method "sizechange" automates termination proofs using (a
3934 modification of) the size-change principle. Requires SAT solver. See
3935 src/HOL/ex/Termination.thy for examples.
3937 * Simplifier: simproc for let expressions now unfolds if bound
3938 variable occurs at most once in let expression body. INCOMPATIBILITY.
3940 * Method "arith": Linear arithmetic now ignores all inequalities when
3941 fast_arith_neq_limit is exceeded, instead of giving up entirely.
3943 * New attribute "arith" for facts that should always be used
3944 automatically by arithmetic. It is intended to be used locally in
3947 assumes [arith]: "x > 0"
3949 Global usage is discouraged because of possible performance impact.
3951 * New classes "top" and "bot" with corresponding operations "top" and
3952 "bot" in theory Orderings; instantiation of class "complete_lattice"
3953 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
3955 * Changed definition lemma "less_fun_def" in order to provide an
3956 instance for preorders on functions; use lemma "less_le" instead.
3959 * Theory Orderings: class "wellorder" moved here, with explicit
3960 induction rule "less_induct" as assumption. For instantiation of
3961 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
3964 * Theory Orderings: added class "preorder" as superclass of "order".
3965 INCOMPATIBILITY: Instantiation proofs for order, linorder
3966 etc. slightly changed. Some theorems named order_class.* now named
3969 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
3972 * Theory Finite_Set: added a new fold combinator of type
3974 ('a => 'b => 'b) => 'b => 'a set => 'b
3976 Occasionally this is more convenient than the old fold combinator
3977 which is now defined in terms of the new one and renamed to
3980 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
3981 and "ring_simps" have been replaced by "algebra_simps" (which can be
3982 extended with further lemmas!). At the moment both still exist but
3983 the former will disappear at some point.
3985 * Theory Power: Lemma power_Suc is now declared as a simp rule in
3986 class recpower. Type-specific simp rules for various recpower types
3987 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
3989 rat_power_0 -> power_0
3990 rat_power_Suc -> power_Suc
3991 realpow_0 -> power_0
3992 realpow_Suc -> power_Suc
3993 complexpow_0 -> power_0
3994 complexpow_Suc -> power_Suc
3995 power_poly_0 -> power_0
3996 power_poly_Suc -> power_Suc
3998 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
3999 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
4000 dvd has been generalized to class comm_semiring_1. Likewise a bunch
4001 of lemmas from Divides has been generalized from nat to class
4002 semiring_div. INCOMPATIBILITY. This involves the following theorem
4003 renames resulting from duplicate elimination:
4005 dvd_def_mod ~> dvd_eq_mod_eq_0
4006 zero_dvd_iff ~> dvd_0_left_iff
4007 dvd_0 ~> dvd_0_right
4008 DIVISION_BY_ZERO_DIV ~> div_by_0
4009 DIVISION_BY_ZERO_MOD ~> mod_by_0
4010 mult_div ~> div_mult_self2_is_id
4011 mult_mod ~> mod_mult_self2_is_0
4013 * Theory IntDiv: removed many lemmas that are instances of class-based
4014 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
4015 rename old lemmas as follows:
4017 dvd_diff -> nat_dvd_diff
4018 dvd_zminus_iff -> dvd_minus_iff
4019 mod_add1_eq -> mod_add_eq
4020 mod_mult1_eq -> mod_mult_right_eq
4021 mod_mult1_eq' -> mod_mult_left_eq
4022 mod_mult_distrib_mod -> mod_mult_eq
4023 nat_mod_add_left_eq -> mod_add_left_eq
4024 nat_mod_add_right_eq -> mod_add_right_eq
4025 nat_mod_div_trivial -> mod_div_trivial
4026 nat_mod_mod_trivial -> mod_mod_trivial
4027 zdiv_zadd_self1 -> div_add_self1
4028 zdiv_zadd_self2 -> div_add_self2
4029 zdiv_zmult_self1 -> div_mult_self2_is_id
4030 zdiv_zmult_self2 -> div_mult_self1_is_id
4031 zdvd_triv_left -> dvd_triv_left
4032 zdvd_triv_right -> dvd_triv_right
4033 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
4034 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
4035 zmod_zadd_left_eq -> mod_add_left_eq
4036 zmod_zadd_right_eq -> mod_add_right_eq
4037 zmod_zadd_self1 -> mod_add_self1
4038 zmod_zadd_self2 -> mod_add_self2
4039 zmod_zadd1_eq -> mod_add_eq
4040 zmod_zdiff1_eq -> mod_diff_eq
4041 zmod_zdvd_zmod -> mod_mod_cancel
4042 zmod_zmod_cancel -> mod_mod_cancel
4043 zmod_zmult_self1 -> mod_mult_self2_is_0
4044 zmod_zmult_self2 -> mod_mult_self1_is_0
4047 zdvd_abs1 -> abs_dvd_iff
4048 zdvd_abs2 -> dvd_abs_iff
4049 zdvd_refl -> dvd_refl
4050 zdvd_trans -> dvd_trans
4051 zdvd_zadd -> dvd_add
4052 zdvd_zdiff -> dvd_diff
4053 zdvd_zminus_iff -> dvd_minus_iff
4054 zdvd_zminus2_iff -> minus_dvd_iff
4055 zdvd_zmultD -> dvd_mult_right
4056 zdvd_zmultD2 -> dvd_mult_left
4057 zdvd_zmult_mono -> mult_dvd_mono
4058 zdvd_0_right -> dvd_0_right
4059 zdvd_0_left -> dvd_0_left_iff
4060 zdvd_1_left -> one_dvd
4061 zminus_dvd_iff -> minus_dvd_iff
4063 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
4065 * The real numbers offer decimal input syntax: 12.34 is translated
4066 into 1234/10^2. This translation is not reversed upon output.
4068 * Theory Library/Polynomial defines an abstract type 'a poly of
4069 univariate polynomials with coefficients of type 'a. In addition to
4070 the standard ring operations, it also supports div and mod. Code
4071 generation is also supported, using list-style constructors.
4073 * Theory Library/Inner_Product defines a class of real_inner for real
4074 inner product spaces, with an overloaded operation inner :: 'a => 'a
4075 => real. Class real_inner is a subclass of real_normed_vector from
4078 * Theory Library/Product_Vector provides instances for the product
4079 type 'a * 'b of several classes from RealVector and Inner_Product.
4080 Definitions of addition, subtraction, scalar multiplication, norms,
4081 and inner products are included.
4083 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
4084 addition to the field operations, numerals and case syntax are also
4087 * Theory Library/Diagonalize provides constructive version of Cantor's
4088 first diagonalization argument.
4090 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
4091 zlcm (for int); carried together from various gcd/lcm developements in
4092 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
4093 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
4094 may recover tupled syntax as follows:
4096 hide (open) const gcd
4097 abbreviation gcd where
4098 "gcd == (%(a, b). GCD.gcd a b)"
4100 GCD.gcd ("gcd '(_, _')")
4102 The same works for lcm, zgcd, zlcm.
4104 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
4105 instantiations for algebraic structures. Removed some duplicate
4106 theorems. Changes in simp rules. INCOMPATIBILITY.
4108 * ML antiquotation @{code} takes a constant as argument and generates
4109 corresponding code in background and inserts name of the corresponding
4110 resulting ML value/function/datatype constructor binding in place.
4111 All occurrences of @{code} with a single ML block are generated
4112 simultaneously. Provides a generic and safe interface for
4113 instrumentalizing code generation. See
4114 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
4115 In future you ought to refrain from ad-hoc compiling generated SML
4116 code on the ML toplevel. Note that (for technical reasons) @{code}
4117 cannot refer to constants for which user-defined serializations are
4118 set. Refer to the corresponding ML counterpart directly in that
4121 * Command 'rep_datatype': instead of theorem names the command now
4122 takes a list of terms denoting the constructors of the type to be
4123 represented as datatype. The characteristic theorems have to be
4124 proven. INCOMPATIBILITY. Also observe that the following theorems
4125 have disappeared in favour of existing ones:
4127 unit_induct ~> unit.induct
4128 prod_induct ~> prod.induct
4129 sum_induct ~> sum.induct
4130 Suc_Suc_eq ~> nat.inject
4131 Suc_not_Zero Zero_not_Suc ~> nat.distinct
4136 * New locales for orders and lattices where the equivalence relation
4137 is not restricted to equality. INCOMPATIBILITY: all order and lattice
4138 locales use a record structure with field eq for the equivalence.
4140 * New theory of factorial domains.
4142 * Units_l_inv and Units_r_inv are now simp rules by default.
4143 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
4144 and/or r_inv will now also require deletion of these lemmas.
4146 * Renamed the following theorems, INCOMPATIBILITY:
4148 UpperD ~> Upper_memD
4149 LowerD ~> Lower_memD
4150 least_carrier ~> least_closed
4151 greatest_carrier ~> greatest_closed
4152 greatest_Lower_above ~> greatest_Lower_below
4153 one_zero ~> carrier_one_zero
4154 one_not_zero ~> carrier_one_not_zero (collision with assumption)
4159 * Nominal datatypes can now contain type-variables.
4161 * Commands 'nominal_inductive' and 'equivariance' work with local
4164 * Nominal primrec can now works with local theory targets and its
4165 specification syntax now conforms to the general format as seen in
4168 * Method "perm_simp" honours the standard simplifier attributes
4169 (no_asm), (no_asm_use) etc.
4171 * The new predicate #* is defined like freshness, except that on the
4172 left hand side can be a set or list of atoms.
4174 * Experimental command 'nominal_inductive2' derives strong induction
4175 principles for inductive definitions. In contrast to
4176 'nominal_inductive', which can only deal with a fixed number of
4177 binders, it can deal with arbitrary expressions standing for sets of
4178 atoms to be avoided. The only inductive definition we have at the
4179 moment that needs this generalisation is the typing rule for Lets in
4182 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
4183 -----------------------------------------------------------------
4184 Gamma |- Let x be t1 in t2 : T2
4186 In this rule one wants to avoid all the binders that are introduced by
4187 "close Gamma T1". We are looking for other examples where this
4188 feature might be useful. Please let us know.
4193 * Reimplemented the simplification procedure for proving continuity
4194 subgoals. The new simproc is extensible; users can declare additional
4195 continuity introduction rules with the attribute [cont2cont].
4197 * The continuity simproc now uses a different introduction rule for
4198 solving continuity subgoals on terms with lambda abstractions. In
4199 some rare cases the new simproc may fail to solve subgoals that the
4200 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
4201 Potential INCOMPATIBILITY.
4203 * Command 'fixrec': specification syntax now conforms to the general
4204 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
4205 examples. INCOMPATIBILITY.
4210 * Proof of Zorn's Lemma for partial orders.
4215 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
4216 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
4217 depends on multithreading, so timouts will not work before Poly/ML
4220 * High-level support for concurrent ML programming, see
4221 src/Pure/Cuncurrent. The data-oriented model of "future values" is
4222 particularly convenient to organize independent functional
4223 computations. The concept of "synchronized variables" provides a
4224 higher-order interface for components with shared state, avoiding the
4225 delicate details of mutexes and condition variables. (Requires
4226 Poly/ML 5.2.1 or later.)
4228 * ML bindings produced via Isar commands are stored within the Isar
4229 context (theory or proof). Consequently, commands like 'use' and 'ML'
4230 become thread-safe and work with undo as expected (concerning
4231 top-level bindings, not side-effects on global references).
4232 INCOMPATIBILITY, need to provide proper Isar context when invoking the
4233 compiler at runtime; really global bindings need to be given outside a
4234 theory. (Requires Poly/ML 5.2 or later.)
4236 * Command 'ML_prf' is analogous to 'ML' but works within a proof
4237 context. Top-level ML bindings are stored within the proof context in
4238 a purely sequential fashion, disregarding the nested proof structure.
4239 ML bindings introduced by 'ML_prf' are discarded at the end of the
4240 proof. (Requires Poly/ML 5.2 or later.)
4242 * Simplified ML attribute and method setup, cf. functions Attrib.setup
4243 and Method.setup, as well as Isar commands 'attribute_setup' and
4244 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
4245 existing code accordingly, or use plain 'setup' together with old
4248 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
4249 to 'a -> thm, while results are always tagged with an authentic oracle
4250 name. The Isar command 'oracle' is now polymorphic, no argument type
4251 is specified. INCOMPATIBILITY, need to simplify existing oracle code
4252 accordingly. Note that extra performance may be gained by producing
4253 the cterm carefully, avoiding slow Thm.cterm_of.
4255 * Simplified interface for defining document antiquotations via
4256 ThyOutput.antiquotation, ThyOutput.output, and optionally
4257 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
4258 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
4261 * More systematic treatment of long names, abstract name bindings, and
4262 name space operations. Basic operations on qualified names have been
4263 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
4264 Long_Name.append. Old type bstring has been mostly replaced by
4265 abstract type binding (see structure Binding), which supports precise
4266 qualification by packages and local theory targets, as well as proper
4267 tracking of source positions. INCOMPATIBILITY, need to wrap old
4268 bstring values into Binding.name, or better pass through abstract
4269 bindings everywhere. See further src/Pure/General/long_name.ML,
4270 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
4272 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
4273 LocalTheory.note etc.) now refer to the *full* internal name, not the
4274 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
4276 * Disposed old type and term read functions (Sign.read_def_typ,
4277 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
4278 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
4279 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
4280 Syntax.read_term_global etc.; see also OldGoals.read_term as last
4281 resort for legacy applications.
4283 * Disposed old declarations, tactics, tactic combinators that refer to
4284 the simpset or claset of an implicit theory (such as Addsimps,
4285 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
4286 embedded ML text, or local_simpset_of with a proper context passed as
4287 explicit runtime argument.
4289 * Rules and tactics that read instantiations (read_instantiate,
4290 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
4291 context, which is required for parsing and type-checking. Moreover,
4292 the variables are specified as plain indexnames, not string encodings
4293 thereof. INCOMPATIBILITY.
4295 * Generic Toplevel.add_hook interface allows to analyze the result of
4296 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
4297 for theorem dependency output of transactions resulting in a new
4300 * ML antiquotations: block-structured compilation context indicated by
4301 \<lbrace> ... \<rbrace>; additional antiquotation forms:
4303 @{binding name} - basic name binding
4304 @{let ?pat = term} - term abbreviation (HO matching)
4305 @{note name = fact} - fact abbreviation
4306 @{thm fact} - singleton fact (with attributes)
4307 @{thms fact} - general fact (with attributes)
4308 @{lemma prop by method} - singleton goal
4309 @{lemma prop by meth1 meth2} - singleton goal
4310 @{lemma prop1 ... propN by method} - general goal
4311 @{lemma prop1 ... propN by meth1 meth2} - general goal
4312 @{lemma (open) ...} - open derivation
4317 * The Isabelle "emacs" tool provides a specific interface to invoke
4318 Proof General / Emacs, with more explicit failure if that is not
4319 installed (the old isabelle-interface script silently falls back on
4320 isabelle-process). The PROOFGENERAL_HOME setting determines the
4321 installation location of the Proof General distribution.
4323 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
4324 the Isabelle process into a JVM/Scala application. See
4325 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
4326 process wrapper has been discontinued.)
4328 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
4330 * Various status messages (with exact source position information) are
4331 emitted, if proper markup print mode is enabled. This allows
4332 user-interface components to provide detailed feedback on internal
4337 New in Isabelle2008 (June 2008)
4338 -------------------------------
4342 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
4343 and updated, with formally checked references as hyperlinks.
4345 * Theory loader: use_thy (and similar operations) no longer set the
4346 implicit ML context, which was occasionally hard to predict and in
4347 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
4348 provides a proper context already.
4350 * Theory loader: old-style ML proof scripts being *attached* to a thy
4351 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
4352 'use' within a theory file will do the job.
4354 * Name space merge now observes canonical order, i.e. the second space
4355 is inserted into the first one, while existing entries in the first
4356 space take precedence. INCOMPATIBILITY in rare situations, may try to
4357 swap theory imports.
4359 * Syntax: symbol \<chi> is now considered a letter. Potential
4360 INCOMPATIBILITY in identifier syntax etc.
4362 * Outer syntax: string tokens no longer admit escaped white space,
4363 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
4364 white space without escapes.
4366 * Outer syntax: string tokens may contain arbitrary character codes
4367 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
4373 * Context-dependent token translations. Default setup reverts locally
4374 fixed variables, and adds hilite markup for undeclared frees.
4376 * Unused theorems can be found using the new command 'unused_thms'.
4377 There are three ways of invoking it:
4380 Only finds unused theorems in the current theory.
4382 (2) unused_thms thy_1 ... thy_n -
4383 Finds unused theorems in the current theory and all of its ancestors,
4384 excluding the theories thy_1 ... thy_n and all of their ancestors.
4386 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
4387 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
4388 their ancestors, excluding the theories thy_1 ... thy_n and all of
4391 In order to increase the readability of the list produced by
4392 unused_thms, theorems that have been created by a particular instance
4393 of a theory command such as 'inductive' or 'function' are considered
4394 to belong to the same "group", meaning that if at least one theorem in
4395 this group is used, the other theorems in the same group are no longer
4396 reported as unused. Moreover, if all theorems in the group are
4397 unused, only one theorem in the group is displayed.
4399 Note that proof objects have to be switched on in order for
4400 unused_thms to work properly (i.e. !proofs must be >= 1, which is
4401 usually the case when using Proof General with the default settings).
4403 * Authentic naming of facts disallows ad-hoc overwriting of previous
4404 theorems within the same name space. INCOMPATIBILITY, need to remove
4405 duplicate fact bindings, or even accidental fact duplications. Note
4406 that tools may maintain dynamically scoped facts systematically, using
4407 PureThy.add_thms_dynamic.
4409 * Command 'hide' now allows to hide from "fact" name space as well.
4411 * Eliminated destructive theorem database, simpset, claset, and
4412 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
4413 update of theories within ML code.
4415 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
4416 INCOMPATIBILITY, object-logics depending on former Pure require
4417 additional setup PureThy.old_appl_syntax_setup; object-logics
4418 depending on former CPure need to refer to Pure.
4420 * Commands 'use' and 'ML' are now purely functional, operating on
4421 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
4422 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
4425 * Command 'setup': discontinued implicit version with ML reference.
4427 * Instantiation target allows for simultaneous specification of class
4428 instance operations together with an instantiation proof.
4429 Type-checking phase allows to refer to class operations uniformly.
4430 See src/HOL/Complex/Complex.thy for an Isar example and
4431 src/HOL/Library/Eval.thy for an ML example.
4433 * Indexing of literal facts: be more serious about including only
4434 facts from the visible specification/proof context, but not the
4435 background context (locale etc.). Affects `prop` notation and method
4436 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
4439 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
4440 "(open)" option, which used to expose internal bound variables to the
4443 * Isar statements: removed obsolete case "rule_context".
4444 INCOMPATIBILITY, better use explicit fixes/assumes.
4446 * Locale proofs: default proof step now includes 'unfold_locales';
4447 hence 'proof' without argument may be used to unfold locale
4451 *** Document preparation ***
4453 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
4454 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
4455 obsolete thumbpdf setup (contemporary PDF viewers do this on the
4456 spot); renamed link color from "darkblue" to "linkcolor" (default
4457 value unchanged, can be redefined via \definecolor); no longer sets
4458 "a4paper" option (unnecessary or even intrusive).
4460 * Antiquotation @{lemma A method} proves proposition A by the given
4461 method (either a method name or a method name plus (optional) method
4462 arguments in parentheses) and prints A just like @{prop A}.
4467 * New primrec package. Specification syntax conforms in style to
4468 definition/function/.... No separate induction rule is provided. The
4469 "primrec" command distinguishes old-style and new-style specifications
4470 by syntax. The former primrec package is now named OldPrimrecPackage.
4471 When adjusting theories, beware: constants stemming from new-style
4472 primrec specifications have authentic syntax.
4474 * Metis prover is now an order of magnitude faster, and also works
4475 with multithreading.
4477 * Metis: the maximum number of clauses that can be produced from a
4478 theorem is now given by the attribute max_clauses. Theorems that
4479 exceed this number are ignored, with a warning printed.
4481 * Sledgehammer no longer produces structured proofs by default. To
4482 enable, declare [[sledgehammer_full = true]]. Attributes
4483 reconstruction_modulus, reconstruction_sorts renamed
4484 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
4486 * Method "induct_scheme" derives user-specified induction rules
4487 from well-founded induction and completeness of patterns. This factors
4488 out some operations that are done internally by the function package
4489 and makes them available separately. See
4490 src/HOL/ex/Induction_Scheme.thy for examples.
4492 * More flexible generation of measure functions for termination
4493 proofs: Measure functions can be declared by proving a rule of the
4494 form "is_measure f" and giving it the [measure_function] attribute.
4495 The "is_measure" predicate is logically meaningless (always true), and
4496 just guides the heuristic. To find suitable measure functions, the
4497 termination prover sets up the goal "is_measure ?f" of the appropriate
4498 type and generates all solutions by prolog-style backwards proof using
4501 This setup also deals with rules like
4503 "is_measure f ==> is_measure (list_size f)"
4505 which accommodates nested datatypes that recurse through lists.
4506 Similar rules are predeclared for products and option types.
4508 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
4512 - Definitions of overloaded constants on sets have to be replaced by
4513 definitions on => and bool.
4515 - Some definitions of overloaded operators on sets can now be proved
4516 using the definitions of the operators on => and bool. Therefore,
4517 the following theorems have been renamed:
4519 subset_def -> subset_eq
4520 psubset_def -> psubset_eq
4521 set_diff_def -> set_diff_eq
4522 Compl_def -> Compl_eq
4523 Sup_set_def -> Sup_set_eq
4524 Inf_set_def -> Inf_set_eq
4525 sup_set_def -> sup_set_eq
4526 inf_set_def -> inf_set_eq
4528 - Due to the incompleteness of the HO unification algorithm, some
4529 rules such as subst may require manual instantiation, if some of
4530 the unknowns in the rule is a set.
4532 - Higher order unification and forward proofs:
4535 have "P (S::'a set)" <...>
4536 then have "EX S. P S" ..
4538 no longer works (due to the incompleteness of the HO unification
4539 algorithm) and must be replaced by the pattern
4546 - Calculational reasoning with subst (or similar rules):
4549 have "P (S::'a set)" <...>
4550 also have "S = T" <...>
4551 finally have "P T" .
4553 no longer works (for similar reasons as the previous example) and
4554 must be replaced by something like
4556 have "P (S::'a set)" <...>
4557 moreover have "S = T" <...>
4558 ultimately have "P T" by simp
4560 - Tactics or packages written in ML code:
4561 Code performing pattern matching on types via
4563 Type ("set", [T]) => ...
4565 must be rewritten. Moreover, functions like strip_type or
4566 binder_types no longer return the right value when applied to a
4569 T1 => ... => Tn => U => bool
4573 T1 => ... => Tn => U set
4575 * Merged theories Wellfounded_Recursion, Accessible_Part and
4576 Wellfounded_Relations to theory Wellfounded.
4578 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
4580 * Class finite no longer treats UNIV as class parameter. Use class
4581 enum from theory Library/Enum instead to achieve a similar effect.
4584 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
4585 and "Cons". INCOMPATIBILITY.
4587 * HOL (and FOL): renamed variables in rules imp_elim and swap.
4588 Potential INCOMPATIBILITY.
4590 * Theory Product_Type: duplicated lemmas split_Pair_apply and
4591 injective_fst_snd removed, use split_eta and prod_eqI instead.
4592 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
4594 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
4595 the same name in theory Orderings:
4605 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
4606 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
4607 and different variable names.
4609 * Library/Option_ord.thy: Canonical order on option type.
4611 * Library/RBT.thy: Red-black trees, an efficient implementation of
4614 * Library/Countable.thy: Type class for countable types.
4616 * Theory Int: The representation of numerals has changed. The infix
4617 operator BIT and the bit datatype with constructors B0 and B1 have
4618 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
4619 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
4620 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
4623 * Theory Nat: definition of <= and < on natural numbers no longer
4624 depend on well-founded relations. INCOMPATIBILITY. Definitions
4625 le_def and less_def have disappeared. Consider lemmas not_less
4626 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
4628 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
4629 (whose purpose mainly is for various fold_set functionals) have been
4630 abandoned in favor of the existing algebraic classes
4631 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
4632 lower_semilattice (resp. upper_semilattice) and linorder.
4635 * Theory Transitive_Closure: induct and cases rules now declare proper
4636 case_names ("base" and "step"). INCOMPATIBILITY.
4638 * Theorem Inductive.lfp_ordinal_induct generalized to complete
4639 lattices. The form set-specific version is available as
4640 Inductive.lfp_ordinal_induct_set.
4642 * Renamed theorems "power.simps" to "power_int.simps".
4645 * Class semiring_div provides basic abstract properties of semirings
4646 with division and modulo operations. Subsumes former class dvd_mod.
4648 * Merged theories IntDef, Numeral and IntArith into unified theory
4649 Int. INCOMPATIBILITY.
4651 * Theory Library/Code_Index: type "index" now represents natural
4652 numbers rather than integers. INCOMPATIBILITY.
4654 * New class "uminus" with operation "uminus" (split of from class
4655 "minus" which now only has operation "minus", binary).
4658 * Constants "card", "internal_split", "option_map" now with authentic
4659 syntax. INCOMPATIBILITY.
4661 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
4662 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
4663 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
4664 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
4665 Sup_set_def, le_def, less_def, option_map_def now with object
4666 equality. INCOMPATIBILITY.
4668 * Records. Removed K_record, and replaced it by pure lambda term
4669 %x. c. The simplifier setup is now more robust against eta expansion.
4670 INCOMPATIBILITY: in cases explicitly referring to K_record.
4672 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
4674 * Library/ListVector: new theory of arithmetic vector operations.
4676 * Library/Order_Relation: new theory of various orderings as sets of
4677 pairs. Defines preorders, partial orders, linear orders and
4678 well-orders on sets and on types.
4683 * Renamed some theories to allow to loading both ZF and HOL in the
4686 Datatype -> Datatype_ZF
4687 Inductive -> Inductive_ZF
4694 INCOMPATIBILITY: ZF theories that import individual theories below
4695 Main might need to be adapted. Regular theory Main is still
4696 available, as trivial extension of Main_ZF.
4701 * ML within Isar: antiquotation @{const name} or @{const
4702 name(typargs)} produces statically-checked Const term.
4704 * Functor NamedThmsFun: data is available to the user as dynamic fact
4705 (of the same name). Removed obsolete print command.
4707 * Removed obsolete "use_legacy_bindings" function.
4709 * The ``print mode'' is now a thread-local value derived from a global
4710 template (the former print_mode reference), thus access becomes
4711 non-critical. The global print_mode reference is for session
4712 management only; user-code should use print_mode_value,
4713 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
4715 * Functions system/system_out provide a robust way to invoke external
4716 shell commands, with propagation of interrupts (requires Poly/ML
4717 5.2.1). Do not use OS.Process.system etc. from the basis library!
4722 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
4723 in accordance with Proof General 3.7, which prefers GNU emacs.
4725 * isatool tty runs Isabelle process with plain tty interaction;
4726 optional line editor may be specified via ISABELLE_LINE_EDITOR
4727 setting, the default settings attempt to locate "ledit" and "rlwrap".
4729 * isatool browser now works with Cygwin as well, using general
4730 "javapath" function defined in Isabelle process environment.
4732 * YXML notation provides a simple and efficient alternative to
4733 standard XML transfer syntax. See src/Pure/General/yxml.ML and
4734 isatool yxml as described in the Isabelle system manual.
4736 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
4737 provides general wrapper for managing an Isabelle process in a robust
4738 fashion, with ``cooked'' output from stdin/stderr.
4740 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
4741 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
4743 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
4744 way of changing the user's settings is via
4745 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
4748 * Multithreading.max_threads := 0 refers to the number of actual CPU
4749 cores of the underlying machine, which is a good starting point for
4750 optimal performance tuning. The corresponding usedir option -M allows
4751 "max" as an alias for "0". WARNING: does not work on certain versions
4752 of Mac OS (with Poly/ML 5.1).
4754 * isabelle-process: non-ML sessions are run with "nice", to reduce the
4755 adverse effect of Isabelle flooding interactive front-ends (notably
4756 ProofGeneral / XEmacs).
4760 New in Isabelle2007 (November 2007)
4761 -----------------------------------
4765 * More uniform information about legacy features, notably a
4766 warning/error of "Legacy feature: ...", depending on the state of the
4767 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
4768 legacy features will disappear eventually.
4770 * Theory syntax: the header format ``theory A = B + C:'' has been
4771 discontinued in favour of ``theory A imports B C begin''. Use isatool
4772 fixheaders to convert existing theory files. INCOMPATIBILITY.
4774 * Theory syntax: the old non-Isar theory file format has been
4775 discontinued altogether. Note that ML proof scripts may still be used
4776 with Isar theories; migration is usually quite simple with the ML
4777 function use_legacy_bindings. INCOMPATIBILITY.
4779 * Theory syntax: some popular names (e.g. 'class', 'declaration',
4780 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
4783 * Theory loader: be more serious about observing the static theory
4784 header specifications (including optional directories), but not the
4785 accidental file locations of previously successful loads. The strict
4786 update policy of former update_thy is now already performed by
4787 use_thy, so the former has been removed; use_thys updates several
4788 theories simultaneously, just as 'imports' within a theory header
4789 specification, but without merging the results. Potential
4790 INCOMPATIBILITY: may need to refine theory headers and commands
4791 ROOT.ML which depend on load order.
4793 * Theory loader: optional support for content-based file
4794 identification, instead of the traditional scheme of full physical
4795 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
4796 (cf. the system manual). The new scheme allows to work with
4797 non-finished theories in persistent session images, such that source
4798 files may be moved later on without requiring reloads.
4800 * Theory loader: old-style ML proof scripts being *attached* to a thy
4801 file (with the same base name as the theory) are considered a legacy
4802 feature, which will disappear eventually. Even now, the theory loader
4803 no longer maintains dependencies on such files.
4805 * Syntax: the scope for resolving ambiguities via type-inference is
4806 now limited to individual terms, instead of whole simultaneous
4807 specifications as before. This greatly reduces the complexity of the
4808 syntax module and improves flexibility by separating parsing and
4809 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
4810 'fixes' etc.) are required in rare situations.
4812 * Syntax: constants introduced by new-style packages ('definition',
4813 'abbreviation' etc.) are passed through the syntax module in
4814 ``authentic mode''. This means that associated mixfix annotations
4815 really stick to such constants, independently of potential name space
4816 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
4817 trees are represented slightly differently, may need to adapt syntax
4818 translations accordingly. Use CONST marker in 'translations' and
4819 @{const_syntax} antiquotation in 'parse_translation' etc.
4821 * Legacy goal package: reduced interface to the bare minimum required
4822 to keep existing proof scripts running. Most other user-level
4823 functions are now part of the OldGoals structure, which is *not* open
4824 by default (consider isatool expandshort before open OldGoals).
4825 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
4826 these tend to cause confusion about the actual goal (!) context being
4827 used here, which is not necessarily the same as the_context().
4829 * Command 'find_theorems': supports "*" wild-card in "name:"
4830 criterion; "with_dups" option. Certain ProofGeneral versions might
4831 support a specific search form (see ProofGeneral/CHANGES).
4833 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
4834 by default, which means that "prems" (and also "fixed variables") are
4835 suppressed from proof state output. Note that the ProofGeneral
4836 settings mechanism allows to change and save options persistently, but
4837 older versions of Isabelle will fail to start up if a negative prems
4840 * Local theory targets may be specified by non-nested blocks of
4841 ``context/locale/class ... begin'' followed by ``end''. The body may
4842 contain definitions, theorems etc., including any derived mechanism
4843 that has been implemented on top of these primitives. This concept
4844 generalizes the existing ``theorem (in ...)'' towards more versatility
4847 * Proof General interface: proper undo of final 'end' command;
4848 discontinued Isabelle/classic mode (ML proof scripts).
4851 *** Document preparation ***
4853 * Added antiquotation @{theory name} which prints the given name,
4854 after checking that it refers to a valid ancestor theory in the
4857 * Added antiquotations @{ML_type text} and @{ML_struct text} which
4858 check the given source text as ML type/structure, printing verbatim.
4860 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
4861 "c args == rhs" given in the current context. (Any number of
4862 arguments may be given on the LHS.)
4867 * The 'class' package offers a combination of axclass and locale to
4868 achieve Haskell-like type classes in Isabelle. Definitions and
4869 theorems within a class context produce both relative results (with
4870 implicit parameters according to the locale context), and polymorphic
4871 constants with qualified polymorphism (according to the class
4872 context). Within the body context of a 'class' target, a separate
4873 syntax layer ("user space type system") takes care of converting
4874 between global polymorphic consts and internal locale representation.
4875 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
4876 "isatool doc classes" provides a tutorial.
4878 * Generic code generator framework allows to generate executable
4879 code for ML and Haskell (including Isabelle classes). A short usage
4882 internal compilation:
4883 export_code <list of constants (term syntax)> in SML
4884 writing SML code to a file:
4885 export_code <list of constants (term syntax)> in SML <filename>
4886 writing OCaml code to a file:
4887 export_code <list of constants (term syntax)> in OCaml <filename>
4888 writing Haskell code to a bunch of files:
4889 export_code <list of constants (term syntax)> in Haskell <filename>
4891 evaluating closed propositions to True/False using code generation:
4894 Reasonable default setup of framework in HOL.
4896 Theorem attributs for selecting and transforming function equations theorems:
4898 [code fun]: select a theorem as function equation for a specific constant
4899 [code fun del]: deselect a theorem as function equation for a specific constant
4900 [code inline]: select an equation theorem for unfolding (inlining) in place
4901 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
4903 User-defined serializations (target in {SML, OCaml, Haskell}):
4905 code_const <and-list of constants (term syntax)>
4906 {(target) <and-list of const target syntax>}+
4908 code_type <and-list of type constructors>
4909 {(target) <and-list of type target syntax>}+
4911 code_instance <and-list of instances>
4913 where instance ::= <type constructor> :: <class>
4915 code_class <and_list of classes>
4916 {(target) <and-list of class target syntax>}+
4917 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
4919 code_instance and code_class only are effective to target Haskell.
4921 For example usage see src/HOL/ex/Codegenerator.thy and
4922 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
4923 generation from Isabelle/HOL theories is available via "isatool doc
4926 * Code generator: consts in 'consts_code' Isar commands are now
4927 referred to by usual term syntax (including optional type
4930 * Command 'no_translations' removes translation rules from theory
4933 * Overloaded definitions are now actually checked for acyclic
4934 dependencies. The overloading scheme is slightly more general than
4935 that of Haskell98, although Isabelle does not demand an exact
4936 correspondence to type class and instance declarations.
4937 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
4938 exotic versions of overloading -- at the discretion of the user!
4940 Polymorphic constants are represented via type arguments, i.e. the
4941 instantiation that matches an instance against the most general
4942 declaration given in the signature. For example, with the declaration
4943 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
4944 as c(nat). Overloading is essentially simultaneous structural
4945 recursion over such type arguments. Incomplete specification patterns
4946 impose global constraints on all occurrences, e.g. c('a * 'a) on the
4947 LHS means that more general c('a * 'b) will be disallowed on any RHS.
4948 Command 'print_theory' outputs the normalized system of recursive
4949 equations, see section "definitions".
4951 * Configuration options are maintained within the theory or proof
4952 context (with name and type bool/int/string), providing a very simple
4953 interface to a poor-man's version of general context data. Tools may
4954 declare options in ML (e.g. using Attrib.config_int) and then refer to
4955 these values using Config.get etc. Users may change options via an
4956 associated attribute of the same name. This form of context
4957 declaration works particularly well with commands 'declare' or
4958 'using', for example ``declare [[foo = 42]]''. Thus it has become
4959 very easy to avoid global references, which would not observe Isar
4960 toplevel undo/redo and fail to work with multithreading.
4962 Various global ML references of Pure and HOL have been turned into
4963 configuration options:
4965 Unify.search_bound unify_search_bound
4966 Unify.trace_bound unify_trace_bound
4967 Unify.trace_simp unify_trace_simp
4968 Unify.trace_types unify_trace_types
4969 Simplifier.simp_depth_limit simp_depth_limit
4970 Blast.depth_limit blast_depth_limit
4971 DatatypeProp.dtK datatype_distinctness_limit
4972 fast_arith_neq_limit fast_arith_neq_limit
4973 fast_arith_split_limit fast_arith_split_limit
4975 * Named collections of theorems may be easily installed as context
4976 data using the functor NamedThmsFun (see also
4977 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
4978 attributes; there is also a toplevel print command. This facility is
4979 just a common case of general context data, which is the preferred way
4980 for anything more complex than just a list of facts in canonical
4983 * Isar: command 'declaration' augments a local theory by generic
4984 declaration functions written in ML. This enables arbitrary content
4985 being added to the context, depending on a morphism that tells the
4986 difference of the original declaration context wrt. the application
4987 context encountered later on.
4989 * Isar: proper interfaces for simplification procedures. Command
4990 'simproc_setup' declares named simprocs (with match patterns, and body
4991 text in ML). Attribute "simproc" adds/deletes simprocs in the current
4992 context. ML antiquotation @{simproc name} retrieves named simprocs.
4994 * Isar: an extra pair of brackets around attribute declarations
4995 abbreviates a theorem reference involving an internal dummy fact,
4996 which will be ignored later --- only the effect of the attribute on
4997 the background context will persist. This form of in-place
4998 declarations is particularly useful with commands like 'declare' and
4999 'using', for example ``have A using [[simproc a]] by simp''.
5001 * Isar: method "assumption" (and implicit closing of subproofs) now
5002 takes simple non-atomic goal assumptions into account: after applying
5003 an assumption as a rule the resulting subgoals are solved by atomic
5004 assumption steps. This is particularly useful to finish 'obtain'
5005 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
5006 without referring to the original premise "!!x. P x ==> thesis" in the
5007 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
5010 * Isar: implicit use of prems from the Isar proof context is
5011 considered a legacy feature. Common applications like ``have A .''
5012 may be replaced by ``have A by fact'' or ``note `A`''. In general,
5013 referencing facts explicitly here improves readability and
5014 maintainability of proof texts.
5016 * Isar: improper proof element 'guess' is like 'obtain', but derives
5017 the obtained context from the course of reasoning! For example:
5019 assume "EX x y. A x & B y" -- "any previous fact"
5020 then guess x and y by clarify
5022 This technique is potentially adventurous, depending on the facts and
5023 proof tools being involved here.
5025 * Isar: known facts from the proof context may be specified as literal
5026 propositions, using ASCII back-quote syntax. This works wherever
5027 named facts used to be allowed so far, in proof commands, proof
5028 methods, attributes etc. Literal facts are retrieved from the context
5029 according to unification of type and term parameters. For example,
5030 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
5031 theorems in the current context, then these are valid literal facts:
5032 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
5034 There is also a proof method "fact" which does the same composition
5035 for explicit goal states, e.g. the following proof texts coincide with
5036 certain special cases of literal facts:
5038 have "A" by fact == note `A`
5039 have "A ==> B" by fact == note `A ==> B`
5040 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
5041 have "P a ==> Q a" by fact == note `P a ==> Q a`
5043 * Isar: ":" (colon) is no longer a symbolic identifier character in
5044 outer syntax. Thus symbolic identifiers may be used without
5045 additional white space in declarations like this: ``assume *: A''.
5047 * Isar: 'print_facts' prints all local facts of the current context,
5048 both named and unnamed ones.
5050 * Isar: 'def' now admits simultaneous definitions, e.g.:
5052 def x == "t" and y == "u"
5054 * Isar: added command 'unfolding', which is structurally similar to
5055 'using', but affects both the goal state and facts by unfolding given
5056 rewrite rules. Thus many occurrences of the 'unfold' method or
5057 'unfolded' attribute may be replaced by first-class proof text.
5059 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
5060 and command 'unfolding' now all support object-level equalities
5061 (potentially conditional). The underlying notion of rewrite rule is
5062 analogous to the 'rule_format' attribute, but *not* that of the
5063 Simplifier (which is usually more generous).
5065 * Isar: the new attribute [rotated n] (default n = 1) rotates the
5066 premises of a theorem by n. Useful in conjunction with drule.
5068 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
5069 method expression within a sandbox consisting of the first N
5070 sub-goals, which need to exist. For example, ``simp_all [3]''
5071 simplifies the first three sub-goals, while (rule foo, simp_all)[]
5072 simplifies all new goals that emerge from applying rule foo to the
5073 originally first one.
5075 * Isar: schematic goals are no longer restricted to higher-order
5076 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
5079 * Isar: the conclusion of a long theorem statement is now either
5080 'shows' (a simultaneous conjunction, as before), or 'obtains'
5081 (essentially a disjunction of cases with local parameters and
5082 assumptions). The latter allows to express general elimination rules
5083 adequately; in this notation common elimination rules look like this:
5085 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
5087 obtains x where "P x"
5089 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
5093 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
5099 The subsequent classical rules even refer to the formal "thesis"
5102 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
5105 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
5106 obtains "thesis ==> something"
5108 The actual proof of an 'obtains' statement is analogous to that of the
5109 Isar proof element 'obtain', only that there may be several cases.
5110 Optional case names may be specified in parentheses; these will be
5111 available both in the present proof and as annotations in the
5112 resulting rule, for later use with the 'cases' method (cf. attribute
5115 * Isar: the assumptions of a long theorem statement are available as
5116 "assms" fact in the proof context. This is more appropriate than the
5117 (historical) "prems", which refers to all assumptions of the current
5118 context, including those from the target locale, proof body etc.
5120 * Isar: 'print_statement' prints theorems from the current theory or
5121 proof context in long statement form, according to the syntax of a
5124 * Isar: 'obtain' takes an optional case name for the local context
5125 introduction rule (default "that").
5127 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
5128 explicit (is "_ ==> ?foo") in the rare cases where this still happens
5131 * Pure: syntax "CONST name" produces a fully internalized constant
5132 according to the current context. This is particularly useful for
5133 syntax translations that should refer to internal constant
5134 representations independently of name spaces.
5136 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
5137 instead of "FOO ". This allows multiple binder declarations to coexist
5138 in the same context. INCOMPATIBILITY.
5140 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
5141 primitive that also works in a locale context (both for constants and
5142 fixed variables). Type declaration and internal syntactic representation
5143 of given constants retrieved from the context. Likewise, the
5144 'no_notation' command allows to remove given syntax annotations from the
5147 * Isar/locales: new derived specification elements 'axiomatization',
5148 'definition', 'abbreviation', which support type-inference, admit
5149 object-level specifications (equality, equivalence). See also the
5150 isar-ref manual. Examples:
5153 eq (infix "===" 50) where
5154 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
5156 definition "f x y = x + y + 1"
5157 definition g where "g x = f x x"
5160 neq (infix "=!=" 50) where
5161 "x =!= y == ~ (x === y)"
5163 These specifications may be also used in a locale context. Then the
5164 constants being introduced depend on certain fixed parameters, and the
5165 constant name is qualified by the locale base name. An internal
5166 abbreviation takes care for convenient input and output, making the
5167 parameters implicit and using the original short name. See also
5168 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
5169 entities from a monomorphic theory.
5171 Presently, abbreviations are only available 'in' a target locale, but
5172 not inherited by general import expressions. Also note that
5173 'abbreviation' may be used as a type-safe replacement for 'syntax' +
5174 'translations' in common applications. The "no_abbrevs" print mode
5175 prevents folding of abbreviations in term output.
5177 Concrete syntax is attached to specified constants in internal form,
5178 independently of name spaces. The parse tree representation is
5179 slightly different -- use 'notation' instead of raw 'syntax', and
5180 'translations' with explicit "CONST" markup to accommodate this.
5182 * Pure/Isar: unified syntax for new-style specification mechanisms
5183 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
5184 full type inference and dummy patterns ("_"). For example:
5186 definition "K x _ = x"
5188 inductive conj for A B
5189 where "A ==> B ==> conj A B"
5191 * Pure: command 'print_abbrevs' prints all constant abbreviations of
5192 the current context. Print mode "no_abbrevs" prevents inversion of
5193 abbreviations on output.
5195 * Isar/locales: improved parameter handling: use of locales "var" and
5196 "struct" no longer necessary; - parameter renamings are no longer
5197 required to be injective. For example, this allows to define
5198 endomorphisms as locale endom = homom mult mult h.
5200 * Isar/locales: changed the way locales with predicates are defined.
5201 Instead of accumulating the specification, the imported expression is
5202 now an interpretation. INCOMPATIBILITY: different normal form of
5203 locale expressions. In particular, in interpretations of locales with
5204 predicates, goals repesenting already interpreted fragments are not
5205 removed automatically. Use methods `intro_locales' and
5206 `unfold_locales'; see below.
5208 * Isar/locales: new methods `intro_locales' and `unfold_locales'
5209 provide backward reasoning on locales predicates. The methods are
5210 aware of interpretations and discharge corresponding goals.
5211 `intro_locales' is less aggressive then `unfold_locales' and does not
5212 unfold predicates to assumptions.
5214 * Isar/locales: the order in which locale fragments are accumulated
5215 has changed. This enables to override declarations from fragments due
5216 to interpretations -- for example, unwanted simp rules.
5218 * Isar/locales: interpretation in theories and proof contexts has been
5219 extended. One may now specify (and prove) equations, which are
5220 unfolded in interpreted theorems. This is useful for replacing
5221 defined concepts (constants depending on locale parameters) by
5222 concepts already existing in the target context. Example:
5224 interpretation partial_order ["op <= :: [int, int] => bool"]
5225 where "partial_order.less (op <=) (x::int) y = (x < y)"
5227 Typically, the constant `partial_order.less' is created by a
5228 definition specification element in the context of locale
5231 * Method "induct": improved internal context management to support
5232 local fixes and defines on-the-fly. Thus explicit meta-level
5233 connectives !! and ==> are rarely required anymore in inductive goals
5234 (using object-logic connectives for this purpose has been long
5235 obsolete anyway). Common proof patterns are explained in
5236 src/HOL/Induct/Common_Patterns.thy, see also
5237 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
5240 * Method "induct": improved handling of simultaneous goals. Instead of
5241 introducing object-level conjunction, the statement is now split into
5242 several conclusions, while the corresponding symbolic cases are nested
5243 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
5244 see src/HOL/Induct/Common_Patterns.thy, for example.
5246 * Method "induct": mutual induction rules are now specified as a list
5247 of rule sharing the same induction cases. HOL packages usually provide
5248 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
5249 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
5250 mutual induction rules differently, i.e. like this:
5252 (induct rule: foo_bar.inducts)
5253 (induct set: foo bar)
5254 (induct pred: foo bar)
5255 (induct type: foo bar)
5257 The ML function ProjectRule.projections turns old-style rules into the
5260 * Method "coinduct": dual of induction, see
5261 src/HOL/Library/Coinductive_List.thy for various examples.
5263 * Method "cases", "induct", "coinduct": the ``(open)'' option is
5264 considered a legacy feature.
5266 * Attribute "symmetric" produces result with standardized schematic
5267 variables (index 0). Potential INCOMPATIBILITY.
5269 * Simplifier: by default the simplifier trace only shows top level
5270 rewrites now. That is, trace_simp_depth_limit is set to 1 by
5271 default. Thus there is less danger of being flooded by the trace. The
5272 trace indicates where parts have been suppressed.
5274 * Provers/classical: removed obsolete classical version of elim_format
5275 attribute; classical elim/dest rules are now treated uniformly when
5276 manipulating the claset.
5278 * Provers/classical: stricter checks to ensure that supplied intro,
5279 dest and elim rules are well-formed; dest and elim rules must have at
5282 * Provers/classical: attributes dest/elim/intro take an optional
5283 weight argument for the rule (just as the Pure versions). Weights are
5284 ignored by automated tools, but determine the search order of single
5287 * Syntax: input syntax now supports dummy variable binding "%_. b",
5288 where the body does not mention the bound variable. Note that dummy
5289 patterns implicitly depend on their context of bounds, which makes
5290 "{_. _}" match any set comprehension as expected. Potential
5291 INCOMPATIBILITY -- parse translations need to cope with syntactic
5292 constant "_idtdummy" in the binding position.
5294 * Syntax: removed obsolete syntactic constant "_K" and its associated
5295 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
5296 for example "A -> B" => "Pi A (%_. B)".
5298 * Pure: 'class_deps' command visualizes the subclass relation, using
5299 the graph browser tool.
5301 * Pure: 'print_theory' now suppresses certain internal declarations by
5302 default; use '!' option for full details.
5307 * Method "metis" proves goals by applying the Metis general-purpose
5308 resolution prover (see also http://gilith.com/software/metis/).
5309 Examples are in the directory MetisExamples. WARNING: the
5310 Isabelle/HOL-Metis integration does not yet work properly with
5313 * Command 'sledgehammer' invokes external automatic theorem provers as
5314 background processes. It generates calls to the "metis" method if
5315 successful. These can be pasted into the proof. Users do not have to
5316 wait for the automatic provers to return. WARNING: does not really
5317 work with multi-threading.
5319 * New "auto_quickcheck" feature tests outermost goal statements for
5320 potential counter-examples. Controlled by ML references
5321 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
5322 5000 milliseconds). Fails silently if statements is outside of
5323 executable fragment, or any other codgenerator problem occurs.
5325 * New constant "undefined" with axiom "undefined x = undefined".
5327 * Added class "HOL.eq", allowing for code generation with polymorphic
5330 * Some renaming of class constants due to canonical name prefixing in
5331 the new 'class' package:
5333 HOL.abs ~> HOL.abs_class.abs
5334 HOL.divide ~> HOL.divide_class.divide
5335 0 ~> HOL.zero_class.zero
5336 1 ~> HOL.one_class.one
5337 op + ~> HOL.plus_class.plus
5338 op - ~> HOL.minus_class.minus
5339 uminus ~> HOL.minus_class.uminus
5340 op * ~> HOL.times_class.times
5341 op < ~> HOL.ord_class.less
5342 op <= > HOL.ord_class.less_eq
5343 Nat.power ~> Power.power_class.power
5344 Nat.size ~> Nat.size_class.size
5345 Numeral.number_of ~> Numeral.number_class.number_of
5346 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
5347 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
5348 Orderings.min ~> Orderings.ord_class.min
5349 Orderings.max ~> Orderings.ord_class.max
5350 Divides.op div ~> Divides.div_class.div
5351 Divides.op mod ~> Divides.div_class.mod
5352 Divides.op dvd ~> Divides.div_class.dvd
5354 INCOMPATIBILITY. Adaptions may be required in the following cases:
5356 a) User-defined constants using any of the names "plus", "minus",
5357 "times", "less" or "less_eq". The standard syntax translations for
5358 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
5361 b) Variables named "plus", "minus", "times", "less", "less_eq"
5362 INCOMPATIBILITY: use more specific names.
5364 c) Permutative equations (e.g. "a + b = b + a")
5365 Since the change of names also changes the order of terms, permutative
5366 rewrite rules may get applied in a different order. Experience shows
5367 that this is rarely the case (only two adaptions in the whole Isabelle
5368 distribution). INCOMPATIBILITY: rewrite proofs
5370 d) ML code directly refering to constant names
5371 This in general only affects hand-written proof tactics, simprocs and
5372 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
5373 Consider using @{const_name} antiquotation.
5375 * New class "default" with associated constant "default".
5377 * Function "sgn" is now overloaded and available on int, real, complex
5378 (and other numeric types), using class "sgn". Two possible defs of
5379 sgn are given as equational assumptions in the classes sgn_if and
5380 sgn_div_norm; ordered_idom now also inherits from sgn_if.
5383 * Locale "partial_order" now unified with class "order" (cf. theory
5384 Orderings), added parameter "less". INCOMPATIBILITY.
5386 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
5387 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
5388 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
5390 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
5391 changed order of proof goals in instance proofs.
5393 * The transitivity reasoner for partial and linear orders is set up
5394 for classes "order" and "linorder". Instances of the reasoner are available
5395 in all contexts importing or interpreting the corresponding locales.
5396 Method "order" invokes the reasoner separately; the reasoner
5397 is also integrated with the Simplifier as a solver. Diagnostic
5398 command 'print_orders' shows the available instances of the reasoner
5399 in the current context.
5401 * Localized monotonicity predicate in theory "Orderings"; integrated
5402 lemmas max_of_mono and min_of_mono with this predicate.
5405 * Formulation of theorem "dense" changed slightly due to integration
5406 with new class dense_linear_order.
5408 * Uniform lattice theory development in HOL.
5410 constants "meet" and "join" now named "inf" and "sup"
5411 constant "Meet" now named "Inf"
5413 classes "meet_semilorder" and "join_semilorder" now named
5414 "lower_semilattice" and "upper_semilattice"
5415 class "lorder" now named "lattice"
5416 class "comp_lat" now named "complete_lattice"
5418 Instantiation of lattice classes allows explicit definitions
5419 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
5421 INCOMPATIBILITY. Theorem renames:
5423 meet_left_le ~> inf_le1
5424 meet_right_le ~> inf_le2
5425 join_left_le ~> sup_ge1
5426 join_right_le ~> sup_ge2
5427 meet_join_le ~> inf_sup_ord
5430 le_meet ~> le_inf_iff
5431 le_join ~> ge_sup_conv
5432 meet_idempotent ~> inf_idem
5433 join_idempotent ~> sup_idem
5434 meet_comm ~> inf_commute
5435 join_comm ~> sup_commute
5436 meet_leI1 ~> le_infI1
5437 meet_leI2 ~> le_infI2
5438 le_joinI1 ~> le_supI1
5439 le_joinI2 ~> le_supI2
5440 meet_assoc ~> inf_assoc
5441 join_assoc ~> sup_assoc
5442 meet_left_comm ~> inf_left_commute
5443 meet_left_idempotent ~> inf_left_idem
5444 join_left_comm ~> sup_left_commute
5445 join_left_idempotent ~> sup_left_idem
5448 le_def_meet ~> le_iff_inf
5449 le_def_join ~> le_iff_sup
5450 join_absorp2 ~> sup_absorb2
5451 join_absorp1 ~> sup_absorb1
5452 meet_absorp1 ~> inf_absorb1
5453 meet_absorp2 ~> inf_absorb2
5454 meet_join_absorp ~> inf_sup_absorb
5455 join_meet_absorp ~> sup_inf_absorb
5456 distrib_join_le ~> distrib_sup_le
5457 distrib_meet_le ~> distrib_inf_le
5459 add_meet_distrib_left ~> add_inf_distrib_left
5460 add_join_distrib_left ~> add_sup_distrib_left
5461 is_join_neg_meet ~> is_join_neg_inf
5462 is_meet_neg_join ~> is_meet_neg_sup
5463 add_meet_distrib_right ~> add_inf_distrib_right
5464 add_join_distrib_right ~> add_sup_distrib_right
5465 add_meet_join_distribs ~> add_sup_inf_distribs
5466 join_eq_neg_meet ~> sup_eq_neg_inf
5467 meet_eq_neg_join ~> inf_eq_neg_sup
5468 add_eq_meet_join ~> add_eq_inf_sup
5469 meet_0_imp_0 ~> inf_0_imp_0
5470 join_0_imp_0 ~> sup_0_imp_0
5471 meet_0_eq_0 ~> inf_0_eq_0
5472 join_0_eq_0 ~> sup_0_eq_0
5473 neg_meet_eq_join ~> neg_inf_eq_sup
5474 neg_join_eq_meet ~> neg_sup_eq_inf
5475 join_eq_if ~> sup_eq_if
5477 mono_meet ~> mono_inf
5478 mono_join ~> mono_sup
5479 meet_bool_eq ~> inf_bool_eq
5480 join_bool_eq ~> sup_bool_eq
5481 meet_fun_eq ~> inf_fun_eq
5482 join_fun_eq ~> sup_fun_eq
5483 meet_set_eq ~> inf_set_eq
5484 join_set_eq ~> sup_set_eq
5485 meet1_iff ~> inf1_iff
5486 meet2_iff ~> inf2_iff
5495 join1_iff ~> sup1_iff
5496 join2_iff ~> sup2_iff
5506 is_meet_Meet ~> is_meet_Inf
5507 Meet_bool_def ~> Inf_bool_def
5508 Meet_fun_def ~> Inf_fun_def
5509 Meet_greatest ~> Inf_greatest
5510 Meet_lower ~> Inf_lower
5511 Meet_set_def ~> Inf_set_def
5514 Sup_bool_eq ~> Sup_bool_def
5515 Sup_fun_eq ~> Sup_fun_def
5516 Sup_set_eq ~> Sup_set_def
5518 listsp_meetI ~> listsp_infI
5519 listsp_meet_eq ~> listsp_inf_eq
5524 * Added syntactic class "size"; overloaded constant "size" now has
5525 type "'a::size ==> bool"
5527 * Internal reorganisation of `size' of datatypes: size theorems
5528 "foo.size" are no longer subsumed by "foo.simps" (but are still
5529 simplification rules by default!); theorems "prod.size" now named
5532 * Class "div" now inherits from class "times" rather than "type".
5535 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
5536 Linorder etc. have disappeared; operations defined in terms of
5537 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
5539 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
5541 * HOL-Word: New extensive library and type for generic, fixed size
5542 machine words, with arithmetic, bit-wise, shifting and rotating
5543 operations, reflection into int, nat, and bool lists, automation for
5544 linear arithmetic (by automatic reflection into nat or int), including
5545 lemmas on overflow and monotonicity. Instantiated to all appropriate
5546 arithmetic type classes, supporting automatic simplification of
5547 numerals on all operations.
5549 * Library/Boolean_Algebra: locales for abstract boolean algebras.
5551 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
5553 * Code generator library theories:
5554 - Code_Integer represents HOL integers by big integer literals in target
5556 - Code_Char represents HOL characters by character literals in target
5558 - Code_Char_chr like Code_Char, but also offers treatment of character
5559 codes; includes Code_Integer.
5560 - Executable_Set allows to generate code for finite sets using lists.
5561 - Executable_Rat implements rational numbers as triples (sign, enumerator,
5563 - Executable_Real implements a subset of real numbers, namly those
5564 representable by rational numbers.
5565 - Efficient_Nat implements natural numbers by integers, which in general will
5566 result in higher efficency; pattern matching with 0/Suc is eliminated;
5567 includes Code_Integer.
5568 - Code_Index provides an additional datatype index which is mapped to
5569 target-language built-in integers.
5570 - Code_Message provides an additional datatype message_string which is isomorphic to
5571 strings; messages are mapped to target-language strings.
5573 * New package for inductive predicates
5575 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
5578 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5579 for z_1 :: U_1 and ... and z_n :: U_m
5581 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5584 with full support for type-inference, rather than
5586 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5588 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5589 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5591 inductive "s z_1 ... z_m"
5593 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5596 For backward compatibility, there is a wrapper allowing inductive
5597 sets to be defined with the new package via
5600 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5601 for z_1 :: U_1 and ... and z_n :: U_m
5603 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5609 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5610 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5611 for z_1 :: U_1 and ... and z_n :: U_m
5613 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5614 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5617 if the additional syntax "p ..." is required.
5619 Numerous examples can be found in the subdirectories src/HOL/Auth,
5620 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
5624 - Since declaration and definition of inductive sets or predicates
5625 is no longer separated, abbreviations involving the newly
5626 introduced sets or predicates must be specified together with the
5627 introduction rules after the 'where' keyword (see above), rather
5628 than before the actual inductive definition.
5630 - The variables in induction and elimination rules are now
5631 quantified in the order of their occurrence in the introduction
5632 rules, rather than in alphabetical order. Since this may break
5633 some proofs, these proofs either have to be repaired, e.g. by
5634 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
5635 statements of the form
5637 case (rule_i a_i_1 ... a_i_{k_i})
5639 or the old order of quantification has to be restored by explicitly adding
5640 meta-level quantifiers in the introduction rules, i.e.
5642 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
5644 - The format of the elimination rules is now
5646 p z_1 ... z_m x_1 ... x_n ==>
5647 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5652 (x_1, ..., x_n) : s z_1 ... z_m ==>
5653 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5656 for sets rather than
5658 x : s z_1 ... z_m ==>
5659 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
5662 This may require terms in goals to be expanded to n-tuples
5663 (e.g. using case_tac or simplification with the split_paired_all
5664 rule) before the above elimination rule is applicable.
5666 - The elimination or case analysis rules for (mutually) inductive
5667 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
5668 list of rules "p_1_..._p_k.elims" is no longer available.
5670 * New package "function"/"fun" for general recursive functions,
5671 supporting mutual and nested recursion, definitions in local contexts,
5672 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
5673 for small examples, and the separate tutorial on the function
5674 package. The old recdef "package" is still available as before, but
5675 users are encouraged to use the new package.
5677 * Method "lexicographic_order" automatically synthesizes termination
5678 relations as lexicographic combinations of size measures.
5680 * Case-expressions allow arbitrary constructor-patterns (including
5681 "_") and take their order into account, like in functional
5682 programming. Internally, this is translated into nested
5683 case-expressions; missing cases are added and mapped to the predefined
5684 constant "undefined". In complicated cases printing may no longer show
5685 the original input but the internal form. Lambda-abstractions allow
5686 the same form of pattern matching: "% pat1 => e1 | ..." is an
5687 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
5690 * IntDef: The constant "int :: nat => int" has been removed; now "int"
5691 is an abbreviation for "of_nat :: nat => int". The simplification
5692 rules for "of_nat" have been changed to work like "int" did
5693 previously. Potential INCOMPATIBILITY:
5694 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
5695 - of_nat_diff and of_nat_mult are no longer default simp rules
5697 * Method "algebra" solves polynomial equations over (semi)rings using
5698 Groebner bases. The (semi)ring structure is defined by locales and the
5699 tool setup depends on that generic context. Installing the method for
5700 a specific type involves instantiating the locale and possibly adding
5701 declarations for computation on the coefficients. The method is
5702 already instantiated for natural numbers and for the axiomatic class
5703 of idoms with numerals. See also the paper by Chaieb and Wenzel at
5704 CALCULEMUS 2007 for the general principles underlying this
5705 architecture of context-aware proof-tools.
5707 * Method "ferrack" implements quantifier elimination over
5708 special-purpose dense linear orders using locales (analogous to
5709 "algebra"). The method is already installed for class
5710 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
5713 * Former constant "List.op @" now named "List.append". Use ML
5714 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
5715 circumvent possible incompatibilities when working on ML level.
5717 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
5719 * New function listsum :: 'a list => 'a for arbitrary monoids.
5720 Special syntax: "SUM x <- xs. f x" (and latex variants)
5722 * New syntax for Haskell-like list comprehension (input only), eg.
5723 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
5725 * The special syntax for function "filter" has changed from [x :
5726 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
5727 comprehension syntax, and for uniformity. INCOMPATIBILITY.
5729 * [a..b] is now defined for arbitrary linear orders. It used to be
5730 defined on nat only, as an abbreviation for [a..<Suc b]
5733 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
5735 * New functions "sorted" and "sort" in src/HOL/List.thy.
5737 * New lemma collection field_simps (an extension of ring_simps) for
5738 manipulating (in)equations involving division. Multiplies with all
5739 denominators that can be proved to be non-zero (in equations) or
5740 positive/negative (in inequations).
5742 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
5743 have been improved and renamed to ring_simps, group_simps and
5744 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
5745 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
5747 * Theory Library/Commutative_Ring: switched from recdef to function
5748 package; constants add, mul, pow now curried. Infix syntax for
5749 algebraic operations.
5751 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
5754 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
5757 * HOL/records: generalised field-update to take a function on the
5758 field rather than the new value: r(|A := x|) is translated to A_update
5759 (K x) r The K-combinator that is internally used is called K_record.
5760 INCOMPATIBILITY: Usage of the plain update functions has to be
5763 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
5764 * x = 0, which are required for a semiring. Richer structures do not
5765 inherit from semiring_0 anymore, because this property is a theorem
5766 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
5767 there is more to prove, but this is mostly trivial.
5769 * Class "recpower" is generalized to arbitrary monoids, not just
5770 commutative semirings. INCOMPATIBILITY: may need to incorporate
5771 commutativity or semiring properties additionally.
5773 * Constant "List.list_all2" in List.thy now uses authentic syntax.
5774 INCOMPATIBILITY: translations containing list_all2 may go wrong,
5775 better use 'abbreviation'.
5777 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
5779 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
5780 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
5781 significant changes for setting up numeral syntax for types:
5782 - New constants Numeral.pred and Numeral.succ instead
5783 of former Numeral.bin_pred and Numeral.bin_succ.
5784 - Use integer operations instead of bin_add, bin_mult and so on.
5785 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
5786 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
5788 See src/HOL/Integ/IntArith.thy for an example setup.
5790 * Command 'normal_form' computes the normal form of a term that may
5791 contain free variables. For example ``normal_form "rev [a, b, c]"''
5792 produces ``[b, c, a]'' (without proof). This command is suitable for
5793 heavy-duty computations because the functions are compiled to ML
5794 first. Correspondingly, a method "normalization" is provided. See
5795 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
5797 * Alternative iff syntax "A <-> B" for equality on bool (with priority
5798 25 like -->); output depends on the "iff" print_mode, the default is
5799 "A = B" (with priority 50).
5801 * Relations less (<) and less_eq (<=) are also available on type bool.
5802 Modified syntax to disallow nesting without explicit parentheses,
5803 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
5806 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
5808 * Relation composition operator "op O" now has precedence 75 and binds
5809 stronger than union and intersection. INCOMPATIBILITY.
5811 * The old set interval syntax "{m..n(}" (and relatives) has been
5812 removed. Use "{m..<n}" (and relatives) instead.
5814 * In the context of the assumption "~(s = t)" the Simplifier rewrites
5815 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
5816 ``declare [[simproc del: neq]]''.
5818 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
5821 * Theorem Cons_eq_map_conv no longer declared as "simp".
5823 * Theorem setsum_mult renamed to setsum_right_distrib.
5825 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
5828 * Reimplemented methods "sat" and "satx", with several improvements:
5829 goals no longer need to be stated as "<prems> ==> False", equivalences
5830 (i.e. "=" on type bool) are handled, variable names of the form
5831 "lit_<n>" are no longer reserved, significant speedup.
5833 * Methods "sat" and "satx" can now replay MiniSat proof traces.
5834 zChaff is still supported as well.
5836 * 'inductive' and 'datatype': provide projections of mutual rules,
5837 bundled as foo_bar.inducts;
5839 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
5842 * Library: moved theory Accessible_Part to main HOL.
5844 * Library: added theory Coinductive_List of potentially infinite lists
5845 as greatest fixed-point.
5847 * Library: added theory AssocList which implements (finite) maps as
5850 * Method "evaluation" solves goals (i.e. a boolean expression)
5851 efficiently by compiling it to ML. The goal is "proved" (via an
5852 oracle) if it evaluates to True.
5854 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
5855 also when invoked by the simplifier. This results in the Simplifier
5856 being more powerful on arithmetic goals. INCOMPATIBILITY.
5857 Configuration option fast_arith_split_limit=0 recovers the old
5860 * Support for hex (0x20) and binary (0b1001) numerals.
5862 * New method: reify eqs (t), where eqs are equations for an
5863 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
5864 parameter, computes a term s::'b and a list xs::'a list and proves the
5865 theorem I xs s = t. This is also known as reification or quoting. The
5866 resulting theorem is applied to the subgoal to substitute t with I xs
5867 s. If t is omitted, the subgoal itself is reified.
5869 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
5870 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
5871 where f is supposed to be a computable function (in the sense of code
5872 generattion). The method uses reify to compute s and xs as above then
5873 applies corr_thm and uses normalization by evaluation to "prove" f s =
5874 r and finally gets the theorem t = r, which is again applied to the
5875 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
5877 * Reflection: Automatic reification now handels binding, an example is
5878 available in src/HOL/ex/ReflectionEx.thy
5880 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
5881 command 'statespace' that is similar to 'record', but introduces an
5882 abstract specification based on the locale infrastructure instead of
5883 HOL types. This leads to extra flexibility in composing state spaces,
5884 in particular multiple inheritance and renaming of components.
5889 * Hyperreal: Functions root and sqrt are now defined on negative real
5890 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
5891 Nonnegativity side conditions have been removed from many lemmas, so
5892 that more subgoals may now be solved by simplification; potential
5895 * Real: new type classes formalize real normed vector spaces and
5896 algebras, using new overloaded constants scaleR :: real => 'a => 'a
5897 and norm :: 'a => real.
5899 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
5900 reals into other types. The overloaded constant Reals :: 'a set is now
5901 defined as range of_real; potential INCOMPATIBILITY.
5903 * Real: proper support for ML code generation, including 'quickcheck'.
5904 Reals are implemented as arbitrary precision rationals.
5906 * Hyperreal: Several constants that previously worked only for the
5907 reals have been generalized, so they now work over arbitrary vector
5908 spaces. Type annotations may need to be added in some cases; potential
5911 Infinitesimal :: ('a::real_normed_vector) star set
5912 HFinite :: ('a::real_normed_vector) star set
5913 HInfinite :: ('a::real_normed_vector) star set
5914 approx :: ('a::real_normed_vector) star => 'a star => bool
5915 monad :: ('a::real_normed_vector) star => 'a star set
5916 galaxy :: ('a::real_normed_vector) star => 'a star set
5917 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
5918 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
5919 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
5920 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
5921 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
5922 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
5923 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
5924 sgn :: 'a::real_normed_vector => 'a
5925 exp :: 'a::{recpower,real_normed_field,banach} => 'a
5927 * Complex: Some complex-specific constants are now abbreviations for
5928 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
5929 hnorm. Other constants have been entirely removed in favor of the
5930 polymorphic versions (INCOMPATIBILITY):
5934 HInfinite <-- CInfinite
5935 Infinitesimal <-- CInfinitesimal
5938 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
5939 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
5940 (ns)deriv <-- (ns)cderiv
5945 * Formalisation of ideals and the quotient construction over rings.
5947 * Order and lattice theory no longer based on records.
5950 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
5951 greatest_closed. INCOMPATIBILITY.
5953 * Method algebra is now set up via an attribute. For examples see
5954 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
5955 of algebraic structures.
5957 * Renamed theory CRing to Ring.
5962 * Substantial, yet incomplete support for nominal datatypes (binding
5963 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
5964 src/HOL/Nominal/Examples. Prospective users should consult
5965 http://isabelle.in.tum.de/nominal/
5970 * ML basics: just one true type int, which coincides with IntInf.int
5973 * ML within Isar: antiquotations allow to embed statically-checked
5974 formal entities in the source, referring to the context available at
5975 compile-time. For example:
5977 ML {* @{sort "{zero,one}"} *}
5978 ML {* @{typ "'a => 'b"} *}
5979 ML {* @{term "%x. x"} *}
5980 ML {* @{prop "x == y"} *}
5981 ML {* @{ctyp "'a => 'b"} *}
5982 ML {* @{cterm "%x. x"} *}
5983 ML {* @{cprop "x == y"} *}
5984 ML {* @{thm asm_rl} *}
5985 ML {* @{thms asm_rl} *}
5986 ML {* @{type_name c} *}
5987 ML {* @{type_syntax c} *}
5988 ML {* @{const_name c} *}
5989 ML {* @{const_syntax c} *}
5992 ML {* @{theory Pure} *}
5993 ML {* @{theory_ref} *}
5994 ML {* @{theory_ref Pure} *}
5997 ML {* @{clasimpset} *}
5999 The same works for sources being ``used'' within an Isar context.
6001 * ML in Isar: improved error reporting; extra verbosity with
6002 ML_Context.trace enabled.
6004 * Pure/General/table.ML: the join operations now works via exceptions
6005 DUP/SAME instead of type option. This is simpler in simple cases, and
6006 admits slightly more efficient complex applications.
6008 * Pure: 'advanced' translation functions (parse_translation etc.) now
6009 use Context.generic instead of just theory.
6011 * Pure: datatype Context.generic joins theory/Proof.context and
6012 provides some facilities for code that works in either kind of
6013 context, notably GenericDataFun for uniform theory and proof data.
6015 * Pure: simplified internal attribute type, which is now always
6016 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
6017 local (Proof.context) attributes have been discontinued, while
6018 minimizing code duplication. Thm.rule_attribute and
6019 Thm.declaration_attribute build canonical attributes; see also structure
6020 Context for further operations on Context.generic, notably
6021 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
6022 declarations and definitions.
6024 * Context data interfaces (Theory/Proof/GenericDataFun): removed
6025 name/print, uninitialized data defaults to ad-hoc copy of empty value,
6026 init only required for impure data. INCOMPATIBILITY: empty really need
6027 to be empty (no dependencies on theory content!)
6029 * Pure/kernel: consts certification ignores sort constraints given in
6030 signature declarations. (This information is not relevant to the
6031 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
6032 potential INCOMPATIBILITY.
6034 * Pure: axiomatic type classes are now purely definitional, with
6035 explicit proofs of class axioms and super class relations performed
6036 internally. See Pure/axclass.ML for the main internal interfaces --
6037 notably AxClass.define_class supercedes AxClass.add_axclass, and
6038 AxClass.axiomatize_class/classrel/arity supersede
6039 Sign.add_classes/classrel/arities.
6041 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
6042 global/local versions on theory vs. Proof.context have been
6043 discontinued; Attrib.syntax and Method.syntax have been adapted
6044 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
6045 attributes, methods, etc.
6047 * Pure: several functions of signature "... -> theory -> theory * ..."
6048 have been reoriented to "... -> theory -> ... * theory" in order to
6049 allow natural usage in combination with the ||>, ||>>, |-> and
6050 fold_map combinators.
6052 * Pure: official theorem names (closed derivations) and additional
6053 comments (tags) are now strictly separate. Name hints -- which are
6054 maintained as tags -- may be attached any time without affecting the
6057 * Pure: primitive rule lift_rule now takes goal cterm instead of an
6058 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
6059 achieve the old behaviour.
6061 * Pure: the "Goal" constant is now called "prop", supporting a
6062 slightly more general idea of ``protecting'' meta-level rule
6065 * Pure: Logic.(un)varify only works in a global context, which is now
6066 enforced instead of silently assumed. INCOMPATIBILITY, may use
6067 Logic.legacy_(un)varify as temporary workaround.
6069 * Pure: structure Name provides scalable operations for generating
6070 internal variable names, notably Name.variants etc. This replaces
6071 some popular functions from term.ML:
6073 Term.variant -> Name.variant
6074 Term.variantlist -> Name.variant_list
6075 Term.invent_names -> Name.invent_list
6077 Note that low-level renaming rarely occurs in new code -- operations
6078 from structure Variable are used instead (see below).
6080 * Pure: structure Variable provides fundamental operations for proper
6081 treatment of fixed/schematic variables in a context. For example,
6082 Variable.import introduces fixes for schematics of given facts and
6083 Variable.export reverses the effect (up to renaming) -- this replaces
6084 various freeze_thaw operations.
6086 * Pure: structure Goal provides simple interfaces for
6087 init/conclude/finish and tactical prove operations (replacing former
6088 Tactic.prove). Goal.prove is the canonical way to prove results
6089 within a given context; Goal.prove_global is a degraded version for
6090 theory level goals, including a global Drule.standard. Note that
6091 OldGoals.prove_goalw_cterm has long been obsolete, since it is
6092 ill-behaved in a local proof context (e.g. with local fixes/assumes or
6093 in a locale context).
6095 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
6096 and type checking (Syntax.check_term etc.), with common combinations
6097 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
6098 which are considered legacy and await removal.
6100 * Pure/Syntax: generic interfaces for type unchecking
6101 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
6102 with common combinations (Syntax.pretty_term, Syntax.string_of_term
6103 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
6104 available for convenience, but refer to the very same operations using
6105 a mere theory instead of a full context.
6107 * Isar: simplified treatment of user-level errors, using exception
6108 ERROR of string uniformly. Function error now merely raises ERROR,
6109 without any side effect on output channels. The Isar toplevel takes
6110 care of proper display of ERROR exceptions. ML code may use plain
6111 handle/can/try; cat_error may be used to concatenate errors like this:
6113 ... handle ERROR msg => cat_error msg "..."
6115 Toplevel ML code (run directly or through the Isar toplevel) may be
6116 embedded into the Isar toplevel with exception display/debug like
6119 Isar.toplevel (fn () => ...)
6121 INCOMPATIBILITY, removed special transform_error facilities, removed
6122 obsolete variants of user-level exceptions (ERROR_MESSAGE,
6123 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
6124 -- use plain ERROR instead.
6126 * Isar: theory setup now has type (theory -> theory), instead of a
6127 list. INCOMPATIBILITY, may use #> to compose setup functions.
6129 * Isar: ML toplevel pretty printer for type Proof.context, subject to
6130 ProofContext.debug/verbose flags.
6132 * Isar: Toplevel.theory_to_proof admits transactions that modify the
6133 theory before entering a proof state. Transactions now always see a
6134 quasi-functional intermediate checkpoint, both in interactive and
6137 * Isar: simplified interfaces for outer syntax. Renamed
6138 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
6139 OuterSyntax.add_parsers -- this functionality is now included in
6140 OuterSyntax.command etc. INCOMPATIBILITY.
6142 * Simplifier: the simpset of a running simplification process now
6143 contains a proof context (cf. Simplifier.the_context), which is the
6144 very context that the initial simpset has been retrieved from (by
6145 simpset_of/local_simpset_of). Consequently, all plug-in components
6146 (solver, looper etc.) may depend on arbitrary proof data.
6148 * Simplifier.inherit_context inherits the proof context (plus the
6149 local bounds) of the current simplification process; any simproc
6150 etc. that calls the Simplifier recursively should do this! Removed
6151 former Simplifier.inherit_bounds, which is already included here --
6152 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
6153 specify an explicit context using Simplifier.context/theory_context.
6155 * Simplifier/Classical Reasoner: more abstract interfaces
6156 change_simpset/claset for modifying the simpset/claset reference of a
6157 theory; raw versions simpset/claset_ref etc. have been discontinued --
6160 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
6166 * settings: the default heap location within ISABELLE_HOME_USER now
6167 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
6168 Isabelle installations.
6170 * isabelle-process: option -S (secure mode) disables some critical
6171 operations, notably runtime compilation and evaluation of ML source
6174 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
6176 * Support for parallel execution, using native multicore support of
6177 Poly/ML 5.1. The theory loader exploits parallelism when processing
6178 independent theories, according to the given theory header
6179 specifications. The maximum number of worker threads is specified via
6180 usedir option -M or the "max-threads" setting in Proof General. A
6181 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
6182 to 6 on a 8-core machine. User-code needs to observe certain
6183 guidelines for thread-safe programming, see appendix A in the Isar
6184 Implementation manual.
6188 New in Isabelle2005 (October 2005)
6189 ----------------------------------
6193 * Theory headers: the new header syntax for Isar theories is
6196 imports <theory1> ... <theoryN>
6197 uses <file1> ... <fileM>
6200 where the 'uses' part is optional. The previous syntax
6202 theory <name> = <theory1> + ... + <theoryN>:
6204 will disappear in the next release. Use isatool fixheaders to convert
6205 existing theory files. Note that there is no change in ancient
6206 non-Isar theories now, but these will disappear soon.
6208 * Theory loader: parent theories can now also be referred to via
6209 relative and absolute paths.
6211 * Command 'find_theorems' searches for a list of criteria instead of a
6212 list of constants. Known criteria are: intro, elim, dest, name:string,
6213 simp:term, and any term. Criteria can be preceded by '-' to select
6214 theorems that do not match. Intro, elim, dest select theorems that
6215 match the current goal, name:s selects theorems whose fully qualified
6216 name contain s, and simp:term selects all simplification rules whose
6217 lhs match term. Any other term is interpreted as pattern and selects
6218 all theorems matching the pattern. Available in ProofGeneral under
6219 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
6221 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
6223 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
6224 matching the current goal as introduction rule and not having "HOL."
6225 in their name (i.e. not being defined in theory HOL).
6227 * Command 'thms_containing' has been discontinued in favour of
6228 'find_theorems'; INCOMPATIBILITY.
6230 * Communication with Proof General is now 8bit clean, which means that
6231 Unicode text in UTF-8 encoding may be used within theory texts (both
6232 formal and informal parts). Cf. option -U of the Isabelle Proof
6233 General interface. Here are some simple examples (cf. src/HOL/ex):
6235 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
6236 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
6238 * Improved efficiency of the Simplifier and, to a lesser degree, the
6239 Classical Reasoner. Typical big applications run around 2 times
6243 *** Document preparation ***
6245 * Commands 'display_drafts' and 'print_drafts' perform simple output
6246 of raw sources. Only those symbols that do not require additional
6247 LaTeX packages (depending on comments in isabellesym.sty) are
6248 displayed properly, everything else is left verbatim. isatool display
6249 and isatool print are used as front ends (these are subject to the
6250 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
6252 * Command tags control specific markup of certain regions of text,
6253 notably folding and hiding. Predefined tags include "theory" (for
6254 theory begin and end), "proof" for proof commands, and "ML" for
6255 commands involving ML code; the additional tags "visible" and
6256 "invisible" are unused by default. Users may give explicit tag
6257 specifications in the text, e.g. ''by %invisible (auto)''. The
6258 interpretation of tags is determined by the LaTeX job during document
6259 preparation: see option -V of isatool usedir, or options -n and -t of
6260 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
6263 Several document versions may be produced at the same time via isatool
6264 usedir (the generated index.html will link all of them). Typical
6265 specifications include ''-V document=theory,proof,ML'' to present
6266 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
6267 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
6268 these parts without any formal replacement text. The Isabelle site
6269 default settings produce ''document'' and ''outline'' versions as
6272 * Several new antiquotations:
6274 @{term_type term} prints a term with its type annotated;
6276 @{typeof term} prints the type of a term;
6278 @{const const} is the same as @{term const}, but checks that the
6279 argument is a known logical constant;
6281 @{term_style style term} and @{thm_style style thm} print a term or
6282 theorem applying a "style" to it
6286 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
6287 definitions, equations, inequations etc., 'concl' printing only the
6288 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
6289 to print the specified premise. TermStyle.add_style provides an ML
6290 interface for introducing further styles. See also the "LaTeX Sugar"
6291 document practical applications. The ML antiquotation prints
6292 type-checked ML expressions verbatim.
6294 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
6295 and 'text' support optional locale specification '(in loc)', which
6296 specifies the default context for interpreting antiquotations. For
6297 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
6299 * Option 'locale=NAME' of antiquotations specifies an alternative
6300 context interpreting the subsequent argument. For example: @{thm
6301 [locale=lattice] inf_assoc}.
6303 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
6306 * Proper output of antiquotations for theory commands involving a
6307 proof context (such as 'locale' or 'theorem (in loc) ...').
6309 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
6310 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
6312 * isatool usedir: new option -C (default true) controls whether option
6313 -D should include a copy of the original document directory; -C false
6314 prevents unwanted effects such as copying of administrative CVS data.
6319 * Considerably improved version of 'constdefs' command. Now performs
6320 automatic type-inference of declared constants; additional support for
6321 local structure declarations (cf. locales and HOL records), see also
6322 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
6323 sequential dependencies of definitions within a single 'constdefs'
6324 section; moreover, the declared name needs to be an identifier. If
6325 all fails, consider to fall back on 'consts' and 'defs' separately.
6327 * Improved indexed syntax and implicit structures. First of all,
6328 indexed syntax provides a notational device for subscripted
6329 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
6330 expressions. Secondly, in a local context with structure
6331 declarations, number indexes \<^sub>n or the empty index (default
6332 number 1) refer to a certain fixed variable implicitly; option
6333 show_structs controls printing of implicit structures. Typical
6334 applications of these concepts involve record types and locales.
6336 * New command 'no_syntax' removes grammar declarations (and
6337 translations) resulting from the given syntax specification, which is
6338 interpreted in the same manner as for the 'syntax' command.
6340 * 'Advanced' translation functions (parse_translation etc.) may depend
6341 on the signature of the theory context being presently used for
6342 parsing/printing, see also isar-ref manual.
6344 * Improved 'oracle' command provides a type-safe interface to turn an
6345 ML expression of type theory -> T -> term into a primitive rule of
6346 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
6347 is already included here); see also FOL/ex/IffExample.thy;
6350 * axclass: name space prefix for class "c" is now "c_class" (was "c"
6351 before); "cI" is no longer bound, use "c.intro" instead.
6352 INCOMPATIBILITY. This change avoids clashes of fact bindings for
6353 axclasses vs. locales.
6355 * Improved internal renaming of symbolic identifiers -- attach primes
6356 instead of base 26 numbers.
6358 * New flag show_question_marks controls printing of leading question
6359 marks in schematic variable names.
6361 * In schematic variable names, *any* symbol following \<^isub> or
6362 \<^isup> is now treated as part of the base name. For example, the
6363 following works without printing of awkward ".0" indexes:
6365 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
6368 * Inner syntax includes (*(*nested*) comments*).
6370 * Pretty printer now supports unbreakable blocks, specified in mixfix
6371 annotations as "(00...)".
6373 * Clear separation of logical types and nonterminals, where the latter
6374 may only occur in 'syntax' specifications or type abbreviations.
6375 Before that distinction was only partially implemented via type class
6376 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
6377 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
6378 exotic syntax specifications may require further adaption
6379 (e.g. Cube/Cube.thy).
6381 * Removed obsolete type class "logic", use the top sort {} instead.
6382 Note that non-logical types should be declared as 'nonterminals'
6383 rather than 'types'. INCOMPATIBILITY for new object-logic
6386 * Attributes 'induct' and 'cases': type or set names may now be
6387 locally fixed variables as well.
6389 * Simplifier: can now control the depth to which conditional rewriting
6390 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
6393 * Simplifier: simplification procedures may now take the current
6394 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
6395 interface), which is very useful for calling the Simplifier
6396 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
6397 is gone -- use prems_of_ss on the simpset instead. Moreover, the
6398 low-level mk_simproc no longer applies Logic.varify internally, to
6399 allow for use in a context of fixed variables.
6401 * thin_tac now works even if the assumption being deleted contains !!
6402 or ==>. More generally, erule now works even if the major premise of
6403 the elimination rule contains !! or ==>.
6405 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
6407 * Reorganized bootstrapping of the Pure theories; CPure is now derived
6408 from Pure, which contains all common declarations already. Both
6409 theories are defined via plain Isabelle/Isar .thy files.
6410 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
6411 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
6412 use isatool fixcpure to adapt your theory and ML sources.
6414 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
6415 selections of theorems in named facts via index ranges.
6417 * 'print_theorems': in theory mode, really print the difference
6418 wrt. the last state (works for interactive theory development only),
6419 in proof mode print all local facts (cf. 'print_facts');
6421 * 'hide': option '(open)' hides only base names.
6423 * More efficient treatment of intermediate checkpoints in interactive
6426 * Code generator is now invoked via code_module (incremental code
6427 generation) and code_library (modular code generation, ML structures
6428 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
6429 must be quoted when used as identifiers.
6431 * New 'value' command for reading, evaluating and printing terms using
6432 the code generator. INCOMPATIBILITY: command keyword 'value' must be
6433 quoted when used as identifier.
6438 * New commands for the interpretation of locale expressions in
6439 theories (1), locales (2) and proof contexts (3). These generate
6440 proof obligations from the expression specification. After the
6441 obligations have been discharged, theorems of the expression are added
6442 to the theory, target locale or proof context. The synopsis of the
6443 commands is a follows:
6445 (1) interpretation expr inst
6446 (2) interpretation target < expr
6447 (3) interpret expr inst
6449 Interpretation in theories and proof contexts require a parameter
6450 instantiation of terms from the current context. This is applied to
6451 specifications and theorems of the interpreted expression.
6452 Interpretation in locales only permits parameter renaming through the
6453 locale expression. Interpretation is smart in that interpretations
6454 that are active already do not occur in proof obligations, neither are
6455 instantiated theorems stored in duplicate. Use 'print_interps' to
6456 inspect active interpretations of a particular locale. For details,
6457 see the Isar Reference manual. Examples can be found in
6458 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
6460 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
6461 'interpret' instead.
6463 * New context element 'constrains' for adding type constraints to
6466 * Context expressions: renaming of parameters with syntax
6469 * Locale declaration: 'includes' disallowed.
6471 * Proper static binding of attribute syntax -- i.e. types / terms /
6472 facts mentioned as arguments are always those of the locale definition
6473 context, independently of the context of later invocations. Moreover,
6474 locale operations (renaming and type / term instantiation) are applied
6475 to attribute arguments as expected.
6477 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
6478 actual attributes; rare situations may require Attrib.attribute to
6479 embed those attributes into Attrib.src that lack concrete syntax.
6480 Attribute implementations need to cooperate properly with the static
6481 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
6482 Attrib.XXX_thm etc. already do the right thing without further
6483 intervention. Only unusual applications -- such as "where" or "of"
6484 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
6485 on the context and the facts involved -- may have to assign parsed
6486 values to argument tokens explicitly.
6488 * Changed parameter management in theorem generation for long goal
6489 statements with 'includes'. INCOMPATIBILITY: produces a different
6490 theorem statement in rare situations.
6492 * Locale inspection command 'print_locale' omits notes elements. Use
6493 'print_locale!' to have them included in the output.
6498 * Provers/hypsubst.ML: improved version of the subst method, for
6499 single-step rewriting: it now works in bound variable contexts. New is
6500 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
6501 rewrite a different subterm than the original subst method, which is
6502 still available as 'simplesubst'.
6504 * Provers/quasi.ML: new transitivity reasoners for transitivity only
6507 * Provers/trancl.ML: new transitivity reasoner for transitive and
6508 reflexive-transitive closure of relations.
6510 * Provers/blast.ML: new reference depth_limit to make blast's depth
6511 limit (previously hard-coded with a value of 20) user-definable.
6513 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
6514 is peformed already. Object-logics merely need to finish their
6515 initial simpset configuration as before. INCOMPATIBILITY.
6520 * Symbolic syntax of Hilbert Choice Operator is now as follows:
6523 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
6525 The symbol \<some> is displayed as the alternative epsilon of LaTeX
6526 and x-symbol; use option '-m epsilon' to get it actually printed.
6527 Moreover, the mathematically important symbolic identifier \<epsilon>
6528 becomes available as variable, constant etc. INCOMPATIBILITY,
6530 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
6531 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
6532 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
6533 support corresponding Isar calculations.
6535 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
6538 * theory SetInterval: changed the syntax for open intervals:
6547 The old syntax is still supported but will disappear in the next
6548 release. For conversion use the following Emacs search and replace
6549 patterns (these are not perfect but work quite well):
6551 {)\([^\.]*\)\.\. -> {\1<\.\.}
6552 \.\.\([^(}]*\)(} -> \.\.<\1}
6554 * Theory Commutative_Ring (in Library): method comm_ring for proving
6555 equalities in commutative rings; method 'algebra' provides a generic
6558 * Theory Finite_Set: changed the syntax for 'setsum', summation over
6559 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
6560 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
6563 Some new syntax forms are available:
6565 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
6566 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
6567 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
6568 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
6570 The latter form "\<Sum>x < k. e" used to be based on a separate
6571 function "Summation", which has been discontinued.
6573 * theory Finite_Set: in structured induction proofs, the insert case
6574 is now 'case (insert x F)' instead of the old counterintuitive 'case
6577 * The 'refute' command has been extended to support a much larger
6578 fragment of HOL, including axiomatic type classes, constdefs and
6579 typedefs, inductive datatypes and recursion.
6581 * New tactics 'sat' and 'satx' to prove propositional tautologies.
6582 Requires zChaff with proof generation to be installed. See
6583 HOL/ex/SAT_Examples.thy for examples.
6585 * Datatype induction via method 'induct' now preserves the name of the
6586 induction variable. For example, when proving P(xs::'a list) by
6587 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
6588 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
6589 in unstructured proof scripts.
6591 * Reworked implementation of records. Improved scalability for
6592 records with many fields, avoiding performance problems for type
6593 inference. Records are no longer composed of nested field types, but
6594 of nested extension types. Therefore the record type only grows linear
6595 in the number of extensions and not in the number of fields. The
6596 top-level (users) view on records is preserved. Potential
6597 INCOMPATIBILITY only in strange cases, where the theory depends on the
6598 old record representation. The type generated for a record is called
6599 <record_name>_ext_type.
6601 Flag record_quick_and_dirty_sensitive can be enabled to skip the
6602 proofs triggered by a record definition or a simproc (if
6603 quick_and_dirty is enabled). Definitions of large records can take
6606 New simproc record_upd_simproc for simplification of multiple record
6607 updates enabled by default. Moreover, trivial updates are also
6608 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
6609 occasionally, since simplification is more powerful by default.
6611 * typedef: proper support for polymorphic sets, which contain extra
6612 type-variables in the term.
6614 * Simplifier: automatically reasons about transitivity chains
6615 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
6616 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
6617 old proofs break occasionally as simplification may now solve more
6618 goals than previously.
6620 * Simplifier: converts x <= y into x = y if assumption y <= x is
6621 present. Works for all partial orders (class "order"), in particular
6622 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
6625 * Simplifier: new simproc for "let x = a in f x". If a is a free or
6626 bound variable or a constant then the let is unfolded. Otherwise
6627 first a is simplified to b, and then f b is simplified to g. If
6628 possible we abstract b from g arriving at "let x = b in h x",
6629 otherwise we unfold the let and arrive at g. The simproc can be
6630 enabled/disabled by the reference use_let_simproc. Potential
6631 INCOMPATIBILITY since simplification is more powerful by default.
6633 * Classical reasoning: the meson method now accepts theorems as arguments.
6635 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
6636 jobs to provide advice on the provability of subgoals.
6638 * Theory OrderedGroup and Ring_and_Field: various additions and
6639 improvements to faciliate calculations involving equalities and
6642 The following theorems have been eliminated or modified
6645 abs_eq now named abs_of_nonneg
6646 abs_of_ge_0 now named abs_of_nonneg
6647 abs_minus_eq now named abs_of_nonpos
6648 imp_abs_id now named abs_of_nonneg
6649 imp_abs_neg_id now named abs_of_nonpos
6650 mult_pos now named mult_pos_pos
6651 mult_pos_le now named mult_nonneg_nonneg
6652 mult_pos_neg_le now named mult_nonneg_nonpos
6653 mult_pos_neg2_le now named mult_nonneg_nonpos2
6654 mult_neg now named mult_neg_neg
6655 mult_neg_le now named mult_nonpos_nonpos
6657 * The following lemmas in Ring_and_Field have been added to the simplifier:
6660 not_square_less_zero
6662 The following lemmas have been deleted from Real/RealPow:
6672 * Theory Parity: added rules for simplifying exponents.
6676 The following theorems have been eliminated or modified
6679 list_all_Nil now named list_all.simps(1)
6680 list_all_Cons now named list_all.simps(2)
6681 list_all_conv now named list_all_iff
6682 set_mem_eq now named mem_iff
6684 * Theories SetsAndFunctions and BigO (see HOL/Library) support
6685 asymptotic "big O" calculations. See the notes in BigO.thy.
6690 * Theory RealDef: better support for embedding natural numbers and
6691 integers in the reals.
6693 The following theorems have been eliminated or modified
6696 exp_ge_add_one_self now requires no hypotheses
6697 real_of_int_add reversed direction of equality (use [symmetric])
6698 real_of_int_minus reversed direction of equality (use [symmetric])
6699 real_of_int_diff reversed direction of equality (use [symmetric])
6700 real_of_int_mult reversed direction of equality (use [symmetric])
6702 * Theory RComplete: expanded support for floor and ceiling functions.
6704 * Theory Ln is new, with properties of the natural logarithm
6706 * Hyperreal: There is a new type constructor "star" for making
6707 nonstandard types. The old type names are now type synonyms:
6711 hcomplex = complex star
6713 * Hyperreal: Many groups of similarly-defined constants have been
6714 replaced by polymorphic versions (INCOMPATIBILITY):
6716 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
6718 starset <-- starsetNat, starsetC
6719 *s* <-- *sNat*, *sc*
6720 starset_n <-- starsetNat_n, starsetC_n
6721 *sn* <-- *sNatn*, *scn*
6722 InternalSets <-- InternalNatSets, InternalCSets
6724 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6725 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
6726 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
6727 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
6728 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
6730 * Hyperreal: Many type-specific theorems have been removed in favor of
6731 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
6733 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
6734 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
6735 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
6736 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
6737 right_minus <-- hypreal_add_minus
6738 left_minus <-- {hypreal,hcomplex}_add_minus_left
6739 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
6740 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
6741 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
6742 mult_1_right <-- hcomplex_mult_one_right
6743 mult_zero_left <-- hcomplex_mult_zero_left
6744 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
6745 right_distrib <-- hypnat_add_mult_distrib2
6746 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
6747 right_inverse <-- hypreal_mult_inverse
6748 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
6749 order_refl <-- {hypreal,hypnat}_le_refl
6750 order_trans <-- {hypreal,hypnat}_le_trans
6751 order_antisym <-- {hypreal,hypnat}_le_anti_sym
6752 order_less_le <-- {hypreal,hypnat}_less_le
6753 linorder_linear <-- {hypreal,hypnat}_le_linear
6754 add_left_mono <-- {hypreal,hypnat}_add_left_mono
6755 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
6756 add_nonneg_nonneg <-- hypreal_le_add_order
6758 * Hyperreal: Separate theorems having to do with type-specific
6759 versions of constants have been merged into theorems that apply to the
6760 new polymorphic constants (INCOMPATIBILITY):
6762 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
6763 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
6764 STAR_Un <-- {STAR,NatStar,STARC}_Un
6765 STAR_Int <-- {STAR,NatStar,STARC}_Int
6766 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
6767 STAR_subset <-- {STAR,NatStar,STARC}_subset
6768 STAR_mem <-- {STAR,NatStar,STARC}_mem
6769 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
6770 STAR_diff <-- {STAR,STARC}_diff
6771 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
6772 STARC_hcomplex_of_complex}_image_subset
6773 starset_n_Un <-- starset{Nat,C}_n_Un
6774 starset_n_Int <-- starset{Nat,C}_n_Int
6775 starset_n_Compl <-- starset{Nat,C}_n_Compl
6776 starset_n_diff <-- starset{Nat,C}_n_diff
6777 InternalSets_Un <-- Internal{Nat,C}Sets_Un
6778 InternalSets_Int <-- Internal{Nat,C}Sets_Int
6779 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
6780 InternalSets_diff <-- Internal{Nat,C}Sets_diff
6781 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
6782 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
6783 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
6784 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
6785 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
6786 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6787 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
6788 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
6789 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
6790 starfun_diff <-- starfun{C,RC,CR}_diff
6791 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
6792 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
6793 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
6794 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
6795 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
6796 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
6797 starfun_Id <-- starfunC_Id
6798 starfun_approx <-- starfun{Nat,CR}_approx
6799 starfun_capprox <-- starfun{C,RC}_capprox
6800 starfun_abs <-- starfunNat_rabs
6801 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
6802 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
6803 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
6804 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
6805 starfun_add_capprox <-- starfun{C,RC}_add_capprox
6806 starfun_add_approx <-- starfunCR_add_approx
6807 starfun_inverse_inverse <-- starfunC_inverse_inverse
6808 starfun_divide <-- starfun{C,CR,RC}_divide
6809 starfun_n <-- starfun{Nat,C}_n
6810 starfun_n_mult <-- starfun{Nat,C}_n_mult
6811 starfun_n_add <-- starfun{Nat,C}_n_add
6812 starfun_n_add_minus <-- starfunNat_n_add_minus
6813 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
6814 starfun_n_minus <-- starfun{Nat,C}_n_minus
6815 starfun_n_eq <-- starfun{Nat,C}_n_eq
6817 star_n_add <-- {hypreal,hypnat,hcomplex}_add
6818 star_n_minus <-- {hypreal,hcomplex}_minus
6819 star_n_diff <-- {hypreal,hcomplex}_diff
6820 star_n_mult <-- {hypreal,hcomplex}_mult
6821 star_n_inverse <-- {hypreal,hcomplex}_inverse
6822 star_n_le <-- {hypreal,hypnat}_le
6823 star_n_less <-- {hypreal,hypnat}_less
6824 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
6825 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
6826 star_n_abs <-- hypreal_hrabs
6827 star_n_divide <-- hcomplex_divide
6829 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
6830 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
6831 star_of_diff <-- hypreal_of_real_diff
6832 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
6833 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
6834 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
6835 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
6836 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
6837 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
6838 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
6839 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
6840 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
6841 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
6842 star_of_number_of <-- {hypreal,hcomplex}_number_of
6843 star_of_number_less <-- number_of_less_hypreal_of_real_iff
6844 star_of_number_le <-- number_of_le_hypreal_of_real_iff
6845 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
6846 star_of_less_number <-- hypreal_of_real_less_number_of_iff
6847 star_of_le_number <-- hypreal_of_real_le_number_of_iff
6848 star_of_power <-- hypreal_of_real_power
6849 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
6851 * Hyperreal: new method "transfer" that implements the transfer
6852 principle of nonstandard analysis. With a subgoal that mentions
6853 nonstandard types like "'a star", the command "apply transfer"
6854 replaces it with an equivalent one that mentions only standard types.
6855 To be successful, all free variables must have standard types; non-
6856 standard variables must have explicit universal quantifiers.
6858 * Hyperreal: A theory of Taylor series.
6863 * Discontinued special version of 'constdefs' (which used to support
6864 continuous functions) in favor of the general Pure one with full
6867 * New simplification procedure for solving continuity conditions; it
6868 is much faster on terms with many nested lambda abstractions (cubic
6869 instead of exponential time).
6871 * New syntax for domain package: selector names are now optional.
6872 Parentheses should be omitted unless argument is lazy, for example:
6874 domain 'a stream = cons "'a" (lazy "'a stream")
6876 * New command 'fixrec' for defining recursive functions with pattern
6877 matching; defining multiple functions with mutual recursion is also
6878 supported. Patterns may include the constants cpair, spair, up, sinl,
6879 sinr, or any data constructor defined by the domain package. The given
6880 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
6881 syntax and examples.
6883 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
6884 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
6885 but the proof obligation additionally includes an admissibility
6886 requirement. The packages generate instances of class cpo or pcpo,
6887 with continuity and strictness theorems for Rep and Abs.
6889 * HOLCF: Many theorems have been renamed according to a more standard naming
6890 scheme (INCOMPATIBILITY):
6892 foo_inject: "foo$x = foo$y ==> x = y"
6893 foo_eq: "(foo$x = foo$y) = (x = y)"
6894 foo_less: "(foo$x << foo$y) = (x << y)"
6895 foo_strict: "foo$UU = UU"
6896 foo_defined: "... ==> foo$x ~= UU"
6897 foo_defined_iff: "(foo$x = UU) = (x = UU)"
6902 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
6903 including the First Isomorphism Theorem (on quotienting by the kernel
6906 * ZF/Simplifier: install second copy of type solver that actually
6907 makes use of TC rules declared to Isar proof contexts (or locales);
6908 the old version is still required for ML proof scripts.
6913 * Converted to Isar theory format; use locales instead of axiomatic
6919 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
6922 * Pure/library.ML no longer defines its own option datatype, but uses
6923 that of the SML basis, which has constructors NONE and SOME instead of
6924 None and Some, as well as exception Option.Option instead of OPTION.
6925 The functions the, if_none, is_some, is_none have been adapted
6926 accordingly, while Option.map replaces apsome.
6928 * Pure/library.ML: the exception LIST has been given up in favour of
6929 the standard exceptions Empty and Subscript, as well as
6930 Library.UnequalLengths. Function like Library.hd and Library.tl are
6931 superceded by the standard hd and tl functions etc.
6933 A number of basic list functions are no longer exported to the ML
6934 toplevel, as they are variants of predefined functions. The following
6935 suggests how one can translate existing code:
6937 rev_append xs ys = List.revAppend (xs, ys)
6938 nth_elem (i, xs) = List.nth (xs, i)
6939 last_elem xs = List.last xs
6940 flat xss = List.concat xss
6941 seq fs = List.app fs
6942 partition P xs = List.partition P xs
6943 mapfilter f xs = List.mapPartial f xs
6945 * Pure/library.ML: several combinators for linear functional
6946 transformations, notably reverse application and composition:
6949 (x, y) |-> f f #-> g
6951 * Pure/library.ML: introduced/changed precedence of infix operators:
6953 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
6955 infix 3 o oo ooo oooo;
6956 infix 4 ~~ upto downto;
6958 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
6961 * Pure/library.ML: natural list combinators fold, fold_rev, and
6962 fold_map support linear functional transformations and nesting. For
6965 fold f [x1, ..., xN] y =
6966 y |> f x1 |> ... |> f xN
6968 (fold o fold) f [xs1, ..., xsN] y =
6969 y |> fold f xs1 |> ... |> fold f xsN
6971 fold f [x1, ..., xN] =
6974 (fold o fold) f [xs1, ..., xsN] =
6975 fold f xs1 #> ... #> fold f xsN
6977 * Pure/library.ML: the following selectors on type 'a option are
6980 the: 'a option -> 'a (*partial*)
6981 these: 'a option -> 'a where 'a = 'b list
6982 the_default: 'a -> 'a option -> 'a
6983 the_list: 'a option -> 'a list
6985 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6986 basic operations for association lists, following natural argument
6987 order; moreover the explicit equality predicate passed here avoids
6988 potentially expensive polymorphic runtime equality checks.
6989 The old functions may be expressed as follows:
6991 assoc = uncurry (AList.lookup (op =))
6992 assocs = these oo AList.lookup (op =)
6993 overwrite = uncurry (AList.update (op =)) o swap
6995 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6997 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
6998 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
7000 replacing make_keylist and keyfilter (occassionally used)
7003 make_keylist = AList.make
7004 keyfilter = AList.find (op =)
7006 * eq_fst and eq_snd now take explicit equality parameter, thus
7007 avoiding eqtypes. Naive rewrites:
7009 eq_fst = eq_fst (op =)
7010 eq_snd = eq_snd (op =)
7012 * Removed deprecated apl and apr (rarely used).
7015 apl (n, op) =>>= curry op n
7016 apr (op, m) =>>= fn n => op (n, m)
7018 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
7019 provides a reasonably efficient light-weight implementation of sets as
7022 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
7023 few new operations; existing lookup and update are now curried to
7024 follow natural argument order (for use with fold etc.);
7025 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
7027 * Pure/General: output via the Isabelle channels of
7028 writeln/warning/error etc. is now passed through Output.output, with a
7029 hook for arbitrary transformations depending on the print_mode
7030 (cf. Output.add_mode -- the first active mode that provides a output
7031 function wins). Already formatted output may be embedded into further
7032 text via Output.raw; the result of Pretty.string_of/str_of and derived
7033 functions (string_of_term/cterm/thm etc.) is already marked raw to
7034 accommodate easy composition of diagnostic messages etc. Programmers
7035 rarely need to care about Output.output or Output.raw at all, with
7036 some notable exceptions: Output.output is required when bypassing the
7037 standard channels (writeln etc.), or in token translations to produce
7038 properly formatted results; Output.raw is required when capturing
7039 already output material that will eventually be presented to the user
7040 a second time. For the default print mode, both Output.output and
7041 Output.raw have no effect.
7043 * Pure/General: Output.time_accumulator NAME creates an operator ('a
7044 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
7045 cumulative results are displayed at the end of a batch session.
7047 * Pure/General: File.sysify_path and File.quote_sysify path have been
7048 replaced by File.platform_path and File.shell_path (with appropriate
7049 hooks). This provides a clean interface for unusual systems where the
7050 internal and external process view of file names are different.
7052 * Pure: more efficient orders for basic syntactic entities: added
7053 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
7054 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
7055 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
7056 orders now -- potential INCOMPATIBILITY for code that depends on a
7057 particular order for Symtab.keys, Symtab.dest, etc. (consider using
7058 Library.sort_strings on result).
7060 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
7061 fold_types traverse types/terms from left to right, observing natural
7062 argument order. Supercedes previous foldl_XXX versions, add_frees,
7063 add_vars etc. have been adapted as well: INCOMPATIBILITY.
7065 * Pure: name spaces have been refined, with significant changes of the
7066 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
7067 to extern(_table). The plain name entry path is superceded by a
7068 general 'naming' context, which also includes the 'policy' to produce
7069 a fully qualified name and external accesses of a fully qualified
7070 name; NameSpace.extend is superceded by context dependent
7071 Sign.declare_name. Several theory and proof context operations modify
7072 the naming context. Especially note Theory.restore_naming and
7073 ProofContext.restore_naming to get back to a sane state; note that
7074 Theory.add_path is no longer sufficient to recover from
7075 Theory.absolute_path in particular.
7077 * Pure: new flags short_names (default false) and unique_names
7078 (default true) for controlling output of qualified names. If
7079 short_names is set, names are printed unqualified. If unique_names is
7080 reset, the name prefix is reduced to the minimum required to achieve
7081 the original result when interning again, even if there is an overlap
7082 with earlier declarations.
7084 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
7085 now 'extend', and 'merge' gets an additional Pretty.pp argument
7086 (useful for printing error messages). INCOMPATIBILITY.
7088 * Pure: major reorganization of the theory context. Type Sign.sg and
7089 Theory.theory are now identified, referring to the universal
7090 Context.theory (see Pure/context.ML). Actual signature and theory
7091 content is managed as theory data. The old code and interfaces were
7092 spread over many files and structures; the new arrangement introduces
7093 considerable INCOMPATIBILITY to gain more clarity:
7095 Context -- theory management operations (name, identity, inclusion,
7096 parents, ancestors, merge, etc.), plus generic theory data;
7098 Sign -- logical signature and syntax operations (declaring consts,
7099 types, etc.), plus certify/read for common entities;
7101 Theory -- logical theory operations (stating axioms, definitions,
7102 oracles), plus a copy of logical signature operations (consts,
7103 types, etc.); also a few basic management operations (Theory.copy,
7106 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
7107 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
7108 for convenience -- they merely return the theory.
7110 * Pure: type Type.tsig is superceded by theory in most interfaces.
7112 * Pure: the Isar proof context type is already defined early in Pure
7113 as Context.proof (note that ProofContext.context and Proof.context are
7114 aliases, where the latter is the preferred name). This enables other
7115 Isabelle components to refer to that type even before Isar is present.
7117 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
7118 typeK, constK, axiomK, oracleK), but provide explicit operations for
7119 any of these kinds. For example, Sign.intern typeK is now
7120 Sign.intern_type, Theory.hide_space Sign.typeK is now
7121 Theory.hide_types. Also note that former
7122 Theory.hide_classes/types/consts are now
7123 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
7124 internalize their arguments! INCOMPATIBILITY.
7126 * Pure: get_thm interface (of PureThy and ProofContext) expects
7127 datatype thmref (with constructors Name and NameSelection) instead of
7128 plain string -- INCOMPATIBILITY;
7130 * Pure: cases produced by proof methods specify options, where NONE
7131 means to remove case bindings -- INCOMPATIBILITY in
7134 * Pure: the following operations retrieve axioms or theorems from a
7135 theory node or theory hierarchy, respectively:
7137 Theory.axioms_of: theory -> (string * term) list
7138 Theory.all_axioms_of: theory -> (string * term) list
7139 PureThy.thms_of: theory -> (string * thm) list
7140 PureThy.all_thms_of: theory -> (string * thm) list
7142 * Pure: print_tac now outputs the goal through the trace channel.
7144 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
7145 Reference Toplevel.debug (default false) controls detailed printing
7146 and tracing of low-level exceptions; Toplevel.profiling (default 0)
7147 controls execution profiling -- set to 1 for time and 2 for space
7148 (both increase the runtime).
7150 * Isar session: The initial use of ROOT.ML is now always timed,
7151 i.e. the log will show the actual process times, in contrast to the
7152 elapsed wall-clock time that the outer shell wrapper produces.
7154 * Simplifier: improved handling of bound variables (nameless
7155 representation, avoid allocating new strings). Simprocs that invoke
7156 the Simplifier recursively should use Simplifier.inherit_bounds to
7157 avoid local name clashes. Failure to do so produces warnings
7158 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
7159 for further details.
7161 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
7162 bindings for all theorems stored within a given theory; this may help
7163 in porting non-Isar theories to Isar ones, while keeping ML proof
7164 scripts for the time being.
7166 * ML operator HTML.with_charset specifies the charset begin used for
7167 generated HTML files. For example:
7169 HTML.with_charset "utf-8" use_thy "Hebrew";
7170 HTML.with_charset "utf-8" use_thy "Chinese";
7175 * Allow symlinks to all proper Isabelle executables (Isabelle,
7176 isabelle, isatool etc.).
7178 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
7179 isatool doc, isatool mkdir, display_drafts etc.).
7181 * isatool usedir: option -f allows specification of the ML file to be
7182 used by Isabelle; default is ROOT.ML.
7184 * New isatool version outputs the version identifier of the Isabelle
7185 distribution being used.
7187 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
7188 (containing Boolean satisfiability problems) into Isabelle/HOL
7193 New in Isabelle2004 (April 2004)
7194 --------------------------------
7198 * Provers/order.ML: new efficient reasoner for partial and linear orders.
7199 Replaces linorder.ML.
7201 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
7202 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
7203 (\<a>...\<z>), are now considered normal letters, and can therefore
7204 be used anywhere where an ASCII letter (a...zA...Z) has until
7205 now. COMPATIBILITY: This obviously changes the parsing of some
7206 terms, especially where a symbol has been used as a binder, say
7207 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
7208 as an identifier. Fix it by inserting a space around former
7209 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
7210 existing theory and ML files.
7212 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
7214 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
7215 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
7216 a normal (but invisible) letter. For multiple letter subscripts repeat
7217 \<^isub> like this: x\<^isub>1\<^isub>2.
7219 * Pure: There are now sub-/superscripts that can span more than one
7220 character. Text between \<^bsub> and \<^esub> is set in subscript in
7221 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
7222 superscript. The new control characters are not identifier parts.
7224 * Pure: Control-symbols of the form \<^raw:...> will literally print the
7225 content of "..." to the latex file instead of \isacntrl... . The "..."
7226 may consist of any printable characters excluding the end bracket >.
7228 * Pure: Using new Isar command "finalconsts" (or the ML functions
7229 Theory.add_finals or Theory.add_finals_i) it is now possible to
7230 declare constants "final", which prevents their being given a definition
7231 later. It is useful for constants whose behaviour is fixed axiomatically
7232 rather than definitionally, such as the meta-logic connectives.
7234 * Pure: 'instance' now handles general arities with general sorts
7235 (i.e. intersections of classes),
7237 * Presentation: generated HTML now uses a CSS style sheet to make layout
7238 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
7239 It can be changed to alter the colors/layout of generated pages.
7244 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
7245 cut_tac, subgoal_tac and thin_tac:
7246 - Now understand static (Isar) contexts. As a consequence, users of Isar
7247 locales are no longer forced to write Isar proof scripts.
7248 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
7250 - INCOMPATIBILITY: names of variables to be instantiated may no
7251 longer be enclosed in quotes. Instead, precede variable name with `?'.
7252 This is consistent with the instantiation attribute "where".
7254 * Attributes "where" and "of":
7255 - Now take type variables of instantiated theorem into account when reading
7256 the instantiation string. This fixes a bug that caused instantiated
7257 theorems to have too special types in some circumstances.
7258 - "where" permits explicit instantiations of type variables.
7260 * Calculation commands "moreover" and "also" no longer interfere with
7261 current facts ("this"), admitting arbitrary combinations with "then"
7265 - Goal statements involving the context element "includes" no longer
7266 generate theorems with internal delta predicates (those ending on
7267 "_axioms") in the premise.
7268 Resolve particular premise with <locale>.intro to obtain old form.
7269 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
7270 specification and "includes" elements in goal statement.
7271 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
7272 [intro?] and [elim?] (respectively) by default.
7273 - Experimental command for instantiation of locales in proof contexts:
7274 instantiate <label>[<attrs>]: <loc>
7275 Instantiates locale <loc> and adds all its theorems to the current context
7276 taking into account their attributes. Label and attrs are optional
7277 modifiers, like in theorem declarations. If present, names of
7278 instantiated theorems are qualified with <label>, and the attributes
7279 <attrs> are applied after any attributes these theorems might have already.
7280 If the locale has assumptions, a chained fact of the form
7281 "<loc> t1 ... tn" is expected from which instantiations of the parameters
7282 are derived. The command does not support old-style locales declared
7283 with "locale (open)".
7284 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
7286 * HOL: Tactic emulation methods induct_tac and case_tac understand static
7292 * Proof import: new image HOL4 contains the imported library from
7293 the HOL4 system with about 2500 theorems. It is imported by
7294 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
7295 can be used like any other Isabelle image. See
7296 HOL/Import/HOL/README for more information.
7299 - Much improved handling of linear and partial orders.
7300 Reasoners for linear and partial orders are set up for type classes
7301 "linorder" and "order" respectively, and are added to the default simpset
7302 as solvers. This means that the simplifier can build transitivity chains
7303 to solve goals from the assumptions.
7304 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
7305 of blast or auto after simplification become unnecessary because the goal
7306 is solved by simplification already.
7308 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
7309 all proved in axiomatic type classes for semirings, rings and fields.
7312 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
7313 now formalized using the Ring_and_Field theory mentioned above.
7314 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
7315 than before, because now they are set up once in a generic manner.
7316 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
7317 Look for the general versions in Ring_and_Field (and Power if they concern
7320 * Type "rat" of the rational numbers is now available in HOL-Complex.
7323 - Record types are now by default printed with their type abbreviation
7324 instead of the list of all field types. This can be configured via
7325 the reference "print_record_type_abbr".
7326 - Simproc "record_upd_simproc" for simplification of multiple updates added
7327 (not enabled by default).
7328 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
7329 EX x. x = sel r to True (not enabled by default).
7330 - Tactic "record_split_simp_tac" to split and simplify records added.
7332 * 'specification' command added, allowing for definition by
7333 specification. There is also an 'ax_specification' command that
7334 introduces the new constants axiomatically.
7336 * arith(_tac) is now able to generate counterexamples for reals as well.
7338 * HOL-Algebra: new locale "ring" for non-commutative rings.
7340 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
7341 definitions, thanks to Sava Krsti\'{c} and John Matthews.
7343 * HOL-Matrix: a first theory for matrices in HOL with an application of
7344 matrix theory to linear programming.
7346 * Unions and Intersections:
7347 The latex output syntax of UN and INT has been changed
7348 from "\Union x \in A. B" to "\Union_{x \in A} B"
7349 i.e. the index formulae has become a subscript.
7350 Similarly for "\Union x. B", and for \Inter instead of \Union.
7352 * Unions and Intersections over Intervals:
7353 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
7354 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
7355 like in normal math, and corresponding versions for < and for intersection.
7357 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
7358 lexicographic dictonary ordering has been added as "lexord".
7360 * ML: the legacy theory structures Int and List have been removed. They had
7361 conflicted with ML Basis Library structures having the same names.
7363 * 'refute' command added to search for (finite) countermodels. Only works
7364 for a fragment of HOL. The installation of an external SAT solver is
7365 highly recommended. See "HOL/Refute.thy" for details.
7367 * 'quickcheck' command: Allows to find counterexamples by evaluating
7368 formulae under an assignment of free variables to random values.
7369 In contrast to 'refute', it can deal with inductive datatypes,
7370 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
7376 * Streams now come with concatenation and are part of the HOLCF image
7380 New in Isabelle2003 (May 2003)
7381 ------------------------------
7385 * Provers/simplifier:
7387 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
7388 Assumptions are now subject to complete mutual simplification,
7389 not just from left to right. The simplifier now preserves
7390 the order of assumptions.
7392 Potential INCOMPATIBILITY:
7394 -- simp sometimes diverges where the old version did
7395 not, e.g. invoking simp on the goal
7397 [| P (f x); y = x; f x = f y |] ==> Q
7399 now gives rise to the infinite reduction sequence
7401 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
7403 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
7406 -- Tactics combining classical reasoner and simplification (such as auto)
7407 are also affected by this change, because many of them rely on
7408 simp. They may sometimes diverge as well or yield a different numbers
7409 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
7410 in case of problems. Sometimes subsequent calls to the classical
7411 reasoner will fail because a preceeding call to the simplifier too
7412 eagerly simplified the goal, e.g. deleted redundant premises.
7414 - The simplifier trace now shows the names of the applied rewrite rules
7416 - You can limit the number of recursive invocations of the simplifier
7417 during conditional rewriting (where the simplifie tries to solve the
7418 conditions before applying the rewrite rule):
7419 ML "simp_depth_limit := n"
7420 where n is an integer. Thus you can force termination where previously
7421 the simplifier would diverge.
7423 - Accepts free variables as head terms in congruence rules. Useful in Isar.
7425 - No longer aborts on failed congruence proof. Instead, the
7426 congruence is ignored.
7428 * Pure: New generic framework for extracting programs from constructive
7429 proofs. See HOL/Extraction.thy for an example instantiation, as well
7430 as HOL/Extraction for some case studies.
7432 * Pure: The main goal of the proof state is no longer shown by default, only
7433 the subgoals. This behaviour is controlled by a new flag.
7434 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
7435 (ML: Proof.show_main_goal).
7437 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
7438 rules whose conclusion matches subgoal 1:
7439 PG menu: Isabelle/Isar -> Show me -> matching rules
7440 The rules are ordered by how closely they match the subgoal.
7441 In particular, rules that solve a subgoal outright are displayed first
7442 (or rather last, the way they are printed).
7443 (ML: ProofGeneral.print_intros())
7445 * Pure: New flag trace_unify_fail causes unification to print
7446 diagnostic information (PG: in trace buffer) when it fails. This is
7447 useful for figuring out why single step proofs like rule, erule or
7450 * Pure: Locale specifications now produce predicate definitions
7451 according to the body of text (covering assumptions modulo local
7452 definitions); predicate "loc_axioms" covers newly introduced text,
7453 while "loc" is cumulative wrt. all included locale expressions; the
7454 latter view is presented only on export into the global theory
7455 context; potential INCOMPATIBILITY, use "(open)" option to fall back
7456 on the old view without predicates;
7458 * Pure: predefined locales "var" and "struct" are useful for sharing
7459 parameters (as in CASL, for example); just specify something like
7460 ``var x + var y + struct M'' as import;
7462 * Pure: improved thms_containing: proper indexing of facts instead of
7463 raw theorems; check validity of results wrt. current name space;
7464 include local facts of proof configuration (also covers active
7465 locales), cover fixed variables in index; may use "_" in term
7466 specification; an optional limit for the number of printed facts may
7467 be given (the default is 40);
7469 * Pure: disallow duplicate fact bindings within new-style theory files
7472 * Provers: improved induct method: assumptions introduced by case
7473 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
7474 the goal statement); "foo" still refers to all facts collectively;
7476 * Provers: the function blast.overloaded has been removed: all constants
7477 are regarded as potentially overloaded, which improves robustness in exchange
7478 for slight decrease in efficiency;
7480 * Provers/linorder: New generic prover for transitivity reasoning over
7481 linear orders. Note: this prover is not efficient!
7483 * Isar: preview of problems to finish 'show' now produce an error
7484 rather than just a warning (in interactive mode);
7491 - Produces a counter example if it cannot prove a goal.
7492 Note that the counter example may be spurious if the goal is not a formula
7493 of quantifier-free linear arithmetic.
7494 In ProofGeneral the counter example appears in the trace buffer.
7496 - Knows about div k and mod k where k is a numeral of type nat or int.
7498 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
7499 linear arithmetic fails. This takes account of quantifiers and divisibility.
7500 Presburger arithmetic can also be called explicitly via presburger(_tac).
7502 * simp's arithmetic capabilities have been enhanced a bit: it now
7503 takes ~= in premises into account (by performing a case split);
7505 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
7506 are distributed over a sum of terms;
7508 * New tactic "trans_tac" and method "trans" instantiate
7509 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
7512 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
7513 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
7515 * 'typedef' command has new option "open" to suppress the set
7518 * functions Min and Max on finite sets have been introduced (theory
7521 * attribute [symmetric] now works for relations as well; it turns
7522 (x,y) : R^-1 into (y,x) : R, and vice versa;
7524 * induct over a !!-quantified statement (say !!x1..xn):
7525 each "case" automatically performs "fix x1 .. xn" with exactly those names.
7527 * Map: `empty' is no longer a constant but a syntactic abbreviation for
7528 %x. None. Warning: empty_def now refers to the previously hidden definition
7531 * Algebra: formalization of classical algebra. Intended as base for
7532 any algebraic development in Isabelle. Currently covers group theory
7533 (up to Sylow's theorem) and ring theory (Universal Property of
7534 Univariate Polynomials). Contributions welcome;
7536 * GroupTheory: deleted, since its material has been moved to Algebra;
7538 * Complex: new directory of the complex numbers with numeric constants,
7539 nonstandard complex numbers, and some complex analysis, standard and
7540 nonstandard (Jacques Fleuriot);
7542 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
7544 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
7547 * Real/HahnBanach: updated and adapted to locales;
7549 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
7552 * UNITY: added the Meier-Sanders theory of progress sets;
7554 * MicroJava: bytecode verifier and lightweight bytecode verifier
7555 as abstract algorithms, instantiated to the JVM;
7557 * Bali: Java source language formalization. Type system, operational
7558 semantics, axiomatic semantics. Supported language features:
7559 classes, interfaces, objects,virtual methods, static methods,
7560 static/instance fields, arrays, access modifiers, definite
7561 assignment, exceptions.
7566 * ZF/Constructible: consistency proof for AC (Gdel's constructible
7569 * Main ZF: virtually all theories converted to new-style format;
7574 * Pure: Tactic.prove provides sane interface for internal proofs;
7575 omits the infamous "standard" operation, so this is more appropriate
7576 than prove_goalw_cterm in many situations (e.g. in simprocs);
7578 * Pure: improved error reporting of simprocs;
7580 * Provers: Simplifier.simproc(_i) provides sane interface for setting
7584 *** Document preparation ***
7586 * uses \par instead of \\ for line breaks in theory text. This may
7587 shift some page breaks in large documents. To get the old behaviour
7588 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
7590 * minimized dependencies of isabelle.sty and isabellesym.sty on
7593 * \<euro> now needs package babel/greek instead of marvosym (which
7596 * normal size for \<zero>...\<nine> (uses \mathbf instead of
7601 New in Isabelle2002 (March 2002)
7602 --------------------------------
7604 *** Document preparation ***
7606 * greatly simplified document preparation setup, including more
7607 graceful interpretation of isatool usedir -i/-d/-D options, and more
7608 instructive isatool mkdir; users should basically be able to get
7609 started with "isatool mkdir HOL Test && isatool make"; alternatively,
7610 users may run a separate document processing stage manually like this:
7611 "isatool usedir -D output HOL Test && isatool document Test/output";
7613 * theory dependency graph may now be incorporated into documents;
7614 isatool usedir -g true will produce session_graph.eps/.pdf for use
7615 with \includegraphics of LaTeX;
7617 * proper spacing of consecutive markup elements, especially text
7618 blocks after section headings;
7620 * support bold style (for single symbols only), input syntax is like
7621 this: "\<^bold>\<alpha>" or "\<^bold>A";
7623 * \<bullet> is now output as bold \cdot by default, which looks much
7624 better in printed text;
7626 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
7627 note that these symbols are currently unavailable in Proof General /
7628 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
7630 * isatool latex no longer depends on changed TEXINPUTS, instead
7631 isatool document copies the Isabelle style files to the target
7637 * Pure/Provers: improved proof by cases and induction;
7638 - 'case' command admits impromptu naming of parameters (such as
7640 - 'induct' method divinates rule instantiation from the inductive
7641 claim; no longer requires excessive ?P bindings for proper
7642 instantiation of cases;
7643 - 'induct' method properly enumerates all possibilities of set/type
7644 rules; as a consequence facts may be also passed through *type*
7645 rules without further ado;
7646 - 'induct' method now derives symbolic cases from the *rulified*
7647 rule (before it used to rulify cases stemming from the internal
7648 atomized version); this means that the context of a non-atomic
7649 statement becomes is included in the hypothesis, avoiding the
7650 slightly cumbersome show "PROP ?case" form;
7651 - 'induct' may now use elim-style induction rules without chaining
7652 facts, using ``missing'' premises from the goal state; this allows
7653 rules stemming from inductive sets to be applied in unstructured
7654 scripts, while still benefitting from proper handling of non-atomic
7655 statements; NB: major inductive premises need to be put first, all
7656 the rest of the goal is passed through the induction;
7657 - 'induct' proper support for mutual induction involving non-atomic
7658 rule statements (uses the new concept of simultaneous goals, see
7660 - append all possible rule selections, but only use the first
7661 success (no backtracking);
7662 - removed obsolete "(simplified)" and "(stripped)" options of methods;
7663 - undeclared rule case names default to numbers 1, 2, 3, ...;
7664 - added 'print_induct_rules' (covered by help item in recent Proof
7666 - moved induct/cases attributes to Pure, methods to Provers;
7667 - generic method setup instantiated for FOL and HOL;
7669 * Pure: support multiple simultaneous goal statements, for example
7670 "have a: A and b: B" (same for 'theorem' etc.); being a pure
7671 meta-level mechanism, this acts as if several individual goals had
7672 been stated separately; in particular common proof methods need to be
7673 repeated in order to cover all claims; note that a single elimination
7674 step is *not* sufficient to establish the two conjunctions, so this
7677 assume "A & B" then have A and B .. (*".." fails*)
7679 better use "obtain" in situations as above; alternative refer to
7680 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
7682 * Pure: proper integration with ``locales''; unlike the original
7683 version by Florian Kammller, Isar locales package high-level proof
7684 contexts rather than raw logical ones (e.g. we admit to include
7685 attributes everywhere); operations on locales include merge and
7686 rename; support for implicit arguments (``structures''); simultaneous
7687 type-inference over imports and text; see also HOL/ex/Locales.thy for
7690 * Pure: the following commands have been ``localized'', supporting a
7691 target locale specification "(in name)": 'lemma', 'theorem',
7692 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
7693 stored both within the locale and at the theory level (exported and
7694 qualified by the locale name);
7696 * Pure: theory goals may now be specified in ``long'' form, with
7697 ad-hoc contexts consisting of arbitrary locale elements. for example
7698 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
7699 definitions may be given, too); the result is a meta-level rule with
7700 the context elements being discharged in the obvious way;
7702 * Pure: new proof command 'using' allows to augment currently used
7703 facts after a goal statement ('using' is syntactically analogous to
7704 'apply', but acts on the goal's facts only); this allows chained facts
7705 to be separated into parts given before and after a claim, as in
7706 ``from a and b have C using d and e <proof>'';
7708 * Pure: renamed "antecedent" case to "rule_context";
7710 * Pure: new 'judgment' command records explicit information about the
7711 object-logic embedding (used by several tools internally); no longer
7712 use hard-wired "Trueprop";
7714 * Pure: added 'corollary' command;
7716 * Pure: fixed 'token_translation' command;
7718 * Pure: removed obsolete 'exported' attribute;
7720 * Pure: dummy pattern "_" in is/let is now automatically lifted over
7721 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
7722 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
7724 * Pure: method 'atomize' presents local goal premises as object-level
7725 statements (atomic meta-level propositions); setup controlled via
7726 rewrite rules declarations of 'atomize' attribute; example
7727 application: 'induct' method with proper rule statements in improper
7730 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
7731 now consider the syntactic context of assumptions, giving a better
7732 chance to get type-inference of the arguments right (this is
7733 especially important for locales);
7735 * Pure: "sorry" no longer requires quick_and_dirty in interactive
7738 * Pure/obtain: the formal conclusion "thesis", being marked as
7739 ``internal'', may no longer be reference directly in the text;
7740 potential INCOMPATIBILITY, may need to use "?thesis" in rare
7743 * Pure: generic 'sym' attribute which declares a rule both as pure
7744 'elim?' and for the 'symmetric' operation;
7746 * Pure: marginal comments ``--'' may now occur just anywhere in the
7747 text; the fixed correlation with particular command syntax has been
7750 * Pure: new method 'rules' is particularly well-suited for proof
7751 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
7752 but often produces more compact proof terms with less detours;
7754 * Pure/Provers/classical: simplified integration with pure rule
7755 attributes and methods; the classical "intro?/elim?/dest?"
7756 declarations coincide with the pure ones; the "rule" method no longer
7757 includes classically swapped intros; "intro" and "elim" methods no
7758 longer pick rules from the context; also got rid of ML declarations
7759 AddXIs/AddXEs/AddXDs; all of this has some potential for
7762 * Provers/classical: attribute 'swapped' produces classical inversions
7763 of introduction rules;
7765 * Provers/simplifier: 'simplified' attribute may refer to explicit
7766 rules instead of full simplifier context; 'iff' attribute handles
7769 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
7771 * HOL: 'recdef' now fails on unfinished automated proofs, use
7772 "(permissive)" option to recover old behavior;
7774 * HOL: 'inductive' no longer features separate (collective) attributes
7775 for 'intros' (was found too confusing);
7777 * HOL: properly declared induction rules less_induct and
7783 * HOL: moved over to sane numeral syntax; the new policy is as
7786 - 0 and 1 are polymorphic constants, which are defined on any
7787 numeric type (nat, int, real etc.);
7789 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
7790 binary representation internally;
7792 - type nat has special constructor Suc, and generally prefers Suc 0
7793 over 1::nat and Suc (Suc 0) over 2::nat;
7795 This change may cause significant problems of INCOMPATIBILITY; here
7796 are some hints on converting existing sources:
7798 - due to the new "num" token, "-0" and "-1" etc. are now atomic
7799 entities, so expressions involving "-" (unary or binary minus) need
7800 to be spaced properly;
7802 - existing occurrences of "1" may need to be constraint "1::nat" or
7803 even replaced by Suc 0; similar for old "2";
7805 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
7807 - remove all special provisions on numerals in proofs;
7809 * HOL: simp rules nat_number expand numerals on nat to Suc/0
7810 representation (depends on bin_arith_simps in the default context);
7812 * HOL: symbolic syntax for x^2 (numeral 2);
7814 * HOL: the class of all HOL types is now called "type" rather than
7815 "term"; INCOMPATIBILITY, need to adapt references to this type class
7816 in axclass/classes, instance/arities, and (usually rare) occurrences
7817 in typings (of consts etc.); internally the class is called
7818 "HOL.type", ML programs should refer to HOLogic.typeS;
7820 * HOL/record package improvements:
7821 - new derived operations "fields" to build a partial record section,
7822 "extend" to promote a fixed record to a record scheme, and
7823 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
7824 declared as simp by default;
7825 - shared operations ("more", "fields", etc.) now need to be always
7826 qualified) --- potential INCOMPATIBILITY;
7827 - removed "make_scheme" operations (use "make" with "extend") --
7829 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
7830 - provides cases/induct rules for use with corresponding Isar
7831 methods (for concrete records, record schemes, concrete more
7832 parts, and schematic more parts -- in that order);
7833 - internal definitions directly based on a light-weight abstract
7834 theory of product types over typedef rather than datatype;
7836 * HOL: generic code generator for generating executable ML code from
7837 specifications; specific support for HOL constructs such as inductive
7838 datatypes and sets, as well as recursive functions; can be invoked
7839 via 'generate_code' theory section;
7841 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
7843 * HOL: consolidated and renamed several theories. In particular:
7844 Ord.thy has been absorbed into HOL.thy
7845 String.thy has been absorbed into List.thy
7847 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
7848 (beware of argument permutation!);
7850 * HOL: linorder_less_split superseded by linorder_cases;
7852 * HOL/List: "nodups" renamed to "distinct";
7854 * HOL: added "The" definite description operator; move Hilbert's "Eps"
7855 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
7856 - Ex_def has changed, now need to use some_eq_ex
7858 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
7859 in this (rare) case use:
7861 delSWrapper "split_all_tac"
7862 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
7864 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
7867 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
7868 Isabelle's type classes, ^ on functions and relations has too general
7869 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
7870 necessary to attach explicit type constraints;
7872 * HOL/Relation: the prefix name of the infix "O" has been changed from
7873 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
7874 renamed accordingly (eg "compI" -> "rel_compI").
7876 * HOL: syntax translations now work properly with numerals and records
7879 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
7880 of "lam" -- INCOMPATIBILITY;
7882 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
7883 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
7884 renamed "Product_Type.unit";
7886 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
7888 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
7889 the "cases" method);
7891 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
7894 * HOL/IMP: updated and converted to new-style theory format; several
7895 parts turned into readable document, with proper Isar proof texts and
7896 some explanations (by Gerwin Klein);
7898 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
7900 * HOL-Hyperreal is now a logic image;
7905 * Isar: consts/constdefs supports mixfix syntax for continuous
7908 * Isar: domain package adapted to new-style theory format, e.g. see
7911 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
7912 potential INCOMPATIBILITY; now use plain induct_tac instead of former
7913 lift.induct_tac, always use UU instead of Undef;
7915 * HOLCF/IMP: updated and converted to new-style theory;
7920 * Isar: proper integration of logic-specific tools and packages,
7921 including theory commands '(co)inductive', '(co)datatype',
7922 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
7923 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
7925 * theory Main no longer includes AC; for the Axiom of Choice, base
7926 your theory on Main_ZFC;
7928 * the integer library now covers quotients and remainders, with many
7929 laws relating division to addition, multiplication, etc.;
7931 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
7932 typeless version of the formalism;
7934 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
7937 * ZF/Induct: new directory for examples of inductive definitions,
7938 including theory Multiset for multiset orderings; converted to
7939 new-style theory format;
7941 * ZF: many new theorems about lists, ordinals, etc.;
7946 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
7947 variable proof controls level of detail: 0 = no proofs (only oracle
7948 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
7949 also ref manual for further ML interfaces;
7951 * Pure/axclass: removed obsolete ML interface
7952 goal_subclass/goal_arity;
7954 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
7955 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
7956 separate tokens, so expressions involving minus need to be spaced
7959 * Pure/syntax: support non-oriented infixes, using keyword "infix"
7960 rather than "infixl" or "infixr";
7962 * Pure/syntax: concrete syntax for dummy type variables admits genuine
7963 sort constraint specifications in type inference; e.g. "x::_::foo"
7964 ensures that the type of "x" is of sort "foo" (but not necessarily a
7967 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
7968 control output of nested => (types); the default behavior is
7971 * Pure/syntax: builtin parse translation for "_constify" turns valued
7972 tokens into AST constants;
7974 * Pure/syntax: prefer later declarations of translations and print
7975 translation functions; potential INCOMPATIBILITY: need to reverse
7976 multiple declarations for same syntax element constant;
7978 * Pure/show_hyps reset by default (in accordance to existing Isar
7981 * Provers/classical: renamed addaltern to addafter, addSaltern to
7984 * Provers/clasimp: ``iff'' declarations now handle conditional rules
7987 * system: tested support for MacOS X; should be able to get Isabelle +
7988 Proof General to work in a plain Terminal after installing Poly/ML
7989 (e.g. from the Isabelle distribution area) and GNU bash alone
7990 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
7991 support requires further installations, e.g. from
7992 http://fink.sourceforge.net/);
7994 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
7996 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
7997 of 40 MB), cf. ML_OPTIONS;
7999 * system: Proof General keywords specification is now part of the
8000 Isabelle distribution (see etc/isar-keywords.el);
8002 * system: support for persistent Proof General sessions (refrain from
8003 outdating all loaded theories on startup); user may create writable
8004 logic images like this: ``isabelle -q HOL Test'';
8006 * system: smart selection of Isabelle process versus Isabelle
8007 interface, accommodates case-insensitive file systems (e.g. HFS+); may
8008 run both "isabelle" and "Isabelle" even if file names are badly
8009 damaged (executable inspects the case of the first letter of its own
8010 name); added separate "isabelle-process" and "isabelle-interface";
8012 * system: refrain from any attempt at filtering input streams; no
8013 longer support ``8bit'' encoding of old isabelle font, instead proper
8014 iso-latin characters may now be used; the related isatools
8015 "symbolinput" and "nonascii" have disappeared as well;
8017 * system: removed old "xterm" interface (the print modes "xterm" and
8018 "xterm_color" are still available for direct use in a suitable
8023 New in Isabelle99-2 (February 2001)
8024 -----------------------------------
8026 *** Overview of INCOMPATIBILITIES ***
8028 * HOL: please note that theories in the Library and elsewhere often use the
8029 new-style (Isar) format; to refer to their theorems in an ML script you must
8030 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
8032 * HOL: inductive package no longer splits induction rule aggressively,
8033 but only as far as specified by the introductions given; the old
8034 format may be recovered via ML function complete_split_rule or attribute
8035 'split_rule (complete)';
8037 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
8038 gfp_Tarski to gfp_unfold;
8040 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
8042 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
8043 relation); infix "^^" has been renamed "``"; infix "``" has been
8044 renamed "`"; "univalent" has been renamed "single_valued";
8046 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
8049 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
8051 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
8053 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
8054 consequence, it is no longer monotonic wrt. the local goal context
8055 (which is now passed through the inductive cases);
8057 * Document preparation: renamed standard symbols \<ll> to \<lless> and
8058 \<gg> to \<ggreater>;
8061 *** Document preparation ***
8063 * \isabellestyle{NAME} selects version of Isabelle output (currently
8064 available: are "it" for near math-mode best-style output, "sl" for
8065 slanted text style, and "tt" for plain type-writer; if no
8066 \isabellestyle command is given, output is according to slanted
8069 * support sub/super scripts (for single symbols only), input syntax is
8070 like this: "A\<^sup>*" or "A\<^sup>\<star>";
8072 * some more standard symbols; see Appendix A of the system manual for
8073 the complete list of symbols defined in isabellesym.sty;
8075 * improved isabelle style files; more abstract symbol implementation
8076 (should now use \isamath{...} and \isatext{...} in custom symbol
8079 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
8080 state; Note that presentation of goal states does not conform to
8081 actual human-readable proof documents. Please do not include goal
8082 states into document output unless you really know what you are doing!
8084 * proper indentation of antiquoted output with proportional LaTeX
8087 * no_document ML operator temporarily disables LaTeX document
8090 * isatool unsymbolize tunes sources for plain ASCII communication;
8095 * Pure: Isar now suffers initial goal statements to contain unbound
8096 schematic variables (this does not conform to actual readable proof
8097 documents, due to unpredictable outcome and non-compositional proof
8098 checking); users who know what they are doing may use schematic goals
8099 for Prolog-style synthesis of proven results;
8101 * Pure: assumption method (an implicit finishing) now handles actual
8104 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
8105 initial goal, declare "that" only as Pure intro (only for single
8106 steps); the "that" rule assumption may now be involved in implicit
8107 finishing, thus ".." becomes a feasible for trivial obtains;
8109 * Pure: default proof step now includes 'intro_classes'; thus trivial
8110 instance proofs may be performed by "..";
8112 * Pure: ?thesis / ?this / "..." now work for pure meta-level
8115 * Pure: more robust selection of calculational rules;
8117 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
8118 rule (as well as the assumption rule);
8120 * Pure: 'thm_deps' command visualizes dependencies of theorems and
8121 lemmas, using the graph browser tool;
8123 * Pure: predict failure of "show" in interactive mode;
8125 * Pure: 'thms_containing' now takes actual terms as arguments;
8127 * HOL: improved method 'induct' --- now handles non-atomic goals
8128 (potential INCOMPATIBILITY); tuned error handling;
8130 * HOL: cases and induct rules now provide explicit hints about the
8131 number of facts to be consumed (0 for "type" and 1 for "set" rules);
8132 any remaining facts are inserted into the goal verbatim;
8134 * HOL: local contexts (aka cases) may now contain term bindings as
8135 well; the 'cases' and 'induct' methods new provide a ?case binding for
8136 the result to be shown in each case;
8138 * HOL: added 'recdef_tc' command;
8140 * isatool convert assists in eliminating legacy ML scripts;
8145 * HOL/Library: a collection of generic theories to be used together
8146 with main HOL; the theory loader path already includes this directory
8147 by default; the following existing theories have been moved here:
8148 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
8149 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
8151 * HOL/Unix: "Some aspects of Unix file-system security", a typical
8152 modelling and verification task performed in Isabelle/HOL +
8153 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
8155 * HOL/Algebra: special summation operator SUM no longer exists, it has
8156 been replaced by setsum; infix 'assoc' now has priority 50 (like
8157 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
8158 'domain', this makes the theory consistent with mathematical
8161 * HOL basics: added overloaded operations "inverse" and "divide"
8162 (infix "/"), syntax for generic "abs" operation, generic summation
8165 * HOL/typedef: simplified package, provide more useful rules (see also
8168 * HOL/datatype: induction rule for arbitrarily branching datatypes is
8169 now expressed as a proper nested rule (old-style tactic scripts may
8170 require atomize_strip_tac to cope with non-atomic premises);
8172 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
8173 to "split_conv" (old name still available for compatibility);
8175 * HOL: improved concrete syntax for strings (e.g. allows translation
8176 rules with string literals);
8178 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
8179 and Fleuriot's mechanization of analysis, including the transcendental
8180 functions for the reals;
8182 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
8187 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
8188 "lam" is displayed as TWO lambda-symbols
8190 * CTT: theory Main now available, containing everything (that is, Bool
8196 * Pure: the Simplifier has been implemented properly as a derived rule
8197 outside of the actual kernel (at last!); the overall performance
8198 penalty in practical applications is about 50%, while reliability of
8199 the Isabelle inference kernel has been greatly improved;
8201 * print modes "brackets" and "no_brackets" control output of nested =>
8202 (types) and ==> (props); the default behaviour is "brackets";
8204 * Provers: fast_tac (and friends) now handle actual object-logic rules
8205 as assumptions as well;
8207 * system: support Poly/ML 4.0;
8209 * system: isatool install handles KDE version 1 or 2;
8213 New in Isabelle99-1 (October 2000)
8214 ----------------------------------
8216 *** Overview of INCOMPATIBILITIES ***
8218 * HOL: simplification of natural numbers is much changed; to partly
8219 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
8220 issue the following ML commands:
8222 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
8223 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
8225 * HOL: simplification no longer dives into case-expressions; this is
8226 controlled by "t.weak_case_cong" for each datatype t;
8228 * HOL: nat_less_induct renamed to less_induct;
8230 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
8231 fixsome to patch .thy and .ML sources automatically;
8233 select_equality -> some_equality
8234 select_eq_Ex -> some_eq_ex
8235 selectI2EX -> someI2_ex
8238 select1_equality -> some1_equality
8239 Eps_sym_eq -> some_sym_eq_trivial
8240 Eps_eq -> some_eq_trivial
8242 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
8244 * HOL: removed obsolete theorem binding expand_if (refer to split_if
8247 * HOL: the recursion equations generated by 'recdef' are now called
8248 f.simps instead of f.rules;
8250 * HOL: qed_spec_mp now also handles bounded ALL as well;
8252 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
8253 sometimes be needed;
8255 * HOL: the constant for "f``x" is now "image" rather than "op ``";
8257 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
8259 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
8260 product is now "<*>" instead of "Times"; the lexicographic product is
8261 now "<*lex*>" instead of "**";
8263 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
8264 of main HOL, but was unused); better use HOL's datatype package;
8266 * HOL: removed "symbols" syntax for constant "override" of theory Map;
8267 the old syntax may be recovered as follows:
8270 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
8271 (infixl "\\<oplus>" 100)
8273 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8275 * HOL/ML: even fewer consts are declared as global (see theories Ord,
8276 Lfp, Gfp, WF); this only affects ML packages that refer to const names
8279 * HOL and ZF: syntax for quotienting wrt an equivalence relation
8280 changed from A/r to A//r;
8282 * ZF: new treatment of arithmetic (nat & int) may break some old
8285 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
8286 rulify -> rule_format, elimify -> elim_format, ...);
8288 * Isar/Provers: intro/elim/dest attributes changed; renamed
8289 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
8290 should have to change intro!! to intro? only); replaced "delrule" by
8293 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
8295 * Provers: strengthened force_tac by using new first_best_tac;
8297 * LaTeX document preparation: several changes of isabelle.sty (see
8301 *** Document preparation ***
8303 * formal comments (text blocks etc.) in new-style theories may now
8304 contain antiquotations of thm/prop/term/typ/text to be presented
8305 according to latex print mode; concrete syntax is like this:
8306 @{term[show_types] "f(x) = a + x"};
8308 * isatool mkdir provides easy setup of Isabelle session directories,
8309 including proper document sources;
8311 * generated LaTeX sources are now deleted after successful run
8312 (isatool document -c); may retain a copy somewhere else via -D option
8315 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
8316 style files, achieving self-contained LaTeX sources and simplifying
8319 * old-style theories now produce (crude) LaTeX output as well;
8321 * browser info session directories are now self-contained (may be put
8322 on WWW server seperately); improved graphs of nested sessions; removed
8323 graph for 'all sessions';
8325 * several improvements in isabelle style files; \isabellestyle{it}
8326 produces fake math mode output; \isamarkupheader is now \section by
8327 default; see lib/texinputs/isabelle.sty etc.;
8332 * Isar/Pure: local results and corresponding term bindings are now
8333 subject to Hindley-Milner polymorphism (similar to ML); this
8334 accommodates incremental type-inference very nicely;
8336 * Isar/Pure: new derived language element 'obtain' supports
8337 generalized existence reasoning;
8339 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
8340 support accumulation of results, without applying any rules yet;
8341 useful to collect intermediate results without explicit name
8342 references, and for use with transitivity rules with more than 2
8345 * Isar/Pure: scalable support for case-analysis type proofs: new
8346 'case' language element refers to local contexts symbolically, as
8347 produced by certain proof methods; internally, case names are attached
8348 to theorems as "tags";
8350 * Isar/Pure: theory command 'hide' removes declarations from
8351 class/type/const name spaces;
8353 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
8354 indicate potential overloading;
8356 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
8358 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
8359 "{a,b,c}" instead of {a,b,c};
8361 * Isar/Pure now provides its own version of intro/elim/dest
8362 attributes; useful for building new logics, but beware of confusion
8363 with the version in Provers/classical;
8365 * Isar/Pure: the local context of (non-atomic) goals is provided via
8366 case name 'antecedent';
8368 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
8369 to the current context is now done automatically);
8371 * Isar/Pure: theory command 'method_setup' provides a simple interface
8372 for definining proof methods in ML;
8374 * Isar/Provers: intro/elim/dest attributes changed; renamed
8375 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
8376 most cases, one should have to change intro!! to intro? only);
8377 replaced "delrule" by "rule del";
8379 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
8380 'symmetric' attribute (the latter supercedes [RS sym]);
8382 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
8383 method modifier); 'simp' method: 'only:' modifier removes loopers as
8384 well (including splits);
8386 * Isar/Provers: Simplifier and Classical methods now support all kind
8387 of modifiers used in the past, including 'cong', 'iff', etc.
8389 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
8390 of Simplifier and Classical reasoner);
8392 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
8393 now support named cases; major packages (inductive, datatype, primrec,
8394 recdef) support case names and properly name parameters;
8396 * Isar/HOL: new transitivity rules for substitution in inequalities --
8397 monotonicity conditions are extracted to be proven at end of
8400 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
8403 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
8404 split_if split_if_asm; datatype package provides theorems foo.splits =
8405 foo.split foo.split_asm for each datatype;
8407 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
8408 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
8409 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
8410 use "(cases (simplified))" method in proper proof texts);
8412 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
8414 * Isar: names of theorems etc. may be natural numbers as well;
8416 * Isar: 'pr' command: optional arguments for goals_limit and
8417 ProofContext.prems_limit; no longer prints theory contexts, but only
8420 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
8421 additional print modes to be specified; e.g. "pr(latex)" will print
8422 proof state according to the Isabelle LaTeX style;
8424 * Isar: improved support for emulating tactic scripts, including proof
8425 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
8426 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
8427 (for HOL datatypes);
8429 * Isar: simplified (more robust) goal selection of proof methods: 1st
8430 goal, all goals, or explicit goal specifier (tactic emulation); thus
8431 'proof method scripts' have to be in depth-first order;
8433 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
8435 * Isar: removed 'help' command, which hasn't been too helpful anyway;
8436 should instead use individual commands for printing items
8437 (print_commands, print_methods etc.);
8439 * Isar: added 'nothing' --- the empty list of theorems;
8444 * HOL/MicroJava: formalization of a fragment of Java, together with a
8445 corresponding virtual machine and a specification of its bytecode
8446 verifier and a lightweight bytecode verifier, including proofs of
8447 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
8448 Cornelia Pusch (see also the homepage of project Bali at
8449 http://isabelle.in.tum.de/Bali/);
8451 * HOL/Algebra: new theory of rings and univariate polynomials, by
8454 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
8455 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
8458 * HOL/Lattice: fundamental concepts of lattice theory and order
8459 structures, including duals, properties of bounds versus algebraic
8460 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
8461 Theorem for complete lattices etc.; may also serve as a demonstration
8462 for abstract algebraic reasoning using axiomatic type classes, and
8463 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
8465 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
8468 * HOL/IMPP: extension of IMP with local variables and mutually
8469 recursive procedures, by David von Oheimb;
8471 * HOL/Lambda: converted into new-style theory and document;
8473 * HOL/ex/Multiquote: example of multiple nested quotations and
8474 anti-quotations -- basically a generalized version of de-Bruijn
8475 representation; very useful in avoiding lifting of operations;
8477 * HOL/record: added general record equality rule to simpset; fixed
8478 select-update simplification procedure to handle extended records as
8479 well; admit "r" as field name;
8481 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
8482 other numeric types and also as the identity of groups, rings, etc.;
8484 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
8485 Types nat and int belong to this axclass;
8487 * HOL: greatly improved simplification involving numerals of type nat, int, real:
8488 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
8489 i*j + k + j*#3*i simplifies to #4*(i*j) + k
8490 two terms #m*u and #n*u are replaced by #(m+n)*u
8491 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
8492 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
8493 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
8495 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
8496 powerful prover for predicate logic but knows nothing of clasets; see
8497 ex/mesontest.ML and ex/mesontest2.ML for example applications;
8499 * HOL: new version of "case_tac" subsumes both boolean case split and
8500 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
8501 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
8503 * HOL: simplification no longer dives into case-expressions: only the
8504 selector expression is simplified, but not the remaining arms; to
8505 enable full simplification of case-expressions for datatype t, you may
8506 remove t.weak_case_cong from the simpset, either globally (Delcongs
8507 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
8509 * HOL/recdef: the recursion equations generated by 'recdef' for
8510 function 'f' are now called f.simps instead of f.rules; if all
8511 termination conditions are proved automatically, these simplification
8512 rules are added to the simpset, as in primrec; rules may be named
8513 individually as well, resulting in a separate list of theorems for
8516 * HOL/While is a new theory that provides a while-combinator. It
8517 permits the definition of tail-recursive functions without the
8518 provision of a termination measure. The latter is necessary once the
8519 invariant proof rule for while is applied.
8521 * HOL: new (overloaded) notation for the set of elements below/above
8522 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
8524 * HOL: theorems impI, allI, ballI bound as "strip";
8526 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
8527 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
8528 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
8530 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8532 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
8533 main HOL, but was unused);
8535 * HOL: fewer consts declared as global (e.g. have to refer to
8536 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
8538 * HOL: tuned AST representation of nested pairs, avoiding bogus output
8539 in case of overlap with user translations (e.g. judgements over
8540 tuples); (note that the underlying logical represenation is still
8546 * ZF: simplification automatically cancels common terms in arithmetic
8547 expressions over nat and int;
8549 * ZF: new treatment of nat to minimize type-checking: all operators
8550 coerce their operands to a natural number using the function natify,
8551 making the algebraic laws unconditional;
8553 * ZF: as above, for int: operators coerce their operands to an integer
8554 using the function intify;
8556 * ZF: the integer library now contains many of the usual laws for the
8557 orderings, including $<=, and monotonicity laws for $+ and $*;
8559 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
8562 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
8563 to the simplifier and classical reasoner simultaneously;
8568 * Provers: blast_tac now handles actual object-logic rules as
8569 assumptions; note that auto_tac uses blast_tac internally as well;
8571 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
8572 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
8574 * Provers: delrules now handles destruct rules as well (no longer need
8575 explicit make_elim);
8577 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
8578 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8579 use instead the strong form,
8580 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8581 in HOL, FOL and ZF the function cla_make_elim will create such rules
8582 from destruct-rules;
8584 * Provers: Simplifier.easy_setup provides a fast path to basic
8585 Simplifier setup for new object-logics;
8587 * Pure: AST translation rules no longer require constant head on LHS;
8589 * Pure: improved name spaces: ambiguous output is qualified; support
8590 for hiding of names;
8592 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
8593 XSYMBOL_HOME; no longer need to do manual configuration in most
8596 * system: compression of ML heaps images may now be controlled via -c
8597 option of isabelle and isatool usedir (currently only observed by
8600 * system: isatool installfonts may handle X-Symbol fonts as well (very
8601 useful for remote X11);
8603 * system: provide TAGS file for Isabelle sources;
8605 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
8608 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
8609 timing flag supersedes proof_timing and Toplevel.trace;
8611 * ML: new combinators |>> and |>>> for incremental transformations
8612 with secondary results (e.g. certain theory extensions):
8614 * ML: PureThy.add_defs gets additional argument to indicate potential
8615 overloading (usually false);
8617 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
8622 New in Isabelle99 (October 1999)
8623 --------------------------------
8625 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8627 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
8628 are no longer simplified. (This allows the simplifier to unfold recursive
8629 functional programs.) To restore the old behaviour, declare
8631 Delcongs [if_weak_cong];
8633 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
8636 * HOL: the predicate "inj" is now defined by translation to "inj_on";
8638 * HOL/datatype: mutual_induct_tac no longer exists --
8639 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
8641 * HOL/typedef: fixed type inference for representing set; type
8642 arguments now have to occur explicitly on the rhs as type constraints;
8644 * ZF: The con_defs part of an inductive definition may no longer refer
8645 to constants declared in the same theory;
8647 * HOL, ZF: the function mk_cases, generated by the inductive
8648 definition package, has lost an argument. To simplify its result, it
8649 uses the default simpset instead of a supplied list of theorems.
8651 * HOL/List: the constructors of type list are now Nil and Cons;
8653 * Simplifier: the type of the infix ML functions
8654 setSSolver addSSolver setSolver addSolver
8655 is now simpset * solver -> simpset where `solver' is a new abstract type
8656 for packaging solvers. A solver is created via
8657 mk_solver: string -> (thm list -> int -> tactic) -> solver
8658 where the string argument is only a comment.
8663 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
8664 decision procedure for linear arithmetic. Currently it is used for
8665 types `nat', `int', and `real' in HOL (see below); it can, should and
8666 will be instantiated for other types and logics as well.
8668 * The simplifier now accepts rewrite rules with flexible heads, eg
8669 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
8670 They are applied like any rule with a non-pattern lhs, i.e. by first-order
8676 * New Isabelle/Isar subsystem provides an alternative to traditional
8677 tactical theorem proving; together with the ProofGeneral/isar user
8678 interface it offers an interactive environment for developing human
8679 readable proof documents (Isar == Intelligible semi-automated
8680 reasoning); for further information see isatool doc isar-ref,
8681 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
8683 * improved and simplified presentation of theories: better HTML markup
8684 (including colors), graph views in several sizes; isatool usedir now
8685 provides a proper interface for user theories (via -P option); actual
8686 document preparation based on (PDF)LaTeX is available as well (for
8687 new-style theories only); see isatool doc system for more information;
8689 * native support for Proof General, both for classic Isabelle and
8692 * ML function thm_deps visualizes dependencies of theorems and lemmas,
8693 using the graph browser tool;
8695 * Isabelle manuals now also available as PDF;
8697 * theory loader rewritten from scratch (may not be fully
8698 bug-compatible); old loadpath variable has been replaced by show_path,
8699 add_path, del_path, reset_path functions; new operations such as
8700 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
8703 * improved isatool install: option -k creates KDE application icon,
8704 option -p DIR installs standalone binaries;
8706 * added ML_PLATFORM setting (useful for cross-platform installations);
8707 more robust handling of platform specific ML images for SML/NJ;
8709 * the settings environment is now statically scoped, i.e. it is never
8710 created again in sub-processes invoked from isabelle, isatool, or
8713 * path element specification '~~' refers to '$ISABELLE_HOME';
8715 * in locales, the "assumes" and "defines" parts may be omitted if
8718 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
8721 * new print_mode "HTML";
8723 * new flag show_tags controls display of tags of theorems (which are
8724 basically just comments that may be attached by some tools);
8726 * Isamode 2.6 requires patch to accomodate change of Isabelle font
8727 mode and goal output format:
8729 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
8731 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
8733 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
8734 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
8736 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
8738 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
8740 * function bind_thms stores lists of theorems (cf. bind_thm);
8742 * new shorthand tactics ftac, eatac, datac, fatac;
8744 * qed (and friends) now accept "" as result name; in that case the
8745 theorem is not stored, but proper checks and presentation of the
8748 * theorem database now also indexes constants "Trueprop", "all",
8749 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
8754 ** HOL arithmetic **
8756 * There are now decision procedures for linear arithmetic over nat and
8759 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
8760 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
8761 are treated as atomic; subformulae not involving type `nat' or `int'
8762 are ignored; quantified subformulae are ignored unless they are
8763 positive universal or negative existential. The tactic has to be
8764 invoked by hand and can be a little bit slow. In particular, the
8765 running time is exponential in the number of occurrences of `min' and
8766 `max', and `-' on `nat'.
8768 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
8769 (negated) (in)equalities among the premises and the conclusion into
8770 account (i.e. no compound formulae) and does not know about `min' and
8771 `max', and `-' on `nat'. It is fast and is used automatically by the
8774 NB: At the moment, these decision procedures do not cope with mixed
8775 nat/int formulae where the two parts interact, such as `m < n ==>
8778 * HOL/Numeral provides a generic theory of numerals (encoded
8779 efficiently as bit strings); setup for types nat/int/real is in place;
8780 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
8781 int, existing theories and proof scripts may require a few additional
8784 * integer division and remainder can now be performed on constant
8787 * many properties of integer multiplication, division and remainder
8790 * An interface to the Stanford Validity Checker (SVC) is available through the
8791 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
8792 are proved automatically. SVC must be installed separately, and its results
8793 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
8794 invocation of the underlying oracle). For SVC see
8795 http://verify.stanford.edu/SVC
8797 * IsaMakefile: the HOL-Real target now builds an actual image;
8802 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
8803 (in Isabelle/Isar) -- by Gertrud Bauer;
8805 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
8806 analysis for assembly languages with subtypes;
8808 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
8809 -- avoids syntactic ambiguities and treats state, transition, and
8810 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
8811 changed syntax and (many) tactics;
8813 * HOL/inductive: Now also handles more general introduction rules such
8814 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
8815 theorems are now maintained within the theory (maintained via the
8818 * HOL/datatype: Now also handles arbitrarily branching datatypes
8819 (using function types) such as
8821 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
8823 * HOL/record: record_simproc (part of the default simpset) takes care
8824 of selectors applied to updated records; record_split_tac is no longer
8825 part of the default claset; update_defs may now be removed from the
8826 simpset in many cases; COMPATIBILITY: old behavior achieved by
8828 claset_ref () := claset() addSWrapper record_split_wrapper;
8829 Delsimprocs [record_simproc]
8831 * HOL/typedef: fixed type inference for representing set; type
8832 arguments now have to occur explicitly on the rhs as type constraints;
8834 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
8835 names rather than an ML expression;
8837 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
8838 supplied later. Program schemes can be defined, such as
8839 "While B C s = (if B s then While B C (C s) else s)"
8840 where the well-founded relation can be chosen after B and C have been given.
8842 * HOL/List: the constructors of type list are now Nil and Cons;
8843 INCOMPATIBILITY: while [] and infix # syntax is still there, of
8844 course, ML tools referring to List.list.op # etc. have to be adapted;
8846 * HOL_quantifiers flag superseded by "HOL" print mode, which is
8847 disabled by default; run isabelle with option -m HOL to get back to
8848 the original Gordon/HOL-style output;
8850 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
8851 ALL x<=y. P, EX x<y. P, EX x<=y. P;
8853 * HOL basic syntax simplified (more orthogonal): all variants of
8854 All/Ex now support plain / symbolic / HOL notation; plain syntax for
8855 Eps operator is provided as well: "SOME x. P[x]";
8857 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
8859 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
8860 thus available for user theories;
8862 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
8863 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
8866 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
8867 several times and then mp;
8872 * the notation <<...>> is now available as a notation for sequences of
8875 * the simplifier is now installed
8877 * the axiom system has been generalized (thanks to Soren Heilmann)
8879 * the classical reasoner now has a default rule database
8884 * new primrec section allows primitive recursive functions to be given
8885 directly (as in HOL) over datatypes and the natural numbers;
8887 * new tactics induct_tac and exhaust_tac for induction (or case
8888 analysis) over datatypes and the natural numbers;
8890 * the datatype declaration of type T now defines the recursor T_rec;
8892 * simplification automatically does freeness reasoning for datatype
8895 * automatic type-inference, with AddTCs command to insert new
8896 type-checking rules;
8898 * datatype introduction rules are now added as Safe Introduction rules
8901 * the syntax "if P then x else y" is now available in addition to
8905 *** Internal programming interfaces ***
8907 * tuned simplifier trace output; new flag debug_simp;
8909 * structures Vartab / Termtab (instances of TableFun) offer efficient
8910 tables indexed by indexname_ord / term_ord (compatible with aconv);
8912 * AxClass.axclass_tac lost the theory argument;
8914 * tuned current_goals_markers semantics: begin / end goal avoids
8915 printing empty lines;
8917 * removed prs and prs_fn hook, which was broken because it did not
8918 include \n in its semantics, forcing writeln to add one
8919 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
8920 string -> unit if you really want to output text without newline;
8922 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
8923 plain output, interface builders may have to enable 'isabelle_font'
8924 mode to get Isabelle font glyphs as before;
8926 * refined token_translation interface; INCOMPATIBILITY: output length
8927 now of type real instead of int;
8929 * theory loader actions may be traced via new ThyInfo.add_hook
8930 interface (see src/Pure/Thy/thy_info.ML); example application: keep
8931 your own database of information attached to *whole* theories -- as
8932 opposed to intra-theory data slots offered via TheoryDataFun;
8934 * proper handling of dangling sort hypotheses (at last!);
8935 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
8936 extra sort hypotheses that can be witnessed from the type signature;
8937 the force_strip_shyps flag is gone, any remaining shyps are simply
8938 left in the theorem (with a warning issued by strip_shyps_warning);
8942 New in Isabelle98-1 (October 1998)
8943 ----------------------------------
8945 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8947 * several changes of automated proof tools;
8949 * HOL: major changes to the inductive and datatype packages, including
8950 some minor incompatibilities of theory syntax;
8952 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
8955 * HOL: removed duplicate thms in Arith:
8956 less_imp_add_less should be replaced by trans_less_add1
8957 le_imp_add_le should be replaced by trans_le_add1
8959 * HOL: unary minus is now overloaded (new type constraints may be
8962 * HOL and ZF: unary minus for integers is now #- instead of #~. In
8963 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
8964 now taken as an integer constant.
8966 * Pure: ML function 'theory_of' renamed to 'theory';
8972 1. Asm_full_simp_tac is now more aggressive.
8973 1. It will sometimes reorient premises if that increases their power to
8975 2. It does no longer proceed strictly from left to right but may also
8976 rotate premises to achieve further simplification.
8977 For compatibility reasons there is now Asm_lr_simp_tac which is like the
8978 old Asm_full_simp_tac in that it does not rotate premises.
8979 2. The simplifier now knows a little bit about nat-arithmetic.
8981 * Classical reasoner: wrapper mechanism for the classical reasoner now
8982 allows for selected deletion of wrappers, by introduction of names for
8983 wrapper functionals. This implies that addbefore, addSbefore,
8984 addaltern, and addSaltern now take a pair (name, tactic) as argument,
8985 and that adding two tactics with the same name overwrites the first
8986 one (emitting a warning).
8987 type wrapper = (int -> tactic) -> (int -> tactic)
8988 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
8989 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
8990 delWrapper, delSWrapper: claset * string -> claset
8991 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
8993 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
8994 semantics; addbefore now affects only the unsafe part of step_tac
8995 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
8996 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
8999 * Classical reasoner: setwrapper to setWrapper and compwrapper to
9000 compWrapper; added safe wrapper (and access functions for it);
9002 * HOL/split_all_tac is now much faster and fails if there is nothing
9003 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
9004 and the names of the automatically generated variables have changed.
9005 split_all_tac has moved within claset() from unsafe wrappers to safe
9006 wrappers, which means that !!-bound variables are split much more
9007 aggressively, and safe_tac and clarify_tac now split such variables.
9008 If this splitting is not appropriate, use delSWrapper "split_all_tac".
9009 Note: the same holds for record_split_tac, which does the job of
9010 split_all_tac for record fields.
9012 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
9013 permanently to the default simpset using Addsplits just like
9014 Addsimps. They can be removed via Delsplits just like
9015 Delsimps. Lower-case versions are also available.
9017 * HOL/Simplifier: The rule split_if is now part of the default
9018 simpset. This means that the simplifier will eliminate all occurrences
9019 of if-then-else in the conclusion of a goal. To prevent this, you can
9020 either remove split_if completely from the default simpset by
9021 `Delsplits [split_if]' or remove it in a specific call of the
9022 simplifier using `... delsplits [split_if]'. You can also add/delete
9023 other case splitting rules to/from the default simpset: every datatype
9024 generates suitable rules `split_t_case' and `split_t_case_asm' (where
9025 t is the name of the datatype).
9027 * Classical reasoner / Simplifier combination: new force_tac (and
9028 derivatives Force_tac, force) combines rewriting and classical
9029 reasoning (and whatever other tools) similarly to auto_tac, but is
9030 aimed to solve the given subgoal completely.
9035 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
9036 and `goalw': the theory is no longer needed as an explicit argument -
9037 the current theory context is used; assumptions are no longer returned
9038 at the ML-level unless one of them starts with ==> or !!; it is
9039 recommended to convert to these new commands using isatool fixgoal
9040 (backup your sources first!);
9042 * new top-level commands 'thm' and 'thms' for retrieving theorems from
9043 the current theory context, and 'theory' to lookup stored theories;
9045 * new theory section 'locale' for declaring constants, assumptions and
9046 definitions that have local scope;
9048 * new theory section 'nonterminals' for purely syntactic types;
9050 * new theory section 'setup' for generic ML setup functions
9051 (e.g. package initialization);
9053 * the distribution now includes Isabelle icons: see
9054 lib/logo/isabelle-{small,tiny}.xpm;
9056 * isatool install - install binaries with absolute references to
9059 * isatool logo -- create instances of the Isabelle logo (as EPS);
9061 * print mode 'emacs' reserved for Isamode;
9063 * support multiple print (ast) translations per constant name;
9065 * theorems involving oracles are now printed with a suffixed [!];
9070 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
9072 * HOL/inductive package reorganized and improved: now supports mutual
9078 oddI "n : EVEN ==> Suc n : ODD"
9079 evenI "n : ODD ==> Suc n : EVEN"
9081 new theorem list "elims" contains an elimination rule for each of the
9082 recursive sets; inductive definitions now handle disjunctive premises
9083 correctly (also ZF);
9085 INCOMPATIBILITIES: requires Inductive as an ancestor; component
9086 "mutual_induct" no longer exists - the induction rule is always
9087 contained in "induct";
9090 * HOL/datatype package re-implemented and greatly improved: now
9091 supports mutually recursive datatypes such as
9094 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
9095 | SUM ('a aexp) ('a aexp)
9096 | DIFF ('a aexp) ('a aexp)
9099 'a bexp = LESS ('a aexp) ('a aexp)
9100 | AND ('a bexp) ('a bexp)
9101 | OR ('a bexp) ('a bexp)
9103 as well as indirectly recursive datatypes such as
9106 ('a, 'b) term = Var 'a
9107 | App 'b ((('a, 'b) term) list)
9109 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
9110 induction on mutually / indirectly recursive datatypes.
9112 Primrec equations are now stored in theory and can be accessed via
9113 <function_name>.simps.
9117 - Theories using datatypes must now have theory Datatype as an
9119 - The specific <typename>.induct_tac no longer exists - use the
9120 generic induct_tac instead.
9121 - natE has been renamed to nat.exhaust - use exhaust_tac
9122 instead of res_inst_tac ... natE. Note that the variable
9123 names in nat.exhaust differ from the names in natE, this
9124 may cause some "fragile" proofs to fail.
9125 - The theorems split_<typename>_case and split_<typename>_case_asm
9126 have been renamed to <typename>.split and <typename>.split_asm.
9127 - Since default sorts of type variables are now handled correctly,
9128 some datatype definitions may have to be annotated with explicit
9130 - Primrec definitions no longer require function name and type
9131 of recursive argument.
9133 Consider using isatool fixdatatype to adapt your theories and proof
9134 scripts to the new package (backup your sources first!).
9137 * HOL/record package: considerably improved implementation; now
9138 includes concrete syntax for record types, terms, updates; theorems
9139 for surjective pairing and splitting !!-bound record variables; proof
9140 support is as follows:
9142 1) standard conversions (selectors or updates applied to record
9143 constructor terms) are part of the standard simpset;
9145 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
9146 made part of standard simpset and claset via addIffs;
9148 3) a tactic for record field splitting (record_split_tac) is part of
9149 the standard claset (addSWrapper);
9151 To get a better idea about these rules you may retrieve them via
9152 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
9153 the name of your record type.
9155 The split tactic 3) conceptually simplifies by the following rule:
9157 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
9159 Thus any record variable that is bound by meta-all will automatically
9160 blow up into some record constructor term, consequently the
9161 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
9162 solve record problems automatically.
9165 * reorganized the main HOL image: HOL/Integ and String loaded by
9166 default; theory Main includes everything;
9168 * automatic simplification of integer sums and comparisons, using cancellation;
9170 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
9172 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
9174 * many new identities for unions, intersections, set difference, etc.;
9176 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
9177 called split_if, split_split, split_sum_case and split_nat_case (to go
9178 with add/delsplits);
9180 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
9181 (?x::unit) = (); this is made part of the default simpset, which COULD
9182 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
9183 'Delsimprocs [unit_eq_proc];' as last resort); also note that
9184 unit_abs_eta_conv is added in order to counter the effect of
9185 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
9188 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
9191 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9192 It and 'sym RS equals0D' are now in the default claset, giving automatic
9193 disjointness reasoning but breaking a few old proofs.
9195 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
9196 to 'converse' from 'inverse' (for compatibility with ZF and some
9199 * HOL/recdef can now declare non-recursive functions, with {} supplied as
9200 the well-founded relation;
9202 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
9203 Compl A. The "Compl" syntax remains available as input syntax for this
9206 * HOL/Update: new theory of function updates:
9207 f(a:=b) == %x. if x=a then b else f x
9208 may also be iterated as in f(a:=b,c:=d,...);
9210 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
9213 - new function list_update written xs[i:=v] that updates the i-th
9214 list position. May also be iterated as in xs[i:=a,j:=b,...].
9215 - new function `upt' written [i..j(] which generates the list
9216 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
9217 bound write [i..j], which is a shorthand for [i..j+1(].
9218 - new lexicographic orderings and corresponding wellfoundedness theorems.
9221 - removed 'pred' (predecessor) function;
9222 - generalized some theorems about n-1;
9223 - many new laws about "div" and "mod";
9224 - new laws about greatest common divisors (see theory ex/Primes);
9226 * HOL/Relation: renamed the relational operator r^-1 "converse"
9227 instead of "inverse";
9229 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
9230 of the multiset ordering;
9232 * directory HOL/Real: a construction of the reals using Dedekind cuts
9233 (not included by default);
9235 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
9237 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
9238 programs, i.e. different program variables may have different types.
9240 * calling (stac rew i) now fails if "rew" has no effect on the goal
9241 [previously, this check worked only if the rewrite rule was unconditional]
9242 Now rew can involve either definitions or equalities (either == or =).
9247 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
9248 only the theorems proved on ZF.ML;
9250 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9251 It and 'sym RS equals0D' are now in the default claset, giving automatic
9252 disjointness reasoning but breaking a few old proofs.
9254 * ZF/Update: new theory of function updates
9255 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
9256 may also be iterated as in f(a:=b,c:=d,...);
9258 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
9260 * calling (stac rew i) now fails if "rew" has no effect on the goal
9261 [previously, this check worked only if the rewrite rule was unconditional]
9262 Now rew can involve either definitions or equalities (either == or =).
9264 * case_tac provided for compatibility with HOL
9265 (like the old excluded_middle_tac, but with subgoals swapped)
9268 *** Internal programming interfaces ***
9270 * Pure: several new basic modules made available for general use, see
9271 also src/Pure/README;
9273 * improved the theory data mechanism to support encapsulation (data
9274 kind name replaced by private Object.kind, acting as authorization
9275 key); new type-safe user interface via functor TheoryDataFun; generic
9276 print_data function becomes basically useless;
9278 * removed global_names compatibility flag -- all theory declarations
9279 are qualified by default;
9281 * module Pure/Syntax now offers quote / antiquote translation
9282 functions (useful for Hoare logic etc. with implicit dependencies);
9283 see HOL/ex/Antiquote for an example use;
9285 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
9288 * new tactical CHANGED_GOAL for checking that a tactic modifies a
9291 * Display.print_goals function moved to Locale.print_goals;
9293 * standard print function for goals supports current_goals_markers
9294 variable for marking begin of proof, end of proof, start of goal; the
9295 default is ("", "", ""); setting current_goals_markers := ("<proof>",
9296 "</proof>", "<goal>") causes SGML like tagged proof state printing,
9301 New in Isabelle98 (January 1998)
9302 --------------------------------
9304 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9306 * changed lexical syntax of terms / types: dots made part of long
9307 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
9309 * simpset (and claset) reference variable replaced by functions
9310 simpset / simpset_ref;
9312 * no longer supports theory aliases (via merge) and non-trivial
9313 implicit merge of thms' signatures;
9315 * most internal names of constants changed due to qualified names;
9317 * changed Pure/Sequence interface (see Pure/seq.ML);
9320 *** General Changes ***
9322 * hierachically structured name spaces (for consts, types, axms, thms
9323 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
9324 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
9325 isatool fixdots ensures space after dots (e.g. "%x. x"); set
9326 long_names for fully qualified output names; NOTE: ML programs
9327 (special tactics, packages etc.) referring to internal names may have
9328 to be adapted to cope with fully qualified names; in case of severe
9329 backward campatibility problems try setting 'global_names' at compile
9330 time to have enrything declared within a flat name space; one may also
9331 fine tune name declarations in theories via the 'global' and 'local'
9334 * reimplemented the implicit simpset and claset using the new anytype
9335 data filed in signatures; references simpset:simpset ref etc. are
9336 replaced by functions simpset:unit->simpset and
9337 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
9338 to patch your ML files accordingly;
9340 * HTML output now includes theory graph data for display with Java
9341 applet or isatool browser; data generated automatically via isatool
9342 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
9344 * defs may now be conditional; improved rewrite_goals_tac to handle
9345 conditional equations;
9347 * defs now admits additional type arguments, using TYPE('a) syntax;
9349 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
9350 creates a new theory node; implicit merge of thms' signatures is
9351 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
9352 transfer:theory->thm->thm in (rare) cases;
9354 * improved handling of draft signatures / theories; draft thms (and
9355 ctyps, cterms) are automatically promoted to real ones;
9357 * slightly changed interfaces for oracles: admit many per theory, named
9358 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
9360 * print_goals: optional output of const types (set show_consts and
9363 * improved output of warnings (###) and errors (***);
9365 * subgoal_tac displays a warning if the new subgoal has type variables;
9367 * removed old README and Makefiles;
9369 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
9371 * removed obsolete init_pps and init_database;
9373 * deleted the obsolete tactical STATE, which was declared by
9374 fun STATE tacfun st = tacfun st st;
9376 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
9377 (which abbreviates $HOME);
9379 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
9380 use isatool fixseq to adapt your ML programs (this works for fully
9381 qualified references to the Sequence structure only!);
9383 * use_thy no longer requires writable current directory; it always
9384 reloads .ML *and* .thy file, if either one is out of date;
9387 *** Classical Reasoner ***
9389 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
9390 tactics that use classical reasoning to simplify a subgoal without
9391 splitting it into several subgoals;
9393 * Safe_tac: like safe_tac but uses the default claset;
9398 * added simplification meta rules:
9399 (asm_)(full_)simplify: simpset -> thm -> thm;
9401 * simplifier.ML no longer part of Pure -- has to be loaded by object
9404 * added prems argument to simplification procedures;
9406 * HOL, FOL, ZF: added infix function `addsplits':
9407 instead of `<simpset> setloop (split_tac <thms>)'
9408 you can simply write `<simpset> addsplits <thms>'
9413 * TYPE('a) syntax for type reflection terms;
9415 * no longer handles consts with name "" -- declare as 'syntax' instead;
9417 * pretty printer: changed order of mixfix annotation preference (again!);
9419 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
9424 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
9425 with `addloop' of the simplifier to faciliate case splitting in premises.
9427 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
9429 * HOL/Auth: new protocol proofs including some for the Internet
9432 * HOL/Map: new theory of `maps' a la VDM;
9434 * HOL/simplifier: simplification procedures nat_cancel_sums for
9435 cancelling out common nat summands from =, <, <= (in)equalities, or
9436 differences; simplification procedures nat_cancel_factor for
9437 cancelling common factor from =, <, <= (in)equalities over natural
9438 sums; nat_cancel contains both kinds of procedures, it is installed by
9439 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
9441 * HOL/simplifier: terms of the form
9442 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
9444 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
9445 and those of the form
9446 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
9448 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
9451 Each datatype `t' now comes with a theorem `split_t_case' of the form
9453 P(t_case f1 ... fn x) =
9454 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
9456 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
9459 and a theorem `split_t_case_asm' of the form
9461 P(t_case f1 ... fn x) =
9462 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
9464 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
9466 which can be added to a simpset via `addsplits'. The existing theorems
9467 expand_list_case and expand_option_case have been renamed to
9468 split_list_case and split_option_case.
9471 - `pred n' is automatically converted to `n-1'.
9472 Users are strongly encouraged not to use `pred' any longer,
9473 because it will disappear altogether at some point.
9474 - Users are strongly encouraged to write "0 < n" rather than
9475 "n ~= 0". Theorems and proof tools have been modified towards this
9479 the function "set_of_list" has been renamed "set" (and its theorems too);
9480 the function "nth" now takes its arguments in the reverse order and
9481 has acquired the infix notation "!" as in "xs!n".
9483 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
9485 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
9486 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
9488 * HOL/record: extensible records with schematic structural subtyping
9489 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
9490 still lacks various theorems and concrete record syntax;
9495 * removed "axioms" and "generated by" sections;
9497 * replaced "ops" section by extended "consts" section, which is capable of
9498 handling the continuous function space "->" directly;
9501 . proves theorems immediately and stores them in the theory,
9502 . creates hierachical name space,
9503 . now uses normal mixfix annotations (instead of cinfix...),
9504 . minor changes to some names and values (for consistency),
9505 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
9506 . separator between mutual domain defs: changed "," to "and",
9507 . improved handling of sort constraints; now they have to
9508 appear on the left-hand side of the equations only;
9510 * fixed LAM <x,y,zs>.b syntax;
9512 * added extended adm_tac to simplifier in HOLCF -- can now discharge
9513 adm (%x. P (t x)), where P is chainfinite and t continuous;
9518 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
9519 with `addloop' of the simplifier to faciliate case splitting in premises.
9521 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
9522 in HOL, they strip ALL and --> from proved theorems;
9526 New in Isabelle94-8 (May 1997)
9527 ------------------------------
9529 *** General Changes ***
9531 * new utilities to build / run / maintain Isabelle etc. (in parts
9532 still somewhat experimental); old Makefiles etc. still functional;
9534 * new 'Isabelle System Manual';
9536 * INSTALL text, together with ./configure and ./build scripts;
9538 * reimplemented type inference for greater efficiency, better error
9539 messages and clean internal interface;
9541 * prlim command for dealing with lots of subgoals (an easier way of
9542 setting goals_limit);
9547 * supports alternative (named) syntax tables (parser and pretty
9548 printer); internal interface is provided by add_modesyntax(_i);
9550 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
9551 be used in conjunction with the Isabelle symbol font; uses the
9552 "symbols" syntax table;
9554 * added token_translation interface (may translate name tokens in
9555 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
9556 the current print_mode); IMPORTANT: user print translation functions
9557 are responsible for marking newly introduced bounds
9558 (Syntax.mark_boundT);
9560 * token translations for modes "xterm" and "xterm_color" that display
9561 names in bold, underline etc. or colors (which requires a color
9564 * infixes may now be declared with names independent of their syntax;
9566 * added typed_print_translation (like print_translation, but may
9567 access type of constant);
9570 *** Classical Reasoner ***
9572 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
9573 some limitations. Blast_tac...
9574 + ignores addss, addbefore, addafter; this restriction is intrinsic
9575 + ignores elimination rules that don't have the correct format
9576 (the conclusion MUST be a formula variable)
9577 + ignores types, which can make HOL proofs fail
9578 + rules must not require higher-order unification, e.g. apply_type in ZF
9579 [message "Function Var's argument not a bound variable" relates to this]
9580 + its proof strategy is more general but can actually be slower
9582 * substitution with equality assumptions no longer permutes other
9585 * minor changes in semantics of addafter (now called addaltern); renamed
9586 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
9587 (and access functions for it);
9589 * improved combination of classical reasoner and simplifier:
9590 + functions for handling clasimpsets
9591 + improvement of addss: now the simplifier is called _after_ the
9593 + safe variant of addss called addSss: uses safe simplifications
9594 _during_ the safe steps. It is more complete as it allows multiple
9595 instantiations of unknowns (e.g. with slow_tac).
9599 * added interface for simplification procedures (functions that
9600 produce *proven* rewrite rules on the fly, depending on current
9603 * ordering on terms as parameter (used for ordered rewriting);
9605 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
9607 * the solver is now split into a safe and an unsafe part.
9608 This should be invisible for the normal user, except that the
9609 functions setsolver and addsolver have been renamed to setSolver and
9610 addSolver; added safe_asm_full_simp_tac;
9615 * a generic induction tactic `induct_tac' which works for all datatypes and
9616 also for type `nat';
9618 * a generic case distinction tactic `exhaust_tac' which works for all
9619 datatypes and also for type `nat';
9621 * each datatype comes with a function `size';
9623 * patterns in case expressions allow tuple patterns as arguments to
9624 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
9626 * primrec now also works with type nat;
9628 * recdef: a new declaration form, allows general recursive functions to be
9629 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
9631 * the constant for negation has been renamed from "not" to "Not" to
9632 harmonize with FOL, ZF, LK, etc.;
9634 * HOL/ex/LFilter theory of a corecursive "filter" functional for
9637 * HOL/Modelcheck demonstrates invocation of model checker oracle;
9639 * HOL/ex/Ring.thy declares cring_simp, which solves equational
9640 problems in commutative rings, using axiomatic type classes for + and *;
9642 * more examples in HOL/MiniML and HOL/Auth;
9644 * more default rewrite rules for quantifiers, union/intersection;
9646 * a new constant `arbitrary == @x.False';
9648 * HOLCF/IOA replaces old HOL/IOA;
9650 * HOLCF changes: derived all rules and arities
9651 + axiomatic type classes instead of classes
9652 + typedef instead of faking type definitions
9653 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
9654 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
9655 + eliminated the types void, one, tr
9656 + use unit lift and bool lift (with translations) instead of one and tr
9657 + eliminated blift from Lift3.thy (use Def instead of blift)
9658 all eliminated rules are derived as theorems --> no visible changes ;
9663 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
9664 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
9665 as ZF_cs addSIs [equalityI];
9669 New in Isabelle94-7 (November 96)
9670 ---------------------------------
9672 * allowing negative levels (as offsets) in prlev and choplev;
9674 * super-linear speedup for large simplifications;
9676 * FOL, ZF and HOL now use miniscoping: rewriting pushes
9677 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
9678 FAIL); can suppress it using the command Delsimps (ex_simps @
9679 all_simps); De Morgan laws are also now included, by default;
9681 * improved printing of ==> : ~:
9683 * new object-logic "Sequents" adds linear logic, while replacing LK
9684 and Modal (thanks to Sara Kalvala);
9686 * HOL/Auth: correctness proofs for authentication protocols;
9688 * HOL: new auto_tac combines rewriting and classical reasoning (many
9689 examples on HOL/Auth);
9691 * HOL: new command AddIffs for declaring theorems of the form P=Q to
9692 the rewriter and classical reasoner simultaneously;
9694 * function uresult no longer returns theorems in "standard" format;
9695 regain previous version by: val uresult = standard o uresult;
9702 * oracles -- these establish an interface between Isabelle and trusted
9703 external reasoners, which may deliver results as theorems;
9705 * proof objects (in particular record all uses of oracles);
9707 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
9709 * "constdefs" section in theory files;
9711 * "primrec" section (HOL) no longer requires names;
9713 * internal type "tactic" now simply "thm -> thm Sequence.seq";
9720 * reduced space requirements;
9722 * automatic HTML generation from theories;
9724 * theory files no longer require "..." (quotes) around most types;
9726 * new examples, including two proofs of the Church-Rosser theorem;
9728 * non-curried (1994) version of HOL is no longer distributed;
9735 * greatly reduced space requirements;
9737 * theory files (.thy) no longer require \...\ escapes at line breaks;
9739 * searchable theorem database (see the section "Retrieving theorems" on
9740 page 8 of the Reference Manual);
9742 * new examples, including Grabczewski's monumental case study of the
9745 * The previous version of HOL renamed to Old_HOL;
9747 * The new version of HOL (previously called CHOL) uses a curried syntax
9748 for functions. Application looks like f a b instead of f(a,b);
9750 * Mutually recursive inductive definitions finally work in HOL;
9752 * In ZF, pattern-matching on tuples is now available in all abstractions and
9753 translates to the operator "split";
9760 * new infix operator, addss, allowing the classical reasoner to
9761 perform simplification at each step of its search. Example:
9762 fast_tac (cs addss ss)
9764 * a new logic, CHOL, the same as HOL, but with a curried syntax
9765 for functions. Application looks like f a b instead of f(a,b). Also pairs
9766 look like (a,b) instead of <a,b>;
9768 * PLEASE NOTE: CHOL will eventually replace HOL!
9770 * In CHOL, pattern-matching on tuples is now available in all abstractions.
9771 It translates to the operator "split". A new theory of integers is available;
9773 * In ZF, integer numerals now denote two's-complement binary integers.
9774 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
9776 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
9777 of the Axiom of Choice;
9784 * Significantly faster resolution;
9786 * the different sections in a .thy file can now be mixed and repeated
9789 * Database of theorems for FOL, HOL and ZF. New
9790 commands including qed, qed_goal and bind_thm store theorems in the database.
9792 * Simple database queries: return a named theorem (get_thm) or all theorems of
9793 a given theory (thms_of), or find out what theory a theorem was proved in
9796 * Bugs fixed in the inductive definition and datatype packages;
9798 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
9799 and HOL_dup_cs obsolete;
9801 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
9804 * Simpler definition of function space in ZF;
9806 * new results about cardinal and ordinal arithmetic in ZF;
9808 * 'subtype' facility in HOL for introducing new types as subsets of existing
9811 :mode=text:wrap=hard:maxLineLen=72: