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 - Rationalized type encodings ("type_enc" option).
51 max_relevant ~> max_facts
52 relevance_thresholds ~> fact_thresholds
55 *** Document preparation ***
57 * Default for \<euro> is now based on eurosym package, instead of
58 slightly exotic babel/greek.
63 * Discontinued support for Poly/ML 5.2.1, which was the last version
64 without exception positions and advanced ML compiler/toplevel
69 New in Isabelle2012 (May 2012)
70 ------------------------------
74 * Prover IDE (PIDE) improvements:
76 - more robust Sledgehammer integration (as before the sledgehammer
77 command-line needs to be typed into the source buffer)
78 - markup for bound variables
79 - markup for types of term variables (displayed as tooltips)
80 - support for user-defined Isar commands within the running session
81 - improved support for Unicode outside original 16bit range
82 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
84 * Forward declaration of outer syntax keywords within the theory
85 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
86 commands to be used in the same theory where defined.
88 * Auxiliary contexts indicate block structure for specifications with
89 additional parameters and assumptions. Such unnamed contexts may be
90 nested within other targets, like 'theory', 'locale', 'class',
91 'instantiation' etc. Results from the local context are generalized
92 accordingly and applied to the enclosing target context. Example:
96 assumes xy: "x = y" and yz: "y = z"
99 lemma my_trans: "x = z" using xy yz by simp
105 The most basic application is to factor-out context elements of
106 several fixes/assumes/shows theorem statements, e.g. see
107 ~~/src/HOL/Isar_Examples/Group_Context.thy
109 Any other local theory specification element works within the "context
110 ... begin ... end" block as well.
112 * Bundled declarations associate attributed fact expressions with a
113 given name in the context. These may be later included in other
114 contexts. This allows to manage context extensions casually, without
115 the logical dependencies of locales and locale interpretation. See
116 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
118 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
119 declaration, and results are standardized before being stored. Thus
120 old-style "standard" after instantiation or composition of facts
121 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
122 indices of schematic variables.
124 * Rule attributes in local theory declarations (e.g. locale or class)
125 are now statically evaluated: the resulting theorem is stored instead
126 of the original expression. INCOMPATIBILITY in rare situations, where
127 the historic accident of dynamic re-evaluation in interpretations
130 * New tutorial "Programming and Proving in Isabelle/HOL"
131 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
132 Structured Isar Proofs" ("isar-overview"), which has been removed. It
133 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
134 Logic" as the recommended beginners tutorial, but does not cover all
135 of the material of that old tutorial.
137 * Updated and extended reference manuals: "isar-ref",
138 "implementation", "system"; reduced remaining material in old "ref"
144 * Command 'definition' no longer exports the foundational "raw_def"
145 into the user context. Minor INCOMPATIBILITY, may use the regular
146 "def" result with attribute "abs_def" to imitate the old version.
148 * Attribute "abs_def" turns an equation of the form "f x y == t" into
149 "f == %x y. t", which ensures that "simp" or "unfold" steps always
150 expand it. This also works for object-logic equality. (Formerly
151 undocumented feature.)
153 * Sort constraints are now propagated in simultaneous statements, just
154 like type constraints. INCOMPATIBILITY in rare situations, where
155 distinct sorts used to be assigned accidentally. For example:
157 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
159 lemma "P (x::'a)" and "Q (y::'a::bar)"
160 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
162 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
163 tolerant against multiple unifiers, as long as the final result is
164 unique. (As before, rules are composed in canonical right-to-left
165 order to accommodate newly introduced premises.)
167 * Renamed some inner syntax categories:
173 Minor INCOMPATIBILITY. Note that in practice "num_const" or
174 "num_position" etc. are mainly used instead (which also include
175 position information via constraints).
177 * Simplified configuration options for syntax ambiguity: see
178 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
179 manual. Minor INCOMPATIBILITY.
181 * Discontinued configuration option "syntax_positions": atomic terms
182 in parse trees are always annotated by position constraints.
184 * Old code generator for SML and its commands 'code_module',
185 'code_library', 'consts_code', 'types_code' have been discontinued.
186 Use commands of the generic code generator instead. INCOMPATIBILITY.
188 * Redundant attribute "code_inline" has been discontinued. Use
189 "code_unfold" instead. INCOMPATIBILITY.
191 * Dropped attribute "code_unfold_post" in favor of the its dual
192 "code_abbrev", which yields a common pattern in definitions like
194 definition [code_abbrev]: "f = t"
198 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
199 instead. INCOMPATIBILITY.
201 * Discontinued old "prems" fact, which used to refer to the accidental
202 collection of foundational premises in the context (already marked as
203 legacy since Isabelle2011).
208 * Type 'a set is now a proper type constructor (just as before
209 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
210 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
211 sets separate, it is often sufficient to rephrase some set S that has
212 been accidentally used as predicates by "%x. x : S", and some
213 predicate P that has been accidentally used as set by "{x. P x}".
214 Corresponding proofs in a first step should be pruned from any
215 tinkering with former theorems mem_def and Collect_def as far as
218 For developments which deliberately mix predicates and sets, a
219 planning step is necessary to determine what should become a predicate
220 and what a set. It can be helpful to carry out that step in
221 Isabelle2011-1 before jumping right into the current release.
223 * Code generation by default implements sets as container type rather
224 than predicates. INCOMPATIBILITY.
226 * New type synonym 'a rel = ('a * 'a) set
228 * The representation of numerals has changed. Datatype "num"
229 represents strictly positive binary numerals, along with functions
230 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
231 positive and negated numeric literals, respectively. See also
232 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
233 user theories may require adaptations as follows:
235 - Theorems with number_ring or number_semiring constraints: These
236 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
238 - Theories defining numeric types: Remove number, number_semiring,
239 and number_ring instances. Defer all theorems about numerals until
240 after classes one and semigroup_add have been instantiated.
242 - Numeral-only simp rules: Replace each rule having a "number_of v"
243 pattern with two copies, one for numeral and one for neg_numeral.
245 - Theorems about subclasses of semiring_1 or ring_1: These classes
246 automatically support numerals now, so more simp rules and
247 simprocs may now apply within the proof.
249 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
250 Redefine using other integer operations.
252 * Transfer: New package intended to generalize the existing
253 "descending" method and related theorem attributes from the Quotient
254 package. (Not all functionality is implemented yet, but future
255 development will focus on Transfer as an eventual replacement for the
256 corresponding parts of the Quotient package.)
258 - transfer_rule attribute: Maintains a collection of transfer rules,
259 which relate constants at two different types. Transfer rules may
260 relate different type instances of the same polymorphic constant,
261 or they may relate an operation on a raw type to a corresponding
262 operation on an abstract type (quotient or subtype). For example:
264 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
265 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
267 - transfer method: Replaces a subgoal on abstract types with an
268 equivalent subgoal on the corresponding raw types. Constants are
269 replaced with corresponding ones according to the transfer rules.
270 Goals are generalized over all free variables by default; this is
271 necessary for variables whose types change, but can be overridden
272 for specific variables with e.g. "transfer fixing: x y z". The
273 variant transfer' method allows replacing a subgoal with one that
274 is logically stronger (rather than equivalent).
276 - relator_eq attribute: Collects identity laws for relators of
277 various type constructors, e.g. "list_all2 (op =) = (op =)". The
278 transfer method uses these lemmas to infer transfer rules for
279 non-polymorphic constants on the fly.
281 - transfer_prover method: Assists with proving a transfer rule for a
282 new constant, provided the constant is defined in terms of other
283 constants that already have transfer rules. It should be applied
284 after unfolding the constant definitions.
286 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
287 from type nat to type int.
289 * Lifting: New package intended to generalize the quotient_definition
290 facility of the Quotient package; designed to work with Transfer.
292 - lift_definition command: Defines operations on an abstract type in
293 terms of a corresponding operation on a representation
294 type. Example syntax:
296 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
299 Users must discharge a respectfulness proof obligation when each
300 constant is defined. (For a type copy, i.e. a typedef with UNIV,
301 the proof is discharged automatically.) The obligation is
302 presented in a user-friendly, readable form; a respectfulness
303 theorem in the standard format and a transfer rule are generated
306 - Integration with code_abstype: For typedefs (e.g. subtypes
307 corresponding to a datatype invariant, such as dlist),
308 lift_definition generates a code certificate theorem and sets up
309 code generation for each constant.
311 - setup_lifting command: Sets up the Lifting package to work with a
312 user-defined type. The user must provide either a quotient theorem
313 or a type_definition theorem. The package configures transfer
314 rules for equality and quantifiers on the type, and sets up the
315 lift_definition command to work with the type.
317 - Usage examples: See Quotient_Examples/Lift_DList.thy,
318 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
319 Word/Word.thy and Library/Float.thy.
323 - The 'quotient_type' command now supports a 'morphisms' option with
324 rep and abs functions, similar to typedef.
326 - 'quotient_type' sets up new types to work with the Lifting and
327 Transfer packages, as with 'setup_lifting'.
329 - The 'quotient_definition' command now requires the user to prove a
330 respectfulness property at the point where the constant is
331 defined, similar to lift_definition; INCOMPATIBILITY.
333 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
334 accordingly, INCOMPATIBILITY.
336 * New diagnostic command 'find_unused_assms' to find potentially
337 superfluous assumptions in theorems using Quickcheck.
341 - Quickcheck returns variable assignments as counterexamples, which
342 allows to reveal the underspecification of functions under test.
343 For example, refuting "hd xs = x", it presents the variable
344 assignment xs = [] and x = a1 as a counterexample, assuming that
345 any property is false whenever "hd []" occurs in it.
347 These counterexample are marked as potentially spurious, as
348 Quickcheck also returns "xs = []" as a counterexample to the
349 obvious theorem "hd xs = hd xs".
351 After finding a potentially spurious counterexample, Quickcheck
352 continues searching for genuine ones.
354 By default, Quickcheck shows potentially spurious and genuine
355 counterexamples. The option "genuine_only" sets quickcheck to only
356 show genuine counterexamples.
358 - The command 'quickcheck_generator' creates random and exhaustive
359 value generators for a given type and operations.
361 It generates values by using the operations as if they were
362 constructors of that type.
364 - Support for multisets.
366 - Added "use_subtype" options.
368 - Added "quickcheck_locale" configuration to specify how to process
369 conjectures in a locale context.
371 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
372 and affecting 'rat' and 'real'.
375 - Integrated more tightly with SPASS, as described in the ITP 2012
376 paper "More SPASS with Isabelle".
377 - Made it try "smt" as a fallback if "metis" fails or times out.
378 - Added support for the following provers: Alt-Ergo (via Why3 and
379 TFF1), iProver, iProver-Eq.
380 - Sped up the minimizer.
381 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
382 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
383 - Renamed "sound" option to "strict".
385 * Metis: Added possibility to specify lambda translations scheme as a
386 parenthesized argument (e.g., "by (metis (lifting) ...)").
388 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
390 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
392 * New "case_product" attribute to generate a case rule doing multiple
393 case distinctions at the same time. E.g.
395 list.exhaust [case_product nat.exhaust]
397 produces a rule which can be used to perform case distinction on both
400 * New "eventually_elim" method as a generalized variant of the
401 eventually_elim* rules. Supports structured proofs.
403 * Typedef with implicit set definition is considered legacy. Use
404 "typedef (open)" form instead, which will eventually become the
407 * Record: code generation can be switched off manually with
409 declare [[record_coden = false]] -- "default true"
411 * Datatype: type parameters allow explicit sort constraints.
413 * Concrete syntax for case expressions includes constraints for source
414 positions, and thus produces Prover IDE markup for its bindings.
415 INCOMPATIBILITY for old-style syntax translations that augment the
416 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
419 * Clarified attribute "mono_set": pure declaration without modifying
420 the result of the fact expression.
422 * More default pred/set conversions on a couple of relation operations
423 and predicates. Added powers of predicate relations. Consolidation
424 of some relation theorems:
426 converse_def ~> converse_unfold
427 rel_comp_def ~> relcomp_unfold
428 symp_def ~> (modified, use symp_def and sym_def instead)
429 transp_def ~> transp_trans
430 Domain_def ~> Domain_unfold
431 Range_def ~> Domain_converse [symmetric]
433 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
435 See theory "Relation" for examples for making use of pred/set
436 conversions by means of attributes "to_set" and "to_pred".
440 * Renamed facts about the power operation on relations, i.e., relpow
441 to match the constant's name:
443 rel_pow_1 ~> relpow_1
444 rel_pow_0_I ~> relpow_0_I
445 rel_pow_Suc_I ~> relpow_Suc_I
446 rel_pow_Suc_I2 ~> relpow_Suc_I2
447 rel_pow_0_E ~> relpow_0_E
448 rel_pow_Suc_E ~> relpow_Suc_E
449 rel_pow_E ~> relpow_E
450 rel_pow_Suc_D2 ~> relpow_Suc_D2
451 rel_pow_Suc_E2 ~> relpow_Suc_E2
452 rel_pow_Suc_D2' ~> relpow_Suc_D2'
453 rel_pow_E2 ~> relpow_E2
454 rel_pow_add ~> relpow_add
455 rel_pow_commute ~> relpow
456 rel_pow_empty ~> relpow_empty:
457 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
458 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
459 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
460 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
461 rel_pow_fun_conv ~> relpow_fun_conv
462 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
463 rel_pow_finite_bounded ~> relpow_finite_bounded
464 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
465 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
466 single_valued_rel_pow ~> single_valued_relpow
470 * Theory Relation: Consolidated constant name for relation composition
471 and corresponding theorem names:
473 - Renamed constant rel_comp to relcomp.
475 - Dropped abbreviation pred_comp. Use relcompp instead.
479 rel_compI ~> relcompI
480 rel_compEpair ~> relcompEpair
481 rel_compE ~> relcompE
482 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
483 rel_comp_empty1 ~> relcomp_empty1
484 rel_comp_mono ~> relcomp_mono
485 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
486 rel_comp_distrib ~> relcomp_distrib
487 rel_comp_distrib2 ~> relcomp_distrib2
488 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
489 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
490 single_valued_rel_comp ~> single_valued_relcomp
491 rel_comp_def ~> relcomp_unfold
492 converse_rel_comp ~> converse_relcomp
493 pred_compI ~> relcomppI
494 pred_compE ~> relcomppE
495 pred_comp_bot1 ~> relcompp_bot1
496 pred_comp_bot2 ~> relcompp_bot2
497 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
498 pred_comp_mono ~> relcompp_mono
499 pred_comp_distrib ~> relcompp_distrib
500 pred_comp_distrib2 ~> relcompp_distrib2
501 converse_pred_comp ~> converse_relcompp
503 finite_rel_comp ~> finite_relcomp
505 set_rel_comp ~> set_relcomp
509 * Theory Divides: Discontinued redundant theorems about div and mod.
510 INCOMPATIBILITY, use the corresponding generic theorems instead.
512 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
513 zdiv_self ~> div_self
514 zmod_self ~> mod_self
517 zdiv_zmod_equality ~> div_mod_equality2
518 zdiv_zmod_equality2 ~> div_mod_equality
519 zmod_zdiv_trivial ~> mod_div_trivial
520 zdiv_zminus_zminus ~> div_minus_minus
521 zmod_zminus_zminus ~> mod_minus_minus
522 zdiv_zminus2 ~> div_minus_right
523 zmod_zminus2 ~> mod_minus_right
524 zdiv_minus1_right ~> div_minus1_right
525 zmod_minus1_right ~> mod_minus1_right
526 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
527 zmod_zmult1_eq ~> mod_mult_right_eq
528 zpower_zmod ~> power_mod
530 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
531 mod_mult_distrib ~> mult_mod_left
532 mod_mult_distrib2 ~> mult_mod_right
534 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
535 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
537 * Finite_Set.fold now qualified. INCOMPATIBILITY.
539 * Consolidated theorem names concerning fold combinators:
541 inf_INFI_fold_inf ~> inf_INF_fold_inf
542 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
543 INFI_fold_inf ~> INF_fold_inf
544 SUPR_fold_sup ~> SUP_fold_sup
545 union_set ~> union_set_fold
546 minus_set ~> minus_set_fold
547 INFI_set_fold ~> INF_set_fold
548 SUPR_set_fold ~> SUP_set_fold
549 INF_code ~> INF_set_foldr
550 SUP_code ~> SUP_set_foldr
551 foldr.simps ~> foldr.simps (in point-free formulation)
552 foldr_fold_rev ~> foldr_conv_fold
553 foldl_fold ~> foldl_conv_fold
554 foldr_foldr ~> foldr_conv_foldl
555 foldl_foldr ~> foldl_conv_foldr
556 fold_set_remdups ~> fold_set_fold_remdups
557 fold_set ~> fold_set_fold
558 fold1_set ~> fold1_set_fold
562 * Dropped rarely useful theorems concerning fold combinators:
563 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
564 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
565 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
566 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
567 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
568 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
569 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
570 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
571 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
572 unfolding "foldr_conv_fold" and "foldl_conv_fold".
574 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
575 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
576 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
577 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
578 lemmas over fold rather than foldr, or make use of lemmas
579 fold_conv_foldr and fold_rev.
581 * Congruence rules Option.map_cong and Option.bind_cong for recursion
582 through option types.
584 * "Transitive_Closure.ntrancl": bounded transitive closure on
587 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
589 * Theory Int: Discontinued many legacy theorems specific to type int.
590 INCOMPATIBILITY, use the corresponding generic theorems instead.
592 zminus_zminus ~> minus_minus
593 zminus_0 ~> minus_zero
594 zminus_zadd_distrib ~> minus_add_distrib
595 zadd_commute ~> add_commute
596 zadd_assoc ~> add_assoc
597 zadd_left_commute ~> add_left_commute
601 zadd_0_right ~> add_0_right
602 zadd_zminus_inverse2 ~> left_minus
603 zmult_zminus ~> mult_minus_left
604 zmult_commute ~> mult_commute
605 zmult_assoc ~> mult_assoc
606 zadd_zmult_distrib ~> left_distrib
607 zadd_zmult_distrib2 ~> right_distrib
608 zdiff_zmult_distrib ~> left_diff_distrib
609 zdiff_zmult_distrib2 ~> right_diff_distrib
610 zmult_1 ~> mult_1_left
611 zmult_1_right ~> mult_1_right
612 zle_refl ~> order_refl
613 zle_trans ~> order_trans
614 zle_antisym ~> order_antisym
615 zle_linear ~> linorder_linear
616 zless_linear ~> linorder_less_linear
617 zadd_left_mono ~> add_left_mono
618 zadd_strict_right_mono ~> add_strict_right_mono
619 zadd_zless_mono ~> add_less_le_mono
620 int_0_less_1 ~> zero_less_one
621 int_0_neq_1 ~> zero_neq_one
623 zpower_zadd_distrib ~> power_add
624 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
625 zero_le_zpower_abs ~> zero_le_power_abs
627 * Theory Deriv: Renamed
629 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
631 * Theory Library/Multiset: Improved code generation of multisets.
633 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
634 are expressed via type classes again. The special syntax
635 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
636 setsum_set, which is now subsumed by Big_Operators.setsum.
639 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
640 use theory HOL/Library/Nat_Bijection instead.
642 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
643 trees is now inside a type class context. Names of affected
644 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
645 theories working directly with raw red-black trees, adapt the names as
649 bulkload -> rbt_bulkload
650 del_from_left -> rbt_del_from_left
651 del_from_right -> rbt_del_from_right
656 insertw -> rbt_insert_with
657 insert_with_key -> rbt_insert_with_key
658 map_entry -> rbt_map_entry
661 tree_greater -> rbt_greater
662 tree_less -> rbt_less
663 tree_less_symbol -> rbt_less_symbol
665 union_with -> rbt_union_with
666 union_with_key -> rbt_union_with_key
669 balance_left_sorted -> balance_left_rbt_sorted
670 balance_left_tree_greater -> balance_left_rbt_greater
671 balance_left_tree_less -> balance_left_rbt_less
672 balance_right_sorted -> balance_right_rbt_sorted
673 balance_right_tree_greater -> balance_right_rbt_greater
674 balance_right_tree_less -> balance_right_rbt_less
675 balance_sorted -> balance_rbt_sorted
676 balance_tree_greater -> balance_rbt_greater
677 balance_tree_less -> balance_rbt_less
678 bulkload_is_rbt -> rbt_bulkload_is_rbt
679 combine_sorted -> combine_rbt_sorted
680 combine_tree_greater -> combine_rbt_greater
681 combine_tree_less -> combine_rbt_less
682 delete_in_tree -> rbt_delete_in_tree
683 delete_is_rbt -> rbt_delete_is_rbt
684 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
685 del_from_left_tree_less -> rbt_del_from_left_rbt_less
686 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
687 del_from_right_tree_less -> rbt_del_from_right_rbt_less
688 del_in_tree -> rbt_del_in_tree
689 del_inv1_inv2 -> rbt_del_inv1_inv2
690 del_sorted -> rbt_del_rbt_sorted
691 del_tree_greater -> rbt_del_rbt_greater
692 del_tree_less -> rbt_del_rbt_less
693 dom_lookup_Branch -> dom_rbt_lookup_Branch
694 entries_lookup -> entries_rbt_lookup
695 finite_dom_lookup -> finite_dom_rbt_lookup
696 insert_sorted -> rbt_insert_rbt_sorted
697 insertw_is_rbt -> rbt_insertw_is_rbt
698 insertwk_is_rbt -> rbt_insertwk_is_rbt
699 insertwk_sorted -> rbt_insertwk_rbt_sorted
700 insertw_sorted -> rbt_insertw_rbt_sorted
701 ins_sorted -> ins_rbt_sorted
702 ins_tree_greater -> ins_rbt_greater
703 ins_tree_less -> ins_rbt_less
704 is_rbt_sorted -> is_rbt_rbt_sorted
705 lookup_balance -> rbt_lookup_balance
706 lookup_bulkload -> rbt_lookup_rbt_bulkload
707 lookup_delete -> rbt_lookup_rbt_delete
708 lookup_Empty -> rbt_lookup_Empty
709 lookup_from_in_tree -> rbt_lookup_from_in_tree
710 lookup_in_tree -> rbt_lookup_in_tree
711 lookup_ins -> rbt_lookup_ins
712 lookup_insert -> rbt_lookup_rbt_insert
713 lookup_insertw -> rbt_lookup_rbt_insertw
714 lookup_insertwk -> rbt_lookup_rbt_insertwk
715 lookup_keys -> rbt_lookup_keys
716 lookup_map -> rbt_lookup_map
717 lookup_map_entry -> rbt_lookup_rbt_map_entry
718 lookup_tree_greater -> rbt_lookup_rbt_greater
719 lookup_tree_less -> rbt_lookup_rbt_less
720 lookup_union -> rbt_lookup_rbt_union
721 map_entry_color_of -> rbt_map_entry_color_of
722 map_entry_inv1 -> rbt_map_entry_inv1
723 map_entry_inv2 -> rbt_map_entry_inv2
724 map_entry_is_rbt -> rbt_map_entry_is_rbt
725 map_entry_sorted -> rbt_map_entry_rbt_sorted
726 map_entry_tree_greater -> rbt_map_entry_rbt_greater
727 map_entry_tree_less -> rbt_map_entry_rbt_less
728 map_tree_greater -> map_rbt_greater
729 map_tree_less -> map_rbt_less
730 map_sorted -> map_rbt_sorted
731 paint_sorted -> paint_rbt_sorted
732 paint_lookup -> paint_rbt_lookup
733 paint_tree_greater -> paint_rbt_greater
734 paint_tree_less -> paint_rbt_less
735 sorted_entries -> rbt_sorted_entries
736 tree_greater_eq_trans -> rbt_greater_eq_trans
737 tree_greater_nit -> rbt_greater_nit
738 tree_greater_prop -> rbt_greater_prop
739 tree_greater_simps -> rbt_greater_simps
740 tree_greater_trans -> rbt_greater_trans
741 tree_less_eq_trans -> rbt_less_eq_trans
742 tree_less_nit -> rbt_less_nit
743 tree_less_prop -> rbt_less_prop
744 tree_less_simps -> rbt_less_simps
745 tree_less_trans -> rbt_less_trans
746 tree_ord_props -> rbt_ord_props
747 union_Branch -> rbt_union_Branch
748 union_is_rbt -> rbt_union_is_rbt
749 unionw_is_rbt -> rbt_unionw_is_rbt
750 unionwk_is_rbt -> rbt_unionwk_is_rbt
751 unionwk_sorted -> rbt_unionwk_rbt_sorted
753 * Theory HOL/Library/Float: Floating point numbers are now defined as
754 a subset of the real numbers. All operations are defined using the
755 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
762 round_down -> float_round_down
763 round_up -> float_round_up
767 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
770 abs_float_def -> Float.compute_float_abs
771 bitlen_ge0 -> bitlen_nonneg
772 bitlen.simps -> Float.compute_bitlen
773 float_components -> Float_mantissa_exponent
774 float_divl.simps -> Float.compute_float_divl
775 float_divr.simps -> Float.compute_float_divr
776 float_eq_odd -> mult_powr_eq_mult_powr_iff
777 float_power -> real_of_float_power
778 lapprox_posrat_def -> Float.compute_lapprox_posrat
779 lapprox_rat.simps -> Float.compute_lapprox_rat
780 le_float_def' -> Float.compute_float_le
781 le_float_def -> less_eq_float.rep_eq
782 less_float_def' -> Float.compute_float_less
783 less_float_def -> less_float.rep_eq
784 normfloat_def -> Float.compute_normfloat
785 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
786 normfloat -> normfloat_def
787 normfloat_unique -> use normfloat_def
788 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
789 one_float_def -> Float.compute_float_one
790 plus_float_def -> Float.compute_float_plus
791 rapprox_posrat_def -> Float.compute_rapprox_posrat
792 rapprox_rat.simps -> Float.compute_rapprox_rat
793 real_of_float_0 -> zero_float.rep_eq
794 real_of_float_1 -> one_float.rep_eq
795 real_of_float_abs -> abs_float.rep_eq
796 real_of_float_add -> plus_float.rep_eq
797 real_of_float_minus -> uminus_float.rep_eq
798 real_of_float_mult -> times_float.rep_eq
799 real_of_float_simp -> Float.rep_eq
800 real_of_float_sub -> minus_float.rep_eq
801 round_down.simps -> Float.compute_float_round_down
802 round_up.simps -> Float.compute_float_round_up
803 times_float_def -> Float.compute_float_times
804 uminus_float_def -> Float.compute_float_uminus
805 zero_float_def -> Float.compute_float_zero
807 Lemmas not necessary anymore, use the transfer method:
808 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
809 float_divr, float_le_simp, float_less1_mantissa_bound,
810 float_less_simp, float_less_zero, float_le_zero,
811 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
812 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
813 lapprox_rat_bottom, normalized_float, rapprox_posrat,
814 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
815 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
816 round_up, zero_le_float, zero_less_float
818 * New theory HOL/Library/DAList provides an abstract type for
819 association lists with distinct keys.
821 * Session HOL/IMP: Added new theory of abstract interpretation of
824 * Session HOL-Import: Re-implementation from scratch is faster,
825 simpler, and more scalable. Requires a proof bundle, which is
826 available as an external component. Discontinued old (and mostly
827 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
829 * Session HOL-Word: Discontinued many redundant theorems specific to
830 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
833 word_sub_alt ~> word_sub_wi
834 word_add_alt ~> word_add_def
835 word_mult_alt ~> word_mult_def
836 word_minus_alt ~> word_minus_def
837 word_0_alt ~> word_0_wi
838 word_1_alt ~> word_1_wi
839 word_add_0 ~> add_0_left
840 word_add_0_right ~> add_0_right
841 word_mult_1 ~> mult_1_left
842 word_mult_1_right ~> mult_1_right
843 word_add_commute ~> add_commute
844 word_add_assoc ~> add_assoc
845 word_add_left_commute ~> add_left_commute
846 word_mult_commute ~> mult_commute
847 word_mult_assoc ~> mult_assoc
848 word_mult_left_commute ~> mult_left_commute
849 word_left_distrib ~> left_distrib
850 word_right_distrib ~> right_distrib
851 word_left_minus ~> left_minus
852 word_diff_0_right ~> diff_0_right
853 word_diff_self ~> diff_self
854 word_sub_def ~> diff_minus
855 word_diff_minus ~> diff_minus
856 word_add_ac ~> add_ac
857 word_mult_ac ~> mult_ac
858 word_plus_ac0 ~> add_0_left add_0_right add_ac
859 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
860 word_order_trans ~> order_trans
861 word_order_refl ~> order_refl
862 word_order_antisym ~> order_antisym
863 word_order_linear ~> linorder_linear
864 lenw1_zero_neq_one ~> zero_neq_one
865 word_number_of_eq ~> number_of_eq
866 word_of_int_add_hom ~> wi_hom_add
867 word_of_int_sub_hom ~> wi_hom_sub
868 word_of_int_mult_hom ~> wi_hom_mult
869 word_of_int_minus_hom ~> wi_hom_neg
870 word_of_int_succ_hom ~> wi_hom_succ
871 word_of_int_pred_hom ~> wi_hom_pred
872 word_of_int_0_hom ~> word_0_wi
873 word_of_int_1_hom ~> word_1_wi
875 * Session HOL-Word: New proof method "word_bitwise" for splitting
876 machine word equalities and inequalities into logical circuits,
877 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
878 multiplication, shifting by constants, bitwise operators and numeric
879 constants. Requires fixed-length word types, not 'a word. Solves
880 many standard word identities outright and converts more into first
881 order problems amenable to blast or similar. See also examples in
882 HOL/Word/Examples/WordExamples.thy.
884 * Session HOL-Probability: Introduced the type "'a measure" to
885 represent measures, this replaces the records 'a algebra and 'a
886 measure_space. The locales based on subset_class now have two
887 locale-parameters the space \<Omega> and the set of measurable sets M.
888 The product of probability spaces uses now the same constant as the
889 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
890 measure". Most constants are defined now outside of locales and gain
891 an additional parameter, like null_sets, almost_eventually or \<mu>'.
892 Measure space constructions for distributions and densities now got
893 their own constants distr and density. Instead of using locales to
894 describe measure spaces with a finite space, the measure count_space
895 and point_measure is introduced. INCOMPATIBILITY.
899 finite_measure.\<mu>' -> measure
900 product_algebra_generator -> prod_algebra
901 product_prob_space.emb -> prod_emb
902 product_prob_space.infprod_algebra -> PiM
905 completeable_measure_space
908 finite_product_finite_prob_space
909 finite_product_sigma_algebra
912 pair_finite_prob_space
913 pair_finite_sigma_algebra
916 product_sigma_algebra
920 distribution -> use distr measure, or distributed predicate
922 joint_distribution -> use distr measure, or distributed predicate
923 pair_measure_generator
924 product_prob_space.infprod_algebra -> use PiM
927 Replacement theorems:
928 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
929 finite_measure.empty_measure -> measure_empty
930 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
931 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
932 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
933 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
934 finite_measure.finite_measure -> finite_measure.emeasure_finite
935 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
936 finite_measure.positive_measure' -> measure_nonneg
937 finite_measure.real_measure -> finite_measure.emeasure_real
938 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
939 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
940 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
941 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
942 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
943 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
944 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
945 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
946 information_space.entropy_commute -> information_space.entropy_commute_simple
947 information_space.entropy_eq -> information_space.entropy_simple_distributed
948 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
949 information_space.entropy_positive -> information_space.entropy_nonneg_simple
950 information_space.entropy_uniform_max -> information_space.entropy_uniform
951 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
952 information_space.KL_eq_0 -> information_space.KL_same_eq_0
953 information_space.KL_ge_0 -> information_space.KL_nonneg
954 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
955 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
956 Int_stable_cuboids -> Int_stable_atLeastAtMost
957 Int_stable_product_algebra_generator -> positive_integral
958 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
959 measure_space.additive -> emeasure_additive
960 measure_space.AE_iff_null_set -> AE_iff_null
961 measure_space.almost_everywhere_def -> eventually_ae_filter
962 measure_space.almost_everywhere_vimage -> AE_distrD
963 measure_space.continuity_from_above -> INF_emeasure_decseq
964 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
965 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
966 measure_space.continuity_from_below -> SUP_emeasure_incseq
967 measure_space_density -> emeasure_density
968 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
969 measure_space.integrable_vimage -> integrable_distr
970 measure_space.integral_translated_density -> integral_density
971 measure_space.integral_vimage -> integral_distr
972 measure_space.measure_additive -> plus_emeasure
973 measure_space.measure_compl -> emeasure_compl
974 measure_space.measure_countable_increasing -> emeasure_countable_increasing
975 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
976 measure_space.measure_decseq -> decseq_emeasure
977 measure_space.measure_Diff -> emeasure_Diff
978 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
979 measure_space.measure_eq_0 -> emeasure_eq_0
980 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
981 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
982 measure_space.measure_incseq -> incseq_emeasure
983 measure_space.measure_insert -> emeasure_insert
984 measure_space.measure_mono -> emeasure_mono
985 measure_space.measure_not_negative -> emeasure_not_MInf
986 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
987 measure_space.measure_setsum -> setsum_emeasure
988 measure_space.measure_setsum_split -> setsum_emeasure_cover
989 measure_space.measure_space_vimage -> emeasure_distr
990 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
991 measure_space.measure_subadditive -> subadditive
992 measure_space.measure_top -> emeasure_space
993 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
994 measure_space.measure_Un_null_set -> emeasure_Un_null_set
995 measure_space.positive_integral_translated_density -> positive_integral_density
996 measure_space.positive_integral_vimage -> positive_integral_distr
997 measure_space.real_continuity_from_above -> Lim_measure_decseq
998 measure_space.real_continuity_from_below -> Lim_measure_incseq
999 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
1000 measure_space.real_measure_Diff -> measure_Diff
1001 measure_space.real_measure_finite_Union -> measure_finite_Union
1002 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
1003 measure_space.real_measure_subadditive -> measure_subadditive
1004 measure_space.real_measure_Union -> measure_Union
1005 measure_space.real_measure_UNION -> measure_UNION
1006 measure_space.simple_function_vimage -> simple_function_comp
1007 measure_space.simple_integral_vimage -> simple_integral_distr
1008 measure_space.simple_integral_vimage -> simple_integral_distr
1009 measure_unique_Int_stable -> measure_eqI_generator_eq
1010 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
1011 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
1012 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
1013 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
1014 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
1015 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
1016 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
1017 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
1018 pair_sigma_algebra.sets_swap -> sets_pair_swap
1019 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
1020 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
1021 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
1022 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
1023 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
1024 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
1025 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
1026 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
1027 prob_space.measure_space_1 -> prob_space.emeasure_space_1
1028 prob_space.prob_space_vimage -> prob_space_distr
1029 prob_space.random_variable_restrict -> measurable_restrict
1030 prob_space_unique_Int_stable -> measure_eqI_prob_space
1031 product_algebraE -> prod_algebraE_all
1032 product_algebra_generator_der -> prod_algebra_eq_finite
1033 product_algebra_generator_into_space -> prod_algebra_sets_into_space
1034 product_algebraI -> sets_PiM_I_finite
1035 product_measure_exists -> product_sigma_finite.sigma_finite
1036 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
1037 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
1038 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
1039 product_prob_space.measurable_component -> measurable_component_singleton
1040 product_prob_space.measurable_emb -> measurable_prod_emb
1041 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
1042 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
1043 product_prob_space.measure_emb -> emeasure_prod_emb
1044 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
1045 product_sigma_algebra.product_algebra_into_space -> space_closed
1046 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
1047 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
1048 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
1049 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
1050 sets_product_algebra -> sets_PiM
1051 sigma_algebra.measurable_sigma -> measurable_measure_of
1052 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
1053 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
1054 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
1055 space_product_algebra -> space_PiM
1057 * Session HOL-TPTP: support to parse and import TPTP problems (all
1058 languages) into Isabelle/HOL.
1063 * New "case_product" attribute (see HOL).
1068 * Greater support for structured proofs involving induction or case
1071 * Much greater use of mathematical symbols.
1073 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1078 * Antiquotation @{keyword "name"} produces a parser for outer syntax
1079 from a minor keyword introduced via theory header declaration.
1081 * Antiquotation @{command_spec "name"} produces the
1082 Outer_Syntax.command_spec from a major keyword introduced via theory
1083 header declaration; it can be passed to Outer_Syntax.command etc.
1085 * Local_Theory.define no longer hard-wires default theorem name
1086 "foo_def", but retains the binding as given. If that is Binding.empty
1087 / Attrib.empty_binding, the result is not registered as user-level
1088 fact. The Local_Theory.define_internal variant allows to specify a
1089 non-empty name (used for the foundation in the background theory),
1090 while omitting the fact binding in the user-context. Potential
1091 INCOMPATIBILITY for derived definitional packages: need to specify
1092 naming policy for primitive definitions more explicitly.
1094 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
1095 conformance with similar operations in structure Term and Logic.
1097 * Antiquotation @{attributes [...]} embeds attribute source
1098 representation into the ML text, which is particularly useful with
1099 declarations like Local_Theory.note.
1101 * Structure Proof_Context follows standard naming scheme. Old
1102 ProofContext has been discontinued. INCOMPATIBILITY.
1104 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
1105 change of semantics: update is applied to auxiliary local theory
1108 * Modernized some old-style infix operations:
1110 addeqcongs ~> Simplifier.add_eqcong
1111 deleqcongs ~> Simplifier.del_eqcong
1112 addcongs ~> Simplifier.add_cong
1113 delcongs ~> Simplifier.del_cong
1114 setmksimps ~> Simplifier.set_mksimps
1115 setmkcong ~> Simplifier.set_mkcong
1116 setmksym ~> Simplifier.set_mksym
1117 setmkeqTrue ~> Simplifier.set_mkeqTrue
1118 settermless ~> Simplifier.set_termless
1119 setsubgoaler ~> Simplifier.set_subgoaler
1120 addsplits ~> Splitter.add_split
1121 delsplits ~> Splitter.del_split
1126 * USER_HOME settings variable points to cross-platform user home
1127 directory, which coincides with HOME on POSIX systems only. Likewise,
1128 the Isabelle path specification "~" now expands to $USER_HOME, instead
1129 of former $HOME. A different default for USER_HOME may be set
1130 explicitly in shell environment, before Isabelle settings are
1131 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
1132 the generic user home was intended.
1134 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
1135 notation, which is useful for the jEdit file browser, for example.
1137 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
1142 New in Isabelle2011-1 (October 2011)
1143 ------------------------------------
1147 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
1148 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
1150 - Management of multiple theory files directly from the editor
1151 buffer store -- bypassing the file-system (no requirement to save
1152 files for checking).
1154 - Markup of formal entities within the text buffer, with semantic
1155 highlighting, tooltips and hyperlinks to jump to defining source
1158 - Improved text rendering, with sub/superscripts in the source
1159 buffer (including support for copy/paste wrt. output panel, HTML
1160 theory output and other non-Isabelle text boxes).
1162 - Refined scheduling of proof checking and printing of results,
1163 based on interactive editor view. (Note: jEdit folding and
1164 narrowing allows to restrict buffer perspectives explicitly.)
1166 - Reduced CPU performance requirements, usable on machines with few
1169 - Reduced memory requirements due to pruning of unused document
1170 versions (garbage collection).
1172 See also ~~/src/Tools/jEdit/README.html for further information,
1173 including some remaining limitations.
1175 * Theory loader: source files are exclusively located via the master
1176 directory of each theory node (where the .thy file itself resides).
1177 The global load path (such as src/HOL/Library) has been discontinued.
1178 Note that the path element ~~ may be used to reference theories in the
1179 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
1182 * Theory loader: source files are identified by content via SHA1
1183 digests. Discontinued former path/modtime identification and optional
1184 ISABELLE_FILE_IDENT plugin scripts.
1186 * Parallelization of nested Isar proofs is subject to
1187 Goal.parallel_proofs_threshold (default 100). See also isabelle
1190 * Name space: former unsynchronized references are now proper
1191 configuration options, with more conventional names:
1193 long_names ~> names_long
1194 short_names ~> names_short
1195 unique_names ~> names_unique
1197 Minor INCOMPATIBILITY, need to declare options in context like this:
1199 declare [[names_unique = false]]
1201 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
1202 that the result needs to be unique, which means fact specifications
1203 may have to be refined after enriching a proof context.
1205 * Attribute "case_names" has been refined: the assumptions in each case
1206 can be named now by following the case name with [name1 name2 ...].
1208 * Isabelle/Isar reference manual has been updated and extended:
1209 - "Synopsis" provides a catalog of main Isar language concepts.
1210 - Formal references in syntax diagrams, via @{rail} antiquotation.
1211 - Updated material from classic "ref" manual, notably about
1212 "Classical Reasoner".
1217 * Class bot and top require underlying partial order rather than
1218 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
1220 * Class complete_lattice: generalized a couple of lemmas from sets;
1221 generalized theorems INF_cong and SUP_cong. New type classes for
1222 complete boolean algebras and complete linear orders. Lemmas
1223 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
1224 class complete_linorder.
1226 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
1227 Sup_fun_def, Inf_apply, Sup_apply.
1229 Removed redundant lemmas (the right hand side gives hints how to
1230 replace them for (metis ...), or (simp only: ...) proofs):
1232 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
1233 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
1234 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
1235 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
1236 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
1237 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
1238 Inter_def ~> INF_def, image_def
1239 Union_def ~> SUP_def, image_def
1240 INT_eq ~> INF_def, and image_def
1241 UN_eq ~> SUP_def, and image_def
1242 INF_subset ~> INF_superset_mono [OF _ order_refl]
1244 More consistent and comprehensive names:
1246 INTER_eq_Inter_image ~> INF_def
1247 UNION_eq_Union_image ~> SUP_def
1250 INF_leI ~> INF_lower
1251 INF_leI2 ~> INF_lower2
1252 le_INFI ~> INF_greatest
1253 le_SUPI ~> SUP_upper
1254 le_SUPI2 ~> SUP_upper2
1255 SUP_leI ~> SUP_least
1256 INFI_bool_eq ~> INF_bool_eq
1257 SUPR_bool_eq ~> SUP_bool_eq
1258 INFI_apply ~> INF_apply
1259 SUPR_apply ~> SUP_apply
1260 INTER_def ~> INTER_eq
1261 UNION_def ~> UNION_eq
1265 * Renamed theory Complete_Lattice to Complete_Lattices.
1268 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
1269 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
1270 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
1271 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
1273 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
1274 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
1275 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
1278 * Added syntactic classes "inf" and "sup" for the respective
1279 constants. INCOMPATIBILITY: Changes in the argument order of the
1280 (mostly internal) locale predicates for some derived classes.
1282 * Theorem collections ball_simps and bex_simps do not contain theorems
1283 referring to UNION any longer; these have been moved to collection
1284 UN_ball_bex_simps. INCOMPATIBILITY.
1286 * Theory Archimedean_Field: floor now is defined as parameter of a
1287 separate type class floor_ceiling.
1289 * Theory Finite_Set: more coherent development of fold_set locales:
1291 locale fun_left_comm ~> locale comp_fun_commute
1292 locale fun_left_comm_idem ~> locale comp_fun_idem
1294 Both use point-free characterization; interpretation proofs may need
1295 adjustment. INCOMPATIBILITY.
1297 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
1298 accordance with standard mathematical terminology. INCOMPATIBILITY.
1300 * Theory Complex_Main: The locale interpretations for the
1301 bounded_linear and bounded_bilinear locales have been removed, in
1302 order to reduce the number of duplicate lemmas. Users must use the
1303 original names for distributivity theorems, potential INCOMPATIBILITY.
1305 divide.add ~> add_divide_distrib
1306 divide.diff ~> diff_divide_distrib
1307 divide.setsum ~> setsum_divide_distrib
1308 mult.add_right ~> right_distrib
1309 mult.diff_right ~> right_diff_distrib
1310 mult_right.setsum ~> setsum_right_distrib
1311 mult_left.diff ~> left_diff_distrib
1313 * Theory Complex_Main: Several redundant theorems have been removed or
1314 replaced by more general versions. INCOMPATIBILITY.
1316 real_diff_def ~> minus_real_def
1317 real_divide_def ~> divide_real_def
1318 real_less_def ~> less_le
1319 real_abs_def ~> abs_real_def
1320 real_sgn_def ~> sgn_real_def
1321 real_mult_commute ~> mult_commute
1322 real_mult_assoc ~> mult_assoc
1323 real_mult_1 ~> mult_1_left
1324 real_add_mult_distrib ~> left_distrib
1325 real_zero_not_eq_one ~> zero_neq_one
1326 real_mult_inverse_left ~> left_inverse
1327 INVERSE_ZERO ~> inverse_zero
1328 real_le_refl ~> order_refl
1329 real_le_antisym ~> order_antisym
1330 real_le_trans ~> order_trans
1331 real_le_linear ~> linear
1332 real_le_eq_diff ~> le_iff_diff_le_0
1333 real_add_left_mono ~> add_left_mono
1334 real_mult_order ~> mult_pos_pos
1335 real_mult_less_mono2 ~> mult_strict_left_mono
1336 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
1337 real_0_le_divide_iff ~> zero_le_divide_iff
1338 realpow_two_disj ~> power2_eq_iff
1339 real_squared_diff_one_factored ~> square_diff_one_factored
1340 realpow_two_diff ~> square_diff_square_factored
1341 reals_complete2 ~> complete_real
1342 real_sum_squared_expand ~> power2_sum
1343 exp_ln_eq ~> ln_unique
1345 expi_zero ~> exp_zero
1346 lemma_DERIV_subst ~> DERIV_cong
1347 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
1348 LIMSEQ_const ~> tendsto_const
1349 LIMSEQ_norm ~> tendsto_norm
1350 LIMSEQ_add ~> tendsto_add
1351 LIMSEQ_minus ~> tendsto_minus
1352 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
1353 LIMSEQ_diff ~> tendsto_diff
1354 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
1355 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
1356 LIMSEQ_mult ~> tendsto_mult
1357 LIMSEQ_inverse ~> tendsto_inverse
1358 LIMSEQ_divide ~> tendsto_divide
1359 LIMSEQ_pow ~> tendsto_power
1360 LIMSEQ_setsum ~> tendsto_setsum
1361 LIMSEQ_setprod ~> tendsto_setprod
1362 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
1363 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
1364 LIMSEQ_imp_rabs ~> tendsto_rabs
1365 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
1366 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
1367 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
1368 LIMSEQ_Complex ~> tendsto_Complex
1369 LIM_ident ~> tendsto_ident_at
1370 LIM_const ~> tendsto_const
1371 LIM_add ~> tendsto_add
1372 LIM_add_zero ~> tendsto_add_zero
1373 LIM_minus ~> tendsto_minus
1374 LIM_diff ~> tendsto_diff
1375 LIM_norm ~> tendsto_norm
1376 LIM_norm_zero ~> tendsto_norm_zero
1377 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
1378 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
1379 LIM_rabs ~> tendsto_rabs
1380 LIM_rabs_zero ~> tendsto_rabs_zero
1381 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
1382 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
1383 LIM_compose ~> tendsto_compose
1384 LIM_mult ~> tendsto_mult
1385 LIM_scaleR ~> tendsto_scaleR
1386 LIM_of_real ~> tendsto_of_real
1387 LIM_power ~> tendsto_power
1388 LIM_inverse ~> tendsto_inverse
1389 LIM_sgn ~> tendsto_sgn
1390 isCont_LIM_compose ~> isCont_tendsto_compose
1391 bounded_linear.LIM ~> bounded_linear.tendsto
1392 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
1393 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
1394 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
1395 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
1396 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
1397 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
1399 * Theory Complex_Main: The definition of infinite series was
1400 generalized. Now it is defined on the type class {topological_space,
1401 comm_monoid_add}. Hence it is useable also for extended real numbers.
1403 * Theory Complex_Main: The complex exponential function "expi" is now
1404 a type-constrained abbreviation for "exp :: complex => complex"; thus
1405 several polymorphic lemmas about "exp" are now applicable to "expi".
1409 - Theory Library/Code_Char_ord provides native ordering of
1410 characters in the target language.
1412 - Commands code_module and code_library are legacy, use export_code
1415 - Method "evaluation" is legacy, use method "eval" instead.
1417 - Legacy evaluator "SML" is deactivated by default. May be
1418 reactivated by the following theory command:
1420 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
1422 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
1424 * New proof method "induction" that gives induction hypotheses the
1425 name "IH", thus distinguishing them from further hypotheses that come
1426 from rule induction. The latter are still called "hyps". Method
1427 "induction" is a thin wrapper around "induct" and follows the same
1430 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
1431 still available as a legacy feature for some time.
1434 - Added "need" and "total_consts" options.
1435 - Reintroduced "show_skolems" option by popular demand.
1436 - Renamed attribute: nitpick_def ~> nitpick_unfold.
1440 - Use quasi-sound (and efficient) translations by default.
1441 - Added support for the following provers: E-ToFoF, LEO-II,
1442 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
1443 - Automatically preplay and minimize proofs before showing them if
1444 this can be done within reasonable time.
1445 - sledgehammer available_provers ~> sledgehammer supported_provers.
1447 - Added "preplay_timeout", "slicing", "type_enc", "sound",
1448 "max_mono_iters", and "max_new_mono_instances" options.
1449 - Removed "explicit_apply" and "full_types" options as well as "Full
1450 Types" Proof General menu item. INCOMPATIBILITY.
1453 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
1454 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
1458 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
1459 "elim:" options. INCOMPATIBILITY.
1460 - Introduced 'try' that not only runs 'try_methods' but also
1461 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
1464 - Added "eval" option to evaluate terms for the found counterexample
1465 (currently only supported by the default (exhaustive) tester).
1466 - Added post-processing of terms to obtain readable counterexamples
1467 (currently only supported by the default (exhaustive) tester).
1468 - New counterexample generator quickcheck[narrowing] enables
1469 narrowing-based testing. Requires the Glasgow Haskell compiler
1470 with its installation location defined in the Isabelle settings
1471 environment as ISABELLE_GHC.
1472 - Removed quickcheck tester "SML" based on the SML code generator
1473 (formly in HOL/Library).
1475 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
1476 use 'partial_function' instead.
1478 * Theory Library/Extended_Reals replaces now the positive extended
1479 reals found in probability theory. This file is extended by
1480 Multivariate_Analysis/Extended_Real_Limits.
1482 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
1483 from where it must be imported explicitly if it is really required.
1486 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
1487 been moved here. INCOMPATIBILITY.
1489 * Theory Library/Saturated provides type of numbers with saturated
1492 * Theory Library/Product_Lattice defines a pointwise ordering for the
1493 product type 'a * 'b, and provides instance proofs for various order
1494 and lattice type classes.
1496 * Theory Library/Countable now provides the "countable_datatype" proof
1497 method for proving "countable" class instances for datatypes.
1499 * Theory Library/Cset_Monad allows do notation for computable sets
1500 (cset) via the generic monad ad-hoc overloading facility.
1502 * Library: Theories of common data structures are split into theories
1503 for implementation, an invariant-ensuring type, and connection to an
1504 abstract type. INCOMPATIBILITY.
1506 - RBT is split into RBT and RBT_Mapping.
1507 - AssocList is split and renamed into AList and AList_Mapping.
1508 - DList is split into DList_Impl, DList, and DList_Cset.
1509 - Cset is split into Cset and List_Cset.
1511 * Theory Library/Nat_Infinity has been renamed to
1512 Library/Extended_Nat, with name changes of the following types and
1515 type inat ~> type enat
1517 Infty ~> infinity (overloaded)
1521 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
1522 been renamed accordingly. INCOMPATIBILITY.
1524 * Session Multivariate_Analysis: The euclidean_space type class now
1525 fixes a constant "Basis :: 'a set" consisting of the standard
1526 orthonormal basis for the type. Users now have the option of
1527 quantifying over this set instead of using the "basis" function, e.g.
1528 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
1530 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
1531 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
1532 "Cart_nth" and "Cart_lambda" have been respectively renamed to
1533 "vec_nth" and "vec_lambda"; theorems mentioning those names have
1534 changed to match. Definition theorems for overloaded constants now use
1535 the standard "foo_vec_def" naming scheme. A few other theorems have
1536 been renamed as follows (INCOMPATIBILITY):
1538 Cart_eq ~> vec_eq_iff
1539 dist_nth_le_cart ~> dist_vec_nth_le
1540 tendsto_vector ~> vec_tendstoI
1541 Cauchy_vector ~> vec_CauchyI
1543 * Session Multivariate_Analysis: Several duplicate theorems have been
1544 removed, and other theorems have been renamed or replaced with more
1545 general versions. INCOMPATIBILITY.
1547 finite_choice ~> finite_set_choice
1548 eventually_conjI ~> eventually_conj
1549 eventually_and ~> eventually_conj_iff
1550 eventually_false ~> eventually_False
1551 setsum_norm ~> norm_setsum
1552 Lim_sequentially ~> LIMSEQ_def
1553 Lim_ident_at ~> LIM_ident
1554 Lim_const ~> tendsto_const
1555 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
1556 Lim_neg ~> tendsto_minus
1557 Lim_add ~> tendsto_add
1558 Lim_sub ~> tendsto_diff
1559 Lim_mul ~> tendsto_scaleR
1560 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
1561 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
1562 Lim_linear ~> bounded_linear.tendsto
1563 Lim_component ~> tendsto_euclidean_component
1564 Lim_component_cart ~> tendsto_vec_nth
1565 Lim_inner ~> tendsto_inner [OF tendsto_const]
1566 dot_lsum ~> inner_setsum_left
1567 dot_rsum ~> inner_setsum_right
1568 continuous_cmul ~> continuous_scaleR [OF continuous_const]
1569 continuous_neg ~> continuous_minus
1570 continuous_sub ~> continuous_diff
1571 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
1572 continuous_mul ~> continuous_scaleR
1573 continuous_inv ~> continuous_inverse
1574 continuous_at_within_inv ~> continuous_at_within_inverse
1575 continuous_at_inv ~> continuous_at_inverse
1576 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
1577 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
1578 continuous_at_component ~> continuous_component [OF continuous_at_id]
1579 continuous_on_neg ~> continuous_on_minus
1580 continuous_on_sub ~> continuous_on_diff
1581 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
1582 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
1583 continuous_on_mul ~> continuous_on_scaleR
1584 continuous_on_mul_real ~> continuous_on_mult
1585 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
1586 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
1587 continuous_on_inverse ~> continuous_on_inv
1588 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
1589 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
1590 subset_interior ~> interior_mono
1591 subset_closure ~> closure_mono
1592 closure_univ ~> closure_UNIV
1593 real_arch_lt ~> reals_Archimedean2
1594 real_arch ~> reals_Archimedean3
1595 real_abs_norm ~> abs_norm_cancel
1596 real_abs_sub_norm ~> norm_triangle_ineq3
1597 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
1599 * Session HOL-Probability:
1600 - Caratheodory's extension lemma is now proved for ring_of_sets.
1601 - Infinite products of probability measures are now available.
1602 - Sigma closure is independent, if the generator is independent
1603 - Use extended reals instead of positive extended
1604 reals. INCOMPATIBILITY.
1606 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
1608 expand_fun_below ~> fun_below_iff
1609 below_fun_ext ~> fun_belowI
1610 expand_cfun_eq ~> cfun_eq_iff
1611 ext_cfun ~> cfun_eqI
1612 expand_cfun_below ~> cfun_below_iff
1613 below_cfun_ext ~> cfun_belowI
1614 monofun_fun_fun ~> fun_belowD
1615 monofun_fun_arg ~> monofunE
1616 monofun_lub_fun ~> adm_monofun [THEN admD]
1617 cont_lub_fun ~> adm_cont [THEN admD]
1618 cont2cont_Rep_CFun ~> cont2cont_APP
1619 cont_Rep_CFun_app ~> cont_APP_app
1620 cont_Rep_CFun_app_app ~> cont_APP_app_app
1621 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
1622 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
1623 contlub_cfun ~> lub_APP [symmetric]
1624 contlub_LAM ~> lub_LAM [symmetric]
1627 lift_distinct1 ~> lift.distinct(1)
1628 lift_distinct2 ~> lift.distinct(2)
1629 Def_not_UU ~> lift.distinct(2)
1630 Def_inject ~> lift.inject
1631 below_UU_iff ~> below_bottom_iff
1632 eq_UU_iff ~> eq_bottom_iff
1635 *** Document preparation ***
1637 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
1638 isar-ref manual, both for description and actual application of the
1641 * Antiquotation @{value} evaluates the given term and presents its
1644 * Antiquotations: term style "isub" provides ad-hoc conversion of
1645 variables x1, y23 into subscripted form x\<^isub>1,
1646 y\<^isub>2\<^isub>3.
1648 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
1649 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
1651 * Localized \isabellestyle switch can be used within blocks or groups
1654 \isabellestyle{it} %preferred default
1655 {\isabellestylett @{text "typewriter stuff"}}
1657 * Discontinued special treatment of hard tabulators. Implicit
1658 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
1664 * The inner syntax of sort/type/term/prop supports inlined YXML
1665 representations within quoted string tokens. By encoding logical
1666 entities via Term_XML (in ML or Scala) concrete syntax can be
1667 bypassed, which is particularly useful for producing bits of text
1668 under external program control.
1670 * Antiquotations for ML and document preparation are managed as theory
1671 data, which requires explicit setup.
1673 * Isabelle_Process.is_active allows tools to check if the official
1674 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
1675 (better known as Proof General).
1677 * Structure Proof_Context follows standard naming scheme. Old
1678 ProofContext is still available for some time as legacy alias.
1680 * Structure Timing provides various operations for timing; supersedes
1681 former start_timing/end_timing etc.
1683 * Path.print is the official way to show file-system paths to users
1684 (including quotes etc.).
1686 * Inner syntax: identifiers in parse trees of generic categories
1687 "logic", "aprop", "idt" etc. carry position information (disguised as
1688 type constraints). Occasional INCOMPATIBILITY with non-compliant
1689 translations that choke on unexpected type constraints. Positions can
1690 be stripped in ML translations via Syntax.strip_positions /
1691 Syntax.strip_positions_ast, or via the syntax constant
1692 "_strip_positions" within parse trees. As last resort, positions can
1693 be disabled via the configuration option Syntax.positions, which is
1694 called "syntax_positions" in Isar attribute syntax.
1696 * Discontinued special status of various ML structures that contribute
1697 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
1698 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
1699 refer directly to Ast.Constant, Lexicon.is_identifier,
1700 Syntax_Trans.mk_binder_tr etc.
1702 * Typed print translation: discontinued show_sorts argument, which is
1703 already available via context of "advanced" translation.
1705 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
1706 goal states; body tactic needs to address all subgoals uniformly.
1708 * Slightly more special eq_list/eq_set, with shortcut involving
1709 pointer equality (assumes that eq relation is reflexive).
1711 * Classical tactics use proper Proof.context instead of historic types
1712 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
1713 operate directly on Proof.context. Raw type claset retains its use as
1714 snapshot of the classical context, which can be recovered via
1715 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
1716 INCOMPATIBILITY, classical tactics and derived proof methods require
1717 proper Proof.context.
1722 * Discontinued support for Poly/ML 5.2, which was the last version
1723 without proper multithreading and TimeLimit implementation.
1725 * Discontinued old lib/scripts/polyml-platform, which has been
1726 obsolete since Isabelle2009-2.
1728 * Various optional external tools are referenced more robustly and
1729 uniformly by explicit Isabelle settings as follows:
1731 ISABELLE_CSDP (formerly CSDP_EXE)
1732 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
1733 ISABELLE_OCAML (formerly EXEC_OCAML)
1734 ISABELLE_SWIPL (formerly EXEC_SWIPL)
1735 ISABELLE_YAP (formerly EXEC_YAP)
1737 Note that automated detection from the file-system or search path has
1738 been discontinued. INCOMPATIBILITY.
1740 * Scala layer provides JVM method invocation service for static
1741 methods of type (String)String, see Invoke_Scala.method in ML. For
1744 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
1746 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
1747 this allows to pass structured values between ML and Scala.
1749 * The IsabelleText fonts includes some further glyphs to support the
1750 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
1751 installed a local copy (which is normally *not* required) need to
1752 delete or update it from ~~/lib/fonts/.
1756 New in Isabelle2011 (January 2011)
1757 ----------------------------------
1761 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
1762 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
1763 useful tooltips and hyperlinks produced from its static analysis. The
1764 bundled component provides an executable Isabelle tool that can be run
1767 Isabelle2011/bin/isabelle jedit
1769 * Significantly improved Isabelle/Isar implementation manual.
1771 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
1772 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
1773 while the default heap location within that directory lacks that extra
1774 suffix. This isolates multiple Isabelle installations from each
1775 other, avoiding problems with old settings in new versions.
1776 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
1778 * Source files are always encoded as UTF-8, instead of old-fashioned
1779 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
1780 the following package declarations:
1782 \usepackage[utf8]{inputenc}
1783 \usepackage{textcomp}
1785 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
1786 a Unicode character is treated as a single symbol, not a sequence of
1787 non-ASCII bytes as before. Since Isabelle/ML string literals may
1788 contain symbols without further backslash escapes, Unicode can now be
1789 used here as well. Recall that Symbol.explode in ML provides a
1790 consistent view on symbols, while raw explode (or String.explode)
1791 merely give a byte-oriented representation.
1793 * Theory loader: source files are primarily located via the master
1794 directory of each theory node (where the .thy file itself resides).
1795 The global load path is still partially available as legacy feature.
1796 Minor INCOMPATIBILITY due to subtle change in file lookup: use
1797 explicit paths, relatively to the theory.
1799 * Special treatment of ML file names has been discontinued.
1800 Historically, optional extensions .ML or .sml were added on demand --
1801 at the cost of clarity of file dependencies. Recall that Isabelle/ML
1802 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
1804 * Various options that affect pretty printing etc. are now properly
1805 handled within the context via configuration options, instead of
1806 unsynchronized references or print modes. There are both ML Config.T
1807 entities and Isar declaration attributes to access these.
1809 ML (Config.T) Isar (attribute)
1811 eta_contract eta_contract
1812 show_brackets show_brackets
1813 show_sorts show_sorts
1814 show_types show_types
1815 show_question_marks show_question_marks
1816 show_consts show_consts
1817 show_abbrevs show_abbrevs
1819 Syntax.ast_trace syntax_ast_trace
1820 Syntax.ast_stat syntax_ast_stat
1821 Syntax.ambiguity_level syntax_ambiguity_level
1823 Goal_Display.goals_limit goals_limit
1824 Goal_Display.show_main_goal show_main_goal
1826 Method.rule_trace rule_trace
1828 Thy_Output.display thy_output_display
1829 Thy_Output.quotes thy_output_quotes
1830 Thy_Output.indent thy_output_indent
1831 Thy_Output.source thy_output_source
1832 Thy_Output.break thy_output_break
1834 Note that corresponding "..._default" references in ML may only be
1835 changed globally at the ROOT session setup, but *not* within a theory.
1836 The option "show_abbrevs" supersedes the former print mode
1837 "no_abbrevs" with inverted meaning.
1839 * More systematic naming of some configuration options.
1842 trace_simp ~> simp_trace
1843 debug_simp ~> simp_debug
1845 * Support for real valued configuration options, using simplistic
1846 floating-point notation that coincides with the inner syntax for
1849 * Support for real valued preferences (with approximative PGIP type):
1850 front-ends need to accept "pgint" values in float notation.
1853 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
1856 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
1861 * Command 'type_synonym' (with single argument) replaces somewhat
1862 outdated 'types', which is still available as legacy feature for some
1865 * Command 'nonterminal' (with 'and' separated list of arguments)
1866 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
1868 * Command 'notepad' replaces former 'example_proof' for
1869 experimentation in Isar without any result. INCOMPATIBILITY.
1871 * Locale interpretation commands 'interpret' and 'sublocale' accept
1872 lists of equations to map definitions in a locale to appropriate
1873 entities in the context of the interpretation. The 'interpretation'
1874 command already provided this functionality.
1876 * Diagnostic command 'print_dependencies' prints the locale instances
1877 that would be activated if the specified expression was interpreted in
1878 the current context. Variant "print_dependencies!" assumes a context
1879 without interpretations.
1881 * Diagnostic command 'print_interps' prints interpretations in proofs
1882 in addition to interpretations in theories.
1884 * Discontinued obsolete 'global' and 'local' commands to manipulate
1885 the theory name space. Rare INCOMPATIBILITY. The ML functions
1886 Sign.root_path and Sign.local_path may be applied directly where this
1887 feature is still required for historical reasons.
1889 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
1890 'definition' instead.
1892 * The "prems" fact, which refers to the accidental collection of
1893 foundational premises in the context, is now explicitly marked as
1894 legacy feature and will be discontinued soon. Consider using "assms"
1895 of the head statement or reference facts by explicit names.
1897 * Document antiquotations @{class} and @{type} print classes and type
1900 * Document antiquotation @{file} checks file/directory entries within
1901 the local file system.
1906 * Coercive subtyping: functions can be declared as coercions and type
1907 inference will add them as necessary upon input of a term. Theory
1908 Complex_Main declares real :: nat => real and real :: int => real as
1909 coercions. A coercion function f is declared like this:
1911 declare [[coercion f]]
1913 To lift coercions through type constructors (e.g. from nat => real to
1914 nat list => real list), map functions can be declared, e.g.
1916 declare [[coercion_map map]]
1918 Currently coercion inference is activated only in theories including
1919 real numbers, i.e. descendants of Complex_Main. This is controlled by
1920 the configuration option "coercion_enabled", e.g. it can be enabled in
1921 other theories like this:
1923 declare [[coercion_enabled]]
1925 * Command 'partial_function' provides basic support for recursive
1926 function definitions over complete partial orders. Concrete instances
1927 are provided for i) the option type, ii) tail recursion on arbitrary
1928 types, and iii) the heap monad of Imperative_HOL. See
1929 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
1932 * Function package: f.psimps rules are no longer implicitly declared
1933 as [simp]. INCOMPATIBILITY.
1935 * Datatype package: theorems generated for executable equality (class
1936 "eq") carry proper names and are treated as default code equations.
1938 * Inductive package: now offers command 'inductive_simps' to
1939 automatically derive instantiated and simplified equations for
1940 inductive predicates, similar to 'inductive_cases'.
1942 * Command 'enriched_type' allows to register properties of the
1943 functorial structure of types.
1945 * Improved infrastructure for term evaluation using code generator
1946 techniques, in particular static evaluation conversions.
1948 * Code generator: Scala (2.8 or higher) has been added to the target
1951 * Code generator: globbing constant expressions "*" and "Theory.*"
1952 have been replaced by the more idiomatic "_" and "Theory._".
1955 * Code generator: export_code without explicit file declaration prints
1956 to standard output. INCOMPATIBILITY.
1958 * Code generator: do not print function definitions for case
1959 combinators any longer.
1961 * Code generator: simplification with rules determined with
1962 src/Tools/Code/code_simp.ML and method "code_simp".
1964 * Code generator for records: more idiomatic representation of record
1965 types. Warning: records are not covered by ancient SML code
1966 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
1967 rep_datatype declaration helps to succeed then:
1971 rep_datatype foo_ext ...
1973 * Records: logical foundation type for records does not carry a
1974 '_type' suffix any longer (obsolete due to authentic syntax).
1977 * Quickcheck now by default uses exhaustive testing instead of random
1978 testing. Random testing can be invoked by "quickcheck [random]",
1979 exhaustive testing by "quickcheck [exhaustive]".
1981 * Quickcheck instantiates polymorphic types with small finite
1982 datatypes by default. This enables a simple execution mechanism to
1983 handle quantifiers and function equality over the finite datatypes.
1985 * Quickcheck random generator has been renamed from "code" to
1986 "random". INCOMPATIBILITY.
1988 * Quickcheck now has a configurable time limit which is set to 30
1989 seconds by default. This can be changed by adding [timeout = n] to the
1990 quickcheck command. The time limit for Auto Quickcheck is still set
1993 * Quickcheck in locales considers interpretations of that locale for
1994 counter example search.
1997 - Added "smt" and "remote_smt" provers based on the "smt" proof
1998 method. See the Sledgehammer manual for details ("isabelle doc
2001 sledgehammer atp_info ~> sledgehammer running_provers
2002 sledgehammer atp_kill ~> sledgehammer kill_provers
2003 sledgehammer available_atps ~> sledgehammer available_provers
2006 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
2007 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
2008 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
2009 (and "ms" and "min" are no longer supported)
2014 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
2015 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
2017 - Added support for partial quotient types.
2018 - Added local versions of the "Nitpick.register_xxx" functions.
2019 - Added "whack" option.
2020 - Allow registration of quotient types as codatatypes.
2021 - Improved "merge_type_vars" option to merge more types.
2022 - Removed unsound "fast_descrs" option.
2023 - Added custom symmetry breaking for datatypes, making it possible to reach
2024 higher cardinalities.
2025 - Prevent the expansion of too large definitions.
2027 * Proof methods "metis" and "meson" now have configuration options
2028 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
2029 to diagnose these tools. E.g.
2031 using [[metis_trace = true]]
2033 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
2034 manually as command 'solve_direct'.
2036 * The default SMT solver Z3 must be enabled explicitly (due to
2037 licensing issues) by setting the environment variable
2038 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
2039 commercial applications, the SMT solver CVC3 is provided as fall-back;
2040 changing the SMT solver is done via the configuration option
2043 * Remote SMT solvers need to be referred to by the "remote_" prefix,
2044 i.e. "remote_cvc3" and "remote_z3".
2046 * Added basic SMT support for datatypes, records, and typedefs using
2047 the oracle mode (no proofs). Direct support of pairs has been dropped
2048 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
2049 support for a similar behavior). Minor INCOMPATIBILITY.
2051 * Changed SMT configuration options:
2053 z3_proofs ~> smt_oracle (with inverted meaning)
2054 z3_trace_assms ~> smt_trace_used_facts
2067 * Boogie output files (.b2i files) need to be declared in the theory
2070 * Simplification procedure "list_to_set_comprehension" rewrites list
2071 comprehensions applied to List.set to set comprehensions. Occasional
2072 INCOMPATIBILITY, may be deactivated like this:
2074 declare [[simproc del: list_to_set_comprehension]]
2076 * Removed old version of primrec package. INCOMPATIBILITY.
2078 * Removed simplifier congruence rule of "prod_case", as has for long
2079 been the case with "split". INCOMPATIBILITY.
2081 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
2083 * Removed [split_format ... and ... and ...] version of
2084 [split_format]. Potential INCOMPATIBILITY.
2086 * Predicate "sorted" now defined inductively, with nice induction
2087 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
2089 * Constant "contents" renamed to "the_elem", to free the generic name
2090 contents for other uses. INCOMPATIBILITY.
2092 * Renamed class eq and constant eq (for code generation) to class
2093 equal and constant equal, plus renaming of related facts and various
2094 tuning. INCOMPATIBILITY.
2096 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
2098 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
2101 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
2102 avoid confusion with finite sets. INCOMPATIBILITY.
2104 * Abandoned locales equiv, congruent and congruent2 for equivalence
2105 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
2108 * Some previously unqualified names have been qualified:
2115 Trueprop ~> HOL.Trueprop
2120 op --> ~> HOL.implies
2132 Pair ~> Product_Type.Pair
2133 fst ~> Product_Type.fst
2134 snd ~> Product_Type.snd
2135 curry ~> Product_Type.curry
2137 Collect ~> Set.Collect
2141 * More canonical naming convention for some fundamental definitions:
2143 bot_bool_eq ~> bot_bool_def
2144 top_bool_eq ~> top_bool_def
2145 inf_bool_eq ~> inf_bool_def
2146 sup_bool_eq ~> sup_bool_def
2147 bot_fun_eq ~> bot_fun_def
2148 top_fun_eq ~> top_fun_def
2149 inf_fun_eq ~> inf_fun_def
2150 sup_fun_eq ~> sup_fun_def
2154 * More stylized fact names:
2156 expand_fun_eq ~> fun_eq_iff
2157 expand_set_eq ~> set_eq_iff
2159 nat_number ~> eval_nat_numeral
2163 * Refactoring of code-generation specific operations in theory List:
2169 mem_iff ~> member_def
2170 null_empty ~> null_def
2172 INCOMPATIBILITY. Note that these were not supposed to be used
2173 regularly unless for striking reasons; their main purpose was code
2176 Various operations from the Haskell prelude are used for generating
2179 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
2180 "surj f" is now an abbreviation of "range f = UNIV". The theorems
2181 bij_def and surj_def are unchanged. INCOMPATIBILITY.
2183 * Abolished some non-alphabetic type names: "prod" and "sum" replace
2184 "*" and "+" respectively. INCOMPATIBILITY.
2186 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
2187 "Sum_Type.Plus" instead.
2189 * Constant "split" has been merged with constant "prod_case"; names of
2190 ML functions, facts etc. involving split have been retained so far,
2191 though. INCOMPATIBILITY.
2193 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
2194 instead. INCOMPATIBILITY.
2196 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
2199 * Former theory Library/Enum is now part of the HOL-Main image.
2200 INCOMPATIBILITY: all constants of the Enum theory now have to be
2201 referred to by its qualified name.
2204 nlists ~> Enum.nlists
2205 product ~> Enum.product
2207 * Theory Library/Monad_Syntax provides do-syntax for monad types.
2208 Syntax in Library/State_Monad has been changed to avoid ambiguities.
2211 * Theory Library/SetsAndFunctions has been split into
2212 Library/Function_Algebras and Library/Set_Algebras; canonical names
2213 for instance definitions for functions; various improvements.
2216 * Theory Library/Multiset provides stable quicksort implementation of
2219 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
2222 * Session Multivariate_Analysis: introduced a type class for euclidean
2223 space. Most theorems are now stated in terms of euclidean spaces
2224 instead of finite cartesian products.
2227 real ^ 'n ~> 'a::real_vector
2228 ~> 'a::euclidean_space
2229 ~> 'a::ordered_euclidean_space
2230 (depends on your needs)
2234 \<chi> x. _ ~> \<chi>\<chi> x. _
2237 Also note that the indices are now natural numbers and not from some
2238 finite type. Finite cartesian products of euclidean spaces, products
2239 of euclidean spaces the real and complex numbers are instantiated to
2240 be euclidean_spaces. INCOMPATIBILITY.
2242 * Session Probability: introduced pextreal as positive extended real
2243 numbers. Use pextreal as value for measures. Introduce the
2244 Radon-Nikodym derivative, product spaces and Fubini's theorem for
2245 arbitrary sigma finite measures. Introduces Lebesgue measure based on
2246 the integral in Multivariate Analysis. INCOMPATIBILITY.
2248 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
2251 * Session SPARK (with image HOL-SPARK) provides commands to load and
2252 prove verification conditions generated by the SPARK Ada program
2253 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
2258 * Theorems for additive ring operations (locale abelian_monoid and
2259 descendants) are generated by interpretation from their multiplicative
2260 counterparts. Names (in particular theorem names) have the mandatory
2261 qualifier 'add'. Previous theorem names are redeclared for
2264 * Structure "int_ring" is now an abbreviation (previously a
2265 definition). This fits more natural with advanced interpretations.
2270 * The domain package now runs in definitional mode by default: The
2271 former command 'new_domain' is now called 'domain'. To use the domain
2272 package in its original axiomatic mode, use 'domain (unsafe)'.
2275 * The new class "domain" is now the default sort. Class "predomain"
2276 is an unpointed version of "domain". Theories can be updated by
2277 replacing sort annotations as shown below. INCOMPATIBILITY.
2279 'a::type ~> 'a::countable
2280 'a::cpo ~> 'a::predomain
2281 'a::pcpo ~> 'a::domain
2283 * The old type class "rep" has been superseded by class "domain".
2284 Accordingly, users of the definitional package must remove any
2285 "default_sort rep" declarations. INCOMPATIBILITY.
2287 * The domain package (definitional mode) now supports unpointed
2288 predomain argument types, as long as they are marked 'lazy'. (Strict
2289 arguments must be in class "domain".) For example, the following
2290 domain definition now works:
2292 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
2294 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
2295 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
2296 'a option, and 'a list. Additionally, it configures fixrec and the
2297 domain package to work with these types. For example:
2299 fixrec isInl :: "('a + 'b) u -> tr"
2300 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
2302 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
2304 * The "(permissive)" option of fixrec has been replaced with a
2305 per-equation "(unchecked)" option. See
2306 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
2308 * The "bifinite" class no longer fixes a constant "approx"; the class
2309 now just asserts that such a function exists. INCOMPATIBILITY.
2311 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
2312 defines an embedding of type 'a defl into udom by default; instances
2313 of "bifinite" and "domain" classes are available in
2314 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
2316 * The syntax "REP('a)" has been replaced with "DEFL('a)".
2318 * The predicate "directed" has been removed. INCOMPATIBILITY.
2320 * The type class "finite_po" has been removed. INCOMPATIBILITY.
2322 * The function "cprod_map" has been renamed to "prod_map".
2325 * The monadic bind operator on each powerdomain has new binder syntax
2326 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
2327 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
2329 * The infix syntax for binary union on each powerdomain has changed
2330 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
2331 syntax. INCOMPATIBILITY.
2333 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
2334 still supported as an input translation.
2336 * Renamed some theorems (the original names are also still available).
2338 expand_fun_below ~> fun_below_iff
2339 below_fun_ext ~> fun_belowI
2340 expand_cfun_eq ~> cfun_eq_iff
2341 ext_cfun ~> cfun_eqI
2342 expand_cfun_below ~> cfun_below_iff
2343 below_cfun_ext ~> cfun_belowI
2344 cont2cont_Rep_CFun ~> cont2cont_APP
2346 * The Abs and Rep functions for various types have changed names.
2347 Related theorem names have also changed to match. INCOMPATIBILITY.
2349 Rep_CFun ~> Rep_cfun
2350 Abs_CFun ~> Abs_cfun
2351 Rep_Sprod ~> Rep_sprod
2352 Abs_Sprod ~> Abs_sprod
2353 Rep_Ssum ~> Rep_ssum
2354 Abs_Ssum ~> Abs_ssum
2356 * Lemmas with names of the form *_defined_iff or *_strict_iff have
2357 been renamed to *_bottom_iff. INCOMPATIBILITY.
2359 * Various changes to bisimulation/coinduction with domain package:
2361 - Definitions of "bisim" constants no longer mention definedness.
2362 - With mutual recursion, "bisim" predicate is now curried.
2363 - With mutual recursion, each type gets a separate coind theorem.
2364 - Variable names in bisim_def and coinduct rules have changed.
2368 * Case combinators generated by the domain package for type "foo" are
2369 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
2371 * Several theorems have been renamed to more accurately reflect the
2372 names of constants and types involved. INCOMPATIBILITY.
2374 thelub_const ~> lub_const
2375 lub_const ~> is_lub_const
2377 is_lub_lub ~> is_lubD2
2379 unique_lub ~> is_lub_unique
2380 is_ub_lub ~> is_lub_rangeD1
2381 lub_bin_chain ~> is_lub_bin_chain
2382 lub_fun ~> is_lub_fun
2383 thelub_fun ~> lub_fun
2384 thelub_cfun ~> lub_cfun
2385 thelub_Pair ~> lub_Pair
2386 lub_cprod ~> is_lub_prod
2387 thelub_cprod ~> lub_prod
2388 minimal_cprod ~> minimal_prod
2389 inst_cprod_pcpo ~> inst_prod_pcpo
2391 compact_UU ~> compact_bottom
2392 deflation_UU ~> deflation_bottom
2393 finite_deflation_UU ~> finite_deflation_bottom
2395 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
2397 sq_ord_less_eq_trans ~> below_eq_trans
2398 sq_ord_eq_less_trans ~> eq_below_trans
2399 refl_less ~> below_refl
2400 trans_less ~> below_trans
2401 antisym_less ~> below_antisym
2402 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
2403 box_less ~> box_below
2404 rev_trans_less ~> rev_below_trans
2405 not_less2not_eq ~> not_below2not_eq
2406 less_UU_iff ~> below_UU_iff
2407 flat_less_iff ~> flat_below_iff
2408 adm_less ~> adm_below
2409 adm_not_less ~> adm_not_below
2410 adm_compact_not_less ~> adm_compact_not_below
2411 less_fun_def ~> below_fun_def
2412 expand_fun_less ~> fun_below_iff
2413 less_fun_ext ~> fun_belowI
2414 less_discr_def ~> below_discr_def
2415 discr_less_eq ~> discr_below_eq
2416 less_unit_def ~> below_unit_def
2417 less_cprod_def ~> below_prod_def
2418 prod_lessI ~> prod_belowI
2419 Pair_less_iff ~> Pair_below_iff
2420 fst_less_iff ~> fst_below_iff
2421 snd_less_iff ~> snd_below_iff
2422 expand_cfun_less ~> cfun_below_iff
2423 less_cfun_ext ~> cfun_belowI
2424 injection_less ~> injection_below
2425 less_up_def ~> below_up_def
2426 not_Iup_less ~> not_Iup_below
2427 Iup_less ~> Iup_below
2429 Def_inject_less_eq ~> Def_below_Def
2430 Def_less_is_eq ~> Def_below_iff
2431 spair_less_iff ~> spair_below_iff
2432 less_sprod ~> below_sprod
2433 spair_less ~> spair_below
2434 sfst_less_iff ~> sfst_below_iff
2435 ssnd_less_iff ~> ssnd_below_iff
2436 fix_least_less ~> fix_least_below
2437 dist_less_one ~> dist_below_one
2438 less_ONE ~> below_ONE
2439 ONE_less_iff ~> ONE_below_iff
2440 less_sinlD ~> below_sinlD
2441 less_sinrD ~> below_sinrD
2446 * All constant names are now qualified internally and use proper
2447 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
2452 * Antiquotation @{assert} inlines a function bool -> unit that raises
2453 Fail if the argument is false. Due to inlining the source position of
2454 failed assertions is included in the error output.
2456 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
2457 text is in practice always evaluated with a stable theory checkpoint.
2458 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
2460 * Antiquotation @{theory A} refers to theory A from the ancestry of
2461 the current context, not any accidental theory loader state as before.
2462 Potential INCOMPATIBILITY, subtle change in semantics.
2464 * Syntax.pretty_priority (default 0) configures the required priority
2465 of pretty-printed output and thus affects insertion of parentheses.
2467 * Syntax.default_root (default "any") configures the inner syntax
2468 category (nonterminal symbol) for parsing of terms.
2470 * Former exception Library.UnequalLengths now coincides with
2471 ListPair.UnequalLengths.
2473 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
2474 main functionality is provided by structure Simplifier.
2476 * Renamed raw "explode" function to "raw_explode" to emphasize its
2477 meaning. Note that internally to Isabelle, Symbol.explode is used in
2478 almost all situations.
2480 * Discontinued obsolete function sys_error and exception SYS_ERROR.
2481 See implementation manual for further details on exceptions in
2484 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
2487 * Renamed structure PureThy to Pure_Thy and moved most of its
2488 operations to structure Global_Theory, to emphasize that this is
2489 rarely-used global-only stuff.
2491 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
2492 instead (or tracing for high-volume output).
2494 * Configuration option show_question_marks only affects regular pretty
2495 printing of types and terms, not raw Term.string_of_vname.
2497 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
2498 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
2499 @{thms} for most purposes.
2501 * ML structure Unsynchronized is never opened, not even in Isar
2502 interaction mode as before. Old Unsynchronized.set etc. have been
2503 discontinued -- use plain := instead. This should be *rare* anyway,
2504 since modern tools always work via official context data, notably
2505 configuration options.
2507 * Parallel and asynchronous execution requires special care concerning
2508 interrupts. Structure Exn provides some convenience functions that
2509 avoid working directly with raw Interrupt. User code must not absorb
2510 interrupts -- intermediate handling (for cleanup etc.) needs to be
2511 followed by re-raising of the original exception. Another common
2512 source of mistakes are "handle _" patterns, which make the meaning of
2513 the program subject to physical effects of the environment.
2517 New in Isabelle2009-2 (June 2010)
2518 ---------------------------------
2522 * Authentic syntax for *all* logical entities (type classes, type
2523 constructors, term constants): provides simple and robust
2524 correspondence between formal entities and concrete syntax. Within
2525 the parse tree / AST representations, "constants" are decorated by
2526 their category (class, type, const) and spelled out explicitly with
2527 their full internal name.
2529 Substantial INCOMPATIBILITY concerning low-level syntax declarations
2530 and translations (translation rules and translation functions in ML).
2531 Some hints on upgrading:
2533 - Many existing uses of 'syntax' and 'translations' can be replaced
2534 by more modern 'type_notation', 'notation' and 'abbreviation',
2535 which are independent of this issue.
2537 - 'translations' require markup within the AST; the term syntax
2538 provides the following special forms:
2540 CONST c -- produces syntax version of constant c from context
2541 XCONST c -- literally c, checked as constant from context
2542 c -- literally c, if declared by 'syntax'
2544 Plain identifiers are treated as AST variables -- occasionally the
2545 system indicates accidental variables via the error "rhs contains
2548 Type classes and type constructors are marked according to their
2549 concrete syntax. Some old translations rules need to be written
2550 for the "type" category, using type constructor application
2551 instead of pseudo-term application of the default category
2554 - 'parse_translation' etc. in ML may use the following
2557 @{class_syntax c} -- type class c within parse tree / AST
2558 @{term_syntax c} -- type constructor c within parse tree / AST
2559 @{const_syntax c} -- ML version of "CONST c" above
2560 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
2562 - Literal types within 'typed_print_translations', i.e. those *not*
2563 represented as pseudo-terms are represented verbatim. Use @{class
2564 c} or @{type_name c} here instead of the above syntax
2567 Note that old non-authentic syntax was based on unqualified base
2568 names, so all of the above "constant" names would coincide. Recall
2569 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
2570 diagnose syntax problems.
2572 * Type constructors admit general mixfix syntax, not just infix.
2574 * Concrete syntax may be attached to local entities without a proof
2575 body, too. This works via regular mixfix annotations for 'fix',
2576 'def', 'obtain' etc. or via the explicit 'write' command, which is
2577 similar to the 'notation' command in theory specifications.
2579 * Discontinued unnamed infix syntax (legacy feature for many years) --
2580 need to specify constant name and syntax separately. Internal ML
2581 datatype constructors have been renamed from InfixName to Infix etc.
2582 Minor INCOMPATIBILITY.
2584 * Schematic theorem statements need to be explicitly markup as such,
2585 via commands 'schematic_lemma', 'schematic_theorem',
2586 'schematic_corollary'. Thus the relevance of the proof is made
2587 syntactically clear, which impacts performance in a parallel or
2588 asynchronous interactive environment. Minor INCOMPATIBILITY.
2590 * Use of cumulative prems via "!" in some proof methods has been
2591 discontinued (old legacy feature).
2593 * References 'trace_simp' and 'debug_simp' have been replaced by
2594 configuration options stored in the context. Enabling tracing (the
2595 case of debugging is similar) in proofs works via
2597 using [[trace_simp = true]]
2599 Tracing is then active for all invocations of the simplifier in
2600 subsequent goal refinement steps. Tracing may also still be enabled or
2601 disabled via the ProofGeneral settings menu.
2603 * Separate commands 'hide_class', 'hide_type', 'hide_const',
2604 'hide_fact' replace the former 'hide' KIND command. Minor
2607 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
2608 more efficient than combinations with -q1 or -q2.
2613 * Proofterms record type-class reasoning explicitly, using the
2614 "unconstrain" operation internally. This eliminates all sort
2615 constraints from a theorem and proof, introducing explicit
2616 OFCLASS-premises. On the proof term level, this operation is
2617 automatically applied at theorem boundaries, such that closed proofs
2618 are always free of sort constraints. INCOMPATIBILITY for tools that
2619 inspect proof terms.
2621 * Local theory specifications may depend on extra type variables that
2622 are not present in the result type -- arguments TYPE('a) :: 'a itself
2623 are added internally. For example:
2625 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
2627 * Predicates of locales introduced by classes carry a mandatory
2628 "class" prefix. INCOMPATIBILITY.
2630 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
2632 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
2635 * Command 'code_reflect' allows to incorporate generated ML code into
2636 runtime environment; replaces immature code_datatype antiquotation.
2639 * Code generator: simple concept for abstract datatypes obeying
2642 * Code generator: details of internal data cache have no impact on the
2643 user space functionality any longer.
2645 * Methods "unfold_locales" and "intro_locales" ignore non-locale
2646 subgoals. This is more appropriate for interpretations with 'where'.
2649 * Command 'example_proof' opens an empty proof body. This allows to
2650 experiment with Isar, without producing any persistent result.
2652 * Commands 'type_notation' and 'no_type_notation' declare type syntax
2653 within a local theory context, with explicit checking of the
2654 constructors involved (in contrast to the raw 'syntax' versions).
2656 * Commands 'types' and 'typedecl' now work within a local theory
2657 context -- without introducing dependencies on parameters or
2658 assumptions, which is not possible in Isabelle/Pure.
2660 * Command 'defaultsort' has been renamed to 'default_sort', it works
2661 within a local theory context. Minor INCOMPATIBILITY.
2666 * Command 'typedef' now works within a local theory context -- without
2667 introducing dependencies on parameters or assumptions, which is not
2668 possible in Isabelle/Pure/HOL. Note that the logical environment may
2669 contain multiple interpretations of local typedefs (with different
2670 non-emptiness proofs), even in a global theory context.
2672 * New package for quotient types. Commands 'quotient_type' and
2673 'quotient_definition' may be used for defining types and constants by
2674 quotient constructions. An example is the type of integers created by
2675 quotienting pairs of natural numbers:
2678 intrel :: "(nat * nat) => (nat * nat) => bool"
2680 "intrel (x, y) (u, v) = (x + v = u + y)"
2682 quotient_type int = "nat * nat" / intrel
2683 by (auto simp add: equivp_def expand_fun_eq)
2686 "0::int" is "(0::nat, 0::nat)"
2688 The method "lifting" can be used to lift of theorems from the
2689 underlying "raw" type to the quotient type. The example
2690 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
2691 construction and provides a reasoning infrastructure for finite sets.
2693 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
2694 clash with new theory Quotient in Main HOL.
2696 * Moved the SMT binding into the main HOL session, eliminating
2697 separate HOL-SMT session.
2699 * List membership infix mem operation is only an input abbreviation.
2702 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
2703 for future developements; former Library/Word.thy is still present in
2704 the AFP entry RSAPPS.
2706 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
2707 longer shadowed. INCOMPATIBILITY.
2709 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
2712 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
2715 * Dropped normalizing_semiring etc; use the facts in semiring classes
2716 instead. INCOMPATIBILITY.
2718 * Dropped several real-specific versions of lemmas about floor and
2719 ceiling; use the generic lemmas from theory "Archimedean_Field"
2720 instead. INCOMPATIBILITY.
2722 floor_number_of_eq ~> floor_number_of
2723 le_floor_eq_number_of ~> number_of_le_floor
2724 le_floor_eq_zero ~> zero_le_floor
2725 le_floor_eq_one ~> one_le_floor
2726 floor_less_eq_number_of ~> floor_less_number_of
2727 floor_less_eq_zero ~> floor_less_zero
2728 floor_less_eq_one ~> floor_less_one
2729 less_floor_eq_number_of ~> number_of_less_floor
2730 less_floor_eq_zero ~> zero_less_floor
2731 less_floor_eq_one ~> one_less_floor
2732 floor_le_eq_number_of ~> floor_le_number_of
2733 floor_le_eq_zero ~> floor_le_zero
2734 floor_le_eq_one ~> floor_le_one
2735 floor_subtract_number_of ~> floor_diff_number_of
2736 floor_subtract_one ~> floor_diff_one
2737 ceiling_number_of_eq ~> ceiling_number_of
2738 ceiling_le_eq_number_of ~> ceiling_le_number_of
2739 ceiling_le_zero_eq ~> ceiling_le_zero
2740 ceiling_le_eq_one ~> ceiling_le_one
2741 less_ceiling_eq_number_of ~> number_of_less_ceiling
2742 less_ceiling_eq_zero ~> zero_less_ceiling
2743 less_ceiling_eq_one ~> one_less_ceiling
2744 ceiling_less_eq_number_of ~> ceiling_less_number_of
2745 ceiling_less_eq_zero ~> ceiling_less_zero
2746 ceiling_less_eq_one ~> ceiling_less_one
2747 le_ceiling_eq_number_of ~> number_of_le_ceiling
2748 le_ceiling_eq_zero ~> zero_le_ceiling
2749 le_ceiling_eq_one ~> one_le_ceiling
2750 ceiling_subtract_number_of ~> ceiling_diff_number_of
2751 ceiling_subtract_one ~> ceiling_diff_one
2753 * Theory "Finite_Set": various folding_XXX locales facilitate the
2754 application of the various fold combinators on finite sets.
2756 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
2757 provides abstract red-black tree type which is backed by "RBT_Impl" as
2758 implementation. INCOMPATIBILTY.
2760 * Theory Library/Coinductive_List has been removed -- superseded by
2761 AFP/thys/Coinductive.
2763 * Theory PReal, including the type "preal" and related operations, has
2764 been removed. INCOMPATIBILITY.
2766 * Real: new development using Cauchy Sequences.
2768 * Split off theory "Big_Operators" containing setsum, setprod,
2769 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
2771 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
2772 "Int" etc. INCOMPATIBILITY.
2774 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
2776 * New set of rules "ac_simps" provides combined assoc / commute
2777 rewrites for all interpretations of the appropriate generic locales.
2779 * Renamed theory "OrderedGroup" to "Groups" and split theory
2780 "Ring_and_Field" into theories "Rings" and "Fields"; for more
2781 appropriate and more consistent names suitable for name prefixes
2782 within the HOL theories. INCOMPATIBILITY.
2784 * Some generic constants have been put to appropriate theories:
2785 - less_eq, less: Orderings
2786 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
2787 - inverse, divide: Rings
2790 * More consistent naming of type classes involving orderings (and
2793 lower_semilattice ~> semilattice_inf
2794 upper_semilattice ~> semilattice_sup
2796 dense_linear_order ~> dense_linorder
2798 pordered_ab_group_add ~> ordered_ab_group_add
2799 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
2800 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
2801 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
2802 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
2803 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
2804 pordered_cancel_semiring ~> ordered_cancel_semiring
2805 pordered_comm_monoid_add ~> ordered_comm_monoid_add
2806 pordered_comm_ring ~> ordered_comm_ring
2807 pordered_comm_semiring ~> ordered_comm_semiring
2808 pordered_ring ~> ordered_ring
2809 pordered_ring_abs ~> ordered_ring_abs
2810 pordered_semiring ~> ordered_semiring
2812 ordered_ab_group_add ~> linordered_ab_group_add
2813 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
2814 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
2815 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
2816 ordered_field ~> linordered_field
2817 ordered_field_no_lb ~> linordered_field_no_lb
2818 ordered_field_no_ub ~> linordered_field_no_ub
2819 ordered_field_dense_linear_order ~> dense_linordered_field
2820 ordered_idom ~> linordered_idom
2821 ordered_ring ~> linordered_ring
2822 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
2823 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
2824 ordered_ring_strict ~> linordered_ring_strict
2825 ordered_semidom ~> linordered_semidom
2826 ordered_semiring ~> linordered_semiring
2827 ordered_semiring_1 ~> linordered_semiring_1
2828 ordered_semiring_1_strict ~> linordered_semiring_1_strict
2829 ordered_semiring_strict ~> linordered_semiring_strict
2831 The following slightly odd type classes have been moved to a
2832 separate theory Library/Lattice_Algebras:
2834 lordered_ab_group_add ~> lattice_ab_group_add
2835 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
2836 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
2837 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
2838 lordered_ring ~> lattice_ring
2842 * Refined field classes:
2843 - classes division_ring_inverse_zero, field_inverse_zero,
2844 linordered_field_inverse_zero include rule inverse 0 = 0 --
2845 subsumes former division_by_zero class;
2846 - numerous lemmas have been ported from field to division_ring.
2849 * Refined algebra theorem collections:
2850 - dropped theorem group group_simps, use algebra_simps instead;
2851 - dropped theorem group ring_simps, use field_simps instead;
2852 - proper theorem collection field_simps subsumes former theorem
2853 groups field_eq_simps and field_simps;
2854 - dropped lemma eq_minus_self_iff which is a duplicate for
2858 * Theory Finite_Set and List: some lemmas have been generalized from
2861 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
2862 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
2863 inter_Inter_fold_inter ~> inf_Inf_fold_inf
2864 union_Union_fold_union ~> sup_Sup_fold_sup
2865 Inter_fold_inter ~> Inf_fold_inf
2866 Union_fold_union ~> Sup_fold_sup
2867 inter_INTER_fold_inter ~> inf_INFI_fold_inf
2868 union_UNION_fold_union ~> sup_SUPR_fold_sup
2869 INTER_fold_inter ~> INFI_fold_inf
2870 UNION_fold_union ~> SUPR_fold_sup
2872 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
2873 replaced by the more convenient lemmas Inf_empty and Sup_empty.
2874 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
2875 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
2876 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
2877 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
2879 * Reorganized theory Multiset: swapped notation of pointwise and
2882 - pointwise ordering is instance of class order with standard syntax
2884 - multiset ordering has syntax <=# and <#; partial order properties
2885 are provided by means of interpretation with prefix
2887 - less duplication, less historical organization of sections,
2888 conversion from associations lists to multisets, rudimentary code
2890 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
2895 multiset_eq_conv_count_eq ~> multiset_ext_iff
2896 multi_count_ext ~> multiset_ext
2897 diff_union_inverse2 ~> diff_union_cancelR
2901 * Theory Permutation: replaced local "remove" by List.remove1.
2903 * Code generation: ML and OCaml code is decorated with signatures.
2905 * Theory List: added transpose.
2907 * Library/Nat_Bijection.thy is a collection of bijective functions
2908 between nat and other types, which supersedes the older libraries
2909 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
2912 Nat_Int_Bij.nat2_to_nat ~> prod_encode
2913 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
2914 Nat_Int_Bij.int_to_nat_bij ~> int_encode
2915 Nat_Int_Bij.nat_to_int_bij ~> int_decode
2916 Countable.pair_encode ~> prod_encode
2917 NatIso.prod2nat ~> prod_encode
2918 NatIso.nat2prod ~> prod_decode
2919 NatIso.sum2nat ~> sum_encode
2920 NatIso.nat2sum ~> sum_decode
2921 NatIso.list2nat ~> list_encode
2922 NatIso.nat2list ~> list_decode
2923 NatIso.set2nat ~> set_encode
2924 NatIso.nat2set ~> set_decode
2927 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
2928 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
2929 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
2930 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
2931 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
2932 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
2933 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
2934 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
2935 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
2936 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
2937 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
2938 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
2939 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
2942 - Renamed ATP commands:
2943 atp_info ~> sledgehammer running_atps
2944 atp_kill ~> sledgehammer kill_atps
2945 atp_messages ~> sledgehammer messages
2946 atp_minimize ~> sledgehammer minimize
2947 print_atps ~> sledgehammer available_atps
2949 - Added user's manual ("isabelle doc sledgehammer").
2950 - Added option syntax and "sledgehammer_params" to customize
2951 Sledgehammer's behavior. See the manual for details.
2952 - Modified the Isar proof reconstruction code so that it produces
2953 direct proofs rather than proofs by contradiction. (This feature
2954 is still experimental.)
2955 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
2957 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
2960 - Added and implemented "binary_ints" and "bits" options.
2961 - Added "std" option and implemented support for nonstandard models.
2962 - Added and implemented "finitize" option to improve the precision
2963 of infinite datatypes based on a monotonicity analysis.
2964 - Added support for quotient types.
2965 - Added support for "specification" and "ax_specification"
2967 - Added support for local definitions (for "function" and
2968 "termination" proofs).
2969 - Added support for term postprocessors.
2970 - Optimized "Multiset.multiset" and "FinFun.finfun".
2971 - Improved efficiency of "destroy_constrs" optimization.
2972 - Fixed soundness bugs related to "destroy_constrs" optimization and
2974 - Fixed soundness bug related to higher-order constructors.
2975 - Fixed soundness bug when "full_descrs" is enabled.
2976 - Improved precision of set constructs.
2977 - Added "atoms" option.
2978 - Added cache to speed up repeated Kodkod invocations on the same
2980 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
2981 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
2982 "SAT4J_Light". INCOMPATIBILITY.
2983 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
2984 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
2985 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
2987 * Method "induct" now takes instantiations of the form t, where t is not
2988 a variable, as a shorthand for "x == t", where x is a fresh variable.
2989 If this is not intended, t has to be enclosed in parentheses.
2990 By default, the equalities generated by definitional instantiations
2991 are pre-simplified, which may cause parameters of inductive cases
2992 to disappear, or may even delete some of the inductive cases.
2993 Use "induct (no_simp)" instead of "induct" to restore the old
2994 behaviour. The (no_simp) option is also understood by the "cases"
2995 and "nominal_induct" methods, which now perform pre-simplification, too.
3001 * Variable names in lemmas generated by the domain package have
3002 changed; the naming scheme is now consistent with the HOL datatype
3003 package. Some proof scripts may be affected, INCOMPATIBILITY.
3005 * The domain package no longer defines the function "foo_copy" for
3006 recursive domain "foo". The reach lemma is now stated directly in
3007 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
3008 be reformulated in terms of "foo_take", INCOMPATIBILITY.
3010 * Most definedness lemmas generated by the domain package (previously
3011 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
3012 like "foo$x = UU <-> x = UU", which works better as a simp rule.
3013 Proofs that used definedness lemmas as intro rules may break,
3014 potential INCOMPATIBILITY.
3016 * Induction and casedist rules generated by the domain package now
3017 declare proper case_names (one called "bottom", and one named for each
3018 constructor). INCOMPATIBILITY.
3020 * For mutually-recursive domains, separate "reach" and "take_lemma"
3021 rules are generated for each domain, INCOMPATIBILITY.
3023 foo_bar.reach ~> foo.reach bar.reach
3024 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
3026 * Some lemmas generated by the domain package have been renamed for
3027 consistency with the datatype package, INCOMPATIBILITY.
3029 foo.ind ~> foo.induct
3030 foo.finite_ind ~> foo.finite_induct
3031 foo.coind ~> foo.coinduct
3032 foo.casedist ~> foo.exhaust
3033 foo.exhaust ~> foo.nchotomy
3035 * For consistency with other definition packages, the fixrec package
3036 now generates qualified theorem names, INCOMPATIBILITY.
3038 foo_simps ~> foo.simps
3039 foo_unfold ~> foo.unfold
3040 foo_induct ~> foo.induct
3042 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
3043 method and internal fixrec proofs now use the default simpset instead.
3046 * The "contlub" predicate has been removed. Proof scripts should use
3047 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
3049 * The "admw" predicate has been removed, INCOMPATIBILITY.
3051 * The constants cpair, cfst, and csnd have been removed in favor of
3052 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
3057 * Antiquotations for basic formal entities:
3059 @{class NAME} -- type class
3060 @{class_syntax NAME} -- syntax representation of the above
3062 @{type_name NAME} -- logical type
3063 @{type_abbrev NAME} -- type abbreviation
3064 @{nonterminal NAME} -- type of concrete syntactic category
3065 @{type_syntax NAME} -- syntax representation of any of the above
3067 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
3068 @{const_abbrev NAME} -- abbreviated constant
3069 @{const_syntax NAME} -- syntax representation of any of the above
3071 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
3072 syntax constant (cf. 'syntax' command).
3074 * Antiquotation @{make_string} inlines a function to print arbitrary
3075 values similar to the ML toplevel. The result is compiler dependent
3076 and may fall back on "?" in certain situations.
3078 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
3079 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
3080 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
3081 not work with the asynchronous Isar document model.
3083 * Configuration options now admit dynamic default values, depending on
3084 the context or even global references.
3086 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
3087 uses an efficient external library if available (for Poly/ML).
3089 * Renamed some important ML structures, while keeping the old names
3090 for some time as aliases within the structure Legacy:
3092 OuterKeyword ~> Keyword
3095 OuterSyntax ~> Outer_Syntax
3096 PrintMode ~> Print_Mode
3097 SpecParse ~> Parse_Spec
3100 ThyOutput ~> Thy_Output
3101 TypeInfer ~> Type_Infer
3103 Note that "open Legacy" simplifies porting of sources, but forgetting
3104 to remove it again will complicate porting again in the future.
3106 * Most operations that refer to a global context are named
3107 accordingly, e.g. Simplifier.global_context or
3108 ProofContext.init_global. There are some situations where a global
3109 context actually works, but under normal circumstances one needs to
3110 pass the proper local context through the code!
3112 * Discontinued old TheoryDataFun with its copy/init operation -- data
3113 needs to be pure. Functor Theory_Data_PP retains the traditional
3114 Pretty.pp argument to merge, which is absent in the standard
3115 Theory_Data version.
3117 * Sorts.certify_sort and derived "cert" operations for types and terms
3118 no longer minimize sorts. Thus certification at the boundary of the
3119 inference kernel becomes invariant under addition of class relations,
3120 which is an important monotonicity principle. Sorts are now minimized
3121 in the syntax layer only, at the boundary between the end-user and the
3122 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
3123 explicitly in rare situations.
3125 * Renamed old-style Drule.standard to Drule.export_without_context, to
3126 emphasize that this is in no way a standard operation.
3129 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
3130 usual for resolution. Rare INCOMPATIBILITY.
3132 * Renamed varify/unvarify operations to varify_global/unvarify_global
3133 to emphasize that these only work in a global situation (which is
3136 * Curried take and drop in library.ML; negative length is interpreted
3137 as infinity (as in chop). Subtle INCOMPATIBILITY.
3139 * Proof terms: type substitutions on proof constants now use canonical
3140 order of type variables. INCOMPATIBILITY for tools working with proof
3143 * Raw axioms/defs may no longer carry sort constraints, and raw defs
3144 may no longer carry premises. User-level specifications are
3145 transformed accordingly by Thm.add_axiom/add_def.
3150 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
3151 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
3152 proof terms are enabled unconditionally in the new HOL-Proofs image.
3154 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
3155 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
3158 * Old lib/scripts/polyml-platform is superseded by the
3159 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
3160 variant, even on a 64 bit machine. The following example setting
3161 prefers 64 bit if available:
3163 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
3165 * The preliminary Isabelle/jEdit application demonstrates the emerging
3166 Isabelle/Scala layer for advanced prover interaction and integration.
3167 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
3170 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
3171 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
3172 similar to the default assignment of the document preparation system
3173 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
3174 provides some operations for direct access to the font without asking
3175 the user for manual installation.
3179 New in Isabelle2009-1 (December 2009)
3180 -------------------------------------
3184 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
3185 one backslash should be used, even in ML sources.
3190 * Locale interpretation propagates mixins along the locale hierarchy.
3191 The currently only available mixins are the equations used to map
3192 local definitions to terms of the target domain of an interpretation.
3194 * Reactivated diagnostic command 'print_interps'. Use "print_interps
3195 loc" to print all interpretations of locale "loc" in the theory.
3196 Interpretations in proofs are not shown.
3198 * Thoroughly revised locales tutorial. New section on conditional
3201 * On instantiation of classes, remaining undefined class parameters
3202 are formally declared. INCOMPATIBILITY.
3205 *** Document preparation ***
3207 * New generalized style concept for printing terms: @{foo (style) ...}
3208 instead of @{foo_style style ...} (old form is still retained for
3209 backward compatibility). Styles can be also applied for
3210 antiquotations prop, term_type and typeof.
3215 * New proof method "smt" for a combination of first-order logic with
3216 equality, linear and nonlinear (natural/integer/real) arithmetic, and
3217 fixed-size bitvectors; there is also basic support for higher-order
3218 features (esp. lambda abstractions). It is an incomplete decision
3219 procedure based on external SMT solvers using the oracle mechanism;
3220 for the SMT solver Z3, this method is proof-producing. Certificates
3221 are provided to avoid calling the external solvers solely for
3222 re-checking proofs. Due to a remote SMT service there is no need for
3223 installing SMT solvers locally. See src/HOL/SMT.
3225 * New commands to load and prove verification conditions generated by
3226 the Boogie program verifier or derived systems (e.g. the Verifying C
3227 Compiler (VCC) or Spec#). See src/HOL/Boogie.
3229 * New counterexample generator tool 'nitpick' based on the Kodkod
3230 relational model finder. See src/HOL/Tools/Nitpick and
3231 src/HOL/Nitpick_Examples.
3233 * New commands 'code_pred' and 'values' to invoke the predicate
3234 compiler and to enumerate values of inductive predicates.
3236 * A tabled implementation of the reflexive transitive closure.
3238 * New implementation of quickcheck uses generic code generator;
3239 default generators are provided for all suitable HOL types, records
3240 and datatypes. Old quickcheck can be re-activated importing theory
3241 Library/SML_Quickcheck.
3243 * New testing tool Mirabelle for automated proof tools. Applies
3244 several tools and tactics like sledgehammer, metis, or quickcheck, to
3245 every proof step in a theory. To be used in batch mode via the
3246 "mirabelle" utility.
3248 * New proof method "sos" (sum of squares) for nonlinear real
3249 arithmetic (originally due to John Harison). It requires theory
3250 Library/Sum_Of_Squares. It is not a complete decision procedure but
3251 works well in practice on quantifier-free real arithmetic with +, -,
3252 *, ^, =, <= and <, i.e. boolean combinations of equalities and
3253 inequalities between polynomials. It makes use of external
3254 semidefinite programming solvers. Method "sos" generates a
3255 certificate that can be pasted into the proof thus avoiding the need
3256 to call an external tool every time the proof is checked. See
3257 src/HOL/Library/Sum_Of_Squares.
3259 * New method "linarith" invokes existing linear arithmetic decision
3262 * New command 'atp_minimal' reduces result produced by Sledgehammer.
3264 * New Sledgehammer option "Full Types" in Proof General settings menu.
3265 Causes full type information to be output to the ATPs. This slows
3266 ATPs down considerably but eliminates a source of unsound "proofs"
3269 * New method "metisFT": A version of metis that uses full type
3270 information in order to avoid failures of proof reconstruction.
3272 * New evaluator "approximate" approximates an real valued term using
3273 the same method as the approximation method.
3275 * Method "approximate" now supports arithmetic expressions as
3276 boundaries of intervals and implements interval splitting and Taylor
3279 * ML antiquotation @{code_datatype} inserts definition of a datatype
3280 generated by the code generator; e.g. see src/HOL/Predicate.thy.
3282 * New theory SupInf of the supremum and infimum operators for sets of
3285 * New theory Probability, which contains a development of measure
3286 theory, eventually leading to Lebesgue integration and probability.
3288 * Extended Multivariate Analysis to include derivation and Brouwer's
3291 * Reorganization of number theory, INCOMPATIBILITY:
3292 - new number theory development for nat and int, in theories Divides
3293 and GCD as well as in new session Number_Theory
3294 - some constants and facts now suffixed with _nat and _int
3296 - former session NumberTheory now named Old_Number_Theory, including
3297 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
3298 - moved theory Pocklington from src/HOL/Library to
3299 src/HOL/Old_Number_Theory
3301 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
3302 lcm of finite and infinite sets. It is shown that they form a complete
3305 * Class semiring_div requires superclass no_zero_divisors and proof of
3306 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
3307 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
3308 generalized to class semiring_div, subsuming former theorems
3309 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
3310 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
3313 * Refinements to lattice classes and sets:
3314 - less default intro/elim rules in locale variant, more default
3315 intro/elim rules in class variant: more uniformity
3316 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
3318 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
3320 - renamed ACI to inf_sup_aci
3321 - new class "boolean_algebra"
3322 - class "complete_lattice" moved to separate theory
3323 "Complete_Lattice"; corresponding constants (and abbreviations)
3324 renamed and with authentic syntax:
3325 Set.Inf ~> Complete_Lattice.Inf
3326 Set.Sup ~> Complete_Lattice.Sup
3327 Set.INFI ~> Complete_Lattice.INFI
3328 Set.SUPR ~> Complete_Lattice.SUPR
3329 Set.Inter ~> Complete_Lattice.Inter
3330 Set.Union ~> Complete_Lattice.Union
3331 Set.INTER ~> Complete_Lattice.INTER
3332 Set.UNION ~> Complete_Lattice.UNION
3333 - authentic syntax for
3336 - mere abbreviations:
3339 Set.inter (for inf, formerly Set.Int)
3340 Set.union (for sup, formerly Set.Un)
3341 Complete_Lattice.Inter (for Inf)
3342 Complete_Lattice.Union (for Sup)
3343 Complete_Lattice.INTER (for INFI)
3344 Complete_Lattice.UNION (for SUPR)
3345 - object-logic definitions as far as appropriate
3347 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
3348 Un_subset_iff are explicitly deleted as default simp rules; then also
3349 their lattice counterparts le_inf_iff and le_sup_iff have to be
3350 deleted to achieve the desired effect.
3352 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
3353 rules by default any longer; the same applies to min_max.inf_absorb1
3354 etc. INCOMPATIBILITY.
3356 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
3357 pred_set_conv by default. INCOMPATIBILITY.
3359 * Power operations on relations and functions are now one dedicated
3360 constant "compow" with infix syntax "^^". Power operation on
3361 multiplicative monoids retains syntax "^" and is now defined generic
3362 in class power. INCOMPATIBILITY.
3364 * Relation composition "R O S" now has a more standard argument order:
3365 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
3366 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
3367 break, since the O_assoc rule was not rewritten like this. Fix using
3368 O_assoc[symmetric]. The same applies to the curried version "R OO S".
3370 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
3371 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
3374 * Most rules produced by inductive and datatype package have mandatory
3375 prefixes. INCOMPATIBILITY.
3377 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
3378 the attribute of the same name. Each of the theorems in the list
3379 DERIV_intros assumes composition with an additional function and
3380 matches a variable to the derivative, which has to be solved by the
3381 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
3382 of most elementary terms. Former Maclauren.DERIV_tac and
3383 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
3386 * Code generator attributes follow the usual underscore convention:
3387 code_unfold replaces code unfold
3388 code_post replaces code post
3393 sizechange -> size_change
3394 induct_scheme -> induction_schema
3397 * Discontinued abbreviation "arbitrary" of constant "undefined".
3398 INCOMPATIBILITY, use "undefined" directly.
3401 Suc_eq_add_numeral_1 -> Suc_eq_plus1
3402 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
3403 Suc_plus1 -> Suc_eq_plus1
3404 *anti_sym -> *antisym*
3405 vector_less_eq_def -> vector_le_def
3408 * Added theorem List.map_map as [simp]. Removed List.map_compose.
3411 * Removed predicate "M hassize n" (<--> card M = n & finite M).
3417 * Theory Representable defines a class "rep" of domains that are
3418 representable (via an ep-pair) in the universal domain type "udom".
3419 Instances are provided for all type constructors defined in HOLCF.
3421 * The 'new_domain' command is a purely definitional version of the
3422 domain package, for representable domains. Syntax is identical to the
3423 old domain package. The 'new_domain' package also supports indirect
3424 recursion using previously-defined type constructors. See
3425 src/HOLCF/ex/New_Domain.thy for examples.
3427 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
3428 on the left-hand side of an equation, and then performs
3429 simplification. Rewriting is done using rules declared with the
3430 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
3431 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
3433 * The pattern-match compiler in 'fixrec' can now handle constructors
3434 with HOL function types. Pattern-match combinators for the Pair
3435 constructor are pre-configured.
3437 * The 'fixrec' package now produces better fixed-point induction rules
3438 for mutually-recursive definitions: Induction rules have conclusions
3439 of the form "P foo bar" instead of "P <foo, bar>".
3441 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
3442 been renamed to "below". The name "below" now replaces "less" in many
3443 theorem names. (Legacy theorem names using "less" are still supported
3446 * The 'fixrec' package now supports "bottom patterns". Bottom
3447 patterns can be used to generate strictness rules, or to make
3448 functions more strict (much like the bang-patterns supported by the
3449 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
3455 * Support for Poly/ML 5.3.0, with improved reporting of compiler
3456 errors and run-time exceptions, including detailed source positions.
3458 * Structure Name_Space (formerly NameSpace) now manages uniquely
3459 identified entries, with some additional information such as source
3460 position, logical grouping etc.
3462 * Theory and context data is now introduced by the simplified and
3463 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
3464 to be pure, but the old TheoryDataFun for mutable data (with explicit
3465 copy operation) is still available for some time.
3467 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
3468 provides a high-level programming interface to synchronized state
3469 variables with atomic update. This works via pure function
3470 application within a critical section -- its runtime should be as
3471 short as possible; beware of deadlocks if critical code is nested,
3472 either directly or indirectly via other synchronized variables!
3474 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
3475 wraps raw ML references, explicitly indicating their non-thread-safe
3476 behaviour. The Isar toplevel keeps this structure open, to
3477 accommodate Proof General as well as quick and dirty interactive
3478 experiments with references.
3480 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
3481 parallel tactical reasoning.
3483 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
3484 are similar to SUBPROOF, but are slightly more flexible: only the
3485 specified parts of the subgoal are imported into the context, and the
3486 body tactic may introduce new subgoals and schematic variables.
3488 * Old tactical METAHYPS, which does not observe the proof context, has
3489 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
3490 or Subgoal.FOCUS etc.
3492 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
3493 functors have their own ML name space there is no point to mark them
3494 separately.) Minor INCOMPATIBILITY.
3496 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
3498 * Renamed several structures FooBar to Foo_Bar. Occasional,
3501 * Operations of structure Skip_Proof no longer require quick_and_dirty
3502 mode, which avoids critical setmp.
3504 * Eliminated old Attrib.add_attributes, Method.add_methods and related
3505 combinators for "args". INCOMPATIBILITY, need to use simplified
3506 Attrib/Method.setup introduced in Isabelle2009.
3508 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
3509 back on global_simpset_of, global_claset_of, global_clasimpset_of as
3510 last resort. INCOMPATIBILITY.
3512 * Display.pretty_thm now requires a proper context (cf. former
3513 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
3514 or even Display.pretty_thm_without_context as last resort.
3517 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
3518 Syntax.pretty_typ/term directly, preferably with proper context
3519 instead of global theory.
3524 * Further fine tuning of parallel proof checking, scales up to 8 cores
3525 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
3528 * Support for additional "Isabelle components" via etc/components, see
3529 also the system manual.
3531 * The isabelle makeall tool now operates on all components with
3532 IsaMakefile, not just hardwired "logics".
3534 * Removed "compress" option from isabelle-process and isabelle usedir;
3535 this is always enabled.
3537 * Discontinued support for Poly/ML 4.x versions.
3539 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
3540 on a given logic image. This requires the lighttpd webserver and is
3541 currently supported on Linux only.
3545 New in Isabelle2009 (April 2009)
3546 --------------------------------
3550 * Simplified main Isabelle executables, with less surprises on
3551 case-insensitive file-systems (such as Mac OS).
3553 - The main Isabelle tool wrapper is now called "isabelle" instead of
3556 - The former "isabelle" alias for "isabelle-process" has been
3557 removed (should rarely occur to regular users).
3559 - The former "isabelle-interface" and its alias "Isabelle" have been
3560 removed (interfaces are now regular Isabelle tools).
3562 Within scripts and make files, the Isabelle environment variables
3563 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
3564 respectively. (The latter are still available as legacy feature.)
3566 The old isabelle-interface wrapper could react in confusing ways if
3567 the interface was uninstalled or changed otherwise. Individual
3568 interface tool configuration is now more explicit, see also the
3569 Isabelle system manual. In particular, Proof General is now available
3570 via "isabelle emacs".
3572 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
3573 purge installed copies of Isabelle executables and re-run "isabelle
3574 install -p ...", or use symlinks.
3576 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
3577 old ~/isabelle, which was slightly non-standard and apt to cause
3578 surprises on case-insensitive file-systems (such as Mac OS).
3580 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
3581 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
3582 care is required when using older releases of Isabelle. Note that
3583 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
3584 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
3586 * Proofs of fully specified statements are run in parallel on
3587 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
3588 a regular 4-core machine, if the initial heap space is made reasonably
3589 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
3591 * The main reference manuals ("isar-ref", "implementation", and
3592 "system") have been updated and extended. Formally checked references
3593 as hyperlinks are now available uniformly.
3598 * Complete re-implementation of locales. INCOMPATIBILITY in several
3599 respects. The most important changes are listed below. See the
3600 Tutorial on Locales ("locales" manual) for details.
3602 - In locale expressions, instantiation replaces renaming. Parameters
3603 must be declared in a for clause. To aid compatibility with previous
3604 parameter inheritance, in locale declarations, parameters that are not
3605 'touched' (instantiation position "_" or omitted) are implicitly added
3606 with their syntax at the beginning of the for clause.
3608 - Syntax from abbreviations and definitions in locales is available in
3609 locale expressions and context elements. The latter is particularly
3610 useful in locale declarations.
3612 - More flexible mechanisms to qualify names generated by locale
3613 expressions. Qualifiers (prefixes) may be specified in locale
3614 expressions, and can be marked as mandatory (syntax: "name!:") or
3615 optional (syntax "name?:"). The default depends for plain "name:"
3616 depends on the situation where a locale expression is used: in
3617 commands 'locale' and 'sublocale' prefixes are optional, in
3618 'interpretation' and 'interpret' prefixes are mandatory. The old
3619 implicit qualifiers derived from the parameter names of a locale are
3620 no longer generated.
3622 - Command "sublocale l < e" replaces "interpretation l < e". The
3623 instantiation clause in "interpretation" and "interpret" (square
3624 brackets) is no longer available. Use locale expressions.
3626 - When converting proof scripts, mandatory qualifiers in
3627 'interpretation' and 'interpret' should be retained by default, even
3628 if this is an INCOMPATIBILITY compared to former behavior. In the
3629 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
3630 in locale expressions range over a single locale instance only.
3632 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
3633 In existing theorem specifications replace the includes element by the
3634 respective context elements of the included locale, omitting those
3635 that are already present in the theorem specification. Multiple
3636 assume elements of a locale should be replaced by a single one
3637 involving the locale predicate. In the proof body, declarations (most
3638 notably theorems) may be regained by interpreting the respective
3639 locales in the proof context as required (command "interpret").
3641 If using "includes" in replacement of a target solely because the
3642 parameter types in the theorem are not as general as in the target,
3643 consider declaring a new locale with additional type constraints on
3644 the parameters (context element "constrains").
3646 - Discontinued "locale (open)". INCOMPATIBILITY.
3648 - Locale interpretation commands no longer attempt to simplify goal.
3649 INCOMPATIBILITY: in rare situations the generated goal differs. Use
3650 methods intro_locales and unfold_locales to clarify.
3652 - Locale interpretation commands no longer accept interpretation
3653 attributes. INCOMPATIBILITY.
3655 * Class declaration: so-called "base sort" must not be given in import
3656 list any longer, but is inferred from the specification. Particularly
3663 class foo = type + ...
3665 * Class target: global versions of theorems stemming do not carry a
3666 parameter prefix any longer. INCOMPATIBILITY.
3668 * Class 'instance' command no longer accepts attached definitions.
3669 INCOMPATIBILITY, use proper 'instantiation' target instead.
3671 * Recovered hiding of consts, which was accidentally broken in
3672 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
3673 makes c inaccessible; consider using ``hide (open) const c'' instead.
3675 * Slightly more coherent Pure syntax, with updated documentation in
3676 isar-ref manual. Removed locales meta_term_syntax and
3677 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
3678 INCOMPATIBILITY in rare situations. Note that &&& should not be used
3679 directly in regular applications.
3681 * There is a new syntactic category "float_const" for signed decimal
3682 fractions (e.g. 123.45 or -123.45).
3684 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
3685 interface with 'setup' command instead.
3687 * Command 'local_setup' is similar to 'setup', but operates on a local
3690 * The 'axiomatization' command now only works within a global theory
3691 context. INCOMPATIBILITY.
3693 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
3694 hypotheses. Sorts required in the course of reasoning need to be
3695 covered by the constraints in the initial statement, completed by the
3696 type instance information of the background theory. Non-trivial sort
3697 hypotheses, which rarely occur in practice, may be specified via
3698 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
3700 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
3702 The result contains an implicit sort hypotheses as before --
3703 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
3706 * Generalized Isar history, with support for linear undo, direct state
3709 * Changed defaults for unify configuration options:
3711 unify_trace_bound = 50 (formerly 25)
3712 unify_search_bound = 60 (formerly 30)
3714 * Different bookkeeping for code equations (INCOMPATIBILITY):
3716 a) On theory merge, the last set of code equations for a particular
3717 constant is taken (in accordance with the policy applied by other
3718 parts of the code generator framework).
3720 b) Code equations stemming from explicit declarations (e.g. code
3721 attribute) gain priority over default code equations stemming
3722 from definition, primrec, fun etc.
3724 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
3726 * Unified theorem tables for both code generators. Thus [code
3727 func] has disappeared and only [code] remains. INCOMPATIBILITY.
3729 * Command 'find_consts' searches for constants based on type and name
3732 find_consts "_ => bool"
3734 By default, matching is against subtypes, but it may be restricted to
3735 the whole type. Searching by name is possible. Multiple queries are
3736 conjunctive and queries may be negated by prefixing them with a
3739 find_consts strict: "_ => bool" name: "Int" -"int => int"
3741 * New 'find_theorems' criterion "solves" matches theorems that
3742 directly solve the current goal (modulo higher-order unification).
3744 * Auto solve feature for main theorem statements: whenever a new goal
3745 is stated, "find_theorems solves" is called; any theorems that could
3746 solve the lemma directly are listed as part of the goal state.
3747 Cf. associated options in Proof General Isabelle settings menu,
3748 enabled by default, with reasonable timeout for pathological cases of
3749 higher-order unification.
3752 *** Document preparation ***
3754 * Antiquotation @{lemma} now imitates a regular terminal proof,
3755 demanding keyword 'by' and supporting the full method expression
3756 syntax just like the Isar command 'by'.
3761 * Integrated main parts of former image HOL-Complex with HOL. Entry
3762 points Main and Complex_Main remain as before.
3764 * Logic image HOL-Plain provides a minimal HOL with the most important
3765 tools available (inductive, datatype, primrec, ...). This facilitates
3766 experimentation and tool development. Note that user applications
3767 (and library theories) should never refer to anything below theory
3770 * Logic image HOL-Main stops at theory Main, and thus facilitates
3771 experimentation due to shorter build times.
3773 * Logic image HOL-NSA contains theories of nonstandard analysis which
3774 were previously part of former HOL-Complex. Entry point Hyperreal
3775 remains valid, but theories formerly using Complex_Main should now use
3776 new entry point Hypercomplex.
3778 * Generic ATP manager for Sledgehammer, based on ML threads instead of
3779 Posix processes. Avoids potentially expensive forking of the ML
3780 process. New thread-based implementation also works on non-Unix
3781 platforms (Cygwin). Provers are no longer hardwired, but defined
3782 within the theory via plain ML wrapper functions. Basic Sledgehammer
3783 commands are covered in the isar-ref manual.
3785 * Wrapper scripts for remote SystemOnTPTP service allows to use
3786 sledgehammer without local ATP installation (Vampire etc.). Other
3787 provers may be included via suitable ML wrappers, see also
3788 src/HOL/ATP_Linkup.thy.
3790 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
3793 * The metis method no longer fails because the theorem is too trivial
3794 (contains the empty clause).
3796 * The metis method now fails in the usual manner, rather than raising
3797 an exception, if it determines that it cannot prove the theorem.
3799 * Method "coherent" implements a prover for coherent logic (see also
3800 src/Tools/coherent.ML).
3802 * Constants "undefined" and "default" replace "arbitrary". Usually
3803 "undefined" is the right choice to replace "arbitrary", though
3804 logically there is no difference. INCOMPATIBILITY.
3806 * Command "value" now integrates different evaluation mechanisms. The
3807 result of the first successful evaluation mechanism is printed. In
3808 square brackets a particular named evaluation mechanisms may be
3809 specified (currently, [SML], [code] or [nbe]). See further
3810 src/HOL/ex/Eval_Examples.thy.
3812 * Normalization by evaluation now allows non-leftlinear equations.
3813 Declare with attribute [code nbe].
3815 * Methods "case_tac" and "induct_tac" now refer to the very same rules
3816 as the structured Isar versions "cases" and "induct", cf. the
3817 corresponding "cases" and "induct" attributes. Mutual induction rules
3818 are now presented as a list of individual projections
3819 (e.g. foo_bar.inducts for types foo and bar); the old format with
3820 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
3821 rare situations a different rule is selected --- notably nested tuple
3822 elimination instead of former prod.exhaust: use explicit (case_tac t
3823 rule: prod.exhaust) here.
3825 * Attributes "cases", "induct", "coinduct" support "del" option.
3827 * Removed fact "case_split_thm", which duplicates "case_split".
3829 * The option datatype has been moved to a new theory Option. Renamed
3830 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
3832 * New predicate "strict_mono" classifies strict functions on partial
3833 orders. With strict functions on linear orders, reasoning about
3834 (in)equalities is facilitated by theorems "strict_mono_eq",
3835 "strict_mono_less_eq" and "strict_mono_less".
3837 * Some set operations are now proper qualified constants with
3838 authentic syntax. INCOMPATIBILITY:
3849 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
3852 * Auxiliary class "itself" has disappeared -- classes without any
3853 parameter are treated as expected by the 'class' command.
3855 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
3857 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
3858 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
3860 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
3861 method "approximation". It proves formulas on real values by using
3862 interval arithmetic. In the formulas are also the transcendental
3863 functions sin, cos, tan, atan, ln, exp and the constant pi are
3864 allowed. For examples see
3865 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
3867 * Theory "Reflection" now resides in HOL/Library.
3869 * Entry point to Word library now simply named "Word".
3872 * Made source layout more coherent with logical distribution
3875 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
3876 src/HOL/Library/Code_Message.thy ~> src/HOL/
3877 src/HOL/Library/GCD.thy ~> src/HOL/
3878 src/HOL/Library/Order_Relation.thy ~> src/HOL/
3879 src/HOL/Library/Parity.thy ~> src/HOL/
3880 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
3881 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
3882 src/HOL/Real/Lubs.thy ~> src/HOL/
3883 src/HOL/Real/PReal.thy ~> src/HOL/
3884 src/HOL/Real/Rational.thy ~> src/HOL/
3885 src/HOL/Real/RComplete.thy ~> src/HOL/
3886 src/HOL/Real/RealDef.thy ~> src/HOL/
3887 src/HOL/Real/RealPow.thy ~> src/HOL/
3888 src/HOL/Real/Real.thy ~> src/HOL/
3889 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
3890 src/HOL/Complex/Complex.thy ~> src/HOL/
3891 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
3892 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
3893 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
3894 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
3895 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
3896 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
3897 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
3898 src/HOL/Hyperreal/Log.thy ~> src/HOL/
3899 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
3900 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
3901 src/HOL/Hyperreal/Series.thy ~> src/HOL/
3902 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
3903 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
3904 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
3905 src/HOL/Real/Float ~> src/HOL/Library/
3906 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
3907 src/HOL/Real/RealVector.thy ~> src/HOL/
3909 src/HOL/arith_data.ML ~> src/HOL/Tools
3910 src/HOL/hologic.ML ~> src/HOL/Tools
3911 src/HOL/simpdata.ML ~> src/HOL/Tools
3912 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
3913 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
3914 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
3915 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
3916 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
3917 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
3918 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
3920 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
3921 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
3922 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
3923 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
3924 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
3925 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
3927 * If methods "eval" and "evaluation" encounter a structured proof
3928 state with !!/==>, only the conclusion is evaluated to True (if
3929 possible), avoiding strange error messages.
3931 * Method "sizechange" automates termination proofs using (a
3932 modification of) the size-change principle. Requires SAT solver. See
3933 src/HOL/ex/Termination.thy for examples.
3935 * Simplifier: simproc for let expressions now unfolds if bound
3936 variable occurs at most once in let expression body. INCOMPATIBILITY.
3938 * Method "arith": Linear arithmetic now ignores all inequalities when
3939 fast_arith_neq_limit is exceeded, instead of giving up entirely.
3941 * New attribute "arith" for facts that should always be used
3942 automatically by arithmetic. It is intended to be used locally in
3945 assumes [arith]: "x > 0"
3947 Global usage is discouraged because of possible performance impact.
3949 * New classes "top" and "bot" with corresponding operations "top" and
3950 "bot" in theory Orderings; instantiation of class "complete_lattice"
3951 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
3953 * Changed definition lemma "less_fun_def" in order to provide an
3954 instance for preorders on functions; use lemma "less_le" instead.
3957 * Theory Orderings: class "wellorder" moved here, with explicit
3958 induction rule "less_induct" as assumption. For instantiation of
3959 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
3962 * Theory Orderings: added class "preorder" as superclass of "order".
3963 INCOMPATIBILITY: Instantiation proofs for order, linorder
3964 etc. slightly changed. Some theorems named order_class.* now named
3967 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
3970 * Theory Finite_Set: added a new fold combinator of type
3972 ('a => 'b => 'b) => 'b => 'a set => 'b
3974 Occasionally this is more convenient than the old fold combinator
3975 which is now defined in terms of the new one and renamed to
3978 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
3979 and "ring_simps" have been replaced by "algebra_simps" (which can be
3980 extended with further lemmas!). At the moment both still exist but
3981 the former will disappear at some point.
3983 * Theory Power: Lemma power_Suc is now declared as a simp rule in
3984 class recpower. Type-specific simp rules for various recpower types
3985 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
3987 rat_power_0 -> power_0
3988 rat_power_Suc -> power_Suc
3989 realpow_0 -> power_0
3990 realpow_Suc -> power_Suc
3991 complexpow_0 -> power_0
3992 complexpow_Suc -> power_Suc
3993 power_poly_0 -> power_0
3994 power_poly_Suc -> power_Suc
3996 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
3997 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
3998 dvd has been generalized to class comm_semiring_1. Likewise a bunch
3999 of lemmas from Divides has been generalized from nat to class
4000 semiring_div. INCOMPATIBILITY. This involves the following theorem
4001 renames resulting from duplicate elimination:
4003 dvd_def_mod ~> dvd_eq_mod_eq_0
4004 zero_dvd_iff ~> dvd_0_left_iff
4005 dvd_0 ~> dvd_0_right
4006 DIVISION_BY_ZERO_DIV ~> div_by_0
4007 DIVISION_BY_ZERO_MOD ~> mod_by_0
4008 mult_div ~> div_mult_self2_is_id
4009 mult_mod ~> mod_mult_self2_is_0
4011 * Theory IntDiv: removed many lemmas that are instances of class-based
4012 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
4013 rename old lemmas as follows:
4015 dvd_diff -> nat_dvd_diff
4016 dvd_zminus_iff -> dvd_minus_iff
4017 mod_add1_eq -> mod_add_eq
4018 mod_mult1_eq -> mod_mult_right_eq
4019 mod_mult1_eq' -> mod_mult_left_eq
4020 mod_mult_distrib_mod -> mod_mult_eq
4021 nat_mod_add_left_eq -> mod_add_left_eq
4022 nat_mod_add_right_eq -> mod_add_right_eq
4023 nat_mod_div_trivial -> mod_div_trivial
4024 nat_mod_mod_trivial -> mod_mod_trivial
4025 zdiv_zadd_self1 -> div_add_self1
4026 zdiv_zadd_self2 -> div_add_self2
4027 zdiv_zmult_self1 -> div_mult_self2_is_id
4028 zdiv_zmult_self2 -> div_mult_self1_is_id
4029 zdvd_triv_left -> dvd_triv_left
4030 zdvd_triv_right -> dvd_triv_right
4031 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
4032 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
4033 zmod_zadd_left_eq -> mod_add_left_eq
4034 zmod_zadd_right_eq -> mod_add_right_eq
4035 zmod_zadd_self1 -> mod_add_self1
4036 zmod_zadd_self2 -> mod_add_self2
4037 zmod_zadd1_eq -> mod_add_eq
4038 zmod_zdiff1_eq -> mod_diff_eq
4039 zmod_zdvd_zmod -> mod_mod_cancel
4040 zmod_zmod_cancel -> mod_mod_cancel
4041 zmod_zmult_self1 -> mod_mult_self2_is_0
4042 zmod_zmult_self2 -> mod_mult_self1_is_0
4045 zdvd_abs1 -> abs_dvd_iff
4046 zdvd_abs2 -> dvd_abs_iff
4047 zdvd_refl -> dvd_refl
4048 zdvd_trans -> dvd_trans
4049 zdvd_zadd -> dvd_add
4050 zdvd_zdiff -> dvd_diff
4051 zdvd_zminus_iff -> dvd_minus_iff
4052 zdvd_zminus2_iff -> minus_dvd_iff
4053 zdvd_zmultD -> dvd_mult_right
4054 zdvd_zmultD2 -> dvd_mult_left
4055 zdvd_zmult_mono -> mult_dvd_mono
4056 zdvd_0_right -> dvd_0_right
4057 zdvd_0_left -> dvd_0_left_iff
4058 zdvd_1_left -> one_dvd
4059 zminus_dvd_iff -> minus_dvd_iff
4061 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
4063 * The real numbers offer decimal input syntax: 12.34 is translated
4064 into 1234/10^2. This translation is not reversed upon output.
4066 * Theory Library/Polynomial defines an abstract type 'a poly of
4067 univariate polynomials with coefficients of type 'a. In addition to
4068 the standard ring operations, it also supports div and mod. Code
4069 generation is also supported, using list-style constructors.
4071 * Theory Library/Inner_Product defines a class of real_inner for real
4072 inner product spaces, with an overloaded operation inner :: 'a => 'a
4073 => real. Class real_inner is a subclass of real_normed_vector from
4076 * Theory Library/Product_Vector provides instances for the product
4077 type 'a * 'b of several classes from RealVector and Inner_Product.
4078 Definitions of addition, subtraction, scalar multiplication, norms,
4079 and inner products are included.
4081 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
4082 addition to the field operations, numerals and case syntax are also
4085 * Theory Library/Diagonalize provides constructive version of Cantor's
4086 first diagonalization argument.
4088 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
4089 zlcm (for int); carried together from various gcd/lcm developements in
4090 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
4091 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
4092 may recover tupled syntax as follows:
4094 hide (open) const gcd
4095 abbreviation gcd where
4096 "gcd == (%(a, b). GCD.gcd a b)"
4098 GCD.gcd ("gcd '(_, _')")
4100 The same works for lcm, zgcd, zlcm.
4102 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
4103 instantiations for algebraic structures. Removed some duplicate
4104 theorems. Changes in simp rules. INCOMPATIBILITY.
4106 * ML antiquotation @{code} takes a constant as argument and generates
4107 corresponding code in background and inserts name of the corresponding
4108 resulting ML value/function/datatype constructor binding in place.
4109 All occurrences of @{code} with a single ML block are generated
4110 simultaneously. Provides a generic and safe interface for
4111 instrumentalizing code generation. See
4112 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
4113 In future you ought to refrain from ad-hoc compiling generated SML
4114 code on the ML toplevel. Note that (for technical reasons) @{code}
4115 cannot refer to constants for which user-defined serializations are
4116 set. Refer to the corresponding ML counterpart directly in that
4119 * Command 'rep_datatype': instead of theorem names the command now
4120 takes a list of terms denoting the constructors of the type to be
4121 represented as datatype. The characteristic theorems have to be
4122 proven. INCOMPATIBILITY. Also observe that the following theorems
4123 have disappeared in favour of existing ones:
4125 unit_induct ~> unit.induct
4126 prod_induct ~> prod.induct
4127 sum_induct ~> sum.induct
4128 Suc_Suc_eq ~> nat.inject
4129 Suc_not_Zero Zero_not_Suc ~> nat.distinct
4134 * New locales for orders and lattices where the equivalence relation
4135 is not restricted to equality. INCOMPATIBILITY: all order and lattice
4136 locales use a record structure with field eq for the equivalence.
4138 * New theory of factorial domains.
4140 * Units_l_inv and Units_r_inv are now simp rules by default.
4141 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
4142 and/or r_inv will now also require deletion of these lemmas.
4144 * Renamed the following theorems, INCOMPATIBILITY:
4146 UpperD ~> Upper_memD
4147 LowerD ~> Lower_memD
4148 least_carrier ~> least_closed
4149 greatest_carrier ~> greatest_closed
4150 greatest_Lower_above ~> greatest_Lower_below
4151 one_zero ~> carrier_one_zero
4152 one_not_zero ~> carrier_one_not_zero (collision with assumption)
4157 * Nominal datatypes can now contain type-variables.
4159 * Commands 'nominal_inductive' and 'equivariance' work with local
4162 * Nominal primrec can now works with local theory targets and its
4163 specification syntax now conforms to the general format as seen in
4166 * Method "perm_simp" honours the standard simplifier attributes
4167 (no_asm), (no_asm_use) etc.
4169 * The new predicate #* is defined like freshness, except that on the
4170 left hand side can be a set or list of atoms.
4172 * Experimental command 'nominal_inductive2' derives strong induction
4173 principles for inductive definitions. In contrast to
4174 'nominal_inductive', which can only deal with a fixed number of
4175 binders, it can deal with arbitrary expressions standing for sets of
4176 atoms to be avoided. The only inductive definition we have at the
4177 moment that needs this generalisation is the typing rule for Lets in
4180 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
4181 -----------------------------------------------------------------
4182 Gamma |- Let x be t1 in t2 : T2
4184 In this rule one wants to avoid all the binders that are introduced by
4185 "close Gamma T1". We are looking for other examples where this
4186 feature might be useful. Please let us know.
4191 * Reimplemented the simplification procedure for proving continuity
4192 subgoals. The new simproc is extensible; users can declare additional
4193 continuity introduction rules with the attribute [cont2cont].
4195 * The continuity simproc now uses a different introduction rule for
4196 solving continuity subgoals on terms with lambda abstractions. In
4197 some rare cases the new simproc may fail to solve subgoals that the
4198 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
4199 Potential INCOMPATIBILITY.
4201 * Command 'fixrec': specification syntax now conforms to the general
4202 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
4203 examples. INCOMPATIBILITY.
4208 * Proof of Zorn's Lemma for partial orders.
4213 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
4214 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
4215 depends on multithreading, so timouts will not work before Poly/ML
4218 * High-level support for concurrent ML programming, see
4219 src/Pure/Cuncurrent. The data-oriented model of "future values" is
4220 particularly convenient to organize independent functional
4221 computations. The concept of "synchronized variables" provides a
4222 higher-order interface for components with shared state, avoiding the
4223 delicate details of mutexes and condition variables. (Requires
4224 Poly/ML 5.2.1 or later.)
4226 * ML bindings produced via Isar commands are stored within the Isar
4227 context (theory or proof). Consequently, commands like 'use' and 'ML'
4228 become thread-safe and work with undo as expected (concerning
4229 top-level bindings, not side-effects on global references).
4230 INCOMPATIBILITY, need to provide proper Isar context when invoking the
4231 compiler at runtime; really global bindings need to be given outside a
4232 theory. (Requires Poly/ML 5.2 or later.)
4234 * Command 'ML_prf' is analogous to 'ML' but works within a proof
4235 context. Top-level ML bindings are stored within the proof context in
4236 a purely sequential fashion, disregarding the nested proof structure.
4237 ML bindings introduced by 'ML_prf' are discarded at the end of the
4238 proof. (Requires Poly/ML 5.2 or later.)
4240 * Simplified ML attribute and method setup, cf. functions Attrib.setup
4241 and Method.setup, as well as Isar commands 'attribute_setup' and
4242 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
4243 existing code accordingly, or use plain 'setup' together with old
4246 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
4247 to 'a -> thm, while results are always tagged with an authentic oracle
4248 name. The Isar command 'oracle' is now polymorphic, no argument type
4249 is specified. INCOMPATIBILITY, need to simplify existing oracle code
4250 accordingly. Note that extra performance may be gained by producing
4251 the cterm carefully, avoiding slow Thm.cterm_of.
4253 * Simplified interface for defining document antiquotations via
4254 ThyOutput.antiquotation, ThyOutput.output, and optionally
4255 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
4256 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
4259 * More systematic treatment of long names, abstract name bindings, and
4260 name space operations. Basic operations on qualified names have been
4261 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
4262 Long_Name.append. Old type bstring has been mostly replaced by
4263 abstract type binding (see structure Binding), which supports precise
4264 qualification by packages and local theory targets, as well as proper
4265 tracking of source positions. INCOMPATIBILITY, need to wrap old
4266 bstring values into Binding.name, or better pass through abstract
4267 bindings everywhere. See further src/Pure/General/long_name.ML,
4268 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
4270 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
4271 LocalTheory.note etc.) now refer to the *full* internal name, not the
4272 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
4274 * Disposed old type and term read functions (Sign.read_def_typ,
4275 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
4276 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
4277 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
4278 Syntax.read_term_global etc.; see also OldGoals.read_term as last
4279 resort for legacy applications.
4281 * Disposed old declarations, tactics, tactic combinators that refer to
4282 the simpset or claset of an implicit theory (such as Addsimps,
4283 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
4284 embedded ML text, or local_simpset_of with a proper context passed as
4285 explicit runtime argument.
4287 * Rules and tactics that read instantiations (read_instantiate,
4288 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
4289 context, which is required for parsing and type-checking. Moreover,
4290 the variables are specified as plain indexnames, not string encodings
4291 thereof. INCOMPATIBILITY.
4293 * Generic Toplevel.add_hook interface allows to analyze the result of
4294 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
4295 for theorem dependency output of transactions resulting in a new
4298 * ML antiquotations: block-structured compilation context indicated by
4299 \<lbrace> ... \<rbrace>; additional antiquotation forms:
4301 @{binding name} - basic name binding
4302 @{let ?pat = term} - term abbreviation (HO matching)
4303 @{note name = fact} - fact abbreviation
4304 @{thm fact} - singleton fact (with attributes)
4305 @{thms fact} - general fact (with attributes)
4306 @{lemma prop by method} - singleton goal
4307 @{lemma prop by meth1 meth2} - singleton goal
4308 @{lemma prop1 ... propN by method} - general goal
4309 @{lemma prop1 ... propN by meth1 meth2} - general goal
4310 @{lemma (open) ...} - open derivation
4315 * The Isabelle "emacs" tool provides a specific interface to invoke
4316 Proof General / Emacs, with more explicit failure if that is not
4317 installed (the old isabelle-interface script silently falls back on
4318 isabelle-process). The PROOFGENERAL_HOME setting determines the
4319 installation location of the Proof General distribution.
4321 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
4322 the Isabelle process into a JVM/Scala application. See
4323 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
4324 process wrapper has been discontinued.)
4326 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
4328 * Various status messages (with exact source position information) are
4329 emitted, if proper markup print mode is enabled. This allows
4330 user-interface components to provide detailed feedback on internal
4335 New in Isabelle2008 (June 2008)
4336 -------------------------------
4340 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
4341 and updated, with formally checked references as hyperlinks.
4343 * Theory loader: use_thy (and similar operations) no longer set the
4344 implicit ML context, which was occasionally hard to predict and in
4345 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
4346 provides a proper context already.
4348 * Theory loader: old-style ML proof scripts being *attached* to a thy
4349 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
4350 'use' within a theory file will do the job.
4352 * Name space merge now observes canonical order, i.e. the second space
4353 is inserted into the first one, while existing entries in the first
4354 space take precedence. INCOMPATIBILITY in rare situations, may try to
4355 swap theory imports.
4357 * Syntax: symbol \<chi> is now considered a letter. Potential
4358 INCOMPATIBILITY in identifier syntax etc.
4360 * Outer syntax: string tokens no longer admit escaped white space,
4361 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
4362 white space without escapes.
4364 * Outer syntax: string tokens may contain arbitrary character codes
4365 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
4371 * Context-dependent token translations. Default setup reverts locally
4372 fixed variables, and adds hilite markup for undeclared frees.
4374 * Unused theorems can be found using the new command 'unused_thms'.
4375 There are three ways of invoking it:
4378 Only finds unused theorems in the current theory.
4380 (2) unused_thms thy_1 ... thy_n -
4381 Finds unused theorems in the current theory and all of its ancestors,
4382 excluding the theories thy_1 ... thy_n and all of their ancestors.
4384 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
4385 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
4386 their ancestors, excluding the theories thy_1 ... thy_n and all of
4389 In order to increase the readability of the list produced by
4390 unused_thms, theorems that have been created by a particular instance
4391 of a theory command such as 'inductive' or 'function' are considered
4392 to belong to the same "group", meaning that if at least one theorem in
4393 this group is used, the other theorems in the same group are no longer
4394 reported as unused. Moreover, if all theorems in the group are
4395 unused, only one theorem in the group is displayed.
4397 Note that proof objects have to be switched on in order for
4398 unused_thms to work properly (i.e. !proofs must be >= 1, which is
4399 usually the case when using Proof General with the default settings).
4401 * Authentic naming of facts disallows ad-hoc overwriting of previous
4402 theorems within the same name space. INCOMPATIBILITY, need to remove
4403 duplicate fact bindings, or even accidental fact duplications. Note
4404 that tools may maintain dynamically scoped facts systematically, using
4405 PureThy.add_thms_dynamic.
4407 * Command 'hide' now allows to hide from "fact" name space as well.
4409 * Eliminated destructive theorem database, simpset, claset, and
4410 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
4411 update of theories within ML code.
4413 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
4414 INCOMPATIBILITY, object-logics depending on former Pure require
4415 additional setup PureThy.old_appl_syntax_setup; object-logics
4416 depending on former CPure need to refer to Pure.
4418 * Commands 'use' and 'ML' are now purely functional, operating on
4419 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
4420 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
4423 * Command 'setup': discontinued implicit version with ML reference.
4425 * Instantiation target allows for simultaneous specification of class
4426 instance operations together with an instantiation proof.
4427 Type-checking phase allows to refer to class operations uniformly.
4428 See src/HOL/Complex/Complex.thy for an Isar example and
4429 src/HOL/Library/Eval.thy for an ML example.
4431 * Indexing of literal facts: be more serious about including only
4432 facts from the visible specification/proof context, but not the
4433 background context (locale etc.). Affects `prop` notation and method
4434 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
4437 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
4438 "(open)" option, which used to expose internal bound variables to the
4441 * Isar statements: removed obsolete case "rule_context".
4442 INCOMPATIBILITY, better use explicit fixes/assumes.
4444 * Locale proofs: default proof step now includes 'unfold_locales';
4445 hence 'proof' without argument may be used to unfold locale
4449 *** Document preparation ***
4451 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
4452 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
4453 obsolete thumbpdf setup (contemporary PDF viewers do this on the
4454 spot); renamed link color from "darkblue" to "linkcolor" (default
4455 value unchanged, can be redefined via \definecolor); no longer sets
4456 "a4paper" option (unnecessary or even intrusive).
4458 * Antiquotation @{lemma A method} proves proposition A by the given
4459 method (either a method name or a method name plus (optional) method
4460 arguments in parentheses) and prints A just like @{prop A}.
4465 * New primrec package. Specification syntax conforms in style to
4466 definition/function/.... No separate induction rule is provided. The
4467 "primrec" command distinguishes old-style and new-style specifications
4468 by syntax. The former primrec package is now named OldPrimrecPackage.
4469 When adjusting theories, beware: constants stemming from new-style
4470 primrec specifications have authentic syntax.
4472 * Metis prover is now an order of magnitude faster, and also works
4473 with multithreading.
4475 * Metis: the maximum number of clauses that can be produced from a
4476 theorem is now given by the attribute max_clauses. Theorems that
4477 exceed this number are ignored, with a warning printed.
4479 * Sledgehammer no longer produces structured proofs by default. To
4480 enable, declare [[sledgehammer_full = true]]. Attributes
4481 reconstruction_modulus, reconstruction_sorts renamed
4482 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
4484 * Method "induct_scheme" derives user-specified induction rules
4485 from well-founded induction and completeness of patterns. This factors
4486 out some operations that are done internally by the function package
4487 and makes them available separately. See
4488 src/HOL/ex/Induction_Scheme.thy for examples.
4490 * More flexible generation of measure functions for termination
4491 proofs: Measure functions can be declared by proving a rule of the
4492 form "is_measure f" and giving it the [measure_function] attribute.
4493 The "is_measure" predicate is logically meaningless (always true), and
4494 just guides the heuristic. To find suitable measure functions, the
4495 termination prover sets up the goal "is_measure ?f" of the appropriate
4496 type and generates all solutions by prolog-style backwards proof using
4499 This setup also deals with rules like
4501 "is_measure f ==> is_measure (list_size f)"
4503 which accommodates nested datatypes that recurse through lists.
4504 Similar rules are predeclared for products and option types.
4506 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
4510 - Definitions of overloaded constants on sets have to be replaced by
4511 definitions on => and bool.
4513 - Some definitions of overloaded operators on sets can now be proved
4514 using the definitions of the operators on => and bool. Therefore,
4515 the following theorems have been renamed:
4517 subset_def -> subset_eq
4518 psubset_def -> psubset_eq
4519 set_diff_def -> set_diff_eq
4520 Compl_def -> Compl_eq
4521 Sup_set_def -> Sup_set_eq
4522 Inf_set_def -> Inf_set_eq
4523 sup_set_def -> sup_set_eq
4524 inf_set_def -> inf_set_eq
4526 - Due to the incompleteness of the HO unification algorithm, some
4527 rules such as subst may require manual instantiation, if some of
4528 the unknowns in the rule is a set.
4530 - Higher order unification and forward proofs:
4533 have "P (S::'a set)" <...>
4534 then have "EX S. P S" ..
4536 no longer works (due to the incompleteness of the HO unification
4537 algorithm) and must be replaced by the pattern
4544 - Calculational reasoning with subst (or similar rules):
4547 have "P (S::'a set)" <...>
4548 also have "S = T" <...>
4549 finally have "P T" .
4551 no longer works (for similar reasons as the previous example) and
4552 must be replaced by something like
4554 have "P (S::'a set)" <...>
4555 moreover have "S = T" <...>
4556 ultimately have "P T" by simp
4558 - Tactics or packages written in ML code:
4559 Code performing pattern matching on types via
4561 Type ("set", [T]) => ...
4563 must be rewritten. Moreover, functions like strip_type or
4564 binder_types no longer return the right value when applied to a
4567 T1 => ... => Tn => U => bool
4571 T1 => ... => Tn => U set
4573 * Merged theories Wellfounded_Recursion, Accessible_Part and
4574 Wellfounded_Relations to theory Wellfounded.
4576 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
4578 * Class finite no longer treats UNIV as class parameter. Use class
4579 enum from theory Library/Enum instead to achieve a similar effect.
4582 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
4583 and "Cons". INCOMPATIBILITY.
4585 * HOL (and FOL): renamed variables in rules imp_elim and swap.
4586 Potential INCOMPATIBILITY.
4588 * Theory Product_Type: duplicated lemmas split_Pair_apply and
4589 injective_fst_snd removed, use split_eta and prod_eqI instead.
4590 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
4592 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
4593 the same name in theory Orderings:
4603 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
4604 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
4605 and different variable names.
4607 * Library/Option_ord.thy: Canonical order on option type.
4609 * Library/RBT.thy: Red-black trees, an efficient implementation of
4612 * Library/Countable.thy: Type class for countable types.
4614 * Theory Int: The representation of numerals has changed. The infix
4615 operator BIT and the bit datatype with constructors B0 and B1 have
4616 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
4617 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
4618 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
4621 * Theory Nat: definition of <= and < on natural numbers no longer
4622 depend on well-founded relations. INCOMPATIBILITY. Definitions
4623 le_def and less_def have disappeared. Consider lemmas not_less
4624 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
4626 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
4627 (whose purpose mainly is for various fold_set functionals) have been
4628 abandoned in favor of the existing algebraic classes
4629 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
4630 lower_semilattice (resp. upper_semilattice) and linorder.
4633 * Theory Transitive_Closure: induct and cases rules now declare proper
4634 case_names ("base" and "step"). INCOMPATIBILITY.
4636 * Theorem Inductive.lfp_ordinal_induct generalized to complete
4637 lattices. The form set-specific version is available as
4638 Inductive.lfp_ordinal_induct_set.
4640 * Renamed theorems "power.simps" to "power_int.simps".
4643 * Class semiring_div provides basic abstract properties of semirings
4644 with division and modulo operations. Subsumes former class dvd_mod.
4646 * Merged theories IntDef, Numeral and IntArith into unified theory
4647 Int. INCOMPATIBILITY.
4649 * Theory Library/Code_Index: type "index" now represents natural
4650 numbers rather than integers. INCOMPATIBILITY.
4652 * New class "uminus" with operation "uminus" (split of from class
4653 "minus" which now only has operation "minus", binary).
4656 * Constants "card", "internal_split", "option_map" now with authentic
4657 syntax. INCOMPATIBILITY.
4659 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
4660 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
4661 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
4662 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
4663 Sup_set_def, le_def, less_def, option_map_def now with object
4664 equality. INCOMPATIBILITY.
4666 * Records. Removed K_record, and replaced it by pure lambda term
4667 %x. c. The simplifier setup is now more robust against eta expansion.
4668 INCOMPATIBILITY: in cases explicitly referring to K_record.
4670 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
4672 * Library/ListVector: new theory of arithmetic vector operations.
4674 * Library/Order_Relation: new theory of various orderings as sets of
4675 pairs. Defines preorders, partial orders, linear orders and
4676 well-orders on sets and on types.
4681 * Renamed some theories to allow to loading both ZF and HOL in the
4684 Datatype -> Datatype_ZF
4685 Inductive -> Inductive_ZF
4692 INCOMPATIBILITY: ZF theories that import individual theories below
4693 Main might need to be adapted. Regular theory Main is still
4694 available, as trivial extension of Main_ZF.
4699 * ML within Isar: antiquotation @{const name} or @{const
4700 name(typargs)} produces statically-checked Const term.
4702 * Functor NamedThmsFun: data is available to the user as dynamic fact
4703 (of the same name). Removed obsolete print command.
4705 * Removed obsolete "use_legacy_bindings" function.
4707 * The ``print mode'' is now a thread-local value derived from a global
4708 template (the former print_mode reference), thus access becomes
4709 non-critical. The global print_mode reference is for session
4710 management only; user-code should use print_mode_value,
4711 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
4713 * Functions system/system_out provide a robust way to invoke external
4714 shell commands, with propagation of interrupts (requires Poly/ML
4715 5.2.1). Do not use OS.Process.system etc. from the basis library!
4720 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
4721 in accordance with Proof General 3.7, which prefers GNU emacs.
4723 * isatool tty runs Isabelle process with plain tty interaction;
4724 optional line editor may be specified via ISABELLE_LINE_EDITOR
4725 setting, the default settings attempt to locate "ledit" and "rlwrap".
4727 * isatool browser now works with Cygwin as well, using general
4728 "javapath" function defined in Isabelle process environment.
4730 * YXML notation provides a simple and efficient alternative to
4731 standard XML transfer syntax. See src/Pure/General/yxml.ML and
4732 isatool yxml as described in the Isabelle system manual.
4734 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
4735 provides general wrapper for managing an Isabelle process in a robust
4736 fashion, with ``cooked'' output from stdin/stderr.
4738 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
4739 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
4741 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
4742 way of changing the user's settings is via
4743 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
4746 * Multithreading.max_threads := 0 refers to the number of actual CPU
4747 cores of the underlying machine, which is a good starting point for
4748 optimal performance tuning. The corresponding usedir option -M allows
4749 "max" as an alias for "0". WARNING: does not work on certain versions
4750 of Mac OS (with Poly/ML 5.1).
4752 * isabelle-process: non-ML sessions are run with "nice", to reduce the
4753 adverse effect of Isabelle flooding interactive front-ends (notably
4754 ProofGeneral / XEmacs).
4758 New in Isabelle2007 (November 2007)
4759 -----------------------------------
4763 * More uniform information about legacy features, notably a
4764 warning/error of "Legacy feature: ...", depending on the state of the
4765 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
4766 legacy features will disappear eventually.
4768 * Theory syntax: the header format ``theory A = B + C:'' has been
4769 discontinued in favour of ``theory A imports B C begin''. Use isatool
4770 fixheaders to convert existing theory files. INCOMPATIBILITY.
4772 * Theory syntax: the old non-Isar theory file format has been
4773 discontinued altogether. Note that ML proof scripts may still be used
4774 with Isar theories; migration is usually quite simple with the ML
4775 function use_legacy_bindings. INCOMPATIBILITY.
4777 * Theory syntax: some popular names (e.g. 'class', 'declaration',
4778 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
4781 * Theory loader: be more serious about observing the static theory
4782 header specifications (including optional directories), but not the
4783 accidental file locations of previously successful loads. The strict
4784 update policy of former update_thy is now already performed by
4785 use_thy, so the former has been removed; use_thys updates several
4786 theories simultaneously, just as 'imports' within a theory header
4787 specification, but without merging the results. Potential
4788 INCOMPATIBILITY: may need to refine theory headers and commands
4789 ROOT.ML which depend on load order.
4791 * Theory loader: optional support for content-based file
4792 identification, instead of the traditional scheme of full physical
4793 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
4794 (cf. the system manual). The new scheme allows to work with
4795 non-finished theories in persistent session images, such that source
4796 files may be moved later on without requiring reloads.
4798 * Theory loader: old-style ML proof scripts being *attached* to a thy
4799 file (with the same base name as the theory) are considered a legacy
4800 feature, which will disappear eventually. Even now, the theory loader
4801 no longer maintains dependencies on such files.
4803 * Syntax: the scope for resolving ambiguities via type-inference is
4804 now limited to individual terms, instead of whole simultaneous
4805 specifications as before. This greatly reduces the complexity of the
4806 syntax module and improves flexibility by separating parsing and
4807 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
4808 'fixes' etc.) are required in rare situations.
4810 * Syntax: constants introduced by new-style packages ('definition',
4811 'abbreviation' etc.) are passed through the syntax module in
4812 ``authentic mode''. This means that associated mixfix annotations
4813 really stick to such constants, independently of potential name space
4814 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
4815 trees are represented slightly differently, may need to adapt syntax
4816 translations accordingly. Use CONST marker in 'translations' and
4817 @{const_syntax} antiquotation in 'parse_translation' etc.
4819 * Legacy goal package: reduced interface to the bare minimum required
4820 to keep existing proof scripts running. Most other user-level
4821 functions are now part of the OldGoals structure, which is *not* open
4822 by default (consider isatool expandshort before open OldGoals).
4823 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
4824 these tend to cause confusion about the actual goal (!) context being
4825 used here, which is not necessarily the same as the_context().
4827 * Command 'find_theorems': supports "*" wild-card in "name:"
4828 criterion; "with_dups" option. Certain ProofGeneral versions might
4829 support a specific search form (see ProofGeneral/CHANGES).
4831 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
4832 by default, which means that "prems" (and also "fixed variables") are
4833 suppressed from proof state output. Note that the ProofGeneral
4834 settings mechanism allows to change and save options persistently, but
4835 older versions of Isabelle will fail to start up if a negative prems
4838 * Local theory targets may be specified by non-nested blocks of
4839 ``context/locale/class ... begin'' followed by ``end''. The body may
4840 contain definitions, theorems etc., including any derived mechanism
4841 that has been implemented on top of these primitives. This concept
4842 generalizes the existing ``theorem (in ...)'' towards more versatility
4845 * Proof General interface: proper undo of final 'end' command;
4846 discontinued Isabelle/classic mode (ML proof scripts).
4849 *** Document preparation ***
4851 * Added antiquotation @{theory name} which prints the given name,
4852 after checking that it refers to a valid ancestor theory in the
4855 * Added antiquotations @{ML_type text} and @{ML_struct text} which
4856 check the given source text as ML type/structure, printing verbatim.
4858 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
4859 "c args == rhs" given in the current context. (Any number of
4860 arguments may be given on the LHS.)
4865 * The 'class' package offers a combination of axclass and locale to
4866 achieve Haskell-like type classes in Isabelle. Definitions and
4867 theorems within a class context produce both relative results (with
4868 implicit parameters according to the locale context), and polymorphic
4869 constants with qualified polymorphism (according to the class
4870 context). Within the body context of a 'class' target, a separate
4871 syntax layer ("user space type system") takes care of converting
4872 between global polymorphic consts and internal locale representation.
4873 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
4874 "isatool doc classes" provides a tutorial.
4876 * Generic code generator framework allows to generate executable
4877 code for ML and Haskell (including Isabelle classes). A short usage
4880 internal compilation:
4881 export_code <list of constants (term syntax)> in SML
4882 writing SML code to a file:
4883 export_code <list of constants (term syntax)> in SML <filename>
4884 writing OCaml code to a file:
4885 export_code <list of constants (term syntax)> in OCaml <filename>
4886 writing Haskell code to a bunch of files:
4887 export_code <list of constants (term syntax)> in Haskell <filename>
4889 evaluating closed propositions to True/False using code generation:
4892 Reasonable default setup of framework in HOL.
4894 Theorem attributs for selecting and transforming function equations theorems:
4896 [code fun]: select a theorem as function equation for a specific constant
4897 [code fun del]: deselect a theorem as function equation for a specific constant
4898 [code inline]: select an equation theorem for unfolding (inlining) in place
4899 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
4901 User-defined serializations (target in {SML, OCaml, Haskell}):
4903 code_const <and-list of constants (term syntax)>
4904 {(target) <and-list of const target syntax>}+
4906 code_type <and-list of type constructors>
4907 {(target) <and-list of type target syntax>}+
4909 code_instance <and-list of instances>
4911 where instance ::= <type constructor> :: <class>
4913 code_class <and_list of classes>
4914 {(target) <and-list of class target syntax>}+
4915 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
4917 code_instance and code_class only are effective to target Haskell.
4919 For example usage see src/HOL/ex/Codegenerator.thy and
4920 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
4921 generation from Isabelle/HOL theories is available via "isatool doc
4924 * Code generator: consts in 'consts_code' Isar commands are now
4925 referred to by usual term syntax (including optional type
4928 * Command 'no_translations' removes translation rules from theory
4931 * Overloaded definitions are now actually checked for acyclic
4932 dependencies. The overloading scheme is slightly more general than
4933 that of Haskell98, although Isabelle does not demand an exact
4934 correspondence to type class and instance declarations.
4935 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
4936 exotic versions of overloading -- at the discretion of the user!
4938 Polymorphic constants are represented via type arguments, i.e. the
4939 instantiation that matches an instance against the most general
4940 declaration given in the signature. For example, with the declaration
4941 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
4942 as c(nat). Overloading is essentially simultaneous structural
4943 recursion over such type arguments. Incomplete specification patterns
4944 impose global constraints on all occurrences, e.g. c('a * 'a) on the
4945 LHS means that more general c('a * 'b) will be disallowed on any RHS.
4946 Command 'print_theory' outputs the normalized system of recursive
4947 equations, see section "definitions".
4949 * Configuration options are maintained within the theory or proof
4950 context (with name and type bool/int/string), providing a very simple
4951 interface to a poor-man's version of general context data. Tools may
4952 declare options in ML (e.g. using Attrib.config_int) and then refer to
4953 these values using Config.get etc. Users may change options via an
4954 associated attribute of the same name. This form of context
4955 declaration works particularly well with commands 'declare' or
4956 'using', for example ``declare [[foo = 42]]''. Thus it has become
4957 very easy to avoid global references, which would not observe Isar
4958 toplevel undo/redo and fail to work with multithreading.
4960 Various global ML references of Pure and HOL have been turned into
4961 configuration options:
4963 Unify.search_bound unify_search_bound
4964 Unify.trace_bound unify_trace_bound
4965 Unify.trace_simp unify_trace_simp
4966 Unify.trace_types unify_trace_types
4967 Simplifier.simp_depth_limit simp_depth_limit
4968 Blast.depth_limit blast_depth_limit
4969 DatatypeProp.dtK datatype_distinctness_limit
4970 fast_arith_neq_limit fast_arith_neq_limit
4971 fast_arith_split_limit fast_arith_split_limit
4973 * Named collections of theorems may be easily installed as context
4974 data using the functor NamedThmsFun (see also
4975 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
4976 attributes; there is also a toplevel print command. This facility is
4977 just a common case of general context data, which is the preferred way
4978 for anything more complex than just a list of facts in canonical
4981 * Isar: command 'declaration' augments a local theory by generic
4982 declaration functions written in ML. This enables arbitrary content
4983 being added to the context, depending on a morphism that tells the
4984 difference of the original declaration context wrt. the application
4985 context encountered later on.
4987 * Isar: proper interfaces for simplification procedures. Command
4988 'simproc_setup' declares named simprocs (with match patterns, and body
4989 text in ML). Attribute "simproc" adds/deletes simprocs in the current
4990 context. ML antiquotation @{simproc name} retrieves named simprocs.
4992 * Isar: an extra pair of brackets around attribute declarations
4993 abbreviates a theorem reference involving an internal dummy fact,
4994 which will be ignored later --- only the effect of the attribute on
4995 the background context will persist. This form of in-place
4996 declarations is particularly useful with commands like 'declare' and
4997 'using', for example ``have A using [[simproc a]] by simp''.
4999 * Isar: method "assumption" (and implicit closing of subproofs) now
5000 takes simple non-atomic goal assumptions into account: after applying
5001 an assumption as a rule the resulting subgoals are solved by atomic
5002 assumption steps. This is particularly useful to finish 'obtain'
5003 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
5004 without referring to the original premise "!!x. P x ==> thesis" in the
5005 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
5008 * Isar: implicit use of prems from the Isar proof context is
5009 considered a legacy feature. Common applications like ``have A .''
5010 may be replaced by ``have A by fact'' or ``note `A`''. In general,
5011 referencing facts explicitly here improves readability and
5012 maintainability of proof texts.
5014 * Isar: improper proof element 'guess' is like 'obtain', but derives
5015 the obtained context from the course of reasoning! For example:
5017 assume "EX x y. A x & B y" -- "any previous fact"
5018 then guess x and y by clarify
5020 This technique is potentially adventurous, depending on the facts and
5021 proof tools being involved here.
5023 * Isar: known facts from the proof context may be specified as literal
5024 propositions, using ASCII back-quote syntax. This works wherever
5025 named facts used to be allowed so far, in proof commands, proof
5026 methods, attributes etc. Literal facts are retrieved from the context
5027 according to unification of type and term parameters. For example,
5028 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
5029 theorems in the current context, then these are valid literal facts:
5030 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
5032 There is also a proof method "fact" which does the same composition
5033 for explicit goal states, e.g. the following proof texts coincide with
5034 certain special cases of literal facts:
5036 have "A" by fact == note `A`
5037 have "A ==> B" by fact == note `A ==> B`
5038 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
5039 have "P a ==> Q a" by fact == note `P a ==> Q a`
5041 * Isar: ":" (colon) is no longer a symbolic identifier character in
5042 outer syntax. Thus symbolic identifiers may be used without
5043 additional white space in declarations like this: ``assume *: A''.
5045 * Isar: 'print_facts' prints all local facts of the current context,
5046 both named and unnamed ones.
5048 * Isar: 'def' now admits simultaneous definitions, e.g.:
5050 def x == "t" and y == "u"
5052 * Isar: added command 'unfolding', which is structurally similar to
5053 'using', but affects both the goal state and facts by unfolding given
5054 rewrite rules. Thus many occurrences of the 'unfold' method or
5055 'unfolded' attribute may be replaced by first-class proof text.
5057 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
5058 and command 'unfolding' now all support object-level equalities
5059 (potentially conditional). The underlying notion of rewrite rule is
5060 analogous to the 'rule_format' attribute, but *not* that of the
5061 Simplifier (which is usually more generous).
5063 * Isar: the new attribute [rotated n] (default n = 1) rotates the
5064 premises of a theorem by n. Useful in conjunction with drule.
5066 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
5067 method expression within a sandbox consisting of the first N
5068 sub-goals, which need to exist. For example, ``simp_all [3]''
5069 simplifies the first three sub-goals, while (rule foo, simp_all)[]
5070 simplifies all new goals that emerge from applying rule foo to the
5071 originally first one.
5073 * Isar: schematic goals are no longer restricted to higher-order
5074 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
5077 * Isar: the conclusion of a long theorem statement is now either
5078 'shows' (a simultaneous conjunction, as before), or 'obtains'
5079 (essentially a disjunction of cases with local parameters and
5080 assumptions). The latter allows to express general elimination rules
5081 adequately; in this notation common elimination rules look like this:
5083 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
5085 obtains x where "P x"
5087 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
5091 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
5097 The subsequent classical rules even refer to the formal "thesis"
5100 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
5103 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
5104 obtains "thesis ==> something"
5106 The actual proof of an 'obtains' statement is analogous to that of the
5107 Isar proof element 'obtain', only that there may be several cases.
5108 Optional case names may be specified in parentheses; these will be
5109 available both in the present proof and as annotations in the
5110 resulting rule, for later use with the 'cases' method (cf. attribute
5113 * Isar: the assumptions of a long theorem statement are available as
5114 "assms" fact in the proof context. This is more appropriate than the
5115 (historical) "prems", which refers to all assumptions of the current
5116 context, including those from the target locale, proof body etc.
5118 * Isar: 'print_statement' prints theorems from the current theory or
5119 proof context in long statement form, according to the syntax of a
5122 * Isar: 'obtain' takes an optional case name for the local context
5123 introduction rule (default "that").
5125 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
5126 explicit (is "_ ==> ?foo") in the rare cases where this still happens
5129 * Pure: syntax "CONST name" produces a fully internalized constant
5130 according to the current context. This is particularly useful for
5131 syntax translations that should refer to internal constant
5132 representations independently of name spaces.
5134 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
5135 instead of "FOO ". This allows multiple binder declarations to coexist
5136 in the same context. INCOMPATIBILITY.
5138 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
5139 primitive that also works in a locale context (both for constants and
5140 fixed variables). Type declaration and internal syntactic representation
5141 of given constants retrieved from the context. Likewise, the
5142 'no_notation' command allows to remove given syntax annotations from the
5145 * Isar/locales: new derived specification elements 'axiomatization',
5146 'definition', 'abbreviation', which support type-inference, admit
5147 object-level specifications (equality, equivalence). See also the
5148 isar-ref manual. Examples:
5151 eq (infix "===" 50) where
5152 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
5154 definition "f x y = x + y + 1"
5155 definition g where "g x = f x x"
5158 neq (infix "=!=" 50) where
5159 "x =!= y == ~ (x === y)"
5161 These specifications may be also used in a locale context. Then the
5162 constants being introduced depend on certain fixed parameters, and the
5163 constant name is qualified by the locale base name. An internal
5164 abbreviation takes care for convenient input and output, making the
5165 parameters implicit and using the original short name. See also
5166 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
5167 entities from a monomorphic theory.
5169 Presently, abbreviations are only available 'in' a target locale, but
5170 not inherited by general import expressions. Also note that
5171 'abbreviation' may be used as a type-safe replacement for 'syntax' +
5172 'translations' in common applications. The "no_abbrevs" print mode
5173 prevents folding of abbreviations in term output.
5175 Concrete syntax is attached to specified constants in internal form,
5176 independently of name spaces. The parse tree representation is
5177 slightly different -- use 'notation' instead of raw 'syntax', and
5178 'translations' with explicit "CONST" markup to accommodate this.
5180 * Pure/Isar: unified syntax for new-style specification mechanisms
5181 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
5182 full type inference and dummy patterns ("_"). For example:
5184 definition "K x _ = x"
5186 inductive conj for A B
5187 where "A ==> B ==> conj A B"
5189 * Pure: command 'print_abbrevs' prints all constant abbreviations of
5190 the current context. Print mode "no_abbrevs" prevents inversion of
5191 abbreviations on output.
5193 * Isar/locales: improved parameter handling: use of locales "var" and
5194 "struct" no longer necessary; - parameter renamings are no longer
5195 required to be injective. For example, this allows to define
5196 endomorphisms as locale endom = homom mult mult h.
5198 * Isar/locales: changed the way locales with predicates are defined.
5199 Instead of accumulating the specification, the imported expression is
5200 now an interpretation. INCOMPATIBILITY: different normal form of
5201 locale expressions. In particular, in interpretations of locales with
5202 predicates, goals repesenting already interpreted fragments are not
5203 removed automatically. Use methods `intro_locales' and
5204 `unfold_locales'; see below.
5206 * Isar/locales: new methods `intro_locales' and `unfold_locales'
5207 provide backward reasoning on locales predicates. The methods are
5208 aware of interpretations and discharge corresponding goals.
5209 `intro_locales' is less aggressive then `unfold_locales' and does not
5210 unfold predicates to assumptions.
5212 * Isar/locales: the order in which locale fragments are accumulated
5213 has changed. This enables to override declarations from fragments due
5214 to interpretations -- for example, unwanted simp rules.
5216 * Isar/locales: interpretation in theories and proof contexts has been
5217 extended. One may now specify (and prove) equations, which are
5218 unfolded in interpreted theorems. This is useful for replacing
5219 defined concepts (constants depending on locale parameters) by
5220 concepts already existing in the target context. Example:
5222 interpretation partial_order ["op <= :: [int, int] => bool"]
5223 where "partial_order.less (op <=) (x::int) y = (x < y)"
5225 Typically, the constant `partial_order.less' is created by a
5226 definition specification element in the context of locale
5229 * Method "induct": improved internal context management to support
5230 local fixes and defines on-the-fly. Thus explicit meta-level
5231 connectives !! and ==> are rarely required anymore in inductive goals
5232 (using object-logic connectives for this purpose has been long
5233 obsolete anyway). Common proof patterns are explained in
5234 src/HOL/Induct/Common_Patterns.thy, see also
5235 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
5238 * Method "induct": improved handling of simultaneous goals. Instead of
5239 introducing object-level conjunction, the statement is now split into
5240 several conclusions, while the corresponding symbolic cases are nested
5241 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
5242 see src/HOL/Induct/Common_Patterns.thy, for example.
5244 * Method "induct": mutual induction rules are now specified as a list
5245 of rule sharing the same induction cases. HOL packages usually provide
5246 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
5247 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
5248 mutual induction rules differently, i.e. like this:
5250 (induct rule: foo_bar.inducts)
5251 (induct set: foo bar)
5252 (induct pred: foo bar)
5253 (induct type: foo bar)
5255 The ML function ProjectRule.projections turns old-style rules into the
5258 * Method "coinduct": dual of induction, see
5259 src/HOL/Library/Coinductive_List.thy for various examples.
5261 * Method "cases", "induct", "coinduct": the ``(open)'' option is
5262 considered a legacy feature.
5264 * Attribute "symmetric" produces result with standardized schematic
5265 variables (index 0). Potential INCOMPATIBILITY.
5267 * Simplifier: by default the simplifier trace only shows top level
5268 rewrites now. That is, trace_simp_depth_limit is set to 1 by
5269 default. Thus there is less danger of being flooded by the trace. The
5270 trace indicates where parts have been suppressed.
5272 * Provers/classical: removed obsolete classical version of elim_format
5273 attribute; classical elim/dest rules are now treated uniformly when
5274 manipulating the claset.
5276 * Provers/classical: stricter checks to ensure that supplied intro,
5277 dest and elim rules are well-formed; dest and elim rules must have at
5280 * Provers/classical: attributes dest/elim/intro take an optional
5281 weight argument for the rule (just as the Pure versions). Weights are
5282 ignored by automated tools, but determine the search order of single
5285 * Syntax: input syntax now supports dummy variable binding "%_. b",
5286 where the body does not mention the bound variable. Note that dummy
5287 patterns implicitly depend on their context of bounds, which makes
5288 "{_. _}" match any set comprehension as expected. Potential
5289 INCOMPATIBILITY -- parse translations need to cope with syntactic
5290 constant "_idtdummy" in the binding position.
5292 * Syntax: removed obsolete syntactic constant "_K" and its associated
5293 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
5294 for example "A -> B" => "Pi A (%_. B)".
5296 * Pure: 'class_deps' command visualizes the subclass relation, using
5297 the graph browser tool.
5299 * Pure: 'print_theory' now suppresses certain internal declarations by
5300 default; use '!' option for full details.
5305 * Method "metis" proves goals by applying the Metis general-purpose
5306 resolution prover (see also http://gilith.com/software/metis/).
5307 Examples are in the directory MetisExamples. WARNING: the
5308 Isabelle/HOL-Metis integration does not yet work properly with
5311 * Command 'sledgehammer' invokes external automatic theorem provers as
5312 background processes. It generates calls to the "metis" method if
5313 successful. These can be pasted into the proof. Users do not have to
5314 wait for the automatic provers to return. WARNING: does not really
5315 work with multi-threading.
5317 * New "auto_quickcheck" feature tests outermost goal statements for
5318 potential counter-examples. Controlled by ML references
5319 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
5320 5000 milliseconds). Fails silently if statements is outside of
5321 executable fragment, or any other codgenerator problem occurs.
5323 * New constant "undefined" with axiom "undefined x = undefined".
5325 * Added class "HOL.eq", allowing for code generation with polymorphic
5328 * Some renaming of class constants due to canonical name prefixing in
5329 the new 'class' package:
5331 HOL.abs ~> HOL.abs_class.abs
5332 HOL.divide ~> HOL.divide_class.divide
5333 0 ~> HOL.zero_class.zero
5334 1 ~> HOL.one_class.one
5335 op + ~> HOL.plus_class.plus
5336 op - ~> HOL.minus_class.minus
5337 uminus ~> HOL.minus_class.uminus
5338 op * ~> HOL.times_class.times
5339 op < ~> HOL.ord_class.less
5340 op <= > HOL.ord_class.less_eq
5341 Nat.power ~> Power.power_class.power
5342 Nat.size ~> Nat.size_class.size
5343 Numeral.number_of ~> Numeral.number_class.number_of
5344 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
5345 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
5346 Orderings.min ~> Orderings.ord_class.min
5347 Orderings.max ~> Orderings.ord_class.max
5348 Divides.op div ~> Divides.div_class.div
5349 Divides.op mod ~> Divides.div_class.mod
5350 Divides.op dvd ~> Divides.div_class.dvd
5352 INCOMPATIBILITY. Adaptions may be required in the following cases:
5354 a) User-defined constants using any of the names "plus", "minus",
5355 "times", "less" or "less_eq". The standard syntax translations for
5356 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
5359 b) Variables named "plus", "minus", "times", "less", "less_eq"
5360 INCOMPATIBILITY: use more specific names.
5362 c) Permutative equations (e.g. "a + b = b + a")
5363 Since the change of names also changes the order of terms, permutative
5364 rewrite rules may get applied in a different order. Experience shows
5365 that this is rarely the case (only two adaptions in the whole Isabelle
5366 distribution). INCOMPATIBILITY: rewrite proofs
5368 d) ML code directly refering to constant names
5369 This in general only affects hand-written proof tactics, simprocs and
5370 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
5371 Consider using @{const_name} antiquotation.
5373 * New class "default" with associated constant "default".
5375 * Function "sgn" is now overloaded and available on int, real, complex
5376 (and other numeric types), using class "sgn". Two possible defs of
5377 sgn are given as equational assumptions in the classes sgn_if and
5378 sgn_div_norm; ordered_idom now also inherits from sgn_if.
5381 * Locale "partial_order" now unified with class "order" (cf. theory
5382 Orderings), added parameter "less". INCOMPATIBILITY.
5384 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
5385 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
5386 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
5388 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
5389 changed order of proof goals in instance proofs.
5391 * The transitivity reasoner for partial and linear orders is set up
5392 for classes "order" and "linorder". Instances of the reasoner are available
5393 in all contexts importing or interpreting the corresponding locales.
5394 Method "order" invokes the reasoner separately; the reasoner
5395 is also integrated with the Simplifier as a solver. Diagnostic
5396 command 'print_orders' shows the available instances of the reasoner
5397 in the current context.
5399 * Localized monotonicity predicate in theory "Orderings"; integrated
5400 lemmas max_of_mono and min_of_mono with this predicate.
5403 * Formulation of theorem "dense" changed slightly due to integration
5404 with new class dense_linear_order.
5406 * Uniform lattice theory development in HOL.
5408 constants "meet" and "join" now named "inf" and "sup"
5409 constant "Meet" now named "Inf"
5411 classes "meet_semilorder" and "join_semilorder" now named
5412 "lower_semilattice" and "upper_semilattice"
5413 class "lorder" now named "lattice"
5414 class "comp_lat" now named "complete_lattice"
5416 Instantiation of lattice classes allows explicit definitions
5417 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
5419 INCOMPATIBILITY. Theorem renames:
5421 meet_left_le ~> inf_le1
5422 meet_right_le ~> inf_le2
5423 join_left_le ~> sup_ge1
5424 join_right_le ~> sup_ge2
5425 meet_join_le ~> inf_sup_ord
5428 le_meet ~> le_inf_iff
5429 le_join ~> ge_sup_conv
5430 meet_idempotent ~> inf_idem
5431 join_idempotent ~> sup_idem
5432 meet_comm ~> inf_commute
5433 join_comm ~> sup_commute
5434 meet_leI1 ~> le_infI1
5435 meet_leI2 ~> le_infI2
5436 le_joinI1 ~> le_supI1
5437 le_joinI2 ~> le_supI2
5438 meet_assoc ~> inf_assoc
5439 join_assoc ~> sup_assoc
5440 meet_left_comm ~> inf_left_commute
5441 meet_left_idempotent ~> inf_left_idem
5442 join_left_comm ~> sup_left_commute
5443 join_left_idempotent ~> sup_left_idem
5446 le_def_meet ~> le_iff_inf
5447 le_def_join ~> le_iff_sup
5448 join_absorp2 ~> sup_absorb2
5449 join_absorp1 ~> sup_absorb1
5450 meet_absorp1 ~> inf_absorb1
5451 meet_absorp2 ~> inf_absorb2
5452 meet_join_absorp ~> inf_sup_absorb
5453 join_meet_absorp ~> sup_inf_absorb
5454 distrib_join_le ~> distrib_sup_le
5455 distrib_meet_le ~> distrib_inf_le
5457 add_meet_distrib_left ~> add_inf_distrib_left
5458 add_join_distrib_left ~> add_sup_distrib_left
5459 is_join_neg_meet ~> is_join_neg_inf
5460 is_meet_neg_join ~> is_meet_neg_sup
5461 add_meet_distrib_right ~> add_inf_distrib_right
5462 add_join_distrib_right ~> add_sup_distrib_right
5463 add_meet_join_distribs ~> add_sup_inf_distribs
5464 join_eq_neg_meet ~> sup_eq_neg_inf
5465 meet_eq_neg_join ~> inf_eq_neg_sup
5466 add_eq_meet_join ~> add_eq_inf_sup
5467 meet_0_imp_0 ~> inf_0_imp_0
5468 join_0_imp_0 ~> sup_0_imp_0
5469 meet_0_eq_0 ~> inf_0_eq_0
5470 join_0_eq_0 ~> sup_0_eq_0
5471 neg_meet_eq_join ~> neg_inf_eq_sup
5472 neg_join_eq_meet ~> neg_sup_eq_inf
5473 join_eq_if ~> sup_eq_if
5475 mono_meet ~> mono_inf
5476 mono_join ~> mono_sup
5477 meet_bool_eq ~> inf_bool_eq
5478 join_bool_eq ~> sup_bool_eq
5479 meet_fun_eq ~> inf_fun_eq
5480 join_fun_eq ~> sup_fun_eq
5481 meet_set_eq ~> inf_set_eq
5482 join_set_eq ~> sup_set_eq
5483 meet1_iff ~> inf1_iff
5484 meet2_iff ~> inf2_iff
5493 join1_iff ~> sup1_iff
5494 join2_iff ~> sup2_iff
5504 is_meet_Meet ~> is_meet_Inf
5505 Meet_bool_def ~> Inf_bool_def
5506 Meet_fun_def ~> Inf_fun_def
5507 Meet_greatest ~> Inf_greatest
5508 Meet_lower ~> Inf_lower
5509 Meet_set_def ~> Inf_set_def
5512 Sup_bool_eq ~> Sup_bool_def
5513 Sup_fun_eq ~> Sup_fun_def
5514 Sup_set_eq ~> Sup_set_def
5516 listsp_meetI ~> listsp_infI
5517 listsp_meet_eq ~> listsp_inf_eq
5522 * Added syntactic class "size"; overloaded constant "size" now has
5523 type "'a::size ==> bool"
5525 * Internal reorganisation of `size' of datatypes: size theorems
5526 "foo.size" are no longer subsumed by "foo.simps" (but are still
5527 simplification rules by default!); theorems "prod.size" now named
5530 * Class "div" now inherits from class "times" rather than "type".
5533 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
5534 Linorder etc. have disappeared; operations defined in terms of
5535 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
5537 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
5539 * HOL-Word: New extensive library and type for generic, fixed size
5540 machine words, with arithmetic, bit-wise, shifting and rotating
5541 operations, reflection into int, nat, and bool lists, automation for
5542 linear arithmetic (by automatic reflection into nat or int), including
5543 lemmas on overflow and monotonicity. Instantiated to all appropriate
5544 arithmetic type classes, supporting automatic simplification of
5545 numerals on all operations.
5547 * Library/Boolean_Algebra: locales for abstract boolean algebras.
5549 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
5551 * Code generator library theories:
5552 - Code_Integer represents HOL integers by big integer literals in target
5554 - Code_Char represents HOL characters by character literals in target
5556 - Code_Char_chr like Code_Char, but also offers treatment of character
5557 codes; includes Code_Integer.
5558 - Executable_Set allows to generate code for finite sets using lists.
5559 - Executable_Rat implements rational numbers as triples (sign, enumerator,
5561 - Executable_Real implements a subset of real numbers, namly those
5562 representable by rational numbers.
5563 - Efficient_Nat implements natural numbers by integers, which in general will
5564 result in higher efficency; pattern matching with 0/Suc is eliminated;
5565 includes Code_Integer.
5566 - Code_Index provides an additional datatype index which is mapped to
5567 target-language built-in integers.
5568 - Code_Message provides an additional datatype message_string which is isomorphic to
5569 strings; messages are mapped to target-language strings.
5571 * New package for inductive predicates
5573 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
5576 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5577 for z_1 :: U_1 and ... and z_n :: U_m
5579 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5582 with full support for type-inference, rather than
5584 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5586 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5587 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5589 inductive "s z_1 ... z_m"
5591 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5594 For backward compatibility, there is a wrapper allowing inductive
5595 sets to be defined with the new package via
5598 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5599 for z_1 :: U_1 and ... and z_n :: U_m
5601 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5607 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5608 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5609 for z_1 :: U_1 and ... and z_n :: U_m
5611 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5612 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5615 if the additional syntax "p ..." is required.
5617 Numerous examples can be found in the subdirectories src/HOL/Auth,
5618 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
5622 - Since declaration and definition of inductive sets or predicates
5623 is no longer separated, abbreviations involving the newly
5624 introduced sets or predicates must be specified together with the
5625 introduction rules after the 'where' keyword (see above), rather
5626 than before the actual inductive definition.
5628 - The variables in induction and elimination rules are now
5629 quantified in the order of their occurrence in the introduction
5630 rules, rather than in alphabetical order. Since this may break
5631 some proofs, these proofs either have to be repaired, e.g. by
5632 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
5633 statements of the form
5635 case (rule_i a_i_1 ... a_i_{k_i})
5637 or the old order of quantification has to be restored by explicitly adding
5638 meta-level quantifiers in the introduction rules, i.e.
5640 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
5642 - The format of the elimination rules is now
5644 p z_1 ... z_m x_1 ... x_n ==>
5645 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5650 (x_1, ..., x_n) : s z_1 ... z_m ==>
5651 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5654 for sets rather than
5656 x : s z_1 ... z_m ==>
5657 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
5660 This may require terms in goals to be expanded to n-tuples
5661 (e.g. using case_tac or simplification with the split_paired_all
5662 rule) before the above elimination rule is applicable.
5664 - The elimination or case analysis rules for (mutually) inductive
5665 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
5666 list of rules "p_1_..._p_k.elims" is no longer available.
5668 * New package "function"/"fun" for general recursive functions,
5669 supporting mutual and nested recursion, definitions in local contexts,
5670 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
5671 for small examples, and the separate tutorial on the function
5672 package. The old recdef "package" is still available as before, but
5673 users are encouraged to use the new package.
5675 * Method "lexicographic_order" automatically synthesizes termination
5676 relations as lexicographic combinations of size measures.
5678 * Case-expressions allow arbitrary constructor-patterns (including
5679 "_") and take their order into account, like in functional
5680 programming. Internally, this is translated into nested
5681 case-expressions; missing cases are added and mapped to the predefined
5682 constant "undefined". In complicated cases printing may no longer show
5683 the original input but the internal form. Lambda-abstractions allow
5684 the same form of pattern matching: "% pat1 => e1 | ..." is an
5685 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
5688 * IntDef: The constant "int :: nat => int" has been removed; now "int"
5689 is an abbreviation for "of_nat :: nat => int". The simplification
5690 rules for "of_nat" have been changed to work like "int" did
5691 previously. Potential INCOMPATIBILITY:
5692 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
5693 - of_nat_diff and of_nat_mult are no longer default simp rules
5695 * Method "algebra" solves polynomial equations over (semi)rings using
5696 Groebner bases. The (semi)ring structure is defined by locales and the
5697 tool setup depends on that generic context. Installing the method for
5698 a specific type involves instantiating the locale and possibly adding
5699 declarations for computation on the coefficients. The method is
5700 already instantiated for natural numbers and for the axiomatic class
5701 of idoms with numerals. See also the paper by Chaieb and Wenzel at
5702 CALCULEMUS 2007 for the general principles underlying this
5703 architecture of context-aware proof-tools.
5705 * Method "ferrack" implements quantifier elimination over
5706 special-purpose dense linear orders using locales (analogous to
5707 "algebra"). The method is already installed for class
5708 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
5711 * Former constant "List.op @" now named "List.append". Use ML
5712 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
5713 circumvent possible incompatibilities when working on ML level.
5715 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
5717 * New function listsum :: 'a list => 'a for arbitrary monoids.
5718 Special syntax: "SUM x <- xs. f x" (and latex variants)
5720 * New syntax for Haskell-like list comprehension (input only), eg.
5721 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
5723 * The special syntax for function "filter" has changed from [x :
5724 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
5725 comprehension syntax, and for uniformity. INCOMPATIBILITY.
5727 * [a..b] is now defined for arbitrary linear orders. It used to be
5728 defined on nat only, as an abbreviation for [a..<Suc b]
5731 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
5733 * New functions "sorted" and "sort" in src/HOL/List.thy.
5735 * New lemma collection field_simps (an extension of ring_simps) for
5736 manipulating (in)equations involving division. Multiplies with all
5737 denominators that can be proved to be non-zero (in equations) or
5738 positive/negative (in inequations).
5740 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
5741 have been improved and renamed to ring_simps, group_simps and
5742 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
5743 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
5745 * Theory Library/Commutative_Ring: switched from recdef to function
5746 package; constants add, mul, pow now curried. Infix syntax for
5747 algebraic operations.
5749 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
5752 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
5755 * HOL/records: generalised field-update to take a function on the
5756 field rather than the new value: r(|A := x|) is translated to A_update
5757 (K x) r The K-combinator that is internally used is called K_record.
5758 INCOMPATIBILITY: Usage of the plain update functions has to be
5761 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
5762 * x = 0, which are required for a semiring. Richer structures do not
5763 inherit from semiring_0 anymore, because this property is a theorem
5764 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
5765 there is more to prove, but this is mostly trivial.
5767 * Class "recpower" is generalized to arbitrary monoids, not just
5768 commutative semirings. INCOMPATIBILITY: may need to incorporate
5769 commutativity or semiring properties additionally.
5771 * Constant "List.list_all2" in List.thy now uses authentic syntax.
5772 INCOMPATIBILITY: translations containing list_all2 may go wrong,
5773 better use 'abbreviation'.
5775 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
5777 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
5778 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
5779 significant changes for setting up numeral syntax for types:
5780 - New constants Numeral.pred and Numeral.succ instead
5781 of former Numeral.bin_pred and Numeral.bin_succ.
5782 - Use integer operations instead of bin_add, bin_mult and so on.
5783 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
5784 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
5786 See src/HOL/Integ/IntArith.thy for an example setup.
5788 * Command 'normal_form' computes the normal form of a term that may
5789 contain free variables. For example ``normal_form "rev [a, b, c]"''
5790 produces ``[b, c, a]'' (without proof). This command is suitable for
5791 heavy-duty computations because the functions are compiled to ML
5792 first. Correspondingly, a method "normalization" is provided. See
5793 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
5795 * Alternative iff syntax "A <-> B" for equality on bool (with priority
5796 25 like -->); output depends on the "iff" print_mode, the default is
5797 "A = B" (with priority 50).
5799 * Relations less (<) and less_eq (<=) are also available on type bool.
5800 Modified syntax to disallow nesting without explicit parentheses,
5801 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
5804 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
5806 * Relation composition operator "op O" now has precedence 75 and binds
5807 stronger than union and intersection. INCOMPATIBILITY.
5809 * The old set interval syntax "{m..n(}" (and relatives) has been
5810 removed. Use "{m..<n}" (and relatives) instead.
5812 * In the context of the assumption "~(s = t)" the Simplifier rewrites
5813 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
5814 ``declare [[simproc del: neq]]''.
5816 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
5819 * Theorem Cons_eq_map_conv no longer declared as "simp".
5821 * Theorem setsum_mult renamed to setsum_right_distrib.
5823 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
5826 * Reimplemented methods "sat" and "satx", with several improvements:
5827 goals no longer need to be stated as "<prems> ==> False", equivalences
5828 (i.e. "=" on type bool) are handled, variable names of the form
5829 "lit_<n>" are no longer reserved, significant speedup.
5831 * Methods "sat" and "satx" can now replay MiniSat proof traces.
5832 zChaff is still supported as well.
5834 * 'inductive' and 'datatype': provide projections of mutual rules,
5835 bundled as foo_bar.inducts;
5837 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
5840 * Library: moved theory Accessible_Part to main HOL.
5842 * Library: added theory Coinductive_List of potentially infinite lists
5843 as greatest fixed-point.
5845 * Library: added theory AssocList which implements (finite) maps as
5848 * Method "evaluation" solves goals (i.e. a boolean expression)
5849 efficiently by compiling it to ML. The goal is "proved" (via an
5850 oracle) if it evaluates to True.
5852 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
5853 also when invoked by the simplifier. This results in the Simplifier
5854 being more powerful on arithmetic goals. INCOMPATIBILITY.
5855 Configuration option fast_arith_split_limit=0 recovers the old
5858 * Support for hex (0x20) and binary (0b1001) numerals.
5860 * New method: reify eqs (t), where eqs are equations for an
5861 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
5862 parameter, computes a term s::'b and a list xs::'a list and proves the
5863 theorem I xs s = t. This is also known as reification or quoting. The
5864 resulting theorem is applied to the subgoal to substitute t with I xs
5865 s. If t is omitted, the subgoal itself is reified.
5867 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
5868 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
5869 where f is supposed to be a computable function (in the sense of code
5870 generattion). The method uses reify to compute s and xs as above then
5871 applies corr_thm and uses normalization by evaluation to "prove" f s =
5872 r and finally gets the theorem t = r, which is again applied to the
5873 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
5875 * Reflection: Automatic reification now handels binding, an example is
5876 available in src/HOL/ex/ReflectionEx.thy
5878 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
5879 command 'statespace' that is similar to 'record', but introduces an
5880 abstract specification based on the locale infrastructure instead of
5881 HOL types. This leads to extra flexibility in composing state spaces,
5882 in particular multiple inheritance and renaming of components.
5887 * Hyperreal: Functions root and sqrt are now defined on negative real
5888 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
5889 Nonnegativity side conditions have been removed from many lemmas, so
5890 that more subgoals may now be solved by simplification; potential
5893 * Real: new type classes formalize real normed vector spaces and
5894 algebras, using new overloaded constants scaleR :: real => 'a => 'a
5895 and norm :: 'a => real.
5897 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
5898 reals into other types. The overloaded constant Reals :: 'a set is now
5899 defined as range of_real; potential INCOMPATIBILITY.
5901 * Real: proper support for ML code generation, including 'quickcheck'.
5902 Reals are implemented as arbitrary precision rationals.
5904 * Hyperreal: Several constants that previously worked only for the
5905 reals have been generalized, so they now work over arbitrary vector
5906 spaces. Type annotations may need to be added in some cases; potential
5909 Infinitesimal :: ('a::real_normed_vector) star set
5910 HFinite :: ('a::real_normed_vector) star set
5911 HInfinite :: ('a::real_normed_vector) star set
5912 approx :: ('a::real_normed_vector) star => 'a star => bool
5913 monad :: ('a::real_normed_vector) star => 'a star set
5914 galaxy :: ('a::real_normed_vector) star => 'a star set
5915 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
5916 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
5917 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
5918 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
5919 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
5920 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
5921 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
5922 sgn :: 'a::real_normed_vector => 'a
5923 exp :: 'a::{recpower,real_normed_field,banach} => 'a
5925 * Complex: Some complex-specific constants are now abbreviations for
5926 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
5927 hnorm. Other constants have been entirely removed in favor of the
5928 polymorphic versions (INCOMPATIBILITY):
5932 HInfinite <-- CInfinite
5933 Infinitesimal <-- CInfinitesimal
5936 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
5937 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
5938 (ns)deriv <-- (ns)cderiv
5943 * Formalisation of ideals and the quotient construction over rings.
5945 * Order and lattice theory no longer based on records.
5948 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
5949 greatest_closed. INCOMPATIBILITY.
5951 * Method algebra is now set up via an attribute. For examples see
5952 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
5953 of algebraic structures.
5955 * Renamed theory CRing to Ring.
5960 * Substantial, yet incomplete support for nominal datatypes (binding
5961 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
5962 src/HOL/Nominal/Examples. Prospective users should consult
5963 http://isabelle.in.tum.de/nominal/
5968 * ML basics: just one true type int, which coincides with IntInf.int
5971 * ML within Isar: antiquotations allow to embed statically-checked
5972 formal entities in the source, referring to the context available at
5973 compile-time. For example:
5975 ML {* @{sort "{zero,one}"} *}
5976 ML {* @{typ "'a => 'b"} *}
5977 ML {* @{term "%x. x"} *}
5978 ML {* @{prop "x == y"} *}
5979 ML {* @{ctyp "'a => 'b"} *}
5980 ML {* @{cterm "%x. x"} *}
5981 ML {* @{cprop "x == y"} *}
5982 ML {* @{thm asm_rl} *}
5983 ML {* @{thms asm_rl} *}
5984 ML {* @{type_name c} *}
5985 ML {* @{type_syntax c} *}
5986 ML {* @{const_name c} *}
5987 ML {* @{const_syntax c} *}
5990 ML {* @{theory Pure} *}
5991 ML {* @{theory_ref} *}
5992 ML {* @{theory_ref Pure} *}
5995 ML {* @{clasimpset} *}
5997 The same works for sources being ``used'' within an Isar context.
5999 * ML in Isar: improved error reporting; extra verbosity with
6000 ML_Context.trace enabled.
6002 * Pure/General/table.ML: the join operations now works via exceptions
6003 DUP/SAME instead of type option. This is simpler in simple cases, and
6004 admits slightly more efficient complex applications.
6006 * Pure: 'advanced' translation functions (parse_translation etc.) now
6007 use Context.generic instead of just theory.
6009 * Pure: datatype Context.generic joins theory/Proof.context and
6010 provides some facilities for code that works in either kind of
6011 context, notably GenericDataFun for uniform theory and proof data.
6013 * Pure: simplified internal attribute type, which is now always
6014 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
6015 local (Proof.context) attributes have been discontinued, while
6016 minimizing code duplication. Thm.rule_attribute and
6017 Thm.declaration_attribute build canonical attributes; see also structure
6018 Context for further operations on Context.generic, notably
6019 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
6020 declarations and definitions.
6022 * Context data interfaces (Theory/Proof/GenericDataFun): removed
6023 name/print, uninitialized data defaults to ad-hoc copy of empty value,
6024 init only required for impure data. INCOMPATIBILITY: empty really need
6025 to be empty (no dependencies on theory content!)
6027 * Pure/kernel: consts certification ignores sort constraints given in
6028 signature declarations. (This information is not relevant to the
6029 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
6030 potential INCOMPATIBILITY.
6032 * Pure: axiomatic type classes are now purely definitional, with
6033 explicit proofs of class axioms and super class relations performed
6034 internally. See Pure/axclass.ML for the main internal interfaces --
6035 notably AxClass.define_class supercedes AxClass.add_axclass, and
6036 AxClass.axiomatize_class/classrel/arity supersede
6037 Sign.add_classes/classrel/arities.
6039 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
6040 global/local versions on theory vs. Proof.context have been
6041 discontinued; Attrib.syntax and Method.syntax have been adapted
6042 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
6043 attributes, methods, etc.
6045 * Pure: several functions of signature "... -> theory -> theory * ..."
6046 have been reoriented to "... -> theory -> ... * theory" in order to
6047 allow natural usage in combination with the ||>, ||>>, |-> and
6048 fold_map combinators.
6050 * Pure: official theorem names (closed derivations) and additional
6051 comments (tags) are now strictly separate. Name hints -- which are
6052 maintained as tags -- may be attached any time without affecting the
6055 * Pure: primitive rule lift_rule now takes goal cterm instead of an
6056 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
6057 achieve the old behaviour.
6059 * Pure: the "Goal" constant is now called "prop", supporting a
6060 slightly more general idea of ``protecting'' meta-level rule
6063 * Pure: Logic.(un)varify only works in a global context, which is now
6064 enforced instead of silently assumed. INCOMPATIBILITY, may use
6065 Logic.legacy_(un)varify as temporary workaround.
6067 * Pure: structure Name provides scalable operations for generating
6068 internal variable names, notably Name.variants etc. This replaces
6069 some popular functions from term.ML:
6071 Term.variant -> Name.variant
6072 Term.variantlist -> Name.variant_list
6073 Term.invent_names -> Name.invent_list
6075 Note that low-level renaming rarely occurs in new code -- operations
6076 from structure Variable are used instead (see below).
6078 * Pure: structure Variable provides fundamental operations for proper
6079 treatment of fixed/schematic variables in a context. For example,
6080 Variable.import introduces fixes for schematics of given facts and
6081 Variable.export reverses the effect (up to renaming) -- this replaces
6082 various freeze_thaw operations.
6084 * Pure: structure Goal provides simple interfaces for
6085 init/conclude/finish and tactical prove operations (replacing former
6086 Tactic.prove). Goal.prove is the canonical way to prove results
6087 within a given context; Goal.prove_global is a degraded version for
6088 theory level goals, including a global Drule.standard. Note that
6089 OldGoals.prove_goalw_cterm has long been obsolete, since it is
6090 ill-behaved in a local proof context (e.g. with local fixes/assumes or
6091 in a locale context).
6093 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
6094 and type checking (Syntax.check_term etc.), with common combinations
6095 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
6096 which are considered legacy and await removal.
6098 * Pure/Syntax: generic interfaces for type unchecking
6099 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
6100 with common combinations (Syntax.pretty_term, Syntax.string_of_term
6101 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
6102 available for convenience, but refer to the very same operations using
6103 a mere theory instead of a full context.
6105 * Isar: simplified treatment of user-level errors, using exception
6106 ERROR of string uniformly. Function error now merely raises ERROR,
6107 without any side effect on output channels. The Isar toplevel takes
6108 care of proper display of ERROR exceptions. ML code may use plain
6109 handle/can/try; cat_error may be used to concatenate errors like this:
6111 ... handle ERROR msg => cat_error msg "..."
6113 Toplevel ML code (run directly or through the Isar toplevel) may be
6114 embedded into the Isar toplevel with exception display/debug like
6117 Isar.toplevel (fn () => ...)
6119 INCOMPATIBILITY, removed special transform_error facilities, removed
6120 obsolete variants of user-level exceptions (ERROR_MESSAGE,
6121 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
6122 -- use plain ERROR instead.
6124 * Isar: theory setup now has type (theory -> theory), instead of a
6125 list. INCOMPATIBILITY, may use #> to compose setup functions.
6127 * Isar: ML toplevel pretty printer for type Proof.context, subject to
6128 ProofContext.debug/verbose flags.
6130 * Isar: Toplevel.theory_to_proof admits transactions that modify the
6131 theory before entering a proof state. Transactions now always see a
6132 quasi-functional intermediate checkpoint, both in interactive and
6135 * Isar: simplified interfaces for outer syntax. Renamed
6136 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
6137 OuterSyntax.add_parsers -- this functionality is now included in
6138 OuterSyntax.command etc. INCOMPATIBILITY.
6140 * Simplifier: the simpset of a running simplification process now
6141 contains a proof context (cf. Simplifier.the_context), which is the
6142 very context that the initial simpset has been retrieved from (by
6143 simpset_of/local_simpset_of). Consequently, all plug-in components
6144 (solver, looper etc.) may depend on arbitrary proof data.
6146 * Simplifier.inherit_context inherits the proof context (plus the
6147 local bounds) of the current simplification process; any simproc
6148 etc. that calls the Simplifier recursively should do this! Removed
6149 former Simplifier.inherit_bounds, which is already included here --
6150 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
6151 specify an explicit context using Simplifier.context/theory_context.
6153 * Simplifier/Classical Reasoner: more abstract interfaces
6154 change_simpset/claset for modifying the simpset/claset reference of a
6155 theory; raw versions simpset/claset_ref etc. have been discontinued --
6158 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
6164 * settings: the default heap location within ISABELLE_HOME_USER now
6165 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
6166 Isabelle installations.
6168 * isabelle-process: option -S (secure mode) disables some critical
6169 operations, notably runtime compilation and evaluation of ML source
6172 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
6174 * Support for parallel execution, using native multicore support of
6175 Poly/ML 5.1. The theory loader exploits parallelism when processing
6176 independent theories, according to the given theory header
6177 specifications. The maximum number of worker threads is specified via
6178 usedir option -M or the "max-threads" setting in Proof General. A
6179 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
6180 to 6 on a 8-core machine. User-code needs to observe certain
6181 guidelines for thread-safe programming, see appendix A in the Isar
6182 Implementation manual.
6186 New in Isabelle2005 (October 2005)
6187 ----------------------------------
6191 * Theory headers: the new header syntax for Isar theories is
6194 imports <theory1> ... <theoryN>
6195 uses <file1> ... <fileM>
6198 where the 'uses' part is optional. The previous syntax
6200 theory <name> = <theory1> + ... + <theoryN>:
6202 will disappear in the next release. Use isatool fixheaders to convert
6203 existing theory files. Note that there is no change in ancient
6204 non-Isar theories now, but these will disappear soon.
6206 * Theory loader: parent theories can now also be referred to via
6207 relative and absolute paths.
6209 * Command 'find_theorems' searches for a list of criteria instead of a
6210 list of constants. Known criteria are: intro, elim, dest, name:string,
6211 simp:term, and any term. Criteria can be preceded by '-' to select
6212 theorems that do not match. Intro, elim, dest select theorems that
6213 match the current goal, name:s selects theorems whose fully qualified
6214 name contain s, and simp:term selects all simplification rules whose
6215 lhs match term. Any other term is interpreted as pattern and selects
6216 all theorems matching the pattern. Available in ProofGeneral under
6217 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
6219 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
6221 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
6222 matching the current goal as introduction rule and not having "HOL."
6223 in their name (i.e. not being defined in theory HOL).
6225 * Command 'thms_containing' has been discontinued in favour of
6226 'find_theorems'; INCOMPATIBILITY.
6228 * Communication with Proof General is now 8bit clean, which means that
6229 Unicode text in UTF-8 encoding may be used within theory texts (both
6230 formal and informal parts). Cf. option -U of the Isabelle Proof
6231 General interface. Here are some simple examples (cf. src/HOL/ex):
6233 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
6234 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
6236 * Improved efficiency of the Simplifier and, to a lesser degree, the
6237 Classical Reasoner. Typical big applications run around 2 times
6241 *** Document preparation ***
6243 * Commands 'display_drafts' and 'print_drafts' perform simple output
6244 of raw sources. Only those symbols that do not require additional
6245 LaTeX packages (depending on comments in isabellesym.sty) are
6246 displayed properly, everything else is left verbatim. isatool display
6247 and isatool print are used as front ends (these are subject to the
6248 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
6250 * Command tags control specific markup of certain regions of text,
6251 notably folding and hiding. Predefined tags include "theory" (for
6252 theory begin and end), "proof" for proof commands, and "ML" for
6253 commands involving ML code; the additional tags "visible" and
6254 "invisible" are unused by default. Users may give explicit tag
6255 specifications in the text, e.g. ''by %invisible (auto)''. The
6256 interpretation of tags is determined by the LaTeX job during document
6257 preparation: see option -V of isatool usedir, or options -n and -t of
6258 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
6261 Several document versions may be produced at the same time via isatool
6262 usedir (the generated index.html will link all of them). Typical
6263 specifications include ''-V document=theory,proof,ML'' to present
6264 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
6265 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
6266 these parts without any formal replacement text. The Isabelle site
6267 default settings produce ''document'' and ''outline'' versions as
6270 * Several new antiquotations:
6272 @{term_type term} prints a term with its type annotated;
6274 @{typeof term} prints the type of a term;
6276 @{const const} is the same as @{term const}, but checks that the
6277 argument is a known logical constant;
6279 @{term_style style term} and @{thm_style style thm} print a term or
6280 theorem applying a "style" to it
6284 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
6285 definitions, equations, inequations etc., 'concl' printing only the
6286 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
6287 to print the specified premise. TermStyle.add_style provides an ML
6288 interface for introducing further styles. See also the "LaTeX Sugar"
6289 document practical applications. The ML antiquotation prints
6290 type-checked ML expressions verbatim.
6292 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
6293 and 'text' support optional locale specification '(in loc)', which
6294 specifies the default context for interpreting antiquotations. For
6295 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
6297 * Option 'locale=NAME' of antiquotations specifies an alternative
6298 context interpreting the subsequent argument. For example: @{thm
6299 [locale=lattice] inf_assoc}.
6301 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
6304 * Proper output of antiquotations for theory commands involving a
6305 proof context (such as 'locale' or 'theorem (in loc) ...').
6307 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
6308 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
6310 * isatool usedir: new option -C (default true) controls whether option
6311 -D should include a copy of the original document directory; -C false
6312 prevents unwanted effects such as copying of administrative CVS data.
6317 * Considerably improved version of 'constdefs' command. Now performs
6318 automatic type-inference of declared constants; additional support for
6319 local structure declarations (cf. locales and HOL records), see also
6320 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
6321 sequential dependencies of definitions within a single 'constdefs'
6322 section; moreover, the declared name needs to be an identifier. If
6323 all fails, consider to fall back on 'consts' and 'defs' separately.
6325 * Improved indexed syntax and implicit structures. First of all,
6326 indexed syntax provides a notational device for subscripted
6327 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
6328 expressions. Secondly, in a local context with structure
6329 declarations, number indexes \<^sub>n or the empty index (default
6330 number 1) refer to a certain fixed variable implicitly; option
6331 show_structs controls printing of implicit structures. Typical
6332 applications of these concepts involve record types and locales.
6334 * New command 'no_syntax' removes grammar declarations (and
6335 translations) resulting from the given syntax specification, which is
6336 interpreted in the same manner as for the 'syntax' command.
6338 * 'Advanced' translation functions (parse_translation etc.) may depend
6339 on the signature of the theory context being presently used for
6340 parsing/printing, see also isar-ref manual.
6342 * Improved 'oracle' command provides a type-safe interface to turn an
6343 ML expression of type theory -> T -> term into a primitive rule of
6344 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
6345 is already included here); see also FOL/ex/IffExample.thy;
6348 * axclass: name space prefix for class "c" is now "c_class" (was "c"
6349 before); "cI" is no longer bound, use "c.intro" instead.
6350 INCOMPATIBILITY. This change avoids clashes of fact bindings for
6351 axclasses vs. locales.
6353 * Improved internal renaming of symbolic identifiers -- attach primes
6354 instead of base 26 numbers.
6356 * New flag show_question_marks controls printing of leading question
6357 marks in schematic variable names.
6359 * In schematic variable names, *any* symbol following \<^isub> or
6360 \<^isup> is now treated as part of the base name. For example, the
6361 following works without printing of awkward ".0" indexes:
6363 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
6366 * Inner syntax includes (*(*nested*) comments*).
6368 * Pretty printer now supports unbreakable blocks, specified in mixfix
6369 annotations as "(00...)".
6371 * Clear separation of logical types and nonterminals, where the latter
6372 may only occur in 'syntax' specifications or type abbreviations.
6373 Before that distinction was only partially implemented via type class
6374 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
6375 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
6376 exotic syntax specifications may require further adaption
6377 (e.g. Cube/Cube.thy).
6379 * Removed obsolete type class "logic", use the top sort {} instead.
6380 Note that non-logical types should be declared as 'nonterminals'
6381 rather than 'types'. INCOMPATIBILITY for new object-logic
6384 * Attributes 'induct' and 'cases': type or set names may now be
6385 locally fixed variables as well.
6387 * Simplifier: can now control the depth to which conditional rewriting
6388 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
6391 * Simplifier: simplification procedures may now take the current
6392 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
6393 interface), which is very useful for calling the Simplifier
6394 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
6395 is gone -- use prems_of_ss on the simpset instead. Moreover, the
6396 low-level mk_simproc no longer applies Logic.varify internally, to
6397 allow for use in a context of fixed variables.
6399 * thin_tac now works even if the assumption being deleted contains !!
6400 or ==>. More generally, erule now works even if the major premise of
6401 the elimination rule contains !! or ==>.
6403 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
6405 * Reorganized bootstrapping of the Pure theories; CPure is now derived
6406 from Pure, which contains all common declarations already. Both
6407 theories are defined via plain Isabelle/Isar .thy files.
6408 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
6409 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
6410 use isatool fixcpure to adapt your theory and ML sources.
6412 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
6413 selections of theorems in named facts via index ranges.
6415 * 'print_theorems': in theory mode, really print the difference
6416 wrt. the last state (works for interactive theory development only),
6417 in proof mode print all local facts (cf. 'print_facts');
6419 * 'hide': option '(open)' hides only base names.
6421 * More efficient treatment of intermediate checkpoints in interactive
6424 * Code generator is now invoked via code_module (incremental code
6425 generation) and code_library (modular code generation, ML structures
6426 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
6427 must be quoted when used as identifiers.
6429 * New 'value' command for reading, evaluating and printing terms using
6430 the code generator. INCOMPATIBILITY: command keyword 'value' must be
6431 quoted when used as identifier.
6436 * New commands for the interpretation of locale expressions in
6437 theories (1), locales (2) and proof contexts (3). These generate
6438 proof obligations from the expression specification. After the
6439 obligations have been discharged, theorems of the expression are added
6440 to the theory, target locale or proof context. The synopsis of the
6441 commands is a follows:
6443 (1) interpretation expr inst
6444 (2) interpretation target < expr
6445 (3) interpret expr inst
6447 Interpretation in theories and proof contexts require a parameter
6448 instantiation of terms from the current context. This is applied to
6449 specifications and theorems of the interpreted expression.
6450 Interpretation in locales only permits parameter renaming through the
6451 locale expression. Interpretation is smart in that interpretations
6452 that are active already do not occur in proof obligations, neither are
6453 instantiated theorems stored in duplicate. Use 'print_interps' to
6454 inspect active interpretations of a particular locale. For details,
6455 see the Isar Reference manual. Examples can be found in
6456 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
6458 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
6459 'interpret' instead.
6461 * New context element 'constrains' for adding type constraints to
6464 * Context expressions: renaming of parameters with syntax
6467 * Locale declaration: 'includes' disallowed.
6469 * Proper static binding of attribute syntax -- i.e. types / terms /
6470 facts mentioned as arguments are always those of the locale definition
6471 context, independently of the context of later invocations. Moreover,
6472 locale operations (renaming and type / term instantiation) are applied
6473 to attribute arguments as expected.
6475 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
6476 actual attributes; rare situations may require Attrib.attribute to
6477 embed those attributes into Attrib.src that lack concrete syntax.
6478 Attribute implementations need to cooperate properly with the static
6479 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
6480 Attrib.XXX_thm etc. already do the right thing without further
6481 intervention. Only unusual applications -- such as "where" or "of"
6482 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
6483 on the context and the facts involved -- may have to assign parsed
6484 values to argument tokens explicitly.
6486 * Changed parameter management in theorem generation for long goal
6487 statements with 'includes'. INCOMPATIBILITY: produces a different
6488 theorem statement in rare situations.
6490 * Locale inspection command 'print_locale' omits notes elements. Use
6491 'print_locale!' to have them included in the output.
6496 * Provers/hypsubst.ML: improved version of the subst method, for
6497 single-step rewriting: it now works in bound variable contexts. New is
6498 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
6499 rewrite a different subterm than the original subst method, which is
6500 still available as 'simplesubst'.
6502 * Provers/quasi.ML: new transitivity reasoners for transitivity only
6505 * Provers/trancl.ML: new transitivity reasoner for transitive and
6506 reflexive-transitive closure of relations.
6508 * Provers/blast.ML: new reference depth_limit to make blast's depth
6509 limit (previously hard-coded with a value of 20) user-definable.
6511 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
6512 is peformed already. Object-logics merely need to finish their
6513 initial simpset configuration as before. INCOMPATIBILITY.
6518 * Symbolic syntax of Hilbert Choice Operator is now as follows:
6521 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
6523 The symbol \<some> is displayed as the alternative epsilon of LaTeX
6524 and x-symbol; use option '-m epsilon' to get it actually printed.
6525 Moreover, the mathematically important symbolic identifier \<epsilon>
6526 becomes available as variable, constant etc. INCOMPATIBILITY,
6528 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
6529 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
6530 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
6531 support corresponding Isar calculations.
6533 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
6536 * theory SetInterval: changed the syntax for open intervals:
6545 The old syntax is still supported but will disappear in the next
6546 release. For conversion use the following Emacs search and replace
6547 patterns (these are not perfect but work quite well):
6549 {)\([^\.]*\)\.\. -> {\1<\.\.}
6550 \.\.\([^(}]*\)(} -> \.\.<\1}
6552 * Theory Commutative_Ring (in Library): method comm_ring for proving
6553 equalities in commutative rings; method 'algebra' provides a generic
6556 * Theory Finite_Set: changed the syntax for 'setsum', summation over
6557 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
6558 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
6561 Some new syntax forms are available:
6563 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
6564 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
6565 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
6566 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
6568 The latter form "\<Sum>x < k. e" used to be based on a separate
6569 function "Summation", which has been discontinued.
6571 * theory Finite_Set: in structured induction proofs, the insert case
6572 is now 'case (insert x F)' instead of the old counterintuitive 'case
6575 * The 'refute' command has been extended to support a much larger
6576 fragment of HOL, including axiomatic type classes, constdefs and
6577 typedefs, inductive datatypes and recursion.
6579 * New tactics 'sat' and 'satx' to prove propositional tautologies.
6580 Requires zChaff with proof generation to be installed. See
6581 HOL/ex/SAT_Examples.thy for examples.
6583 * Datatype induction via method 'induct' now preserves the name of the
6584 induction variable. For example, when proving P(xs::'a list) by
6585 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
6586 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
6587 in unstructured proof scripts.
6589 * Reworked implementation of records. Improved scalability for
6590 records with many fields, avoiding performance problems for type
6591 inference. Records are no longer composed of nested field types, but
6592 of nested extension types. Therefore the record type only grows linear
6593 in the number of extensions and not in the number of fields. The
6594 top-level (users) view on records is preserved. Potential
6595 INCOMPATIBILITY only in strange cases, where the theory depends on the
6596 old record representation. The type generated for a record is called
6597 <record_name>_ext_type.
6599 Flag record_quick_and_dirty_sensitive can be enabled to skip the
6600 proofs triggered by a record definition or a simproc (if
6601 quick_and_dirty is enabled). Definitions of large records can take
6604 New simproc record_upd_simproc for simplification of multiple record
6605 updates enabled by default. Moreover, trivial updates are also
6606 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
6607 occasionally, since simplification is more powerful by default.
6609 * typedef: proper support for polymorphic sets, which contain extra
6610 type-variables in the term.
6612 * Simplifier: automatically reasons about transitivity chains
6613 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
6614 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
6615 old proofs break occasionally as simplification may now solve more
6616 goals than previously.
6618 * Simplifier: converts x <= y into x = y if assumption y <= x is
6619 present. Works for all partial orders (class "order"), in particular
6620 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
6623 * Simplifier: new simproc for "let x = a in f x". If a is a free or
6624 bound variable or a constant then the let is unfolded. Otherwise
6625 first a is simplified to b, and then f b is simplified to g. If
6626 possible we abstract b from g arriving at "let x = b in h x",
6627 otherwise we unfold the let and arrive at g. The simproc can be
6628 enabled/disabled by the reference use_let_simproc. Potential
6629 INCOMPATIBILITY since simplification is more powerful by default.
6631 * Classical reasoning: the meson method now accepts theorems as arguments.
6633 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
6634 jobs to provide advice on the provability of subgoals.
6636 * Theory OrderedGroup and Ring_and_Field: various additions and
6637 improvements to faciliate calculations involving equalities and
6640 The following theorems have been eliminated or modified
6643 abs_eq now named abs_of_nonneg
6644 abs_of_ge_0 now named abs_of_nonneg
6645 abs_minus_eq now named abs_of_nonpos
6646 imp_abs_id now named abs_of_nonneg
6647 imp_abs_neg_id now named abs_of_nonpos
6648 mult_pos now named mult_pos_pos
6649 mult_pos_le now named mult_nonneg_nonneg
6650 mult_pos_neg_le now named mult_nonneg_nonpos
6651 mult_pos_neg2_le now named mult_nonneg_nonpos2
6652 mult_neg now named mult_neg_neg
6653 mult_neg_le now named mult_nonpos_nonpos
6655 * The following lemmas in Ring_and_Field have been added to the simplifier:
6658 not_square_less_zero
6660 The following lemmas have been deleted from Real/RealPow:
6670 * Theory Parity: added rules for simplifying exponents.
6674 The following theorems have been eliminated or modified
6677 list_all_Nil now named list_all.simps(1)
6678 list_all_Cons now named list_all.simps(2)
6679 list_all_conv now named list_all_iff
6680 set_mem_eq now named mem_iff
6682 * Theories SetsAndFunctions and BigO (see HOL/Library) support
6683 asymptotic "big O" calculations. See the notes in BigO.thy.
6688 * Theory RealDef: better support for embedding natural numbers and
6689 integers in the reals.
6691 The following theorems have been eliminated or modified
6694 exp_ge_add_one_self now requires no hypotheses
6695 real_of_int_add reversed direction of equality (use [symmetric])
6696 real_of_int_minus reversed direction of equality (use [symmetric])
6697 real_of_int_diff reversed direction of equality (use [symmetric])
6698 real_of_int_mult reversed direction of equality (use [symmetric])
6700 * Theory RComplete: expanded support for floor and ceiling functions.
6702 * Theory Ln is new, with properties of the natural logarithm
6704 * Hyperreal: There is a new type constructor "star" for making
6705 nonstandard types. The old type names are now type synonyms:
6709 hcomplex = complex star
6711 * Hyperreal: Many groups of similarly-defined constants have been
6712 replaced by polymorphic versions (INCOMPATIBILITY):
6714 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
6716 starset <-- starsetNat, starsetC
6717 *s* <-- *sNat*, *sc*
6718 starset_n <-- starsetNat_n, starsetC_n
6719 *sn* <-- *sNatn*, *scn*
6720 InternalSets <-- InternalNatSets, InternalCSets
6722 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6723 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
6724 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
6725 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
6726 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
6728 * Hyperreal: Many type-specific theorems have been removed in favor of
6729 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
6731 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
6732 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
6733 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
6734 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
6735 right_minus <-- hypreal_add_minus
6736 left_minus <-- {hypreal,hcomplex}_add_minus_left
6737 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
6738 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
6739 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
6740 mult_1_right <-- hcomplex_mult_one_right
6741 mult_zero_left <-- hcomplex_mult_zero_left
6742 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
6743 right_distrib <-- hypnat_add_mult_distrib2
6744 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
6745 right_inverse <-- hypreal_mult_inverse
6746 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
6747 order_refl <-- {hypreal,hypnat}_le_refl
6748 order_trans <-- {hypreal,hypnat}_le_trans
6749 order_antisym <-- {hypreal,hypnat}_le_anti_sym
6750 order_less_le <-- {hypreal,hypnat}_less_le
6751 linorder_linear <-- {hypreal,hypnat}_le_linear
6752 add_left_mono <-- {hypreal,hypnat}_add_left_mono
6753 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
6754 add_nonneg_nonneg <-- hypreal_le_add_order
6756 * Hyperreal: Separate theorems having to do with type-specific
6757 versions of constants have been merged into theorems that apply to the
6758 new polymorphic constants (INCOMPATIBILITY):
6760 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
6761 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
6762 STAR_Un <-- {STAR,NatStar,STARC}_Un
6763 STAR_Int <-- {STAR,NatStar,STARC}_Int
6764 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
6765 STAR_subset <-- {STAR,NatStar,STARC}_subset
6766 STAR_mem <-- {STAR,NatStar,STARC}_mem
6767 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
6768 STAR_diff <-- {STAR,STARC}_diff
6769 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
6770 STARC_hcomplex_of_complex}_image_subset
6771 starset_n_Un <-- starset{Nat,C}_n_Un
6772 starset_n_Int <-- starset{Nat,C}_n_Int
6773 starset_n_Compl <-- starset{Nat,C}_n_Compl
6774 starset_n_diff <-- starset{Nat,C}_n_diff
6775 InternalSets_Un <-- Internal{Nat,C}Sets_Un
6776 InternalSets_Int <-- Internal{Nat,C}Sets_Int
6777 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
6778 InternalSets_diff <-- Internal{Nat,C}Sets_diff
6779 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
6780 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
6781 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
6782 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
6783 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
6784 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6785 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
6786 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
6787 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
6788 starfun_diff <-- starfun{C,RC,CR}_diff
6789 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
6790 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
6791 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
6792 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
6793 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
6794 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
6795 starfun_Id <-- starfunC_Id
6796 starfun_approx <-- starfun{Nat,CR}_approx
6797 starfun_capprox <-- starfun{C,RC}_capprox
6798 starfun_abs <-- starfunNat_rabs
6799 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
6800 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
6801 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
6802 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
6803 starfun_add_capprox <-- starfun{C,RC}_add_capprox
6804 starfun_add_approx <-- starfunCR_add_approx
6805 starfun_inverse_inverse <-- starfunC_inverse_inverse
6806 starfun_divide <-- starfun{C,CR,RC}_divide
6807 starfun_n <-- starfun{Nat,C}_n
6808 starfun_n_mult <-- starfun{Nat,C}_n_mult
6809 starfun_n_add <-- starfun{Nat,C}_n_add
6810 starfun_n_add_minus <-- starfunNat_n_add_minus
6811 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
6812 starfun_n_minus <-- starfun{Nat,C}_n_minus
6813 starfun_n_eq <-- starfun{Nat,C}_n_eq
6815 star_n_add <-- {hypreal,hypnat,hcomplex}_add
6816 star_n_minus <-- {hypreal,hcomplex}_minus
6817 star_n_diff <-- {hypreal,hcomplex}_diff
6818 star_n_mult <-- {hypreal,hcomplex}_mult
6819 star_n_inverse <-- {hypreal,hcomplex}_inverse
6820 star_n_le <-- {hypreal,hypnat}_le
6821 star_n_less <-- {hypreal,hypnat}_less
6822 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
6823 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
6824 star_n_abs <-- hypreal_hrabs
6825 star_n_divide <-- hcomplex_divide
6827 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
6828 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
6829 star_of_diff <-- hypreal_of_real_diff
6830 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
6831 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
6832 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
6833 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
6834 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
6835 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
6836 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
6837 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
6838 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
6839 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
6840 star_of_number_of <-- {hypreal,hcomplex}_number_of
6841 star_of_number_less <-- number_of_less_hypreal_of_real_iff
6842 star_of_number_le <-- number_of_le_hypreal_of_real_iff
6843 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
6844 star_of_less_number <-- hypreal_of_real_less_number_of_iff
6845 star_of_le_number <-- hypreal_of_real_le_number_of_iff
6846 star_of_power <-- hypreal_of_real_power
6847 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
6849 * Hyperreal: new method "transfer" that implements the transfer
6850 principle of nonstandard analysis. With a subgoal that mentions
6851 nonstandard types like "'a star", the command "apply transfer"
6852 replaces it with an equivalent one that mentions only standard types.
6853 To be successful, all free variables must have standard types; non-
6854 standard variables must have explicit universal quantifiers.
6856 * Hyperreal: A theory of Taylor series.
6861 * Discontinued special version of 'constdefs' (which used to support
6862 continuous functions) in favor of the general Pure one with full
6865 * New simplification procedure for solving continuity conditions; it
6866 is much faster on terms with many nested lambda abstractions (cubic
6867 instead of exponential time).
6869 * New syntax for domain package: selector names are now optional.
6870 Parentheses should be omitted unless argument is lazy, for example:
6872 domain 'a stream = cons "'a" (lazy "'a stream")
6874 * New command 'fixrec' for defining recursive functions with pattern
6875 matching; defining multiple functions with mutual recursion is also
6876 supported. Patterns may include the constants cpair, spair, up, sinl,
6877 sinr, or any data constructor defined by the domain package. The given
6878 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
6879 syntax and examples.
6881 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
6882 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
6883 but the proof obligation additionally includes an admissibility
6884 requirement. The packages generate instances of class cpo or pcpo,
6885 with continuity and strictness theorems for Rep and Abs.
6887 * HOLCF: Many theorems have been renamed according to a more standard naming
6888 scheme (INCOMPATIBILITY):
6890 foo_inject: "foo$x = foo$y ==> x = y"
6891 foo_eq: "(foo$x = foo$y) = (x = y)"
6892 foo_less: "(foo$x << foo$y) = (x << y)"
6893 foo_strict: "foo$UU = UU"
6894 foo_defined: "... ==> foo$x ~= UU"
6895 foo_defined_iff: "(foo$x = UU) = (x = UU)"
6900 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
6901 including the First Isomorphism Theorem (on quotienting by the kernel
6904 * ZF/Simplifier: install second copy of type solver that actually
6905 makes use of TC rules declared to Isar proof contexts (or locales);
6906 the old version is still required for ML proof scripts.
6911 * Converted to Isar theory format; use locales instead of axiomatic
6917 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
6920 * Pure/library.ML no longer defines its own option datatype, but uses
6921 that of the SML basis, which has constructors NONE and SOME instead of
6922 None and Some, as well as exception Option.Option instead of OPTION.
6923 The functions the, if_none, is_some, is_none have been adapted
6924 accordingly, while Option.map replaces apsome.
6926 * Pure/library.ML: the exception LIST has been given up in favour of
6927 the standard exceptions Empty and Subscript, as well as
6928 Library.UnequalLengths. Function like Library.hd and Library.tl are
6929 superceded by the standard hd and tl functions etc.
6931 A number of basic list functions are no longer exported to the ML
6932 toplevel, as they are variants of predefined functions. The following
6933 suggests how one can translate existing code:
6935 rev_append xs ys = List.revAppend (xs, ys)
6936 nth_elem (i, xs) = List.nth (xs, i)
6937 last_elem xs = List.last xs
6938 flat xss = List.concat xss
6939 seq fs = List.app fs
6940 partition P xs = List.partition P xs
6941 mapfilter f xs = List.mapPartial f xs
6943 * Pure/library.ML: several combinators for linear functional
6944 transformations, notably reverse application and composition:
6947 (x, y) |-> f f #-> g
6949 * Pure/library.ML: introduced/changed precedence of infix operators:
6951 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
6953 infix 3 o oo ooo oooo;
6954 infix 4 ~~ upto downto;
6956 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
6959 * Pure/library.ML: natural list combinators fold, fold_rev, and
6960 fold_map support linear functional transformations and nesting. For
6963 fold f [x1, ..., xN] y =
6964 y |> f x1 |> ... |> f xN
6966 (fold o fold) f [xs1, ..., xsN] y =
6967 y |> fold f xs1 |> ... |> fold f xsN
6969 fold f [x1, ..., xN] =
6972 (fold o fold) f [xs1, ..., xsN] =
6973 fold f xs1 #> ... #> fold f xsN
6975 * Pure/library.ML: the following selectors on type 'a option are
6978 the: 'a option -> 'a (*partial*)
6979 these: 'a option -> 'a where 'a = 'b list
6980 the_default: 'a -> 'a option -> 'a
6981 the_list: 'a option -> 'a list
6983 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6984 basic operations for association lists, following natural argument
6985 order; moreover the explicit equality predicate passed here avoids
6986 potentially expensive polymorphic runtime equality checks.
6987 The old functions may be expressed as follows:
6989 assoc = uncurry (AList.lookup (op =))
6990 assocs = these oo AList.lookup (op =)
6991 overwrite = uncurry (AList.update (op =)) o swap
6993 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6995 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
6996 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
6998 replacing make_keylist and keyfilter (occassionally used)
7001 make_keylist = AList.make
7002 keyfilter = AList.find (op =)
7004 * eq_fst and eq_snd now take explicit equality parameter, thus
7005 avoiding eqtypes. Naive rewrites:
7007 eq_fst = eq_fst (op =)
7008 eq_snd = eq_snd (op =)
7010 * Removed deprecated apl and apr (rarely used).
7013 apl (n, op) =>>= curry op n
7014 apr (op, m) =>>= fn n => op (n, m)
7016 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
7017 provides a reasonably efficient light-weight implementation of sets as
7020 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
7021 few new operations; existing lookup and update are now curried to
7022 follow natural argument order (for use with fold etc.);
7023 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
7025 * Pure/General: output via the Isabelle channels of
7026 writeln/warning/error etc. is now passed through Output.output, with a
7027 hook for arbitrary transformations depending on the print_mode
7028 (cf. Output.add_mode -- the first active mode that provides a output
7029 function wins). Already formatted output may be embedded into further
7030 text via Output.raw; the result of Pretty.string_of/str_of and derived
7031 functions (string_of_term/cterm/thm etc.) is already marked raw to
7032 accommodate easy composition of diagnostic messages etc. Programmers
7033 rarely need to care about Output.output or Output.raw at all, with
7034 some notable exceptions: Output.output is required when bypassing the
7035 standard channels (writeln etc.), or in token translations to produce
7036 properly formatted results; Output.raw is required when capturing
7037 already output material that will eventually be presented to the user
7038 a second time. For the default print mode, both Output.output and
7039 Output.raw have no effect.
7041 * Pure/General: Output.time_accumulator NAME creates an operator ('a
7042 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
7043 cumulative results are displayed at the end of a batch session.
7045 * Pure/General: File.sysify_path and File.quote_sysify path have been
7046 replaced by File.platform_path and File.shell_path (with appropriate
7047 hooks). This provides a clean interface for unusual systems where the
7048 internal and external process view of file names are different.
7050 * Pure: more efficient orders for basic syntactic entities: added
7051 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
7052 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
7053 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
7054 orders now -- potential INCOMPATIBILITY for code that depends on a
7055 particular order for Symtab.keys, Symtab.dest, etc. (consider using
7056 Library.sort_strings on result).
7058 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
7059 fold_types traverse types/terms from left to right, observing natural
7060 argument order. Supercedes previous foldl_XXX versions, add_frees,
7061 add_vars etc. have been adapted as well: INCOMPATIBILITY.
7063 * Pure: name spaces have been refined, with significant changes of the
7064 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
7065 to extern(_table). The plain name entry path is superceded by a
7066 general 'naming' context, which also includes the 'policy' to produce
7067 a fully qualified name and external accesses of a fully qualified
7068 name; NameSpace.extend is superceded by context dependent
7069 Sign.declare_name. Several theory and proof context operations modify
7070 the naming context. Especially note Theory.restore_naming and
7071 ProofContext.restore_naming to get back to a sane state; note that
7072 Theory.add_path is no longer sufficient to recover from
7073 Theory.absolute_path in particular.
7075 * Pure: new flags short_names (default false) and unique_names
7076 (default true) for controlling output of qualified names. If
7077 short_names is set, names are printed unqualified. If unique_names is
7078 reset, the name prefix is reduced to the minimum required to achieve
7079 the original result when interning again, even if there is an overlap
7080 with earlier declarations.
7082 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
7083 now 'extend', and 'merge' gets an additional Pretty.pp argument
7084 (useful for printing error messages). INCOMPATIBILITY.
7086 * Pure: major reorganization of the theory context. Type Sign.sg and
7087 Theory.theory are now identified, referring to the universal
7088 Context.theory (see Pure/context.ML). Actual signature and theory
7089 content is managed as theory data. The old code and interfaces were
7090 spread over many files and structures; the new arrangement introduces
7091 considerable INCOMPATIBILITY to gain more clarity:
7093 Context -- theory management operations (name, identity, inclusion,
7094 parents, ancestors, merge, etc.), plus generic theory data;
7096 Sign -- logical signature and syntax operations (declaring consts,
7097 types, etc.), plus certify/read for common entities;
7099 Theory -- logical theory operations (stating axioms, definitions,
7100 oracles), plus a copy of logical signature operations (consts,
7101 types, etc.); also a few basic management operations (Theory.copy,
7104 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
7105 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
7106 for convenience -- they merely return the theory.
7108 * Pure: type Type.tsig is superceded by theory in most interfaces.
7110 * Pure: the Isar proof context type is already defined early in Pure
7111 as Context.proof (note that ProofContext.context and Proof.context are
7112 aliases, where the latter is the preferred name). This enables other
7113 Isabelle components to refer to that type even before Isar is present.
7115 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
7116 typeK, constK, axiomK, oracleK), but provide explicit operations for
7117 any of these kinds. For example, Sign.intern typeK is now
7118 Sign.intern_type, Theory.hide_space Sign.typeK is now
7119 Theory.hide_types. Also note that former
7120 Theory.hide_classes/types/consts are now
7121 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
7122 internalize their arguments! INCOMPATIBILITY.
7124 * Pure: get_thm interface (of PureThy and ProofContext) expects
7125 datatype thmref (with constructors Name and NameSelection) instead of
7126 plain string -- INCOMPATIBILITY;
7128 * Pure: cases produced by proof methods specify options, where NONE
7129 means to remove case bindings -- INCOMPATIBILITY in
7132 * Pure: the following operations retrieve axioms or theorems from a
7133 theory node or theory hierarchy, respectively:
7135 Theory.axioms_of: theory -> (string * term) list
7136 Theory.all_axioms_of: theory -> (string * term) list
7137 PureThy.thms_of: theory -> (string * thm) list
7138 PureThy.all_thms_of: theory -> (string * thm) list
7140 * Pure: print_tac now outputs the goal through the trace channel.
7142 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
7143 Reference Toplevel.debug (default false) controls detailed printing
7144 and tracing of low-level exceptions; Toplevel.profiling (default 0)
7145 controls execution profiling -- set to 1 for time and 2 for space
7146 (both increase the runtime).
7148 * Isar session: The initial use of ROOT.ML is now always timed,
7149 i.e. the log will show the actual process times, in contrast to the
7150 elapsed wall-clock time that the outer shell wrapper produces.
7152 * Simplifier: improved handling of bound variables (nameless
7153 representation, avoid allocating new strings). Simprocs that invoke
7154 the Simplifier recursively should use Simplifier.inherit_bounds to
7155 avoid local name clashes. Failure to do so produces warnings
7156 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
7157 for further details.
7159 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
7160 bindings for all theorems stored within a given theory; this may help
7161 in porting non-Isar theories to Isar ones, while keeping ML proof
7162 scripts for the time being.
7164 * ML operator HTML.with_charset specifies the charset begin used for
7165 generated HTML files. For example:
7167 HTML.with_charset "utf-8" use_thy "Hebrew";
7168 HTML.with_charset "utf-8" use_thy "Chinese";
7173 * Allow symlinks to all proper Isabelle executables (Isabelle,
7174 isabelle, isatool etc.).
7176 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
7177 isatool doc, isatool mkdir, display_drafts etc.).
7179 * isatool usedir: option -f allows specification of the ML file to be
7180 used by Isabelle; default is ROOT.ML.
7182 * New isatool version outputs the version identifier of the Isabelle
7183 distribution being used.
7185 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
7186 (containing Boolean satisfiability problems) into Isabelle/HOL
7191 New in Isabelle2004 (April 2004)
7192 --------------------------------
7196 * Provers/order.ML: new efficient reasoner for partial and linear orders.
7197 Replaces linorder.ML.
7199 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
7200 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
7201 (\<a>...\<z>), are now considered normal letters, and can therefore
7202 be used anywhere where an ASCII letter (a...zA...Z) has until
7203 now. COMPATIBILITY: This obviously changes the parsing of some
7204 terms, especially where a symbol has been used as a binder, say
7205 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
7206 as an identifier. Fix it by inserting a space around former
7207 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
7208 existing theory and ML files.
7210 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
7212 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
7213 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
7214 a normal (but invisible) letter. For multiple letter subscripts repeat
7215 \<^isub> like this: x\<^isub>1\<^isub>2.
7217 * Pure: There are now sub-/superscripts that can span more than one
7218 character. Text between \<^bsub> and \<^esub> is set in subscript in
7219 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
7220 superscript. The new control characters are not identifier parts.
7222 * Pure: Control-symbols of the form \<^raw:...> will literally print the
7223 content of "..." to the latex file instead of \isacntrl... . The "..."
7224 may consist of any printable characters excluding the end bracket >.
7226 * Pure: Using new Isar command "finalconsts" (or the ML functions
7227 Theory.add_finals or Theory.add_finals_i) it is now possible to
7228 declare constants "final", which prevents their being given a definition
7229 later. It is useful for constants whose behaviour is fixed axiomatically
7230 rather than definitionally, such as the meta-logic connectives.
7232 * Pure: 'instance' now handles general arities with general sorts
7233 (i.e. intersections of classes),
7235 * Presentation: generated HTML now uses a CSS style sheet to make layout
7236 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
7237 It can be changed to alter the colors/layout of generated pages.
7242 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
7243 cut_tac, subgoal_tac and thin_tac:
7244 - Now understand static (Isar) contexts. As a consequence, users of Isar
7245 locales are no longer forced to write Isar proof scripts.
7246 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
7248 - INCOMPATIBILITY: names of variables to be instantiated may no
7249 longer be enclosed in quotes. Instead, precede variable name with `?'.
7250 This is consistent with the instantiation attribute "where".
7252 * Attributes "where" and "of":
7253 - Now take type variables of instantiated theorem into account when reading
7254 the instantiation string. This fixes a bug that caused instantiated
7255 theorems to have too special types in some circumstances.
7256 - "where" permits explicit instantiations of type variables.
7258 * Calculation commands "moreover" and "also" no longer interfere with
7259 current facts ("this"), admitting arbitrary combinations with "then"
7263 - Goal statements involving the context element "includes" no longer
7264 generate theorems with internal delta predicates (those ending on
7265 "_axioms") in the premise.
7266 Resolve particular premise with <locale>.intro to obtain old form.
7267 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
7268 specification and "includes" elements in goal statement.
7269 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
7270 [intro?] and [elim?] (respectively) by default.
7271 - Experimental command for instantiation of locales in proof contexts:
7272 instantiate <label>[<attrs>]: <loc>
7273 Instantiates locale <loc> and adds all its theorems to the current context
7274 taking into account their attributes. Label and attrs are optional
7275 modifiers, like in theorem declarations. If present, names of
7276 instantiated theorems are qualified with <label>, and the attributes
7277 <attrs> are applied after any attributes these theorems might have already.
7278 If the locale has assumptions, a chained fact of the form
7279 "<loc> t1 ... tn" is expected from which instantiations of the parameters
7280 are derived. The command does not support old-style locales declared
7281 with "locale (open)".
7282 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
7284 * HOL: Tactic emulation methods induct_tac and case_tac understand static
7290 * Proof import: new image HOL4 contains the imported library from
7291 the HOL4 system with about 2500 theorems. It is imported by
7292 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
7293 can be used like any other Isabelle image. See
7294 HOL/Import/HOL/README for more information.
7297 - Much improved handling of linear and partial orders.
7298 Reasoners for linear and partial orders are set up for type classes
7299 "linorder" and "order" respectively, and are added to the default simpset
7300 as solvers. This means that the simplifier can build transitivity chains
7301 to solve goals from the assumptions.
7302 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
7303 of blast or auto after simplification become unnecessary because the goal
7304 is solved by simplification already.
7306 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
7307 all proved in axiomatic type classes for semirings, rings and fields.
7310 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
7311 now formalized using the Ring_and_Field theory mentioned above.
7312 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
7313 than before, because now they are set up once in a generic manner.
7314 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
7315 Look for the general versions in Ring_and_Field (and Power if they concern
7318 * Type "rat" of the rational numbers is now available in HOL-Complex.
7321 - Record types are now by default printed with their type abbreviation
7322 instead of the list of all field types. This can be configured via
7323 the reference "print_record_type_abbr".
7324 - Simproc "record_upd_simproc" for simplification of multiple updates added
7325 (not enabled by default).
7326 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
7327 EX x. x = sel r to True (not enabled by default).
7328 - Tactic "record_split_simp_tac" to split and simplify records added.
7330 * 'specification' command added, allowing for definition by
7331 specification. There is also an 'ax_specification' command that
7332 introduces the new constants axiomatically.
7334 * arith(_tac) is now able to generate counterexamples for reals as well.
7336 * HOL-Algebra: new locale "ring" for non-commutative rings.
7338 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
7339 definitions, thanks to Sava Krsti\'{c} and John Matthews.
7341 * HOL-Matrix: a first theory for matrices in HOL with an application of
7342 matrix theory to linear programming.
7344 * Unions and Intersections:
7345 The latex output syntax of UN and INT has been changed
7346 from "\Union x \in A. B" to "\Union_{x \in A} B"
7347 i.e. the index formulae has become a subscript.
7348 Similarly for "\Union x. B", and for \Inter instead of \Union.
7350 * Unions and Intersections over Intervals:
7351 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
7352 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
7353 like in normal math, and corresponding versions for < and for intersection.
7355 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
7356 lexicographic dictonary ordering has been added as "lexord".
7358 * ML: the legacy theory structures Int and List have been removed. They had
7359 conflicted with ML Basis Library structures having the same names.
7361 * 'refute' command added to search for (finite) countermodels. Only works
7362 for a fragment of HOL. The installation of an external SAT solver is
7363 highly recommended. See "HOL/Refute.thy" for details.
7365 * 'quickcheck' command: Allows to find counterexamples by evaluating
7366 formulae under an assignment of free variables to random values.
7367 In contrast to 'refute', it can deal with inductive datatypes,
7368 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
7374 * Streams now come with concatenation and are part of the HOLCF image
7378 New in Isabelle2003 (May 2003)
7379 ------------------------------
7383 * Provers/simplifier:
7385 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
7386 Assumptions are now subject to complete mutual simplification,
7387 not just from left to right. The simplifier now preserves
7388 the order of assumptions.
7390 Potential INCOMPATIBILITY:
7392 -- simp sometimes diverges where the old version did
7393 not, e.g. invoking simp on the goal
7395 [| P (f x); y = x; f x = f y |] ==> Q
7397 now gives rise to the infinite reduction sequence
7399 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
7401 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
7404 -- Tactics combining classical reasoner and simplification (such as auto)
7405 are also affected by this change, because many of them rely on
7406 simp. They may sometimes diverge as well or yield a different numbers
7407 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
7408 in case of problems. Sometimes subsequent calls to the classical
7409 reasoner will fail because a preceeding call to the simplifier too
7410 eagerly simplified the goal, e.g. deleted redundant premises.
7412 - The simplifier trace now shows the names of the applied rewrite rules
7414 - You can limit the number of recursive invocations of the simplifier
7415 during conditional rewriting (where the simplifie tries to solve the
7416 conditions before applying the rewrite rule):
7417 ML "simp_depth_limit := n"
7418 where n is an integer. Thus you can force termination where previously
7419 the simplifier would diverge.
7421 - Accepts free variables as head terms in congruence rules. Useful in Isar.
7423 - No longer aborts on failed congruence proof. Instead, the
7424 congruence is ignored.
7426 * Pure: New generic framework for extracting programs from constructive
7427 proofs. See HOL/Extraction.thy for an example instantiation, as well
7428 as HOL/Extraction for some case studies.
7430 * Pure: The main goal of the proof state is no longer shown by default, only
7431 the subgoals. This behaviour is controlled by a new flag.
7432 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
7433 (ML: Proof.show_main_goal).
7435 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
7436 rules whose conclusion matches subgoal 1:
7437 PG menu: Isabelle/Isar -> Show me -> matching rules
7438 The rules are ordered by how closely they match the subgoal.
7439 In particular, rules that solve a subgoal outright are displayed first
7440 (or rather last, the way they are printed).
7441 (ML: ProofGeneral.print_intros())
7443 * Pure: New flag trace_unify_fail causes unification to print
7444 diagnostic information (PG: in trace buffer) when it fails. This is
7445 useful for figuring out why single step proofs like rule, erule or
7448 * Pure: Locale specifications now produce predicate definitions
7449 according to the body of text (covering assumptions modulo local
7450 definitions); predicate "loc_axioms" covers newly introduced text,
7451 while "loc" is cumulative wrt. all included locale expressions; the
7452 latter view is presented only on export into the global theory
7453 context; potential INCOMPATIBILITY, use "(open)" option to fall back
7454 on the old view without predicates;
7456 * Pure: predefined locales "var" and "struct" are useful for sharing
7457 parameters (as in CASL, for example); just specify something like
7458 ``var x + var y + struct M'' as import;
7460 * Pure: improved thms_containing: proper indexing of facts instead of
7461 raw theorems; check validity of results wrt. current name space;
7462 include local facts of proof configuration (also covers active
7463 locales), cover fixed variables in index; may use "_" in term
7464 specification; an optional limit for the number of printed facts may
7465 be given (the default is 40);
7467 * Pure: disallow duplicate fact bindings within new-style theory files
7470 * Provers: improved induct method: assumptions introduced by case
7471 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
7472 the goal statement); "foo" still refers to all facts collectively;
7474 * Provers: the function blast.overloaded has been removed: all constants
7475 are regarded as potentially overloaded, which improves robustness in exchange
7476 for slight decrease in efficiency;
7478 * Provers/linorder: New generic prover for transitivity reasoning over
7479 linear orders. Note: this prover is not efficient!
7481 * Isar: preview of problems to finish 'show' now produce an error
7482 rather than just a warning (in interactive mode);
7489 - Produces a counter example if it cannot prove a goal.
7490 Note that the counter example may be spurious if the goal is not a formula
7491 of quantifier-free linear arithmetic.
7492 In ProofGeneral the counter example appears in the trace buffer.
7494 - Knows about div k and mod k where k is a numeral of type nat or int.
7496 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
7497 linear arithmetic fails. This takes account of quantifiers and divisibility.
7498 Presburger arithmetic can also be called explicitly via presburger(_tac).
7500 * simp's arithmetic capabilities have been enhanced a bit: it now
7501 takes ~= in premises into account (by performing a case split);
7503 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
7504 are distributed over a sum of terms;
7506 * New tactic "trans_tac" and method "trans" instantiate
7507 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
7510 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
7511 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
7513 * 'typedef' command has new option "open" to suppress the set
7516 * functions Min and Max on finite sets have been introduced (theory
7519 * attribute [symmetric] now works for relations as well; it turns
7520 (x,y) : R^-1 into (y,x) : R, and vice versa;
7522 * induct over a !!-quantified statement (say !!x1..xn):
7523 each "case" automatically performs "fix x1 .. xn" with exactly those names.
7525 * Map: `empty' is no longer a constant but a syntactic abbreviation for
7526 %x. None. Warning: empty_def now refers to the previously hidden definition
7529 * Algebra: formalization of classical algebra. Intended as base for
7530 any algebraic development in Isabelle. Currently covers group theory
7531 (up to Sylow's theorem) and ring theory (Universal Property of
7532 Univariate Polynomials). Contributions welcome;
7534 * GroupTheory: deleted, since its material has been moved to Algebra;
7536 * Complex: new directory of the complex numbers with numeric constants,
7537 nonstandard complex numbers, and some complex analysis, standard and
7538 nonstandard (Jacques Fleuriot);
7540 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
7542 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
7545 * Real/HahnBanach: updated and adapted to locales;
7547 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
7550 * UNITY: added the Meier-Sanders theory of progress sets;
7552 * MicroJava: bytecode verifier and lightweight bytecode verifier
7553 as abstract algorithms, instantiated to the JVM;
7555 * Bali: Java source language formalization. Type system, operational
7556 semantics, axiomatic semantics. Supported language features:
7557 classes, interfaces, objects,virtual methods, static methods,
7558 static/instance fields, arrays, access modifiers, definite
7559 assignment, exceptions.
7564 * ZF/Constructible: consistency proof for AC (Gdel's constructible
7567 * Main ZF: virtually all theories converted to new-style format;
7572 * Pure: Tactic.prove provides sane interface for internal proofs;
7573 omits the infamous "standard" operation, so this is more appropriate
7574 than prove_goalw_cterm in many situations (e.g. in simprocs);
7576 * Pure: improved error reporting of simprocs;
7578 * Provers: Simplifier.simproc(_i) provides sane interface for setting
7582 *** Document preparation ***
7584 * uses \par instead of \\ for line breaks in theory text. This may
7585 shift some page breaks in large documents. To get the old behaviour
7586 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
7588 * minimized dependencies of isabelle.sty and isabellesym.sty on
7591 * \<euro> now needs package babel/greek instead of marvosym (which
7594 * normal size for \<zero>...\<nine> (uses \mathbf instead of
7599 New in Isabelle2002 (March 2002)
7600 --------------------------------
7602 *** Document preparation ***
7604 * greatly simplified document preparation setup, including more
7605 graceful interpretation of isatool usedir -i/-d/-D options, and more
7606 instructive isatool mkdir; users should basically be able to get
7607 started with "isatool mkdir HOL Test && isatool make"; alternatively,
7608 users may run a separate document processing stage manually like this:
7609 "isatool usedir -D output HOL Test && isatool document Test/output";
7611 * theory dependency graph may now be incorporated into documents;
7612 isatool usedir -g true will produce session_graph.eps/.pdf for use
7613 with \includegraphics of LaTeX;
7615 * proper spacing of consecutive markup elements, especially text
7616 blocks after section headings;
7618 * support bold style (for single symbols only), input syntax is like
7619 this: "\<^bold>\<alpha>" or "\<^bold>A";
7621 * \<bullet> is now output as bold \cdot by default, which looks much
7622 better in printed text;
7624 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
7625 note that these symbols are currently unavailable in Proof General /
7626 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
7628 * isatool latex no longer depends on changed TEXINPUTS, instead
7629 isatool document copies the Isabelle style files to the target
7635 * Pure/Provers: improved proof by cases and induction;
7636 - 'case' command admits impromptu naming of parameters (such as
7638 - 'induct' method divinates rule instantiation from the inductive
7639 claim; no longer requires excessive ?P bindings for proper
7640 instantiation of cases;
7641 - 'induct' method properly enumerates all possibilities of set/type
7642 rules; as a consequence facts may be also passed through *type*
7643 rules without further ado;
7644 - 'induct' method now derives symbolic cases from the *rulified*
7645 rule (before it used to rulify cases stemming from the internal
7646 atomized version); this means that the context of a non-atomic
7647 statement becomes is included in the hypothesis, avoiding the
7648 slightly cumbersome show "PROP ?case" form;
7649 - 'induct' may now use elim-style induction rules without chaining
7650 facts, using ``missing'' premises from the goal state; this allows
7651 rules stemming from inductive sets to be applied in unstructured
7652 scripts, while still benefitting from proper handling of non-atomic
7653 statements; NB: major inductive premises need to be put first, all
7654 the rest of the goal is passed through the induction;
7655 - 'induct' proper support for mutual induction involving non-atomic
7656 rule statements (uses the new concept of simultaneous goals, see
7658 - append all possible rule selections, but only use the first
7659 success (no backtracking);
7660 - removed obsolete "(simplified)" and "(stripped)" options of methods;
7661 - undeclared rule case names default to numbers 1, 2, 3, ...;
7662 - added 'print_induct_rules' (covered by help item in recent Proof
7664 - moved induct/cases attributes to Pure, methods to Provers;
7665 - generic method setup instantiated for FOL and HOL;
7667 * Pure: support multiple simultaneous goal statements, for example
7668 "have a: A and b: B" (same for 'theorem' etc.); being a pure
7669 meta-level mechanism, this acts as if several individual goals had
7670 been stated separately; in particular common proof methods need to be
7671 repeated in order to cover all claims; note that a single elimination
7672 step is *not* sufficient to establish the two conjunctions, so this
7675 assume "A & B" then have A and B .. (*".." fails*)
7677 better use "obtain" in situations as above; alternative refer to
7678 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
7680 * Pure: proper integration with ``locales''; unlike the original
7681 version by Florian Kammller, Isar locales package high-level proof
7682 contexts rather than raw logical ones (e.g. we admit to include
7683 attributes everywhere); operations on locales include merge and
7684 rename; support for implicit arguments (``structures''); simultaneous
7685 type-inference over imports and text; see also HOL/ex/Locales.thy for
7688 * Pure: the following commands have been ``localized'', supporting a
7689 target locale specification "(in name)": 'lemma', 'theorem',
7690 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
7691 stored both within the locale and at the theory level (exported and
7692 qualified by the locale name);
7694 * Pure: theory goals may now be specified in ``long'' form, with
7695 ad-hoc contexts consisting of arbitrary locale elements. for example
7696 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
7697 definitions may be given, too); the result is a meta-level rule with
7698 the context elements being discharged in the obvious way;
7700 * Pure: new proof command 'using' allows to augment currently used
7701 facts after a goal statement ('using' is syntactically analogous to
7702 'apply', but acts on the goal's facts only); this allows chained facts
7703 to be separated into parts given before and after a claim, as in
7704 ``from a and b have C using d and e <proof>'';
7706 * Pure: renamed "antecedent" case to "rule_context";
7708 * Pure: new 'judgment' command records explicit information about the
7709 object-logic embedding (used by several tools internally); no longer
7710 use hard-wired "Trueprop";
7712 * Pure: added 'corollary' command;
7714 * Pure: fixed 'token_translation' command;
7716 * Pure: removed obsolete 'exported' attribute;
7718 * Pure: dummy pattern "_" in is/let is now automatically lifted over
7719 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
7720 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
7722 * Pure: method 'atomize' presents local goal premises as object-level
7723 statements (atomic meta-level propositions); setup controlled via
7724 rewrite rules declarations of 'atomize' attribute; example
7725 application: 'induct' method with proper rule statements in improper
7728 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
7729 now consider the syntactic context of assumptions, giving a better
7730 chance to get type-inference of the arguments right (this is
7731 especially important for locales);
7733 * Pure: "sorry" no longer requires quick_and_dirty in interactive
7736 * Pure/obtain: the formal conclusion "thesis", being marked as
7737 ``internal'', may no longer be reference directly in the text;
7738 potential INCOMPATIBILITY, may need to use "?thesis" in rare
7741 * Pure: generic 'sym' attribute which declares a rule both as pure
7742 'elim?' and for the 'symmetric' operation;
7744 * Pure: marginal comments ``--'' may now occur just anywhere in the
7745 text; the fixed correlation with particular command syntax has been
7748 * Pure: new method 'rules' is particularly well-suited for proof
7749 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
7750 but often produces more compact proof terms with less detours;
7752 * Pure/Provers/classical: simplified integration with pure rule
7753 attributes and methods; the classical "intro?/elim?/dest?"
7754 declarations coincide with the pure ones; the "rule" method no longer
7755 includes classically swapped intros; "intro" and "elim" methods no
7756 longer pick rules from the context; also got rid of ML declarations
7757 AddXIs/AddXEs/AddXDs; all of this has some potential for
7760 * Provers/classical: attribute 'swapped' produces classical inversions
7761 of introduction rules;
7763 * Provers/simplifier: 'simplified' attribute may refer to explicit
7764 rules instead of full simplifier context; 'iff' attribute handles
7767 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
7769 * HOL: 'recdef' now fails on unfinished automated proofs, use
7770 "(permissive)" option to recover old behavior;
7772 * HOL: 'inductive' no longer features separate (collective) attributes
7773 for 'intros' (was found too confusing);
7775 * HOL: properly declared induction rules less_induct and
7781 * HOL: moved over to sane numeral syntax; the new policy is as
7784 - 0 and 1 are polymorphic constants, which are defined on any
7785 numeric type (nat, int, real etc.);
7787 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
7788 binary representation internally;
7790 - type nat has special constructor Suc, and generally prefers Suc 0
7791 over 1::nat and Suc (Suc 0) over 2::nat;
7793 This change may cause significant problems of INCOMPATIBILITY; here
7794 are some hints on converting existing sources:
7796 - due to the new "num" token, "-0" and "-1" etc. are now atomic
7797 entities, so expressions involving "-" (unary or binary minus) need
7798 to be spaced properly;
7800 - existing occurrences of "1" may need to be constraint "1::nat" or
7801 even replaced by Suc 0; similar for old "2";
7803 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
7805 - remove all special provisions on numerals in proofs;
7807 * HOL: simp rules nat_number expand numerals on nat to Suc/0
7808 representation (depends on bin_arith_simps in the default context);
7810 * HOL: symbolic syntax for x^2 (numeral 2);
7812 * HOL: the class of all HOL types is now called "type" rather than
7813 "term"; INCOMPATIBILITY, need to adapt references to this type class
7814 in axclass/classes, instance/arities, and (usually rare) occurrences
7815 in typings (of consts etc.); internally the class is called
7816 "HOL.type", ML programs should refer to HOLogic.typeS;
7818 * HOL/record package improvements:
7819 - new derived operations "fields" to build a partial record section,
7820 "extend" to promote a fixed record to a record scheme, and
7821 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
7822 declared as simp by default;
7823 - shared operations ("more", "fields", etc.) now need to be always
7824 qualified) --- potential INCOMPATIBILITY;
7825 - removed "make_scheme" operations (use "make" with "extend") --
7827 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
7828 - provides cases/induct rules for use with corresponding Isar
7829 methods (for concrete records, record schemes, concrete more
7830 parts, and schematic more parts -- in that order);
7831 - internal definitions directly based on a light-weight abstract
7832 theory of product types over typedef rather than datatype;
7834 * HOL: generic code generator for generating executable ML code from
7835 specifications; specific support for HOL constructs such as inductive
7836 datatypes and sets, as well as recursive functions; can be invoked
7837 via 'generate_code' theory section;
7839 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
7841 * HOL: consolidated and renamed several theories. In particular:
7842 Ord.thy has been absorbed into HOL.thy
7843 String.thy has been absorbed into List.thy
7845 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
7846 (beware of argument permutation!);
7848 * HOL: linorder_less_split superseded by linorder_cases;
7850 * HOL/List: "nodups" renamed to "distinct";
7852 * HOL: added "The" definite description operator; move Hilbert's "Eps"
7853 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
7854 - Ex_def has changed, now need to use some_eq_ex
7856 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
7857 in this (rare) case use:
7859 delSWrapper "split_all_tac"
7860 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
7862 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
7865 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
7866 Isabelle's type classes, ^ on functions and relations has too general
7867 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
7868 necessary to attach explicit type constraints;
7870 * HOL/Relation: the prefix name of the infix "O" has been changed from
7871 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
7872 renamed accordingly (eg "compI" -> "rel_compI").
7874 * HOL: syntax translations now work properly with numerals and records
7877 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
7878 of "lam" -- INCOMPATIBILITY;
7880 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
7881 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
7882 renamed "Product_Type.unit";
7884 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
7886 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
7887 the "cases" method);
7889 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
7892 * HOL/IMP: updated and converted to new-style theory format; several
7893 parts turned into readable document, with proper Isar proof texts and
7894 some explanations (by Gerwin Klein);
7896 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
7898 * HOL-Hyperreal is now a logic image;
7903 * Isar: consts/constdefs supports mixfix syntax for continuous
7906 * Isar: domain package adapted to new-style theory format, e.g. see
7909 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
7910 potential INCOMPATIBILITY; now use plain induct_tac instead of former
7911 lift.induct_tac, always use UU instead of Undef;
7913 * HOLCF/IMP: updated and converted to new-style theory;
7918 * Isar: proper integration of logic-specific tools and packages,
7919 including theory commands '(co)inductive', '(co)datatype',
7920 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
7921 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
7923 * theory Main no longer includes AC; for the Axiom of Choice, base
7924 your theory on Main_ZFC;
7926 * the integer library now covers quotients and remainders, with many
7927 laws relating division to addition, multiplication, etc.;
7929 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
7930 typeless version of the formalism;
7932 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
7935 * ZF/Induct: new directory for examples of inductive definitions,
7936 including theory Multiset for multiset orderings; converted to
7937 new-style theory format;
7939 * ZF: many new theorems about lists, ordinals, etc.;
7944 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
7945 variable proof controls level of detail: 0 = no proofs (only oracle
7946 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
7947 also ref manual for further ML interfaces;
7949 * Pure/axclass: removed obsolete ML interface
7950 goal_subclass/goal_arity;
7952 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
7953 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
7954 separate tokens, so expressions involving minus need to be spaced
7957 * Pure/syntax: support non-oriented infixes, using keyword "infix"
7958 rather than "infixl" or "infixr";
7960 * Pure/syntax: concrete syntax for dummy type variables admits genuine
7961 sort constraint specifications in type inference; e.g. "x::_::foo"
7962 ensures that the type of "x" is of sort "foo" (but not necessarily a
7965 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
7966 control output of nested => (types); the default behavior is
7969 * Pure/syntax: builtin parse translation for "_constify" turns valued
7970 tokens into AST constants;
7972 * Pure/syntax: prefer later declarations of translations and print
7973 translation functions; potential INCOMPATIBILITY: need to reverse
7974 multiple declarations for same syntax element constant;
7976 * Pure/show_hyps reset by default (in accordance to existing Isar
7979 * Provers/classical: renamed addaltern to addafter, addSaltern to
7982 * Provers/clasimp: ``iff'' declarations now handle conditional rules
7985 * system: tested support for MacOS X; should be able to get Isabelle +
7986 Proof General to work in a plain Terminal after installing Poly/ML
7987 (e.g. from the Isabelle distribution area) and GNU bash alone
7988 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
7989 support requires further installations, e.g. from
7990 http://fink.sourceforge.net/);
7992 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
7994 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
7995 of 40 MB), cf. ML_OPTIONS;
7997 * system: Proof General keywords specification is now part of the
7998 Isabelle distribution (see etc/isar-keywords.el);
8000 * system: support for persistent Proof General sessions (refrain from
8001 outdating all loaded theories on startup); user may create writable
8002 logic images like this: ``isabelle -q HOL Test'';
8004 * system: smart selection of Isabelle process versus Isabelle
8005 interface, accommodates case-insensitive file systems (e.g. HFS+); may
8006 run both "isabelle" and "Isabelle" even if file names are badly
8007 damaged (executable inspects the case of the first letter of its own
8008 name); added separate "isabelle-process" and "isabelle-interface";
8010 * system: refrain from any attempt at filtering input streams; no
8011 longer support ``8bit'' encoding of old isabelle font, instead proper
8012 iso-latin characters may now be used; the related isatools
8013 "symbolinput" and "nonascii" have disappeared as well;
8015 * system: removed old "xterm" interface (the print modes "xterm" and
8016 "xterm_color" are still available for direct use in a suitable
8021 New in Isabelle99-2 (February 2001)
8022 -----------------------------------
8024 *** Overview of INCOMPATIBILITIES ***
8026 * HOL: please note that theories in the Library and elsewhere often use the
8027 new-style (Isar) format; to refer to their theorems in an ML script you must
8028 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
8030 * HOL: inductive package no longer splits induction rule aggressively,
8031 but only as far as specified by the introductions given; the old
8032 format may be recovered via ML function complete_split_rule or attribute
8033 'split_rule (complete)';
8035 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
8036 gfp_Tarski to gfp_unfold;
8038 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
8040 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
8041 relation); infix "^^" has been renamed "``"; infix "``" has been
8042 renamed "`"; "univalent" has been renamed "single_valued";
8044 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
8047 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
8049 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
8051 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
8052 consequence, it is no longer monotonic wrt. the local goal context
8053 (which is now passed through the inductive cases);
8055 * Document preparation: renamed standard symbols \<ll> to \<lless> and
8056 \<gg> to \<ggreater>;
8059 *** Document preparation ***
8061 * \isabellestyle{NAME} selects version of Isabelle output (currently
8062 available: are "it" for near math-mode best-style output, "sl" for
8063 slanted text style, and "tt" for plain type-writer; if no
8064 \isabellestyle command is given, output is according to slanted
8067 * support sub/super scripts (for single symbols only), input syntax is
8068 like this: "A\<^sup>*" or "A\<^sup>\<star>";
8070 * some more standard symbols; see Appendix A of the system manual for
8071 the complete list of symbols defined in isabellesym.sty;
8073 * improved isabelle style files; more abstract symbol implementation
8074 (should now use \isamath{...} and \isatext{...} in custom symbol
8077 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
8078 state; Note that presentation of goal states does not conform to
8079 actual human-readable proof documents. Please do not include goal
8080 states into document output unless you really know what you are doing!
8082 * proper indentation of antiquoted output with proportional LaTeX
8085 * no_document ML operator temporarily disables LaTeX document
8088 * isatool unsymbolize tunes sources for plain ASCII communication;
8093 * Pure: Isar now suffers initial goal statements to contain unbound
8094 schematic variables (this does not conform to actual readable proof
8095 documents, due to unpredictable outcome and non-compositional proof
8096 checking); users who know what they are doing may use schematic goals
8097 for Prolog-style synthesis of proven results;
8099 * Pure: assumption method (an implicit finishing) now handles actual
8102 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
8103 initial goal, declare "that" only as Pure intro (only for single
8104 steps); the "that" rule assumption may now be involved in implicit
8105 finishing, thus ".." becomes a feasible for trivial obtains;
8107 * Pure: default proof step now includes 'intro_classes'; thus trivial
8108 instance proofs may be performed by "..";
8110 * Pure: ?thesis / ?this / "..." now work for pure meta-level
8113 * Pure: more robust selection of calculational rules;
8115 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
8116 rule (as well as the assumption rule);
8118 * Pure: 'thm_deps' command visualizes dependencies of theorems and
8119 lemmas, using the graph browser tool;
8121 * Pure: predict failure of "show" in interactive mode;
8123 * Pure: 'thms_containing' now takes actual terms as arguments;
8125 * HOL: improved method 'induct' --- now handles non-atomic goals
8126 (potential INCOMPATIBILITY); tuned error handling;
8128 * HOL: cases and induct rules now provide explicit hints about the
8129 number of facts to be consumed (0 for "type" and 1 for "set" rules);
8130 any remaining facts are inserted into the goal verbatim;
8132 * HOL: local contexts (aka cases) may now contain term bindings as
8133 well; the 'cases' and 'induct' methods new provide a ?case binding for
8134 the result to be shown in each case;
8136 * HOL: added 'recdef_tc' command;
8138 * isatool convert assists in eliminating legacy ML scripts;
8143 * HOL/Library: a collection of generic theories to be used together
8144 with main HOL; the theory loader path already includes this directory
8145 by default; the following existing theories have been moved here:
8146 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
8147 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
8149 * HOL/Unix: "Some aspects of Unix file-system security", a typical
8150 modelling and verification task performed in Isabelle/HOL +
8151 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
8153 * HOL/Algebra: special summation operator SUM no longer exists, it has
8154 been replaced by setsum; infix 'assoc' now has priority 50 (like
8155 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
8156 'domain', this makes the theory consistent with mathematical
8159 * HOL basics: added overloaded operations "inverse" and "divide"
8160 (infix "/"), syntax for generic "abs" operation, generic summation
8163 * HOL/typedef: simplified package, provide more useful rules (see also
8166 * HOL/datatype: induction rule for arbitrarily branching datatypes is
8167 now expressed as a proper nested rule (old-style tactic scripts may
8168 require atomize_strip_tac to cope with non-atomic premises);
8170 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
8171 to "split_conv" (old name still available for compatibility);
8173 * HOL: improved concrete syntax for strings (e.g. allows translation
8174 rules with string literals);
8176 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
8177 and Fleuriot's mechanization of analysis, including the transcendental
8178 functions for the reals;
8180 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
8185 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
8186 "lam" is displayed as TWO lambda-symbols
8188 * CTT: theory Main now available, containing everything (that is, Bool
8194 * Pure: the Simplifier has been implemented properly as a derived rule
8195 outside of the actual kernel (at last!); the overall performance
8196 penalty in practical applications is about 50%, while reliability of
8197 the Isabelle inference kernel has been greatly improved;
8199 * print modes "brackets" and "no_brackets" control output of nested =>
8200 (types) and ==> (props); the default behaviour is "brackets";
8202 * Provers: fast_tac (and friends) now handle actual object-logic rules
8203 as assumptions as well;
8205 * system: support Poly/ML 4.0;
8207 * system: isatool install handles KDE version 1 or 2;
8211 New in Isabelle99-1 (October 2000)
8212 ----------------------------------
8214 *** Overview of INCOMPATIBILITIES ***
8216 * HOL: simplification of natural numbers is much changed; to partly
8217 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
8218 issue the following ML commands:
8220 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
8221 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
8223 * HOL: simplification no longer dives into case-expressions; this is
8224 controlled by "t.weak_case_cong" for each datatype t;
8226 * HOL: nat_less_induct renamed to less_induct;
8228 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
8229 fixsome to patch .thy and .ML sources automatically;
8231 select_equality -> some_equality
8232 select_eq_Ex -> some_eq_ex
8233 selectI2EX -> someI2_ex
8236 select1_equality -> some1_equality
8237 Eps_sym_eq -> some_sym_eq_trivial
8238 Eps_eq -> some_eq_trivial
8240 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
8242 * HOL: removed obsolete theorem binding expand_if (refer to split_if
8245 * HOL: the recursion equations generated by 'recdef' are now called
8246 f.simps instead of f.rules;
8248 * HOL: qed_spec_mp now also handles bounded ALL as well;
8250 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
8251 sometimes be needed;
8253 * HOL: the constant for "f``x" is now "image" rather than "op ``";
8255 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
8257 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
8258 product is now "<*>" instead of "Times"; the lexicographic product is
8259 now "<*lex*>" instead of "**";
8261 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
8262 of main HOL, but was unused); better use HOL's datatype package;
8264 * HOL: removed "symbols" syntax for constant "override" of theory Map;
8265 the old syntax may be recovered as follows:
8268 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
8269 (infixl "\\<oplus>" 100)
8271 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8273 * HOL/ML: even fewer consts are declared as global (see theories Ord,
8274 Lfp, Gfp, WF); this only affects ML packages that refer to const names
8277 * HOL and ZF: syntax for quotienting wrt an equivalence relation
8278 changed from A/r to A//r;
8280 * ZF: new treatment of arithmetic (nat & int) may break some old
8283 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
8284 rulify -> rule_format, elimify -> elim_format, ...);
8286 * Isar/Provers: intro/elim/dest attributes changed; renamed
8287 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
8288 should have to change intro!! to intro? only); replaced "delrule" by
8291 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
8293 * Provers: strengthened force_tac by using new first_best_tac;
8295 * LaTeX document preparation: several changes of isabelle.sty (see
8299 *** Document preparation ***
8301 * formal comments (text blocks etc.) in new-style theories may now
8302 contain antiquotations of thm/prop/term/typ/text to be presented
8303 according to latex print mode; concrete syntax is like this:
8304 @{term[show_types] "f(x) = a + x"};
8306 * isatool mkdir provides easy setup of Isabelle session directories,
8307 including proper document sources;
8309 * generated LaTeX sources are now deleted after successful run
8310 (isatool document -c); may retain a copy somewhere else via -D option
8313 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
8314 style files, achieving self-contained LaTeX sources and simplifying
8317 * old-style theories now produce (crude) LaTeX output as well;
8319 * browser info session directories are now self-contained (may be put
8320 on WWW server seperately); improved graphs of nested sessions; removed
8321 graph for 'all sessions';
8323 * several improvements in isabelle style files; \isabellestyle{it}
8324 produces fake math mode output; \isamarkupheader is now \section by
8325 default; see lib/texinputs/isabelle.sty etc.;
8330 * Isar/Pure: local results and corresponding term bindings are now
8331 subject to Hindley-Milner polymorphism (similar to ML); this
8332 accommodates incremental type-inference very nicely;
8334 * Isar/Pure: new derived language element 'obtain' supports
8335 generalized existence reasoning;
8337 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
8338 support accumulation of results, without applying any rules yet;
8339 useful to collect intermediate results without explicit name
8340 references, and for use with transitivity rules with more than 2
8343 * Isar/Pure: scalable support for case-analysis type proofs: new
8344 'case' language element refers to local contexts symbolically, as
8345 produced by certain proof methods; internally, case names are attached
8346 to theorems as "tags";
8348 * Isar/Pure: theory command 'hide' removes declarations from
8349 class/type/const name spaces;
8351 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
8352 indicate potential overloading;
8354 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
8356 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
8357 "{a,b,c}" instead of {a,b,c};
8359 * Isar/Pure now provides its own version of intro/elim/dest
8360 attributes; useful for building new logics, but beware of confusion
8361 with the version in Provers/classical;
8363 * Isar/Pure: the local context of (non-atomic) goals is provided via
8364 case name 'antecedent';
8366 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
8367 to the current context is now done automatically);
8369 * Isar/Pure: theory command 'method_setup' provides a simple interface
8370 for definining proof methods in ML;
8372 * Isar/Provers: intro/elim/dest attributes changed; renamed
8373 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
8374 most cases, one should have to change intro!! to intro? only);
8375 replaced "delrule" by "rule del";
8377 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
8378 'symmetric' attribute (the latter supercedes [RS sym]);
8380 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
8381 method modifier); 'simp' method: 'only:' modifier removes loopers as
8382 well (including splits);
8384 * Isar/Provers: Simplifier and Classical methods now support all kind
8385 of modifiers used in the past, including 'cong', 'iff', etc.
8387 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
8388 of Simplifier and Classical reasoner);
8390 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
8391 now support named cases; major packages (inductive, datatype, primrec,
8392 recdef) support case names and properly name parameters;
8394 * Isar/HOL: new transitivity rules for substitution in inequalities --
8395 monotonicity conditions are extracted to be proven at end of
8398 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
8401 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
8402 split_if split_if_asm; datatype package provides theorems foo.splits =
8403 foo.split foo.split_asm for each datatype;
8405 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
8406 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
8407 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
8408 use "(cases (simplified))" method in proper proof texts);
8410 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
8412 * Isar: names of theorems etc. may be natural numbers as well;
8414 * Isar: 'pr' command: optional arguments for goals_limit and
8415 ProofContext.prems_limit; no longer prints theory contexts, but only
8418 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
8419 additional print modes to be specified; e.g. "pr(latex)" will print
8420 proof state according to the Isabelle LaTeX style;
8422 * Isar: improved support for emulating tactic scripts, including proof
8423 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
8424 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
8425 (for HOL datatypes);
8427 * Isar: simplified (more robust) goal selection of proof methods: 1st
8428 goal, all goals, or explicit goal specifier (tactic emulation); thus
8429 'proof method scripts' have to be in depth-first order;
8431 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
8433 * Isar: removed 'help' command, which hasn't been too helpful anyway;
8434 should instead use individual commands for printing items
8435 (print_commands, print_methods etc.);
8437 * Isar: added 'nothing' --- the empty list of theorems;
8442 * HOL/MicroJava: formalization of a fragment of Java, together with a
8443 corresponding virtual machine and a specification of its bytecode
8444 verifier and a lightweight bytecode verifier, including proofs of
8445 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
8446 Cornelia Pusch (see also the homepage of project Bali at
8447 http://isabelle.in.tum.de/Bali/);
8449 * HOL/Algebra: new theory of rings and univariate polynomials, by
8452 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
8453 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
8456 * HOL/Lattice: fundamental concepts of lattice theory and order
8457 structures, including duals, properties of bounds versus algebraic
8458 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
8459 Theorem for complete lattices etc.; may also serve as a demonstration
8460 for abstract algebraic reasoning using axiomatic type classes, and
8461 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
8463 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
8466 * HOL/IMPP: extension of IMP with local variables and mutually
8467 recursive procedures, by David von Oheimb;
8469 * HOL/Lambda: converted into new-style theory and document;
8471 * HOL/ex/Multiquote: example of multiple nested quotations and
8472 anti-quotations -- basically a generalized version of de-Bruijn
8473 representation; very useful in avoiding lifting of operations;
8475 * HOL/record: added general record equality rule to simpset; fixed
8476 select-update simplification procedure to handle extended records as
8477 well; admit "r" as field name;
8479 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
8480 other numeric types and also as the identity of groups, rings, etc.;
8482 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
8483 Types nat and int belong to this axclass;
8485 * HOL: greatly improved simplification involving numerals of type nat, int, real:
8486 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
8487 i*j + k + j*#3*i simplifies to #4*(i*j) + k
8488 two terms #m*u and #n*u are replaced by #(m+n)*u
8489 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
8490 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
8491 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
8493 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
8494 powerful prover for predicate logic but knows nothing of clasets; see
8495 ex/mesontest.ML and ex/mesontest2.ML for example applications;
8497 * HOL: new version of "case_tac" subsumes both boolean case split and
8498 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
8499 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
8501 * HOL: simplification no longer dives into case-expressions: only the
8502 selector expression is simplified, but not the remaining arms; to
8503 enable full simplification of case-expressions for datatype t, you may
8504 remove t.weak_case_cong from the simpset, either globally (Delcongs
8505 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
8507 * HOL/recdef: the recursion equations generated by 'recdef' for
8508 function 'f' are now called f.simps instead of f.rules; if all
8509 termination conditions are proved automatically, these simplification
8510 rules are added to the simpset, as in primrec; rules may be named
8511 individually as well, resulting in a separate list of theorems for
8514 * HOL/While is a new theory that provides a while-combinator. It
8515 permits the definition of tail-recursive functions without the
8516 provision of a termination measure. The latter is necessary once the
8517 invariant proof rule for while is applied.
8519 * HOL: new (overloaded) notation for the set of elements below/above
8520 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
8522 * HOL: theorems impI, allI, ballI bound as "strip";
8524 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
8525 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
8526 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
8528 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8530 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
8531 main HOL, but was unused);
8533 * HOL: fewer consts declared as global (e.g. have to refer to
8534 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
8536 * HOL: tuned AST representation of nested pairs, avoiding bogus output
8537 in case of overlap with user translations (e.g. judgements over
8538 tuples); (note that the underlying logical represenation is still
8544 * ZF: simplification automatically cancels common terms in arithmetic
8545 expressions over nat and int;
8547 * ZF: new treatment of nat to minimize type-checking: all operators
8548 coerce their operands to a natural number using the function natify,
8549 making the algebraic laws unconditional;
8551 * ZF: as above, for int: operators coerce their operands to an integer
8552 using the function intify;
8554 * ZF: the integer library now contains many of the usual laws for the
8555 orderings, including $<=, and monotonicity laws for $+ and $*;
8557 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
8560 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
8561 to the simplifier and classical reasoner simultaneously;
8566 * Provers: blast_tac now handles actual object-logic rules as
8567 assumptions; note that auto_tac uses blast_tac internally as well;
8569 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
8570 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
8572 * Provers: delrules now handles destruct rules as well (no longer need
8573 explicit make_elim);
8575 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
8576 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8577 use instead the strong form,
8578 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8579 in HOL, FOL and ZF the function cla_make_elim will create such rules
8580 from destruct-rules;
8582 * Provers: Simplifier.easy_setup provides a fast path to basic
8583 Simplifier setup for new object-logics;
8585 * Pure: AST translation rules no longer require constant head on LHS;
8587 * Pure: improved name spaces: ambiguous output is qualified; support
8588 for hiding of names;
8590 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
8591 XSYMBOL_HOME; no longer need to do manual configuration in most
8594 * system: compression of ML heaps images may now be controlled via -c
8595 option of isabelle and isatool usedir (currently only observed by
8598 * system: isatool installfonts may handle X-Symbol fonts as well (very
8599 useful for remote X11);
8601 * system: provide TAGS file for Isabelle sources;
8603 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
8606 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
8607 timing flag supersedes proof_timing and Toplevel.trace;
8609 * ML: new combinators |>> and |>>> for incremental transformations
8610 with secondary results (e.g. certain theory extensions):
8612 * ML: PureThy.add_defs gets additional argument to indicate potential
8613 overloading (usually false);
8615 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
8620 New in Isabelle99 (October 1999)
8621 --------------------------------
8623 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8625 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
8626 are no longer simplified. (This allows the simplifier to unfold recursive
8627 functional programs.) To restore the old behaviour, declare
8629 Delcongs [if_weak_cong];
8631 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
8634 * HOL: the predicate "inj" is now defined by translation to "inj_on";
8636 * HOL/datatype: mutual_induct_tac no longer exists --
8637 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
8639 * HOL/typedef: fixed type inference for representing set; type
8640 arguments now have to occur explicitly on the rhs as type constraints;
8642 * ZF: The con_defs part of an inductive definition may no longer refer
8643 to constants declared in the same theory;
8645 * HOL, ZF: the function mk_cases, generated by the inductive
8646 definition package, has lost an argument. To simplify its result, it
8647 uses the default simpset instead of a supplied list of theorems.
8649 * HOL/List: the constructors of type list are now Nil and Cons;
8651 * Simplifier: the type of the infix ML functions
8652 setSSolver addSSolver setSolver addSolver
8653 is now simpset * solver -> simpset where `solver' is a new abstract type
8654 for packaging solvers. A solver is created via
8655 mk_solver: string -> (thm list -> int -> tactic) -> solver
8656 where the string argument is only a comment.
8661 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
8662 decision procedure for linear arithmetic. Currently it is used for
8663 types `nat', `int', and `real' in HOL (see below); it can, should and
8664 will be instantiated for other types and logics as well.
8666 * The simplifier now accepts rewrite rules with flexible heads, eg
8667 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
8668 They are applied like any rule with a non-pattern lhs, i.e. by first-order
8674 * New Isabelle/Isar subsystem provides an alternative to traditional
8675 tactical theorem proving; together with the ProofGeneral/isar user
8676 interface it offers an interactive environment for developing human
8677 readable proof documents (Isar == Intelligible semi-automated
8678 reasoning); for further information see isatool doc isar-ref,
8679 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
8681 * improved and simplified presentation of theories: better HTML markup
8682 (including colors), graph views in several sizes; isatool usedir now
8683 provides a proper interface for user theories (via -P option); actual
8684 document preparation based on (PDF)LaTeX is available as well (for
8685 new-style theories only); see isatool doc system for more information;
8687 * native support for Proof General, both for classic Isabelle and
8690 * ML function thm_deps visualizes dependencies of theorems and lemmas,
8691 using the graph browser tool;
8693 * Isabelle manuals now also available as PDF;
8695 * theory loader rewritten from scratch (may not be fully
8696 bug-compatible); old loadpath variable has been replaced by show_path,
8697 add_path, del_path, reset_path functions; new operations such as
8698 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
8701 * improved isatool install: option -k creates KDE application icon,
8702 option -p DIR installs standalone binaries;
8704 * added ML_PLATFORM setting (useful for cross-platform installations);
8705 more robust handling of platform specific ML images for SML/NJ;
8707 * the settings environment is now statically scoped, i.e. it is never
8708 created again in sub-processes invoked from isabelle, isatool, or
8711 * path element specification '~~' refers to '$ISABELLE_HOME';
8713 * in locales, the "assumes" and "defines" parts may be omitted if
8716 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
8719 * new print_mode "HTML";
8721 * new flag show_tags controls display of tags of theorems (which are
8722 basically just comments that may be attached by some tools);
8724 * Isamode 2.6 requires patch to accomodate change of Isabelle font
8725 mode and goal output format:
8727 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
8729 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
8731 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
8732 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
8734 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
8736 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
8738 * function bind_thms stores lists of theorems (cf. bind_thm);
8740 * new shorthand tactics ftac, eatac, datac, fatac;
8742 * qed (and friends) now accept "" as result name; in that case the
8743 theorem is not stored, but proper checks and presentation of the
8746 * theorem database now also indexes constants "Trueprop", "all",
8747 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
8752 ** HOL arithmetic **
8754 * There are now decision procedures for linear arithmetic over nat and
8757 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
8758 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
8759 are treated as atomic; subformulae not involving type `nat' or `int'
8760 are ignored; quantified subformulae are ignored unless they are
8761 positive universal or negative existential. The tactic has to be
8762 invoked by hand and can be a little bit slow. In particular, the
8763 running time is exponential in the number of occurrences of `min' and
8764 `max', and `-' on `nat'.
8766 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
8767 (negated) (in)equalities among the premises and the conclusion into
8768 account (i.e. no compound formulae) and does not know about `min' and
8769 `max', and `-' on `nat'. It is fast and is used automatically by the
8772 NB: At the moment, these decision procedures do not cope with mixed
8773 nat/int formulae where the two parts interact, such as `m < n ==>
8776 * HOL/Numeral provides a generic theory of numerals (encoded
8777 efficiently as bit strings); setup for types nat/int/real is in place;
8778 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
8779 int, existing theories and proof scripts may require a few additional
8782 * integer division and remainder can now be performed on constant
8785 * many properties of integer multiplication, division and remainder
8788 * An interface to the Stanford Validity Checker (SVC) is available through the
8789 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
8790 are proved automatically. SVC must be installed separately, and its results
8791 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
8792 invocation of the underlying oracle). For SVC see
8793 http://verify.stanford.edu/SVC
8795 * IsaMakefile: the HOL-Real target now builds an actual image;
8800 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
8801 (in Isabelle/Isar) -- by Gertrud Bauer;
8803 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
8804 analysis for assembly languages with subtypes;
8806 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
8807 -- avoids syntactic ambiguities and treats state, transition, and
8808 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
8809 changed syntax and (many) tactics;
8811 * HOL/inductive: Now also handles more general introduction rules such
8812 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
8813 theorems are now maintained within the theory (maintained via the
8816 * HOL/datatype: Now also handles arbitrarily branching datatypes
8817 (using function types) such as
8819 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
8821 * HOL/record: record_simproc (part of the default simpset) takes care
8822 of selectors applied to updated records; record_split_tac is no longer
8823 part of the default claset; update_defs may now be removed from the
8824 simpset in many cases; COMPATIBILITY: old behavior achieved by
8826 claset_ref () := claset() addSWrapper record_split_wrapper;
8827 Delsimprocs [record_simproc]
8829 * HOL/typedef: fixed type inference for representing set; type
8830 arguments now have to occur explicitly on the rhs as type constraints;
8832 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
8833 names rather than an ML expression;
8835 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
8836 supplied later. Program schemes can be defined, such as
8837 "While B C s = (if B s then While B C (C s) else s)"
8838 where the well-founded relation can be chosen after B and C have been given.
8840 * HOL/List: the constructors of type list are now Nil and Cons;
8841 INCOMPATIBILITY: while [] and infix # syntax is still there, of
8842 course, ML tools referring to List.list.op # etc. have to be adapted;
8844 * HOL_quantifiers flag superseded by "HOL" print mode, which is
8845 disabled by default; run isabelle with option -m HOL to get back to
8846 the original Gordon/HOL-style output;
8848 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
8849 ALL x<=y. P, EX x<y. P, EX x<=y. P;
8851 * HOL basic syntax simplified (more orthogonal): all variants of
8852 All/Ex now support plain / symbolic / HOL notation; plain syntax for
8853 Eps operator is provided as well: "SOME x. P[x]";
8855 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
8857 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
8858 thus available for user theories;
8860 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
8861 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
8864 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
8865 several times and then mp;
8870 * the notation <<...>> is now available as a notation for sequences of
8873 * the simplifier is now installed
8875 * the axiom system has been generalized (thanks to Soren Heilmann)
8877 * the classical reasoner now has a default rule database
8882 * new primrec section allows primitive recursive functions to be given
8883 directly (as in HOL) over datatypes and the natural numbers;
8885 * new tactics induct_tac and exhaust_tac for induction (or case
8886 analysis) over datatypes and the natural numbers;
8888 * the datatype declaration of type T now defines the recursor T_rec;
8890 * simplification automatically does freeness reasoning for datatype
8893 * automatic type-inference, with AddTCs command to insert new
8894 type-checking rules;
8896 * datatype introduction rules are now added as Safe Introduction rules
8899 * the syntax "if P then x else y" is now available in addition to
8903 *** Internal programming interfaces ***
8905 * tuned simplifier trace output; new flag debug_simp;
8907 * structures Vartab / Termtab (instances of TableFun) offer efficient
8908 tables indexed by indexname_ord / term_ord (compatible with aconv);
8910 * AxClass.axclass_tac lost the theory argument;
8912 * tuned current_goals_markers semantics: begin / end goal avoids
8913 printing empty lines;
8915 * removed prs and prs_fn hook, which was broken because it did not
8916 include \n in its semantics, forcing writeln to add one
8917 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
8918 string -> unit if you really want to output text without newline;
8920 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
8921 plain output, interface builders may have to enable 'isabelle_font'
8922 mode to get Isabelle font glyphs as before;
8924 * refined token_translation interface; INCOMPATIBILITY: output length
8925 now of type real instead of int;
8927 * theory loader actions may be traced via new ThyInfo.add_hook
8928 interface (see src/Pure/Thy/thy_info.ML); example application: keep
8929 your own database of information attached to *whole* theories -- as
8930 opposed to intra-theory data slots offered via TheoryDataFun;
8932 * proper handling of dangling sort hypotheses (at last!);
8933 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
8934 extra sort hypotheses that can be witnessed from the type signature;
8935 the force_strip_shyps flag is gone, any remaining shyps are simply
8936 left in the theorem (with a warning issued by strip_shyps_warning);
8940 New in Isabelle98-1 (October 1998)
8941 ----------------------------------
8943 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8945 * several changes of automated proof tools;
8947 * HOL: major changes to the inductive and datatype packages, including
8948 some minor incompatibilities of theory syntax;
8950 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
8953 * HOL: removed duplicate thms in Arith:
8954 less_imp_add_less should be replaced by trans_less_add1
8955 le_imp_add_le should be replaced by trans_le_add1
8957 * HOL: unary minus is now overloaded (new type constraints may be
8960 * HOL and ZF: unary minus for integers is now #- instead of #~. In
8961 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
8962 now taken as an integer constant.
8964 * Pure: ML function 'theory_of' renamed to 'theory';
8970 1. Asm_full_simp_tac is now more aggressive.
8971 1. It will sometimes reorient premises if that increases their power to
8973 2. It does no longer proceed strictly from left to right but may also
8974 rotate premises to achieve further simplification.
8975 For compatibility reasons there is now Asm_lr_simp_tac which is like the
8976 old Asm_full_simp_tac in that it does not rotate premises.
8977 2. The simplifier now knows a little bit about nat-arithmetic.
8979 * Classical reasoner: wrapper mechanism for the classical reasoner now
8980 allows for selected deletion of wrappers, by introduction of names for
8981 wrapper functionals. This implies that addbefore, addSbefore,
8982 addaltern, and addSaltern now take a pair (name, tactic) as argument,
8983 and that adding two tactics with the same name overwrites the first
8984 one (emitting a warning).
8985 type wrapper = (int -> tactic) -> (int -> tactic)
8986 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
8987 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
8988 delWrapper, delSWrapper: claset * string -> claset
8989 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
8991 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
8992 semantics; addbefore now affects only the unsafe part of step_tac
8993 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
8994 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
8997 * Classical reasoner: setwrapper to setWrapper and compwrapper to
8998 compWrapper; added safe wrapper (and access functions for it);
9000 * HOL/split_all_tac is now much faster and fails if there is nothing
9001 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
9002 and the names of the automatically generated variables have changed.
9003 split_all_tac has moved within claset() from unsafe wrappers to safe
9004 wrappers, which means that !!-bound variables are split much more
9005 aggressively, and safe_tac and clarify_tac now split such variables.
9006 If this splitting is not appropriate, use delSWrapper "split_all_tac".
9007 Note: the same holds for record_split_tac, which does the job of
9008 split_all_tac for record fields.
9010 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
9011 permanently to the default simpset using Addsplits just like
9012 Addsimps. They can be removed via Delsplits just like
9013 Delsimps. Lower-case versions are also available.
9015 * HOL/Simplifier: The rule split_if is now part of the default
9016 simpset. This means that the simplifier will eliminate all occurrences
9017 of if-then-else in the conclusion of a goal. To prevent this, you can
9018 either remove split_if completely from the default simpset by
9019 `Delsplits [split_if]' or remove it in a specific call of the
9020 simplifier using `... delsplits [split_if]'. You can also add/delete
9021 other case splitting rules to/from the default simpset: every datatype
9022 generates suitable rules `split_t_case' and `split_t_case_asm' (where
9023 t is the name of the datatype).
9025 * Classical reasoner / Simplifier combination: new force_tac (and
9026 derivatives Force_tac, force) combines rewriting and classical
9027 reasoning (and whatever other tools) similarly to auto_tac, but is
9028 aimed to solve the given subgoal completely.
9033 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
9034 and `goalw': the theory is no longer needed as an explicit argument -
9035 the current theory context is used; assumptions are no longer returned
9036 at the ML-level unless one of them starts with ==> or !!; it is
9037 recommended to convert to these new commands using isatool fixgoal
9038 (backup your sources first!);
9040 * new top-level commands 'thm' and 'thms' for retrieving theorems from
9041 the current theory context, and 'theory' to lookup stored theories;
9043 * new theory section 'locale' for declaring constants, assumptions and
9044 definitions that have local scope;
9046 * new theory section 'nonterminals' for purely syntactic types;
9048 * new theory section 'setup' for generic ML setup functions
9049 (e.g. package initialization);
9051 * the distribution now includes Isabelle icons: see
9052 lib/logo/isabelle-{small,tiny}.xpm;
9054 * isatool install - install binaries with absolute references to
9057 * isatool logo -- create instances of the Isabelle logo (as EPS);
9059 * print mode 'emacs' reserved for Isamode;
9061 * support multiple print (ast) translations per constant name;
9063 * theorems involving oracles are now printed with a suffixed [!];
9068 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
9070 * HOL/inductive package reorganized and improved: now supports mutual
9076 oddI "n : EVEN ==> Suc n : ODD"
9077 evenI "n : ODD ==> Suc n : EVEN"
9079 new theorem list "elims" contains an elimination rule for each of the
9080 recursive sets; inductive definitions now handle disjunctive premises
9081 correctly (also ZF);
9083 INCOMPATIBILITIES: requires Inductive as an ancestor; component
9084 "mutual_induct" no longer exists - the induction rule is always
9085 contained in "induct";
9088 * HOL/datatype package re-implemented and greatly improved: now
9089 supports mutually recursive datatypes such as
9092 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
9093 | SUM ('a aexp) ('a aexp)
9094 | DIFF ('a aexp) ('a aexp)
9097 'a bexp = LESS ('a aexp) ('a aexp)
9098 | AND ('a bexp) ('a bexp)
9099 | OR ('a bexp) ('a bexp)
9101 as well as indirectly recursive datatypes such as
9104 ('a, 'b) term = Var 'a
9105 | App 'b ((('a, 'b) term) list)
9107 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
9108 induction on mutually / indirectly recursive datatypes.
9110 Primrec equations are now stored in theory and can be accessed via
9111 <function_name>.simps.
9115 - Theories using datatypes must now have theory Datatype as an
9117 - The specific <typename>.induct_tac no longer exists - use the
9118 generic induct_tac instead.
9119 - natE has been renamed to nat.exhaust - use exhaust_tac
9120 instead of res_inst_tac ... natE. Note that the variable
9121 names in nat.exhaust differ from the names in natE, this
9122 may cause some "fragile" proofs to fail.
9123 - The theorems split_<typename>_case and split_<typename>_case_asm
9124 have been renamed to <typename>.split and <typename>.split_asm.
9125 - Since default sorts of type variables are now handled correctly,
9126 some datatype definitions may have to be annotated with explicit
9128 - Primrec definitions no longer require function name and type
9129 of recursive argument.
9131 Consider using isatool fixdatatype to adapt your theories and proof
9132 scripts to the new package (backup your sources first!).
9135 * HOL/record package: considerably improved implementation; now
9136 includes concrete syntax for record types, terms, updates; theorems
9137 for surjective pairing and splitting !!-bound record variables; proof
9138 support is as follows:
9140 1) standard conversions (selectors or updates applied to record
9141 constructor terms) are part of the standard simpset;
9143 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
9144 made part of standard simpset and claset via addIffs;
9146 3) a tactic for record field splitting (record_split_tac) is part of
9147 the standard claset (addSWrapper);
9149 To get a better idea about these rules you may retrieve them via
9150 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
9151 the name of your record type.
9153 The split tactic 3) conceptually simplifies by the following rule:
9155 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
9157 Thus any record variable that is bound by meta-all will automatically
9158 blow up into some record constructor term, consequently the
9159 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
9160 solve record problems automatically.
9163 * reorganized the main HOL image: HOL/Integ and String loaded by
9164 default; theory Main includes everything;
9166 * automatic simplification of integer sums and comparisons, using cancellation;
9168 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
9170 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
9172 * many new identities for unions, intersections, set difference, etc.;
9174 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
9175 called split_if, split_split, split_sum_case and split_nat_case (to go
9176 with add/delsplits);
9178 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
9179 (?x::unit) = (); this is made part of the default simpset, which COULD
9180 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
9181 'Delsimprocs [unit_eq_proc];' as last resort); also note that
9182 unit_abs_eta_conv is added in order to counter the effect of
9183 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
9186 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
9189 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9190 It and 'sym RS equals0D' are now in the default claset, giving automatic
9191 disjointness reasoning but breaking a few old proofs.
9193 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
9194 to 'converse' from 'inverse' (for compatibility with ZF and some
9197 * HOL/recdef can now declare non-recursive functions, with {} supplied as
9198 the well-founded relation;
9200 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
9201 Compl A. The "Compl" syntax remains available as input syntax for this
9204 * HOL/Update: new theory of function updates:
9205 f(a:=b) == %x. if x=a then b else f x
9206 may also be iterated as in f(a:=b,c:=d,...);
9208 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
9211 - new function list_update written xs[i:=v] that updates the i-th
9212 list position. May also be iterated as in xs[i:=a,j:=b,...].
9213 - new function `upt' written [i..j(] which generates the list
9214 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
9215 bound write [i..j], which is a shorthand for [i..j+1(].
9216 - new lexicographic orderings and corresponding wellfoundedness theorems.
9219 - removed 'pred' (predecessor) function;
9220 - generalized some theorems about n-1;
9221 - many new laws about "div" and "mod";
9222 - new laws about greatest common divisors (see theory ex/Primes);
9224 * HOL/Relation: renamed the relational operator r^-1 "converse"
9225 instead of "inverse";
9227 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
9228 of the multiset ordering;
9230 * directory HOL/Real: a construction of the reals using Dedekind cuts
9231 (not included by default);
9233 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
9235 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
9236 programs, i.e. different program variables may have different types.
9238 * calling (stac rew i) now fails if "rew" has no effect on the goal
9239 [previously, this check worked only if the rewrite rule was unconditional]
9240 Now rew can involve either definitions or equalities (either == or =).
9245 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
9246 only the theorems proved on ZF.ML;
9248 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9249 It and 'sym RS equals0D' are now in the default claset, giving automatic
9250 disjointness reasoning but breaking a few old proofs.
9252 * ZF/Update: new theory of function updates
9253 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
9254 may also be iterated as in f(a:=b,c:=d,...);
9256 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
9258 * calling (stac rew i) now fails if "rew" has no effect on the goal
9259 [previously, this check worked only if the rewrite rule was unconditional]
9260 Now rew can involve either definitions or equalities (either == or =).
9262 * case_tac provided for compatibility with HOL
9263 (like the old excluded_middle_tac, but with subgoals swapped)
9266 *** Internal programming interfaces ***
9268 * Pure: several new basic modules made available for general use, see
9269 also src/Pure/README;
9271 * improved the theory data mechanism to support encapsulation (data
9272 kind name replaced by private Object.kind, acting as authorization
9273 key); new type-safe user interface via functor TheoryDataFun; generic
9274 print_data function becomes basically useless;
9276 * removed global_names compatibility flag -- all theory declarations
9277 are qualified by default;
9279 * module Pure/Syntax now offers quote / antiquote translation
9280 functions (useful for Hoare logic etc. with implicit dependencies);
9281 see HOL/ex/Antiquote for an example use;
9283 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
9286 * new tactical CHANGED_GOAL for checking that a tactic modifies a
9289 * Display.print_goals function moved to Locale.print_goals;
9291 * standard print function for goals supports current_goals_markers
9292 variable for marking begin of proof, end of proof, start of goal; the
9293 default is ("", "", ""); setting current_goals_markers := ("<proof>",
9294 "</proof>", "<goal>") causes SGML like tagged proof state printing,
9299 New in Isabelle98 (January 1998)
9300 --------------------------------
9302 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9304 * changed lexical syntax of terms / types: dots made part of long
9305 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
9307 * simpset (and claset) reference variable replaced by functions
9308 simpset / simpset_ref;
9310 * no longer supports theory aliases (via merge) and non-trivial
9311 implicit merge of thms' signatures;
9313 * most internal names of constants changed due to qualified names;
9315 * changed Pure/Sequence interface (see Pure/seq.ML);
9318 *** General Changes ***
9320 * hierachically structured name spaces (for consts, types, axms, thms
9321 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
9322 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
9323 isatool fixdots ensures space after dots (e.g. "%x. x"); set
9324 long_names for fully qualified output names; NOTE: ML programs
9325 (special tactics, packages etc.) referring to internal names may have
9326 to be adapted to cope with fully qualified names; in case of severe
9327 backward campatibility problems try setting 'global_names' at compile
9328 time to have enrything declared within a flat name space; one may also
9329 fine tune name declarations in theories via the 'global' and 'local'
9332 * reimplemented the implicit simpset and claset using the new anytype
9333 data filed in signatures; references simpset:simpset ref etc. are
9334 replaced by functions simpset:unit->simpset and
9335 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
9336 to patch your ML files accordingly;
9338 * HTML output now includes theory graph data for display with Java
9339 applet or isatool browser; data generated automatically via isatool
9340 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
9342 * defs may now be conditional; improved rewrite_goals_tac to handle
9343 conditional equations;
9345 * defs now admits additional type arguments, using TYPE('a) syntax;
9347 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
9348 creates a new theory node; implicit merge of thms' signatures is
9349 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
9350 transfer:theory->thm->thm in (rare) cases;
9352 * improved handling of draft signatures / theories; draft thms (and
9353 ctyps, cterms) are automatically promoted to real ones;
9355 * slightly changed interfaces for oracles: admit many per theory, named
9356 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
9358 * print_goals: optional output of const types (set show_consts and
9361 * improved output of warnings (###) and errors (***);
9363 * subgoal_tac displays a warning if the new subgoal has type variables;
9365 * removed old README and Makefiles;
9367 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
9369 * removed obsolete init_pps and init_database;
9371 * deleted the obsolete tactical STATE, which was declared by
9372 fun STATE tacfun st = tacfun st st;
9374 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
9375 (which abbreviates $HOME);
9377 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
9378 use isatool fixseq to adapt your ML programs (this works for fully
9379 qualified references to the Sequence structure only!);
9381 * use_thy no longer requires writable current directory; it always
9382 reloads .ML *and* .thy file, if either one is out of date;
9385 *** Classical Reasoner ***
9387 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
9388 tactics that use classical reasoning to simplify a subgoal without
9389 splitting it into several subgoals;
9391 * Safe_tac: like safe_tac but uses the default claset;
9396 * added simplification meta rules:
9397 (asm_)(full_)simplify: simpset -> thm -> thm;
9399 * simplifier.ML no longer part of Pure -- has to be loaded by object
9402 * added prems argument to simplification procedures;
9404 * HOL, FOL, ZF: added infix function `addsplits':
9405 instead of `<simpset> setloop (split_tac <thms>)'
9406 you can simply write `<simpset> addsplits <thms>'
9411 * TYPE('a) syntax for type reflection terms;
9413 * no longer handles consts with name "" -- declare as 'syntax' instead;
9415 * pretty printer: changed order of mixfix annotation preference (again!);
9417 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
9422 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
9423 with `addloop' of the simplifier to faciliate case splitting in premises.
9425 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
9427 * HOL/Auth: new protocol proofs including some for the Internet
9430 * HOL/Map: new theory of `maps' a la VDM;
9432 * HOL/simplifier: simplification procedures nat_cancel_sums for
9433 cancelling out common nat summands from =, <, <= (in)equalities, or
9434 differences; simplification procedures nat_cancel_factor for
9435 cancelling common factor from =, <, <= (in)equalities over natural
9436 sums; nat_cancel contains both kinds of procedures, it is installed by
9437 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
9439 * HOL/simplifier: terms of the form
9440 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
9442 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
9443 and those of the form
9444 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
9446 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
9449 Each datatype `t' now comes with a theorem `split_t_case' of the form
9451 P(t_case f1 ... fn x) =
9452 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
9454 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
9457 and a theorem `split_t_case_asm' of the form
9459 P(t_case f1 ... fn x) =
9460 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
9462 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
9464 which can be added to a simpset via `addsplits'. The existing theorems
9465 expand_list_case and expand_option_case have been renamed to
9466 split_list_case and split_option_case.
9469 - `pred n' is automatically converted to `n-1'.
9470 Users are strongly encouraged not to use `pred' any longer,
9471 because it will disappear altogether at some point.
9472 - Users are strongly encouraged to write "0 < n" rather than
9473 "n ~= 0". Theorems and proof tools have been modified towards this
9477 the function "set_of_list" has been renamed "set" (and its theorems too);
9478 the function "nth" now takes its arguments in the reverse order and
9479 has acquired the infix notation "!" as in "xs!n".
9481 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
9483 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
9484 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
9486 * HOL/record: extensible records with schematic structural subtyping
9487 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
9488 still lacks various theorems and concrete record syntax;
9493 * removed "axioms" and "generated by" sections;
9495 * replaced "ops" section by extended "consts" section, which is capable of
9496 handling the continuous function space "->" directly;
9499 . proves theorems immediately and stores them in the theory,
9500 . creates hierachical name space,
9501 . now uses normal mixfix annotations (instead of cinfix...),
9502 . minor changes to some names and values (for consistency),
9503 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
9504 . separator between mutual domain defs: changed "," to "and",
9505 . improved handling of sort constraints; now they have to
9506 appear on the left-hand side of the equations only;
9508 * fixed LAM <x,y,zs>.b syntax;
9510 * added extended adm_tac to simplifier in HOLCF -- can now discharge
9511 adm (%x. P (t x)), where P is chainfinite and t continuous;
9516 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
9517 with `addloop' of the simplifier to faciliate case splitting in premises.
9519 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
9520 in HOL, they strip ALL and --> from proved theorems;
9524 New in Isabelle94-8 (May 1997)
9525 ------------------------------
9527 *** General Changes ***
9529 * new utilities to build / run / maintain Isabelle etc. (in parts
9530 still somewhat experimental); old Makefiles etc. still functional;
9532 * new 'Isabelle System Manual';
9534 * INSTALL text, together with ./configure and ./build scripts;
9536 * reimplemented type inference for greater efficiency, better error
9537 messages and clean internal interface;
9539 * prlim command for dealing with lots of subgoals (an easier way of
9540 setting goals_limit);
9545 * supports alternative (named) syntax tables (parser and pretty
9546 printer); internal interface is provided by add_modesyntax(_i);
9548 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
9549 be used in conjunction with the Isabelle symbol font; uses the
9550 "symbols" syntax table;
9552 * added token_translation interface (may translate name tokens in
9553 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
9554 the current print_mode); IMPORTANT: user print translation functions
9555 are responsible for marking newly introduced bounds
9556 (Syntax.mark_boundT);
9558 * token translations for modes "xterm" and "xterm_color" that display
9559 names in bold, underline etc. or colors (which requires a color
9562 * infixes may now be declared with names independent of their syntax;
9564 * added typed_print_translation (like print_translation, but may
9565 access type of constant);
9568 *** Classical Reasoner ***
9570 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
9571 some limitations. Blast_tac...
9572 + ignores addss, addbefore, addafter; this restriction is intrinsic
9573 + ignores elimination rules that don't have the correct format
9574 (the conclusion MUST be a formula variable)
9575 + ignores types, which can make HOL proofs fail
9576 + rules must not require higher-order unification, e.g. apply_type in ZF
9577 [message "Function Var's argument not a bound variable" relates to this]
9578 + its proof strategy is more general but can actually be slower
9580 * substitution with equality assumptions no longer permutes other
9583 * minor changes in semantics of addafter (now called addaltern); renamed
9584 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
9585 (and access functions for it);
9587 * improved combination of classical reasoner and simplifier:
9588 + functions for handling clasimpsets
9589 + improvement of addss: now the simplifier is called _after_ the
9591 + safe variant of addss called addSss: uses safe simplifications
9592 _during_ the safe steps. It is more complete as it allows multiple
9593 instantiations of unknowns (e.g. with slow_tac).
9597 * added interface for simplification procedures (functions that
9598 produce *proven* rewrite rules on the fly, depending on current
9601 * ordering on terms as parameter (used for ordered rewriting);
9603 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
9605 * the solver is now split into a safe and an unsafe part.
9606 This should be invisible for the normal user, except that the
9607 functions setsolver and addsolver have been renamed to setSolver and
9608 addSolver; added safe_asm_full_simp_tac;
9613 * a generic induction tactic `induct_tac' which works for all datatypes and
9614 also for type `nat';
9616 * a generic case distinction tactic `exhaust_tac' which works for all
9617 datatypes and also for type `nat';
9619 * each datatype comes with a function `size';
9621 * patterns in case expressions allow tuple patterns as arguments to
9622 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
9624 * primrec now also works with type nat;
9626 * recdef: a new declaration form, allows general recursive functions to be
9627 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
9629 * the constant for negation has been renamed from "not" to "Not" to
9630 harmonize with FOL, ZF, LK, etc.;
9632 * HOL/ex/LFilter theory of a corecursive "filter" functional for
9635 * HOL/Modelcheck demonstrates invocation of model checker oracle;
9637 * HOL/ex/Ring.thy declares cring_simp, which solves equational
9638 problems in commutative rings, using axiomatic type classes for + and *;
9640 * more examples in HOL/MiniML and HOL/Auth;
9642 * more default rewrite rules for quantifiers, union/intersection;
9644 * a new constant `arbitrary == @x.False';
9646 * HOLCF/IOA replaces old HOL/IOA;
9648 * HOLCF changes: derived all rules and arities
9649 + axiomatic type classes instead of classes
9650 + typedef instead of faking type definitions
9651 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
9652 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
9653 + eliminated the types void, one, tr
9654 + use unit lift and bool lift (with translations) instead of one and tr
9655 + eliminated blift from Lift3.thy (use Def instead of blift)
9656 all eliminated rules are derived as theorems --> no visible changes ;
9661 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
9662 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
9663 as ZF_cs addSIs [equalityI];
9667 New in Isabelle94-7 (November 96)
9668 ---------------------------------
9670 * allowing negative levels (as offsets) in prlev and choplev;
9672 * super-linear speedup for large simplifications;
9674 * FOL, ZF and HOL now use miniscoping: rewriting pushes
9675 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
9676 FAIL); can suppress it using the command Delsimps (ex_simps @
9677 all_simps); De Morgan laws are also now included, by default;
9679 * improved printing of ==> : ~:
9681 * new object-logic "Sequents" adds linear logic, while replacing LK
9682 and Modal (thanks to Sara Kalvala);
9684 * HOL/Auth: correctness proofs for authentication protocols;
9686 * HOL: new auto_tac combines rewriting and classical reasoning (many
9687 examples on HOL/Auth);
9689 * HOL: new command AddIffs for declaring theorems of the form P=Q to
9690 the rewriter and classical reasoner simultaneously;
9692 * function uresult no longer returns theorems in "standard" format;
9693 regain previous version by: val uresult = standard o uresult;
9700 * oracles -- these establish an interface between Isabelle and trusted
9701 external reasoners, which may deliver results as theorems;
9703 * proof objects (in particular record all uses of oracles);
9705 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
9707 * "constdefs" section in theory files;
9709 * "primrec" section (HOL) no longer requires names;
9711 * internal type "tactic" now simply "thm -> thm Sequence.seq";
9718 * reduced space requirements;
9720 * automatic HTML generation from theories;
9722 * theory files no longer require "..." (quotes) around most types;
9724 * new examples, including two proofs of the Church-Rosser theorem;
9726 * non-curried (1994) version of HOL is no longer distributed;
9733 * greatly reduced space requirements;
9735 * theory files (.thy) no longer require \...\ escapes at line breaks;
9737 * searchable theorem database (see the section "Retrieving theorems" on
9738 page 8 of the Reference Manual);
9740 * new examples, including Grabczewski's monumental case study of the
9743 * The previous version of HOL renamed to Old_HOL;
9745 * The new version of HOL (previously called CHOL) uses a curried syntax
9746 for functions. Application looks like f a b instead of f(a,b);
9748 * Mutually recursive inductive definitions finally work in HOL;
9750 * In ZF, pattern-matching on tuples is now available in all abstractions and
9751 translates to the operator "split";
9758 * new infix operator, addss, allowing the classical reasoner to
9759 perform simplification at each step of its search. Example:
9760 fast_tac (cs addss ss)
9762 * a new logic, CHOL, the same as HOL, but with a curried syntax
9763 for functions. Application looks like f a b instead of f(a,b). Also pairs
9764 look like (a,b) instead of <a,b>;
9766 * PLEASE NOTE: CHOL will eventually replace HOL!
9768 * In CHOL, pattern-matching on tuples is now available in all abstractions.
9769 It translates to the operator "split". A new theory of integers is available;
9771 * In ZF, integer numerals now denote two's-complement binary integers.
9772 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
9774 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
9775 of the Axiom of Choice;
9782 * Significantly faster resolution;
9784 * the different sections in a .thy file can now be mixed and repeated
9787 * Database of theorems for FOL, HOL and ZF. New
9788 commands including qed, qed_goal and bind_thm store theorems in the database.
9790 * Simple database queries: return a named theorem (get_thm) or all theorems of
9791 a given theory (thms_of), or find out what theory a theorem was proved in
9794 * Bugs fixed in the inductive definition and datatype packages;
9796 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
9797 and HOL_dup_cs obsolete;
9799 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
9802 * Simpler definition of function space in ZF;
9804 * new results about cardinal and ordinal arithmetic in ZF;
9806 * 'subtype' facility in HOL for introducing new types as subsets of existing
9809 :mode=text:wrap=hard:maxLineLen=72: