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 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
19 use regular rule composition via "OF" / "THEN", or explicit proof
20 structure instead. Note that Isabelle/ML provides a variety of
21 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
22 with some care where this is really required.
27 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
32 - added an optimisation for equality premises.
33 It is switched on by default, and can be switched off by setting
34 the configuration quickcheck_optimise_equality to false.
36 * The SMT solver Z3 has now by default a restricted set of directly
37 supported features. For the full set of features (div/mod, nonlinear
38 arithmetic, datatypes/records) with potential proof reconstruction
39 failures, enable the configuration option "z3_with_extensions".
40 Minor INCOMPATIBILITY.
44 - Rationalized type encodings ("type_enc" option).
46 max_relevant ~> max_facts
47 relevance_thresholds ~> fact_thresholds
50 *** Document preparation ***
52 * Default for \<euro> is now based on eurosym package, instead of
53 slightly exotic babel/greek.
58 * Discontinued support for Poly/ML 5.2.1, which was the last version
59 without exception positions and advanced ML compiler/toplevel
64 New in Isabelle2012 (May 2012)
65 ------------------------------
69 * Prover IDE (PIDE) improvements:
71 - more robust Sledgehammer integration (as before the sledgehammer
72 command-line needs to be typed into the source buffer)
73 - markup for bound variables
74 - markup for types of term variables (displayed as tooltips)
75 - support for user-defined Isar commands within the running session
76 - improved support for Unicode outside original 16bit range
77 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
79 * Forward declaration of outer syntax keywords within the theory
80 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
81 commands to be used in the same theory where defined.
83 * Auxiliary contexts indicate block structure for specifications with
84 additional parameters and assumptions. Such unnamed contexts may be
85 nested within other targets, like 'theory', 'locale', 'class',
86 'instantiation' etc. Results from the local context are generalized
87 accordingly and applied to the enclosing target context. Example:
91 assumes xy: "x = y" and yz: "y = z"
94 lemma my_trans: "x = z" using xy yz by simp
100 The most basic application is to factor-out context elements of
101 several fixes/assumes/shows theorem statements, e.g. see
102 ~~/src/HOL/Isar_Examples/Group_Context.thy
104 Any other local theory specification element works within the "context
105 ... begin ... end" block as well.
107 * Bundled declarations associate attributed fact expressions with a
108 given name in the context. These may be later included in other
109 contexts. This allows to manage context extensions casually, without
110 the logical dependencies of locales and locale interpretation. See
111 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
113 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
114 declaration, and results are standardized before being stored. Thus
115 old-style "standard" after instantiation or composition of facts
116 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
117 indices of schematic variables.
119 * Rule attributes in local theory declarations (e.g. locale or class)
120 are now statically evaluated: the resulting theorem is stored instead
121 of the original expression. INCOMPATIBILITY in rare situations, where
122 the historic accident of dynamic re-evaluation in interpretations
125 * New tutorial "Programming and Proving in Isabelle/HOL"
126 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
127 Structured Isar Proofs" ("isar-overview"), which has been removed. It
128 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
129 Logic" as the recommended beginners tutorial, but does not cover all
130 of the material of that old tutorial.
132 * Updated and extended reference manuals: "isar-ref",
133 "implementation", "system"; reduced remaining material in old "ref"
139 * Command 'definition' no longer exports the foundational "raw_def"
140 into the user context. Minor INCOMPATIBILITY, may use the regular
141 "def" result with attribute "abs_def" to imitate the old version.
143 * Attribute "abs_def" turns an equation of the form "f x y == t" into
144 "f == %x y. t", which ensures that "simp" or "unfold" steps always
145 expand it. This also works for object-logic equality. (Formerly
146 undocumented feature.)
148 * Sort constraints are now propagated in simultaneous statements, just
149 like type constraints. INCOMPATIBILITY in rare situations, where
150 distinct sorts used to be assigned accidentally. For example:
152 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
154 lemma "P (x::'a)" and "Q (y::'a::bar)"
155 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
157 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
158 tolerant against multiple unifiers, as long as the final result is
159 unique. (As before, rules are composed in canonical right-to-left
160 order to accommodate newly introduced premises.)
162 * Renamed some inner syntax categories:
168 Minor INCOMPATIBILITY. Note that in practice "num_const" or
169 "num_position" etc. are mainly used instead (which also include
170 position information via constraints).
172 * Simplified configuration options for syntax ambiguity: see
173 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
174 manual. Minor INCOMPATIBILITY.
176 * Discontinued configuration option "syntax_positions": atomic terms
177 in parse trees are always annotated by position constraints.
179 * Old code generator for SML and its commands 'code_module',
180 'code_library', 'consts_code', 'types_code' have been discontinued.
181 Use commands of the generic code generator instead. INCOMPATIBILITY.
183 * Redundant attribute "code_inline" has been discontinued. Use
184 "code_unfold" instead. INCOMPATIBILITY.
186 * Dropped attribute "code_unfold_post" in favor of the its dual
187 "code_abbrev", which yields a common pattern in definitions like
189 definition [code_abbrev]: "f = t"
193 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
194 instead. INCOMPATIBILITY.
196 * Discontinued old "prems" fact, which used to refer to the accidental
197 collection of foundational premises in the context (already marked as
198 legacy since Isabelle2011).
203 * Type 'a set is now a proper type constructor (just as before
204 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
205 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
206 sets separate, it is often sufficient to rephrase some set S that has
207 been accidentally used as predicates by "%x. x : S", and some
208 predicate P that has been accidentally used as set by "{x. P x}".
209 Corresponding proofs in a first step should be pruned from any
210 tinkering with former theorems mem_def and Collect_def as far as
213 For developments which deliberately mix predicates and sets, a
214 planning step is necessary to determine what should become a predicate
215 and what a set. It can be helpful to carry out that step in
216 Isabelle2011-1 before jumping right into the current release.
218 * Code generation by default implements sets as container type rather
219 than predicates. INCOMPATIBILITY.
221 * New type synonym 'a rel = ('a * 'a) set
223 * The representation of numerals has changed. Datatype "num"
224 represents strictly positive binary numerals, along with functions
225 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
226 positive and negated numeric literals, respectively. See also
227 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
228 user theories may require adaptations as follows:
230 - Theorems with number_ring or number_semiring constraints: These
231 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
233 - Theories defining numeric types: Remove number, number_semiring,
234 and number_ring instances. Defer all theorems about numerals until
235 after classes one and semigroup_add have been instantiated.
237 - Numeral-only simp rules: Replace each rule having a "number_of v"
238 pattern with two copies, one for numeral and one for neg_numeral.
240 - Theorems about subclasses of semiring_1 or ring_1: These classes
241 automatically support numerals now, so more simp rules and
242 simprocs may now apply within the proof.
244 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
245 Redefine using other integer operations.
247 * Transfer: New package intended to generalize the existing
248 "descending" method and related theorem attributes from the Quotient
249 package. (Not all functionality is implemented yet, but future
250 development will focus on Transfer as an eventual replacement for the
251 corresponding parts of the Quotient package.)
253 - transfer_rule attribute: Maintains a collection of transfer rules,
254 which relate constants at two different types. Transfer rules may
255 relate different type instances of the same polymorphic constant,
256 or they may relate an operation on a raw type to a corresponding
257 operation on an abstract type (quotient or subtype). For example:
259 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
260 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
262 - transfer method: Replaces a subgoal on abstract types with an
263 equivalent subgoal on the corresponding raw types. Constants are
264 replaced with corresponding ones according to the transfer rules.
265 Goals are generalized over all free variables by default; this is
266 necessary for variables whose types change, but can be overridden
267 for specific variables with e.g. "transfer fixing: x y z". The
268 variant transfer' method allows replacing a subgoal with one that
269 is logically stronger (rather than equivalent).
271 - relator_eq attribute: Collects identity laws for relators of
272 various type constructors, e.g. "list_all2 (op =) = (op =)". The
273 transfer method uses these lemmas to infer transfer rules for
274 non-polymorphic constants on the fly.
276 - transfer_prover method: Assists with proving a transfer rule for a
277 new constant, provided the constant is defined in terms of other
278 constants that already have transfer rules. It should be applied
279 after unfolding the constant definitions.
281 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
282 from type nat to type int.
284 * Lifting: New package intended to generalize the quotient_definition
285 facility of the Quotient package; designed to work with Transfer.
287 - lift_definition command: Defines operations on an abstract type in
288 terms of a corresponding operation on a representation
289 type. Example syntax:
291 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
294 Users must discharge a respectfulness proof obligation when each
295 constant is defined. (For a type copy, i.e. a typedef with UNIV,
296 the proof is discharged automatically.) The obligation is
297 presented in a user-friendly, readable form; a respectfulness
298 theorem in the standard format and a transfer rule are generated
301 - Integration with code_abstype: For typedefs (e.g. subtypes
302 corresponding to a datatype invariant, such as dlist),
303 lift_definition generates a code certificate theorem and sets up
304 code generation for each constant.
306 - setup_lifting command: Sets up the Lifting package to work with a
307 user-defined type. The user must provide either a quotient theorem
308 or a type_definition theorem. The package configures transfer
309 rules for equality and quantifiers on the type, and sets up the
310 lift_definition command to work with the type.
312 - Usage examples: See Quotient_Examples/Lift_DList.thy,
313 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
314 Word/Word.thy and Library/Float.thy.
318 - The 'quotient_type' command now supports a 'morphisms' option with
319 rep and abs functions, similar to typedef.
321 - 'quotient_type' sets up new types to work with the Lifting and
322 Transfer packages, as with 'setup_lifting'.
324 - The 'quotient_definition' command now requires the user to prove a
325 respectfulness property at the point where the constant is
326 defined, similar to lift_definition; INCOMPATIBILITY.
328 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
329 accordingly, INCOMPATIBILITY.
331 * New diagnostic command 'find_unused_assms' to find potentially
332 superfluous assumptions in theorems using Quickcheck.
336 - Quickcheck returns variable assignments as counterexamples, which
337 allows to reveal the underspecification of functions under test.
338 For example, refuting "hd xs = x", it presents the variable
339 assignment xs = [] and x = a1 as a counterexample, assuming that
340 any property is false whenever "hd []" occurs in it.
342 These counterexample are marked as potentially spurious, as
343 Quickcheck also returns "xs = []" as a counterexample to the
344 obvious theorem "hd xs = hd xs".
346 After finding a potentially spurious counterexample, Quickcheck
347 continues searching for genuine ones.
349 By default, Quickcheck shows potentially spurious and genuine
350 counterexamples. The option "genuine_only" sets quickcheck to only
351 show genuine counterexamples.
353 - The command 'quickcheck_generator' creates random and exhaustive
354 value generators for a given type and operations.
356 It generates values by using the operations as if they were
357 constructors of that type.
359 - Support for multisets.
361 - Added "use_subtype" options.
363 - Added "quickcheck_locale" configuration to specify how to process
364 conjectures in a locale context.
366 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
367 and affecting 'rat' and 'real'.
370 - Integrated more tightly with SPASS, as described in the ITP 2012
371 paper "More SPASS with Isabelle".
372 - Made it try "smt" as a fallback if "metis" fails or times out.
373 - Added support for the following provers: Alt-Ergo (via Why3 and
374 TFF1), iProver, iProver-Eq.
375 - Replaced remote E-SInE with remote Satallax in the default setup.
376 - Sped up the minimizer.
377 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
378 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
379 - Renamed "sound" option to "strict".
381 * Metis: Added possibility to specify lambda translations scheme as a
382 parenthesized argument (e.g., "by (metis (lifting) ...)").
384 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
386 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
388 * New "case_product" attribute to generate a case rule doing multiple
389 case distinctions at the same time. E.g.
391 list.exhaust [case_product nat.exhaust]
393 produces a rule which can be used to perform case distinction on both
396 * New "eventually_elim" method as a generalized variant of the
397 eventually_elim* rules. Supports structured proofs.
399 * Typedef with implicit set definition is considered legacy. Use
400 "typedef (open)" form instead, which will eventually become the
403 * Record: code generation can be switched off manually with
405 declare [[record_coden = false]] -- "default true"
407 * Datatype: type parameters allow explicit sort constraints.
409 * Concrete syntax for case expressions includes constraints for source
410 positions, and thus produces Prover IDE markup for its bindings.
411 INCOMPATIBILITY for old-style syntax translations that augment the
412 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
415 * Clarified attribute "mono_set": pure declaration without modifying
416 the result of the fact expression.
418 * More default pred/set conversions on a couple of relation operations
419 and predicates. Added powers of predicate relations. Consolidation
420 of some relation theorems:
422 converse_def ~> converse_unfold
423 rel_comp_def ~> relcomp_unfold
424 symp_def ~> (modified, use symp_def and sym_def instead)
425 transp_def ~> transp_trans
426 Domain_def ~> Domain_unfold
427 Range_def ~> Domain_converse [symmetric]
429 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
431 See theory "Relation" for examples for making use of pred/set
432 conversions by means of attributes "to_set" and "to_pred".
436 * Renamed facts about the power operation on relations, i.e., relpow
437 to match the constant's name:
439 rel_pow_1 ~> relpow_1
440 rel_pow_0_I ~> relpow_0_I
441 rel_pow_Suc_I ~> relpow_Suc_I
442 rel_pow_Suc_I2 ~> relpow_Suc_I2
443 rel_pow_0_E ~> relpow_0_E
444 rel_pow_Suc_E ~> relpow_Suc_E
445 rel_pow_E ~> relpow_E
446 rel_pow_Suc_D2 ~> relpow_Suc_D2
447 rel_pow_Suc_E2 ~> relpow_Suc_E2
448 rel_pow_Suc_D2' ~> relpow_Suc_D2'
449 rel_pow_E2 ~> relpow_E2
450 rel_pow_add ~> relpow_add
451 rel_pow_commute ~> relpow
452 rel_pow_empty ~> relpow_empty:
453 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
454 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
455 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
456 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
457 rel_pow_fun_conv ~> relpow_fun_conv
458 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
459 rel_pow_finite_bounded ~> relpow_finite_bounded
460 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
461 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
462 single_valued_rel_pow ~> single_valued_relpow
466 * Theory Relation: Consolidated constant name for relation composition
467 and corresponding theorem names:
469 - Renamed constant rel_comp to relcomp.
471 - Dropped abbreviation pred_comp. Use relcompp instead.
475 rel_compI ~> relcompI
476 rel_compEpair ~> relcompEpair
477 rel_compE ~> relcompE
478 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
479 rel_comp_empty1 ~> relcomp_empty1
480 rel_comp_mono ~> relcomp_mono
481 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
482 rel_comp_distrib ~> relcomp_distrib
483 rel_comp_distrib2 ~> relcomp_distrib2
484 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
485 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
486 single_valued_rel_comp ~> single_valued_relcomp
487 rel_comp_def ~> relcomp_unfold
488 converse_rel_comp ~> converse_relcomp
489 pred_compI ~> relcomppI
490 pred_compE ~> relcomppE
491 pred_comp_bot1 ~> relcompp_bot1
492 pred_comp_bot2 ~> relcompp_bot2
493 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
494 pred_comp_mono ~> relcompp_mono
495 pred_comp_distrib ~> relcompp_distrib
496 pred_comp_distrib2 ~> relcompp_distrib2
497 converse_pred_comp ~> converse_relcompp
499 finite_rel_comp ~> finite_relcomp
501 set_rel_comp ~> set_relcomp
505 * Theory Divides: Discontinued redundant theorems about div and mod.
506 INCOMPATIBILITY, use the corresponding generic theorems instead.
508 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
509 zdiv_self ~> div_self
510 zmod_self ~> mod_self
513 zdiv_zmod_equality ~> div_mod_equality2
514 zdiv_zmod_equality2 ~> div_mod_equality
515 zmod_zdiv_trivial ~> mod_div_trivial
516 zdiv_zminus_zminus ~> div_minus_minus
517 zmod_zminus_zminus ~> mod_minus_minus
518 zdiv_zminus2 ~> div_minus_right
519 zmod_zminus2 ~> mod_minus_right
520 zdiv_minus1_right ~> div_minus1_right
521 zmod_minus1_right ~> mod_minus1_right
522 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
523 zmod_zmult1_eq ~> mod_mult_right_eq
524 zpower_zmod ~> power_mod
526 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
527 mod_mult_distrib ~> mult_mod_left
528 mod_mult_distrib2 ~> mult_mod_right
530 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
531 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
533 * Finite_Set.fold now qualified. INCOMPATIBILITY.
535 * Consolidated theorem names concerning fold combinators:
537 inf_INFI_fold_inf ~> inf_INF_fold_inf
538 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
539 INFI_fold_inf ~> INF_fold_inf
540 SUPR_fold_sup ~> SUP_fold_sup
541 union_set ~> union_set_fold
542 minus_set ~> minus_set_fold
543 INFI_set_fold ~> INF_set_fold
544 SUPR_set_fold ~> SUP_set_fold
545 INF_code ~> INF_set_foldr
546 SUP_code ~> SUP_set_foldr
547 foldr.simps ~> foldr.simps (in point-free formulation)
548 foldr_fold_rev ~> foldr_conv_fold
549 foldl_fold ~> foldl_conv_fold
550 foldr_foldr ~> foldr_conv_foldl
551 foldl_foldr ~> foldl_conv_foldr
552 fold_set_remdups ~> fold_set_fold_remdups
553 fold_set ~> fold_set_fold
554 fold1_set ~> fold1_set_fold
558 * Dropped rarely useful theorems concerning fold combinators:
559 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
560 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
561 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
562 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
563 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
564 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
565 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
566 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
567 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
568 unfolding "foldr_conv_fold" and "foldl_conv_fold".
570 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
571 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
572 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
573 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
574 lemmas over fold rather than foldr, or make use of lemmas
575 fold_conv_foldr and fold_rev.
577 * Congruence rules Option.map_cong and Option.bind_cong for recursion
578 through option types.
580 * "Transitive_Closure.ntrancl": bounded transitive closure on
583 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
585 * Theory Int: Discontinued many legacy theorems specific to type int.
586 INCOMPATIBILITY, use the corresponding generic theorems instead.
588 zminus_zminus ~> minus_minus
589 zminus_0 ~> minus_zero
590 zminus_zadd_distrib ~> minus_add_distrib
591 zadd_commute ~> add_commute
592 zadd_assoc ~> add_assoc
593 zadd_left_commute ~> add_left_commute
597 zadd_0_right ~> add_0_right
598 zadd_zminus_inverse2 ~> left_minus
599 zmult_zminus ~> mult_minus_left
600 zmult_commute ~> mult_commute
601 zmult_assoc ~> mult_assoc
602 zadd_zmult_distrib ~> left_distrib
603 zadd_zmult_distrib2 ~> right_distrib
604 zdiff_zmult_distrib ~> left_diff_distrib
605 zdiff_zmult_distrib2 ~> right_diff_distrib
606 zmult_1 ~> mult_1_left
607 zmult_1_right ~> mult_1_right
608 zle_refl ~> order_refl
609 zle_trans ~> order_trans
610 zle_antisym ~> order_antisym
611 zle_linear ~> linorder_linear
612 zless_linear ~> linorder_less_linear
613 zadd_left_mono ~> add_left_mono
614 zadd_strict_right_mono ~> add_strict_right_mono
615 zadd_zless_mono ~> add_less_le_mono
616 int_0_less_1 ~> zero_less_one
617 int_0_neq_1 ~> zero_neq_one
619 zpower_zadd_distrib ~> power_add
620 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
621 zero_le_zpower_abs ~> zero_le_power_abs
623 * Theory Deriv: Renamed
625 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
627 * Theory Library/Multiset: Improved code generation of multisets.
629 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
630 are expressed via type classes again. The special syntax
631 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
632 setsum_set, which is now subsumed by Big_Operators.setsum.
635 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
636 use theory HOL/Library/Nat_Bijection instead.
638 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
639 trees is now inside a type class context. Names of affected
640 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
641 theories working directly with raw red-black trees, adapt the names as
645 bulkload -> rbt_bulkload
646 del_from_left -> rbt_del_from_left
647 del_from_right -> rbt_del_from_right
652 insertw -> rbt_insert_with
653 insert_with_key -> rbt_insert_with_key
654 map_entry -> rbt_map_entry
657 tree_greater -> rbt_greater
658 tree_less -> rbt_less
659 tree_less_symbol -> rbt_less_symbol
661 union_with -> rbt_union_with
662 union_with_key -> rbt_union_with_key
665 balance_left_sorted -> balance_left_rbt_sorted
666 balance_left_tree_greater -> balance_left_rbt_greater
667 balance_left_tree_less -> balance_left_rbt_less
668 balance_right_sorted -> balance_right_rbt_sorted
669 balance_right_tree_greater -> balance_right_rbt_greater
670 balance_right_tree_less -> balance_right_rbt_less
671 balance_sorted -> balance_rbt_sorted
672 balance_tree_greater -> balance_rbt_greater
673 balance_tree_less -> balance_rbt_less
674 bulkload_is_rbt -> rbt_bulkload_is_rbt
675 combine_sorted -> combine_rbt_sorted
676 combine_tree_greater -> combine_rbt_greater
677 combine_tree_less -> combine_rbt_less
678 delete_in_tree -> rbt_delete_in_tree
679 delete_is_rbt -> rbt_delete_is_rbt
680 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
681 del_from_left_tree_less -> rbt_del_from_left_rbt_less
682 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
683 del_from_right_tree_less -> rbt_del_from_right_rbt_less
684 del_in_tree -> rbt_del_in_tree
685 del_inv1_inv2 -> rbt_del_inv1_inv2
686 del_sorted -> rbt_del_rbt_sorted
687 del_tree_greater -> rbt_del_rbt_greater
688 del_tree_less -> rbt_del_rbt_less
689 dom_lookup_Branch -> dom_rbt_lookup_Branch
690 entries_lookup -> entries_rbt_lookup
691 finite_dom_lookup -> finite_dom_rbt_lookup
692 insert_sorted -> rbt_insert_rbt_sorted
693 insertw_is_rbt -> rbt_insertw_is_rbt
694 insertwk_is_rbt -> rbt_insertwk_is_rbt
695 insertwk_sorted -> rbt_insertwk_rbt_sorted
696 insertw_sorted -> rbt_insertw_rbt_sorted
697 ins_sorted -> ins_rbt_sorted
698 ins_tree_greater -> ins_rbt_greater
699 ins_tree_less -> ins_rbt_less
700 is_rbt_sorted -> is_rbt_rbt_sorted
701 lookup_balance -> rbt_lookup_balance
702 lookup_bulkload -> rbt_lookup_rbt_bulkload
703 lookup_delete -> rbt_lookup_rbt_delete
704 lookup_Empty -> rbt_lookup_Empty
705 lookup_from_in_tree -> rbt_lookup_from_in_tree
706 lookup_in_tree -> rbt_lookup_in_tree
707 lookup_ins -> rbt_lookup_ins
708 lookup_insert -> rbt_lookup_rbt_insert
709 lookup_insertw -> rbt_lookup_rbt_insertw
710 lookup_insertwk -> rbt_lookup_rbt_insertwk
711 lookup_keys -> rbt_lookup_keys
712 lookup_map -> rbt_lookup_map
713 lookup_map_entry -> rbt_lookup_rbt_map_entry
714 lookup_tree_greater -> rbt_lookup_rbt_greater
715 lookup_tree_less -> rbt_lookup_rbt_less
716 lookup_union -> rbt_lookup_rbt_union
717 map_entry_color_of -> rbt_map_entry_color_of
718 map_entry_inv1 -> rbt_map_entry_inv1
719 map_entry_inv2 -> rbt_map_entry_inv2
720 map_entry_is_rbt -> rbt_map_entry_is_rbt
721 map_entry_sorted -> rbt_map_entry_rbt_sorted
722 map_entry_tree_greater -> rbt_map_entry_rbt_greater
723 map_entry_tree_less -> rbt_map_entry_rbt_less
724 map_tree_greater -> map_rbt_greater
725 map_tree_less -> map_rbt_less
726 map_sorted -> map_rbt_sorted
727 paint_sorted -> paint_rbt_sorted
728 paint_lookup -> paint_rbt_lookup
729 paint_tree_greater -> paint_rbt_greater
730 paint_tree_less -> paint_rbt_less
731 sorted_entries -> rbt_sorted_entries
732 tree_greater_eq_trans -> rbt_greater_eq_trans
733 tree_greater_nit -> rbt_greater_nit
734 tree_greater_prop -> rbt_greater_prop
735 tree_greater_simps -> rbt_greater_simps
736 tree_greater_trans -> rbt_greater_trans
737 tree_less_eq_trans -> rbt_less_eq_trans
738 tree_less_nit -> rbt_less_nit
739 tree_less_prop -> rbt_less_prop
740 tree_less_simps -> rbt_less_simps
741 tree_less_trans -> rbt_less_trans
742 tree_ord_props -> rbt_ord_props
743 union_Branch -> rbt_union_Branch
744 union_is_rbt -> rbt_union_is_rbt
745 unionw_is_rbt -> rbt_unionw_is_rbt
746 unionwk_is_rbt -> rbt_unionwk_is_rbt
747 unionwk_sorted -> rbt_unionwk_rbt_sorted
749 * Theory HOL/Library/Float: Floating point numbers are now defined as
750 a subset of the real numbers. All operations are defined using the
751 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
758 round_down -> float_round_down
759 round_up -> float_round_up
763 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
766 abs_float_def -> Float.compute_float_abs
767 bitlen_ge0 -> bitlen_nonneg
768 bitlen.simps -> Float.compute_bitlen
769 float_components -> Float_mantissa_exponent
770 float_divl.simps -> Float.compute_float_divl
771 float_divr.simps -> Float.compute_float_divr
772 float_eq_odd -> mult_powr_eq_mult_powr_iff
773 float_power -> real_of_float_power
774 lapprox_posrat_def -> Float.compute_lapprox_posrat
775 lapprox_rat.simps -> Float.compute_lapprox_rat
776 le_float_def' -> Float.compute_float_le
777 le_float_def -> less_eq_float.rep_eq
778 less_float_def' -> Float.compute_float_less
779 less_float_def -> less_float.rep_eq
780 normfloat_def -> Float.compute_normfloat
781 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
782 normfloat -> normfloat_def
783 normfloat_unique -> use normfloat_def
784 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
785 one_float_def -> Float.compute_float_one
786 plus_float_def -> Float.compute_float_plus
787 rapprox_posrat_def -> Float.compute_rapprox_posrat
788 rapprox_rat.simps -> Float.compute_rapprox_rat
789 real_of_float_0 -> zero_float.rep_eq
790 real_of_float_1 -> one_float.rep_eq
791 real_of_float_abs -> abs_float.rep_eq
792 real_of_float_add -> plus_float.rep_eq
793 real_of_float_minus -> uminus_float.rep_eq
794 real_of_float_mult -> times_float.rep_eq
795 real_of_float_simp -> Float.rep_eq
796 real_of_float_sub -> minus_float.rep_eq
797 round_down.simps -> Float.compute_float_round_down
798 round_up.simps -> Float.compute_float_round_up
799 times_float_def -> Float.compute_float_times
800 uminus_float_def -> Float.compute_float_uminus
801 zero_float_def -> Float.compute_float_zero
803 Lemmas not necessary anymore, use the transfer method:
804 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
805 float_divr, float_le_simp, float_less1_mantissa_bound,
806 float_less_simp, float_less_zero, float_le_zero,
807 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
808 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
809 lapprox_rat_bottom, normalized_float, rapprox_posrat,
810 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
811 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
812 round_up, zero_le_float, zero_less_float
814 * New theory HOL/Library/DAList provides an abstract type for
815 association lists with distinct keys.
817 * Session HOL/IMP: Added new theory of abstract interpretation of
820 * Session HOL-Import: Re-implementation from scratch is faster,
821 simpler, and more scalable. Requires a proof bundle, which is
822 available as an external component. Discontinued old (and mostly
823 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
825 * Session HOL-Word: Discontinued many redundant theorems specific to
826 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
829 word_sub_alt ~> word_sub_wi
830 word_add_alt ~> word_add_def
831 word_mult_alt ~> word_mult_def
832 word_minus_alt ~> word_minus_def
833 word_0_alt ~> word_0_wi
834 word_1_alt ~> word_1_wi
835 word_add_0 ~> add_0_left
836 word_add_0_right ~> add_0_right
837 word_mult_1 ~> mult_1_left
838 word_mult_1_right ~> mult_1_right
839 word_add_commute ~> add_commute
840 word_add_assoc ~> add_assoc
841 word_add_left_commute ~> add_left_commute
842 word_mult_commute ~> mult_commute
843 word_mult_assoc ~> mult_assoc
844 word_mult_left_commute ~> mult_left_commute
845 word_left_distrib ~> left_distrib
846 word_right_distrib ~> right_distrib
847 word_left_minus ~> left_minus
848 word_diff_0_right ~> diff_0_right
849 word_diff_self ~> diff_self
850 word_sub_def ~> diff_minus
851 word_diff_minus ~> diff_minus
852 word_add_ac ~> add_ac
853 word_mult_ac ~> mult_ac
854 word_plus_ac0 ~> add_0_left add_0_right add_ac
855 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
856 word_order_trans ~> order_trans
857 word_order_refl ~> order_refl
858 word_order_antisym ~> order_antisym
859 word_order_linear ~> linorder_linear
860 lenw1_zero_neq_one ~> zero_neq_one
861 word_number_of_eq ~> number_of_eq
862 word_of_int_add_hom ~> wi_hom_add
863 word_of_int_sub_hom ~> wi_hom_sub
864 word_of_int_mult_hom ~> wi_hom_mult
865 word_of_int_minus_hom ~> wi_hom_neg
866 word_of_int_succ_hom ~> wi_hom_succ
867 word_of_int_pred_hom ~> wi_hom_pred
868 word_of_int_0_hom ~> word_0_wi
869 word_of_int_1_hom ~> word_1_wi
871 * Session HOL-Word: New proof method "word_bitwise" for splitting
872 machine word equalities and inequalities into logical circuits,
873 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
874 multiplication, shifting by constants, bitwise operators and numeric
875 constants. Requires fixed-length word types, not 'a word. Solves
876 many standard word identities outright and converts more into first
877 order problems amenable to blast or similar. See also examples in
878 HOL/Word/Examples/WordExamples.thy.
880 * Session HOL-Probability: Introduced the type "'a measure" to
881 represent measures, this replaces the records 'a algebra and 'a
882 measure_space. The locales based on subset_class now have two
883 locale-parameters the space \<Omega> and the set of measurable sets M.
884 The product of probability spaces uses now the same constant as the
885 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
886 measure". Most constants are defined now outside of locales and gain
887 an additional parameter, like null_sets, almost_eventually or \<mu>'.
888 Measure space constructions for distributions and densities now got
889 their own constants distr and density. Instead of using locales to
890 describe measure spaces with a finite space, the measure count_space
891 and point_measure is introduced. INCOMPATIBILITY.
895 finite_measure.\<mu>' -> measure
896 product_algebra_generator -> prod_algebra
897 product_prob_space.emb -> prod_emb
898 product_prob_space.infprod_algebra -> PiM
901 completeable_measure_space
904 finite_product_finite_prob_space
905 finite_product_sigma_algebra
908 pair_finite_prob_space
909 pair_finite_sigma_algebra
912 product_sigma_algebra
916 distribution -> use distr measure, or distributed predicate
918 joint_distribution -> use distr measure, or distributed predicate
919 pair_measure_generator
920 product_prob_space.infprod_algebra -> use PiM
923 Replacement theorems:
924 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
925 finite_measure.empty_measure -> measure_empty
926 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
927 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
928 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
929 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
930 finite_measure.finite_measure -> finite_measure.emeasure_finite
931 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
932 finite_measure.positive_measure' -> measure_nonneg
933 finite_measure.real_measure -> finite_measure.emeasure_real
934 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
935 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
936 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
937 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
938 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
939 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
940 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
941 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
942 information_space.entropy_commute -> information_space.entropy_commute_simple
943 information_space.entropy_eq -> information_space.entropy_simple_distributed
944 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
945 information_space.entropy_positive -> information_space.entropy_nonneg_simple
946 information_space.entropy_uniform_max -> information_space.entropy_uniform
947 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
948 information_space.KL_eq_0 -> information_space.KL_same_eq_0
949 information_space.KL_ge_0 -> information_space.KL_nonneg
950 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
951 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
952 Int_stable_cuboids -> Int_stable_atLeastAtMost
953 Int_stable_product_algebra_generator -> positive_integral
954 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
955 measure_space.additive -> emeasure_additive
956 measure_space.AE_iff_null_set -> AE_iff_null
957 measure_space.almost_everywhere_def -> eventually_ae_filter
958 measure_space.almost_everywhere_vimage -> AE_distrD
959 measure_space.continuity_from_above -> INF_emeasure_decseq
960 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
961 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
962 measure_space.continuity_from_below -> SUP_emeasure_incseq
963 measure_space_density -> emeasure_density
964 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
965 measure_space.integrable_vimage -> integrable_distr
966 measure_space.integral_translated_density -> integral_density
967 measure_space.integral_vimage -> integral_distr
968 measure_space.measure_additive -> plus_emeasure
969 measure_space.measure_compl -> emeasure_compl
970 measure_space.measure_countable_increasing -> emeasure_countable_increasing
971 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
972 measure_space.measure_decseq -> decseq_emeasure
973 measure_space.measure_Diff -> emeasure_Diff
974 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
975 measure_space.measure_eq_0 -> emeasure_eq_0
976 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
977 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
978 measure_space.measure_incseq -> incseq_emeasure
979 measure_space.measure_insert -> emeasure_insert
980 measure_space.measure_mono -> emeasure_mono
981 measure_space.measure_not_negative -> emeasure_not_MInf
982 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
983 measure_space.measure_setsum -> setsum_emeasure
984 measure_space.measure_setsum_split -> setsum_emeasure_cover
985 measure_space.measure_space_vimage -> emeasure_distr
986 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
987 measure_space.measure_subadditive -> subadditive
988 measure_space.measure_top -> emeasure_space
989 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
990 measure_space.measure_Un_null_set -> emeasure_Un_null_set
991 measure_space.positive_integral_translated_density -> positive_integral_density
992 measure_space.positive_integral_vimage -> positive_integral_distr
993 measure_space.real_continuity_from_above -> Lim_measure_decseq
994 measure_space.real_continuity_from_below -> Lim_measure_incseq
995 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
996 measure_space.real_measure_Diff -> measure_Diff
997 measure_space.real_measure_finite_Union -> measure_finite_Union
998 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
999 measure_space.real_measure_subadditive -> measure_subadditive
1000 measure_space.real_measure_Union -> measure_Union
1001 measure_space.real_measure_UNION -> measure_UNION
1002 measure_space.simple_function_vimage -> simple_function_comp
1003 measure_space.simple_integral_vimage -> simple_integral_distr
1004 measure_space.simple_integral_vimage -> simple_integral_distr
1005 measure_unique_Int_stable -> measure_eqI_generator_eq
1006 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
1007 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
1008 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
1009 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
1010 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
1011 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
1012 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
1013 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
1014 pair_sigma_algebra.sets_swap -> sets_pair_swap
1015 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
1016 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
1017 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
1018 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
1019 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
1020 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
1021 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
1022 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
1023 prob_space.measure_space_1 -> prob_space.emeasure_space_1
1024 prob_space.prob_space_vimage -> prob_space_distr
1025 prob_space.random_variable_restrict -> measurable_restrict
1026 prob_space_unique_Int_stable -> measure_eqI_prob_space
1027 product_algebraE -> prod_algebraE_all
1028 product_algebra_generator_der -> prod_algebra_eq_finite
1029 product_algebra_generator_into_space -> prod_algebra_sets_into_space
1030 product_algebraI -> sets_PiM_I_finite
1031 product_measure_exists -> product_sigma_finite.sigma_finite
1032 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
1033 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
1034 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
1035 product_prob_space.measurable_component -> measurable_component_singleton
1036 product_prob_space.measurable_emb -> measurable_prod_emb
1037 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
1038 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
1039 product_prob_space.measure_emb -> emeasure_prod_emb
1040 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
1041 product_sigma_algebra.product_algebra_into_space -> space_closed
1042 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
1043 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
1044 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
1045 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
1046 sets_product_algebra -> sets_PiM
1047 sigma_algebra.measurable_sigma -> measurable_measure_of
1048 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
1049 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
1050 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
1051 space_product_algebra -> space_PiM
1053 * Session HOL-TPTP: support to parse and import TPTP problems (all
1054 languages) into Isabelle/HOL.
1059 * New "case_product" attribute (see HOL).
1064 * Greater support for structured proofs involving induction or case
1067 * Much greater use of mathematical symbols.
1069 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1074 * Antiquotation @{keyword "name"} produces a parser for outer syntax
1075 from a minor keyword introduced via theory header declaration.
1077 * Antiquotation @{command_spec "name"} produces the
1078 Outer_Syntax.command_spec from a major keyword introduced via theory
1079 header declaration; it can be passed to Outer_Syntax.command etc.
1081 * Local_Theory.define no longer hard-wires default theorem name
1082 "foo_def", but retains the binding as given. If that is Binding.empty
1083 / Attrib.empty_binding, the result is not registered as user-level
1084 fact. The Local_Theory.define_internal variant allows to specify a
1085 non-empty name (used for the foundation in the background theory),
1086 while omitting the fact binding in the user-context. Potential
1087 INCOMPATIBILITY for derived definitional packages: need to specify
1088 naming policy for primitive definitions more explicitly.
1090 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
1091 conformance with similar operations in structure Term and Logic.
1093 * Antiquotation @{attributes [...]} embeds attribute source
1094 representation into the ML text, which is particularly useful with
1095 declarations like Local_Theory.note.
1097 * Structure Proof_Context follows standard naming scheme. Old
1098 ProofContext has been discontinued. INCOMPATIBILITY.
1100 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
1101 change of semantics: update is applied to auxiliary local theory
1104 * Modernized some old-style infix operations:
1106 addeqcongs ~> Simplifier.add_eqcong
1107 deleqcongs ~> Simplifier.del_eqcong
1108 addcongs ~> Simplifier.add_cong
1109 delcongs ~> Simplifier.del_cong
1110 setmksimps ~> Simplifier.set_mksimps
1111 setmkcong ~> Simplifier.set_mkcong
1112 setmksym ~> Simplifier.set_mksym
1113 setmkeqTrue ~> Simplifier.set_mkeqTrue
1114 settermless ~> Simplifier.set_termless
1115 setsubgoaler ~> Simplifier.set_subgoaler
1116 addsplits ~> Splitter.add_split
1117 delsplits ~> Splitter.del_split
1122 * USER_HOME settings variable points to cross-platform user home
1123 directory, which coincides with HOME on POSIX systems only. Likewise,
1124 the Isabelle path specification "~" now expands to $USER_HOME, instead
1125 of former $HOME. A different default for USER_HOME may be set
1126 explicitly in shell environment, before Isabelle settings are
1127 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
1128 the generic user home was intended.
1130 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
1131 notation, which is useful for the jEdit file browser, for example.
1133 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
1138 New in Isabelle2011-1 (October 2011)
1139 ------------------------------------
1143 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
1144 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
1146 - Management of multiple theory files directly from the editor
1147 buffer store -- bypassing the file-system (no requirement to save
1148 files for checking).
1150 - Markup of formal entities within the text buffer, with semantic
1151 highlighting, tooltips and hyperlinks to jump to defining source
1154 - Improved text rendering, with sub/superscripts in the source
1155 buffer (including support for copy/paste wrt. output panel, HTML
1156 theory output and other non-Isabelle text boxes).
1158 - Refined scheduling of proof checking and printing of results,
1159 based on interactive editor view. (Note: jEdit folding and
1160 narrowing allows to restrict buffer perspectives explicitly.)
1162 - Reduced CPU performance requirements, usable on machines with few
1165 - Reduced memory requirements due to pruning of unused document
1166 versions (garbage collection).
1168 See also ~~/src/Tools/jEdit/README.html for further information,
1169 including some remaining limitations.
1171 * Theory loader: source files are exclusively located via the master
1172 directory of each theory node (where the .thy file itself resides).
1173 The global load path (such as src/HOL/Library) has been discontinued.
1174 Note that the path element ~~ may be used to reference theories in the
1175 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
1178 * Theory loader: source files are identified by content via SHA1
1179 digests. Discontinued former path/modtime identification and optional
1180 ISABELLE_FILE_IDENT plugin scripts.
1182 * Parallelization of nested Isar proofs is subject to
1183 Goal.parallel_proofs_threshold (default 100). See also isabelle
1186 * Name space: former unsynchronized references are now proper
1187 configuration options, with more conventional names:
1189 long_names ~> names_long
1190 short_names ~> names_short
1191 unique_names ~> names_unique
1193 Minor INCOMPATIBILITY, need to declare options in context like this:
1195 declare [[names_unique = false]]
1197 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
1198 that the result needs to be unique, which means fact specifications
1199 may have to be refined after enriching a proof context.
1201 * Attribute "case_names" has been refined: the assumptions in each case
1202 can be named now by following the case name with [name1 name2 ...].
1204 * Isabelle/Isar reference manual has been updated and extended:
1205 - "Synopsis" provides a catalog of main Isar language concepts.
1206 - Formal references in syntax diagrams, via @{rail} antiquotation.
1207 - Updated material from classic "ref" manual, notably about
1208 "Classical Reasoner".
1213 * Class bot and top require underlying partial order rather than
1214 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
1216 * Class complete_lattice: generalized a couple of lemmas from sets;
1217 generalized theorems INF_cong and SUP_cong. New type classes for
1218 complete boolean algebras and complete linear orders. Lemmas
1219 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
1220 class complete_linorder.
1222 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
1223 Sup_fun_def, Inf_apply, Sup_apply.
1225 Removed redundant lemmas (the right hand side gives hints how to
1226 replace them for (metis ...), or (simp only: ...) proofs):
1228 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
1229 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
1230 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
1231 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
1232 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
1233 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
1234 Inter_def ~> INF_def, image_def
1235 Union_def ~> SUP_def, image_def
1236 INT_eq ~> INF_def, and image_def
1237 UN_eq ~> SUP_def, and image_def
1238 INF_subset ~> INF_superset_mono [OF _ order_refl]
1240 More consistent and comprehensive names:
1242 INTER_eq_Inter_image ~> INF_def
1243 UNION_eq_Union_image ~> SUP_def
1246 INF_leI ~> INF_lower
1247 INF_leI2 ~> INF_lower2
1248 le_INFI ~> INF_greatest
1249 le_SUPI ~> SUP_upper
1250 le_SUPI2 ~> SUP_upper2
1251 SUP_leI ~> SUP_least
1252 INFI_bool_eq ~> INF_bool_eq
1253 SUPR_bool_eq ~> SUP_bool_eq
1254 INFI_apply ~> INF_apply
1255 SUPR_apply ~> SUP_apply
1256 INTER_def ~> INTER_eq
1257 UNION_def ~> UNION_eq
1261 * Renamed theory Complete_Lattice to Complete_Lattices.
1264 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
1265 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
1266 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
1267 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
1269 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
1270 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
1271 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
1274 * Added syntactic classes "inf" and "sup" for the respective
1275 constants. INCOMPATIBILITY: Changes in the argument order of the
1276 (mostly internal) locale predicates for some derived classes.
1278 * Theorem collections ball_simps and bex_simps do not contain theorems
1279 referring to UNION any longer; these have been moved to collection
1280 UN_ball_bex_simps. INCOMPATIBILITY.
1282 * Theory Archimedean_Field: floor now is defined as parameter of a
1283 separate type class floor_ceiling.
1285 * Theory Finite_Set: more coherent development of fold_set locales:
1287 locale fun_left_comm ~> locale comp_fun_commute
1288 locale fun_left_comm_idem ~> locale comp_fun_idem
1290 Both use point-free characterization; interpretation proofs may need
1291 adjustment. INCOMPATIBILITY.
1293 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
1294 accordance with standard mathematical terminology. INCOMPATIBILITY.
1296 * Theory Complex_Main: The locale interpretations for the
1297 bounded_linear and bounded_bilinear locales have been removed, in
1298 order to reduce the number of duplicate lemmas. Users must use the
1299 original names for distributivity theorems, potential INCOMPATIBILITY.
1301 divide.add ~> add_divide_distrib
1302 divide.diff ~> diff_divide_distrib
1303 divide.setsum ~> setsum_divide_distrib
1304 mult.add_right ~> right_distrib
1305 mult.diff_right ~> right_diff_distrib
1306 mult_right.setsum ~> setsum_right_distrib
1307 mult_left.diff ~> left_diff_distrib
1309 * Theory Complex_Main: Several redundant theorems have been removed or
1310 replaced by more general versions. INCOMPATIBILITY.
1312 real_diff_def ~> minus_real_def
1313 real_divide_def ~> divide_real_def
1314 real_less_def ~> less_le
1315 real_abs_def ~> abs_real_def
1316 real_sgn_def ~> sgn_real_def
1317 real_mult_commute ~> mult_commute
1318 real_mult_assoc ~> mult_assoc
1319 real_mult_1 ~> mult_1_left
1320 real_add_mult_distrib ~> left_distrib
1321 real_zero_not_eq_one ~> zero_neq_one
1322 real_mult_inverse_left ~> left_inverse
1323 INVERSE_ZERO ~> inverse_zero
1324 real_le_refl ~> order_refl
1325 real_le_antisym ~> order_antisym
1326 real_le_trans ~> order_trans
1327 real_le_linear ~> linear
1328 real_le_eq_diff ~> le_iff_diff_le_0
1329 real_add_left_mono ~> add_left_mono
1330 real_mult_order ~> mult_pos_pos
1331 real_mult_less_mono2 ~> mult_strict_left_mono
1332 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
1333 real_0_le_divide_iff ~> zero_le_divide_iff
1334 realpow_two_disj ~> power2_eq_iff
1335 real_squared_diff_one_factored ~> square_diff_one_factored
1336 realpow_two_diff ~> square_diff_square_factored
1337 reals_complete2 ~> complete_real
1338 real_sum_squared_expand ~> power2_sum
1339 exp_ln_eq ~> ln_unique
1341 expi_zero ~> exp_zero
1342 lemma_DERIV_subst ~> DERIV_cong
1343 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
1344 LIMSEQ_const ~> tendsto_const
1345 LIMSEQ_norm ~> tendsto_norm
1346 LIMSEQ_add ~> tendsto_add
1347 LIMSEQ_minus ~> tendsto_minus
1348 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
1349 LIMSEQ_diff ~> tendsto_diff
1350 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
1351 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
1352 LIMSEQ_mult ~> tendsto_mult
1353 LIMSEQ_inverse ~> tendsto_inverse
1354 LIMSEQ_divide ~> tendsto_divide
1355 LIMSEQ_pow ~> tendsto_power
1356 LIMSEQ_setsum ~> tendsto_setsum
1357 LIMSEQ_setprod ~> tendsto_setprod
1358 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
1359 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
1360 LIMSEQ_imp_rabs ~> tendsto_rabs
1361 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
1362 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
1363 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
1364 LIMSEQ_Complex ~> tendsto_Complex
1365 LIM_ident ~> tendsto_ident_at
1366 LIM_const ~> tendsto_const
1367 LIM_add ~> tendsto_add
1368 LIM_add_zero ~> tendsto_add_zero
1369 LIM_minus ~> tendsto_minus
1370 LIM_diff ~> tendsto_diff
1371 LIM_norm ~> tendsto_norm
1372 LIM_norm_zero ~> tendsto_norm_zero
1373 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
1374 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
1375 LIM_rabs ~> tendsto_rabs
1376 LIM_rabs_zero ~> tendsto_rabs_zero
1377 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
1378 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
1379 LIM_compose ~> tendsto_compose
1380 LIM_mult ~> tendsto_mult
1381 LIM_scaleR ~> tendsto_scaleR
1382 LIM_of_real ~> tendsto_of_real
1383 LIM_power ~> tendsto_power
1384 LIM_inverse ~> tendsto_inverse
1385 LIM_sgn ~> tendsto_sgn
1386 isCont_LIM_compose ~> isCont_tendsto_compose
1387 bounded_linear.LIM ~> bounded_linear.tendsto
1388 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
1389 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
1390 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
1391 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
1392 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
1393 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
1395 * Theory Complex_Main: The definition of infinite series was
1396 generalized. Now it is defined on the type class {topological_space,
1397 comm_monoid_add}. Hence it is useable also for extended real numbers.
1399 * Theory Complex_Main: The complex exponential function "expi" is now
1400 a type-constrained abbreviation for "exp :: complex => complex"; thus
1401 several polymorphic lemmas about "exp" are now applicable to "expi".
1405 - Theory Library/Code_Char_ord provides native ordering of
1406 characters in the target language.
1408 - Commands code_module and code_library are legacy, use export_code
1411 - Method "evaluation" is legacy, use method "eval" instead.
1413 - Legacy evaluator "SML" is deactivated by default. May be
1414 reactivated by the following theory command:
1416 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
1418 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
1420 * New proof method "induction" that gives induction hypotheses the
1421 name "IH", thus distinguishing them from further hypotheses that come
1422 from rule induction. The latter are still called "hyps". Method
1423 "induction" is a thin wrapper around "induct" and follows the same
1426 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
1427 still available as a legacy feature for some time.
1430 - Added "need" and "total_consts" options.
1431 - Reintroduced "show_skolems" option by popular demand.
1432 - Renamed attribute: nitpick_def ~> nitpick_unfold.
1436 - Use quasi-sound (and efficient) translations by default.
1437 - Added support for the following provers: E-ToFoF, LEO-II,
1438 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
1439 - Automatically preplay and minimize proofs before showing them if
1440 this can be done within reasonable time.
1441 - sledgehammer available_provers ~> sledgehammer supported_provers.
1443 - Added "preplay_timeout", "slicing", "type_enc", "sound",
1444 "max_mono_iters", and "max_new_mono_instances" options.
1445 - Removed "explicit_apply" and "full_types" options as well as "Full
1446 Types" Proof General menu item. INCOMPATIBILITY.
1449 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
1450 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
1454 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
1455 "elim:" options. INCOMPATIBILITY.
1456 - Introduced 'try' that not only runs 'try_methods' but also
1457 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
1460 - Added "eval" option to evaluate terms for the found counterexample
1461 (currently only supported by the default (exhaustive) tester).
1462 - Added post-processing of terms to obtain readable counterexamples
1463 (currently only supported by the default (exhaustive) tester).
1464 - New counterexample generator quickcheck[narrowing] enables
1465 narrowing-based testing. Requires the Glasgow Haskell compiler
1466 with its installation location defined in the Isabelle settings
1467 environment as ISABELLE_GHC.
1468 - Removed quickcheck tester "SML" based on the SML code generator
1469 (formly in HOL/Library).
1471 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
1472 use 'partial_function' instead.
1474 * Theory Library/Extended_Reals replaces now the positive extended
1475 reals found in probability theory. This file is extended by
1476 Multivariate_Analysis/Extended_Real_Limits.
1478 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
1479 from where it must be imported explicitly if it is really required.
1482 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
1483 been moved here. INCOMPATIBILITY.
1485 * Theory Library/Saturated provides type of numbers with saturated
1488 * Theory Library/Product_Lattice defines a pointwise ordering for the
1489 product type 'a * 'b, and provides instance proofs for various order
1490 and lattice type classes.
1492 * Theory Library/Countable now provides the "countable_datatype" proof
1493 method for proving "countable" class instances for datatypes.
1495 * Theory Library/Cset_Monad allows do notation for computable sets
1496 (cset) via the generic monad ad-hoc overloading facility.
1498 * Library: Theories of common data structures are split into theories
1499 for implementation, an invariant-ensuring type, and connection to an
1500 abstract type. INCOMPATIBILITY.
1502 - RBT is split into RBT and RBT_Mapping.
1503 - AssocList is split and renamed into AList and AList_Mapping.
1504 - DList is split into DList_Impl, DList, and DList_Cset.
1505 - Cset is split into Cset and List_Cset.
1507 * Theory Library/Nat_Infinity has been renamed to
1508 Library/Extended_Nat, with name changes of the following types and
1511 type inat ~> type enat
1513 Infty ~> infinity (overloaded)
1517 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
1518 been renamed accordingly. INCOMPATIBILITY.
1520 * Session Multivariate_Analysis: The euclidean_space type class now
1521 fixes a constant "Basis :: 'a set" consisting of the standard
1522 orthonormal basis for the type. Users now have the option of
1523 quantifying over this set instead of using the "basis" function, e.g.
1524 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
1526 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
1527 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
1528 "Cart_nth" and "Cart_lambda" have been respectively renamed to
1529 "vec_nth" and "vec_lambda"; theorems mentioning those names have
1530 changed to match. Definition theorems for overloaded constants now use
1531 the standard "foo_vec_def" naming scheme. A few other theorems have
1532 been renamed as follows (INCOMPATIBILITY):
1534 Cart_eq ~> vec_eq_iff
1535 dist_nth_le_cart ~> dist_vec_nth_le
1536 tendsto_vector ~> vec_tendstoI
1537 Cauchy_vector ~> vec_CauchyI
1539 * Session Multivariate_Analysis: Several duplicate theorems have been
1540 removed, and other theorems have been renamed or replaced with more
1541 general versions. INCOMPATIBILITY.
1543 finite_choice ~> finite_set_choice
1544 eventually_conjI ~> eventually_conj
1545 eventually_and ~> eventually_conj_iff
1546 eventually_false ~> eventually_False
1547 setsum_norm ~> norm_setsum
1548 Lim_sequentially ~> LIMSEQ_def
1549 Lim_ident_at ~> LIM_ident
1550 Lim_const ~> tendsto_const
1551 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
1552 Lim_neg ~> tendsto_minus
1553 Lim_add ~> tendsto_add
1554 Lim_sub ~> tendsto_diff
1555 Lim_mul ~> tendsto_scaleR
1556 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
1557 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
1558 Lim_linear ~> bounded_linear.tendsto
1559 Lim_component ~> tendsto_euclidean_component
1560 Lim_component_cart ~> tendsto_vec_nth
1561 Lim_inner ~> tendsto_inner [OF tendsto_const]
1562 dot_lsum ~> inner_setsum_left
1563 dot_rsum ~> inner_setsum_right
1564 continuous_cmul ~> continuous_scaleR [OF continuous_const]
1565 continuous_neg ~> continuous_minus
1566 continuous_sub ~> continuous_diff
1567 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
1568 continuous_mul ~> continuous_scaleR
1569 continuous_inv ~> continuous_inverse
1570 continuous_at_within_inv ~> continuous_at_within_inverse
1571 continuous_at_inv ~> continuous_at_inverse
1572 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
1573 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
1574 continuous_at_component ~> continuous_component [OF continuous_at_id]
1575 continuous_on_neg ~> continuous_on_minus
1576 continuous_on_sub ~> continuous_on_diff
1577 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
1578 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
1579 continuous_on_mul ~> continuous_on_scaleR
1580 continuous_on_mul_real ~> continuous_on_mult
1581 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
1582 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
1583 continuous_on_inverse ~> continuous_on_inv
1584 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
1585 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
1586 subset_interior ~> interior_mono
1587 subset_closure ~> closure_mono
1588 closure_univ ~> closure_UNIV
1589 real_arch_lt ~> reals_Archimedean2
1590 real_arch ~> reals_Archimedean3
1591 real_abs_norm ~> abs_norm_cancel
1592 real_abs_sub_norm ~> norm_triangle_ineq3
1593 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
1595 * Session HOL-Probability:
1596 - Caratheodory's extension lemma is now proved for ring_of_sets.
1597 - Infinite products of probability measures are now available.
1598 - Sigma closure is independent, if the generator is independent
1599 - Use extended reals instead of positive extended
1600 reals. INCOMPATIBILITY.
1602 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
1604 expand_fun_below ~> fun_below_iff
1605 below_fun_ext ~> fun_belowI
1606 expand_cfun_eq ~> cfun_eq_iff
1607 ext_cfun ~> cfun_eqI
1608 expand_cfun_below ~> cfun_below_iff
1609 below_cfun_ext ~> cfun_belowI
1610 monofun_fun_fun ~> fun_belowD
1611 monofun_fun_arg ~> monofunE
1612 monofun_lub_fun ~> adm_monofun [THEN admD]
1613 cont_lub_fun ~> adm_cont [THEN admD]
1614 cont2cont_Rep_CFun ~> cont2cont_APP
1615 cont_Rep_CFun_app ~> cont_APP_app
1616 cont_Rep_CFun_app_app ~> cont_APP_app_app
1617 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
1618 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
1619 contlub_cfun ~> lub_APP [symmetric]
1620 contlub_LAM ~> lub_LAM [symmetric]
1623 lift_distinct1 ~> lift.distinct(1)
1624 lift_distinct2 ~> lift.distinct(2)
1625 Def_not_UU ~> lift.distinct(2)
1626 Def_inject ~> lift.inject
1627 below_UU_iff ~> below_bottom_iff
1628 eq_UU_iff ~> eq_bottom_iff
1631 *** Document preparation ***
1633 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
1634 isar-ref manual, both for description and actual application of the
1637 * Antiquotation @{value} evaluates the given term and presents its
1640 * Antiquotations: term style "isub" provides ad-hoc conversion of
1641 variables x1, y23 into subscripted form x\<^isub>1,
1642 y\<^isub>2\<^isub>3.
1644 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
1645 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
1647 * Localized \isabellestyle switch can be used within blocks or groups
1650 \isabellestyle{it} %preferred default
1651 {\isabellestylett @{text "typewriter stuff"}}
1653 * Discontinued special treatment of hard tabulators. Implicit
1654 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
1660 * The inner syntax of sort/type/term/prop supports inlined YXML
1661 representations within quoted string tokens. By encoding logical
1662 entities via Term_XML (in ML or Scala) concrete syntax can be
1663 bypassed, which is particularly useful for producing bits of text
1664 under external program control.
1666 * Antiquotations for ML and document preparation are managed as theory
1667 data, which requires explicit setup.
1669 * Isabelle_Process.is_active allows tools to check if the official
1670 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
1671 (better known as Proof General).
1673 * Structure Proof_Context follows standard naming scheme. Old
1674 ProofContext is still available for some time as legacy alias.
1676 * Structure Timing provides various operations for timing; supersedes
1677 former start_timing/end_timing etc.
1679 * Path.print is the official way to show file-system paths to users
1680 (including quotes etc.).
1682 * Inner syntax: identifiers in parse trees of generic categories
1683 "logic", "aprop", "idt" etc. carry position information (disguised as
1684 type constraints). Occasional INCOMPATIBILITY with non-compliant
1685 translations that choke on unexpected type constraints. Positions can
1686 be stripped in ML translations via Syntax.strip_positions /
1687 Syntax.strip_positions_ast, or via the syntax constant
1688 "_strip_positions" within parse trees. As last resort, positions can
1689 be disabled via the configuration option Syntax.positions, which is
1690 called "syntax_positions" in Isar attribute syntax.
1692 * Discontinued special status of various ML structures that contribute
1693 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
1694 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
1695 refer directly to Ast.Constant, Lexicon.is_identifier,
1696 Syntax_Trans.mk_binder_tr etc.
1698 * Typed print translation: discontinued show_sorts argument, which is
1699 already available via context of "advanced" translation.
1701 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
1702 goal states; body tactic needs to address all subgoals uniformly.
1704 * Slightly more special eq_list/eq_set, with shortcut involving
1705 pointer equality (assumes that eq relation is reflexive).
1707 * Classical tactics use proper Proof.context instead of historic types
1708 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
1709 operate directly on Proof.context. Raw type claset retains its use as
1710 snapshot of the classical context, which can be recovered via
1711 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
1712 INCOMPATIBILITY, classical tactics and derived proof methods require
1713 proper Proof.context.
1718 * Discontinued support for Poly/ML 5.2, which was the last version
1719 without proper multithreading and TimeLimit implementation.
1721 * Discontinued old lib/scripts/polyml-platform, which has been
1722 obsolete since Isabelle2009-2.
1724 * Various optional external tools are referenced more robustly and
1725 uniformly by explicit Isabelle settings as follows:
1727 ISABELLE_CSDP (formerly CSDP_EXE)
1728 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
1729 ISABELLE_OCAML (formerly EXEC_OCAML)
1730 ISABELLE_SWIPL (formerly EXEC_SWIPL)
1731 ISABELLE_YAP (formerly EXEC_YAP)
1733 Note that automated detection from the file-system or search path has
1734 been discontinued. INCOMPATIBILITY.
1736 * Scala layer provides JVM method invocation service for static
1737 methods of type (String)String, see Invoke_Scala.method in ML. For
1740 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
1742 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
1743 this allows to pass structured values between ML and Scala.
1745 * The IsabelleText fonts includes some further glyphs to support the
1746 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
1747 installed a local copy (which is normally *not* required) need to
1748 delete or update it from ~~/lib/fonts/.
1752 New in Isabelle2011 (January 2011)
1753 ----------------------------------
1757 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
1758 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
1759 useful tooltips and hyperlinks produced from its static analysis. The
1760 bundled component provides an executable Isabelle tool that can be run
1763 Isabelle2011/bin/isabelle jedit
1765 * Significantly improved Isabelle/Isar implementation manual.
1767 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
1768 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
1769 while the default heap location within that directory lacks that extra
1770 suffix. This isolates multiple Isabelle installations from each
1771 other, avoiding problems with old settings in new versions.
1772 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
1774 * Source files are always encoded as UTF-8, instead of old-fashioned
1775 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
1776 the following package declarations:
1778 \usepackage[utf8]{inputenc}
1779 \usepackage{textcomp}
1781 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
1782 a Unicode character is treated as a single symbol, not a sequence of
1783 non-ASCII bytes as before. Since Isabelle/ML string literals may
1784 contain symbols without further backslash escapes, Unicode can now be
1785 used here as well. Recall that Symbol.explode in ML provides a
1786 consistent view on symbols, while raw explode (or String.explode)
1787 merely give a byte-oriented representation.
1789 * Theory loader: source files are primarily located via the master
1790 directory of each theory node (where the .thy file itself resides).
1791 The global load path is still partially available as legacy feature.
1792 Minor INCOMPATIBILITY due to subtle change in file lookup: use
1793 explicit paths, relatively to the theory.
1795 * Special treatment of ML file names has been discontinued.
1796 Historically, optional extensions .ML or .sml were added on demand --
1797 at the cost of clarity of file dependencies. Recall that Isabelle/ML
1798 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
1800 * Various options that affect pretty printing etc. are now properly
1801 handled within the context via configuration options, instead of
1802 unsynchronized references or print modes. There are both ML Config.T
1803 entities and Isar declaration attributes to access these.
1805 ML (Config.T) Isar (attribute)
1807 eta_contract eta_contract
1808 show_brackets show_brackets
1809 show_sorts show_sorts
1810 show_types show_types
1811 show_question_marks show_question_marks
1812 show_consts show_consts
1813 show_abbrevs show_abbrevs
1815 Syntax.ast_trace syntax_ast_trace
1816 Syntax.ast_stat syntax_ast_stat
1817 Syntax.ambiguity_level syntax_ambiguity_level
1819 Goal_Display.goals_limit goals_limit
1820 Goal_Display.show_main_goal show_main_goal
1822 Method.rule_trace rule_trace
1824 Thy_Output.display thy_output_display
1825 Thy_Output.quotes thy_output_quotes
1826 Thy_Output.indent thy_output_indent
1827 Thy_Output.source thy_output_source
1828 Thy_Output.break thy_output_break
1830 Note that corresponding "..._default" references in ML may only be
1831 changed globally at the ROOT session setup, but *not* within a theory.
1832 The option "show_abbrevs" supersedes the former print mode
1833 "no_abbrevs" with inverted meaning.
1835 * More systematic naming of some configuration options.
1838 trace_simp ~> simp_trace
1839 debug_simp ~> simp_debug
1841 * Support for real valued configuration options, using simplistic
1842 floating-point notation that coincides with the inner syntax for
1845 * Support for real valued preferences (with approximative PGIP type):
1846 front-ends need to accept "pgint" values in float notation.
1849 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
1852 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
1857 * Command 'type_synonym' (with single argument) replaces somewhat
1858 outdated 'types', which is still available as legacy feature for some
1861 * Command 'nonterminal' (with 'and' separated list of arguments)
1862 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
1864 * Command 'notepad' replaces former 'example_proof' for
1865 experimentation in Isar without any result. INCOMPATIBILITY.
1867 * Locale interpretation commands 'interpret' and 'sublocale' accept
1868 lists of equations to map definitions in a locale to appropriate
1869 entities in the context of the interpretation. The 'interpretation'
1870 command already provided this functionality.
1872 * Diagnostic command 'print_dependencies' prints the locale instances
1873 that would be activated if the specified expression was interpreted in
1874 the current context. Variant "print_dependencies!" assumes a context
1875 without interpretations.
1877 * Diagnostic command 'print_interps' prints interpretations in proofs
1878 in addition to interpretations in theories.
1880 * Discontinued obsolete 'global' and 'local' commands to manipulate
1881 the theory name space. Rare INCOMPATIBILITY. The ML functions
1882 Sign.root_path and Sign.local_path may be applied directly where this
1883 feature is still required for historical reasons.
1885 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
1886 'definition' instead.
1888 * The "prems" fact, which refers to the accidental collection of
1889 foundational premises in the context, is now explicitly marked as
1890 legacy feature and will be discontinued soon. Consider using "assms"
1891 of the head statement or reference facts by explicit names.
1893 * Document antiquotations @{class} and @{type} print classes and type
1896 * Document antiquotation @{file} checks file/directory entries within
1897 the local file system.
1902 * Coercive subtyping: functions can be declared as coercions and type
1903 inference will add them as necessary upon input of a term. Theory
1904 Complex_Main declares real :: nat => real and real :: int => real as
1905 coercions. A coercion function f is declared like this:
1907 declare [[coercion f]]
1909 To lift coercions through type constructors (e.g. from nat => real to
1910 nat list => real list), map functions can be declared, e.g.
1912 declare [[coercion_map map]]
1914 Currently coercion inference is activated only in theories including
1915 real numbers, i.e. descendants of Complex_Main. This is controlled by
1916 the configuration option "coercion_enabled", e.g. it can be enabled in
1917 other theories like this:
1919 declare [[coercion_enabled]]
1921 * Command 'partial_function' provides basic support for recursive
1922 function definitions over complete partial orders. Concrete instances
1923 are provided for i) the option type, ii) tail recursion on arbitrary
1924 types, and iii) the heap monad of Imperative_HOL. See
1925 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
1928 * Function package: f.psimps rules are no longer implicitly declared
1929 as [simp]. INCOMPATIBILITY.
1931 * Datatype package: theorems generated for executable equality (class
1932 "eq") carry proper names and are treated as default code equations.
1934 * Inductive package: now offers command 'inductive_simps' to
1935 automatically derive instantiated and simplified equations for
1936 inductive predicates, similar to 'inductive_cases'.
1938 * Command 'enriched_type' allows to register properties of the
1939 functorial structure of types.
1941 * Improved infrastructure for term evaluation using code generator
1942 techniques, in particular static evaluation conversions.
1944 * Code generator: Scala (2.8 or higher) has been added to the target
1947 * Code generator: globbing constant expressions "*" and "Theory.*"
1948 have been replaced by the more idiomatic "_" and "Theory._".
1951 * Code generator: export_code without explicit file declaration prints
1952 to standard output. INCOMPATIBILITY.
1954 * Code generator: do not print function definitions for case
1955 combinators any longer.
1957 * Code generator: simplification with rules determined with
1958 src/Tools/Code/code_simp.ML and method "code_simp".
1960 * Code generator for records: more idiomatic representation of record
1961 types. Warning: records are not covered by ancient SML code
1962 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
1963 rep_datatype declaration helps to succeed then:
1967 rep_datatype foo_ext ...
1969 * Records: logical foundation type for records does not carry a
1970 '_type' suffix any longer (obsolete due to authentic syntax).
1973 * Quickcheck now by default uses exhaustive testing instead of random
1974 testing. Random testing can be invoked by "quickcheck [random]",
1975 exhaustive testing by "quickcheck [exhaustive]".
1977 * Quickcheck instantiates polymorphic types with small finite
1978 datatypes by default. This enables a simple execution mechanism to
1979 handle quantifiers and function equality over the finite datatypes.
1981 * Quickcheck random generator has been renamed from "code" to
1982 "random". INCOMPATIBILITY.
1984 * Quickcheck now has a configurable time limit which is set to 30
1985 seconds by default. This can be changed by adding [timeout = n] to the
1986 quickcheck command. The time limit for Auto Quickcheck is still set
1989 * Quickcheck in locales considers interpretations of that locale for
1990 counter example search.
1993 - Added "smt" and "remote_smt" provers based on the "smt" proof
1994 method. See the Sledgehammer manual for details ("isabelle doc
1997 sledgehammer atp_info ~> sledgehammer running_provers
1998 sledgehammer atp_kill ~> sledgehammer kill_provers
1999 sledgehammer available_atps ~> sledgehammer available_provers
2002 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
2003 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
2004 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
2005 (and "ms" and "min" are no longer supported)
2010 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
2011 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
2013 - Added support for partial quotient types.
2014 - Added local versions of the "Nitpick.register_xxx" functions.
2015 - Added "whack" option.
2016 - Allow registration of quotient types as codatatypes.
2017 - Improved "merge_type_vars" option to merge more types.
2018 - Removed unsound "fast_descrs" option.
2019 - Added custom symmetry breaking for datatypes, making it possible to reach
2020 higher cardinalities.
2021 - Prevent the expansion of too large definitions.
2023 * Proof methods "metis" and "meson" now have configuration options
2024 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
2025 to diagnose these tools. E.g.
2027 using [[metis_trace = true]]
2029 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
2030 manually as command 'solve_direct'.
2032 * The default SMT solver Z3 must be enabled explicitly (due to
2033 licensing issues) by setting the environment variable
2034 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
2035 commercial applications, the SMT solver CVC3 is provided as fall-back;
2036 changing the SMT solver is done via the configuration option
2039 * Remote SMT solvers need to be referred to by the "remote_" prefix,
2040 i.e. "remote_cvc3" and "remote_z3".
2042 * Added basic SMT support for datatypes, records, and typedefs using
2043 the oracle mode (no proofs). Direct support of pairs has been dropped
2044 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
2045 support for a similar behavior). Minor INCOMPATIBILITY.
2047 * Changed SMT configuration options:
2049 z3_proofs ~> smt_oracle (with inverted meaning)
2050 z3_trace_assms ~> smt_trace_used_facts
2063 * Boogie output files (.b2i files) need to be declared in the theory
2066 * Simplification procedure "list_to_set_comprehension" rewrites list
2067 comprehensions applied to List.set to set comprehensions. Occasional
2068 INCOMPATIBILITY, may be deactivated like this:
2070 declare [[simproc del: list_to_set_comprehension]]
2072 * Removed old version of primrec package. INCOMPATIBILITY.
2074 * Removed simplifier congruence rule of "prod_case", as has for long
2075 been the case with "split". INCOMPATIBILITY.
2077 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
2079 * Removed [split_format ... and ... and ...] version of
2080 [split_format]. Potential INCOMPATIBILITY.
2082 * Predicate "sorted" now defined inductively, with nice induction
2083 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
2085 * Constant "contents" renamed to "the_elem", to free the generic name
2086 contents for other uses. INCOMPATIBILITY.
2088 * Renamed class eq and constant eq (for code generation) to class
2089 equal and constant equal, plus renaming of related facts and various
2090 tuning. INCOMPATIBILITY.
2092 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
2094 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
2097 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
2098 avoid confusion with finite sets. INCOMPATIBILITY.
2100 * Abandoned locales equiv, congruent and congruent2 for equivalence
2101 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
2104 * Some previously unqualified names have been qualified:
2111 Trueprop ~> HOL.Trueprop
2116 op --> ~> HOL.implies
2128 Pair ~> Product_Type.Pair
2129 fst ~> Product_Type.fst
2130 snd ~> Product_Type.snd
2131 curry ~> Product_Type.curry
2133 Collect ~> Set.Collect
2137 * More canonical naming convention for some fundamental definitions:
2139 bot_bool_eq ~> bot_bool_def
2140 top_bool_eq ~> top_bool_def
2141 inf_bool_eq ~> inf_bool_def
2142 sup_bool_eq ~> sup_bool_def
2143 bot_fun_eq ~> bot_fun_def
2144 top_fun_eq ~> top_fun_def
2145 inf_fun_eq ~> inf_fun_def
2146 sup_fun_eq ~> sup_fun_def
2150 * More stylized fact names:
2152 expand_fun_eq ~> fun_eq_iff
2153 expand_set_eq ~> set_eq_iff
2155 nat_number ~> eval_nat_numeral
2159 * Refactoring of code-generation specific operations in theory List:
2165 mem_iff ~> member_def
2166 null_empty ~> null_def
2168 INCOMPATIBILITY. Note that these were not supposed to be used
2169 regularly unless for striking reasons; their main purpose was code
2172 Various operations from the Haskell prelude are used for generating
2175 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
2176 "surj f" is now an abbreviation of "range f = UNIV". The theorems
2177 bij_def and surj_def are unchanged. INCOMPATIBILITY.
2179 * Abolished some non-alphabetic type names: "prod" and "sum" replace
2180 "*" and "+" respectively. INCOMPATIBILITY.
2182 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
2183 "Sum_Type.Plus" instead.
2185 * Constant "split" has been merged with constant "prod_case"; names of
2186 ML functions, facts etc. involving split have been retained so far,
2187 though. INCOMPATIBILITY.
2189 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
2190 instead. INCOMPATIBILITY.
2192 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
2195 * Former theory Library/Enum is now part of the HOL-Main image.
2196 INCOMPATIBILITY: all constants of the Enum theory now have to be
2197 referred to by its qualified name.
2200 nlists ~> Enum.nlists
2201 product ~> Enum.product
2203 * Theory Library/Monad_Syntax provides do-syntax for monad types.
2204 Syntax in Library/State_Monad has been changed to avoid ambiguities.
2207 * Theory Library/SetsAndFunctions has been split into
2208 Library/Function_Algebras and Library/Set_Algebras; canonical names
2209 for instance definitions for functions; various improvements.
2212 * Theory Library/Multiset provides stable quicksort implementation of
2215 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
2218 * Session Multivariate_Analysis: introduced a type class for euclidean
2219 space. Most theorems are now stated in terms of euclidean spaces
2220 instead of finite cartesian products.
2223 real ^ 'n ~> 'a::real_vector
2224 ~> 'a::euclidean_space
2225 ~> 'a::ordered_euclidean_space
2226 (depends on your needs)
2230 \<chi> x. _ ~> \<chi>\<chi> x. _
2233 Also note that the indices are now natural numbers and not from some
2234 finite type. Finite cartesian products of euclidean spaces, products
2235 of euclidean spaces the real and complex numbers are instantiated to
2236 be euclidean_spaces. INCOMPATIBILITY.
2238 * Session Probability: introduced pextreal as positive extended real
2239 numbers. Use pextreal as value for measures. Introduce the
2240 Radon-Nikodym derivative, product spaces and Fubini's theorem for
2241 arbitrary sigma finite measures. Introduces Lebesgue measure based on
2242 the integral in Multivariate Analysis. INCOMPATIBILITY.
2244 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
2247 * Session SPARK (with image HOL-SPARK) provides commands to load and
2248 prove verification conditions generated by the SPARK Ada program
2249 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
2254 * Theorems for additive ring operations (locale abelian_monoid and
2255 descendants) are generated by interpretation from their multiplicative
2256 counterparts. Names (in particular theorem names) have the mandatory
2257 qualifier 'add'. Previous theorem names are redeclared for
2260 * Structure "int_ring" is now an abbreviation (previously a
2261 definition). This fits more natural with advanced interpretations.
2266 * The domain package now runs in definitional mode by default: The
2267 former command 'new_domain' is now called 'domain'. To use the domain
2268 package in its original axiomatic mode, use 'domain (unsafe)'.
2271 * The new class "domain" is now the default sort. Class "predomain"
2272 is an unpointed version of "domain". Theories can be updated by
2273 replacing sort annotations as shown below. INCOMPATIBILITY.
2275 'a::type ~> 'a::countable
2276 'a::cpo ~> 'a::predomain
2277 'a::pcpo ~> 'a::domain
2279 * The old type class "rep" has been superseded by class "domain".
2280 Accordingly, users of the definitional package must remove any
2281 "default_sort rep" declarations. INCOMPATIBILITY.
2283 * The domain package (definitional mode) now supports unpointed
2284 predomain argument types, as long as they are marked 'lazy'. (Strict
2285 arguments must be in class "domain".) For example, the following
2286 domain definition now works:
2288 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
2290 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
2291 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
2292 'a option, and 'a list. Additionally, it configures fixrec and the
2293 domain package to work with these types. For example:
2295 fixrec isInl :: "('a + 'b) u -> tr"
2296 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
2298 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
2300 * The "(permissive)" option of fixrec has been replaced with a
2301 per-equation "(unchecked)" option. See
2302 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
2304 * The "bifinite" class no longer fixes a constant "approx"; the class
2305 now just asserts that such a function exists. INCOMPATIBILITY.
2307 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
2308 defines an embedding of type 'a defl into udom by default; instances
2309 of "bifinite" and "domain" classes are available in
2310 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
2312 * The syntax "REP('a)" has been replaced with "DEFL('a)".
2314 * The predicate "directed" has been removed. INCOMPATIBILITY.
2316 * The type class "finite_po" has been removed. INCOMPATIBILITY.
2318 * The function "cprod_map" has been renamed to "prod_map".
2321 * The monadic bind operator on each powerdomain has new binder syntax
2322 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
2323 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
2325 * The infix syntax for binary union on each powerdomain has changed
2326 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
2327 syntax. INCOMPATIBILITY.
2329 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
2330 still supported as an input translation.
2332 * Renamed some theorems (the original names are also still available).
2334 expand_fun_below ~> fun_below_iff
2335 below_fun_ext ~> fun_belowI
2336 expand_cfun_eq ~> cfun_eq_iff
2337 ext_cfun ~> cfun_eqI
2338 expand_cfun_below ~> cfun_below_iff
2339 below_cfun_ext ~> cfun_belowI
2340 cont2cont_Rep_CFun ~> cont2cont_APP
2342 * The Abs and Rep functions for various types have changed names.
2343 Related theorem names have also changed to match. INCOMPATIBILITY.
2345 Rep_CFun ~> Rep_cfun
2346 Abs_CFun ~> Abs_cfun
2347 Rep_Sprod ~> Rep_sprod
2348 Abs_Sprod ~> Abs_sprod
2349 Rep_Ssum ~> Rep_ssum
2350 Abs_Ssum ~> Abs_ssum
2352 * Lemmas with names of the form *_defined_iff or *_strict_iff have
2353 been renamed to *_bottom_iff. INCOMPATIBILITY.
2355 * Various changes to bisimulation/coinduction with domain package:
2357 - Definitions of "bisim" constants no longer mention definedness.
2358 - With mutual recursion, "bisim" predicate is now curried.
2359 - With mutual recursion, each type gets a separate coind theorem.
2360 - Variable names in bisim_def and coinduct rules have changed.
2364 * Case combinators generated by the domain package for type "foo" are
2365 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
2367 * Several theorems have been renamed to more accurately reflect the
2368 names of constants and types involved. INCOMPATIBILITY.
2370 thelub_const ~> lub_const
2371 lub_const ~> is_lub_const
2373 is_lub_lub ~> is_lubD2
2375 unique_lub ~> is_lub_unique
2376 is_ub_lub ~> is_lub_rangeD1
2377 lub_bin_chain ~> is_lub_bin_chain
2378 lub_fun ~> is_lub_fun
2379 thelub_fun ~> lub_fun
2380 thelub_cfun ~> lub_cfun
2381 thelub_Pair ~> lub_Pair
2382 lub_cprod ~> is_lub_prod
2383 thelub_cprod ~> lub_prod
2384 minimal_cprod ~> minimal_prod
2385 inst_cprod_pcpo ~> inst_prod_pcpo
2387 compact_UU ~> compact_bottom
2388 deflation_UU ~> deflation_bottom
2389 finite_deflation_UU ~> finite_deflation_bottom
2391 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
2393 sq_ord_less_eq_trans ~> below_eq_trans
2394 sq_ord_eq_less_trans ~> eq_below_trans
2395 refl_less ~> below_refl
2396 trans_less ~> below_trans
2397 antisym_less ~> below_antisym
2398 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
2399 box_less ~> box_below
2400 rev_trans_less ~> rev_below_trans
2401 not_less2not_eq ~> not_below2not_eq
2402 less_UU_iff ~> below_UU_iff
2403 flat_less_iff ~> flat_below_iff
2404 adm_less ~> adm_below
2405 adm_not_less ~> adm_not_below
2406 adm_compact_not_less ~> adm_compact_not_below
2407 less_fun_def ~> below_fun_def
2408 expand_fun_less ~> fun_below_iff
2409 less_fun_ext ~> fun_belowI
2410 less_discr_def ~> below_discr_def
2411 discr_less_eq ~> discr_below_eq
2412 less_unit_def ~> below_unit_def
2413 less_cprod_def ~> below_prod_def
2414 prod_lessI ~> prod_belowI
2415 Pair_less_iff ~> Pair_below_iff
2416 fst_less_iff ~> fst_below_iff
2417 snd_less_iff ~> snd_below_iff
2418 expand_cfun_less ~> cfun_below_iff
2419 less_cfun_ext ~> cfun_belowI
2420 injection_less ~> injection_below
2421 less_up_def ~> below_up_def
2422 not_Iup_less ~> not_Iup_below
2423 Iup_less ~> Iup_below
2425 Def_inject_less_eq ~> Def_below_Def
2426 Def_less_is_eq ~> Def_below_iff
2427 spair_less_iff ~> spair_below_iff
2428 less_sprod ~> below_sprod
2429 spair_less ~> spair_below
2430 sfst_less_iff ~> sfst_below_iff
2431 ssnd_less_iff ~> ssnd_below_iff
2432 fix_least_less ~> fix_least_below
2433 dist_less_one ~> dist_below_one
2434 less_ONE ~> below_ONE
2435 ONE_less_iff ~> ONE_below_iff
2436 less_sinlD ~> below_sinlD
2437 less_sinrD ~> below_sinrD
2442 * All constant names are now qualified internally and use proper
2443 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
2448 * Antiquotation @{assert} inlines a function bool -> unit that raises
2449 Fail if the argument is false. Due to inlining the source position of
2450 failed assertions is included in the error output.
2452 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
2453 text is in practice always evaluated with a stable theory checkpoint.
2454 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
2456 * Antiquotation @{theory A} refers to theory A from the ancestry of
2457 the current context, not any accidental theory loader state as before.
2458 Potential INCOMPATIBILITY, subtle change in semantics.
2460 * Syntax.pretty_priority (default 0) configures the required priority
2461 of pretty-printed output and thus affects insertion of parentheses.
2463 * Syntax.default_root (default "any") configures the inner syntax
2464 category (nonterminal symbol) for parsing of terms.
2466 * Former exception Library.UnequalLengths now coincides with
2467 ListPair.UnequalLengths.
2469 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
2470 main functionality is provided by structure Simplifier.
2472 * Renamed raw "explode" function to "raw_explode" to emphasize its
2473 meaning. Note that internally to Isabelle, Symbol.explode is used in
2474 almost all situations.
2476 * Discontinued obsolete function sys_error and exception SYS_ERROR.
2477 See implementation manual for further details on exceptions in
2480 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
2483 * Renamed structure PureThy to Pure_Thy and moved most of its
2484 operations to structure Global_Theory, to emphasize that this is
2485 rarely-used global-only stuff.
2487 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
2488 instead (or tracing for high-volume output).
2490 * Configuration option show_question_marks only affects regular pretty
2491 printing of types and terms, not raw Term.string_of_vname.
2493 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
2494 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
2495 @{thms} for most purposes.
2497 * ML structure Unsynchronized is never opened, not even in Isar
2498 interaction mode as before. Old Unsynchronized.set etc. have been
2499 discontinued -- use plain := instead. This should be *rare* anyway,
2500 since modern tools always work via official context data, notably
2501 configuration options.
2503 * Parallel and asynchronous execution requires special care concerning
2504 interrupts. Structure Exn provides some convenience functions that
2505 avoid working directly with raw Interrupt. User code must not absorb
2506 interrupts -- intermediate handling (for cleanup etc.) needs to be
2507 followed by re-raising of the original exception. Another common
2508 source of mistakes are "handle _" patterns, which make the meaning of
2509 the program subject to physical effects of the environment.
2513 New in Isabelle2009-2 (June 2010)
2514 ---------------------------------
2518 * Authentic syntax for *all* logical entities (type classes, type
2519 constructors, term constants): provides simple and robust
2520 correspondence between formal entities and concrete syntax. Within
2521 the parse tree / AST representations, "constants" are decorated by
2522 their category (class, type, const) and spelled out explicitly with
2523 their full internal name.
2525 Substantial INCOMPATIBILITY concerning low-level syntax declarations
2526 and translations (translation rules and translation functions in ML).
2527 Some hints on upgrading:
2529 - Many existing uses of 'syntax' and 'translations' can be replaced
2530 by more modern 'type_notation', 'notation' and 'abbreviation',
2531 which are independent of this issue.
2533 - 'translations' require markup within the AST; the term syntax
2534 provides the following special forms:
2536 CONST c -- produces syntax version of constant c from context
2537 XCONST c -- literally c, checked as constant from context
2538 c -- literally c, if declared by 'syntax'
2540 Plain identifiers are treated as AST variables -- occasionally the
2541 system indicates accidental variables via the error "rhs contains
2544 Type classes and type constructors are marked according to their
2545 concrete syntax. Some old translations rules need to be written
2546 for the "type" category, using type constructor application
2547 instead of pseudo-term application of the default category
2550 - 'parse_translation' etc. in ML may use the following
2553 @{class_syntax c} -- type class c within parse tree / AST
2554 @{term_syntax c} -- type constructor c within parse tree / AST
2555 @{const_syntax c} -- ML version of "CONST c" above
2556 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
2558 - Literal types within 'typed_print_translations', i.e. those *not*
2559 represented as pseudo-terms are represented verbatim. Use @{class
2560 c} or @{type_name c} here instead of the above syntax
2563 Note that old non-authentic syntax was based on unqualified base
2564 names, so all of the above "constant" names would coincide. Recall
2565 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
2566 diagnose syntax problems.
2568 * Type constructors admit general mixfix syntax, not just infix.
2570 * Concrete syntax may be attached to local entities without a proof
2571 body, too. This works via regular mixfix annotations for 'fix',
2572 'def', 'obtain' etc. or via the explicit 'write' command, which is
2573 similar to the 'notation' command in theory specifications.
2575 * Discontinued unnamed infix syntax (legacy feature for many years) --
2576 need to specify constant name and syntax separately. Internal ML
2577 datatype constructors have been renamed from InfixName to Infix etc.
2578 Minor INCOMPATIBILITY.
2580 * Schematic theorem statements need to be explicitly markup as such,
2581 via commands 'schematic_lemma', 'schematic_theorem',
2582 'schematic_corollary'. Thus the relevance of the proof is made
2583 syntactically clear, which impacts performance in a parallel or
2584 asynchronous interactive environment. Minor INCOMPATIBILITY.
2586 * Use of cumulative prems via "!" in some proof methods has been
2587 discontinued (old legacy feature).
2589 * References 'trace_simp' and 'debug_simp' have been replaced by
2590 configuration options stored in the context. Enabling tracing (the
2591 case of debugging is similar) in proofs works via
2593 using [[trace_simp = true]]
2595 Tracing is then active for all invocations of the simplifier in
2596 subsequent goal refinement steps. Tracing may also still be enabled or
2597 disabled via the ProofGeneral settings menu.
2599 * Separate commands 'hide_class', 'hide_type', 'hide_const',
2600 'hide_fact' replace the former 'hide' KIND command. Minor
2603 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
2604 more efficient than combinations with -q1 or -q2.
2609 * Proofterms record type-class reasoning explicitly, using the
2610 "unconstrain" operation internally. This eliminates all sort
2611 constraints from a theorem and proof, introducing explicit
2612 OFCLASS-premises. On the proof term level, this operation is
2613 automatically applied at theorem boundaries, such that closed proofs
2614 are always free of sort constraints. INCOMPATIBILITY for tools that
2615 inspect proof terms.
2617 * Local theory specifications may depend on extra type variables that
2618 are not present in the result type -- arguments TYPE('a) :: 'a itself
2619 are added internally. For example:
2621 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
2623 * Predicates of locales introduced by classes carry a mandatory
2624 "class" prefix. INCOMPATIBILITY.
2626 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
2628 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
2631 * Command 'code_reflect' allows to incorporate generated ML code into
2632 runtime environment; replaces immature code_datatype antiquotation.
2635 * Code generator: simple concept for abstract datatypes obeying
2638 * Code generator: details of internal data cache have no impact on the
2639 user space functionality any longer.
2641 * Methods "unfold_locales" and "intro_locales" ignore non-locale
2642 subgoals. This is more appropriate for interpretations with 'where'.
2645 * Command 'example_proof' opens an empty proof body. This allows to
2646 experiment with Isar, without producing any persistent result.
2648 * Commands 'type_notation' and 'no_type_notation' declare type syntax
2649 within a local theory context, with explicit checking of the
2650 constructors involved (in contrast to the raw 'syntax' versions).
2652 * Commands 'types' and 'typedecl' now work within a local theory
2653 context -- without introducing dependencies on parameters or
2654 assumptions, which is not possible in Isabelle/Pure.
2656 * Command 'defaultsort' has been renamed to 'default_sort', it works
2657 within a local theory context. Minor INCOMPATIBILITY.
2662 * Command 'typedef' now works within a local theory context -- without
2663 introducing dependencies on parameters or assumptions, which is not
2664 possible in Isabelle/Pure/HOL. Note that the logical environment may
2665 contain multiple interpretations of local typedefs (with different
2666 non-emptiness proofs), even in a global theory context.
2668 * New package for quotient types. Commands 'quotient_type' and
2669 'quotient_definition' may be used for defining types and constants by
2670 quotient constructions. An example is the type of integers created by
2671 quotienting pairs of natural numbers:
2674 intrel :: "(nat * nat) => (nat * nat) => bool"
2676 "intrel (x, y) (u, v) = (x + v = u + y)"
2678 quotient_type int = "nat * nat" / intrel
2679 by (auto simp add: equivp_def expand_fun_eq)
2682 "0::int" is "(0::nat, 0::nat)"
2684 The method "lifting" can be used to lift of theorems from the
2685 underlying "raw" type to the quotient type. The example
2686 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
2687 construction and provides a reasoning infrastructure for finite sets.
2689 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
2690 clash with new theory Quotient in Main HOL.
2692 * Moved the SMT binding into the main HOL session, eliminating
2693 separate HOL-SMT session.
2695 * List membership infix mem operation is only an input abbreviation.
2698 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
2699 for future developements; former Library/Word.thy is still present in
2700 the AFP entry RSAPPS.
2702 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
2703 longer shadowed. INCOMPATIBILITY.
2705 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
2708 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
2711 * Dropped normalizing_semiring etc; use the facts in semiring classes
2712 instead. INCOMPATIBILITY.
2714 * Dropped several real-specific versions of lemmas about floor and
2715 ceiling; use the generic lemmas from theory "Archimedean_Field"
2716 instead. INCOMPATIBILITY.
2718 floor_number_of_eq ~> floor_number_of
2719 le_floor_eq_number_of ~> number_of_le_floor
2720 le_floor_eq_zero ~> zero_le_floor
2721 le_floor_eq_one ~> one_le_floor
2722 floor_less_eq_number_of ~> floor_less_number_of
2723 floor_less_eq_zero ~> floor_less_zero
2724 floor_less_eq_one ~> floor_less_one
2725 less_floor_eq_number_of ~> number_of_less_floor
2726 less_floor_eq_zero ~> zero_less_floor
2727 less_floor_eq_one ~> one_less_floor
2728 floor_le_eq_number_of ~> floor_le_number_of
2729 floor_le_eq_zero ~> floor_le_zero
2730 floor_le_eq_one ~> floor_le_one
2731 floor_subtract_number_of ~> floor_diff_number_of
2732 floor_subtract_one ~> floor_diff_one
2733 ceiling_number_of_eq ~> ceiling_number_of
2734 ceiling_le_eq_number_of ~> ceiling_le_number_of
2735 ceiling_le_zero_eq ~> ceiling_le_zero
2736 ceiling_le_eq_one ~> ceiling_le_one
2737 less_ceiling_eq_number_of ~> number_of_less_ceiling
2738 less_ceiling_eq_zero ~> zero_less_ceiling
2739 less_ceiling_eq_one ~> one_less_ceiling
2740 ceiling_less_eq_number_of ~> ceiling_less_number_of
2741 ceiling_less_eq_zero ~> ceiling_less_zero
2742 ceiling_less_eq_one ~> ceiling_less_one
2743 le_ceiling_eq_number_of ~> number_of_le_ceiling
2744 le_ceiling_eq_zero ~> zero_le_ceiling
2745 le_ceiling_eq_one ~> one_le_ceiling
2746 ceiling_subtract_number_of ~> ceiling_diff_number_of
2747 ceiling_subtract_one ~> ceiling_diff_one
2749 * Theory "Finite_Set": various folding_XXX locales facilitate the
2750 application of the various fold combinators on finite sets.
2752 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
2753 provides abstract red-black tree type which is backed by "RBT_Impl" as
2754 implementation. INCOMPATIBILTY.
2756 * Theory Library/Coinductive_List has been removed -- superseded by
2757 AFP/thys/Coinductive.
2759 * Theory PReal, including the type "preal" and related operations, has
2760 been removed. INCOMPATIBILITY.
2762 * Real: new development using Cauchy Sequences.
2764 * Split off theory "Big_Operators" containing setsum, setprod,
2765 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
2767 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
2768 "Int" etc. INCOMPATIBILITY.
2770 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
2772 * New set of rules "ac_simps" provides combined assoc / commute
2773 rewrites for all interpretations of the appropriate generic locales.
2775 * Renamed theory "OrderedGroup" to "Groups" and split theory
2776 "Ring_and_Field" into theories "Rings" and "Fields"; for more
2777 appropriate and more consistent names suitable for name prefixes
2778 within the HOL theories. INCOMPATIBILITY.
2780 * Some generic constants have been put to appropriate theories:
2781 - less_eq, less: Orderings
2782 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
2783 - inverse, divide: Rings
2786 * More consistent naming of type classes involving orderings (and
2789 lower_semilattice ~> semilattice_inf
2790 upper_semilattice ~> semilattice_sup
2792 dense_linear_order ~> dense_linorder
2794 pordered_ab_group_add ~> ordered_ab_group_add
2795 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
2796 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
2797 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
2798 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
2799 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
2800 pordered_cancel_semiring ~> ordered_cancel_semiring
2801 pordered_comm_monoid_add ~> ordered_comm_monoid_add
2802 pordered_comm_ring ~> ordered_comm_ring
2803 pordered_comm_semiring ~> ordered_comm_semiring
2804 pordered_ring ~> ordered_ring
2805 pordered_ring_abs ~> ordered_ring_abs
2806 pordered_semiring ~> ordered_semiring
2808 ordered_ab_group_add ~> linordered_ab_group_add
2809 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
2810 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
2811 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
2812 ordered_field ~> linordered_field
2813 ordered_field_no_lb ~> linordered_field_no_lb
2814 ordered_field_no_ub ~> linordered_field_no_ub
2815 ordered_field_dense_linear_order ~> dense_linordered_field
2816 ordered_idom ~> linordered_idom
2817 ordered_ring ~> linordered_ring
2818 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
2819 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
2820 ordered_ring_strict ~> linordered_ring_strict
2821 ordered_semidom ~> linordered_semidom
2822 ordered_semiring ~> linordered_semiring
2823 ordered_semiring_1 ~> linordered_semiring_1
2824 ordered_semiring_1_strict ~> linordered_semiring_1_strict
2825 ordered_semiring_strict ~> linordered_semiring_strict
2827 The following slightly odd type classes have been moved to a
2828 separate theory Library/Lattice_Algebras:
2830 lordered_ab_group_add ~> lattice_ab_group_add
2831 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
2832 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
2833 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
2834 lordered_ring ~> lattice_ring
2838 * Refined field classes:
2839 - classes division_ring_inverse_zero, field_inverse_zero,
2840 linordered_field_inverse_zero include rule inverse 0 = 0 --
2841 subsumes former division_by_zero class;
2842 - numerous lemmas have been ported from field to division_ring.
2845 * Refined algebra theorem collections:
2846 - dropped theorem group group_simps, use algebra_simps instead;
2847 - dropped theorem group ring_simps, use field_simps instead;
2848 - proper theorem collection field_simps subsumes former theorem
2849 groups field_eq_simps and field_simps;
2850 - dropped lemma eq_minus_self_iff which is a duplicate for
2854 * Theory Finite_Set and List: some lemmas have been generalized from
2857 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
2858 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
2859 inter_Inter_fold_inter ~> inf_Inf_fold_inf
2860 union_Union_fold_union ~> sup_Sup_fold_sup
2861 Inter_fold_inter ~> Inf_fold_inf
2862 Union_fold_union ~> Sup_fold_sup
2863 inter_INTER_fold_inter ~> inf_INFI_fold_inf
2864 union_UNION_fold_union ~> sup_SUPR_fold_sup
2865 INTER_fold_inter ~> INFI_fold_inf
2866 UNION_fold_union ~> SUPR_fold_sup
2868 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
2869 replaced by the more convenient lemmas Inf_empty and Sup_empty.
2870 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
2871 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
2872 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
2873 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
2875 * Reorganized theory Multiset: swapped notation of pointwise and
2878 - pointwise ordering is instance of class order with standard syntax
2880 - multiset ordering has syntax <=# and <#; partial order properties
2881 are provided by means of interpretation with prefix
2883 - less duplication, less historical organization of sections,
2884 conversion from associations lists to multisets, rudimentary code
2886 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
2891 multiset_eq_conv_count_eq ~> multiset_ext_iff
2892 multi_count_ext ~> multiset_ext
2893 diff_union_inverse2 ~> diff_union_cancelR
2897 * Theory Permutation: replaced local "remove" by List.remove1.
2899 * Code generation: ML and OCaml code is decorated with signatures.
2901 * Theory List: added transpose.
2903 * Library/Nat_Bijection.thy is a collection of bijective functions
2904 between nat and other types, which supersedes the older libraries
2905 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
2908 Nat_Int_Bij.nat2_to_nat ~> prod_encode
2909 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
2910 Nat_Int_Bij.int_to_nat_bij ~> int_encode
2911 Nat_Int_Bij.nat_to_int_bij ~> int_decode
2912 Countable.pair_encode ~> prod_encode
2913 NatIso.prod2nat ~> prod_encode
2914 NatIso.nat2prod ~> prod_decode
2915 NatIso.sum2nat ~> sum_encode
2916 NatIso.nat2sum ~> sum_decode
2917 NatIso.list2nat ~> list_encode
2918 NatIso.nat2list ~> list_decode
2919 NatIso.set2nat ~> set_encode
2920 NatIso.nat2set ~> set_decode
2923 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
2924 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
2925 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
2926 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
2927 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
2928 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
2929 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
2930 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
2931 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
2932 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
2933 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
2934 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
2935 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
2938 - Renamed ATP commands:
2939 atp_info ~> sledgehammer running_atps
2940 atp_kill ~> sledgehammer kill_atps
2941 atp_messages ~> sledgehammer messages
2942 atp_minimize ~> sledgehammer minimize
2943 print_atps ~> sledgehammer available_atps
2945 - Added user's manual ("isabelle doc sledgehammer").
2946 - Added option syntax and "sledgehammer_params" to customize
2947 Sledgehammer's behavior. See the manual for details.
2948 - Modified the Isar proof reconstruction code so that it produces
2949 direct proofs rather than proofs by contradiction. (This feature
2950 is still experimental.)
2951 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
2953 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
2956 - Added and implemented "binary_ints" and "bits" options.
2957 - Added "std" option and implemented support for nonstandard models.
2958 - Added and implemented "finitize" option to improve the precision
2959 of infinite datatypes based on a monotonicity analysis.
2960 - Added support for quotient types.
2961 - Added support for "specification" and "ax_specification"
2963 - Added support for local definitions (for "function" and
2964 "termination" proofs).
2965 - Added support for term postprocessors.
2966 - Optimized "Multiset.multiset" and "FinFun.finfun".
2967 - Improved efficiency of "destroy_constrs" optimization.
2968 - Fixed soundness bugs related to "destroy_constrs" optimization and
2970 - Fixed soundness bug related to higher-order constructors.
2971 - Fixed soundness bug when "full_descrs" is enabled.
2972 - Improved precision of set constructs.
2973 - Added "atoms" option.
2974 - Added cache to speed up repeated Kodkod invocations on the same
2976 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
2977 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
2978 "SAT4J_Light". INCOMPATIBILITY.
2979 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
2980 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
2981 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
2983 * Method "induct" now takes instantiations of the form t, where t is not
2984 a variable, as a shorthand for "x == t", where x is a fresh variable.
2985 If this is not intended, t has to be enclosed in parentheses.
2986 By default, the equalities generated by definitional instantiations
2987 are pre-simplified, which may cause parameters of inductive cases
2988 to disappear, or may even delete some of the inductive cases.
2989 Use "induct (no_simp)" instead of "induct" to restore the old
2990 behaviour. The (no_simp) option is also understood by the "cases"
2991 and "nominal_induct" methods, which now perform pre-simplification, too.
2997 * Variable names in lemmas generated by the domain package have
2998 changed; the naming scheme is now consistent with the HOL datatype
2999 package. Some proof scripts may be affected, INCOMPATIBILITY.
3001 * The domain package no longer defines the function "foo_copy" for
3002 recursive domain "foo". The reach lemma is now stated directly in
3003 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
3004 be reformulated in terms of "foo_take", INCOMPATIBILITY.
3006 * Most definedness lemmas generated by the domain package (previously
3007 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
3008 like "foo$x = UU <-> x = UU", which works better as a simp rule.
3009 Proofs that used definedness lemmas as intro rules may break,
3010 potential INCOMPATIBILITY.
3012 * Induction and casedist rules generated by the domain package now
3013 declare proper case_names (one called "bottom", and one named for each
3014 constructor). INCOMPATIBILITY.
3016 * For mutually-recursive domains, separate "reach" and "take_lemma"
3017 rules are generated for each domain, INCOMPATIBILITY.
3019 foo_bar.reach ~> foo.reach bar.reach
3020 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
3022 * Some lemmas generated by the domain package have been renamed for
3023 consistency with the datatype package, INCOMPATIBILITY.
3025 foo.ind ~> foo.induct
3026 foo.finite_ind ~> foo.finite_induct
3027 foo.coind ~> foo.coinduct
3028 foo.casedist ~> foo.exhaust
3029 foo.exhaust ~> foo.nchotomy
3031 * For consistency with other definition packages, the fixrec package
3032 now generates qualified theorem names, INCOMPATIBILITY.
3034 foo_simps ~> foo.simps
3035 foo_unfold ~> foo.unfold
3036 foo_induct ~> foo.induct
3038 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
3039 method and internal fixrec proofs now use the default simpset instead.
3042 * The "contlub" predicate has been removed. Proof scripts should use
3043 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
3045 * The "admw" predicate has been removed, INCOMPATIBILITY.
3047 * The constants cpair, cfst, and csnd have been removed in favor of
3048 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
3053 * Antiquotations for basic formal entities:
3055 @{class NAME} -- type class
3056 @{class_syntax NAME} -- syntax representation of the above
3058 @{type_name NAME} -- logical type
3059 @{type_abbrev NAME} -- type abbreviation
3060 @{nonterminal NAME} -- type of concrete syntactic category
3061 @{type_syntax NAME} -- syntax representation of any of the above
3063 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
3064 @{const_abbrev NAME} -- abbreviated constant
3065 @{const_syntax NAME} -- syntax representation of any of the above
3067 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
3068 syntax constant (cf. 'syntax' command).
3070 * Antiquotation @{make_string} inlines a function to print arbitrary
3071 values similar to the ML toplevel. The result is compiler dependent
3072 and may fall back on "?" in certain situations.
3074 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
3075 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
3076 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
3077 not work with the asynchronous Isar document model.
3079 * Configuration options now admit dynamic default values, depending on
3080 the context or even global references.
3082 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
3083 uses an efficient external library if available (for Poly/ML).
3085 * Renamed some important ML structures, while keeping the old names
3086 for some time as aliases within the structure Legacy:
3088 OuterKeyword ~> Keyword
3091 OuterSyntax ~> Outer_Syntax
3092 PrintMode ~> Print_Mode
3093 SpecParse ~> Parse_Spec
3096 ThyOutput ~> Thy_Output
3097 TypeInfer ~> Type_Infer
3099 Note that "open Legacy" simplifies porting of sources, but forgetting
3100 to remove it again will complicate porting again in the future.
3102 * Most operations that refer to a global context are named
3103 accordingly, e.g. Simplifier.global_context or
3104 ProofContext.init_global. There are some situations where a global
3105 context actually works, but under normal circumstances one needs to
3106 pass the proper local context through the code!
3108 * Discontinued old TheoryDataFun with its copy/init operation -- data
3109 needs to be pure. Functor Theory_Data_PP retains the traditional
3110 Pretty.pp argument to merge, which is absent in the standard
3111 Theory_Data version.
3113 * Sorts.certify_sort and derived "cert" operations for types and terms
3114 no longer minimize sorts. Thus certification at the boundary of the
3115 inference kernel becomes invariant under addition of class relations,
3116 which is an important monotonicity principle. Sorts are now minimized
3117 in the syntax layer only, at the boundary between the end-user and the
3118 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
3119 explicitly in rare situations.
3121 * Renamed old-style Drule.standard to Drule.export_without_context, to
3122 emphasize that this is in no way a standard operation.
3125 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
3126 usual for resolution. Rare INCOMPATIBILITY.
3128 * Renamed varify/unvarify operations to varify_global/unvarify_global
3129 to emphasize that these only work in a global situation (which is
3132 * Curried take and drop in library.ML; negative length is interpreted
3133 as infinity (as in chop). Subtle INCOMPATIBILITY.
3135 * Proof terms: type substitutions on proof constants now use canonical
3136 order of type variables. INCOMPATIBILITY for tools working with proof
3139 * Raw axioms/defs may no longer carry sort constraints, and raw defs
3140 may no longer carry premises. User-level specifications are
3141 transformed accordingly by Thm.add_axiom/add_def.
3146 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
3147 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
3148 proof terms are enabled unconditionally in the new HOL-Proofs image.
3150 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
3151 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
3154 * Old lib/scripts/polyml-platform is superseded by the
3155 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
3156 variant, even on a 64 bit machine. The following example setting
3157 prefers 64 bit if available:
3159 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
3161 * The preliminary Isabelle/jEdit application demonstrates the emerging
3162 Isabelle/Scala layer for advanced prover interaction and integration.
3163 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
3166 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
3167 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
3168 similar to the default assignment of the document preparation system
3169 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
3170 provides some operations for direct access to the font without asking
3171 the user for manual installation.
3175 New in Isabelle2009-1 (December 2009)
3176 -------------------------------------
3180 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
3181 one backslash should be used, even in ML sources.
3186 * Locale interpretation propagates mixins along the locale hierarchy.
3187 The currently only available mixins are the equations used to map
3188 local definitions to terms of the target domain of an interpretation.
3190 * Reactivated diagnostic command 'print_interps'. Use "print_interps
3191 loc" to print all interpretations of locale "loc" in the theory.
3192 Interpretations in proofs are not shown.
3194 * Thoroughly revised locales tutorial. New section on conditional
3197 * On instantiation of classes, remaining undefined class parameters
3198 are formally declared. INCOMPATIBILITY.
3201 *** Document preparation ***
3203 * New generalized style concept for printing terms: @{foo (style) ...}
3204 instead of @{foo_style style ...} (old form is still retained for
3205 backward compatibility). Styles can be also applied for
3206 antiquotations prop, term_type and typeof.
3211 * New proof method "smt" for a combination of first-order logic with
3212 equality, linear and nonlinear (natural/integer/real) arithmetic, and
3213 fixed-size bitvectors; there is also basic support for higher-order
3214 features (esp. lambda abstractions). It is an incomplete decision
3215 procedure based on external SMT solvers using the oracle mechanism;
3216 for the SMT solver Z3, this method is proof-producing. Certificates
3217 are provided to avoid calling the external solvers solely for
3218 re-checking proofs. Due to a remote SMT service there is no need for
3219 installing SMT solvers locally. See src/HOL/SMT.
3221 * New commands to load and prove verification conditions generated by
3222 the Boogie program verifier or derived systems (e.g. the Verifying C
3223 Compiler (VCC) or Spec#). See src/HOL/Boogie.
3225 * New counterexample generator tool 'nitpick' based on the Kodkod
3226 relational model finder. See src/HOL/Tools/Nitpick and
3227 src/HOL/Nitpick_Examples.
3229 * New commands 'code_pred' and 'values' to invoke the predicate
3230 compiler and to enumerate values of inductive predicates.
3232 * A tabled implementation of the reflexive transitive closure.
3234 * New implementation of quickcheck uses generic code generator;
3235 default generators are provided for all suitable HOL types, records
3236 and datatypes. Old quickcheck can be re-activated importing theory
3237 Library/SML_Quickcheck.
3239 * New testing tool Mirabelle for automated proof tools. Applies
3240 several tools and tactics like sledgehammer, metis, or quickcheck, to
3241 every proof step in a theory. To be used in batch mode via the
3242 "mirabelle" utility.
3244 * New proof method "sos" (sum of squares) for nonlinear real
3245 arithmetic (originally due to John Harison). It requires theory
3246 Library/Sum_Of_Squares. It is not a complete decision procedure but
3247 works well in practice on quantifier-free real arithmetic with +, -,
3248 *, ^, =, <= and <, i.e. boolean combinations of equalities and
3249 inequalities between polynomials. It makes use of external
3250 semidefinite programming solvers. Method "sos" generates a
3251 certificate that can be pasted into the proof thus avoiding the need
3252 to call an external tool every time the proof is checked. See
3253 src/HOL/Library/Sum_Of_Squares.
3255 * New method "linarith" invokes existing linear arithmetic decision
3258 * New command 'atp_minimal' reduces result produced by Sledgehammer.
3260 * New Sledgehammer option "Full Types" in Proof General settings menu.
3261 Causes full type information to be output to the ATPs. This slows
3262 ATPs down considerably but eliminates a source of unsound "proofs"
3265 * New method "metisFT": A version of metis that uses full type
3266 information in order to avoid failures of proof reconstruction.
3268 * New evaluator "approximate" approximates an real valued term using
3269 the same method as the approximation method.
3271 * Method "approximate" now supports arithmetic expressions as
3272 boundaries of intervals and implements interval splitting and Taylor
3275 * ML antiquotation @{code_datatype} inserts definition of a datatype
3276 generated by the code generator; e.g. see src/HOL/Predicate.thy.
3278 * New theory SupInf of the supremum and infimum operators for sets of
3281 * New theory Probability, which contains a development of measure
3282 theory, eventually leading to Lebesgue integration and probability.
3284 * Extended Multivariate Analysis to include derivation and Brouwer's
3287 * Reorganization of number theory, INCOMPATIBILITY:
3288 - new number theory development for nat and int, in theories Divides
3289 and GCD as well as in new session Number_Theory
3290 - some constants and facts now suffixed with _nat and _int
3292 - former session NumberTheory now named Old_Number_Theory, including
3293 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
3294 - moved theory Pocklington from src/HOL/Library to
3295 src/HOL/Old_Number_Theory
3297 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
3298 lcm of finite and infinite sets. It is shown that they form a complete
3301 * Class semiring_div requires superclass no_zero_divisors and proof of
3302 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
3303 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
3304 generalized to class semiring_div, subsuming former theorems
3305 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
3306 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
3309 * Refinements to lattice classes and sets:
3310 - less default intro/elim rules in locale variant, more default
3311 intro/elim rules in class variant: more uniformity
3312 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
3314 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
3316 - renamed ACI to inf_sup_aci
3317 - new class "boolean_algebra"
3318 - class "complete_lattice" moved to separate theory
3319 "Complete_Lattice"; corresponding constants (and abbreviations)
3320 renamed and with authentic syntax:
3321 Set.Inf ~> Complete_Lattice.Inf
3322 Set.Sup ~> Complete_Lattice.Sup
3323 Set.INFI ~> Complete_Lattice.INFI
3324 Set.SUPR ~> Complete_Lattice.SUPR
3325 Set.Inter ~> Complete_Lattice.Inter
3326 Set.Union ~> Complete_Lattice.Union
3327 Set.INTER ~> Complete_Lattice.INTER
3328 Set.UNION ~> Complete_Lattice.UNION
3329 - authentic syntax for
3332 - mere abbreviations:
3335 Set.inter (for inf, formerly Set.Int)
3336 Set.union (for sup, formerly Set.Un)
3337 Complete_Lattice.Inter (for Inf)
3338 Complete_Lattice.Union (for Sup)
3339 Complete_Lattice.INTER (for INFI)
3340 Complete_Lattice.UNION (for SUPR)
3341 - object-logic definitions as far as appropriate
3343 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
3344 Un_subset_iff are explicitly deleted as default simp rules; then also
3345 their lattice counterparts le_inf_iff and le_sup_iff have to be
3346 deleted to achieve the desired effect.
3348 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
3349 rules by default any longer; the same applies to min_max.inf_absorb1
3350 etc. INCOMPATIBILITY.
3352 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
3353 pred_set_conv by default. INCOMPATIBILITY.
3355 * Power operations on relations and functions are now one dedicated
3356 constant "compow" with infix syntax "^^". Power operation on
3357 multiplicative monoids retains syntax "^" and is now defined generic
3358 in class power. INCOMPATIBILITY.
3360 * Relation composition "R O S" now has a more standard argument order:
3361 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
3362 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
3363 break, since the O_assoc rule was not rewritten like this. Fix using
3364 O_assoc[symmetric]. The same applies to the curried version "R OO S".
3366 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
3367 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
3370 * Most rules produced by inductive and datatype package have mandatory
3371 prefixes. INCOMPATIBILITY.
3373 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
3374 the attribute of the same name. Each of the theorems in the list
3375 DERIV_intros assumes composition with an additional function and
3376 matches a variable to the derivative, which has to be solved by the
3377 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
3378 of most elementary terms. Former Maclauren.DERIV_tac and
3379 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
3382 * Code generator attributes follow the usual underscore convention:
3383 code_unfold replaces code unfold
3384 code_post replaces code post
3389 sizechange -> size_change
3390 induct_scheme -> induction_schema
3393 * Discontinued abbreviation "arbitrary" of constant "undefined".
3394 INCOMPATIBILITY, use "undefined" directly.
3397 Suc_eq_add_numeral_1 -> Suc_eq_plus1
3398 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
3399 Suc_plus1 -> Suc_eq_plus1
3400 *anti_sym -> *antisym*
3401 vector_less_eq_def -> vector_le_def
3404 * Added theorem List.map_map as [simp]. Removed List.map_compose.
3407 * Removed predicate "M hassize n" (<--> card M = n & finite M).
3413 * Theory Representable defines a class "rep" of domains that are
3414 representable (via an ep-pair) in the universal domain type "udom".
3415 Instances are provided for all type constructors defined in HOLCF.
3417 * The 'new_domain' command is a purely definitional version of the
3418 domain package, for representable domains. Syntax is identical to the
3419 old domain package. The 'new_domain' package also supports indirect
3420 recursion using previously-defined type constructors. See
3421 src/HOLCF/ex/New_Domain.thy for examples.
3423 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
3424 on the left-hand side of an equation, and then performs
3425 simplification. Rewriting is done using rules declared with the
3426 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
3427 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
3429 * The pattern-match compiler in 'fixrec' can now handle constructors
3430 with HOL function types. Pattern-match combinators for the Pair
3431 constructor are pre-configured.
3433 * The 'fixrec' package now produces better fixed-point induction rules
3434 for mutually-recursive definitions: Induction rules have conclusions
3435 of the form "P foo bar" instead of "P <foo, bar>".
3437 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
3438 been renamed to "below". The name "below" now replaces "less" in many
3439 theorem names. (Legacy theorem names using "less" are still supported
3442 * The 'fixrec' package now supports "bottom patterns". Bottom
3443 patterns can be used to generate strictness rules, or to make
3444 functions more strict (much like the bang-patterns supported by the
3445 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
3451 * Support for Poly/ML 5.3.0, with improved reporting of compiler
3452 errors and run-time exceptions, including detailed source positions.
3454 * Structure Name_Space (formerly NameSpace) now manages uniquely
3455 identified entries, with some additional information such as source
3456 position, logical grouping etc.
3458 * Theory and context data is now introduced by the simplified and
3459 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
3460 to be pure, but the old TheoryDataFun for mutable data (with explicit
3461 copy operation) is still available for some time.
3463 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
3464 provides a high-level programming interface to synchronized state
3465 variables with atomic update. This works via pure function
3466 application within a critical section -- its runtime should be as
3467 short as possible; beware of deadlocks if critical code is nested,
3468 either directly or indirectly via other synchronized variables!
3470 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
3471 wraps raw ML references, explicitly indicating their non-thread-safe
3472 behaviour. The Isar toplevel keeps this structure open, to
3473 accommodate Proof General as well as quick and dirty interactive
3474 experiments with references.
3476 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
3477 parallel tactical reasoning.
3479 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
3480 are similar to SUBPROOF, but are slightly more flexible: only the
3481 specified parts of the subgoal are imported into the context, and the
3482 body tactic may introduce new subgoals and schematic variables.
3484 * Old tactical METAHYPS, which does not observe the proof context, has
3485 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
3486 or Subgoal.FOCUS etc.
3488 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
3489 functors have their own ML name space there is no point to mark them
3490 separately.) Minor INCOMPATIBILITY.
3492 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
3494 * Renamed several structures FooBar to Foo_Bar. Occasional,
3497 * Operations of structure Skip_Proof no longer require quick_and_dirty
3498 mode, which avoids critical setmp.
3500 * Eliminated old Attrib.add_attributes, Method.add_methods and related
3501 combinators for "args". INCOMPATIBILITY, need to use simplified
3502 Attrib/Method.setup introduced in Isabelle2009.
3504 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
3505 back on global_simpset_of, global_claset_of, global_clasimpset_of as
3506 last resort. INCOMPATIBILITY.
3508 * Display.pretty_thm now requires a proper context (cf. former
3509 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
3510 or even Display.pretty_thm_without_context as last resort.
3513 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
3514 Syntax.pretty_typ/term directly, preferably with proper context
3515 instead of global theory.
3520 * Further fine tuning of parallel proof checking, scales up to 8 cores
3521 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
3524 * Support for additional "Isabelle components" via etc/components, see
3525 also the system manual.
3527 * The isabelle makeall tool now operates on all components with
3528 IsaMakefile, not just hardwired "logics".
3530 * Removed "compress" option from isabelle-process and isabelle usedir;
3531 this is always enabled.
3533 * Discontinued support for Poly/ML 4.x versions.
3535 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
3536 on a given logic image. This requires the lighttpd webserver and is
3537 currently supported on Linux only.
3541 New in Isabelle2009 (April 2009)
3542 --------------------------------
3546 * Simplified main Isabelle executables, with less surprises on
3547 case-insensitive file-systems (such as Mac OS).
3549 - The main Isabelle tool wrapper is now called "isabelle" instead of
3552 - The former "isabelle" alias for "isabelle-process" has been
3553 removed (should rarely occur to regular users).
3555 - The former "isabelle-interface" and its alias "Isabelle" have been
3556 removed (interfaces are now regular Isabelle tools).
3558 Within scripts and make files, the Isabelle environment variables
3559 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
3560 respectively. (The latter are still available as legacy feature.)
3562 The old isabelle-interface wrapper could react in confusing ways if
3563 the interface was uninstalled or changed otherwise. Individual
3564 interface tool configuration is now more explicit, see also the
3565 Isabelle system manual. In particular, Proof General is now available
3566 via "isabelle emacs".
3568 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
3569 purge installed copies of Isabelle executables and re-run "isabelle
3570 install -p ...", or use symlinks.
3572 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
3573 old ~/isabelle, which was slightly non-standard and apt to cause
3574 surprises on case-insensitive file-systems (such as Mac OS).
3576 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
3577 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
3578 care is required when using older releases of Isabelle. Note that
3579 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
3580 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
3582 * Proofs of fully specified statements are run in parallel on
3583 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
3584 a regular 4-core machine, if the initial heap space is made reasonably
3585 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
3587 * The main reference manuals ("isar-ref", "implementation", and
3588 "system") have been updated and extended. Formally checked references
3589 as hyperlinks are now available uniformly.
3594 * Complete re-implementation of locales. INCOMPATIBILITY in several
3595 respects. The most important changes are listed below. See the
3596 Tutorial on Locales ("locales" manual) for details.
3598 - In locale expressions, instantiation replaces renaming. Parameters
3599 must be declared in a for clause. To aid compatibility with previous
3600 parameter inheritance, in locale declarations, parameters that are not
3601 'touched' (instantiation position "_" or omitted) are implicitly added
3602 with their syntax at the beginning of the for clause.
3604 - Syntax from abbreviations and definitions in locales is available in
3605 locale expressions and context elements. The latter is particularly
3606 useful in locale declarations.
3608 - More flexible mechanisms to qualify names generated by locale
3609 expressions. Qualifiers (prefixes) may be specified in locale
3610 expressions, and can be marked as mandatory (syntax: "name!:") or
3611 optional (syntax "name?:"). The default depends for plain "name:"
3612 depends on the situation where a locale expression is used: in
3613 commands 'locale' and 'sublocale' prefixes are optional, in
3614 'interpretation' and 'interpret' prefixes are mandatory. The old
3615 implicit qualifiers derived from the parameter names of a locale are
3616 no longer generated.
3618 - Command "sublocale l < e" replaces "interpretation l < e". The
3619 instantiation clause in "interpretation" and "interpret" (square
3620 brackets) is no longer available. Use locale expressions.
3622 - When converting proof scripts, mandatory qualifiers in
3623 'interpretation' and 'interpret' should be retained by default, even
3624 if this is an INCOMPATIBILITY compared to former behavior. In the
3625 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
3626 in locale expressions range over a single locale instance only.
3628 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
3629 In existing theorem specifications replace the includes element by the
3630 respective context elements of the included locale, omitting those
3631 that are already present in the theorem specification. Multiple
3632 assume elements of a locale should be replaced by a single one
3633 involving the locale predicate. In the proof body, declarations (most
3634 notably theorems) may be regained by interpreting the respective
3635 locales in the proof context as required (command "interpret").
3637 If using "includes" in replacement of a target solely because the
3638 parameter types in the theorem are not as general as in the target,
3639 consider declaring a new locale with additional type constraints on
3640 the parameters (context element "constrains").
3642 - Discontinued "locale (open)". INCOMPATIBILITY.
3644 - Locale interpretation commands no longer attempt to simplify goal.
3645 INCOMPATIBILITY: in rare situations the generated goal differs. Use
3646 methods intro_locales and unfold_locales to clarify.
3648 - Locale interpretation commands no longer accept interpretation
3649 attributes. INCOMPATIBILITY.
3651 * Class declaration: so-called "base sort" must not be given in import
3652 list any longer, but is inferred from the specification. Particularly
3659 class foo = type + ...
3661 * Class target: global versions of theorems stemming do not carry a
3662 parameter prefix any longer. INCOMPATIBILITY.
3664 * Class 'instance' command no longer accepts attached definitions.
3665 INCOMPATIBILITY, use proper 'instantiation' target instead.
3667 * Recovered hiding of consts, which was accidentally broken in
3668 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
3669 makes c inaccessible; consider using ``hide (open) const c'' instead.
3671 * Slightly more coherent Pure syntax, with updated documentation in
3672 isar-ref manual. Removed locales meta_term_syntax and
3673 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
3674 INCOMPATIBILITY in rare situations. Note that &&& should not be used
3675 directly in regular applications.
3677 * There is a new syntactic category "float_const" for signed decimal
3678 fractions (e.g. 123.45 or -123.45).
3680 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
3681 interface with 'setup' command instead.
3683 * Command 'local_setup' is similar to 'setup', but operates on a local
3686 * The 'axiomatization' command now only works within a global theory
3687 context. INCOMPATIBILITY.
3689 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
3690 hypotheses. Sorts required in the course of reasoning need to be
3691 covered by the constraints in the initial statement, completed by the
3692 type instance information of the background theory. Non-trivial sort
3693 hypotheses, which rarely occur in practice, may be specified via
3694 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
3696 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
3698 The result contains an implicit sort hypotheses as before --
3699 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
3702 * Generalized Isar history, with support for linear undo, direct state
3705 * Changed defaults for unify configuration options:
3707 unify_trace_bound = 50 (formerly 25)
3708 unify_search_bound = 60 (formerly 30)
3710 * Different bookkeeping for code equations (INCOMPATIBILITY):
3712 a) On theory merge, the last set of code equations for a particular
3713 constant is taken (in accordance with the policy applied by other
3714 parts of the code generator framework).
3716 b) Code equations stemming from explicit declarations (e.g. code
3717 attribute) gain priority over default code equations stemming
3718 from definition, primrec, fun etc.
3720 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
3722 * Unified theorem tables for both code generators. Thus [code
3723 func] has disappeared and only [code] remains. INCOMPATIBILITY.
3725 * Command 'find_consts' searches for constants based on type and name
3728 find_consts "_ => bool"
3730 By default, matching is against subtypes, but it may be restricted to
3731 the whole type. Searching by name is possible. Multiple queries are
3732 conjunctive and queries may be negated by prefixing them with a
3735 find_consts strict: "_ => bool" name: "Int" -"int => int"
3737 * New 'find_theorems' criterion "solves" matches theorems that
3738 directly solve the current goal (modulo higher-order unification).
3740 * Auto solve feature for main theorem statements: whenever a new goal
3741 is stated, "find_theorems solves" is called; any theorems that could
3742 solve the lemma directly are listed as part of the goal state.
3743 Cf. associated options in Proof General Isabelle settings menu,
3744 enabled by default, with reasonable timeout for pathological cases of
3745 higher-order unification.
3748 *** Document preparation ***
3750 * Antiquotation @{lemma} now imitates a regular terminal proof,
3751 demanding keyword 'by' and supporting the full method expression
3752 syntax just like the Isar command 'by'.
3757 * Integrated main parts of former image HOL-Complex with HOL. Entry
3758 points Main and Complex_Main remain as before.
3760 * Logic image HOL-Plain provides a minimal HOL with the most important
3761 tools available (inductive, datatype, primrec, ...). This facilitates
3762 experimentation and tool development. Note that user applications
3763 (and library theories) should never refer to anything below theory
3766 * Logic image HOL-Main stops at theory Main, and thus facilitates
3767 experimentation due to shorter build times.
3769 * Logic image HOL-NSA contains theories of nonstandard analysis which
3770 were previously part of former HOL-Complex. Entry point Hyperreal
3771 remains valid, but theories formerly using Complex_Main should now use
3772 new entry point Hypercomplex.
3774 * Generic ATP manager for Sledgehammer, based on ML threads instead of
3775 Posix processes. Avoids potentially expensive forking of the ML
3776 process. New thread-based implementation also works on non-Unix
3777 platforms (Cygwin). Provers are no longer hardwired, but defined
3778 within the theory via plain ML wrapper functions. Basic Sledgehammer
3779 commands are covered in the isar-ref manual.
3781 * Wrapper scripts for remote SystemOnTPTP service allows to use
3782 sledgehammer without local ATP installation (Vampire etc.). Other
3783 provers may be included via suitable ML wrappers, see also
3784 src/HOL/ATP_Linkup.thy.
3786 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
3789 * The metis method no longer fails because the theorem is too trivial
3790 (contains the empty clause).
3792 * The metis method now fails in the usual manner, rather than raising
3793 an exception, if it determines that it cannot prove the theorem.
3795 * Method "coherent" implements a prover for coherent logic (see also
3796 src/Tools/coherent.ML).
3798 * Constants "undefined" and "default" replace "arbitrary". Usually
3799 "undefined" is the right choice to replace "arbitrary", though
3800 logically there is no difference. INCOMPATIBILITY.
3802 * Command "value" now integrates different evaluation mechanisms. The
3803 result of the first successful evaluation mechanism is printed. In
3804 square brackets a particular named evaluation mechanisms may be
3805 specified (currently, [SML], [code] or [nbe]). See further
3806 src/HOL/ex/Eval_Examples.thy.
3808 * Normalization by evaluation now allows non-leftlinear equations.
3809 Declare with attribute [code nbe].
3811 * Methods "case_tac" and "induct_tac" now refer to the very same rules
3812 as the structured Isar versions "cases" and "induct", cf. the
3813 corresponding "cases" and "induct" attributes. Mutual induction rules
3814 are now presented as a list of individual projections
3815 (e.g. foo_bar.inducts for types foo and bar); the old format with
3816 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
3817 rare situations a different rule is selected --- notably nested tuple
3818 elimination instead of former prod.exhaust: use explicit (case_tac t
3819 rule: prod.exhaust) here.
3821 * Attributes "cases", "induct", "coinduct" support "del" option.
3823 * Removed fact "case_split_thm", which duplicates "case_split".
3825 * The option datatype has been moved to a new theory Option. Renamed
3826 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
3828 * New predicate "strict_mono" classifies strict functions on partial
3829 orders. With strict functions on linear orders, reasoning about
3830 (in)equalities is facilitated by theorems "strict_mono_eq",
3831 "strict_mono_less_eq" and "strict_mono_less".
3833 * Some set operations are now proper qualified constants with
3834 authentic syntax. INCOMPATIBILITY:
3845 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
3848 * Auxiliary class "itself" has disappeared -- classes without any
3849 parameter are treated as expected by the 'class' command.
3851 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
3853 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
3854 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
3856 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
3857 method "approximation". It proves formulas on real values by using
3858 interval arithmetic. In the formulas are also the transcendental
3859 functions sin, cos, tan, atan, ln, exp and the constant pi are
3860 allowed. For examples see
3861 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
3863 * Theory "Reflection" now resides in HOL/Library.
3865 * Entry point to Word library now simply named "Word".
3868 * Made source layout more coherent with logical distribution
3871 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
3872 src/HOL/Library/Code_Message.thy ~> src/HOL/
3873 src/HOL/Library/GCD.thy ~> src/HOL/
3874 src/HOL/Library/Order_Relation.thy ~> src/HOL/
3875 src/HOL/Library/Parity.thy ~> src/HOL/
3876 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
3877 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
3878 src/HOL/Real/Lubs.thy ~> src/HOL/
3879 src/HOL/Real/PReal.thy ~> src/HOL/
3880 src/HOL/Real/Rational.thy ~> src/HOL/
3881 src/HOL/Real/RComplete.thy ~> src/HOL/
3882 src/HOL/Real/RealDef.thy ~> src/HOL/
3883 src/HOL/Real/RealPow.thy ~> src/HOL/
3884 src/HOL/Real/Real.thy ~> src/HOL/
3885 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
3886 src/HOL/Complex/Complex.thy ~> src/HOL/
3887 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
3888 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
3889 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
3890 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
3891 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
3892 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
3893 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
3894 src/HOL/Hyperreal/Log.thy ~> src/HOL/
3895 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
3896 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
3897 src/HOL/Hyperreal/Series.thy ~> src/HOL/
3898 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
3899 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
3900 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
3901 src/HOL/Real/Float ~> src/HOL/Library/
3902 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
3903 src/HOL/Real/RealVector.thy ~> src/HOL/
3905 src/HOL/arith_data.ML ~> src/HOL/Tools
3906 src/HOL/hologic.ML ~> src/HOL/Tools
3907 src/HOL/simpdata.ML ~> src/HOL/Tools
3908 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
3909 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
3910 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
3911 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
3912 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
3913 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
3914 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
3916 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
3917 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
3918 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
3919 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
3920 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
3921 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
3923 * If methods "eval" and "evaluation" encounter a structured proof
3924 state with !!/==>, only the conclusion is evaluated to True (if
3925 possible), avoiding strange error messages.
3927 * Method "sizechange" automates termination proofs using (a
3928 modification of) the size-change principle. Requires SAT solver. See
3929 src/HOL/ex/Termination.thy for examples.
3931 * Simplifier: simproc for let expressions now unfolds if bound
3932 variable occurs at most once in let expression body. INCOMPATIBILITY.
3934 * Method "arith": Linear arithmetic now ignores all inequalities when
3935 fast_arith_neq_limit is exceeded, instead of giving up entirely.
3937 * New attribute "arith" for facts that should always be used
3938 automatically by arithmetic. It is intended to be used locally in
3941 assumes [arith]: "x > 0"
3943 Global usage is discouraged because of possible performance impact.
3945 * New classes "top" and "bot" with corresponding operations "top" and
3946 "bot" in theory Orderings; instantiation of class "complete_lattice"
3947 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
3949 * Changed definition lemma "less_fun_def" in order to provide an
3950 instance for preorders on functions; use lemma "less_le" instead.
3953 * Theory Orderings: class "wellorder" moved here, with explicit
3954 induction rule "less_induct" as assumption. For instantiation of
3955 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
3958 * Theory Orderings: added class "preorder" as superclass of "order".
3959 INCOMPATIBILITY: Instantiation proofs for order, linorder
3960 etc. slightly changed. Some theorems named order_class.* now named
3963 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
3966 * Theory Finite_Set: added a new fold combinator of type
3968 ('a => 'b => 'b) => 'b => 'a set => 'b
3970 Occasionally this is more convenient than the old fold combinator
3971 which is now defined in terms of the new one and renamed to
3974 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
3975 and "ring_simps" have been replaced by "algebra_simps" (which can be
3976 extended with further lemmas!). At the moment both still exist but
3977 the former will disappear at some point.
3979 * Theory Power: Lemma power_Suc is now declared as a simp rule in
3980 class recpower. Type-specific simp rules for various recpower types
3981 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
3983 rat_power_0 -> power_0
3984 rat_power_Suc -> power_Suc
3985 realpow_0 -> power_0
3986 realpow_Suc -> power_Suc
3987 complexpow_0 -> power_0
3988 complexpow_Suc -> power_Suc
3989 power_poly_0 -> power_0
3990 power_poly_Suc -> power_Suc
3992 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
3993 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
3994 dvd has been generalized to class comm_semiring_1. Likewise a bunch
3995 of lemmas from Divides has been generalized from nat to class
3996 semiring_div. INCOMPATIBILITY. This involves the following theorem
3997 renames resulting from duplicate elimination:
3999 dvd_def_mod ~> dvd_eq_mod_eq_0
4000 zero_dvd_iff ~> dvd_0_left_iff
4001 dvd_0 ~> dvd_0_right
4002 DIVISION_BY_ZERO_DIV ~> div_by_0
4003 DIVISION_BY_ZERO_MOD ~> mod_by_0
4004 mult_div ~> div_mult_self2_is_id
4005 mult_mod ~> mod_mult_self2_is_0
4007 * Theory IntDiv: removed many lemmas that are instances of class-based
4008 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
4009 rename old lemmas as follows:
4011 dvd_diff -> nat_dvd_diff
4012 dvd_zminus_iff -> dvd_minus_iff
4013 mod_add1_eq -> mod_add_eq
4014 mod_mult1_eq -> mod_mult_right_eq
4015 mod_mult1_eq' -> mod_mult_left_eq
4016 mod_mult_distrib_mod -> mod_mult_eq
4017 nat_mod_add_left_eq -> mod_add_left_eq
4018 nat_mod_add_right_eq -> mod_add_right_eq
4019 nat_mod_div_trivial -> mod_div_trivial
4020 nat_mod_mod_trivial -> mod_mod_trivial
4021 zdiv_zadd_self1 -> div_add_self1
4022 zdiv_zadd_self2 -> div_add_self2
4023 zdiv_zmult_self1 -> div_mult_self2_is_id
4024 zdiv_zmult_self2 -> div_mult_self1_is_id
4025 zdvd_triv_left -> dvd_triv_left
4026 zdvd_triv_right -> dvd_triv_right
4027 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
4028 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
4029 zmod_zadd_left_eq -> mod_add_left_eq
4030 zmod_zadd_right_eq -> mod_add_right_eq
4031 zmod_zadd_self1 -> mod_add_self1
4032 zmod_zadd_self2 -> mod_add_self2
4033 zmod_zadd1_eq -> mod_add_eq
4034 zmod_zdiff1_eq -> mod_diff_eq
4035 zmod_zdvd_zmod -> mod_mod_cancel
4036 zmod_zmod_cancel -> mod_mod_cancel
4037 zmod_zmult_self1 -> mod_mult_self2_is_0
4038 zmod_zmult_self2 -> mod_mult_self1_is_0
4041 zdvd_abs1 -> abs_dvd_iff
4042 zdvd_abs2 -> dvd_abs_iff
4043 zdvd_refl -> dvd_refl
4044 zdvd_trans -> dvd_trans
4045 zdvd_zadd -> dvd_add
4046 zdvd_zdiff -> dvd_diff
4047 zdvd_zminus_iff -> dvd_minus_iff
4048 zdvd_zminus2_iff -> minus_dvd_iff
4049 zdvd_zmultD -> dvd_mult_right
4050 zdvd_zmultD2 -> dvd_mult_left
4051 zdvd_zmult_mono -> mult_dvd_mono
4052 zdvd_0_right -> dvd_0_right
4053 zdvd_0_left -> dvd_0_left_iff
4054 zdvd_1_left -> one_dvd
4055 zminus_dvd_iff -> minus_dvd_iff
4057 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
4059 * The real numbers offer decimal input syntax: 12.34 is translated
4060 into 1234/10^2. This translation is not reversed upon output.
4062 * Theory Library/Polynomial defines an abstract type 'a poly of
4063 univariate polynomials with coefficients of type 'a. In addition to
4064 the standard ring operations, it also supports div and mod. Code
4065 generation is also supported, using list-style constructors.
4067 * Theory Library/Inner_Product defines a class of real_inner for real
4068 inner product spaces, with an overloaded operation inner :: 'a => 'a
4069 => real. Class real_inner is a subclass of real_normed_vector from
4072 * Theory Library/Product_Vector provides instances for the product
4073 type 'a * 'b of several classes from RealVector and Inner_Product.
4074 Definitions of addition, subtraction, scalar multiplication, norms,
4075 and inner products are included.
4077 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
4078 addition to the field operations, numerals and case syntax are also
4081 * Theory Library/Diagonalize provides constructive version of Cantor's
4082 first diagonalization argument.
4084 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
4085 zlcm (for int); carried together from various gcd/lcm developements in
4086 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
4087 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
4088 may recover tupled syntax as follows:
4090 hide (open) const gcd
4091 abbreviation gcd where
4092 "gcd == (%(a, b). GCD.gcd a b)"
4094 GCD.gcd ("gcd '(_, _')")
4096 The same works for lcm, zgcd, zlcm.
4098 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
4099 instantiations for algebraic structures. Removed some duplicate
4100 theorems. Changes in simp rules. INCOMPATIBILITY.
4102 * ML antiquotation @{code} takes a constant as argument and generates
4103 corresponding code in background and inserts name of the corresponding
4104 resulting ML value/function/datatype constructor binding in place.
4105 All occurrences of @{code} with a single ML block are generated
4106 simultaneously. Provides a generic and safe interface for
4107 instrumentalizing code generation. See
4108 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
4109 In future you ought to refrain from ad-hoc compiling generated SML
4110 code on the ML toplevel. Note that (for technical reasons) @{code}
4111 cannot refer to constants for which user-defined serializations are
4112 set. Refer to the corresponding ML counterpart directly in that
4115 * Command 'rep_datatype': instead of theorem names the command now
4116 takes a list of terms denoting the constructors of the type to be
4117 represented as datatype. The characteristic theorems have to be
4118 proven. INCOMPATIBILITY. Also observe that the following theorems
4119 have disappeared in favour of existing ones:
4121 unit_induct ~> unit.induct
4122 prod_induct ~> prod.induct
4123 sum_induct ~> sum.induct
4124 Suc_Suc_eq ~> nat.inject
4125 Suc_not_Zero Zero_not_Suc ~> nat.distinct
4130 * New locales for orders and lattices where the equivalence relation
4131 is not restricted to equality. INCOMPATIBILITY: all order and lattice
4132 locales use a record structure with field eq for the equivalence.
4134 * New theory of factorial domains.
4136 * Units_l_inv and Units_r_inv are now simp rules by default.
4137 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
4138 and/or r_inv will now also require deletion of these lemmas.
4140 * Renamed the following theorems, INCOMPATIBILITY:
4142 UpperD ~> Upper_memD
4143 LowerD ~> Lower_memD
4144 least_carrier ~> least_closed
4145 greatest_carrier ~> greatest_closed
4146 greatest_Lower_above ~> greatest_Lower_below
4147 one_zero ~> carrier_one_zero
4148 one_not_zero ~> carrier_one_not_zero (collision with assumption)
4153 * Nominal datatypes can now contain type-variables.
4155 * Commands 'nominal_inductive' and 'equivariance' work with local
4158 * Nominal primrec can now works with local theory targets and its
4159 specification syntax now conforms to the general format as seen in
4162 * Method "perm_simp" honours the standard simplifier attributes
4163 (no_asm), (no_asm_use) etc.
4165 * The new predicate #* is defined like freshness, except that on the
4166 left hand side can be a set or list of atoms.
4168 * Experimental command 'nominal_inductive2' derives strong induction
4169 principles for inductive definitions. In contrast to
4170 'nominal_inductive', which can only deal with a fixed number of
4171 binders, it can deal with arbitrary expressions standing for sets of
4172 atoms to be avoided. The only inductive definition we have at the
4173 moment that needs this generalisation is the typing rule for Lets in
4176 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
4177 -----------------------------------------------------------------
4178 Gamma |- Let x be t1 in t2 : T2
4180 In this rule one wants to avoid all the binders that are introduced by
4181 "close Gamma T1". We are looking for other examples where this
4182 feature might be useful. Please let us know.
4187 * Reimplemented the simplification procedure for proving continuity
4188 subgoals. The new simproc is extensible; users can declare additional
4189 continuity introduction rules with the attribute [cont2cont].
4191 * The continuity simproc now uses a different introduction rule for
4192 solving continuity subgoals on terms with lambda abstractions. In
4193 some rare cases the new simproc may fail to solve subgoals that the
4194 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
4195 Potential INCOMPATIBILITY.
4197 * Command 'fixrec': specification syntax now conforms to the general
4198 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
4199 examples. INCOMPATIBILITY.
4204 * Proof of Zorn's Lemma for partial orders.
4209 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
4210 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
4211 depends on multithreading, so timouts will not work before Poly/ML
4214 * High-level support for concurrent ML programming, see
4215 src/Pure/Cuncurrent. The data-oriented model of "future values" is
4216 particularly convenient to organize independent functional
4217 computations. The concept of "synchronized variables" provides a
4218 higher-order interface for components with shared state, avoiding the
4219 delicate details of mutexes and condition variables. (Requires
4220 Poly/ML 5.2.1 or later.)
4222 * ML bindings produced via Isar commands are stored within the Isar
4223 context (theory or proof). Consequently, commands like 'use' and 'ML'
4224 become thread-safe and work with undo as expected (concerning
4225 top-level bindings, not side-effects on global references).
4226 INCOMPATIBILITY, need to provide proper Isar context when invoking the
4227 compiler at runtime; really global bindings need to be given outside a
4228 theory. (Requires Poly/ML 5.2 or later.)
4230 * Command 'ML_prf' is analogous to 'ML' but works within a proof
4231 context. Top-level ML bindings are stored within the proof context in
4232 a purely sequential fashion, disregarding the nested proof structure.
4233 ML bindings introduced by 'ML_prf' are discarded at the end of the
4234 proof. (Requires Poly/ML 5.2 or later.)
4236 * Simplified ML attribute and method setup, cf. functions Attrib.setup
4237 and Method.setup, as well as Isar commands 'attribute_setup' and
4238 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
4239 existing code accordingly, or use plain 'setup' together with old
4242 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
4243 to 'a -> thm, while results are always tagged with an authentic oracle
4244 name. The Isar command 'oracle' is now polymorphic, no argument type
4245 is specified. INCOMPATIBILITY, need to simplify existing oracle code
4246 accordingly. Note that extra performance may be gained by producing
4247 the cterm carefully, avoiding slow Thm.cterm_of.
4249 * Simplified interface for defining document antiquotations via
4250 ThyOutput.antiquotation, ThyOutput.output, and optionally
4251 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
4252 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
4255 * More systematic treatment of long names, abstract name bindings, and
4256 name space operations. Basic operations on qualified names have been
4257 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
4258 Long_Name.append. Old type bstring has been mostly replaced by
4259 abstract type binding (see structure Binding), which supports precise
4260 qualification by packages and local theory targets, as well as proper
4261 tracking of source positions. INCOMPATIBILITY, need to wrap old
4262 bstring values into Binding.name, or better pass through abstract
4263 bindings everywhere. See further src/Pure/General/long_name.ML,
4264 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
4266 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
4267 LocalTheory.note etc.) now refer to the *full* internal name, not the
4268 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
4270 * Disposed old type and term read functions (Sign.read_def_typ,
4271 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
4272 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
4273 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
4274 Syntax.read_term_global etc.; see also OldGoals.read_term as last
4275 resort for legacy applications.
4277 * Disposed old declarations, tactics, tactic combinators that refer to
4278 the simpset or claset of an implicit theory (such as Addsimps,
4279 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
4280 embedded ML text, or local_simpset_of with a proper context passed as
4281 explicit runtime argument.
4283 * Rules and tactics that read instantiations (read_instantiate,
4284 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
4285 context, which is required for parsing and type-checking. Moreover,
4286 the variables are specified as plain indexnames, not string encodings
4287 thereof. INCOMPATIBILITY.
4289 * Generic Toplevel.add_hook interface allows to analyze the result of
4290 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
4291 for theorem dependency output of transactions resulting in a new
4294 * ML antiquotations: block-structured compilation context indicated by
4295 \<lbrace> ... \<rbrace>; additional antiquotation forms:
4297 @{binding name} - basic name binding
4298 @{let ?pat = term} - term abbreviation (HO matching)
4299 @{note name = fact} - fact abbreviation
4300 @{thm fact} - singleton fact (with attributes)
4301 @{thms fact} - general fact (with attributes)
4302 @{lemma prop by method} - singleton goal
4303 @{lemma prop by meth1 meth2} - singleton goal
4304 @{lemma prop1 ... propN by method} - general goal
4305 @{lemma prop1 ... propN by meth1 meth2} - general goal
4306 @{lemma (open) ...} - open derivation
4311 * The Isabelle "emacs" tool provides a specific interface to invoke
4312 Proof General / Emacs, with more explicit failure if that is not
4313 installed (the old isabelle-interface script silently falls back on
4314 isabelle-process). The PROOFGENERAL_HOME setting determines the
4315 installation location of the Proof General distribution.
4317 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
4318 the Isabelle process into a JVM/Scala application. See
4319 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
4320 process wrapper has been discontinued.)
4322 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
4324 * Various status messages (with exact source position information) are
4325 emitted, if proper markup print mode is enabled. This allows
4326 user-interface components to provide detailed feedback on internal
4331 New in Isabelle2008 (June 2008)
4332 -------------------------------
4336 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
4337 and updated, with formally checked references as hyperlinks.
4339 * Theory loader: use_thy (and similar operations) no longer set the
4340 implicit ML context, which was occasionally hard to predict and in
4341 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
4342 provides a proper context already.
4344 * Theory loader: old-style ML proof scripts being *attached* to a thy
4345 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
4346 'use' within a theory file will do the job.
4348 * Name space merge now observes canonical order, i.e. the second space
4349 is inserted into the first one, while existing entries in the first
4350 space take precedence. INCOMPATIBILITY in rare situations, may try to
4351 swap theory imports.
4353 * Syntax: symbol \<chi> is now considered a letter. Potential
4354 INCOMPATIBILITY in identifier syntax etc.
4356 * Outer syntax: string tokens no longer admit escaped white space,
4357 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
4358 white space without escapes.
4360 * Outer syntax: string tokens may contain arbitrary character codes
4361 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
4367 * Context-dependent token translations. Default setup reverts locally
4368 fixed variables, and adds hilite markup for undeclared frees.
4370 * Unused theorems can be found using the new command 'unused_thms'.
4371 There are three ways of invoking it:
4374 Only finds unused theorems in the current theory.
4376 (2) unused_thms thy_1 ... thy_n -
4377 Finds unused theorems in the current theory and all of its ancestors,
4378 excluding the theories thy_1 ... thy_n and all of their ancestors.
4380 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
4381 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
4382 their ancestors, excluding the theories thy_1 ... thy_n and all of
4385 In order to increase the readability of the list produced by
4386 unused_thms, theorems that have been created by a particular instance
4387 of a theory command such as 'inductive' or 'function' are considered
4388 to belong to the same "group", meaning that if at least one theorem in
4389 this group is used, the other theorems in the same group are no longer
4390 reported as unused. Moreover, if all theorems in the group are
4391 unused, only one theorem in the group is displayed.
4393 Note that proof objects have to be switched on in order for
4394 unused_thms to work properly (i.e. !proofs must be >= 1, which is
4395 usually the case when using Proof General with the default settings).
4397 * Authentic naming of facts disallows ad-hoc overwriting of previous
4398 theorems within the same name space. INCOMPATIBILITY, need to remove
4399 duplicate fact bindings, or even accidental fact duplications. Note
4400 that tools may maintain dynamically scoped facts systematically, using
4401 PureThy.add_thms_dynamic.
4403 * Command 'hide' now allows to hide from "fact" name space as well.
4405 * Eliminated destructive theorem database, simpset, claset, and
4406 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
4407 update of theories within ML code.
4409 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
4410 INCOMPATIBILITY, object-logics depending on former Pure require
4411 additional setup PureThy.old_appl_syntax_setup; object-logics
4412 depending on former CPure need to refer to Pure.
4414 * Commands 'use' and 'ML' are now purely functional, operating on
4415 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
4416 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
4419 * Command 'setup': discontinued implicit version with ML reference.
4421 * Instantiation target allows for simultaneous specification of class
4422 instance operations together with an instantiation proof.
4423 Type-checking phase allows to refer to class operations uniformly.
4424 See src/HOL/Complex/Complex.thy for an Isar example and
4425 src/HOL/Library/Eval.thy for an ML example.
4427 * Indexing of literal facts: be more serious about including only
4428 facts from the visible specification/proof context, but not the
4429 background context (locale etc.). Affects `prop` notation and method
4430 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
4433 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
4434 "(open)" option, which used to expose internal bound variables to the
4437 * Isar statements: removed obsolete case "rule_context".
4438 INCOMPATIBILITY, better use explicit fixes/assumes.
4440 * Locale proofs: default proof step now includes 'unfold_locales';
4441 hence 'proof' without argument may be used to unfold locale
4445 *** Document preparation ***
4447 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
4448 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
4449 obsolete thumbpdf setup (contemporary PDF viewers do this on the
4450 spot); renamed link color from "darkblue" to "linkcolor" (default
4451 value unchanged, can be redefined via \definecolor); no longer sets
4452 "a4paper" option (unnecessary or even intrusive).
4454 * Antiquotation @{lemma A method} proves proposition A by the given
4455 method (either a method name or a method name plus (optional) method
4456 arguments in parentheses) and prints A just like @{prop A}.
4461 * New primrec package. Specification syntax conforms in style to
4462 definition/function/.... No separate induction rule is provided. The
4463 "primrec" command distinguishes old-style and new-style specifications
4464 by syntax. The former primrec package is now named OldPrimrecPackage.
4465 When adjusting theories, beware: constants stemming from new-style
4466 primrec specifications have authentic syntax.
4468 * Metis prover is now an order of magnitude faster, and also works
4469 with multithreading.
4471 * Metis: the maximum number of clauses that can be produced from a
4472 theorem is now given by the attribute max_clauses. Theorems that
4473 exceed this number are ignored, with a warning printed.
4475 * Sledgehammer no longer produces structured proofs by default. To
4476 enable, declare [[sledgehammer_full = true]]. Attributes
4477 reconstruction_modulus, reconstruction_sorts renamed
4478 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
4480 * Method "induct_scheme" derives user-specified induction rules
4481 from well-founded induction and completeness of patterns. This factors
4482 out some operations that are done internally by the function package
4483 and makes them available separately. See
4484 src/HOL/ex/Induction_Scheme.thy for examples.
4486 * More flexible generation of measure functions for termination
4487 proofs: Measure functions can be declared by proving a rule of the
4488 form "is_measure f" and giving it the [measure_function] attribute.
4489 The "is_measure" predicate is logically meaningless (always true), and
4490 just guides the heuristic. To find suitable measure functions, the
4491 termination prover sets up the goal "is_measure ?f" of the appropriate
4492 type and generates all solutions by prolog-style backwards proof using
4495 This setup also deals with rules like
4497 "is_measure f ==> is_measure (list_size f)"
4499 which accommodates nested datatypes that recurse through lists.
4500 Similar rules are predeclared for products and option types.
4502 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
4506 - Definitions of overloaded constants on sets have to be replaced by
4507 definitions on => and bool.
4509 - Some definitions of overloaded operators on sets can now be proved
4510 using the definitions of the operators on => and bool. Therefore,
4511 the following theorems have been renamed:
4513 subset_def -> subset_eq
4514 psubset_def -> psubset_eq
4515 set_diff_def -> set_diff_eq
4516 Compl_def -> Compl_eq
4517 Sup_set_def -> Sup_set_eq
4518 Inf_set_def -> Inf_set_eq
4519 sup_set_def -> sup_set_eq
4520 inf_set_def -> inf_set_eq
4522 - Due to the incompleteness of the HO unification algorithm, some
4523 rules such as subst may require manual instantiation, if some of
4524 the unknowns in the rule is a set.
4526 - Higher order unification and forward proofs:
4529 have "P (S::'a set)" <...>
4530 then have "EX S. P S" ..
4532 no longer works (due to the incompleteness of the HO unification
4533 algorithm) and must be replaced by the pattern
4540 - Calculational reasoning with subst (or similar rules):
4543 have "P (S::'a set)" <...>
4544 also have "S = T" <...>
4545 finally have "P T" .
4547 no longer works (for similar reasons as the previous example) and
4548 must be replaced by something like
4550 have "P (S::'a set)" <...>
4551 moreover have "S = T" <...>
4552 ultimately have "P T" by simp
4554 - Tactics or packages written in ML code:
4555 Code performing pattern matching on types via
4557 Type ("set", [T]) => ...
4559 must be rewritten. Moreover, functions like strip_type or
4560 binder_types no longer return the right value when applied to a
4563 T1 => ... => Tn => U => bool
4567 T1 => ... => Tn => U set
4569 * Merged theories Wellfounded_Recursion, Accessible_Part and
4570 Wellfounded_Relations to theory Wellfounded.
4572 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
4574 * Class finite no longer treats UNIV as class parameter. Use class
4575 enum from theory Library/Enum instead to achieve a similar effect.
4578 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
4579 and "Cons". INCOMPATIBILITY.
4581 * HOL (and FOL): renamed variables in rules imp_elim and swap.
4582 Potential INCOMPATIBILITY.
4584 * Theory Product_Type: duplicated lemmas split_Pair_apply and
4585 injective_fst_snd removed, use split_eta and prod_eqI instead.
4586 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
4588 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
4589 the same name in theory Orderings:
4599 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
4600 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
4601 and different variable names.
4603 * Library/Option_ord.thy: Canonical order on option type.
4605 * Library/RBT.thy: Red-black trees, an efficient implementation of
4608 * Library/Countable.thy: Type class for countable types.
4610 * Theory Int: The representation of numerals has changed. The infix
4611 operator BIT and the bit datatype with constructors B0 and B1 have
4612 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
4613 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
4614 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
4617 * Theory Nat: definition of <= and < on natural numbers no longer
4618 depend on well-founded relations. INCOMPATIBILITY. Definitions
4619 le_def and less_def have disappeared. Consider lemmas not_less
4620 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
4622 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
4623 (whose purpose mainly is for various fold_set functionals) have been
4624 abandoned in favor of the existing algebraic classes
4625 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
4626 lower_semilattice (resp. upper_semilattice) and linorder.
4629 * Theory Transitive_Closure: induct and cases rules now declare proper
4630 case_names ("base" and "step"). INCOMPATIBILITY.
4632 * Theorem Inductive.lfp_ordinal_induct generalized to complete
4633 lattices. The form set-specific version is available as
4634 Inductive.lfp_ordinal_induct_set.
4636 * Renamed theorems "power.simps" to "power_int.simps".
4639 * Class semiring_div provides basic abstract properties of semirings
4640 with division and modulo operations. Subsumes former class dvd_mod.
4642 * Merged theories IntDef, Numeral and IntArith into unified theory
4643 Int. INCOMPATIBILITY.
4645 * Theory Library/Code_Index: type "index" now represents natural
4646 numbers rather than integers. INCOMPATIBILITY.
4648 * New class "uminus" with operation "uminus" (split of from class
4649 "minus" which now only has operation "minus", binary).
4652 * Constants "card", "internal_split", "option_map" now with authentic
4653 syntax. INCOMPATIBILITY.
4655 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
4656 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
4657 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
4658 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
4659 Sup_set_def, le_def, less_def, option_map_def now with object
4660 equality. INCOMPATIBILITY.
4662 * Records. Removed K_record, and replaced it by pure lambda term
4663 %x. c. The simplifier setup is now more robust against eta expansion.
4664 INCOMPATIBILITY: in cases explicitly referring to K_record.
4666 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
4668 * Library/ListVector: new theory of arithmetic vector operations.
4670 * Library/Order_Relation: new theory of various orderings as sets of
4671 pairs. Defines preorders, partial orders, linear orders and
4672 well-orders on sets and on types.
4677 * Renamed some theories to allow to loading both ZF and HOL in the
4680 Datatype -> Datatype_ZF
4681 Inductive -> Inductive_ZF
4688 INCOMPATIBILITY: ZF theories that import individual theories below
4689 Main might need to be adapted. Regular theory Main is still
4690 available, as trivial extension of Main_ZF.
4695 * ML within Isar: antiquotation @{const name} or @{const
4696 name(typargs)} produces statically-checked Const term.
4698 * Functor NamedThmsFun: data is available to the user as dynamic fact
4699 (of the same name). Removed obsolete print command.
4701 * Removed obsolete "use_legacy_bindings" function.
4703 * The ``print mode'' is now a thread-local value derived from a global
4704 template (the former print_mode reference), thus access becomes
4705 non-critical. The global print_mode reference is for session
4706 management only; user-code should use print_mode_value,
4707 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
4709 * Functions system/system_out provide a robust way to invoke external
4710 shell commands, with propagation of interrupts (requires Poly/ML
4711 5.2.1). Do not use OS.Process.system etc. from the basis library!
4716 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
4717 in accordance with Proof General 3.7, which prefers GNU emacs.
4719 * isatool tty runs Isabelle process with plain tty interaction;
4720 optional line editor may be specified via ISABELLE_LINE_EDITOR
4721 setting, the default settings attempt to locate "ledit" and "rlwrap".
4723 * isatool browser now works with Cygwin as well, using general
4724 "javapath" function defined in Isabelle process environment.
4726 * YXML notation provides a simple and efficient alternative to
4727 standard XML transfer syntax. See src/Pure/General/yxml.ML and
4728 isatool yxml as described in the Isabelle system manual.
4730 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
4731 provides general wrapper for managing an Isabelle process in a robust
4732 fashion, with ``cooked'' output from stdin/stderr.
4734 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
4735 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
4737 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
4738 way of changing the user's settings is via
4739 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
4742 * Multithreading.max_threads := 0 refers to the number of actual CPU
4743 cores of the underlying machine, which is a good starting point for
4744 optimal performance tuning. The corresponding usedir option -M allows
4745 "max" as an alias for "0". WARNING: does not work on certain versions
4746 of Mac OS (with Poly/ML 5.1).
4748 * isabelle-process: non-ML sessions are run with "nice", to reduce the
4749 adverse effect of Isabelle flooding interactive front-ends (notably
4750 ProofGeneral / XEmacs).
4754 New in Isabelle2007 (November 2007)
4755 -----------------------------------
4759 * More uniform information about legacy features, notably a
4760 warning/error of "Legacy feature: ...", depending on the state of the
4761 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
4762 legacy features will disappear eventually.
4764 * Theory syntax: the header format ``theory A = B + C:'' has been
4765 discontinued in favour of ``theory A imports B C begin''. Use isatool
4766 fixheaders to convert existing theory files. INCOMPATIBILITY.
4768 * Theory syntax: the old non-Isar theory file format has been
4769 discontinued altogether. Note that ML proof scripts may still be used
4770 with Isar theories; migration is usually quite simple with the ML
4771 function use_legacy_bindings. INCOMPATIBILITY.
4773 * Theory syntax: some popular names (e.g. 'class', 'declaration',
4774 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
4777 * Theory loader: be more serious about observing the static theory
4778 header specifications (including optional directories), but not the
4779 accidental file locations of previously successful loads. The strict
4780 update policy of former update_thy is now already performed by
4781 use_thy, so the former has been removed; use_thys updates several
4782 theories simultaneously, just as 'imports' within a theory header
4783 specification, but without merging the results. Potential
4784 INCOMPATIBILITY: may need to refine theory headers and commands
4785 ROOT.ML which depend on load order.
4787 * Theory loader: optional support for content-based file
4788 identification, instead of the traditional scheme of full physical
4789 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
4790 (cf. the system manual). The new scheme allows to work with
4791 non-finished theories in persistent session images, such that source
4792 files may be moved later on without requiring reloads.
4794 * Theory loader: old-style ML proof scripts being *attached* to a thy
4795 file (with the same base name as the theory) are considered a legacy
4796 feature, which will disappear eventually. Even now, the theory loader
4797 no longer maintains dependencies on such files.
4799 * Syntax: the scope for resolving ambiguities via type-inference is
4800 now limited to individual terms, instead of whole simultaneous
4801 specifications as before. This greatly reduces the complexity of the
4802 syntax module and improves flexibility by separating parsing and
4803 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
4804 'fixes' etc.) are required in rare situations.
4806 * Syntax: constants introduced by new-style packages ('definition',
4807 'abbreviation' etc.) are passed through the syntax module in
4808 ``authentic mode''. This means that associated mixfix annotations
4809 really stick to such constants, independently of potential name space
4810 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
4811 trees are represented slightly differently, may need to adapt syntax
4812 translations accordingly. Use CONST marker in 'translations' and
4813 @{const_syntax} antiquotation in 'parse_translation' etc.
4815 * Legacy goal package: reduced interface to the bare minimum required
4816 to keep existing proof scripts running. Most other user-level
4817 functions are now part of the OldGoals structure, which is *not* open
4818 by default (consider isatool expandshort before open OldGoals).
4819 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
4820 these tend to cause confusion about the actual goal (!) context being
4821 used here, which is not necessarily the same as the_context().
4823 * Command 'find_theorems': supports "*" wild-card in "name:"
4824 criterion; "with_dups" option. Certain ProofGeneral versions might
4825 support a specific search form (see ProofGeneral/CHANGES).
4827 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
4828 by default, which means that "prems" (and also "fixed variables") are
4829 suppressed from proof state output. Note that the ProofGeneral
4830 settings mechanism allows to change and save options persistently, but
4831 older versions of Isabelle will fail to start up if a negative prems
4834 * Local theory targets may be specified by non-nested blocks of
4835 ``context/locale/class ... begin'' followed by ``end''. The body may
4836 contain definitions, theorems etc., including any derived mechanism
4837 that has been implemented on top of these primitives. This concept
4838 generalizes the existing ``theorem (in ...)'' towards more versatility
4841 * Proof General interface: proper undo of final 'end' command;
4842 discontinued Isabelle/classic mode (ML proof scripts).
4845 *** Document preparation ***
4847 * Added antiquotation @{theory name} which prints the given name,
4848 after checking that it refers to a valid ancestor theory in the
4851 * Added antiquotations @{ML_type text} and @{ML_struct text} which
4852 check the given source text as ML type/structure, printing verbatim.
4854 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
4855 "c args == rhs" given in the current context. (Any number of
4856 arguments may be given on the LHS.)
4861 * The 'class' package offers a combination of axclass and locale to
4862 achieve Haskell-like type classes in Isabelle. Definitions and
4863 theorems within a class context produce both relative results (with
4864 implicit parameters according to the locale context), and polymorphic
4865 constants with qualified polymorphism (according to the class
4866 context). Within the body context of a 'class' target, a separate
4867 syntax layer ("user space type system") takes care of converting
4868 between global polymorphic consts and internal locale representation.
4869 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
4870 "isatool doc classes" provides a tutorial.
4872 * Generic code generator framework allows to generate executable
4873 code for ML and Haskell (including Isabelle classes). A short usage
4876 internal compilation:
4877 export_code <list of constants (term syntax)> in SML
4878 writing SML code to a file:
4879 export_code <list of constants (term syntax)> in SML <filename>
4880 writing OCaml code to a file:
4881 export_code <list of constants (term syntax)> in OCaml <filename>
4882 writing Haskell code to a bunch of files:
4883 export_code <list of constants (term syntax)> in Haskell <filename>
4885 evaluating closed propositions to True/False using code generation:
4888 Reasonable default setup of framework in HOL.
4890 Theorem attributs for selecting and transforming function equations theorems:
4892 [code fun]: select a theorem as function equation for a specific constant
4893 [code fun del]: deselect a theorem as function equation for a specific constant
4894 [code inline]: select an equation theorem for unfolding (inlining) in place
4895 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
4897 User-defined serializations (target in {SML, OCaml, Haskell}):
4899 code_const <and-list of constants (term syntax)>
4900 {(target) <and-list of const target syntax>}+
4902 code_type <and-list of type constructors>
4903 {(target) <and-list of type target syntax>}+
4905 code_instance <and-list of instances>
4907 where instance ::= <type constructor> :: <class>
4909 code_class <and_list of classes>
4910 {(target) <and-list of class target syntax>}+
4911 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
4913 code_instance and code_class only are effective to target Haskell.
4915 For example usage see src/HOL/ex/Codegenerator.thy and
4916 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
4917 generation from Isabelle/HOL theories is available via "isatool doc
4920 * Code generator: consts in 'consts_code' Isar commands are now
4921 referred to by usual term syntax (including optional type
4924 * Command 'no_translations' removes translation rules from theory
4927 * Overloaded definitions are now actually checked for acyclic
4928 dependencies. The overloading scheme is slightly more general than
4929 that of Haskell98, although Isabelle does not demand an exact
4930 correspondence to type class and instance declarations.
4931 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
4932 exotic versions of overloading -- at the discretion of the user!
4934 Polymorphic constants are represented via type arguments, i.e. the
4935 instantiation that matches an instance against the most general
4936 declaration given in the signature. For example, with the declaration
4937 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
4938 as c(nat). Overloading is essentially simultaneous structural
4939 recursion over such type arguments. Incomplete specification patterns
4940 impose global constraints on all occurrences, e.g. c('a * 'a) on the
4941 LHS means that more general c('a * 'b) will be disallowed on any RHS.
4942 Command 'print_theory' outputs the normalized system of recursive
4943 equations, see section "definitions".
4945 * Configuration options are maintained within the theory or proof
4946 context (with name and type bool/int/string), providing a very simple
4947 interface to a poor-man's version of general context data. Tools may
4948 declare options in ML (e.g. using Attrib.config_int) and then refer to
4949 these values using Config.get etc. Users may change options via an
4950 associated attribute of the same name. This form of context
4951 declaration works particularly well with commands 'declare' or
4952 'using', for example ``declare [[foo = 42]]''. Thus it has become
4953 very easy to avoid global references, which would not observe Isar
4954 toplevel undo/redo and fail to work with multithreading.
4956 Various global ML references of Pure and HOL have been turned into
4957 configuration options:
4959 Unify.search_bound unify_search_bound
4960 Unify.trace_bound unify_trace_bound
4961 Unify.trace_simp unify_trace_simp
4962 Unify.trace_types unify_trace_types
4963 Simplifier.simp_depth_limit simp_depth_limit
4964 Blast.depth_limit blast_depth_limit
4965 DatatypeProp.dtK datatype_distinctness_limit
4966 fast_arith_neq_limit fast_arith_neq_limit
4967 fast_arith_split_limit fast_arith_split_limit
4969 * Named collections of theorems may be easily installed as context
4970 data using the functor NamedThmsFun (see also
4971 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
4972 attributes; there is also a toplevel print command. This facility is
4973 just a common case of general context data, which is the preferred way
4974 for anything more complex than just a list of facts in canonical
4977 * Isar: command 'declaration' augments a local theory by generic
4978 declaration functions written in ML. This enables arbitrary content
4979 being added to the context, depending on a morphism that tells the
4980 difference of the original declaration context wrt. the application
4981 context encountered later on.
4983 * Isar: proper interfaces for simplification procedures. Command
4984 'simproc_setup' declares named simprocs (with match patterns, and body
4985 text in ML). Attribute "simproc" adds/deletes simprocs in the current
4986 context. ML antiquotation @{simproc name} retrieves named simprocs.
4988 * Isar: an extra pair of brackets around attribute declarations
4989 abbreviates a theorem reference involving an internal dummy fact,
4990 which will be ignored later --- only the effect of the attribute on
4991 the background context will persist. This form of in-place
4992 declarations is particularly useful with commands like 'declare' and
4993 'using', for example ``have A using [[simproc a]] by simp''.
4995 * Isar: method "assumption" (and implicit closing of subproofs) now
4996 takes simple non-atomic goal assumptions into account: after applying
4997 an assumption as a rule the resulting subgoals are solved by atomic
4998 assumption steps. This is particularly useful to finish 'obtain'
4999 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
5000 without referring to the original premise "!!x. P x ==> thesis" in the
5001 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
5004 * Isar: implicit use of prems from the Isar proof context is
5005 considered a legacy feature. Common applications like ``have A .''
5006 may be replaced by ``have A by fact'' or ``note `A`''. In general,
5007 referencing facts explicitly here improves readability and
5008 maintainability of proof texts.
5010 * Isar: improper proof element 'guess' is like 'obtain', but derives
5011 the obtained context from the course of reasoning! For example:
5013 assume "EX x y. A x & B y" -- "any previous fact"
5014 then guess x and y by clarify
5016 This technique is potentially adventurous, depending on the facts and
5017 proof tools being involved here.
5019 * Isar: known facts from the proof context may be specified as literal
5020 propositions, using ASCII back-quote syntax. This works wherever
5021 named facts used to be allowed so far, in proof commands, proof
5022 methods, attributes etc. Literal facts are retrieved from the context
5023 according to unification of type and term parameters. For example,
5024 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
5025 theorems in the current context, then these are valid literal facts:
5026 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
5028 There is also a proof method "fact" which does the same composition
5029 for explicit goal states, e.g. the following proof texts coincide with
5030 certain special cases of literal facts:
5032 have "A" by fact == note `A`
5033 have "A ==> B" by fact == note `A ==> B`
5034 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
5035 have "P a ==> Q a" by fact == note `P a ==> Q a`
5037 * Isar: ":" (colon) is no longer a symbolic identifier character in
5038 outer syntax. Thus symbolic identifiers may be used without
5039 additional white space in declarations like this: ``assume *: A''.
5041 * Isar: 'print_facts' prints all local facts of the current context,
5042 both named and unnamed ones.
5044 * Isar: 'def' now admits simultaneous definitions, e.g.:
5046 def x == "t" and y == "u"
5048 * Isar: added command 'unfolding', which is structurally similar to
5049 'using', but affects both the goal state and facts by unfolding given
5050 rewrite rules. Thus many occurrences of the 'unfold' method or
5051 'unfolded' attribute may be replaced by first-class proof text.
5053 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
5054 and command 'unfolding' now all support object-level equalities
5055 (potentially conditional). The underlying notion of rewrite rule is
5056 analogous to the 'rule_format' attribute, but *not* that of the
5057 Simplifier (which is usually more generous).
5059 * Isar: the new attribute [rotated n] (default n = 1) rotates the
5060 premises of a theorem by n. Useful in conjunction with drule.
5062 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
5063 method expression within a sandbox consisting of the first N
5064 sub-goals, which need to exist. For example, ``simp_all [3]''
5065 simplifies the first three sub-goals, while (rule foo, simp_all)[]
5066 simplifies all new goals that emerge from applying rule foo to the
5067 originally first one.
5069 * Isar: schematic goals are no longer restricted to higher-order
5070 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
5073 * Isar: the conclusion of a long theorem statement is now either
5074 'shows' (a simultaneous conjunction, as before), or 'obtains'
5075 (essentially a disjunction of cases with local parameters and
5076 assumptions). The latter allows to express general elimination rules
5077 adequately; in this notation common elimination rules look like this:
5079 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
5081 obtains x where "P x"
5083 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
5087 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
5093 The subsequent classical rules even refer to the formal "thesis"
5096 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
5099 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
5100 obtains "thesis ==> something"
5102 The actual proof of an 'obtains' statement is analogous to that of the
5103 Isar proof element 'obtain', only that there may be several cases.
5104 Optional case names may be specified in parentheses; these will be
5105 available both in the present proof and as annotations in the
5106 resulting rule, for later use with the 'cases' method (cf. attribute
5109 * Isar: the assumptions of a long theorem statement are available as
5110 "assms" fact in the proof context. This is more appropriate than the
5111 (historical) "prems", which refers to all assumptions of the current
5112 context, including those from the target locale, proof body etc.
5114 * Isar: 'print_statement' prints theorems from the current theory or
5115 proof context in long statement form, according to the syntax of a
5118 * Isar: 'obtain' takes an optional case name for the local context
5119 introduction rule (default "that").
5121 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
5122 explicit (is "_ ==> ?foo") in the rare cases where this still happens
5125 * Pure: syntax "CONST name" produces a fully internalized constant
5126 according to the current context. This is particularly useful for
5127 syntax translations that should refer to internal constant
5128 representations independently of name spaces.
5130 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
5131 instead of "FOO ". This allows multiple binder declarations to coexist
5132 in the same context. INCOMPATIBILITY.
5134 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
5135 primitive that also works in a locale context (both for constants and
5136 fixed variables). Type declaration and internal syntactic representation
5137 of given constants retrieved from the context. Likewise, the
5138 'no_notation' command allows to remove given syntax annotations from the
5141 * Isar/locales: new derived specification elements 'axiomatization',
5142 'definition', 'abbreviation', which support type-inference, admit
5143 object-level specifications (equality, equivalence). See also the
5144 isar-ref manual. Examples:
5147 eq (infix "===" 50) where
5148 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
5150 definition "f x y = x + y + 1"
5151 definition g where "g x = f x x"
5154 neq (infix "=!=" 50) where
5155 "x =!= y == ~ (x === y)"
5157 These specifications may be also used in a locale context. Then the
5158 constants being introduced depend on certain fixed parameters, and the
5159 constant name is qualified by the locale base name. An internal
5160 abbreviation takes care for convenient input and output, making the
5161 parameters implicit and using the original short name. See also
5162 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
5163 entities from a monomorphic theory.
5165 Presently, abbreviations are only available 'in' a target locale, but
5166 not inherited by general import expressions. Also note that
5167 'abbreviation' may be used as a type-safe replacement for 'syntax' +
5168 'translations' in common applications. The "no_abbrevs" print mode
5169 prevents folding of abbreviations in term output.
5171 Concrete syntax is attached to specified constants in internal form,
5172 independently of name spaces. The parse tree representation is
5173 slightly different -- use 'notation' instead of raw 'syntax', and
5174 'translations' with explicit "CONST" markup to accommodate this.
5176 * Pure/Isar: unified syntax for new-style specification mechanisms
5177 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
5178 full type inference and dummy patterns ("_"). For example:
5180 definition "K x _ = x"
5182 inductive conj for A B
5183 where "A ==> B ==> conj A B"
5185 * Pure: command 'print_abbrevs' prints all constant abbreviations of
5186 the current context. Print mode "no_abbrevs" prevents inversion of
5187 abbreviations on output.
5189 * Isar/locales: improved parameter handling: use of locales "var" and
5190 "struct" no longer necessary; - parameter renamings are no longer
5191 required to be injective. For example, this allows to define
5192 endomorphisms as locale endom = homom mult mult h.
5194 * Isar/locales: changed the way locales with predicates are defined.
5195 Instead of accumulating the specification, the imported expression is
5196 now an interpretation. INCOMPATIBILITY: different normal form of
5197 locale expressions. In particular, in interpretations of locales with
5198 predicates, goals repesenting already interpreted fragments are not
5199 removed automatically. Use methods `intro_locales' and
5200 `unfold_locales'; see below.
5202 * Isar/locales: new methods `intro_locales' and `unfold_locales'
5203 provide backward reasoning on locales predicates. The methods are
5204 aware of interpretations and discharge corresponding goals.
5205 `intro_locales' is less aggressive then `unfold_locales' and does not
5206 unfold predicates to assumptions.
5208 * Isar/locales: the order in which locale fragments are accumulated
5209 has changed. This enables to override declarations from fragments due
5210 to interpretations -- for example, unwanted simp rules.
5212 * Isar/locales: interpretation in theories and proof contexts has been
5213 extended. One may now specify (and prove) equations, which are
5214 unfolded in interpreted theorems. This is useful for replacing
5215 defined concepts (constants depending on locale parameters) by
5216 concepts already existing in the target context. Example:
5218 interpretation partial_order ["op <= :: [int, int] => bool"]
5219 where "partial_order.less (op <=) (x::int) y = (x < y)"
5221 Typically, the constant `partial_order.less' is created by a
5222 definition specification element in the context of locale
5225 * Method "induct": improved internal context management to support
5226 local fixes and defines on-the-fly. Thus explicit meta-level
5227 connectives !! and ==> are rarely required anymore in inductive goals
5228 (using object-logic connectives for this purpose has been long
5229 obsolete anyway). Common proof patterns are explained in
5230 src/HOL/Induct/Common_Patterns.thy, see also
5231 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
5234 * Method "induct": improved handling of simultaneous goals. Instead of
5235 introducing object-level conjunction, the statement is now split into
5236 several conclusions, while the corresponding symbolic cases are nested
5237 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
5238 see src/HOL/Induct/Common_Patterns.thy, for example.
5240 * Method "induct": mutual induction rules are now specified as a list
5241 of rule sharing the same induction cases. HOL packages usually provide
5242 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
5243 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
5244 mutual induction rules differently, i.e. like this:
5246 (induct rule: foo_bar.inducts)
5247 (induct set: foo bar)
5248 (induct pred: foo bar)
5249 (induct type: foo bar)
5251 The ML function ProjectRule.projections turns old-style rules into the
5254 * Method "coinduct": dual of induction, see
5255 src/HOL/Library/Coinductive_List.thy for various examples.
5257 * Method "cases", "induct", "coinduct": the ``(open)'' option is
5258 considered a legacy feature.
5260 * Attribute "symmetric" produces result with standardized schematic
5261 variables (index 0). Potential INCOMPATIBILITY.
5263 * Simplifier: by default the simplifier trace only shows top level
5264 rewrites now. That is, trace_simp_depth_limit is set to 1 by
5265 default. Thus there is less danger of being flooded by the trace. The
5266 trace indicates where parts have been suppressed.
5268 * Provers/classical: removed obsolete classical version of elim_format
5269 attribute; classical elim/dest rules are now treated uniformly when
5270 manipulating the claset.
5272 * Provers/classical: stricter checks to ensure that supplied intro,
5273 dest and elim rules are well-formed; dest and elim rules must have at
5276 * Provers/classical: attributes dest/elim/intro take an optional
5277 weight argument for the rule (just as the Pure versions). Weights are
5278 ignored by automated tools, but determine the search order of single
5281 * Syntax: input syntax now supports dummy variable binding "%_. b",
5282 where the body does not mention the bound variable. Note that dummy
5283 patterns implicitly depend on their context of bounds, which makes
5284 "{_. _}" match any set comprehension as expected. Potential
5285 INCOMPATIBILITY -- parse translations need to cope with syntactic
5286 constant "_idtdummy" in the binding position.
5288 * Syntax: removed obsolete syntactic constant "_K" and its associated
5289 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
5290 for example "A -> B" => "Pi A (%_. B)".
5292 * Pure: 'class_deps' command visualizes the subclass relation, using
5293 the graph browser tool.
5295 * Pure: 'print_theory' now suppresses certain internal declarations by
5296 default; use '!' option for full details.
5301 * Method "metis" proves goals by applying the Metis general-purpose
5302 resolution prover (see also http://gilith.com/software/metis/).
5303 Examples are in the directory MetisExamples. WARNING: the
5304 Isabelle/HOL-Metis integration does not yet work properly with
5307 * Command 'sledgehammer' invokes external automatic theorem provers as
5308 background processes. It generates calls to the "metis" method if
5309 successful. These can be pasted into the proof. Users do not have to
5310 wait for the automatic provers to return. WARNING: does not really
5311 work with multi-threading.
5313 * New "auto_quickcheck" feature tests outermost goal statements for
5314 potential counter-examples. Controlled by ML references
5315 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
5316 5000 milliseconds). Fails silently if statements is outside of
5317 executable fragment, or any other codgenerator problem occurs.
5319 * New constant "undefined" with axiom "undefined x = undefined".
5321 * Added class "HOL.eq", allowing for code generation with polymorphic
5324 * Some renaming of class constants due to canonical name prefixing in
5325 the new 'class' package:
5327 HOL.abs ~> HOL.abs_class.abs
5328 HOL.divide ~> HOL.divide_class.divide
5329 0 ~> HOL.zero_class.zero
5330 1 ~> HOL.one_class.one
5331 op + ~> HOL.plus_class.plus
5332 op - ~> HOL.minus_class.minus
5333 uminus ~> HOL.minus_class.uminus
5334 op * ~> HOL.times_class.times
5335 op < ~> HOL.ord_class.less
5336 op <= > HOL.ord_class.less_eq
5337 Nat.power ~> Power.power_class.power
5338 Nat.size ~> Nat.size_class.size
5339 Numeral.number_of ~> Numeral.number_class.number_of
5340 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
5341 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
5342 Orderings.min ~> Orderings.ord_class.min
5343 Orderings.max ~> Orderings.ord_class.max
5344 Divides.op div ~> Divides.div_class.div
5345 Divides.op mod ~> Divides.div_class.mod
5346 Divides.op dvd ~> Divides.div_class.dvd
5348 INCOMPATIBILITY. Adaptions may be required in the following cases:
5350 a) User-defined constants using any of the names "plus", "minus",
5351 "times", "less" or "less_eq". The standard syntax translations for
5352 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
5355 b) Variables named "plus", "minus", "times", "less", "less_eq"
5356 INCOMPATIBILITY: use more specific names.
5358 c) Permutative equations (e.g. "a + b = b + a")
5359 Since the change of names also changes the order of terms, permutative
5360 rewrite rules may get applied in a different order. Experience shows
5361 that this is rarely the case (only two adaptions in the whole Isabelle
5362 distribution). INCOMPATIBILITY: rewrite proofs
5364 d) ML code directly refering to constant names
5365 This in general only affects hand-written proof tactics, simprocs and
5366 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
5367 Consider using @{const_name} antiquotation.
5369 * New class "default" with associated constant "default".
5371 * Function "sgn" is now overloaded and available on int, real, complex
5372 (and other numeric types), using class "sgn". Two possible defs of
5373 sgn are given as equational assumptions in the classes sgn_if and
5374 sgn_div_norm; ordered_idom now also inherits from sgn_if.
5377 * Locale "partial_order" now unified with class "order" (cf. theory
5378 Orderings), added parameter "less". INCOMPATIBILITY.
5380 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
5381 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
5382 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
5384 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
5385 changed order of proof goals in instance proofs.
5387 * The transitivity reasoner for partial and linear orders is set up
5388 for classes "order" and "linorder". Instances of the reasoner are available
5389 in all contexts importing or interpreting the corresponding locales.
5390 Method "order" invokes the reasoner separately; the reasoner
5391 is also integrated with the Simplifier as a solver. Diagnostic
5392 command 'print_orders' shows the available instances of the reasoner
5393 in the current context.
5395 * Localized monotonicity predicate in theory "Orderings"; integrated
5396 lemmas max_of_mono and min_of_mono with this predicate.
5399 * Formulation of theorem "dense" changed slightly due to integration
5400 with new class dense_linear_order.
5402 * Uniform lattice theory development in HOL.
5404 constants "meet" and "join" now named "inf" and "sup"
5405 constant "Meet" now named "Inf"
5407 classes "meet_semilorder" and "join_semilorder" now named
5408 "lower_semilattice" and "upper_semilattice"
5409 class "lorder" now named "lattice"
5410 class "comp_lat" now named "complete_lattice"
5412 Instantiation of lattice classes allows explicit definitions
5413 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
5415 INCOMPATIBILITY. Theorem renames:
5417 meet_left_le ~> inf_le1
5418 meet_right_le ~> inf_le2
5419 join_left_le ~> sup_ge1
5420 join_right_le ~> sup_ge2
5421 meet_join_le ~> inf_sup_ord
5424 le_meet ~> le_inf_iff
5425 le_join ~> ge_sup_conv
5426 meet_idempotent ~> inf_idem
5427 join_idempotent ~> sup_idem
5428 meet_comm ~> inf_commute
5429 join_comm ~> sup_commute
5430 meet_leI1 ~> le_infI1
5431 meet_leI2 ~> le_infI2
5432 le_joinI1 ~> le_supI1
5433 le_joinI2 ~> le_supI2
5434 meet_assoc ~> inf_assoc
5435 join_assoc ~> sup_assoc
5436 meet_left_comm ~> inf_left_commute
5437 meet_left_idempotent ~> inf_left_idem
5438 join_left_comm ~> sup_left_commute
5439 join_left_idempotent ~> sup_left_idem
5442 le_def_meet ~> le_iff_inf
5443 le_def_join ~> le_iff_sup
5444 join_absorp2 ~> sup_absorb2
5445 join_absorp1 ~> sup_absorb1
5446 meet_absorp1 ~> inf_absorb1
5447 meet_absorp2 ~> inf_absorb2
5448 meet_join_absorp ~> inf_sup_absorb
5449 join_meet_absorp ~> sup_inf_absorb
5450 distrib_join_le ~> distrib_sup_le
5451 distrib_meet_le ~> distrib_inf_le
5453 add_meet_distrib_left ~> add_inf_distrib_left
5454 add_join_distrib_left ~> add_sup_distrib_left
5455 is_join_neg_meet ~> is_join_neg_inf
5456 is_meet_neg_join ~> is_meet_neg_sup
5457 add_meet_distrib_right ~> add_inf_distrib_right
5458 add_join_distrib_right ~> add_sup_distrib_right
5459 add_meet_join_distribs ~> add_sup_inf_distribs
5460 join_eq_neg_meet ~> sup_eq_neg_inf
5461 meet_eq_neg_join ~> inf_eq_neg_sup
5462 add_eq_meet_join ~> add_eq_inf_sup
5463 meet_0_imp_0 ~> inf_0_imp_0
5464 join_0_imp_0 ~> sup_0_imp_0
5465 meet_0_eq_0 ~> inf_0_eq_0
5466 join_0_eq_0 ~> sup_0_eq_0
5467 neg_meet_eq_join ~> neg_inf_eq_sup
5468 neg_join_eq_meet ~> neg_sup_eq_inf
5469 join_eq_if ~> sup_eq_if
5471 mono_meet ~> mono_inf
5472 mono_join ~> mono_sup
5473 meet_bool_eq ~> inf_bool_eq
5474 join_bool_eq ~> sup_bool_eq
5475 meet_fun_eq ~> inf_fun_eq
5476 join_fun_eq ~> sup_fun_eq
5477 meet_set_eq ~> inf_set_eq
5478 join_set_eq ~> sup_set_eq
5479 meet1_iff ~> inf1_iff
5480 meet2_iff ~> inf2_iff
5489 join1_iff ~> sup1_iff
5490 join2_iff ~> sup2_iff
5500 is_meet_Meet ~> is_meet_Inf
5501 Meet_bool_def ~> Inf_bool_def
5502 Meet_fun_def ~> Inf_fun_def
5503 Meet_greatest ~> Inf_greatest
5504 Meet_lower ~> Inf_lower
5505 Meet_set_def ~> Inf_set_def
5508 Sup_bool_eq ~> Sup_bool_def
5509 Sup_fun_eq ~> Sup_fun_def
5510 Sup_set_eq ~> Sup_set_def
5512 listsp_meetI ~> listsp_infI
5513 listsp_meet_eq ~> listsp_inf_eq
5518 * Added syntactic class "size"; overloaded constant "size" now has
5519 type "'a::size ==> bool"
5521 * Internal reorganisation of `size' of datatypes: size theorems
5522 "foo.size" are no longer subsumed by "foo.simps" (but are still
5523 simplification rules by default!); theorems "prod.size" now named
5526 * Class "div" now inherits from class "times" rather than "type".
5529 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
5530 Linorder etc. have disappeared; operations defined in terms of
5531 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
5533 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
5535 * HOL-Word: New extensive library and type for generic, fixed size
5536 machine words, with arithmetic, bit-wise, shifting and rotating
5537 operations, reflection into int, nat, and bool lists, automation for
5538 linear arithmetic (by automatic reflection into nat or int), including
5539 lemmas on overflow and monotonicity. Instantiated to all appropriate
5540 arithmetic type classes, supporting automatic simplification of
5541 numerals on all operations.
5543 * Library/Boolean_Algebra: locales for abstract boolean algebras.
5545 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
5547 * Code generator library theories:
5548 - Code_Integer represents HOL integers by big integer literals in target
5550 - Code_Char represents HOL characters by character literals in target
5552 - Code_Char_chr like Code_Char, but also offers treatment of character
5553 codes; includes Code_Integer.
5554 - Executable_Set allows to generate code for finite sets using lists.
5555 - Executable_Rat implements rational numbers as triples (sign, enumerator,
5557 - Executable_Real implements a subset of real numbers, namly those
5558 representable by rational numbers.
5559 - Efficient_Nat implements natural numbers by integers, which in general will
5560 result in higher efficency; pattern matching with 0/Suc is eliminated;
5561 includes Code_Integer.
5562 - Code_Index provides an additional datatype index which is mapped to
5563 target-language built-in integers.
5564 - Code_Message provides an additional datatype message_string which is isomorphic to
5565 strings; messages are mapped to target-language strings.
5567 * New package for inductive predicates
5569 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
5572 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5573 for z_1 :: U_1 and ... and z_n :: U_m
5575 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5578 with full support for type-inference, rather than
5580 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5582 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5583 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5585 inductive "s z_1 ... z_m"
5587 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5590 For backward compatibility, there is a wrapper allowing inductive
5591 sets to be defined with the new package via
5594 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5595 for z_1 :: U_1 and ... and z_n :: U_m
5597 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5603 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5604 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5605 for z_1 :: U_1 and ... and z_n :: U_m
5607 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5608 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5611 if the additional syntax "p ..." is required.
5613 Numerous examples can be found in the subdirectories src/HOL/Auth,
5614 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
5618 - Since declaration and definition of inductive sets or predicates
5619 is no longer separated, abbreviations involving the newly
5620 introduced sets or predicates must be specified together with the
5621 introduction rules after the 'where' keyword (see above), rather
5622 than before the actual inductive definition.
5624 - The variables in induction and elimination rules are now
5625 quantified in the order of their occurrence in the introduction
5626 rules, rather than in alphabetical order. Since this may break
5627 some proofs, these proofs either have to be repaired, e.g. by
5628 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
5629 statements of the form
5631 case (rule_i a_i_1 ... a_i_{k_i})
5633 or the old order of quantification has to be restored by explicitly adding
5634 meta-level quantifiers in the introduction rules, i.e.
5636 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
5638 - The format of the elimination rules is now
5640 p z_1 ... z_m x_1 ... x_n ==>
5641 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5646 (x_1, ..., x_n) : s z_1 ... z_m ==>
5647 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5650 for sets rather than
5652 x : s z_1 ... z_m ==>
5653 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
5656 This may require terms in goals to be expanded to n-tuples
5657 (e.g. using case_tac or simplification with the split_paired_all
5658 rule) before the above elimination rule is applicable.
5660 - The elimination or case analysis rules for (mutually) inductive
5661 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
5662 list of rules "p_1_..._p_k.elims" is no longer available.
5664 * New package "function"/"fun" for general recursive functions,
5665 supporting mutual and nested recursion, definitions in local contexts,
5666 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
5667 for small examples, and the separate tutorial on the function
5668 package. The old recdef "package" is still available as before, but
5669 users are encouraged to use the new package.
5671 * Method "lexicographic_order" automatically synthesizes termination
5672 relations as lexicographic combinations of size measures.
5674 * Case-expressions allow arbitrary constructor-patterns (including
5675 "_") and take their order into account, like in functional
5676 programming. Internally, this is translated into nested
5677 case-expressions; missing cases are added and mapped to the predefined
5678 constant "undefined". In complicated cases printing may no longer show
5679 the original input but the internal form. Lambda-abstractions allow
5680 the same form of pattern matching: "% pat1 => e1 | ..." is an
5681 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
5684 * IntDef: The constant "int :: nat => int" has been removed; now "int"
5685 is an abbreviation for "of_nat :: nat => int". The simplification
5686 rules for "of_nat" have been changed to work like "int" did
5687 previously. Potential INCOMPATIBILITY:
5688 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
5689 - of_nat_diff and of_nat_mult are no longer default simp rules
5691 * Method "algebra" solves polynomial equations over (semi)rings using
5692 Groebner bases. The (semi)ring structure is defined by locales and the
5693 tool setup depends on that generic context. Installing the method for
5694 a specific type involves instantiating the locale and possibly adding
5695 declarations for computation on the coefficients. The method is
5696 already instantiated for natural numbers and for the axiomatic class
5697 of idoms with numerals. See also the paper by Chaieb and Wenzel at
5698 CALCULEMUS 2007 for the general principles underlying this
5699 architecture of context-aware proof-tools.
5701 * Method "ferrack" implements quantifier elimination over
5702 special-purpose dense linear orders using locales (analogous to
5703 "algebra"). The method is already installed for class
5704 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
5707 * Former constant "List.op @" now named "List.append". Use ML
5708 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
5709 circumvent possible incompatibilities when working on ML level.
5711 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
5713 * New function listsum :: 'a list => 'a for arbitrary monoids.
5714 Special syntax: "SUM x <- xs. f x" (and latex variants)
5716 * New syntax for Haskell-like list comprehension (input only), eg.
5717 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
5719 * The special syntax for function "filter" has changed from [x :
5720 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
5721 comprehension syntax, and for uniformity. INCOMPATIBILITY.
5723 * [a..b] is now defined for arbitrary linear orders. It used to be
5724 defined on nat only, as an abbreviation for [a..<Suc b]
5727 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
5729 * New functions "sorted" and "sort" in src/HOL/List.thy.
5731 * New lemma collection field_simps (an extension of ring_simps) for
5732 manipulating (in)equations involving division. Multiplies with all
5733 denominators that can be proved to be non-zero (in equations) or
5734 positive/negative (in inequations).
5736 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
5737 have been improved and renamed to ring_simps, group_simps and
5738 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
5739 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
5741 * Theory Library/Commutative_Ring: switched from recdef to function
5742 package; constants add, mul, pow now curried. Infix syntax for
5743 algebraic operations.
5745 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
5748 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
5751 * HOL/records: generalised field-update to take a function on the
5752 field rather than the new value: r(|A := x|) is translated to A_update
5753 (K x) r The K-combinator that is internally used is called K_record.
5754 INCOMPATIBILITY: Usage of the plain update functions has to be
5757 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
5758 * x = 0, which are required for a semiring. Richer structures do not
5759 inherit from semiring_0 anymore, because this property is a theorem
5760 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
5761 there is more to prove, but this is mostly trivial.
5763 * Class "recpower" is generalized to arbitrary monoids, not just
5764 commutative semirings. INCOMPATIBILITY: may need to incorporate
5765 commutativity or semiring properties additionally.
5767 * Constant "List.list_all2" in List.thy now uses authentic syntax.
5768 INCOMPATIBILITY: translations containing list_all2 may go wrong,
5769 better use 'abbreviation'.
5771 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
5773 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
5774 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
5775 significant changes for setting up numeral syntax for types:
5776 - New constants Numeral.pred and Numeral.succ instead
5777 of former Numeral.bin_pred and Numeral.bin_succ.
5778 - Use integer operations instead of bin_add, bin_mult and so on.
5779 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
5780 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
5782 See src/HOL/Integ/IntArith.thy for an example setup.
5784 * Command 'normal_form' computes the normal form of a term that may
5785 contain free variables. For example ``normal_form "rev [a, b, c]"''
5786 produces ``[b, c, a]'' (without proof). This command is suitable for
5787 heavy-duty computations because the functions are compiled to ML
5788 first. Correspondingly, a method "normalization" is provided. See
5789 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
5791 * Alternative iff syntax "A <-> B" for equality on bool (with priority
5792 25 like -->); output depends on the "iff" print_mode, the default is
5793 "A = B" (with priority 50).
5795 * Relations less (<) and less_eq (<=) are also available on type bool.
5796 Modified syntax to disallow nesting without explicit parentheses,
5797 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
5800 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
5802 * Relation composition operator "op O" now has precedence 75 and binds
5803 stronger than union and intersection. INCOMPATIBILITY.
5805 * The old set interval syntax "{m..n(}" (and relatives) has been
5806 removed. Use "{m..<n}" (and relatives) instead.
5808 * In the context of the assumption "~(s = t)" the Simplifier rewrites
5809 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
5810 ``declare [[simproc del: neq]]''.
5812 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
5815 * Theorem Cons_eq_map_conv no longer declared as "simp".
5817 * Theorem setsum_mult renamed to setsum_right_distrib.
5819 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
5822 * Reimplemented methods "sat" and "satx", with several improvements:
5823 goals no longer need to be stated as "<prems> ==> False", equivalences
5824 (i.e. "=" on type bool) are handled, variable names of the form
5825 "lit_<n>" are no longer reserved, significant speedup.
5827 * Methods "sat" and "satx" can now replay MiniSat proof traces.
5828 zChaff is still supported as well.
5830 * 'inductive' and 'datatype': provide projections of mutual rules,
5831 bundled as foo_bar.inducts;
5833 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
5836 * Library: moved theory Accessible_Part to main HOL.
5838 * Library: added theory Coinductive_List of potentially infinite lists
5839 as greatest fixed-point.
5841 * Library: added theory AssocList which implements (finite) maps as
5844 * Method "evaluation" solves goals (i.e. a boolean expression)
5845 efficiently by compiling it to ML. The goal is "proved" (via an
5846 oracle) if it evaluates to True.
5848 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
5849 also when invoked by the simplifier. This results in the Simplifier
5850 being more powerful on arithmetic goals. INCOMPATIBILITY.
5851 Configuration option fast_arith_split_limit=0 recovers the old
5854 * Support for hex (0x20) and binary (0b1001) numerals.
5856 * New method: reify eqs (t), where eqs are equations for an
5857 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
5858 parameter, computes a term s::'b and a list xs::'a list and proves the
5859 theorem I xs s = t. This is also known as reification or quoting. The
5860 resulting theorem is applied to the subgoal to substitute t with I xs
5861 s. If t is omitted, the subgoal itself is reified.
5863 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
5864 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
5865 where f is supposed to be a computable function (in the sense of code
5866 generattion). The method uses reify to compute s and xs as above then
5867 applies corr_thm and uses normalization by evaluation to "prove" f s =
5868 r and finally gets the theorem t = r, which is again applied to the
5869 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
5871 * Reflection: Automatic reification now handels binding, an example is
5872 available in src/HOL/ex/ReflectionEx.thy
5874 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
5875 command 'statespace' that is similar to 'record', but introduces an
5876 abstract specification based on the locale infrastructure instead of
5877 HOL types. This leads to extra flexibility in composing state spaces,
5878 in particular multiple inheritance and renaming of components.
5883 * Hyperreal: Functions root and sqrt are now defined on negative real
5884 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
5885 Nonnegativity side conditions have been removed from many lemmas, so
5886 that more subgoals may now be solved by simplification; potential
5889 * Real: new type classes formalize real normed vector spaces and
5890 algebras, using new overloaded constants scaleR :: real => 'a => 'a
5891 and norm :: 'a => real.
5893 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
5894 reals into other types. The overloaded constant Reals :: 'a set is now
5895 defined as range of_real; potential INCOMPATIBILITY.
5897 * Real: proper support for ML code generation, including 'quickcheck'.
5898 Reals are implemented as arbitrary precision rationals.
5900 * Hyperreal: Several constants that previously worked only for the
5901 reals have been generalized, so they now work over arbitrary vector
5902 spaces. Type annotations may need to be added in some cases; potential
5905 Infinitesimal :: ('a::real_normed_vector) star set
5906 HFinite :: ('a::real_normed_vector) star set
5907 HInfinite :: ('a::real_normed_vector) star set
5908 approx :: ('a::real_normed_vector) star => 'a star => bool
5909 monad :: ('a::real_normed_vector) star => 'a star set
5910 galaxy :: ('a::real_normed_vector) star => 'a star set
5911 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
5912 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
5913 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
5914 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
5915 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
5916 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
5917 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
5918 sgn :: 'a::real_normed_vector => 'a
5919 exp :: 'a::{recpower,real_normed_field,banach} => 'a
5921 * Complex: Some complex-specific constants are now abbreviations for
5922 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
5923 hnorm. Other constants have been entirely removed in favor of the
5924 polymorphic versions (INCOMPATIBILITY):
5928 HInfinite <-- CInfinite
5929 Infinitesimal <-- CInfinitesimal
5932 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
5933 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
5934 (ns)deriv <-- (ns)cderiv
5939 * Formalisation of ideals and the quotient construction over rings.
5941 * Order and lattice theory no longer based on records.
5944 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
5945 greatest_closed. INCOMPATIBILITY.
5947 * Method algebra is now set up via an attribute. For examples see
5948 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
5949 of algebraic structures.
5951 * Renamed theory CRing to Ring.
5956 * Substantial, yet incomplete support for nominal datatypes (binding
5957 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
5958 src/HOL/Nominal/Examples. Prospective users should consult
5959 http://isabelle.in.tum.de/nominal/
5964 * ML basics: just one true type int, which coincides with IntInf.int
5967 * ML within Isar: antiquotations allow to embed statically-checked
5968 formal entities in the source, referring to the context available at
5969 compile-time. For example:
5971 ML {* @{sort "{zero,one}"} *}
5972 ML {* @{typ "'a => 'b"} *}
5973 ML {* @{term "%x. x"} *}
5974 ML {* @{prop "x == y"} *}
5975 ML {* @{ctyp "'a => 'b"} *}
5976 ML {* @{cterm "%x. x"} *}
5977 ML {* @{cprop "x == y"} *}
5978 ML {* @{thm asm_rl} *}
5979 ML {* @{thms asm_rl} *}
5980 ML {* @{type_name c} *}
5981 ML {* @{type_syntax c} *}
5982 ML {* @{const_name c} *}
5983 ML {* @{const_syntax c} *}
5986 ML {* @{theory Pure} *}
5987 ML {* @{theory_ref} *}
5988 ML {* @{theory_ref Pure} *}
5991 ML {* @{clasimpset} *}
5993 The same works for sources being ``used'' within an Isar context.
5995 * ML in Isar: improved error reporting; extra verbosity with
5996 ML_Context.trace enabled.
5998 * Pure/General/table.ML: the join operations now works via exceptions
5999 DUP/SAME instead of type option. This is simpler in simple cases, and
6000 admits slightly more efficient complex applications.
6002 * Pure: 'advanced' translation functions (parse_translation etc.) now
6003 use Context.generic instead of just theory.
6005 * Pure: datatype Context.generic joins theory/Proof.context and
6006 provides some facilities for code that works in either kind of
6007 context, notably GenericDataFun for uniform theory and proof data.
6009 * Pure: simplified internal attribute type, which is now always
6010 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
6011 local (Proof.context) attributes have been discontinued, while
6012 minimizing code duplication. Thm.rule_attribute and
6013 Thm.declaration_attribute build canonical attributes; see also structure
6014 Context for further operations on Context.generic, notably
6015 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
6016 declarations and definitions.
6018 * Context data interfaces (Theory/Proof/GenericDataFun): removed
6019 name/print, uninitialized data defaults to ad-hoc copy of empty value,
6020 init only required for impure data. INCOMPATIBILITY: empty really need
6021 to be empty (no dependencies on theory content!)
6023 * Pure/kernel: consts certification ignores sort constraints given in
6024 signature declarations. (This information is not relevant to the
6025 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
6026 potential INCOMPATIBILITY.
6028 * Pure: axiomatic type classes are now purely definitional, with
6029 explicit proofs of class axioms and super class relations performed
6030 internally. See Pure/axclass.ML for the main internal interfaces --
6031 notably AxClass.define_class supercedes AxClass.add_axclass, and
6032 AxClass.axiomatize_class/classrel/arity supersede
6033 Sign.add_classes/classrel/arities.
6035 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
6036 global/local versions on theory vs. Proof.context have been
6037 discontinued; Attrib.syntax and Method.syntax have been adapted
6038 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
6039 attributes, methods, etc.
6041 * Pure: several functions of signature "... -> theory -> theory * ..."
6042 have been reoriented to "... -> theory -> ... * theory" in order to
6043 allow natural usage in combination with the ||>, ||>>, |-> and
6044 fold_map combinators.
6046 * Pure: official theorem names (closed derivations) and additional
6047 comments (tags) are now strictly separate. Name hints -- which are
6048 maintained as tags -- may be attached any time without affecting the
6051 * Pure: primitive rule lift_rule now takes goal cterm instead of an
6052 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
6053 achieve the old behaviour.
6055 * Pure: the "Goal" constant is now called "prop", supporting a
6056 slightly more general idea of ``protecting'' meta-level rule
6059 * Pure: Logic.(un)varify only works in a global context, which is now
6060 enforced instead of silently assumed. INCOMPATIBILITY, may use
6061 Logic.legacy_(un)varify as temporary workaround.
6063 * Pure: structure Name provides scalable operations for generating
6064 internal variable names, notably Name.variants etc. This replaces
6065 some popular functions from term.ML:
6067 Term.variant -> Name.variant
6068 Term.variantlist -> Name.variant_list
6069 Term.invent_names -> Name.invent_list
6071 Note that low-level renaming rarely occurs in new code -- operations
6072 from structure Variable are used instead (see below).
6074 * Pure: structure Variable provides fundamental operations for proper
6075 treatment of fixed/schematic variables in a context. For example,
6076 Variable.import introduces fixes for schematics of given facts and
6077 Variable.export reverses the effect (up to renaming) -- this replaces
6078 various freeze_thaw operations.
6080 * Pure: structure Goal provides simple interfaces for
6081 init/conclude/finish and tactical prove operations (replacing former
6082 Tactic.prove). Goal.prove is the canonical way to prove results
6083 within a given context; Goal.prove_global is a degraded version for
6084 theory level goals, including a global Drule.standard. Note that
6085 OldGoals.prove_goalw_cterm has long been obsolete, since it is
6086 ill-behaved in a local proof context (e.g. with local fixes/assumes or
6087 in a locale context).
6089 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
6090 and type checking (Syntax.check_term etc.), with common combinations
6091 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
6092 which are considered legacy and await removal.
6094 * Pure/Syntax: generic interfaces for type unchecking
6095 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
6096 with common combinations (Syntax.pretty_term, Syntax.string_of_term
6097 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
6098 available for convenience, but refer to the very same operations using
6099 a mere theory instead of a full context.
6101 * Isar: simplified treatment of user-level errors, using exception
6102 ERROR of string uniformly. Function error now merely raises ERROR,
6103 without any side effect on output channels. The Isar toplevel takes
6104 care of proper display of ERROR exceptions. ML code may use plain
6105 handle/can/try; cat_error may be used to concatenate errors like this:
6107 ... handle ERROR msg => cat_error msg "..."
6109 Toplevel ML code (run directly or through the Isar toplevel) may be
6110 embedded into the Isar toplevel with exception display/debug like
6113 Isar.toplevel (fn () => ...)
6115 INCOMPATIBILITY, removed special transform_error facilities, removed
6116 obsolete variants of user-level exceptions (ERROR_MESSAGE,
6117 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
6118 -- use plain ERROR instead.
6120 * Isar: theory setup now has type (theory -> theory), instead of a
6121 list. INCOMPATIBILITY, may use #> to compose setup functions.
6123 * Isar: ML toplevel pretty printer for type Proof.context, subject to
6124 ProofContext.debug/verbose flags.
6126 * Isar: Toplevel.theory_to_proof admits transactions that modify the
6127 theory before entering a proof state. Transactions now always see a
6128 quasi-functional intermediate checkpoint, both in interactive and
6131 * Isar: simplified interfaces for outer syntax. Renamed
6132 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
6133 OuterSyntax.add_parsers -- this functionality is now included in
6134 OuterSyntax.command etc. INCOMPATIBILITY.
6136 * Simplifier: the simpset of a running simplification process now
6137 contains a proof context (cf. Simplifier.the_context), which is the
6138 very context that the initial simpset has been retrieved from (by
6139 simpset_of/local_simpset_of). Consequently, all plug-in components
6140 (solver, looper etc.) may depend on arbitrary proof data.
6142 * Simplifier.inherit_context inherits the proof context (plus the
6143 local bounds) of the current simplification process; any simproc
6144 etc. that calls the Simplifier recursively should do this! Removed
6145 former Simplifier.inherit_bounds, which is already included here --
6146 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
6147 specify an explicit context using Simplifier.context/theory_context.
6149 * Simplifier/Classical Reasoner: more abstract interfaces
6150 change_simpset/claset for modifying the simpset/claset reference of a
6151 theory; raw versions simpset/claset_ref etc. have been discontinued --
6154 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
6160 * settings: the default heap location within ISABELLE_HOME_USER now
6161 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
6162 Isabelle installations.
6164 * isabelle-process: option -S (secure mode) disables some critical
6165 operations, notably runtime compilation and evaluation of ML source
6168 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
6170 * Support for parallel execution, using native multicore support of
6171 Poly/ML 5.1. The theory loader exploits parallelism when processing
6172 independent theories, according to the given theory header
6173 specifications. The maximum number of worker threads is specified via
6174 usedir option -M or the "max-threads" setting in Proof General. A
6175 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
6176 to 6 on a 8-core machine. User-code needs to observe certain
6177 guidelines for thread-safe programming, see appendix A in the Isar
6178 Implementation manual.
6182 New in Isabelle2005 (October 2005)
6183 ----------------------------------
6187 * Theory headers: the new header syntax for Isar theories is
6190 imports <theory1> ... <theoryN>
6191 uses <file1> ... <fileM>
6194 where the 'uses' part is optional. The previous syntax
6196 theory <name> = <theory1> + ... + <theoryN>:
6198 will disappear in the next release. Use isatool fixheaders to convert
6199 existing theory files. Note that there is no change in ancient
6200 non-Isar theories now, but these will disappear soon.
6202 * Theory loader: parent theories can now also be referred to via
6203 relative and absolute paths.
6205 * Command 'find_theorems' searches for a list of criteria instead of a
6206 list of constants. Known criteria are: intro, elim, dest, name:string,
6207 simp:term, and any term. Criteria can be preceded by '-' to select
6208 theorems that do not match. Intro, elim, dest select theorems that
6209 match the current goal, name:s selects theorems whose fully qualified
6210 name contain s, and simp:term selects all simplification rules whose
6211 lhs match term. Any other term is interpreted as pattern and selects
6212 all theorems matching the pattern. Available in ProofGeneral under
6213 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
6215 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
6217 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
6218 matching the current goal as introduction rule and not having "HOL."
6219 in their name (i.e. not being defined in theory HOL).
6221 * Command 'thms_containing' has been discontinued in favour of
6222 'find_theorems'; INCOMPATIBILITY.
6224 * Communication with Proof General is now 8bit clean, which means that
6225 Unicode text in UTF-8 encoding may be used within theory texts (both
6226 formal and informal parts). Cf. option -U of the Isabelle Proof
6227 General interface. Here are some simple examples (cf. src/HOL/ex):
6229 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
6230 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
6232 * Improved efficiency of the Simplifier and, to a lesser degree, the
6233 Classical Reasoner. Typical big applications run around 2 times
6237 *** Document preparation ***
6239 * Commands 'display_drafts' and 'print_drafts' perform simple output
6240 of raw sources. Only those symbols that do not require additional
6241 LaTeX packages (depending on comments in isabellesym.sty) are
6242 displayed properly, everything else is left verbatim. isatool display
6243 and isatool print are used as front ends (these are subject to the
6244 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
6246 * Command tags control specific markup of certain regions of text,
6247 notably folding and hiding. Predefined tags include "theory" (for
6248 theory begin and end), "proof" for proof commands, and "ML" for
6249 commands involving ML code; the additional tags "visible" and
6250 "invisible" are unused by default. Users may give explicit tag
6251 specifications in the text, e.g. ''by %invisible (auto)''. The
6252 interpretation of tags is determined by the LaTeX job during document
6253 preparation: see option -V of isatool usedir, or options -n and -t of
6254 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
6257 Several document versions may be produced at the same time via isatool
6258 usedir (the generated index.html will link all of them). Typical
6259 specifications include ''-V document=theory,proof,ML'' to present
6260 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
6261 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
6262 these parts without any formal replacement text. The Isabelle site
6263 default settings produce ''document'' and ''outline'' versions as
6266 * Several new antiquotations:
6268 @{term_type term} prints a term with its type annotated;
6270 @{typeof term} prints the type of a term;
6272 @{const const} is the same as @{term const}, but checks that the
6273 argument is a known logical constant;
6275 @{term_style style term} and @{thm_style style thm} print a term or
6276 theorem applying a "style" to it
6280 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
6281 definitions, equations, inequations etc., 'concl' printing only the
6282 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
6283 to print the specified premise. TermStyle.add_style provides an ML
6284 interface for introducing further styles. See also the "LaTeX Sugar"
6285 document practical applications. The ML antiquotation prints
6286 type-checked ML expressions verbatim.
6288 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
6289 and 'text' support optional locale specification '(in loc)', which
6290 specifies the default context for interpreting antiquotations. For
6291 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
6293 * Option 'locale=NAME' of antiquotations specifies an alternative
6294 context interpreting the subsequent argument. For example: @{thm
6295 [locale=lattice] inf_assoc}.
6297 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
6300 * Proper output of antiquotations for theory commands involving a
6301 proof context (such as 'locale' or 'theorem (in loc) ...').
6303 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
6304 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
6306 * isatool usedir: new option -C (default true) controls whether option
6307 -D should include a copy of the original document directory; -C false
6308 prevents unwanted effects such as copying of administrative CVS data.
6313 * Considerably improved version of 'constdefs' command. Now performs
6314 automatic type-inference of declared constants; additional support for
6315 local structure declarations (cf. locales and HOL records), see also
6316 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
6317 sequential dependencies of definitions within a single 'constdefs'
6318 section; moreover, the declared name needs to be an identifier. If
6319 all fails, consider to fall back on 'consts' and 'defs' separately.
6321 * Improved indexed syntax and implicit structures. First of all,
6322 indexed syntax provides a notational device for subscripted
6323 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
6324 expressions. Secondly, in a local context with structure
6325 declarations, number indexes \<^sub>n or the empty index (default
6326 number 1) refer to a certain fixed variable implicitly; option
6327 show_structs controls printing of implicit structures. Typical
6328 applications of these concepts involve record types and locales.
6330 * New command 'no_syntax' removes grammar declarations (and
6331 translations) resulting from the given syntax specification, which is
6332 interpreted in the same manner as for the 'syntax' command.
6334 * 'Advanced' translation functions (parse_translation etc.) may depend
6335 on the signature of the theory context being presently used for
6336 parsing/printing, see also isar-ref manual.
6338 * Improved 'oracle' command provides a type-safe interface to turn an
6339 ML expression of type theory -> T -> term into a primitive rule of
6340 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
6341 is already included here); see also FOL/ex/IffExample.thy;
6344 * axclass: name space prefix for class "c" is now "c_class" (was "c"
6345 before); "cI" is no longer bound, use "c.intro" instead.
6346 INCOMPATIBILITY. This change avoids clashes of fact bindings for
6347 axclasses vs. locales.
6349 * Improved internal renaming of symbolic identifiers -- attach primes
6350 instead of base 26 numbers.
6352 * New flag show_question_marks controls printing of leading question
6353 marks in schematic variable names.
6355 * In schematic variable names, *any* symbol following \<^isub> or
6356 \<^isup> is now treated as part of the base name. For example, the
6357 following works without printing of awkward ".0" indexes:
6359 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
6362 * Inner syntax includes (*(*nested*) comments*).
6364 * Pretty printer now supports unbreakable blocks, specified in mixfix
6365 annotations as "(00...)".
6367 * Clear separation of logical types and nonterminals, where the latter
6368 may only occur in 'syntax' specifications or type abbreviations.
6369 Before that distinction was only partially implemented via type class
6370 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
6371 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
6372 exotic syntax specifications may require further adaption
6373 (e.g. Cube/Cube.thy).
6375 * Removed obsolete type class "logic", use the top sort {} instead.
6376 Note that non-logical types should be declared as 'nonterminals'
6377 rather than 'types'. INCOMPATIBILITY for new object-logic
6380 * Attributes 'induct' and 'cases': type or set names may now be
6381 locally fixed variables as well.
6383 * Simplifier: can now control the depth to which conditional rewriting
6384 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
6387 * Simplifier: simplification procedures may now take the current
6388 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
6389 interface), which is very useful for calling the Simplifier
6390 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
6391 is gone -- use prems_of_ss on the simpset instead. Moreover, the
6392 low-level mk_simproc no longer applies Logic.varify internally, to
6393 allow for use in a context of fixed variables.
6395 * thin_tac now works even if the assumption being deleted contains !!
6396 or ==>. More generally, erule now works even if the major premise of
6397 the elimination rule contains !! or ==>.
6399 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
6401 * Reorganized bootstrapping of the Pure theories; CPure is now derived
6402 from Pure, which contains all common declarations already. Both
6403 theories are defined via plain Isabelle/Isar .thy files.
6404 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
6405 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
6406 use isatool fixcpure to adapt your theory and ML sources.
6408 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
6409 selections of theorems in named facts via index ranges.
6411 * 'print_theorems': in theory mode, really print the difference
6412 wrt. the last state (works for interactive theory development only),
6413 in proof mode print all local facts (cf. 'print_facts');
6415 * 'hide': option '(open)' hides only base names.
6417 * More efficient treatment of intermediate checkpoints in interactive
6420 * Code generator is now invoked via code_module (incremental code
6421 generation) and code_library (modular code generation, ML structures
6422 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
6423 must be quoted when used as identifiers.
6425 * New 'value' command for reading, evaluating and printing terms using
6426 the code generator. INCOMPATIBILITY: command keyword 'value' must be
6427 quoted when used as identifier.
6432 * New commands for the interpretation of locale expressions in
6433 theories (1), locales (2) and proof contexts (3). These generate
6434 proof obligations from the expression specification. After the
6435 obligations have been discharged, theorems of the expression are added
6436 to the theory, target locale or proof context. The synopsis of the
6437 commands is a follows:
6439 (1) interpretation expr inst
6440 (2) interpretation target < expr
6441 (3) interpret expr inst
6443 Interpretation in theories and proof contexts require a parameter
6444 instantiation of terms from the current context. This is applied to
6445 specifications and theorems of the interpreted expression.
6446 Interpretation in locales only permits parameter renaming through the
6447 locale expression. Interpretation is smart in that interpretations
6448 that are active already do not occur in proof obligations, neither are
6449 instantiated theorems stored in duplicate. Use 'print_interps' to
6450 inspect active interpretations of a particular locale. For details,
6451 see the Isar Reference manual. Examples can be found in
6452 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
6454 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
6455 'interpret' instead.
6457 * New context element 'constrains' for adding type constraints to
6460 * Context expressions: renaming of parameters with syntax
6463 * Locale declaration: 'includes' disallowed.
6465 * Proper static binding of attribute syntax -- i.e. types / terms /
6466 facts mentioned as arguments are always those of the locale definition
6467 context, independently of the context of later invocations. Moreover,
6468 locale operations (renaming and type / term instantiation) are applied
6469 to attribute arguments as expected.
6471 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
6472 actual attributes; rare situations may require Attrib.attribute to
6473 embed those attributes into Attrib.src that lack concrete syntax.
6474 Attribute implementations need to cooperate properly with the static
6475 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
6476 Attrib.XXX_thm etc. already do the right thing without further
6477 intervention. Only unusual applications -- such as "where" or "of"
6478 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
6479 on the context and the facts involved -- may have to assign parsed
6480 values to argument tokens explicitly.
6482 * Changed parameter management in theorem generation for long goal
6483 statements with 'includes'. INCOMPATIBILITY: produces a different
6484 theorem statement in rare situations.
6486 * Locale inspection command 'print_locale' omits notes elements. Use
6487 'print_locale!' to have them included in the output.
6492 * Provers/hypsubst.ML: improved version of the subst method, for
6493 single-step rewriting: it now works in bound variable contexts. New is
6494 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
6495 rewrite a different subterm than the original subst method, which is
6496 still available as 'simplesubst'.
6498 * Provers/quasi.ML: new transitivity reasoners for transitivity only
6501 * Provers/trancl.ML: new transitivity reasoner for transitive and
6502 reflexive-transitive closure of relations.
6504 * Provers/blast.ML: new reference depth_limit to make blast's depth
6505 limit (previously hard-coded with a value of 20) user-definable.
6507 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
6508 is peformed already. Object-logics merely need to finish their
6509 initial simpset configuration as before. INCOMPATIBILITY.
6514 * Symbolic syntax of Hilbert Choice Operator is now as follows:
6517 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
6519 The symbol \<some> is displayed as the alternative epsilon of LaTeX
6520 and x-symbol; use option '-m epsilon' to get it actually printed.
6521 Moreover, the mathematically important symbolic identifier \<epsilon>
6522 becomes available as variable, constant etc. INCOMPATIBILITY,
6524 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
6525 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
6526 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
6527 support corresponding Isar calculations.
6529 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
6532 * theory SetInterval: changed the syntax for open intervals:
6541 The old syntax is still supported but will disappear in the next
6542 release. For conversion use the following Emacs search and replace
6543 patterns (these are not perfect but work quite well):
6545 {)\([^\.]*\)\.\. -> {\1<\.\.}
6546 \.\.\([^(}]*\)(} -> \.\.<\1}
6548 * Theory Commutative_Ring (in Library): method comm_ring for proving
6549 equalities in commutative rings; method 'algebra' provides a generic
6552 * Theory Finite_Set: changed the syntax for 'setsum', summation over
6553 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
6554 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
6557 Some new syntax forms are available:
6559 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
6560 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
6561 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
6562 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
6564 The latter form "\<Sum>x < k. e" used to be based on a separate
6565 function "Summation", which has been discontinued.
6567 * theory Finite_Set: in structured induction proofs, the insert case
6568 is now 'case (insert x F)' instead of the old counterintuitive 'case
6571 * The 'refute' command has been extended to support a much larger
6572 fragment of HOL, including axiomatic type classes, constdefs and
6573 typedefs, inductive datatypes and recursion.
6575 * New tactics 'sat' and 'satx' to prove propositional tautologies.
6576 Requires zChaff with proof generation to be installed. See
6577 HOL/ex/SAT_Examples.thy for examples.
6579 * Datatype induction via method 'induct' now preserves the name of the
6580 induction variable. For example, when proving P(xs::'a list) by
6581 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
6582 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
6583 in unstructured proof scripts.
6585 * Reworked implementation of records. Improved scalability for
6586 records with many fields, avoiding performance problems for type
6587 inference. Records are no longer composed of nested field types, but
6588 of nested extension types. Therefore the record type only grows linear
6589 in the number of extensions and not in the number of fields. The
6590 top-level (users) view on records is preserved. Potential
6591 INCOMPATIBILITY only in strange cases, where the theory depends on the
6592 old record representation. The type generated for a record is called
6593 <record_name>_ext_type.
6595 Flag record_quick_and_dirty_sensitive can be enabled to skip the
6596 proofs triggered by a record definition or a simproc (if
6597 quick_and_dirty is enabled). Definitions of large records can take
6600 New simproc record_upd_simproc for simplification of multiple record
6601 updates enabled by default. Moreover, trivial updates are also
6602 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
6603 occasionally, since simplification is more powerful by default.
6605 * typedef: proper support for polymorphic sets, which contain extra
6606 type-variables in the term.
6608 * Simplifier: automatically reasons about transitivity chains
6609 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
6610 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
6611 old proofs break occasionally as simplification may now solve more
6612 goals than previously.
6614 * Simplifier: converts x <= y into x = y if assumption y <= x is
6615 present. Works for all partial orders (class "order"), in particular
6616 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
6619 * Simplifier: new simproc for "let x = a in f x". If a is a free or
6620 bound variable or a constant then the let is unfolded. Otherwise
6621 first a is simplified to b, and then f b is simplified to g. If
6622 possible we abstract b from g arriving at "let x = b in h x",
6623 otherwise we unfold the let and arrive at g. The simproc can be
6624 enabled/disabled by the reference use_let_simproc. Potential
6625 INCOMPATIBILITY since simplification is more powerful by default.
6627 * Classical reasoning: the meson method now accepts theorems as arguments.
6629 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
6630 jobs to provide advice on the provability of subgoals.
6632 * Theory OrderedGroup and Ring_and_Field: various additions and
6633 improvements to faciliate calculations involving equalities and
6636 The following theorems have been eliminated or modified
6639 abs_eq now named abs_of_nonneg
6640 abs_of_ge_0 now named abs_of_nonneg
6641 abs_minus_eq now named abs_of_nonpos
6642 imp_abs_id now named abs_of_nonneg
6643 imp_abs_neg_id now named abs_of_nonpos
6644 mult_pos now named mult_pos_pos
6645 mult_pos_le now named mult_nonneg_nonneg
6646 mult_pos_neg_le now named mult_nonneg_nonpos
6647 mult_pos_neg2_le now named mult_nonneg_nonpos2
6648 mult_neg now named mult_neg_neg
6649 mult_neg_le now named mult_nonpos_nonpos
6651 * The following lemmas in Ring_and_Field have been added to the simplifier:
6654 not_square_less_zero
6656 The following lemmas have been deleted from Real/RealPow:
6666 * Theory Parity: added rules for simplifying exponents.
6670 The following theorems have been eliminated or modified
6673 list_all_Nil now named list_all.simps(1)
6674 list_all_Cons now named list_all.simps(2)
6675 list_all_conv now named list_all_iff
6676 set_mem_eq now named mem_iff
6678 * Theories SetsAndFunctions and BigO (see HOL/Library) support
6679 asymptotic "big O" calculations. See the notes in BigO.thy.
6684 * Theory RealDef: better support for embedding natural numbers and
6685 integers in the reals.
6687 The following theorems have been eliminated or modified
6690 exp_ge_add_one_self now requires no hypotheses
6691 real_of_int_add reversed direction of equality (use [symmetric])
6692 real_of_int_minus reversed direction of equality (use [symmetric])
6693 real_of_int_diff reversed direction of equality (use [symmetric])
6694 real_of_int_mult reversed direction of equality (use [symmetric])
6696 * Theory RComplete: expanded support for floor and ceiling functions.
6698 * Theory Ln is new, with properties of the natural logarithm
6700 * Hyperreal: There is a new type constructor "star" for making
6701 nonstandard types. The old type names are now type synonyms:
6705 hcomplex = complex star
6707 * Hyperreal: Many groups of similarly-defined constants have been
6708 replaced by polymorphic versions (INCOMPATIBILITY):
6710 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
6712 starset <-- starsetNat, starsetC
6713 *s* <-- *sNat*, *sc*
6714 starset_n <-- starsetNat_n, starsetC_n
6715 *sn* <-- *sNatn*, *scn*
6716 InternalSets <-- InternalNatSets, InternalCSets
6718 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6719 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
6720 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
6721 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
6722 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
6724 * Hyperreal: Many type-specific theorems have been removed in favor of
6725 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
6727 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
6728 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
6729 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
6730 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
6731 right_minus <-- hypreal_add_minus
6732 left_minus <-- {hypreal,hcomplex}_add_minus_left
6733 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
6734 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
6735 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
6736 mult_1_right <-- hcomplex_mult_one_right
6737 mult_zero_left <-- hcomplex_mult_zero_left
6738 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
6739 right_distrib <-- hypnat_add_mult_distrib2
6740 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
6741 right_inverse <-- hypreal_mult_inverse
6742 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
6743 order_refl <-- {hypreal,hypnat}_le_refl
6744 order_trans <-- {hypreal,hypnat}_le_trans
6745 order_antisym <-- {hypreal,hypnat}_le_anti_sym
6746 order_less_le <-- {hypreal,hypnat}_less_le
6747 linorder_linear <-- {hypreal,hypnat}_le_linear
6748 add_left_mono <-- {hypreal,hypnat}_add_left_mono
6749 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
6750 add_nonneg_nonneg <-- hypreal_le_add_order
6752 * Hyperreal: Separate theorems having to do with type-specific
6753 versions of constants have been merged into theorems that apply to the
6754 new polymorphic constants (INCOMPATIBILITY):
6756 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
6757 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
6758 STAR_Un <-- {STAR,NatStar,STARC}_Un
6759 STAR_Int <-- {STAR,NatStar,STARC}_Int
6760 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
6761 STAR_subset <-- {STAR,NatStar,STARC}_subset
6762 STAR_mem <-- {STAR,NatStar,STARC}_mem
6763 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
6764 STAR_diff <-- {STAR,STARC}_diff
6765 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
6766 STARC_hcomplex_of_complex}_image_subset
6767 starset_n_Un <-- starset{Nat,C}_n_Un
6768 starset_n_Int <-- starset{Nat,C}_n_Int
6769 starset_n_Compl <-- starset{Nat,C}_n_Compl
6770 starset_n_diff <-- starset{Nat,C}_n_diff
6771 InternalSets_Un <-- Internal{Nat,C}Sets_Un
6772 InternalSets_Int <-- Internal{Nat,C}Sets_Int
6773 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
6774 InternalSets_diff <-- Internal{Nat,C}Sets_diff
6775 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
6776 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
6777 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
6778 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
6779 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
6780 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6781 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
6782 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
6783 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
6784 starfun_diff <-- starfun{C,RC,CR}_diff
6785 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
6786 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
6787 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
6788 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
6789 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
6790 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
6791 starfun_Id <-- starfunC_Id
6792 starfun_approx <-- starfun{Nat,CR}_approx
6793 starfun_capprox <-- starfun{C,RC}_capprox
6794 starfun_abs <-- starfunNat_rabs
6795 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
6796 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
6797 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
6798 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
6799 starfun_add_capprox <-- starfun{C,RC}_add_capprox
6800 starfun_add_approx <-- starfunCR_add_approx
6801 starfun_inverse_inverse <-- starfunC_inverse_inverse
6802 starfun_divide <-- starfun{C,CR,RC}_divide
6803 starfun_n <-- starfun{Nat,C}_n
6804 starfun_n_mult <-- starfun{Nat,C}_n_mult
6805 starfun_n_add <-- starfun{Nat,C}_n_add
6806 starfun_n_add_minus <-- starfunNat_n_add_minus
6807 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
6808 starfun_n_minus <-- starfun{Nat,C}_n_minus
6809 starfun_n_eq <-- starfun{Nat,C}_n_eq
6811 star_n_add <-- {hypreal,hypnat,hcomplex}_add
6812 star_n_minus <-- {hypreal,hcomplex}_minus
6813 star_n_diff <-- {hypreal,hcomplex}_diff
6814 star_n_mult <-- {hypreal,hcomplex}_mult
6815 star_n_inverse <-- {hypreal,hcomplex}_inverse
6816 star_n_le <-- {hypreal,hypnat}_le
6817 star_n_less <-- {hypreal,hypnat}_less
6818 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
6819 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
6820 star_n_abs <-- hypreal_hrabs
6821 star_n_divide <-- hcomplex_divide
6823 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
6824 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
6825 star_of_diff <-- hypreal_of_real_diff
6826 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
6827 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
6828 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
6829 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
6830 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
6831 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
6832 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
6833 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
6834 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
6835 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
6836 star_of_number_of <-- {hypreal,hcomplex}_number_of
6837 star_of_number_less <-- number_of_less_hypreal_of_real_iff
6838 star_of_number_le <-- number_of_le_hypreal_of_real_iff
6839 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
6840 star_of_less_number <-- hypreal_of_real_less_number_of_iff
6841 star_of_le_number <-- hypreal_of_real_le_number_of_iff
6842 star_of_power <-- hypreal_of_real_power
6843 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
6845 * Hyperreal: new method "transfer" that implements the transfer
6846 principle of nonstandard analysis. With a subgoal that mentions
6847 nonstandard types like "'a star", the command "apply transfer"
6848 replaces it with an equivalent one that mentions only standard types.
6849 To be successful, all free variables must have standard types; non-
6850 standard variables must have explicit universal quantifiers.
6852 * Hyperreal: A theory of Taylor series.
6857 * Discontinued special version of 'constdefs' (which used to support
6858 continuous functions) in favor of the general Pure one with full
6861 * New simplification procedure for solving continuity conditions; it
6862 is much faster on terms with many nested lambda abstractions (cubic
6863 instead of exponential time).
6865 * New syntax for domain package: selector names are now optional.
6866 Parentheses should be omitted unless argument is lazy, for example:
6868 domain 'a stream = cons "'a" (lazy "'a stream")
6870 * New command 'fixrec' for defining recursive functions with pattern
6871 matching; defining multiple functions with mutual recursion is also
6872 supported. Patterns may include the constants cpair, spair, up, sinl,
6873 sinr, or any data constructor defined by the domain package. The given
6874 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
6875 syntax and examples.
6877 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
6878 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
6879 but the proof obligation additionally includes an admissibility
6880 requirement. The packages generate instances of class cpo or pcpo,
6881 with continuity and strictness theorems for Rep and Abs.
6883 * HOLCF: Many theorems have been renamed according to a more standard naming
6884 scheme (INCOMPATIBILITY):
6886 foo_inject: "foo$x = foo$y ==> x = y"
6887 foo_eq: "(foo$x = foo$y) = (x = y)"
6888 foo_less: "(foo$x << foo$y) = (x << y)"
6889 foo_strict: "foo$UU = UU"
6890 foo_defined: "... ==> foo$x ~= UU"
6891 foo_defined_iff: "(foo$x = UU) = (x = UU)"
6896 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
6897 including the First Isomorphism Theorem (on quotienting by the kernel
6900 * ZF/Simplifier: install second copy of type solver that actually
6901 makes use of TC rules declared to Isar proof contexts (or locales);
6902 the old version is still required for ML proof scripts.
6907 * Converted to Isar theory format; use locales instead of axiomatic
6913 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
6916 * Pure/library.ML no longer defines its own option datatype, but uses
6917 that of the SML basis, which has constructors NONE and SOME instead of
6918 None and Some, as well as exception Option.Option instead of OPTION.
6919 The functions the, if_none, is_some, is_none have been adapted
6920 accordingly, while Option.map replaces apsome.
6922 * Pure/library.ML: the exception LIST has been given up in favour of
6923 the standard exceptions Empty and Subscript, as well as
6924 Library.UnequalLengths. Function like Library.hd and Library.tl are
6925 superceded by the standard hd and tl functions etc.
6927 A number of basic list functions are no longer exported to the ML
6928 toplevel, as they are variants of predefined functions. The following
6929 suggests how one can translate existing code:
6931 rev_append xs ys = List.revAppend (xs, ys)
6932 nth_elem (i, xs) = List.nth (xs, i)
6933 last_elem xs = List.last xs
6934 flat xss = List.concat xss
6935 seq fs = List.app fs
6936 partition P xs = List.partition P xs
6937 mapfilter f xs = List.mapPartial f xs
6939 * Pure/library.ML: several combinators for linear functional
6940 transformations, notably reverse application and composition:
6943 (x, y) |-> f f #-> g
6945 * Pure/library.ML: introduced/changed precedence of infix operators:
6947 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
6949 infix 3 o oo ooo oooo;
6950 infix 4 ~~ upto downto;
6952 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
6955 * Pure/library.ML: natural list combinators fold, fold_rev, and
6956 fold_map support linear functional transformations and nesting. For
6959 fold f [x1, ..., xN] y =
6960 y |> f x1 |> ... |> f xN
6962 (fold o fold) f [xs1, ..., xsN] y =
6963 y |> fold f xs1 |> ... |> fold f xsN
6965 fold f [x1, ..., xN] =
6968 (fold o fold) f [xs1, ..., xsN] =
6969 fold f xs1 #> ... #> fold f xsN
6971 * Pure/library.ML: the following selectors on type 'a option are
6974 the: 'a option -> 'a (*partial*)
6975 these: 'a option -> 'a where 'a = 'b list
6976 the_default: 'a -> 'a option -> 'a
6977 the_list: 'a option -> 'a list
6979 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6980 basic operations for association lists, following natural argument
6981 order; moreover the explicit equality predicate passed here avoids
6982 potentially expensive polymorphic runtime equality checks.
6983 The old functions may be expressed as follows:
6985 assoc = uncurry (AList.lookup (op =))
6986 assocs = these oo AList.lookup (op =)
6987 overwrite = uncurry (AList.update (op =)) o swap
6989 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6991 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
6992 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
6994 replacing make_keylist and keyfilter (occassionally used)
6997 make_keylist = AList.make
6998 keyfilter = AList.find (op =)
7000 * eq_fst and eq_snd now take explicit equality parameter, thus
7001 avoiding eqtypes. Naive rewrites:
7003 eq_fst = eq_fst (op =)
7004 eq_snd = eq_snd (op =)
7006 * Removed deprecated apl and apr (rarely used).
7009 apl (n, op) =>>= curry op n
7010 apr (op, m) =>>= fn n => op (n, m)
7012 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
7013 provides a reasonably efficient light-weight implementation of sets as
7016 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
7017 few new operations; existing lookup and update are now curried to
7018 follow natural argument order (for use with fold etc.);
7019 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
7021 * Pure/General: output via the Isabelle channels of
7022 writeln/warning/error etc. is now passed through Output.output, with a
7023 hook for arbitrary transformations depending on the print_mode
7024 (cf. Output.add_mode -- the first active mode that provides a output
7025 function wins). Already formatted output may be embedded into further
7026 text via Output.raw; the result of Pretty.string_of/str_of and derived
7027 functions (string_of_term/cterm/thm etc.) is already marked raw to
7028 accommodate easy composition of diagnostic messages etc. Programmers
7029 rarely need to care about Output.output or Output.raw at all, with
7030 some notable exceptions: Output.output is required when bypassing the
7031 standard channels (writeln etc.), or in token translations to produce
7032 properly formatted results; Output.raw is required when capturing
7033 already output material that will eventually be presented to the user
7034 a second time. For the default print mode, both Output.output and
7035 Output.raw have no effect.
7037 * Pure/General: Output.time_accumulator NAME creates an operator ('a
7038 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
7039 cumulative results are displayed at the end of a batch session.
7041 * Pure/General: File.sysify_path and File.quote_sysify path have been
7042 replaced by File.platform_path and File.shell_path (with appropriate
7043 hooks). This provides a clean interface for unusual systems where the
7044 internal and external process view of file names are different.
7046 * Pure: more efficient orders for basic syntactic entities: added
7047 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
7048 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
7049 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
7050 orders now -- potential INCOMPATIBILITY for code that depends on a
7051 particular order for Symtab.keys, Symtab.dest, etc. (consider using
7052 Library.sort_strings on result).
7054 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
7055 fold_types traverse types/terms from left to right, observing natural
7056 argument order. Supercedes previous foldl_XXX versions, add_frees,
7057 add_vars etc. have been adapted as well: INCOMPATIBILITY.
7059 * Pure: name spaces have been refined, with significant changes of the
7060 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
7061 to extern(_table). The plain name entry path is superceded by a
7062 general 'naming' context, which also includes the 'policy' to produce
7063 a fully qualified name and external accesses of a fully qualified
7064 name; NameSpace.extend is superceded by context dependent
7065 Sign.declare_name. Several theory and proof context operations modify
7066 the naming context. Especially note Theory.restore_naming and
7067 ProofContext.restore_naming to get back to a sane state; note that
7068 Theory.add_path is no longer sufficient to recover from
7069 Theory.absolute_path in particular.
7071 * Pure: new flags short_names (default false) and unique_names
7072 (default true) for controlling output of qualified names. If
7073 short_names is set, names are printed unqualified. If unique_names is
7074 reset, the name prefix is reduced to the minimum required to achieve
7075 the original result when interning again, even if there is an overlap
7076 with earlier declarations.
7078 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
7079 now 'extend', and 'merge' gets an additional Pretty.pp argument
7080 (useful for printing error messages). INCOMPATIBILITY.
7082 * Pure: major reorganization of the theory context. Type Sign.sg and
7083 Theory.theory are now identified, referring to the universal
7084 Context.theory (see Pure/context.ML). Actual signature and theory
7085 content is managed as theory data. The old code and interfaces were
7086 spread over many files and structures; the new arrangement introduces
7087 considerable INCOMPATIBILITY to gain more clarity:
7089 Context -- theory management operations (name, identity, inclusion,
7090 parents, ancestors, merge, etc.), plus generic theory data;
7092 Sign -- logical signature and syntax operations (declaring consts,
7093 types, etc.), plus certify/read for common entities;
7095 Theory -- logical theory operations (stating axioms, definitions,
7096 oracles), plus a copy of logical signature operations (consts,
7097 types, etc.); also a few basic management operations (Theory.copy,
7100 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
7101 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
7102 for convenience -- they merely return the theory.
7104 * Pure: type Type.tsig is superceded by theory in most interfaces.
7106 * Pure: the Isar proof context type is already defined early in Pure
7107 as Context.proof (note that ProofContext.context and Proof.context are
7108 aliases, where the latter is the preferred name). This enables other
7109 Isabelle components to refer to that type even before Isar is present.
7111 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
7112 typeK, constK, axiomK, oracleK), but provide explicit operations for
7113 any of these kinds. For example, Sign.intern typeK is now
7114 Sign.intern_type, Theory.hide_space Sign.typeK is now
7115 Theory.hide_types. Also note that former
7116 Theory.hide_classes/types/consts are now
7117 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
7118 internalize their arguments! INCOMPATIBILITY.
7120 * Pure: get_thm interface (of PureThy and ProofContext) expects
7121 datatype thmref (with constructors Name and NameSelection) instead of
7122 plain string -- INCOMPATIBILITY;
7124 * Pure: cases produced by proof methods specify options, where NONE
7125 means to remove case bindings -- INCOMPATIBILITY in
7128 * Pure: the following operations retrieve axioms or theorems from a
7129 theory node or theory hierarchy, respectively:
7131 Theory.axioms_of: theory -> (string * term) list
7132 Theory.all_axioms_of: theory -> (string * term) list
7133 PureThy.thms_of: theory -> (string * thm) list
7134 PureThy.all_thms_of: theory -> (string * thm) list
7136 * Pure: print_tac now outputs the goal through the trace channel.
7138 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
7139 Reference Toplevel.debug (default false) controls detailed printing
7140 and tracing of low-level exceptions; Toplevel.profiling (default 0)
7141 controls execution profiling -- set to 1 for time and 2 for space
7142 (both increase the runtime).
7144 * Isar session: The initial use of ROOT.ML is now always timed,
7145 i.e. the log will show the actual process times, in contrast to the
7146 elapsed wall-clock time that the outer shell wrapper produces.
7148 * Simplifier: improved handling of bound variables (nameless
7149 representation, avoid allocating new strings). Simprocs that invoke
7150 the Simplifier recursively should use Simplifier.inherit_bounds to
7151 avoid local name clashes. Failure to do so produces warnings
7152 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
7153 for further details.
7155 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
7156 bindings for all theorems stored within a given theory; this may help
7157 in porting non-Isar theories to Isar ones, while keeping ML proof
7158 scripts for the time being.
7160 * ML operator HTML.with_charset specifies the charset begin used for
7161 generated HTML files. For example:
7163 HTML.with_charset "utf-8" use_thy "Hebrew";
7164 HTML.with_charset "utf-8" use_thy "Chinese";
7169 * Allow symlinks to all proper Isabelle executables (Isabelle,
7170 isabelle, isatool etc.).
7172 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
7173 isatool doc, isatool mkdir, display_drafts etc.).
7175 * isatool usedir: option -f allows specification of the ML file to be
7176 used by Isabelle; default is ROOT.ML.
7178 * New isatool version outputs the version identifier of the Isabelle
7179 distribution being used.
7181 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
7182 (containing Boolean satisfiability problems) into Isabelle/HOL
7187 New in Isabelle2004 (April 2004)
7188 --------------------------------
7192 * Provers/order.ML: new efficient reasoner for partial and linear orders.
7193 Replaces linorder.ML.
7195 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
7196 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
7197 (\<a>...\<z>), are now considered normal letters, and can therefore
7198 be used anywhere where an ASCII letter (a...zA...Z) has until
7199 now. COMPATIBILITY: This obviously changes the parsing of some
7200 terms, especially where a symbol has been used as a binder, say
7201 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
7202 as an identifier. Fix it by inserting a space around former
7203 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
7204 existing theory and ML files.
7206 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
7208 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
7209 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
7210 a normal (but invisible) letter. For multiple letter subscripts repeat
7211 \<^isub> like this: x\<^isub>1\<^isub>2.
7213 * Pure: There are now sub-/superscripts that can span more than one
7214 character. Text between \<^bsub> and \<^esub> is set in subscript in
7215 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
7216 superscript. The new control characters are not identifier parts.
7218 * Pure: Control-symbols of the form \<^raw:...> will literally print the
7219 content of "..." to the latex file instead of \isacntrl... . The "..."
7220 may consist of any printable characters excluding the end bracket >.
7222 * Pure: Using new Isar command "finalconsts" (or the ML functions
7223 Theory.add_finals or Theory.add_finals_i) it is now possible to
7224 declare constants "final", which prevents their being given a definition
7225 later. It is useful for constants whose behaviour is fixed axiomatically
7226 rather than definitionally, such as the meta-logic connectives.
7228 * Pure: 'instance' now handles general arities with general sorts
7229 (i.e. intersections of classes),
7231 * Presentation: generated HTML now uses a CSS style sheet to make layout
7232 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
7233 It can be changed to alter the colors/layout of generated pages.
7238 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
7239 cut_tac, subgoal_tac and thin_tac:
7240 - Now understand static (Isar) contexts. As a consequence, users of Isar
7241 locales are no longer forced to write Isar proof scripts.
7242 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
7244 - INCOMPATIBILITY: names of variables to be instantiated may no
7245 longer be enclosed in quotes. Instead, precede variable name with `?'.
7246 This is consistent with the instantiation attribute "where".
7248 * Attributes "where" and "of":
7249 - Now take type variables of instantiated theorem into account when reading
7250 the instantiation string. This fixes a bug that caused instantiated
7251 theorems to have too special types in some circumstances.
7252 - "where" permits explicit instantiations of type variables.
7254 * Calculation commands "moreover" and "also" no longer interfere with
7255 current facts ("this"), admitting arbitrary combinations with "then"
7259 - Goal statements involving the context element "includes" no longer
7260 generate theorems with internal delta predicates (those ending on
7261 "_axioms") in the premise.
7262 Resolve particular premise with <locale>.intro to obtain old form.
7263 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
7264 specification and "includes" elements in goal statement.
7265 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
7266 [intro?] and [elim?] (respectively) by default.
7267 - Experimental command for instantiation of locales in proof contexts:
7268 instantiate <label>[<attrs>]: <loc>
7269 Instantiates locale <loc> and adds all its theorems to the current context
7270 taking into account their attributes. Label and attrs are optional
7271 modifiers, like in theorem declarations. If present, names of
7272 instantiated theorems are qualified with <label>, and the attributes
7273 <attrs> are applied after any attributes these theorems might have already.
7274 If the locale has assumptions, a chained fact of the form
7275 "<loc> t1 ... tn" is expected from which instantiations of the parameters
7276 are derived. The command does not support old-style locales declared
7277 with "locale (open)".
7278 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
7280 * HOL: Tactic emulation methods induct_tac and case_tac understand static
7286 * Proof import: new image HOL4 contains the imported library from
7287 the HOL4 system with about 2500 theorems. It is imported by
7288 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
7289 can be used like any other Isabelle image. See
7290 HOL/Import/HOL/README for more information.
7293 - Much improved handling of linear and partial orders.
7294 Reasoners for linear and partial orders are set up for type classes
7295 "linorder" and "order" respectively, and are added to the default simpset
7296 as solvers. This means that the simplifier can build transitivity chains
7297 to solve goals from the assumptions.
7298 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
7299 of blast or auto after simplification become unnecessary because the goal
7300 is solved by simplification already.
7302 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
7303 all proved in axiomatic type classes for semirings, rings and fields.
7306 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
7307 now formalized using the Ring_and_Field theory mentioned above.
7308 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
7309 than before, because now they are set up once in a generic manner.
7310 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
7311 Look for the general versions in Ring_and_Field (and Power if they concern
7314 * Type "rat" of the rational numbers is now available in HOL-Complex.
7317 - Record types are now by default printed with their type abbreviation
7318 instead of the list of all field types. This can be configured via
7319 the reference "print_record_type_abbr".
7320 - Simproc "record_upd_simproc" for simplification of multiple updates added
7321 (not enabled by default).
7322 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
7323 EX x. x = sel r to True (not enabled by default).
7324 - Tactic "record_split_simp_tac" to split and simplify records added.
7326 * 'specification' command added, allowing for definition by
7327 specification. There is also an 'ax_specification' command that
7328 introduces the new constants axiomatically.
7330 * arith(_tac) is now able to generate counterexamples for reals as well.
7332 * HOL-Algebra: new locale "ring" for non-commutative rings.
7334 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
7335 definitions, thanks to Sava Krsti\'{c} and John Matthews.
7337 * HOL-Matrix: a first theory for matrices in HOL with an application of
7338 matrix theory to linear programming.
7340 * Unions and Intersections:
7341 The latex output syntax of UN and INT has been changed
7342 from "\Union x \in A. B" to "\Union_{x \in A} B"
7343 i.e. the index formulae has become a subscript.
7344 Similarly for "\Union x. B", and for \Inter instead of \Union.
7346 * Unions and Intersections over Intervals:
7347 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
7348 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
7349 like in normal math, and corresponding versions for < and for intersection.
7351 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
7352 lexicographic dictonary ordering has been added as "lexord".
7354 * ML: the legacy theory structures Int and List have been removed. They had
7355 conflicted with ML Basis Library structures having the same names.
7357 * 'refute' command added to search for (finite) countermodels. Only works
7358 for a fragment of HOL. The installation of an external SAT solver is
7359 highly recommended. See "HOL/Refute.thy" for details.
7361 * 'quickcheck' command: Allows to find counterexamples by evaluating
7362 formulae under an assignment of free variables to random values.
7363 In contrast to 'refute', it can deal with inductive datatypes,
7364 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
7370 * Streams now come with concatenation and are part of the HOLCF image
7374 New in Isabelle2003 (May 2003)
7375 ------------------------------
7379 * Provers/simplifier:
7381 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
7382 Assumptions are now subject to complete mutual simplification,
7383 not just from left to right. The simplifier now preserves
7384 the order of assumptions.
7386 Potential INCOMPATIBILITY:
7388 -- simp sometimes diverges where the old version did
7389 not, e.g. invoking simp on the goal
7391 [| P (f x); y = x; f x = f y |] ==> Q
7393 now gives rise to the infinite reduction sequence
7395 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
7397 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
7400 -- Tactics combining classical reasoner and simplification (such as auto)
7401 are also affected by this change, because many of them rely on
7402 simp. They may sometimes diverge as well or yield a different numbers
7403 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
7404 in case of problems. Sometimes subsequent calls to the classical
7405 reasoner will fail because a preceeding call to the simplifier too
7406 eagerly simplified the goal, e.g. deleted redundant premises.
7408 - The simplifier trace now shows the names of the applied rewrite rules
7410 - You can limit the number of recursive invocations of the simplifier
7411 during conditional rewriting (where the simplifie tries to solve the
7412 conditions before applying the rewrite rule):
7413 ML "simp_depth_limit := n"
7414 where n is an integer. Thus you can force termination where previously
7415 the simplifier would diverge.
7417 - Accepts free variables as head terms in congruence rules. Useful in Isar.
7419 - No longer aborts on failed congruence proof. Instead, the
7420 congruence is ignored.
7422 * Pure: New generic framework for extracting programs from constructive
7423 proofs. See HOL/Extraction.thy for an example instantiation, as well
7424 as HOL/Extraction for some case studies.
7426 * Pure: The main goal of the proof state is no longer shown by default, only
7427 the subgoals. This behaviour is controlled by a new flag.
7428 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
7429 (ML: Proof.show_main_goal).
7431 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
7432 rules whose conclusion matches subgoal 1:
7433 PG menu: Isabelle/Isar -> Show me -> matching rules
7434 The rules are ordered by how closely they match the subgoal.
7435 In particular, rules that solve a subgoal outright are displayed first
7436 (or rather last, the way they are printed).
7437 (ML: ProofGeneral.print_intros())
7439 * Pure: New flag trace_unify_fail causes unification to print
7440 diagnostic information (PG: in trace buffer) when it fails. This is
7441 useful for figuring out why single step proofs like rule, erule or
7444 * Pure: Locale specifications now produce predicate definitions
7445 according to the body of text (covering assumptions modulo local
7446 definitions); predicate "loc_axioms" covers newly introduced text,
7447 while "loc" is cumulative wrt. all included locale expressions; the
7448 latter view is presented only on export into the global theory
7449 context; potential INCOMPATIBILITY, use "(open)" option to fall back
7450 on the old view without predicates;
7452 * Pure: predefined locales "var" and "struct" are useful for sharing
7453 parameters (as in CASL, for example); just specify something like
7454 ``var x + var y + struct M'' as import;
7456 * Pure: improved thms_containing: proper indexing of facts instead of
7457 raw theorems; check validity of results wrt. current name space;
7458 include local facts of proof configuration (also covers active
7459 locales), cover fixed variables in index; may use "_" in term
7460 specification; an optional limit for the number of printed facts may
7461 be given (the default is 40);
7463 * Pure: disallow duplicate fact bindings within new-style theory files
7466 * Provers: improved induct method: assumptions introduced by case
7467 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
7468 the goal statement); "foo" still refers to all facts collectively;
7470 * Provers: the function blast.overloaded has been removed: all constants
7471 are regarded as potentially overloaded, which improves robustness in exchange
7472 for slight decrease in efficiency;
7474 * Provers/linorder: New generic prover for transitivity reasoning over
7475 linear orders. Note: this prover is not efficient!
7477 * Isar: preview of problems to finish 'show' now produce an error
7478 rather than just a warning (in interactive mode);
7485 - Produces a counter example if it cannot prove a goal.
7486 Note that the counter example may be spurious if the goal is not a formula
7487 of quantifier-free linear arithmetic.
7488 In ProofGeneral the counter example appears in the trace buffer.
7490 - Knows about div k and mod k where k is a numeral of type nat or int.
7492 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
7493 linear arithmetic fails. This takes account of quantifiers and divisibility.
7494 Presburger arithmetic can also be called explicitly via presburger(_tac).
7496 * simp's arithmetic capabilities have been enhanced a bit: it now
7497 takes ~= in premises into account (by performing a case split);
7499 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
7500 are distributed over a sum of terms;
7502 * New tactic "trans_tac" and method "trans" instantiate
7503 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
7506 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
7507 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
7509 * 'typedef' command has new option "open" to suppress the set
7512 * functions Min and Max on finite sets have been introduced (theory
7515 * attribute [symmetric] now works for relations as well; it turns
7516 (x,y) : R^-1 into (y,x) : R, and vice versa;
7518 * induct over a !!-quantified statement (say !!x1..xn):
7519 each "case" automatically performs "fix x1 .. xn" with exactly those names.
7521 * Map: `empty' is no longer a constant but a syntactic abbreviation for
7522 %x. None. Warning: empty_def now refers to the previously hidden definition
7525 * Algebra: formalization of classical algebra. Intended as base for
7526 any algebraic development in Isabelle. Currently covers group theory
7527 (up to Sylow's theorem) and ring theory (Universal Property of
7528 Univariate Polynomials). Contributions welcome;
7530 * GroupTheory: deleted, since its material has been moved to Algebra;
7532 * Complex: new directory of the complex numbers with numeric constants,
7533 nonstandard complex numbers, and some complex analysis, standard and
7534 nonstandard (Jacques Fleuriot);
7536 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
7538 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
7541 * Real/HahnBanach: updated and adapted to locales;
7543 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
7546 * UNITY: added the Meier-Sanders theory of progress sets;
7548 * MicroJava: bytecode verifier and lightweight bytecode verifier
7549 as abstract algorithms, instantiated to the JVM;
7551 * Bali: Java source language formalization. Type system, operational
7552 semantics, axiomatic semantics. Supported language features:
7553 classes, interfaces, objects,virtual methods, static methods,
7554 static/instance fields, arrays, access modifiers, definite
7555 assignment, exceptions.
7560 * ZF/Constructible: consistency proof for AC (Gdel's constructible
7563 * Main ZF: virtually all theories converted to new-style format;
7568 * Pure: Tactic.prove provides sane interface for internal proofs;
7569 omits the infamous "standard" operation, so this is more appropriate
7570 than prove_goalw_cterm in many situations (e.g. in simprocs);
7572 * Pure: improved error reporting of simprocs;
7574 * Provers: Simplifier.simproc(_i) provides sane interface for setting
7578 *** Document preparation ***
7580 * uses \par instead of \\ for line breaks in theory text. This may
7581 shift some page breaks in large documents. To get the old behaviour
7582 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
7584 * minimized dependencies of isabelle.sty and isabellesym.sty on
7587 * \<euro> now needs package babel/greek instead of marvosym (which
7590 * normal size for \<zero>...\<nine> (uses \mathbf instead of
7595 New in Isabelle2002 (March 2002)
7596 --------------------------------
7598 *** Document preparation ***
7600 * greatly simplified document preparation setup, including more
7601 graceful interpretation of isatool usedir -i/-d/-D options, and more
7602 instructive isatool mkdir; users should basically be able to get
7603 started with "isatool mkdir HOL Test && isatool make"; alternatively,
7604 users may run a separate document processing stage manually like this:
7605 "isatool usedir -D output HOL Test && isatool document Test/output";
7607 * theory dependency graph may now be incorporated into documents;
7608 isatool usedir -g true will produce session_graph.eps/.pdf for use
7609 with \includegraphics of LaTeX;
7611 * proper spacing of consecutive markup elements, especially text
7612 blocks after section headings;
7614 * support bold style (for single symbols only), input syntax is like
7615 this: "\<^bold>\<alpha>" or "\<^bold>A";
7617 * \<bullet> is now output as bold \cdot by default, which looks much
7618 better in printed text;
7620 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
7621 note that these symbols are currently unavailable in Proof General /
7622 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
7624 * isatool latex no longer depends on changed TEXINPUTS, instead
7625 isatool document copies the Isabelle style files to the target
7631 * Pure/Provers: improved proof by cases and induction;
7632 - 'case' command admits impromptu naming of parameters (such as
7634 - 'induct' method divinates rule instantiation from the inductive
7635 claim; no longer requires excessive ?P bindings for proper
7636 instantiation of cases;
7637 - 'induct' method properly enumerates all possibilities of set/type
7638 rules; as a consequence facts may be also passed through *type*
7639 rules without further ado;
7640 - 'induct' method now derives symbolic cases from the *rulified*
7641 rule (before it used to rulify cases stemming from the internal
7642 atomized version); this means that the context of a non-atomic
7643 statement becomes is included in the hypothesis, avoiding the
7644 slightly cumbersome show "PROP ?case" form;
7645 - 'induct' may now use elim-style induction rules without chaining
7646 facts, using ``missing'' premises from the goal state; this allows
7647 rules stemming from inductive sets to be applied in unstructured
7648 scripts, while still benefitting from proper handling of non-atomic
7649 statements; NB: major inductive premises need to be put first, all
7650 the rest of the goal is passed through the induction;
7651 - 'induct' proper support for mutual induction involving non-atomic
7652 rule statements (uses the new concept of simultaneous goals, see
7654 - append all possible rule selections, but only use the first
7655 success (no backtracking);
7656 - removed obsolete "(simplified)" and "(stripped)" options of methods;
7657 - undeclared rule case names default to numbers 1, 2, 3, ...;
7658 - added 'print_induct_rules' (covered by help item in recent Proof
7660 - moved induct/cases attributes to Pure, methods to Provers;
7661 - generic method setup instantiated for FOL and HOL;
7663 * Pure: support multiple simultaneous goal statements, for example
7664 "have a: A and b: B" (same for 'theorem' etc.); being a pure
7665 meta-level mechanism, this acts as if several individual goals had
7666 been stated separately; in particular common proof methods need to be
7667 repeated in order to cover all claims; note that a single elimination
7668 step is *not* sufficient to establish the two conjunctions, so this
7671 assume "A & B" then have A and B .. (*".." fails*)
7673 better use "obtain" in situations as above; alternative refer to
7674 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
7676 * Pure: proper integration with ``locales''; unlike the original
7677 version by Florian Kammller, Isar locales package high-level proof
7678 contexts rather than raw logical ones (e.g. we admit to include
7679 attributes everywhere); operations on locales include merge and
7680 rename; support for implicit arguments (``structures''); simultaneous
7681 type-inference over imports and text; see also HOL/ex/Locales.thy for
7684 * Pure: the following commands have been ``localized'', supporting a
7685 target locale specification "(in name)": 'lemma', 'theorem',
7686 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
7687 stored both within the locale and at the theory level (exported and
7688 qualified by the locale name);
7690 * Pure: theory goals may now be specified in ``long'' form, with
7691 ad-hoc contexts consisting of arbitrary locale elements. for example
7692 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
7693 definitions may be given, too); the result is a meta-level rule with
7694 the context elements being discharged in the obvious way;
7696 * Pure: new proof command 'using' allows to augment currently used
7697 facts after a goal statement ('using' is syntactically analogous to
7698 'apply', but acts on the goal's facts only); this allows chained facts
7699 to be separated into parts given before and after a claim, as in
7700 ``from a and b have C using d and e <proof>'';
7702 * Pure: renamed "antecedent" case to "rule_context";
7704 * Pure: new 'judgment' command records explicit information about the
7705 object-logic embedding (used by several tools internally); no longer
7706 use hard-wired "Trueprop";
7708 * Pure: added 'corollary' command;
7710 * Pure: fixed 'token_translation' command;
7712 * Pure: removed obsolete 'exported' attribute;
7714 * Pure: dummy pattern "_" in is/let is now automatically lifted over
7715 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
7716 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
7718 * Pure: method 'atomize' presents local goal premises as object-level
7719 statements (atomic meta-level propositions); setup controlled via
7720 rewrite rules declarations of 'atomize' attribute; example
7721 application: 'induct' method with proper rule statements in improper
7724 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
7725 now consider the syntactic context of assumptions, giving a better
7726 chance to get type-inference of the arguments right (this is
7727 especially important for locales);
7729 * Pure: "sorry" no longer requires quick_and_dirty in interactive
7732 * Pure/obtain: the formal conclusion "thesis", being marked as
7733 ``internal'', may no longer be reference directly in the text;
7734 potential INCOMPATIBILITY, may need to use "?thesis" in rare
7737 * Pure: generic 'sym' attribute which declares a rule both as pure
7738 'elim?' and for the 'symmetric' operation;
7740 * Pure: marginal comments ``--'' may now occur just anywhere in the
7741 text; the fixed correlation with particular command syntax has been
7744 * Pure: new method 'rules' is particularly well-suited for proof
7745 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
7746 but often produces more compact proof terms with less detours;
7748 * Pure/Provers/classical: simplified integration with pure rule
7749 attributes and methods; the classical "intro?/elim?/dest?"
7750 declarations coincide with the pure ones; the "rule" method no longer
7751 includes classically swapped intros; "intro" and "elim" methods no
7752 longer pick rules from the context; also got rid of ML declarations
7753 AddXIs/AddXEs/AddXDs; all of this has some potential for
7756 * Provers/classical: attribute 'swapped' produces classical inversions
7757 of introduction rules;
7759 * Provers/simplifier: 'simplified' attribute may refer to explicit
7760 rules instead of full simplifier context; 'iff' attribute handles
7763 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
7765 * HOL: 'recdef' now fails on unfinished automated proofs, use
7766 "(permissive)" option to recover old behavior;
7768 * HOL: 'inductive' no longer features separate (collective) attributes
7769 for 'intros' (was found too confusing);
7771 * HOL: properly declared induction rules less_induct and
7777 * HOL: moved over to sane numeral syntax; the new policy is as
7780 - 0 and 1 are polymorphic constants, which are defined on any
7781 numeric type (nat, int, real etc.);
7783 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
7784 binary representation internally;
7786 - type nat has special constructor Suc, and generally prefers Suc 0
7787 over 1::nat and Suc (Suc 0) over 2::nat;
7789 This change may cause significant problems of INCOMPATIBILITY; here
7790 are some hints on converting existing sources:
7792 - due to the new "num" token, "-0" and "-1" etc. are now atomic
7793 entities, so expressions involving "-" (unary or binary minus) need
7794 to be spaced properly;
7796 - existing occurrences of "1" may need to be constraint "1::nat" or
7797 even replaced by Suc 0; similar for old "2";
7799 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
7801 - remove all special provisions on numerals in proofs;
7803 * HOL: simp rules nat_number expand numerals on nat to Suc/0
7804 representation (depends on bin_arith_simps in the default context);
7806 * HOL: symbolic syntax for x^2 (numeral 2);
7808 * HOL: the class of all HOL types is now called "type" rather than
7809 "term"; INCOMPATIBILITY, need to adapt references to this type class
7810 in axclass/classes, instance/arities, and (usually rare) occurrences
7811 in typings (of consts etc.); internally the class is called
7812 "HOL.type", ML programs should refer to HOLogic.typeS;
7814 * HOL/record package improvements:
7815 - new derived operations "fields" to build a partial record section,
7816 "extend" to promote a fixed record to a record scheme, and
7817 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
7818 declared as simp by default;
7819 - shared operations ("more", "fields", etc.) now need to be always
7820 qualified) --- potential INCOMPATIBILITY;
7821 - removed "make_scheme" operations (use "make" with "extend") --
7823 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
7824 - provides cases/induct rules for use with corresponding Isar
7825 methods (for concrete records, record schemes, concrete more
7826 parts, and schematic more parts -- in that order);
7827 - internal definitions directly based on a light-weight abstract
7828 theory of product types over typedef rather than datatype;
7830 * HOL: generic code generator for generating executable ML code from
7831 specifications; specific support for HOL constructs such as inductive
7832 datatypes and sets, as well as recursive functions; can be invoked
7833 via 'generate_code' theory section;
7835 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
7837 * HOL: consolidated and renamed several theories. In particular:
7838 Ord.thy has been absorbed into HOL.thy
7839 String.thy has been absorbed into List.thy
7841 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
7842 (beware of argument permutation!);
7844 * HOL: linorder_less_split superseded by linorder_cases;
7846 * HOL/List: "nodups" renamed to "distinct";
7848 * HOL: added "The" definite description operator; move Hilbert's "Eps"
7849 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
7850 - Ex_def has changed, now need to use some_eq_ex
7852 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
7853 in this (rare) case use:
7855 delSWrapper "split_all_tac"
7856 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
7858 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
7861 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
7862 Isabelle's type classes, ^ on functions and relations has too general
7863 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
7864 necessary to attach explicit type constraints;
7866 * HOL/Relation: the prefix name of the infix "O" has been changed from
7867 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
7868 renamed accordingly (eg "compI" -> "rel_compI").
7870 * HOL: syntax translations now work properly with numerals and records
7873 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
7874 of "lam" -- INCOMPATIBILITY;
7876 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
7877 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
7878 renamed "Product_Type.unit";
7880 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
7882 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
7883 the "cases" method);
7885 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
7888 * HOL/IMP: updated and converted to new-style theory format; several
7889 parts turned into readable document, with proper Isar proof texts and
7890 some explanations (by Gerwin Klein);
7892 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
7894 * HOL-Hyperreal is now a logic image;
7899 * Isar: consts/constdefs supports mixfix syntax for continuous
7902 * Isar: domain package adapted to new-style theory format, e.g. see
7905 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
7906 potential INCOMPATIBILITY; now use plain induct_tac instead of former
7907 lift.induct_tac, always use UU instead of Undef;
7909 * HOLCF/IMP: updated and converted to new-style theory;
7914 * Isar: proper integration of logic-specific tools and packages,
7915 including theory commands '(co)inductive', '(co)datatype',
7916 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
7917 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
7919 * theory Main no longer includes AC; for the Axiom of Choice, base
7920 your theory on Main_ZFC;
7922 * the integer library now covers quotients and remainders, with many
7923 laws relating division to addition, multiplication, etc.;
7925 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
7926 typeless version of the formalism;
7928 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
7931 * ZF/Induct: new directory for examples of inductive definitions,
7932 including theory Multiset for multiset orderings; converted to
7933 new-style theory format;
7935 * ZF: many new theorems about lists, ordinals, etc.;
7940 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
7941 variable proof controls level of detail: 0 = no proofs (only oracle
7942 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
7943 also ref manual for further ML interfaces;
7945 * Pure/axclass: removed obsolete ML interface
7946 goal_subclass/goal_arity;
7948 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
7949 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
7950 separate tokens, so expressions involving minus need to be spaced
7953 * Pure/syntax: support non-oriented infixes, using keyword "infix"
7954 rather than "infixl" or "infixr";
7956 * Pure/syntax: concrete syntax for dummy type variables admits genuine
7957 sort constraint specifications in type inference; e.g. "x::_::foo"
7958 ensures that the type of "x" is of sort "foo" (but not necessarily a
7961 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
7962 control output of nested => (types); the default behavior is
7965 * Pure/syntax: builtin parse translation for "_constify" turns valued
7966 tokens into AST constants;
7968 * Pure/syntax: prefer later declarations of translations and print
7969 translation functions; potential INCOMPATIBILITY: need to reverse
7970 multiple declarations for same syntax element constant;
7972 * Pure/show_hyps reset by default (in accordance to existing Isar
7975 * Provers/classical: renamed addaltern to addafter, addSaltern to
7978 * Provers/clasimp: ``iff'' declarations now handle conditional rules
7981 * system: tested support for MacOS X; should be able to get Isabelle +
7982 Proof General to work in a plain Terminal after installing Poly/ML
7983 (e.g. from the Isabelle distribution area) and GNU bash alone
7984 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
7985 support requires further installations, e.g. from
7986 http://fink.sourceforge.net/);
7988 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
7990 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
7991 of 40 MB), cf. ML_OPTIONS;
7993 * system: Proof General keywords specification is now part of the
7994 Isabelle distribution (see etc/isar-keywords.el);
7996 * system: support for persistent Proof General sessions (refrain from
7997 outdating all loaded theories on startup); user may create writable
7998 logic images like this: ``isabelle -q HOL Test'';
8000 * system: smart selection of Isabelle process versus Isabelle
8001 interface, accommodates case-insensitive file systems (e.g. HFS+); may
8002 run both "isabelle" and "Isabelle" even if file names are badly
8003 damaged (executable inspects the case of the first letter of its own
8004 name); added separate "isabelle-process" and "isabelle-interface";
8006 * system: refrain from any attempt at filtering input streams; no
8007 longer support ``8bit'' encoding of old isabelle font, instead proper
8008 iso-latin characters may now be used; the related isatools
8009 "symbolinput" and "nonascii" have disappeared as well;
8011 * system: removed old "xterm" interface (the print modes "xterm" and
8012 "xterm_color" are still available for direct use in a suitable
8017 New in Isabelle99-2 (February 2001)
8018 -----------------------------------
8020 *** Overview of INCOMPATIBILITIES ***
8022 * HOL: please note that theories in the Library and elsewhere often use the
8023 new-style (Isar) format; to refer to their theorems in an ML script you must
8024 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
8026 * HOL: inductive package no longer splits induction rule aggressively,
8027 but only as far as specified by the introductions given; the old
8028 format may be recovered via ML function complete_split_rule or attribute
8029 'split_rule (complete)';
8031 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
8032 gfp_Tarski to gfp_unfold;
8034 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
8036 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
8037 relation); infix "^^" has been renamed "``"; infix "``" has been
8038 renamed "`"; "univalent" has been renamed "single_valued";
8040 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
8043 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
8045 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
8047 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
8048 consequence, it is no longer monotonic wrt. the local goal context
8049 (which is now passed through the inductive cases);
8051 * Document preparation: renamed standard symbols \<ll> to \<lless> and
8052 \<gg> to \<ggreater>;
8055 *** Document preparation ***
8057 * \isabellestyle{NAME} selects version of Isabelle output (currently
8058 available: are "it" for near math-mode best-style output, "sl" for
8059 slanted text style, and "tt" for plain type-writer; if no
8060 \isabellestyle command is given, output is according to slanted
8063 * support sub/super scripts (for single symbols only), input syntax is
8064 like this: "A\<^sup>*" or "A\<^sup>\<star>";
8066 * some more standard symbols; see Appendix A of the system manual for
8067 the complete list of symbols defined in isabellesym.sty;
8069 * improved isabelle style files; more abstract symbol implementation
8070 (should now use \isamath{...} and \isatext{...} in custom symbol
8073 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
8074 state; Note that presentation of goal states does not conform to
8075 actual human-readable proof documents. Please do not include goal
8076 states into document output unless you really know what you are doing!
8078 * proper indentation of antiquoted output with proportional LaTeX
8081 * no_document ML operator temporarily disables LaTeX document
8084 * isatool unsymbolize tunes sources for plain ASCII communication;
8089 * Pure: Isar now suffers initial goal statements to contain unbound
8090 schematic variables (this does not conform to actual readable proof
8091 documents, due to unpredictable outcome and non-compositional proof
8092 checking); users who know what they are doing may use schematic goals
8093 for Prolog-style synthesis of proven results;
8095 * Pure: assumption method (an implicit finishing) now handles actual
8098 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
8099 initial goal, declare "that" only as Pure intro (only for single
8100 steps); the "that" rule assumption may now be involved in implicit
8101 finishing, thus ".." becomes a feasible for trivial obtains;
8103 * Pure: default proof step now includes 'intro_classes'; thus trivial
8104 instance proofs may be performed by "..";
8106 * Pure: ?thesis / ?this / "..." now work for pure meta-level
8109 * Pure: more robust selection of calculational rules;
8111 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
8112 rule (as well as the assumption rule);
8114 * Pure: 'thm_deps' command visualizes dependencies of theorems and
8115 lemmas, using the graph browser tool;
8117 * Pure: predict failure of "show" in interactive mode;
8119 * Pure: 'thms_containing' now takes actual terms as arguments;
8121 * HOL: improved method 'induct' --- now handles non-atomic goals
8122 (potential INCOMPATIBILITY); tuned error handling;
8124 * HOL: cases and induct rules now provide explicit hints about the
8125 number of facts to be consumed (0 for "type" and 1 for "set" rules);
8126 any remaining facts are inserted into the goal verbatim;
8128 * HOL: local contexts (aka cases) may now contain term bindings as
8129 well; the 'cases' and 'induct' methods new provide a ?case binding for
8130 the result to be shown in each case;
8132 * HOL: added 'recdef_tc' command;
8134 * isatool convert assists in eliminating legacy ML scripts;
8139 * HOL/Library: a collection of generic theories to be used together
8140 with main HOL; the theory loader path already includes this directory
8141 by default; the following existing theories have been moved here:
8142 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
8143 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
8145 * HOL/Unix: "Some aspects of Unix file-system security", a typical
8146 modelling and verification task performed in Isabelle/HOL +
8147 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
8149 * HOL/Algebra: special summation operator SUM no longer exists, it has
8150 been replaced by setsum; infix 'assoc' now has priority 50 (like
8151 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
8152 'domain', this makes the theory consistent with mathematical
8155 * HOL basics: added overloaded operations "inverse" and "divide"
8156 (infix "/"), syntax for generic "abs" operation, generic summation
8159 * HOL/typedef: simplified package, provide more useful rules (see also
8162 * HOL/datatype: induction rule for arbitrarily branching datatypes is
8163 now expressed as a proper nested rule (old-style tactic scripts may
8164 require atomize_strip_tac to cope with non-atomic premises);
8166 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
8167 to "split_conv" (old name still available for compatibility);
8169 * HOL: improved concrete syntax for strings (e.g. allows translation
8170 rules with string literals);
8172 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
8173 and Fleuriot's mechanization of analysis, including the transcendental
8174 functions for the reals;
8176 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
8181 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
8182 "lam" is displayed as TWO lambda-symbols
8184 * CTT: theory Main now available, containing everything (that is, Bool
8190 * Pure: the Simplifier has been implemented properly as a derived rule
8191 outside of the actual kernel (at last!); the overall performance
8192 penalty in practical applications is about 50%, while reliability of
8193 the Isabelle inference kernel has been greatly improved;
8195 * print modes "brackets" and "no_brackets" control output of nested =>
8196 (types) and ==> (props); the default behaviour is "brackets";
8198 * Provers: fast_tac (and friends) now handle actual object-logic rules
8199 as assumptions as well;
8201 * system: support Poly/ML 4.0;
8203 * system: isatool install handles KDE version 1 or 2;
8207 New in Isabelle99-1 (October 2000)
8208 ----------------------------------
8210 *** Overview of INCOMPATIBILITIES ***
8212 * HOL: simplification of natural numbers is much changed; to partly
8213 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
8214 issue the following ML commands:
8216 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
8217 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
8219 * HOL: simplification no longer dives into case-expressions; this is
8220 controlled by "t.weak_case_cong" for each datatype t;
8222 * HOL: nat_less_induct renamed to less_induct;
8224 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
8225 fixsome to patch .thy and .ML sources automatically;
8227 select_equality -> some_equality
8228 select_eq_Ex -> some_eq_ex
8229 selectI2EX -> someI2_ex
8232 select1_equality -> some1_equality
8233 Eps_sym_eq -> some_sym_eq_trivial
8234 Eps_eq -> some_eq_trivial
8236 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
8238 * HOL: removed obsolete theorem binding expand_if (refer to split_if
8241 * HOL: the recursion equations generated by 'recdef' are now called
8242 f.simps instead of f.rules;
8244 * HOL: qed_spec_mp now also handles bounded ALL as well;
8246 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
8247 sometimes be needed;
8249 * HOL: the constant for "f``x" is now "image" rather than "op ``";
8251 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
8253 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
8254 product is now "<*>" instead of "Times"; the lexicographic product is
8255 now "<*lex*>" instead of "**";
8257 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
8258 of main HOL, but was unused); better use HOL's datatype package;
8260 * HOL: removed "symbols" syntax for constant "override" of theory Map;
8261 the old syntax may be recovered as follows:
8264 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
8265 (infixl "\\<oplus>" 100)
8267 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8269 * HOL/ML: even fewer consts are declared as global (see theories Ord,
8270 Lfp, Gfp, WF); this only affects ML packages that refer to const names
8273 * HOL and ZF: syntax for quotienting wrt an equivalence relation
8274 changed from A/r to A//r;
8276 * ZF: new treatment of arithmetic (nat & int) may break some old
8279 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
8280 rulify -> rule_format, elimify -> elim_format, ...);
8282 * Isar/Provers: intro/elim/dest attributes changed; renamed
8283 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
8284 should have to change intro!! to intro? only); replaced "delrule" by
8287 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
8289 * Provers: strengthened force_tac by using new first_best_tac;
8291 * LaTeX document preparation: several changes of isabelle.sty (see
8295 *** Document preparation ***
8297 * formal comments (text blocks etc.) in new-style theories may now
8298 contain antiquotations of thm/prop/term/typ/text to be presented
8299 according to latex print mode; concrete syntax is like this:
8300 @{term[show_types] "f(x) = a + x"};
8302 * isatool mkdir provides easy setup of Isabelle session directories,
8303 including proper document sources;
8305 * generated LaTeX sources are now deleted after successful run
8306 (isatool document -c); may retain a copy somewhere else via -D option
8309 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
8310 style files, achieving self-contained LaTeX sources and simplifying
8313 * old-style theories now produce (crude) LaTeX output as well;
8315 * browser info session directories are now self-contained (may be put
8316 on WWW server seperately); improved graphs of nested sessions; removed
8317 graph for 'all sessions';
8319 * several improvements in isabelle style files; \isabellestyle{it}
8320 produces fake math mode output; \isamarkupheader is now \section by
8321 default; see lib/texinputs/isabelle.sty etc.;
8326 * Isar/Pure: local results and corresponding term bindings are now
8327 subject to Hindley-Milner polymorphism (similar to ML); this
8328 accommodates incremental type-inference very nicely;
8330 * Isar/Pure: new derived language element 'obtain' supports
8331 generalized existence reasoning;
8333 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
8334 support accumulation of results, without applying any rules yet;
8335 useful to collect intermediate results without explicit name
8336 references, and for use with transitivity rules with more than 2
8339 * Isar/Pure: scalable support for case-analysis type proofs: new
8340 'case' language element refers to local contexts symbolically, as
8341 produced by certain proof methods; internally, case names are attached
8342 to theorems as "tags";
8344 * Isar/Pure: theory command 'hide' removes declarations from
8345 class/type/const name spaces;
8347 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
8348 indicate potential overloading;
8350 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
8352 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
8353 "{a,b,c}" instead of {a,b,c};
8355 * Isar/Pure now provides its own version of intro/elim/dest
8356 attributes; useful for building new logics, but beware of confusion
8357 with the version in Provers/classical;
8359 * Isar/Pure: the local context of (non-atomic) goals is provided via
8360 case name 'antecedent';
8362 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
8363 to the current context is now done automatically);
8365 * Isar/Pure: theory command 'method_setup' provides a simple interface
8366 for definining proof methods in ML;
8368 * Isar/Provers: intro/elim/dest attributes changed; renamed
8369 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
8370 most cases, one should have to change intro!! to intro? only);
8371 replaced "delrule" by "rule del";
8373 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
8374 'symmetric' attribute (the latter supercedes [RS sym]);
8376 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
8377 method modifier); 'simp' method: 'only:' modifier removes loopers as
8378 well (including splits);
8380 * Isar/Provers: Simplifier and Classical methods now support all kind
8381 of modifiers used in the past, including 'cong', 'iff', etc.
8383 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
8384 of Simplifier and Classical reasoner);
8386 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
8387 now support named cases; major packages (inductive, datatype, primrec,
8388 recdef) support case names and properly name parameters;
8390 * Isar/HOL: new transitivity rules for substitution in inequalities --
8391 monotonicity conditions are extracted to be proven at end of
8394 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
8397 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
8398 split_if split_if_asm; datatype package provides theorems foo.splits =
8399 foo.split foo.split_asm for each datatype;
8401 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
8402 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
8403 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
8404 use "(cases (simplified))" method in proper proof texts);
8406 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
8408 * Isar: names of theorems etc. may be natural numbers as well;
8410 * Isar: 'pr' command: optional arguments for goals_limit and
8411 ProofContext.prems_limit; no longer prints theory contexts, but only
8414 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
8415 additional print modes to be specified; e.g. "pr(latex)" will print
8416 proof state according to the Isabelle LaTeX style;
8418 * Isar: improved support for emulating tactic scripts, including proof
8419 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
8420 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
8421 (for HOL datatypes);
8423 * Isar: simplified (more robust) goal selection of proof methods: 1st
8424 goal, all goals, or explicit goal specifier (tactic emulation); thus
8425 'proof method scripts' have to be in depth-first order;
8427 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
8429 * Isar: removed 'help' command, which hasn't been too helpful anyway;
8430 should instead use individual commands for printing items
8431 (print_commands, print_methods etc.);
8433 * Isar: added 'nothing' --- the empty list of theorems;
8438 * HOL/MicroJava: formalization of a fragment of Java, together with a
8439 corresponding virtual machine and a specification of its bytecode
8440 verifier and a lightweight bytecode verifier, including proofs of
8441 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
8442 Cornelia Pusch (see also the homepage of project Bali at
8443 http://isabelle.in.tum.de/Bali/);
8445 * HOL/Algebra: new theory of rings and univariate polynomials, by
8448 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
8449 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
8452 * HOL/Lattice: fundamental concepts of lattice theory and order
8453 structures, including duals, properties of bounds versus algebraic
8454 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
8455 Theorem for complete lattices etc.; may also serve as a demonstration
8456 for abstract algebraic reasoning using axiomatic type classes, and
8457 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
8459 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
8462 * HOL/IMPP: extension of IMP with local variables and mutually
8463 recursive procedures, by David von Oheimb;
8465 * HOL/Lambda: converted into new-style theory and document;
8467 * HOL/ex/Multiquote: example of multiple nested quotations and
8468 anti-quotations -- basically a generalized version of de-Bruijn
8469 representation; very useful in avoiding lifting of operations;
8471 * HOL/record: added general record equality rule to simpset; fixed
8472 select-update simplification procedure to handle extended records as
8473 well; admit "r" as field name;
8475 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
8476 other numeric types and also as the identity of groups, rings, etc.;
8478 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
8479 Types nat and int belong to this axclass;
8481 * HOL: greatly improved simplification involving numerals of type nat, int, real:
8482 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
8483 i*j + k + j*#3*i simplifies to #4*(i*j) + k
8484 two terms #m*u and #n*u are replaced by #(m+n)*u
8485 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
8486 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
8487 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
8489 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
8490 powerful prover for predicate logic but knows nothing of clasets; see
8491 ex/mesontest.ML and ex/mesontest2.ML for example applications;
8493 * HOL: new version of "case_tac" subsumes both boolean case split and
8494 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
8495 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
8497 * HOL: simplification no longer dives into case-expressions: only the
8498 selector expression is simplified, but not the remaining arms; to
8499 enable full simplification of case-expressions for datatype t, you may
8500 remove t.weak_case_cong from the simpset, either globally (Delcongs
8501 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
8503 * HOL/recdef: the recursion equations generated by 'recdef' for
8504 function 'f' are now called f.simps instead of f.rules; if all
8505 termination conditions are proved automatically, these simplification
8506 rules are added to the simpset, as in primrec; rules may be named
8507 individually as well, resulting in a separate list of theorems for
8510 * HOL/While is a new theory that provides a while-combinator. It
8511 permits the definition of tail-recursive functions without the
8512 provision of a termination measure. The latter is necessary once the
8513 invariant proof rule for while is applied.
8515 * HOL: new (overloaded) notation for the set of elements below/above
8516 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
8518 * HOL: theorems impI, allI, ballI bound as "strip";
8520 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
8521 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
8522 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
8524 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8526 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
8527 main HOL, but was unused);
8529 * HOL: fewer consts declared as global (e.g. have to refer to
8530 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
8532 * HOL: tuned AST representation of nested pairs, avoiding bogus output
8533 in case of overlap with user translations (e.g. judgements over
8534 tuples); (note that the underlying logical represenation is still
8540 * ZF: simplification automatically cancels common terms in arithmetic
8541 expressions over nat and int;
8543 * ZF: new treatment of nat to minimize type-checking: all operators
8544 coerce their operands to a natural number using the function natify,
8545 making the algebraic laws unconditional;
8547 * ZF: as above, for int: operators coerce their operands to an integer
8548 using the function intify;
8550 * ZF: the integer library now contains many of the usual laws for the
8551 orderings, including $<=, and monotonicity laws for $+ and $*;
8553 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
8556 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
8557 to the simplifier and classical reasoner simultaneously;
8562 * Provers: blast_tac now handles actual object-logic rules as
8563 assumptions; note that auto_tac uses blast_tac internally as well;
8565 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
8566 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
8568 * Provers: delrules now handles destruct rules as well (no longer need
8569 explicit make_elim);
8571 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
8572 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8573 use instead the strong form,
8574 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8575 in HOL, FOL and ZF the function cla_make_elim will create such rules
8576 from destruct-rules;
8578 * Provers: Simplifier.easy_setup provides a fast path to basic
8579 Simplifier setup for new object-logics;
8581 * Pure: AST translation rules no longer require constant head on LHS;
8583 * Pure: improved name spaces: ambiguous output is qualified; support
8584 for hiding of names;
8586 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
8587 XSYMBOL_HOME; no longer need to do manual configuration in most
8590 * system: compression of ML heaps images may now be controlled via -c
8591 option of isabelle and isatool usedir (currently only observed by
8594 * system: isatool installfonts may handle X-Symbol fonts as well (very
8595 useful for remote X11);
8597 * system: provide TAGS file for Isabelle sources;
8599 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
8602 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
8603 timing flag supersedes proof_timing and Toplevel.trace;
8605 * ML: new combinators |>> and |>>> for incremental transformations
8606 with secondary results (e.g. certain theory extensions):
8608 * ML: PureThy.add_defs gets additional argument to indicate potential
8609 overloading (usually false);
8611 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
8616 New in Isabelle99 (October 1999)
8617 --------------------------------
8619 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8621 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
8622 are no longer simplified. (This allows the simplifier to unfold recursive
8623 functional programs.) To restore the old behaviour, declare
8625 Delcongs [if_weak_cong];
8627 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
8630 * HOL: the predicate "inj" is now defined by translation to "inj_on";
8632 * HOL/datatype: mutual_induct_tac no longer exists --
8633 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
8635 * HOL/typedef: fixed type inference for representing set; type
8636 arguments now have to occur explicitly on the rhs as type constraints;
8638 * ZF: The con_defs part of an inductive definition may no longer refer
8639 to constants declared in the same theory;
8641 * HOL, ZF: the function mk_cases, generated by the inductive
8642 definition package, has lost an argument. To simplify its result, it
8643 uses the default simpset instead of a supplied list of theorems.
8645 * HOL/List: the constructors of type list are now Nil and Cons;
8647 * Simplifier: the type of the infix ML functions
8648 setSSolver addSSolver setSolver addSolver
8649 is now simpset * solver -> simpset where `solver' is a new abstract type
8650 for packaging solvers. A solver is created via
8651 mk_solver: string -> (thm list -> int -> tactic) -> solver
8652 where the string argument is only a comment.
8657 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
8658 decision procedure for linear arithmetic. Currently it is used for
8659 types `nat', `int', and `real' in HOL (see below); it can, should and
8660 will be instantiated for other types and logics as well.
8662 * The simplifier now accepts rewrite rules with flexible heads, eg
8663 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
8664 They are applied like any rule with a non-pattern lhs, i.e. by first-order
8670 * New Isabelle/Isar subsystem provides an alternative to traditional
8671 tactical theorem proving; together with the ProofGeneral/isar user
8672 interface it offers an interactive environment for developing human
8673 readable proof documents (Isar == Intelligible semi-automated
8674 reasoning); for further information see isatool doc isar-ref,
8675 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
8677 * improved and simplified presentation of theories: better HTML markup
8678 (including colors), graph views in several sizes; isatool usedir now
8679 provides a proper interface for user theories (via -P option); actual
8680 document preparation based on (PDF)LaTeX is available as well (for
8681 new-style theories only); see isatool doc system for more information;
8683 * native support for Proof General, both for classic Isabelle and
8686 * ML function thm_deps visualizes dependencies of theorems and lemmas,
8687 using the graph browser tool;
8689 * Isabelle manuals now also available as PDF;
8691 * theory loader rewritten from scratch (may not be fully
8692 bug-compatible); old loadpath variable has been replaced by show_path,
8693 add_path, del_path, reset_path functions; new operations such as
8694 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
8697 * improved isatool install: option -k creates KDE application icon,
8698 option -p DIR installs standalone binaries;
8700 * added ML_PLATFORM setting (useful for cross-platform installations);
8701 more robust handling of platform specific ML images for SML/NJ;
8703 * the settings environment is now statically scoped, i.e. it is never
8704 created again in sub-processes invoked from isabelle, isatool, or
8707 * path element specification '~~' refers to '$ISABELLE_HOME';
8709 * in locales, the "assumes" and "defines" parts may be omitted if
8712 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
8715 * new print_mode "HTML";
8717 * new flag show_tags controls display of tags of theorems (which are
8718 basically just comments that may be attached by some tools);
8720 * Isamode 2.6 requires patch to accomodate change of Isabelle font
8721 mode and goal output format:
8723 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
8725 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
8727 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
8728 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
8730 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
8732 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
8734 * function bind_thms stores lists of theorems (cf. bind_thm);
8736 * new shorthand tactics ftac, eatac, datac, fatac;
8738 * qed (and friends) now accept "" as result name; in that case the
8739 theorem is not stored, but proper checks and presentation of the
8742 * theorem database now also indexes constants "Trueprop", "all",
8743 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
8748 ** HOL arithmetic **
8750 * There are now decision procedures for linear arithmetic over nat and
8753 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
8754 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
8755 are treated as atomic; subformulae not involving type `nat' or `int'
8756 are ignored; quantified subformulae are ignored unless they are
8757 positive universal or negative existential. The tactic has to be
8758 invoked by hand and can be a little bit slow. In particular, the
8759 running time is exponential in the number of occurrences of `min' and
8760 `max', and `-' on `nat'.
8762 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
8763 (negated) (in)equalities among the premises and the conclusion into
8764 account (i.e. no compound formulae) and does not know about `min' and
8765 `max', and `-' on `nat'. It is fast and is used automatically by the
8768 NB: At the moment, these decision procedures do not cope with mixed
8769 nat/int formulae where the two parts interact, such as `m < n ==>
8772 * HOL/Numeral provides a generic theory of numerals (encoded
8773 efficiently as bit strings); setup for types nat/int/real is in place;
8774 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
8775 int, existing theories and proof scripts may require a few additional
8778 * integer division and remainder can now be performed on constant
8781 * many properties of integer multiplication, division and remainder
8784 * An interface to the Stanford Validity Checker (SVC) is available through the
8785 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
8786 are proved automatically. SVC must be installed separately, and its results
8787 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
8788 invocation of the underlying oracle). For SVC see
8789 http://verify.stanford.edu/SVC
8791 * IsaMakefile: the HOL-Real target now builds an actual image;
8796 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
8797 (in Isabelle/Isar) -- by Gertrud Bauer;
8799 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
8800 analysis for assembly languages with subtypes;
8802 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
8803 -- avoids syntactic ambiguities and treats state, transition, and
8804 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
8805 changed syntax and (many) tactics;
8807 * HOL/inductive: Now also handles more general introduction rules such
8808 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
8809 theorems are now maintained within the theory (maintained via the
8812 * HOL/datatype: Now also handles arbitrarily branching datatypes
8813 (using function types) such as
8815 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
8817 * HOL/record: record_simproc (part of the default simpset) takes care
8818 of selectors applied to updated records; record_split_tac is no longer
8819 part of the default claset; update_defs may now be removed from the
8820 simpset in many cases; COMPATIBILITY: old behavior achieved by
8822 claset_ref () := claset() addSWrapper record_split_wrapper;
8823 Delsimprocs [record_simproc]
8825 * HOL/typedef: fixed type inference for representing set; type
8826 arguments now have to occur explicitly on the rhs as type constraints;
8828 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
8829 names rather than an ML expression;
8831 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
8832 supplied later. Program schemes can be defined, such as
8833 "While B C s = (if B s then While B C (C s) else s)"
8834 where the well-founded relation can be chosen after B and C have been given.
8836 * HOL/List: the constructors of type list are now Nil and Cons;
8837 INCOMPATIBILITY: while [] and infix # syntax is still there, of
8838 course, ML tools referring to List.list.op # etc. have to be adapted;
8840 * HOL_quantifiers flag superseded by "HOL" print mode, which is
8841 disabled by default; run isabelle with option -m HOL to get back to
8842 the original Gordon/HOL-style output;
8844 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
8845 ALL x<=y. P, EX x<y. P, EX x<=y. P;
8847 * HOL basic syntax simplified (more orthogonal): all variants of
8848 All/Ex now support plain / symbolic / HOL notation; plain syntax for
8849 Eps operator is provided as well: "SOME x. P[x]";
8851 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
8853 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
8854 thus available for user theories;
8856 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
8857 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
8860 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
8861 several times and then mp;
8866 * the notation <<...>> is now available as a notation for sequences of
8869 * the simplifier is now installed
8871 * the axiom system has been generalized (thanks to Soren Heilmann)
8873 * the classical reasoner now has a default rule database
8878 * new primrec section allows primitive recursive functions to be given
8879 directly (as in HOL) over datatypes and the natural numbers;
8881 * new tactics induct_tac and exhaust_tac for induction (or case
8882 analysis) over datatypes and the natural numbers;
8884 * the datatype declaration of type T now defines the recursor T_rec;
8886 * simplification automatically does freeness reasoning for datatype
8889 * automatic type-inference, with AddTCs command to insert new
8890 type-checking rules;
8892 * datatype introduction rules are now added as Safe Introduction rules
8895 * the syntax "if P then x else y" is now available in addition to
8899 *** Internal programming interfaces ***
8901 * tuned simplifier trace output; new flag debug_simp;
8903 * structures Vartab / Termtab (instances of TableFun) offer efficient
8904 tables indexed by indexname_ord / term_ord (compatible with aconv);
8906 * AxClass.axclass_tac lost the theory argument;
8908 * tuned current_goals_markers semantics: begin / end goal avoids
8909 printing empty lines;
8911 * removed prs and prs_fn hook, which was broken because it did not
8912 include \n in its semantics, forcing writeln to add one
8913 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
8914 string -> unit if you really want to output text without newline;
8916 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
8917 plain output, interface builders may have to enable 'isabelle_font'
8918 mode to get Isabelle font glyphs as before;
8920 * refined token_translation interface; INCOMPATIBILITY: output length
8921 now of type real instead of int;
8923 * theory loader actions may be traced via new ThyInfo.add_hook
8924 interface (see src/Pure/Thy/thy_info.ML); example application: keep
8925 your own database of information attached to *whole* theories -- as
8926 opposed to intra-theory data slots offered via TheoryDataFun;
8928 * proper handling of dangling sort hypotheses (at last!);
8929 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
8930 extra sort hypotheses that can be witnessed from the type signature;
8931 the force_strip_shyps flag is gone, any remaining shyps are simply
8932 left in the theorem (with a warning issued by strip_shyps_warning);
8936 New in Isabelle98-1 (October 1998)
8937 ----------------------------------
8939 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8941 * several changes of automated proof tools;
8943 * HOL: major changes to the inductive and datatype packages, including
8944 some minor incompatibilities of theory syntax;
8946 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
8949 * HOL: removed duplicate thms in Arith:
8950 less_imp_add_less should be replaced by trans_less_add1
8951 le_imp_add_le should be replaced by trans_le_add1
8953 * HOL: unary minus is now overloaded (new type constraints may be
8956 * HOL and ZF: unary minus for integers is now #- instead of #~. In
8957 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
8958 now taken as an integer constant.
8960 * Pure: ML function 'theory_of' renamed to 'theory';
8966 1. Asm_full_simp_tac is now more aggressive.
8967 1. It will sometimes reorient premises if that increases their power to
8969 2. It does no longer proceed strictly from left to right but may also
8970 rotate premises to achieve further simplification.
8971 For compatibility reasons there is now Asm_lr_simp_tac which is like the
8972 old Asm_full_simp_tac in that it does not rotate premises.
8973 2. The simplifier now knows a little bit about nat-arithmetic.
8975 * Classical reasoner: wrapper mechanism for the classical reasoner now
8976 allows for selected deletion of wrappers, by introduction of names for
8977 wrapper functionals. This implies that addbefore, addSbefore,
8978 addaltern, and addSaltern now take a pair (name, tactic) as argument,
8979 and that adding two tactics with the same name overwrites the first
8980 one (emitting a warning).
8981 type wrapper = (int -> tactic) -> (int -> tactic)
8982 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
8983 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
8984 delWrapper, delSWrapper: claset * string -> claset
8985 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
8987 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
8988 semantics; addbefore now affects only the unsafe part of step_tac
8989 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
8990 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
8993 * Classical reasoner: setwrapper to setWrapper and compwrapper to
8994 compWrapper; added safe wrapper (and access functions for it);
8996 * HOL/split_all_tac is now much faster and fails if there is nothing
8997 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
8998 and the names of the automatically generated variables have changed.
8999 split_all_tac has moved within claset() from unsafe wrappers to safe
9000 wrappers, which means that !!-bound variables are split much more
9001 aggressively, and safe_tac and clarify_tac now split such variables.
9002 If this splitting is not appropriate, use delSWrapper "split_all_tac".
9003 Note: the same holds for record_split_tac, which does the job of
9004 split_all_tac for record fields.
9006 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
9007 permanently to the default simpset using Addsplits just like
9008 Addsimps. They can be removed via Delsplits just like
9009 Delsimps. Lower-case versions are also available.
9011 * HOL/Simplifier: The rule split_if is now part of the default
9012 simpset. This means that the simplifier will eliminate all occurrences
9013 of if-then-else in the conclusion of a goal. To prevent this, you can
9014 either remove split_if completely from the default simpset by
9015 `Delsplits [split_if]' or remove it in a specific call of the
9016 simplifier using `... delsplits [split_if]'. You can also add/delete
9017 other case splitting rules to/from the default simpset: every datatype
9018 generates suitable rules `split_t_case' and `split_t_case_asm' (where
9019 t is the name of the datatype).
9021 * Classical reasoner / Simplifier combination: new force_tac (and
9022 derivatives Force_tac, force) combines rewriting and classical
9023 reasoning (and whatever other tools) similarly to auto_tac, but is
9024 aimed to solve the given subgoal completely.
9029 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
9030 and `goalw': the theory is no longer needed as an explicit argument -
9031 the current theory context is used; assumptions are no longer returned
9032 at the ML-level unless one of them starts with ==> or !!; it is
9033 recommended to convert to these new commands using isatool fixgoal
9034 (backup your sources first!);
9036 * new top-level commands 'thm' and 'thms' for retrieving theorems from
9037 the current theory context, and 'theory' to lookup stored theories;
9039 * new theory section 'locale' for declaring constants, assumptions and
9040 definitions that have local scope;
9042 * new theory section 'nonterminals' for purely syntactic types;
9044 * new theory section 'setup' for generic ML setup functions
9045 (e.g. package initialization);
9047 * the distribution now includes Isabelle icons: see
9048 lib/logo/isabelle-{small,tiny}.xpm;
9050 * isatool install - install binaries with absolute references to
9053 * isatool logo -- create instances of the Isabelle logo (as EPS);
9055 * print mode 'emacs' reserved for Isamode;
9057 * support multiple print (ast) translations per constant name;
9059 * theorems involving oracles are now printed with a suffixed [!];
9064 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
9066 * HOL/inductive package reorganized and improved: now supports mutual
9072 oddI "n : EVEN ==> Suc n : ODD"
9073 evenI "n : ODD ==> Suc n : EVEN"
9075 new theorem list "elims" contains an elimination rule for each of the
9076 recursive sets; inductive definitions now handle disjunctive premises
9077 correctly (also ZF);
9079 INCOMPATIBILITIES: requires Inductive as an ancestor; component
9080 "mutual_induct" no longer exists - the induction rule is always
9081 contained in "induct";
9084 * HOL/datatype package re-implemented and greatly improved: now
9085 supports mutually recursive datatypes such as
9088 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
9089 | SUM ('a aexp) ('a aexp)
9090 | DIFF ('a aexp) ('a aexp)
9093 'a bexp = LESS ('a aexp) ('a aexp)
9094 | AND ('a bexp) ('a bexp)
9095 | OR ('a bexp) ('a bexp)
9097 as well as indirectly recursive datatypes such as
9100 ('a, 'b) term = Var 'a
9101 | App 'b ((('a, 'b) term) list)
9103 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
9104 induction on mutually / indirectly recursive datatypes.
9106 Primrec equations are now stored in theory and can be accessed via
9107 <function_name>.simps.
9111 - Theories using datatypes must now have theory Datatype as an
9113 - The specific <typename>.induct_tac no longer exists - use the
9114 generic induct_tac instead.
9115 - natE has been renamed to nat.exhaust - use exhaust_tac
9116 instead of res_inst_tac ... natE. Note that the variable
9117 names in nat.exhaust differ from the names in natE, this
9118 may cause some "fragile" proofs to fail.
9119 - The theorems split_<typename>_case and split_<typename>_case_asm
9120 have been renamed to <typename>.split and <typename>.split_asm.
9121 - Since default sorts of type variables are now handled correctly,
9122 some datatype definitions may have to be annotated with explicit
9124 - Primrec definitions no longer require function name and type
9125 of recursive argument.
9127 Consider using isatool fixdatatype to adapt your theories and proof
9128 scripts to the new package (backup your sources first!).
9131 * HOL/record package: considerably improved implementation; now
9132 includes concrete syntax for record types, terms, updates; theorems
9133 for surjective pairing and splitting !!-bound record variables; proof
9134 support is as follows:
9136 1) standard conversions (selectors or updates applied to record
9137 constructor terms) are part of the standard simpset;
9139 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
9140 made part of standard simpset and claset via addIffs;
9142 3) a tactic for record field splitting (record_split_tac) is part of
9143 the standard claset (addSWrapper);
9145 To get a better idea about these rules you may retrieve them via
9146 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
9147 the name of your record type.
9149 The split tactic 3) conceptually simplifies by the following rule:
9151 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
9153 Thus any record variable that is bound by meta-all will automatically
9154 blow up into some record constructor term, consequently the
9155 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
9156 solve record problems automatically.
9159 * reorganized the main HOL image: HOL/Integ and String loaded by
9160 default; theory Main includes everything;
9162 * automatic simplification of integer sums and comparisons, using cancellation;
9164 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
9166 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
9168 * many new identities for unions, intersections, set difference, etc.;
9170 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
9171 called split_if, split_split, split_sum_case and split_nat_case (to go
9172 with add/delsplits);
9174 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
9175 (?x::unit) = (); this is made part of the default simpset, which COULD
9176 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
9177 'Delsimprocs [unit_eq_proc];' as last resort); also note that
9178 unit_abs_eta_conv is added in order to counter the effect of
9179 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
9182 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
9185 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9186 It and 'sym RS equals0D' are now in the default claset, giving automatic
9187 disjointness reasoning but breaking a few old proofs.
9189 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
9190 to 'converse' from 'inverse' (for compatibility with ZF and some
9193 * HOL/recdef can now declare non-recursive functions, with {} supplied as
9194 the well-founded relation;
9196 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
9197 Compl A. The "Compl" syntax remains available as input syntax for this
9200 * HOL/Update: new theory of function updates:
9201 f(a:=b) == %x. if x=a then b else f x
9202 may also be iterated as in f(a:=b,c:=d,...);
9204 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
9207 - new function list_update written xs[i:=v] that updates the i-th
9208 list position. May also be iterated as in xs[i:=a,j:=b,...].
9209 - new function `upt' written [i..j(] which generates the list
9210 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
9211 bound write [i..j], which is a shorthand for [i..j+1(].
9212 - new lexicographic orderings and corresponding wellfoundedness theorems.
9215 - removed 'pred' (predecessor) function;
9216 - generalized some theorems about n-1;
9217 - many new laws about "div" and "mod";
9218 - new laws about greatest common divisors (see theory ex/Primes);
9220 * HOL/Relation: renamed the relational operator r^-1 "converse"
9221 instead of "inverse";
9223 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
9224 of the multiset ordering;
9226 * directory HOL/Real: a construction of the reals using Dedekind cuts
9227 (not included by default);
9229 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
9231 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
9232 programs, i.e. different program variables may have different types.
9234 * calling (stac rew i) now fails if "rew" has no effect on the goal
9235 [previously, this check worked only if the rewrite rule was unconditional]
9236 Now rew can involve either definitions or equalities (either == or =).
9241 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
9242 only the theorems proved on ZF.ML;
9244 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9245 It and 'sym RS equals0D' are now in the default claset, giving automatic
9246 disjointness reasoning but breaking a few old proofs.
9248 * ZF/Update: new theory of function updates
9249 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
9250 may also be iterated as in f(a:=b,c:=d,...);
9252 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
9254 * calling (stac rew i) now fails if "rew" has no effect on the goal
9255 [previously, this check worked only if the rewrite rule was unconditional]
9256 Now rew can involve either definitions or equalities (either == or =).
9258 * case_tac provided for compatibility with HOL
9259 (like the old excluded_middle_tac, but with subgoals swapped)
9262 *** Internal programming interfaces ***
9264 * Pure: several new basic modules made available for general use, see
9265 also src/Pure/README;
9267 * improved the theory data mechanism to support encapsulation (data
9268 kind name replaced by private Object.kind, acting as authorization
9269 key); new type-safe user interface via functor TheoryDataFun; generic
9270 print_data function becomes basically useless;
9272 * removed global_names compatibility flag -- all theory declarations
9273 are qualified by default;
9275 * module Pure/Syntax now offers quote / antiquote translation
9276 functions (useful for Hoare logic etc. with implicit dependencies);
9277 see HOL/ex/Antiquote for an example use;
9279 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
9282 * new tactical CHANGED_GOAL for checking that a tactic modifies a
9285 * Display.print_goals function moved to Locale.print_goals;
9287 * standard print function for goals supports current_goals_markers
9288 variable for marking begin of proof, end of proof, start of goal; the
9289 default is ("", "", ""); setting current_goals_markers := ("<proof>",
9290 "</proof>", "<goal>") causes SGML like tagged proof state printing,
9295 New in Isabelle98 (January 1998)
9296 --------------------------------
9298 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9300 * changed lexical syntax of terms / types: dots made part of long
9301 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
9303 * simpset (and claset) reference variable replaced by functions
9304 simpset / simpset_ref;
9306 * no longer supports theory aliases (via merge) and non-trivial
9307 implicit merge of thms' signatures;
9309 * most internal names of constants changed due to qualified names;
9311 * changed Pure/Sequence interface (see Pure/seq.ML);
9314 *** General Changes ***
9316 * hierachically structured name spaces (for consts, types, axms, thms
9317 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
9318 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
9319 isatool fixdots ensures space after dots (e.g. "%x. x"); set
9320 long_names for fully qualified output names; NOTE: ML programs
9321 (special tactics, packages etc.) referring to internal names may have
9322 to be adapted to cope with fully qualified names; in case of severe
9323 backward campatibility problems try setting 'global_names' at compile
9324 time to have enrything declared within a flat name space; one may also
9325 fine tune name declarations in theories via the 'global' and 'local'
9328 * reimplemented the implicit simpset and claset using the new anytype
9329 data filed in signatures; references simpset:simpset ref etc. are
9330 replaced by functions simpset:unit->simpset and
9331 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
9332 to patch your ML files accordingly;
9334 * HTML output now includes theory graph data for display with Java
9335 applet or isatool browser; data generated automatically via isatool
9336 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
9338 * defs may now be conditional; improved rewrite_goals_tac to handle
9339 conditional equations;
9341 * defs now admits additional type arguments, using TYPE('a) syntax;
9343 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
9344 creates a new theory node; implicit merge of thms' signatures is
9345 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
9346 transfer:theory->thm->thm in (rare) cases;
9348 * improved handling of draft signatures / theories; draft thms (and
9349 ctyps, cterms) are automatically promoted to real ones;
9351 * slightly changed interfaces for oracles: admit many per theory, named
9352 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
9354 * print_goals: optional output of const types (set show_consts and
9357 * improved output of warnings (###) and errors (***);
9359 * subgoal_tac displays a warning if the new subgoal has type variables;
9361 * removed old README and Makefiles;
9363 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
9365 * removed obsolete init_pps and init_database;
9367 * deleted the obsolete tactical STATE, which was declared by
9368 fun STATE tacfun st = tacfun st st;
9370 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
9371 (which abbreviates $HOME);
9373 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
9374 use isatool fixseq to adapt your ML programs (this works for fully
9375 qualified references to the Sequence structure only!);
9377 * use_thy no longer requires writable current directory; it always
9378 reloads .ML *and* .thy file, if either one is out of date;
9381 *** Classical Reasoner ***
9383 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
9384 tactics that use classical reasoning to simplify a subgoal without
9385 splitting it into several subgoals;
9387 * Safe_tac: like safe_tac but uses the default claset;
9392 * added simplification meta rules:
9393 (asm_)(full_)simplify: simpset -> thm -> thm;
9395 * simplifier.ML no longer part of Pure -- has to be loaded by object
9398 * added prems argument to simplification procedures;
9400 * HOL, FOL, ZF: added infix function `addsplits':
9401 instead of `<simpset> setloop (split_tac <thms>)'
9402 you can simply write `<simpset> addsplits <thms>'
9407 * TYPE('a) syntax for type reflection terms;
9409 * no longer handles consts with name "" -- declare as 'syntax' instead;
9411 * pretty printer: changed order of mixfix annotation preference (again!);
9413 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
9418 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
9419 with `addloop' of the simplifier to faciliate case splitting in premises.
9421 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
9423 * HOL/Auth: new protocol proofs including some for the Internet
9426 * HOL/Map: new theory of `maps' a la VDM;
9428 * HOL/simplifier: simplification procedures nat_cancel_sums for
9429 cancelling out common nat summands from =, <, <= (in)equalities, or
9430 differences; simplification procedures nat_cancel_factor for
9431 cancelling common factor from =, <, <= (in)equalities over natural
9432 sums; nat_cancel contains both kinds of procedures, it is installed by
9433 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
9435 * HOL/simplifier: terms of the form
9436 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
9438 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
9439 and those of the form
9440 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
9442 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
9445 Each datatype `t' now comes with a theorem `split_t_case' of the form
9447 P(t_case f1 ... fn x) =
9448 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
9450 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
9453 and a theorem `split_t_case_asm' of the form
9455 P(t_case f1 ... fn x) =
9456 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
9458 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
9460 which can be added to a simpset via `addsplits'. The existing theorems
9461 expand_list_case and expand_option_case have been renamed to
9462 split_list_case and split_option_case.
9465 - `pred n' is automatically converted to `n-1'.
9466 Users are strongly encouraged not to use `pred' any longer,
9467 because it will disappear altogether at some point.
9468 - Users are strongly encouraged to write "0 < n" rather than
9469 "n ~= 0". Theorems and proof tools have been modified towards this
9473 the function "set_of_list" has been renamed "set" (and its theorems too);
9474 the function "nth" now takes its arguments in the reverse order and
9475 has acquired the infix notation "!" as in "xs!n".
9477 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
9479 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
9480 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
9482 * HOL/record: extensible records with schematic structural subtyping
9483 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
9484 still lacks various theorems and concrete record syntax;
9489 * removed "axioms" and "generated by" sections;
9491 * replaced "ops" section by extended "consts" section, which is capable of
9492 handling the continuous function space "->" directly;
9495 . proves theorems immediately and stores them in the theory,
9496 . creates hierachical name space,
9497 . now uses normal mixfix annotations (instead of cinfix...),
9498 . minor changes to some names and values (for consistency),
9499 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
9500 . separator between mutual domain defs: changed "," to "and",
9501 . improved handling of sort constraints; now they have to
9502 appear on the left-hand side of the equations only;
9504 * fixed LAM <x,y,zs>.b syntax;
9506 * added extended adm_tac to simplifier in HOLCF -- can now discharge
9507 adm (%x. P (t x)), where P is chainfinite and t continuous;
9512 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
9513 with `addloop' of the simplifier to faciliate case splitting in premises.
9515 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
9516 in HOL, they strip ALL and --> from proved theorems;
9520 New in Isabelle94-8 (May 1997)
9521 ------------------------------
9523 *** General Changes ***
9525 * new utilities to build / run / maintain Isabelle etc. (in parts
9526 still somewhat experimental); old Makefiles etc. still functional;
9528 * new 'Isabelle System Manual';
9530 * INSTALL text, together with ./configure and ./build scripts;
9532 * reimplemented type inference for greater efficiency, better error
9533 messages and clean internal interface;
9535 * prlim command for dealing with lots of subgoals (an easier way of
9536 setting goals_limit);
9541 * supports alternative (named) syntax tables (parser and pretty
9542 printer); internal interface is provided by add_modesyntax(_i);
9544 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
9545 be used in conjunction with the Isabelle symbol font; uses the
9546 "symbols" syntax table;
9548 * added token_translation interface (may translate name tokens in
9549 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
9550 the current print_mode); IMPORTANT: user print translation functions
9551 are responsible for marking newly introduced bounds
9552 (Syntax.mark_boundT);
9554 * token translations for modes "xterm" and "xterm_color" that display
9555 names in bold, underline etc. or colors (which requires a color
9558 * infixes may now be declared with names independent of their syntax;
9560 * added typed_print_translation (like print_translation, but may
9561 access type of constant);
9564 *** Classical Reasoner ***
9566 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
9567 some limitations. Blast_tac...
9568 + ignores addss, addbefore, addafter; this restriction is intrinsic
9569 + ignores elimination rules that don't have the correct format
9570 (the conclusion MUST be a formula variable)
9571 + ignores types, which can make HOL proofs fail
9572 + rules must not require higher-order unification, e.g. apply_type in ZF
9573 [message "Function Var's argument not a bound variable" relates to this]
9574 + its proof strategy is more general but can actually be slower
9576 * substitution with equality assumptions no longer permutes other
9579 * minor changes in semantics of addafter (now called addaltern); renamed
9580 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
9581 (and access functions for it);
9583 * improved combination of classical reasoner and simplifier:
9584 + functions for handling clasimpsets
9585 + improvement of addss: now the simplifier is called _after_ the
9587 + safe variant of addss called addSss: uses safe simplifications
9588 _during_ the safe steps. It is more complete as it allows multiple
9589 instantiations of unknowns (e.g. with slow_tac).
9593 * added interface for simplification procedures (functions that
9594 produce *proven* rewrite rules on the fly, depending on current
9597 * ordering on terms as parameter (used for ordered rewriting);
9599 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
9601 * the solver is now split into a safe and an unsafe part.
9602 This should be invisible for the normal user, except that the
9603 functions setsolver and addsolver have been renamed to setSolver and
9604 addSolver; added safe_asm_full_simp_tac;
9609 * a generic induction tactic `induct_tac' which works for all datatypes and
9610 also for type `nat';
9612 * a generic case distinction tactic `exhaust_tac' which works for all
9613 datatypes and also for type `nat';
9615 * each datatype comes with a function `size';
9617 * patterns in case expressions allow tuple patterns as arguments to
9618 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
9620 * primrec now also works with type nat;
9622 * recdef: a new declaration form, allows general recursive functions to be
9623 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
9625 * the constant for negation has been renamed from "not" to "Not" to
9626 harmonize with FOL, ZF, LK, etc.;
9628 * HOL/ex/LFilter theory of a corecursive "filter" functional for
9631 * HOL/Modelcheck demonstrates invocation of model checker oracle;
9633 * HOL/ex/Ring.thy declares cring_simp, which solves equational
9634 problems in commutative rings, using axiomatic type classes for + and *;
9636 * more examples in HOL/MiniML and HOL/Auth;
9638 * more default rewrite rules for quantifiers, union/intersection;
9640 * a new constant `arbitrary == @x.False';
9642 * HOLCF/IOA replaces old HOL/IOA;
9644 * HOLCF changes: derived all rules and arities
9645 + axiomatic type classes instead of classes
9646 + typedef instead of faking type definitions
9647 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
9648 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
9649 + eliminated the types void, one, tr
9650 + use unit lift and bool lift (with translations) instead of one and tr
9651 + eliminated blift from Lift3.thy (use Def instead of blift)
9652 all eliminated rules are derived as theorems --> no visible changes ;
9657 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
9658 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
9659 as ZF_cs addSIs [equalityI];
9663 New in Isabelle94-7 (November 96)
9664 ---------------------------------
9666 * allowing negative levels (as offsets) in prlev and choplev;
9668 * super-linear speedup for large simplifications;
9670 * FOL, ZF and HOL now use miniscoping: rewriting pushes
9671 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
9672 FAIL); can suppress it using the command Delsimps (ex_simps @
9673 all_simps); De Morgan laws are also now included, by default;
9675 * improved printing of ==> : ~:
9677 * new object-logic "Sequents" adds linear logic, while replacing LK
9678 and Modal (thanks to Sara Kalvala);
9680 * HOL/Auth: correctness proofs for authentication protocols;
9682 * HOL: new auto_tac combines rewriting and classical reasoning (many
9683 examples on HOL/Auth);
9685 * HOL: new command AddIffs for declaring theorems of the form P=Q to
9686 the rewriter and classical reasoner simultaneously;
9688 * function uresult no longer returns theorems in "standard" format;
9689 regain previous version by: val uresult = standard o uresult;
9696 * oracles -- these establish an interface between Isabelle and trusted
9697 external reasoners, which may deliver results as theorems;
9699 * proof objects (in particular record all uses of oracles);
9701 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
9703 * "constdefs" section in theory files;
9705 * "primrec" section (HOL) no longer requires names;
9707 * internal type "tactic" now simply "thm -> thm Sequence.seq";
9714 * reduced space requirements;
9716 * automatic HTML generation from theories;
9718 * theory files no longer require "..." (quotes) around most types;
9720 * new examples, including two proofs of the Church-Rosser theorem;
9722 * non-curried (1994) version of HOL is no longer distributed;
9729 * greatly reduced space requirements;
9731 * theory files (.thy) no longer require \...\ escapes at line breaks;
9733 * searchable theorem database (see the section "Retrieving theorems" on
9734 page 8 of the Reference Manual);
9736 * new examples, including Grabczewski's monumental case study of the
9739 * The previous version of HOL renamed to Old_HOL;
9741 * The new version of HOL (previously called CHOL) uses a curried syntax
9742 for functions. Application looks like f a b instead of f(a,b);
9744 * Mutually recursive inductive definitions finally work in HOL;
9746 * In ZF, pattern-matching on tuples is now available in all abstractions and
9747 translates to the operator "split";
9754 * new infix operator, addss, allowing the classical reasoner to
9755 perform simplification at each step of its search. Example:
9756 fast_tac (cs addss ss)
9758 * a new logic, CHOL, the same as HOL, but with a curried syntax
9759 for functions. Application looks like f a b instead of f(a,b). Also pairs
9760 look like (a,b) instead of <a,b>;
9762 * PLEASE NOTE: CHOL will eventually replace HOL!
9764 * In CHOL, pattern-matching on tuples is now available in all abstractions.
9765 It translates to the operator "split". A new theory of integers is available;
9767 * In ZF, integer numerals now denote two's-complement binary integers.
9768 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
9770 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
9771 of the Axiom of Choice;
9778 * Significantly faster resolution;
9780 * the different sections in a .thy file can now be mixed and repeated
9783 * Database of theorems for FOL, HOL and ZF. New
9784 commands including qed, qed_goal and bind_thm store theorems in the database.
9786 * Simple database queries: return a named theorem (get_thm) or all theorems of
9787 a given theory (thms_of), or find out what theory a theorem was proved in
9790 * Bugs fixed in the inductive definition and datatype packages;
9792 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
9793 and HOL_dup_cs obsolete;
9795 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
9798 * Simpler definition of function space in ZF;
9800 * new results about cardinal and ordinal arithmetic in ZF;
9802 * 'subtype' facility in HOL for introducing new types as subsets of existing
9805 :mode=text:wrap=hard:maxLineLen=72: