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.
14 New in Isabelle2012 (May 2012)
15 ------------------------------
19 * Prover IDE (PIDE) improvements:
21 - more robust Sledgehammer integration (as before the sledgehammer
22 command-line needs to be typed into the source buffer)
23 - markup for bound variables
24 - markup for types of term variables (displayed as tooltips)
25 - support for user-defined Isar commands within the running session
26 - improved support for Unicode outside original 16bit range
27 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
29 * Forward declaration of outer syntax keywords within the theory
30 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
31 commands to be used in the same theory where defined.
33 * Auxiliary contexts indicate block structure for specifications with
34 additional parameters and assumptions. Such unnamed contexts may be
35 nested within other targets, like 'theory', 'locale', 'class',
36 'instantiation' etc. Results from the local context are generalized
37 accordingly and applied to the enclosing target context. Example:
41 assumes xy: "x = y" and yz: "y = z"
44 lemma my_trans: "x = z" using xy yz by simp
50 The most basic application is to factor-out context elements of
51 several fixes/assumes/shows theorem statements, e.g. see
52 ~~/src/HOL/Isar_Examples/Group_Context.thy
54 Any other local theory specification element works within the "context
55 ... begin ... end" block as well.
57 * Bundled declarations associate attributed fact expressions with a
58 given name in the context. These may be later included in other
59 contexts. This allows to manage context extensions casually, without
60 the logical dependencies of locales and locale interpretation. See
61 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
63 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
64 declaration, and results are standardized before being stored. Thus
65 old-style "standard" after instantiation or composition of facts
66 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
67 indices of schematic variables.
69 * Rule attributes in local theory declarations (e.g. locale or class)
70 are now statically evaluated: the resulting theorem is stored instead
71 of the original expression. INCOMPATIBILITY in rare situations, where
72 the historic accident of dynamic re-evaluation in interpretations
75 * New tutorial "Programming and Proving in Isabelle/HOL"
76 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
77 Structured Isar Proofs" ("isar-overview"), which has been removed. It
78 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
79 Logic" as the recommended beginners tutorial, but does not cover all
80 of the material of that old tutorial.
82 * Updated and extended reference manuals: "isar-ref",
83 "implementation", "system"; reduced remaining material in old "ref"
89 * Command 'definition' no longer exports the foundational "raw_def"
90 into the user context. Minor INCOMPATIBILITY, may use the regular
91 "def" result with attribute "abs_def" to imitate the old version.
93 * Attribute "abs_def" turns an equation of the form "f x y == t" into
94 "f == %x y. t", which ensures that "simp" or "unfold" steps always
95 expand it. This also works for object-logic equality. (Formerly
96 undocumented feature.)
98 * Sort constraints are now propagated in simultaneous statements, just
99 like type constraints. INCOMPATIBILITY in rare situations, where
100 distinct sorts used to be assigned accidentally. For example:
102 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
104 lemma "P (x::'a)" and "Q (y::'a::bar)"
105 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
107 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
108 tolerant against multiple unifiers, as long as the final result is
109 unique. (As before, rules are composed in canonical right-to-left
110 order to accommodate newly introduced premises.)
112 * Renamed some inner syntax categories:
118 Minor INCOMPATIBILITY. Note that in practice "num_const" or
119 "num_position" etc. are mainly used instead (which also include
120 position information via constraints).
122 * Simplified configuration options for syntax ambiguity: see
123 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
124 manual. Minor INCOMPATIBILITY.
126 * Discontinued configuration option "syntax_positions": atomic terms
127 in parse trees are always annotated by position constraints.
129 * Old code generator for SML and its commands 'code_module',
130 'code_library', 'consts_code', 'types_code' have been discontinued.
131 Use commands of the generic code generator instead. INCOMPATIBILITY.
133 * Redundant attribute "code_inline" has been discontinued. Use
134 "code_unfold" instead. INCOMPATIBILITY.
136 * Dropped attribute "code_unfold_post" in favor of the its dual
137 "code_abbrev", which yields a common pattern in definitions like
139 definition [code_abbrev]: "f = t"
143 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
144 instead. INCOMPATIBILITY.
146 * Discontinued old "prems" fact, which used to refer to the accidental
147 collection of foundational premises in the context (already marked as
148 legacy since Isabelle2011).
153 * Type 'a set is now a proper type constructor (just as before
154 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
155 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
156 sets separate, it is often sufficient to rephrase some set S that has
157 been accidentally used as predicates by "%x. x : S", and some
158 predicate P that has been accidentally used as set by "{x. P x}".
159 Corresponding proofs in a first step should be pruned from any
160 tinkering with former theorems mem_def and Collect_def as far as
163 For developments which deliberately mix predicates and sets, a
164 planning step is necessary to determine what should become a predicate
165 and what a set. It can be helpful to carry out that step in
166 Isabelle2011-1 before jumping right into the current release.
168 * Code generation by default implements sets as container type rather
169 than predicates. INCOMPATIBILITY.
171 * New type synonym 'a rel = ('a * 'a) set
173 * The representation of numerals has changed. Datatype "num"
174 represents strictly positive binary numerals, along with functions
175 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
176 positive and negated numeric literals, respectively. See also
177 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
178 user theories may require adaptations as follows:
180 - Theorems with number_ring or number_semiring constraints: These
181 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
183 - Theories defining numeric types: Remove number, number_semiring,
184 and number_ring instances. Defer all theorems about numerals until
185 after classes one and semigroup_add have been instantiated.
187 - Numeral-only simp rules: Replace each rule having a "number_of v"
188 pattern with two copies, one for numeral and one for neg_numeral.
190 - Theorems about subclasses of semiring_1 or ring_1: These classes
191 automatically support numerals now, so more simp rules and
192 simprocs may now apply within the proof.
194 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
195 Redefine using other integer operations.
197 * Transfer: New package intended to generalize the existing
198 "descending" method and related theorem attributes from the Quotient
199 package. (Not all functionality is implemented yet, but future
200 development will focus on Transfer as an eventual replacement for the
201 corresponding parts of the Quotient package.)
203 - transfer_rule attribute: Maintains a collection of transfer rules,
204 which relate constants at two different types. Transfer rules may
205 relate different type instances of the same polymorphic constant,
206 or they may relate an operation on a raw type to a corresponding
207 operation on an abstract type (quotient or subtype). For example:
209 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
210 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
212 - transfer method: Replaces a subgoal on abstract types with an
213 equivalent subgoal on the corresponding raw types. Constants are
214 replaced with corresponding ones according to the transfer rules.
215 Goals are generalized over all free variables by default; this is
216 necessary for variables whose types change, but can be overridden
217 for specific variables with e.g. "transfer fixing: x y z". The
218 variant transfer' method allows replacing a subgoal with one that
219 is logically stronger (rather than equivalent).
221 - relator_eq attribute: Collects identity laws for relators of
222 various type constructors, e.g. "list_all2 (op =) = (op =)". The
223 transfer method uses these lemmas to infer transfer rules for
224 non-polymorphic constants on the fly.
226 - transfer_prover method: Assists with proving a transfer rule for a
227 new constant, provided the constant is defined in terms of other
228 constants that already have transfer rules. It should be applied
229 after unfolding the constant definitions.
231 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
232 from type nat to type int.
234 * Lifting: New package intended to generalize the quotient_definition
235 facility of the Quotient package; designed to work with Transfer.
237 - lift_definition command: Defines operations on an abstract type in
238 terms of a corresponding operation on a representation
239 type. Example syntax:
241 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
244 Users must discharge a respectfulness proof obligation when each
245 constant is defined. (For a type copy, i.e. a typedef with UNIV,
246 the proof is discharged automatically.) The obligation is
247 presented in a user-friendly, readable form; a respectfulness
248 theorem in the standard format and a transfer rule are generated
251 - Integration with code_abstype: For typedefs (e.g. subtypes
252 corresponding to a datatype invariant, such as dlist),
253 lift_definition generates a code certificate theorem and sets up
254 code generation for each constant.
256 - setup_lifting command: Sets up the Lifting package to work with a
257 user-defined type. The user must provide either a quotient theorem
258 or a type_definition theorem. The package configures transfer
259 rules for equality and quantifiers on the type, and sets up the
260 lift_definition command to work with the type.
262 - Usage examples: See Quotient_Examples/Lift_DList.thy,
263 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
264 Word/Word.thy and Library/Float.thy.
268 - The 'quotient_type' command now supports a 'morphisms' option with
269 rep and abs functions, similar to typedef.
271 - 'quotient_type' sets up new types to work with the Lifting and
272 Transfer packages, as with 'setup_lifting'.
274 - The 'quotient_definition' command now requires the user to prove a
275 respectfulness property at the point where the constant is
276 defined, similar to lift_definition; INCOMPATIBILITY.
278 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
279 accordingly, INCOMPATIBILITY.
281 * New diagnostic command 'find_unused_assms' to find potentially
282 superfluous assumptions in theorems using Quickcheck.
286 - Quickcheck returns variable assignments as counterexamples, which
287 allows to reveal the underspecification of functions under test.
288 For example, refuting "hd xs = x", it presents the variable
289 assignment xs = [] and x = a1 as a counterexample, assuming that
290 any property is false whenever "hd []" occurs in it.
292 These counterexample are marked as potentially spurious, as
293 Quickcheck also returns "xs = []" as a counterexample to the
294 obvious theorem "hd xs = hd xs".
296 After finding a potentially spurious counterexample, Quickcheck
297 continues searching for genuine ones.
299 By default, Quickcheck shows potentially spurious and genuine
300 counterexamples. The option "genuine_only" sets quickcheck to only
301 show genuine counterexamples.
303 - The command 'quickcheck_generator' creates random and exhaustive
304 value generators for a given type and operations.
306 It generates values by using the operations as if they were
307 constructors of that type.
309 - Support for multisets.
311 - Added "use_subtype" options.
313 - Added "quickcheck_locale" configuration to specify how to process
314 conjectures in a locale context.
316 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
317 and affecting 'rat' and 'real'.
320 - Integrated more tightly with SPASS, as described in the ITP 2012
321 paper "More SPASS with Isabelle".
322 - Made it try "smt" as a fallback if "metis" fails or times out.
323 - Added support for the following provers: Alt-Ergo (via Why3 and
324 TFF1), iProver, iProver-Eq.
325 - Replaced remote E-SInE with remote Satallax in the default setup.
326 - Sped up the minimizer.
327 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
328 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
329 - Renamed "sound" option to "strict".
331 * Metis: Added possibility to specify lambda translations scheme as a
332 parenthesized argument (e.g., "by (metis (lifting) ...)").
334 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
336 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
338 * New "case_product" attribute to generate a case rule doing multiple
339 case distinctions at the same time. E.g.
341 list.exhaust [case_product nat.exhaust]
343 produces a rule which can be used to perform case distinction on both
346 * New "eventually_elim" method as a generalized variant of the
347 eventually_elim* rules. Supports structured proofs.
349 * Typedef with implicit set definition is considered legacy. Use
350 "typedef (open)" form instead, which will eventually become the
353 * Record: code generation can be switched off manually with
355 declare [[record_coden = false]] -- "default true"
357 * Datatype: type parameters allow explicit sort constraints.
359 * Concrete syntax for case expressions includes constraints for source
360 positions, and thus produces Prover IDE markup for its bindings.
361 INCOMPATIBILITY for old-style syntax translations that augment the
362 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
365 * Clarified attribute "mono_set": pure declaration without modifying
366 the result of the fact expression.
368 * More default pred/set conversions on a couple of relation operations
369 and predicates. Added powers of predicate relations. Consolidation
370 of some relation theorems:
372 converse_def ~> converse_unfold
373 rel_comp_def ~> relcomp_unfold
374 symp_def ~> (modified, use symp_def and sym_def instead)
375 transp_def ~> transp_trans
376 Domain_def ~> Domain_unfold
377 Range_def ~> Domain_converse [symmetric]
379 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
381 See theory "Relation" for examples for making use of pred/set
382 conversions by means of attributes "to_set" and "to_pred".
386 * Renamed facts about the power operation on relations, i.e., relpow
387 to match the constant's name:
389 rel_pow_1 ~> relpow_1
390 rel_pow_0_I ~> relpow_0_I
391 rel_pow_Suc_I ~> relpow_Suc_I
392 rel_pow_Suc_I2 ~> relpow_Suc_I2
393 rel_pow_0_E ~> relpow_0_E
394 rel_pow_Suc_E ~> relpow_Suc_E
395 rel_pow_E ~> relpow_E
396 rel_pow_Suc_D2 ~> relpow_Suc_D2
397 rel_pow_Suc_E2 ~> relpow_Suc_E2
398 rel_pow_Suc_D2' ~> relpow_Suc_D2'
399 rel_pow_E2 ~> relpow_E2
400 rel_pow_add ~> relpow_add
401 rel_pow_commute ~> relpow
402 rel_pow_empty ~> relpow_empty:
403 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
404 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
405 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
406 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
407 rel_pow_fun_conv ~> relpow_fun_conv
408 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
409 rel_pow_finite_bounded ~> relpow_finite_bounded
410 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
411 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
412 single_valued_rel_pow ~> single_valued_relpow
416 * Theory Relation: Consolidated constant name for relation composition
417 and corresponding theorem names:
419 - Renamed constant rel_comp to relcomp.
421 - Dropped abbreviation pred_comp. Use relcompp instead.
425 rel_compI ~> relcompI
426 rel_compEpair ~> relcompEpair
427 rel_compE ~> relcompE
428 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
429 rel_comp_empty1 ~> relcomp_empty1
430 rel_comp_mono ~> relcomp_mono
431 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
432 rel_comp_distrib ~> relcomp_distrib
433 rel_comp_distrib2 ~> relcomp_distrib2
434 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
435 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
436 single_valued_rel_comp ~> single_valued_relcomp
437 rel_comp_def ~> relcomp_unfold
438 converse_rel_comp ~> converse_relcomp
439 pred_compI ~> relcomppI
440 pred_compE ~> relcomppE
441 pred_comp_bot1 ~> relcompp_bot1
442 pred_comp_bot2 ~> relcompp_bot2
443 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
444 pred_comp_mono ~> relcompp_mono
445 pred_comp_distrib ~> relcompp_distrib
446 pred_comp_distrib2 ~> relcompp_distrib2
447 converse_pred_comp ~> converse_relcompp
449 finite_rel_comp ~> finite_relcomp
451 set_rel_comp ~> set_relcomp
455 * Theory Divides: Discontinued redundant theorems about div and mod.
456 INCOMPATIBILITY, use the corresponding generic theorems instead.
458 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
459 zdiv_self ~> div_self
460 zmod_self ~> mod_self
463 zdiv_zmod_equality ~> div_mod_equality2
464 zdiv_zmod_equality2 ~> div_mod_equality
465 zmod_zdiv_trivial ~> mod_div_trivial
466 zdiv_zminus_zminus ~> div_minus_minus
467 zmod_zminus_zminus ~> mod_minus_minus
468 zdiv_zminus2 ~> div_minus_right
469 zmod_zminus2 ~> mod_minus_right
470 zdiv_minus1_right ~> div_minus1_right
471 zmod_minus1_right ~> mod_minus1_right
472 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
473 zmod_zmult1_eq ~> mod_mult_right_eq
474 zpower_zmod ~> power_mod
476 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
477 mod_mult_distrib ~> mult_mod_left
478 mod_mult_distrib2 ~> mult_mod_right
480 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
481 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
483 * Finite_Set.fold now qualified. INCOMPATIBILITY.
485 * Consolidated theorem names concerning fold combinators:
487 inf_INFI_fold_inf ~> inf_INF_fold_inf
488 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
489 INFI_fold_inf ~> INF_fold_inf
490 SUPR_fold_sup ~> SUP_fold_sup
491 union_set ~> union_set_fold
492 minus_set ~> minus_set_fold
493 INFI_set_fold ~> INF_set_fold
494 SUPR_set_fold ~> SUP_set_fold
495 INF_code ~> INF_set_foldr
496 SUP_code ~> SUP_set_foldr
497 foldr.simps ~> foldr.simps (in point-free formulation)
498 foldr_fold_rev ~> foldr_conv_fold
499 foldl_fold ~> foldl_conv_fold
500 foldr_foldr ~> foldr_conv_foldl
501 foldl_foldr ~> foldl_conv_foldr
502 fold_set_remdups ~> fold_set_fold_remdups
503 fold_set ~> fold_set_fold
504 fold1_set ~> fold1_set_fold
508 * Dropped rarely useful theorems concerning fold combinators:
509 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
510 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
511 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
512 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
513 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
514 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
515 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
516 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
517 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
518 unfolding "foldr_conv_fold" and "foldl_conv_fold".
520 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
521 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
522 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
523 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
524 lemmas over fold rather than foldr, or make use of lemmas
525 fold_conv_foldr and fold_rev.
527 * Congruence rules Option.map_cong and Option.bind_cong for recursion
528 through option types.
530 * "Transitive_Closure.ntrancl": bounded transitive closure on
533 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
535 * Theory Int: Discontinued many legacy theorems specific to type int.
536 INCOMPATIBILITY, use the corresponding generic theorems instead.
538 zminus_zminus ~> minus_minus
539 zminus_0 ~> minus_zero
540 zminus_zadd_distrib ~> minus_add_distrib
541 zadd_commute ~> add_commute
542 zadd_assoc ~> add_assoc
543 zadd_left_commute ~> add_left_commute
547 zadd_0_right ~> add_0_right
548 zadd_zminus_inverse2 ~> left_minus
549 zmult_zminus ~> mult_minus_left
550 zmult_commute ~> mult_commute
551 zmult_assoc ~> mult_assoc
552 zadd_zmult_distrib ~> left_distrib
553 zadd_zmult_distrib2 ~> right_distrib
554 zdiff_zmult_distrib ~> left_diff_distrib
555 zdiff_zmult_distrib2 ~> right_diff_distrib
556 zmult_1 ~> mult_1_left
557 zmult_1_right ~> mult_1_right
558 zle_refl ~> order_refl
559 zle_trans ~> order_trans
560 zle_antisym ~> order_antisym
561 zle_linear ~> linorder_linear
562 zless_linear ~> linorder_less_linear
563 zadd_left_mono ~> add_left_mono
564 zadd_strict_right_mono ~> add_strict_right_mono
565 zadd_zless_mono ~> add_less_le_mono
566 int_0_less_1 ~> zero_less_one
567 int_0_neq_1 ~> zero_neq_one
569 zpower_zadd_distrib ~> power_add
570 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
571 zero_le_zpower_abs ~> zero_le_power_abs
573 * Theory Deriv: Renamed
575 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
577 * Theory Library/Multiset: Improved code generation of multisets.
579 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
580 are expressed via type classes again. The special syntax
581 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
582 setsum_set, which is now subsumed by Big_Operators.setsum.
585 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
586 use theory HOL/Library/Nat_Bijection instead.
588 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
589 trees is now inside a type class context. Names of affected
590 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
591 theories working directly with raw red-black trees, adapt the names as
595 bulkload -> rbt_bulkload
596 del_from_left -> rbt_del_from_left
597 del_from_right -> rbt_del_from_right
602 insertw -> rbt_insert_with
603 insert_with_key -> rbt_insert_with_key
604 map_entry -> rbt_map_entry
607 tree_greater -> rbt_greater
608 tree_less -> rbt_less
609 tree_less_symbol -> rbt_less_symbol
611 union_with -> rbt_union_with
612 union_with_key -> rbt_union_with_key
615 balance_left_sorted -> balance_left_rbt_sorted
616 balance_left_tree_greater -> balance_left_rbt_greater
617 balance_left_tree_less -> balance_left_rbt_less
618 balance_right_sorted -> balance_right_rbt_sorted
619 balance_right_tree_greater -> balance_right_rbt_greater
620 balance_right_tree_less -> balance_right_rbt_less
621 balance_sorted -> balance_rbt_sorted
622 balance_tree_greater -> balance_rbt_greater
623 balance_tree_less -> balance_rbt_less
624 bulkload_is_rbt -> rbt_bulkload_is_rbt
625 combine_sorted -> combine_rbt_sorted
626 combine_tree_greater -> combine_rbt_greater
627 combine_tree_less -> combine_rbt_less
628 delete_in_tree -> rbt_delete_in_tree
629 delete_is_rbt -> rbt_delete_is_rbt
630 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
631 del_from_left_tree_less -> rbt_del_from_left_rbt_less
632 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
633 del_from_right_tree_less -> rbt_del_from_right_rbt_less
634 del_in_tree -> rbt_del_in_tree
635 del_inv1_inv2 -> rbt_del_inv1_inv2
636 del_sorted -> rbt_del_rbt_sorted
637 del_tree_greater -> rbt_del_rbt_greater
638 del_tree_less -> rbt_del_rbt_less
639 dom_lookup_Branch -> dom_rbt_lookup_Branch
640 entries_lookup -> entries_rbt_lookup
641 finite_dom_lookup -> finite_dom_rbt_lookup
642 insert_sorted -> rbt_insert_rbt_sorted
643 insertw_is_rbt -> rbt_insertw_is_rbt
644 insertwk_is_rbt -> rbt_insertwk_is_rbt
645 insertwk_sorted -> rbt_insertwk_rbt_sorted
646 insertw_sorted -> rbt_insertw_rbt_sorted
647 ins_sorted -> ins_rbt_sorted
648 ins_tree_greater -> ins_rbt_greater
649 ins_tree_less -> ins_rbt_less
650 is_rbt_sorted -> is_rbt_rbt_sorted
651 lookup_balance -> rbt_lookup_balance
652 lookup_bulkload -> rbt_lookup_rbt_bulkload
653 lookup_delete -> rbt_lookup_rbt_delete
654 lookup_Empty -> rbt_lookup_Empty
655 lookup_from_in_tree -> rbt_lookup_from_in_tree
656 lookup_in_tree -> rbt_lookup_in_tree
657 lookup_ins -> rbt_lookup_ins
658 lookup_insert -> rbt_lookup_rbt_insert
659 lookup_insertw -> rbt_lookup_rbt_insertw
660 lookup_insertwk -> rbt_lookup_rbt_insertwk
661 lookup_keys -> rbt_lookup_keys
662 lookup_map -> rbt_lookup_map
663 lookup_map_entry -> rbt_lookup_rbt_map_entry
664 lookup_tree_greater -> rbt_lookup_rbt_greater
665 lookup_tree_less -> rbt_lookup_rbt_less
666 lookup_union -> rbt_lookup_rbt_union
667 map_entry_color_of -> rbt_map_entry_color_of
668 map_entry_inv1 -> rbt_map_entry_inv1
669 map_entry_inv2 -> rbt_map_entry_inv2
670 map_entry_is_rbt -> rbt_map_entry_is_rbt
671 map_entry_sorted -> rbt_map_entry_rbt_sorted
672 map_entry_tree_greater -> rbt_map_entry_rbt_greater
673 map_entry_tree_less -> rbt_map_entry_rbt_less
674 map_tree_greater -> map_rbt_greater
675 map_tree_less -> map_rbt_less
676 map_sorted -> map_rbt_sorted
677 paint_sorted -> paint_rbt_sorted
678 paint_lookup -> paint_rbt_lookup
679 paint_tree_greater -> paint_rbt_greater
680 paint_tree_less -> paint_rbt_less
681 sorted_entries -> rbt_sorted_entries
682 tree_greater_eq_trans -> rbt_greater_eq_trans
683 tree_greater_nit -> rbt_greater_nit
684 tree_greater_prop -> rbt_greater_prop
685 tree_greater_simps -> rbt_greater_simps
686 tree_greater_trans -> rbt_greater_trans
687 tree_less_eq_trans -> rbt_less_eq_trans
688 tree_less_nit -> rbt_less_nit
689 tree_less_prop -> rbt_less_prop
690 tree_less_simps -> rbt_less_simps
691 tree_less_trans -> rbt_less_trans
692 tree_ord_props -> rbt_ord_props
693 union_Branch -> rbt_union_Branch
694 union_is_rbt -> rbt_union_is_rbt
695 unionw_is_rbt -> rbt_unionw_is_rbt
696 unionwk_is_rbt -> rbt_unionwk_is_rbt
697 unionwk_sorted -> rbt_unionwk_rbt_sorted
699 * Theory HOL/Library/Float: Floating point numbers are now defined as
700 a subset of the real numbers. All operations are defined using the
701 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
708 round_down -> float_round_down
709 round_up -> float_round_up
713 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
716 abs_float_def -> Float.compute_float_abs
717 bitlen_ge0 -> bitlen_nonneg
718 bitlen.simps -> Float.compute_bitlen
719 float_components -> Float_mantissa_exponent
720 float_divl.simps -> Float.compute_float_divl
721 float_divr.simps -> Float.compute_float_divr
722 float_eq_odd -> mult_powr_eq_mult_powr_iff
723 float_power -> real_of_float_power
724 lapprox_posrat_def -> Float.compute_lapprox_posrat
725 lapprox_rat.simps -> Float.compute_lapprox_rat
726 le_float_def' -> Float.compute_float_le
727 le_float_def -> less_eq_float.rep_eq
728 less_float_def' -> Float.compute_float_less
729 less_float_def -> less_float.rep_eq
730 normfloat_def -> Float.compute_normfloat
731 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
732 normfloat -> normfloat_def
733 normfloat_unique -> use normfloat_def
734 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
735 one_float_def -> Float.compute_float_one
736 plus_float_def -> Float.compute_float_plus
737 rapprox_posrat_def -> Float.compute_rapprox_posrat
738 rapprox_rat.simps -> Float.compute_rapprox_rat
739 real_of_float_0 -> zero_float.rep_eq
740 real_of_float_1 -> one_float.rep_eq
741 real_of_float_abs -> abs_float.rep_eq
742 real_of_float_add -> plus_float.rep_eq
743 real_of_float_minus -> uminus_float.rep_eq
744 real_of_float_mult -> times_float.rep_eq
745 real_of_float_simp -> Float.rep_eq
746 real_of_float_sub -> minus_float.rep_eq
747 round_down.simps -> Float.compute_float_round_down
748 round_up.simps -> Float.compute_float_round_up
749 times_float_def -> Float.compute_float_times
750 uminus_float_def -> Float.compute_float_uminus
751 zero_float_def -> Float.compute_float_zero
753 Lemmas not necessary anymore, use the transfer method:
754 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
755 float_divr, float_le_simp, float_less1_mantissa_bound,
756 float_less_simp, float_less_zero, float_le_zero,
757 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
758 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
759 lapprox_rat_bottom, normalized_float, rapprox_posrat,
760 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
761 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
762 round_up, zero_le_float, zero_less_float
764 * New theory HOL/Library/DAList provides an abstract type for
765 association lists with distinct keys.
767 * Session HOL/IMP: Added new theory of abstract interpretation of
770 * Session HOL-Import: Re-implementation from scratch is faster,
771 simpler, and more scalable. Requires a proof bundle, which is
772 available as an external component. Discontinued old (and mostly
773 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
775 * Session HOL-Word: Discontinued many redundant theorems specific to
776 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
779 word_sub_alt ~> word_sub_wi
780 word_add_alt ~> word_add_def
781 word_mult_alt ~> word_mult_def
782 word_minus_alt ~> word_minus_def
783 word_0_alt ~> word_0_wi
784 word_1_alt ~> word_1_wi
785 word_add_0 ~> add_0_left
786 word_add_0_right ~> add_0_right
787 word_mult_1 ~> mult_1_left
788 word_mult_1_right ~> mult_1_right
789 word_add_commute ~> add_commute
790 word_add_assoc ~> add_assoc
791 word_add_left_commute ~> add_left_commute
792 word_mult_commute ~> mult_commute
793 word_mult_assoc ~> mult_assoc
794 word_mult_left_commute ~> mult_left_commute
795 word_left_distrib ~> left_distrib
796 word_right_distrib ~> right_distrib
797 word_left_minus ~> left_minus
798 word_diff_0_right ~> diff_0_right
799 word_diff_self ~> diff_self
800 word_sub_def ~> diff_minus
801 word_diff_minus ~> diff_minus
802 word_add_ac ~> add_ac
803 word_mult_ac ~> mult_ac
804 word_plus_ac0 ~> add_0_left add_0_right add_ac
805 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
806 word_order_trans ~> order_trans
807 word_order_refl ~> order_refl
808 word_order_antisym ~> order_antisym
809 word_order_linear ~> linorder_linear
810 lenw1_zero_neq_one ~> zero_neq_one
811 word_number_of_eq ~> number_of_eq
812 word_of_int_add_hom ~> wi_hom_add
813 word_of_int_sub_hom ~> wi_hom_sub
814 word_of_int_mult_hom ~> wi_hom_mult
815 word_of_int_minus_hom ~> wi_hom_neg
816 word_of_int_succ_hom ~> wi_hom_succ
817 word_of_int_pred_hom ~> wi_hom_pred
818 word_of_int_0_hom ~> word_0_wi
819 word_of_int_1_hom ~> word_1_wi
821 * Session HOL-Word: New proof method "word_bitwise" for splitting
822 machine word equalities and inequalities into logical circuits,
823 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
824 multiplication, shifting by constants, bitwise operators and numeric
825 constants. Requires fixed-length word types, not 'a word. Solves
826 many standard word identities outright and converts more into first
827 order problems amenable to blast or similar. See also examples in
828 HOL/Word/Examples/WordExamples.thy.
830 * Session HOL-Probability: Introduced the type "'a measure" to
831 represent measures, this replaces the records 'a algebra and 'a
832 measure_space. The locales based on subset_class now have two
833 locale-parameters the space \<Omega> and the set of measurable sets M.
834 The product of probability spaces uses now the same constant as the
835 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
836 measure". Most constants are defined now outside of locales and gain
837 an additional parameter, like null_sets, almost_eventually or \<mu>'.
838 Measure space constructions for distributions and densities now got
839 their own constants distr and density. Instead of using locales to
840 describe measure spaces with a finite space, the measure count_space
841 and point_measure is introduced. INCOMPATIBILITY.
845 finite_measure.\<mu>' -> measure
846 product_algebra_generator -> prod_algebra
847 product_prob_space.emb -> prod_emb
848 product_prob_space.infprod_algebra -> PiM
851 completeable_measure_space
854 finite_product_finite_prob_space
855 finite_product_sigma_algebra
858 pair_finite_prob_space
859 pair_finite_sigma_algebra
862 product_sigma_algebra
866 distribution -> use distr measure, or distributed predicate
868 joint_distribution -> use distr measure, or distributed predicate
869 pair_measure_generator
870 product_prob_space.infprod_algebra -> use PiM
873 Replacement theorems:
874 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
875 finite_measure.empty_measure -> measure_empty
876 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
877 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
878 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
879 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
880 finite_measure.finite_measure -> finite_measure.emeasure_finite
881 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
882 finite_measure.positive_measure' -> measure_nonneg
883 finite_measure.real_measure -> finite_measure.emeasure_real
884 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
885 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
886 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
887 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
888 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
889 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
890 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
891 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
892 information_space.entropy_commute -> information_space.entropy_commute_simple
893 information_space.entropy_eq -> information_space.entropy_simple_distributed
894 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
895 information_space.entropy_positive -> information_space.entropy_nonneg_simple
896 information_space.entropy_uniform_max -> information_space.entropy_uniform
897 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
898 information_space.KL_eq_0 -> information_space.KL_same_eq_0
899 information_space.KL_ge_0 -> information_space.KL_nonneg
900 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
901 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
902 Int_stable_cuboids -> Int_stable_atLeastAtMost
903 Int_stable_product_algebra_generator -> positive_integral
904 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
905 measure_space.additive -> emeasure_additive
906 measure_space.AE_iff_null_set -> AE_iff_null
907 measure_space.almost_everywhere_def -> eventually_ae_filter
908 measure_space.almost_everywhere_vimage -> AE_distrD
909 measure_space.continuity_from_above -> INF_emeasure_decseq
910 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
911 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
912 measure_space.continuity_from_below -> SUP_emeasure_incseq
913 measure_space_density -> emeasure_density
914 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
915 measure_space.integrable_vimage -> integrable_distr
916 measure_space.integral_translated_density -> integral_density
917 measure_space.integral_vimage -> integral_distr
918 measure_space.measure_additive -> plus_emeasure
919 measure_space.measure_compl -> emeasure_compl
920 measure_space.measure_countable_increasing -> emeasure_countable_increasing
921 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
922 measure_space.measure_decseq -> decseq_emeasure
923 measure_space.measure_Diff -> emeasure_Diff
924 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
925 measure_space.measure_eq_0 -> emeasure_eq_0
926 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
927 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
928 measure_space.measure_incseq -> incseq_emeasure
929 measure_space.measure_insert -> emeasure_insert
930 measure_space.measure_mono -> emeasure_mono
931 measure_space.measure_not_negative -> emeasure_not_MInf
932 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
933 measure_space.measure_setsum -> setsum_emeasure
934 measure_space.measure_setsum_split -> setsum_emeasure_cover
935 measure_space.measure_space_vimage -> emeasure_distr
936 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
937 measure_space.measure_subadditive -> subadditive
938 measure_space.measure_top -> emeasure_space
939 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
940 measure_space.measure_Un_null_set -> emeasure_Un_null_set
941 measure_space.positive_integral_translated_density -> positive_integral_density
942 measure_space.positive_integral_vimage -> positive_integral_distr
943 measure_space.real_continuity_from_above -> Lim_measure_decseq
944 measure_space.real_continuity_from_below -> Lim_measure_incseq
945 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
946 measure_space.real_measure_Diff -> measure_Diff
947 measure_space.real_measure_finite_Union -> measure_finite_Union
948 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
949 measure_space.real_measure_subadditive -> measure_subadditive
950 measure_space.real_measure_Union -> measure_Union
951 measure_space.real_measure_UNION -> measure_UNION
952 measure_space.simple_function_vimage -> simple_function_comp
953 measure_space.simple_integral_vimage -> simple_integral_distr
954 measure_space.simple_integral_vimage -> simple_integral_distr
955 measure_unique_Int_stable -> measure_eqI_generator_eq
956 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
957 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
958 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
959 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
960 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
961 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
962 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
963 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
964 pair_sigma_algebra.sets_swap -> sets_pair_swap
965 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
966 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
967 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
968 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
969 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
970 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
971 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
972 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
973 prob_space.measure_space_1 -> prob_space.emeasure_space_1
974 prob_space.prob_space_vimage -> prob_space_distr
975 prob_space.random_variable_restrict -> measurable_restrict
976 prob_space_unique_Int_stable -> measure_eqI_prob_space
977 product_algebraE -> prod_algebraE_all
978 product_algebra_generator_der -> prod_algebra_eq_finite
979 product_algebra_generator_into_space -> prod_algebra_sets_into_space
980 product_algebraI -> sets_PiM_I_finite
981 product_measure_exists -> product_sigma_finite.sigma_finite
982 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
983 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
984 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
985 product_prob_space.measurable_component -> measurable_component_singleton
986 product_prob_space.measurable_emb -> measurable_prod_emb
987 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
988 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
989 product_prob_space.measure_emb -> emeasure_prod_emb
990 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
991 product_sigma_algebra.product_algebra_into_space -> space_closed
992 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
993 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
994 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
995 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
996 sets_product_algebra -> sets_PiM
997 sigma_algebra.measurable_sigma -> measurable_measure_of
998 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
999 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
1000 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
1001 space_product_algebra -> space_PiM
1003 * Session HOL-TPTP: support to parse and import TPTP problems (all
1004 languages) into Isabelle/HOL.
1009 * New "case_product" attribute (see HOL).
1014 * Greater support for structured proofs involving induction or case
1017 * Much greater use of mathematical symbols.
1019 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1024 * Antiquotation @{keyword "name"} produces a parser for outer syntax
1025 from a minor keyword introduced via theory header declaration.
1027 * Antiquotation @{command_spec "name"} produces the
1028 Outer_Syntax.command_spec from a major keyword introduced via theory
1029 header declaration; it can be passed to Outer_Syntax.command etc.
1031 * Local_Theory.define no longer hard-wires default theorem name
1032 "foo_def", but retains the binding as given. If that is Binding.empty
1033 / Attrib.empty_binding, the result is not registered as user-level
1034 fact. The Local_Theory.define_internal variant allows to specify a
1035 non-empty name (used for the foundation in the background theory),
1036 while omitting the fact binding in the user-context. Potential
1037 INCOMPATIBILITY for derived definitional packages: need to specify
1038 naming policy for primitive definitions more explicitly.
1040 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
1041 conformance with similar operations in structure Term and Logic.
1043 * Antiquotation @{attributes [...]} embeds attribute source
1044 representation into the ML text, which is particularly useful with
1045 declarations like Local_Theory.note.
1047 * Structure Proof_Context follows standard naming scheme. Old
1048 ProofContext has been discontinued. INCOMPATIBILITY.
1050 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
1051 change of semantics: update is applied to auxiliary local theory
1054 * Modernized some old-style infix operations:
1056 addeqcongs ~> Simplifier.add_eqcong
1057 deleqcongs ~> Simplifier.del_eqcong
1058 addcongs ~> Simplifier.add_cong
1059 delcongs ~> Simplifier.del_cong
1060 setmksimps ~> Simplifier.set_mksimps
1061 setmkcong ~> Simplifier.set_mkcong
1062 setmksym ~> Simplifier.set_mksym
1063 setmkeqTrue ~> Simplifier.set_mkeqTrue
1064 settermless ~> Simplifier.set_termless
1065 setsubgoaler ~> Simplifier.set_subgoaler
1066 addsplits ~> Splitter.add_split
1067 delsplits ~> Splitter.del_split
1072 * USER_HOME settings variable points to cross-platform user home
1073 directory, which coincides with HOME on POSIX systems only. Likewise,
1074 the Isabelle path specification "~" now expands to $USER_HOME, instead
1075 of former $HOME. A different default for USER_HOME may be set
1076 explicitly in shell environment, before Isabelle settings are
1077 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
1078 the generic user home was intended.
1080 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
1081 notation, which is useful for the jEdit file browser, for example.
1083 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
1088 New in Isabelle2011-1 (October 2011)
1089 ------------------------------------
1093 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
1094 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
1096 - Management of multiple theory files directly from the editor
1097 buffer store -- bypassing the file-system (no requirement to save
1098 files for checking).
1100 - Markup of formal entities within the text buffer, with semantic
1101 highlighting, tooltips and hyperlinks to jump to defining source
1104 - Improved text rendering, with sub/superscripts in the source
1105 buffer (including support for copy/paste wrt. output panel, HTML
1106 theory output and other non-Isabelle text boxes).
1108 - Refined scheduling of proof checking and printing of results,
1109 based on interactive editor view. (Note: jEdit folding and
1110 narrowing allows to restrict buffer perspectives explicitly.)
1112 - Reduced CPU performance requirements, usable on machines with few
1115 - Reduced memory requirements due to pruning of unused document
1116 versions (garbage collection).
1118 See also ~~/src/Tools/jEdit/README.html for further information,
1119 including some remaining limitations.
1121 * Theory loader: source files are exclusively located via the master
1122 directory of each theory node (where the .thy file itself resides).
1123 The global load path (such as src/HOL/Library) has been discontinued.
1124 Note that the path element ~~ may be used to reference theories in the
1125 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
1128 * Theory loader: source files are identified by content via SHA1
1129 digests. Discontinued former path/modtime identification and optional
1130 ISABELLE_FILE_IDENT plugin scripts.
1132 * Parallelization of nested Isar proofs is subject to
1133 Goal.parallel_proofs_threshold (default 100). See also isabelle
1136 * Name space: former unsynchronized references are now proper
1137 configuration options, with more conventional names:
1139 long_names ~> names_long
1140 short_names ~> names_short
1141 unique_names ~> names_unique
1143 Minor INCOMPATIBILITY, need to declare options in context like this:
1145 declare [[names_unique = false]]
1147 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
1148 that the result needs to be unique, which means fact specifications
1149 may have to be refined after enriching a proof context.
1151 * Attribute "case_names" has been refined: the assumptions in each case
1152 can be named now by following the case name with [name1 name2 ...].
1154 * Isabelle/Isar reference manual has been updated and extended:
1155 - "Synopsis" provides a catalog of main Isar language concepts.
1156 - Formal references in syntax diagrams, via @{rail} antiquotation.
1157 - Updated material from classic "ref" manual, notably about
1158 "Classical Reasoner".
1163 * Class bot and top require underlying partial order rather than
1164 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
1166 * Class complete_lattice: generalized a couple of lemmas from sets;
1167 generalized theorems INF_cong and SUP_cong. New type classes for
1168 complete boolean algebras and complete linear orders. Lemmas
1169 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
1170 class complete_linorder.
1172 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
1173 Sup_fun_def, Inf_apply, Sup_apply.
1175 Removed redundant lemmas (the right hand side gives hints how to
1176 replace them for (metis ...), or (simp only: ...) proofs):
1178 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
1179 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
1180 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
1181 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
1182 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
1183 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
1184 Inter_def ~> INF_def, image_def
1185 Union_def ~> SUP_def, image_def
1186 INT_eq ~> INF_def, and image_def
1187 UN_eq ~> SUP_def, and image_def
1188 INF_subset ~> INF_superset_mono [OF _ order_refl]
1190 More consistent and comprehensive names:
1192 INTER_eq_Inter_image ~> INF_def
1193 UNION_eq_Union_image ~> SUP_def
1196 INF_leI ~> INF_lower
1197 INF_leI2 ~> INF_lower2
1198 le_INFI ~> INF_greatest
1199 le_SUPI ~> SUP_upper
1200 le_SUPI2 ~> SUP_upper2
1201 SUP_leI ~> SUP_least
1202 INFI_bool_eq ~> INF_bool_eq
1203 SUPR_bool_eq ~> SUP_bool_eq
1204 INFI_apply ~> INF_apply
1205 SUPR_apply ~> SUP_apply
1206 INTER_def ~> INTER_eq
1207 UNION_def ~> UNION_eq
1211 * Renamed theory Complete_Lattice to Complete_Lattices.
1214 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
1215 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
1216 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
1217 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
1219 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
1220 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
1221 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
1224 * Added syntactic classes "inf" and "sup" for the respective
1225 constants. INCOMPATIBILITY: Changes in the argument order of the
1226 (mostly internal) locale predicates for some derived classes.
1228 * Theorem collections ball_simps and bex_simps do not contain theorems
1229 referring to UNION any longer; these have been moved to collection
1230 UN_ball_bex_simps. INCOMPATIBILITY.
1232 * Theory Archimedean_Field: floor now is defined as parameter of a
1233 separate type class floor_ceiling.
1235 * Theory Finite_Set: more coherent development of fold_set locales:
1237 locale fun_left_comm ~> locale comp_fun_commute
1238 locale fun_left_comm_idem ~> locale comp_fun_idem
1240 Both use point-free characterization; interpretation proofs may need
1241 adjustment. INCOMPATIBILITY.
1243 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
1244 accordance with standard mathematical terminology. INCOMPATIBILITY.
1246 * Theory Complex_Main: The locale interpretations for the
1247 bounded_linear and bounded_bilinear locales have been removed, in
1248 order to reduce the number of duplicate lemmas. Users must use the
1249 original names for distributivity theorems, potential INCOMPATIBILITY.
1251 divide.add ~> add_divide_distrib
1252 divide.diff ~> diff_divide_distrib
1253 divide.setsum ~> setsum_divide_distrib
1254 mult.add_right ~> right_distrib
1255 mult.diff_right ~> right_diff_distrib
1256 mult_right.setsum ~> setsum_right_distrib
1257 mult_left.diff ~> left_diff_distrib
1259 * Theory Complex_Main: Several redundant theorems have been removed or
1260 replaced by more general versions. INCOMPATIBILITY.
1262 real_diff_def ~> minus_real_def
1263 real_divide_def ~> divide_real_def
1264 real_less_def ~> less_le
1265 real_abs_def ~> abs_real_def
1266 real_sgn_def ~> sgn_real_def
1267 real_mult_commute ~> mult_commute
1268 real_mult_assoc ~> mult_assoc
1269 real_mult_1 ~> mult_1_left
1270 real_add_mult_distrib ~> left_distrib
1271 real_zero_not_eq_one ~> zero_neq_one
1272 real_mult_inverse_left ~> left_inverse
1273 INVERSE_ZERO ~> inverse_zero
1274 real_le_refl ~> order_refl
1275 real_le_antisym ~> order_antisym
1276 real_le_trans ~> order_trans
1277 real_le_linear ~> linear
1278 real_le_eq_diff ~> le_iff_diff_le_0
1279 real_add_left_mono ~> add_left_mono
1280 real_mult_order ~> mult_pos_pos
1281 real_mult_less_mono2 ~> mult_strict_left_mono
1282 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
1283 real_0_le_divide_iff ~> zero_le_divide_iff
1284 realpow_two_disj ~> power2_eq_iff
1285 real_squared_diff_one_factored ~> square_diff_one_factored
1286 realpow_two_diff ~> square_diff_square_factored
1287 reals_complete2 ~> complete_real
1288 real_sum_squared_expand ~> power2_sum
1289 exp_ln_eq ~> ln_unique
1291 expi_zero ~> exp_zero
1292 lemma_DERIV_subst ~> DERIV_cong
1293 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
1294 LIMSEQ_const ~> tendsto_const
1295 LIMSEQ_norm ~> tendsto_norm
1296 LIMSEQ_add ~> tendsto_add
1297 LIMSEQ_minus ~> tendsto_minus
1298 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
1299 LIMSEQ_diff ~> tendsto_diff
1300 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
1301 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
1302 LIMSEQ_mult ~> tendsto_mult
1303 LIMSEQ_inverse ~> tendsto_inverse
1304 LIMSEQ_divide ~> tendsto_divide
1305 LIMSEQ_pow ~> tendsto_power
1306 LIMSEQ_setsum ~> tendsto_setsum
1307 LIMSEQ_setprod ~> tendsto_setprod
1308 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
1309 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
1310 LIMSEQ_imp_rabs ~> tendsto_rabs
1311 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
1312 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
1313 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
1314 LIMSEQ_Complex ~> tendsto_Complex
1315 LIM_ident ~> tendsto_ident_at
1316 LIM_const ~> tendsto_const
1317 LIM_add ~> tendsto_add
1318 LIM_add_zero ~> tendsto_add_zero
1319 LIM_minus ~> tendsto_minus
1320 LIM_diff ~> tendsto_diff
1321 LIM_norm ~> tendsto_norm
1322 LIM_norm_zero ~> tendsto_norm_zero
1323 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
1324 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
1325 LIM_rabs ~> tendsto_rabs
1326 LIM_rabs_zero ~> tendsto_rabs_zero
1327 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
1328 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
1329 LIM_compose ~> tendsto_compose
1330 LIM_mult ~> tendsto_mult
1331 LIM_scaleR ~> tendsto_scaleR
1332 LIM_of_real ~> tendsto_of_real
1333 LIM_power ~> tendsto_power
1334 LIM_inverse ~> tendsto_inverse
1335 LIM_sgn ~> tendsto_sgn
1336 isCont_LIM_compose ~> isCont_tendsto_compose
1337 bounded_linear.LIM ~> bounded_linear.tendsto
1338 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
1339 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
1340 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
1341 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
1342 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
1343 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
1345 * Theory Complex_Main: The definition of infinite series was
1346 generalized. Now it is defined on the type class {topological_space,
1347 comm_monoid_add}. Hence it is useable also for extended real numbers.
1349 * Theory Complex_Main: The complex exponential function "expi" is now
1350 a type-constrained abbreviation for "exp :: complex => complex"; thus
1351 several polymorphic lemmas about "exp" are now applicable to "expi".
1355 - Theory Library/Code_Char_ord provides native ordering of
1356 characters in the target language.
1358 - Commands code_module and code_library are legacy, use export_code
1361 - Method "evaluation" is legacy, use method "eval" instead.
1363 - Legacy evaluator "SML" is deactivated by default. May be
1364 reactivated by the following theory command:
1366 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
1368 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
1370 * New proof method "induction" that gives induction hypotheses the
1371 name "IH", thus distinguishing them from further hypotheses that come
1372 from rule induction. The latter are still called "hyps". Method
1373 "induction" is a thin wrapper around "induct" and follows the same
1376 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
1377 still available as a legacy feature for some time.
1380 - Added "need" and "total_consts" options.
1381 - Reintroduced "show_skolems" option by popular demand.
1382 - Renamed attribute: nitpick_def ~> nitpick_unfold.
1386 - Use quasi-sound (and efficient) translations by default.
1387 - Added support for the following provers: E-ToFoF, LEO-II,
1388 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
1389 - Automatically preplay and minimize proofs before showing them if
1390 this can be done within reasonable time.
1391 - sledgehammer available_provers ~> sledgehammer supported_provers.
1393 - Added "preplay_timeout", "slicing", "type_enc", "sound",
1394 "max_mono_iters", and "max_new_mono_instances" options.
1395 - Removed "explicit_apply" and "full_types" options as well as "Full
1396 Types" Proof General menu item. INCOMPATIBILITY.
1399 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
1400 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
1404 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
1405 "elim:" options. INCOMPATIBILITY.
1406 - Introduced 'try' that not only runs 'try_methods' but also
1407 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
1410 - Added "eval" option to evaluate terms for the found counterexample
1411 (currently only supported by the default (exhaustive) tester).
1412 - Added post-processing of terms to obtain readable counterexamples
1413 (currently only supported by the default (exhaustive) tester).
1414 - New counterexample generator quickcheck[narrowing] enables
1415 narrowing-based testing. Requires the Glasgow Haskell compiler
1416 with its installation location defined in the Isabelle settings
1417 environment as ISABELLE_GHC.
1418 - Removed quickcheck tester "SML" based on the SML code generator
1419 (formly in HOL/Library).
1421 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
1422 use 'partial_function' instead.
1424 * Theory Library/Extended_Reals replaces now the positive extended
1425 reals found in probability theory. This file is extended by
1426 Multivariate_Analysis/Extended_Real_Limits.
1428 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
1429 from where it must be imported explicitly if it is really required.
1432 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
1433 been moved here. INCOMPATIBILITY.
1435 * Theory Library/Saturated provides type of numbers with saturated
1438 * Theory Library/Product_Lattice defines a pointwise ordering for the
1439 product type 'a * 'b, and provides instance proofs for various order
1440 and lattice type classes.
1442 * Theory Library/Countable now provides the "countable_datatype" proof
1443 method for proving "countable" class instances for datatypes.
1445 * Theory Library/Cset_Monad allows do notation for computable sets
1446 (cset) via the generic monad ad-hoc overloading facility.
1448 * Library: Theories of common data structures are split into theories
1449 for implementation, an invariant-ensuring type, and connection to an
1450 abstract type. INCOMPATIBILITY.
1452 - RBT is split into RBT and RBT_Mapping.
1453 - AssocList is split and renamed into AList and AList_Mapping.
1454 - DList is split into DList_Impl, DList, and DList_Cset.
1455 - Cset is split into Cset and List_Cset.
1457 * Theory Library/Nat_Infinity has been renamed to
1458 Library/Extended_Nat, with name changes of the following types and
1461 type inat ~> type enat
1463 Infty ~> infinity (overloaded)
1467 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
1468 been renamed accordingly. INCOMPATIBILITY.
1470 * Session Multivariate_Analysis: The euclidean_space type class now
1471 fixes a constant "Basis :: 'a set" consisting of the standard
1472 orthonormal basis for the type. Users now have the option of
1473 quantifying over this set instead of using the "basis" function, e.g.
1474 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
1476 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
1477 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
1478 "Cart_nth" and "Cart_lambda" have been respectively renamed to
1479 "vec_nth" and "vec_lambda"; theorems mentioning those names have
1480 changed to match. Definition theorems for overloaded constants now use
1481 the standard "foo_vec_def" naming scheme. A few other theorems have
1482 been renamed as follows (INCOMPATIBILITY):
1484 Cart_eq ~> vec_eq_iff
1485 dist_nth_le_cart ~> dist_vec_nth_le
1486 tendsto_vector ~> vec_tendstoI
1487 Cauchy_vector ~> vec_CauchyI
1489 * Session Multivariate_Analysis: Several duplicate theorems have been
1490 removed, and other theorems have been renamed or replaced with more
1491 general versions. INCOMPATIBILITY.
1493 finite_choice ~> finite_set_choice
1494 eventually_conjI ~> eventually_conj
1495 eventually_and ~> eventually_conj_iff
1496 eventually_false ~> eventually_False
1497 setsum_norm ~> norm_setsum
1498 Lim_sequentially ~> LIMSEQ_def
1499 Lim_ident_at ~> LIM_ident
1500 Lim_const ~> tendsto_const
1501 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
1502 Lim_neg ~> tendsto_minus
1503 Lim_add ~> tendsto_add
1504 Lim_sub ~> tendsto_diff
1505 Lim_mul ~> tendsto_scaleR
1506 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
1507 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
1508 Lim_linear ~> bounded_linear.tendsto
1509 Lim_component ~> tendsto_euclidean_component
1510 Lim_component_cart ~> tendsto_vec_nth
1511 Lim_inner ~> tendsto_inner [OF tendsto_const]
1512 dot_lsum ~> inner_setsum_left
1513 dot_rsum ~> inner_setsum_right
1514 continuous_cmul ~> continuous_scaleR [OF continuous_const]
1515 continuous_neg ~> continuous_minus
1516 continuous_sub ~> continuous_diff
1517 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
1518 continuous_mul ~> continuous_scaleR
1519 continuous_inv ~> continuous_inverse
1520 continuous_at_within_inv ~> continuous_at_within_inverse
1521 continuous_at_inv ~> continuous_at_inverse
1522 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
1523 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
1524 continuous_at_component ~> continuous_component [OF continuous_at_id]
1525 continuous_on_neg ~> continuous_on_minus
1526 continuous_on_sub ~> continuous_on_diff
1527 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
1528 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
1529 continuous_on_mul ~> continuous_on_scaleR
1530 continuous_on_mul_real ~> continuous_on_mult
1531 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
1532 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
1533 continuous_on_inverse ~> continuous_on_inv
1534 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
1535 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
1536 subset_interior ~> interior_mono
1537 subset_closure ~> closure_mono
1538 closure_univ ~> closure_UNIV
1539 real_arch_lt ~> reals_Archimedean2
1540 real_arch ~> reals_Archimedean3
1541 real_abs_norm ~> abs_norm_cancel
1542 real_abs_sub_norm ~> norm_triangle_ineq3
1543 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
1545 * Session HOL-Probability:
1546 - Caratheodory's extension lemma is now proved for ring_of_sets.
1547 - Infinite products of probability measures are now available.
1548 - Sigma closure is independent, if the generator is independent
1549 - Use extended reals instead of positive extended
1550 reals. INCOMPATIBILITY.
1552 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
1554 expand_fun_below ~> fun_below_iff
1555 below_fun_ext ~> fun_belowI
1556 expand_cfun_eq ~> cfun_eq_iff
1557 ext_cfun ~> cfun_eqI
1558 expand_cfun_below ~> cfun_below_iff
1559 below_cfun_ext ~> cfun_belowI
1560 monofun_fun_fun ~> fun_belowD
1561 monofun_fun_arg ~> monofunE
1562 monofun_lub_fun ~> adm_monofun [THEN admD]
1563 cont_lub_fun ~> adm_cont [THEN admD]
1564 cont2cont_Rep_CFun ~> cont2cont_APP
1565 cont_Rep_CFun_app ~> cont_APP_app
1566 cont_Rep_CFun_app_app ~> cont_APP_app_app
1567 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
1568 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
1569 contlub_cfun ~> lub_APP [symmetric]
1570 contlub_LAM ~> lub_LAM [symmetric]
1573 lift_distinct1 ~> lift.distinct(1)
1574 lift_distinct2 ~> lift.distinct(2)
1575 Def_not_UU ~> lift.distinct(2)
1576 Def_inject ~> lift.inject
1577 below_UU_iff ~> below_bottom_iff
1578 eq_UU_iff ~> eq_bottom_iff
1581 *** Document preparation ***
1583 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
1584 isar-ref manual, both for description and actual application of the
1587 * Antiquotation @{value} evaluates the given term and presents its
1590 * Antiquotations: term style "isub" provides ad-hoc conversion of
1591 variables x1, y23 into subscripted form x\<^isub>1,
1592 y\<^isub>2\<^isub>3.
1594 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
1595 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
1597 * Localized \isabellestyle switch can be used within blocks or groups
1600 \isabellestyle{it} %preferred default
1601 {\isabellestylett @{text "typewriter stuff"}}
1603 * Discontinued special treatment of hard tabulators. Implicit
1604 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
1610 * The inner syntax of sort/type/term/prop supports inlined YXML
1611 representations within quoted string tokens. By encoding logical
1612 entities via Term_XML (in ML or Scala) concrete syntax can be
1613 bypassed, which is particularly useful for producing bits of text
1614 under external program control.
1616 * Antiquotations for ML and document preparation are managed as theory
1617 data, which requires explicit setup.
1619 * Isabelle_Process.is_active allows tools to check if the official
1620 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
1621 (better known as Proof General).
1623 * Structure Proof_Context follows standard naming scheme. Old
1624 ProofContext is still available for some time as legacy alias.
1626 * Structure Timing provides various operations for timing; supersedes
1627 former start_timing/end_timing etc.
1629 * Path.print is the official way to show file-system paths to users
1630 (including quotes etc.).
1632 * Inner syntax: identifiers in parse trees of generic categories
1633 "logic", "aprop", "idt" etc. carry position information (disguised as
1634 type constraints). Occasional INCOMPATIBILITY with non-compliant
1635 translations that choke on unexpected type constraints. Positions can
1636 be stripped in ML translations via Syntax.strip_positions /
1637 Syntax.strip_positions_ast, or via the syntax constant
1638 "_strip_positions" within parse trees. As last resort, positions can
1639 be disabled via the configuration option Syntax.positions, which is
1640 called "syntax_positions" in Isar attribute syntax.
1642 * Discontinued special status of various ML structures that contribute
1643 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
1644 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
1645 refer directly to Ast.Constant, Lexicon.is_identifier,
1646 Syntax_Trans.mk_binder_tr etc.
1648 * Typed print translation: discontinued show_sorts argument, which is
1649 already available via context of "advanced" translation.
1651 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
1652 goal states; body tactic needs to address all subgoals uniformly.
1654 * Slightly more special eq_list/eq_set, with shortcut involving
1655 pointer equality (assumes that eq relation is reflexive).
1657 * Classical tactics use proper Proof.context instead of historic types
1658 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
1659 operate directly on Proof.context. Raw type claset retains its use as
1660 snapshot of the classical context, which can be recovered via
1661 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
1662 INCOMPATIBILITY, classical tactics and derived proof methods require
1663 proper Proof.context.
1668 * Discontinued support for Poly/ML 5.2, which was the last version
1669 without proper multithreading and TimeLimit implementation.
1671 * Discontinued old lib/scripts/polyml-platform, which has been
1672 obsolete since Isabelle2009-2.
1674 * Various optional external tools are referenced more robustly and
1675 uniformly by explicit Isabelle settings as follows:
1677 ISABELLE_CSDP (formerly CSDP_EXE)
1678 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
1679 ISABELLE_OCAML (formerly EXEC_OCAML)
1680 ISABELLE_SWIPL (formerly EXEC_SWIPL)
1681 ISABELLE_YAP (formerly EXEC_YAP)
1683 Note that automated detection from the file-system or search path has
1684 been discontinued. INCOMPATIBILITY.
1686 * Scala layer provides JVM method invocation service for static
1687 methods of type (String)String, see Invoke_Scala.method in ML. For
1690 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
1692 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
1693 this allows to pass structured values between ML and Scala.
1695 * The IsabelleText fonts includes some further glyphs to support the
1696 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
1697 installed a local copy (which is normally *not* required) need to
1698 delete or update it from ~~/lib/fonts/.
1702 New in Isabelle2011 (January 2011)
1703 ----------------------------------
1707 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
1708 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
1709 useful tooltips and hyperlinks produced from its static analysis. The
1710 bundled component provides an executable Isabelle tool that can be run
1713 Isabelle2011/bin/isabelle jedit
1715 * Significantly improved Isabelle/Isar implementation manual.
1717 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
1718 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
1719 while the default heap location within that directory lacks that extra
1720 suffix. This isolates multiple Isabelle installations from each
1721 other, avoiding problems with old settings in new versions.
1722 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
1724 * Source files are always encoded as UTF-8, instead of old-fashioned
1725 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
1726 the following package declarations:
1728 \usepackage[utf8]{inputenc}
1729 \usepackage{textcomp}
1731 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
1732 a Unicode character is treated as a single symbol, not a sequence of
1733 non-ASCII bytes as before. Since Isabelle/ML string literals may
1734 contain symbols without further backslash escapes, Unicode can now be
1735 used here as well. Recall that Symbol.explode in ML provides a
1736 consistent view on symbols, while raw explode (or String.explode)
1737 merely give a byte-oriented representation.
1739 * Theory loader: source files are primarily located via the master
1740 directory of each theory node (where the .thy file itself resides).
1741 The global load path is still partially available as legacy feature.
1742 Minor INCOMPATIBILITY due to subtle change in file lookup: use
1743 explicit paths, relatively to the theory.
1745 * Special treatment of ML file names has been discontinued.
1746 Historically, optional extensions .ML or .sml were added on demand --
1747 at the cost of clarity of file dependencies. Recall that Isabelle/ML
1748 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
1750 * Various options that affect pretty printing etc. are now properly
1751 handled within the context via configuration options, instead of
1752 unsynchronized references or print modes. There are both ML Config.T
1753 entities and Isar declaration attributes to access these.
1755 ML (Config.T) Isar (attribute)
1757 eta_contract eta_contract
1758 show_brackets show_brackets
1759 show_sorts show_sorts
1760 show_types show_types
1761 show_question_marks show_question_marks
1762 show_consts show_consts
1763 show_abbrevs show_abbrevs
1765 Syntax.ast_trace syntax_ast_trace
1766 Syntax.ast_stat syntax_ast_stat
1767 Syntax.ambiguity_level syntax_ambiguity_level
1769 Goal_Display.goals_limit goals_limit
1770 Goal_Display.show_main_goal show_main_goal
1772 Method.rule_trace rule_trace
1774 Thy_Output.display thy_output_display
1775 Thy_Output.quotes thy_output_quotes
1776 Thy_Output.indent thy_output_indent
1777 Thy_Output.source thy_output_source
1778 Thy_Output.break thy_output_break
1780 Note that corresponding "..._default" references in ML may only be
1781 changed globally at the ROOT session setup, but *not* within a theory.
1782 The option "show_abbrevs" supersedes the former print mode
1783 "no_abbrevs" with inverted meaning.
1785 * More systematic naming of some configuration options.
1788 trace_simp ~> simp_trace
1789 debug_simp ~> simp_debug
1791 * Support for real valued configuration options, using simplistic
1792 floating-point notation that coincides with the inner syntax for
1795 * Support for real valued preferences (with approximative PGIP type):
1796 front-ends need to accept "pgint" values in float notation.
1799 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
1802 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
1807 * Command 'type_synonym' (with single argument) replaces somewhat
1808 outdated 'types', which is still available as legacy feature for some
1811 * Command 'nonterminal' (with 'and' separated list of arguments)
1812 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
1814 * Command 'notepad' replaces former 'example_proof' for
1815 experimentation in Isar without any result. INCOMPATIBILITY.
1817 * Locale interpretation commands 'interpret' and 'sublocale' accept
1818 lists of equations to map definitions in a locale to appropriate
1819 entities in the context of the interpretation. The 'interpretation'
1820 command already provided this functionality.
1822 * Diagnostic command 'print_dependencies' prints the locale instances
1823 that would be activated if the specified expression was interpreted in
1824 the current context. Variant "print_dependencies!" assumes a context
1825 without interpretations.
1827 * Diagnostic command 'print_interps' prints interpretations in proofs
1828 in addition to interpretations in theories.
1830 * Discontinued obsolete 'global' and 'local' commands to manipulate
1831 the theory name space. Rare INCOMPATIBILITY. The ML functions
1832 Sign.root_path and Sign.local_path may be applied directly where this
1833 feature is still required for historical reasons.
1835 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
1836 'definition' instead.
1838 * The "prems" fact, which refers to the accidental collection of
1839 foundational premises in the context, is now explicitly marked as
1840 legacy feature and will be discontinued soon. Consider using "assms"
1841 of the head statement or reference facts by explicit names.
1843 * Document antiquotations @{class} and @{type} print classes and type
1846 * Document antiquotation @{file} checks file/directory entries within
1847 the local file system.
1852 * Coercive subtyping: functions can be declared as coercions and type
1853 inference will add them as necessary upon input of a term. Theory
1854 Complex_Main declares real :: nat => real and real :: int => real as
1855 coercions. A coercion function f is declared like this:
1857 declare [[coercion f]]
1859 To lift coercions through type constructors (e.g. from nat => real to
1860 nat list => real list), map functions can be declared, e.g.
1862 declare [[coercion_map map]]
1864 Currently coercion inference is activated only in theories including
1865 real numbers, i.e. descendants of Complex_Main. This is controlled by
1866 the configuration option "coercion_enabled", e.g. it can be enabled in
1867 other theories like this:
1869 declare [[coercion_enabled]]
1871 * Command 'partial_function' provides basic support for recursive
1872 function definitions over complete partial orders. Concrete instances
1873 are provided for i) the option type, ii) tail recursion on arbitrary
1874 types, and iii) the heap monad of Imperative_HOL. See
1875 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
1878 * Function package: f.psimps rules are no longer implicitly declared
1879 as [simp]. INCOMPATIBILITY.
1881 * Datatype package: theorems generated for executable equality (class
1882 "eq") carry proper names and are treated as default code equations.
1884 * Inductive package: now offers command 'inductive_simps' to
1885 automatically derive instantiated and simplified equations for
1886 inductive predicates, similar to 'inductive_cases'.
1888 * Command 'enriched_type' allows to register properties of the
1889 functorial structure of types.
1891 * Improved infrastructure for term evaluation using code generator
1892 techniques, in particular static evaluation conversions.
1894 * Code generator: Scala (2.8 or higher) has been added to the target
1897 * Code generator: globbing constant expressions "*" and "Theory.*"
1898 have been replaced by the more idiomatic "_" and "Theory._".
1901 * Code generator: export_code without explicit file declaration prints
1902 to standard output. INCOMPATIBILITY.
1904 * Code generator: do not print function definitions for case
1905 combinators any longer.
1907 * Code generator: simplification with rules determined with
1908 src/Tools/Code/code_simp.ML and method "code_simp".
1910 * Code generator for records: more idiomatic representation of record
1911 types. Warning: records are not covered by ancient SML code
1912 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
1913 rep_datatype declaration helps to succeed then:
1917 rep_datatype foo_ext ...
1919 * Records: logical foundation type for records does not carry a
1920 '_type' suffix any longer (obsolete due to authentic syntax).
1923 * Quickcheck now by default uses exhaustive testing instead of random
1924 testing. Random testing can be invoked by "quickcheck [random]",
1925 exhaustive testing by "quickcheck [exhaustive]".
1927 * Quickcheck instantiates polymorphic types with small finite
1928 datatypes by default. This enables a simple execution mechanism to
1929 handle quantifiers and function equality over the finite datatypes.
1931 * Quickcheck random generator has been renamed from "code" to
1932 "random". INCOMPATIBILITY.
1934 * Quickcheck now has a configurable time limit which is set to 30
1935 seconds by default. This can be changed by adding [timeout = n] to the
1936 quickcheck command. The time limit for Auto Quickcheck is still set
1939 * Quickcheck in locales considers interpretations of that locale for
1940 counter example search.
1943 - Added "smt" and "remote_smt" provers based on the "smt" proof
1944 method. See the Sledgehammer manual for details ("isabelle doc
1947 sledgehammer atp_info ~> sledgehammer running_provers
1948 sledgehammer atp_kill ~> sledgehammer kill_provers
1949 sledgehammer available_atps ~> sledgehammer available_provers
1952 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
1953 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
1954 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
1955 (and "ms" and "min" are no longer supported)
1960 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
1961 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
1963 - Added support for partial quotient types.
1964 - Added local versions of the "Nitpick.register_xxx" functions.
1965 - Added "whack" option.
1966 - Allow registration of quotient types as codatatypes.
1967 - Improved "merge_type_vars" option to merge more types.
1968 - Removed unsound "fast_descrs" option.
1969 - Added custom symmetry breaking for datatypes, making it possible to reach
1970 higher cardinalities.
1971 - Prevent the expansion of too large definitions.
1973 * Proof methods "metis" and "meson" now have configuration options
1974 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
1975 to diagnose these tools. E.g.
1977 using [[metis_trace = true]]
1979 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
1980 manually as command 'solve_direct'.
1982 * The default SMT solver Z3 must be enabled explicitly (due to
1983 licensing issues) by setting the environment variable
1984 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
1985 commercial applications, the SMT solver CVC3 is provided as fall-back;
1986 changing the SMT solver is done via the configuration option
1989 * Remote SMT solvers need to be referred to by the "remote_" prefix,
1990 i.e. "remote_cvc3" and "remote_z3".
1992 * Added basic SMT support for datatypes, records, and typedefs using
1993 the oracle mode (no proofs). Direct support of pairs has been dropped
1994 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
1995 support for a similar behavior). Minor INCOMPATIBILITY.
1997 * Changed SMT configuration options:
1999 z3_proofs ~> smt_oracle (with inverted meaning)
2000 z3_trace_assms ~> smt_trace_used_facts
2013 * Boogie output files (.b2i files) need to be declared in the theory
2016 * Simplification procedure "list_to_set_comprehension" rewrites list
2017 comprehensions applied to List.set to set comprehensions. Occasional
2018 INCOMPATIBILITY, may be deactivated like this:
2020 declare [[simproc del: list_to_set_comprehension]]
2022 * Removed old version of primrec package. INCOMPATIBILITY.
2024 * Removed simplifier congruence rule of "prod_case", as has for long
2025 been the case with "split". INCOMPATIBILITY.
2027 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
2029 * Removed [split_format ... and ... and ...] version of
2030 [split_format]. Potential INCOMPATIBILITY.
2032 * Predicate "sorted" now defined inductively, with nice induction
2033 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
2035 * Constant "contents" renamed to "the_elem", to free the generic name
2036 contents for other uses. INCOMPATIBILITY.
2038 * Renamed class eq and constant eq (for code generation) to class
2039 equal and constant equal, plus renaming of related facts and various
2040 tuning. INCOMPATIBILITY.
2042 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
2044 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
2047 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
2048 avoid confusion with finite sets. INCOMPATIBILITY.
2050 * Abandoned locales equiv, congruent and congruent2 for equivalence
2051 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
2054 * Some previously unqualified names have been qualified:
2061 Trueprop ~> HOL.Trueprop
2066 op --> ~> HOL.implies
2078 Pair ~> Product_Type.Pair
2079 fst ~> Product_Type.fst
2080 snd ~> Product_Type.snd
2081 curry ~> Product_Type.curry
2083 Collect ~> Set.Collect
2087 * More canonical naming convention for some fundamental definitions:
2089 bot_bool_eq ~> bot_bool_def
2090 top_bool_eq ~> top_bool_def
2091 inf_bool_eq ~> inf_bool_def
2092 sup_bool_eq ~> sup_bool_def
2093 bot_fun_eq ~> bot_fun_def
2094 top_fun_eq ~> top_fun_def
2095 inf_fun_eq ~> inf_fun_def
2096 sup_fun_eq ~> sup_fun_def
2100 * More stylized fact names:
2102 expand_fun_eq ~> fun_eq_iff
2103 expand_set_eq ~> set_eq_iff
2105 nat_number ~> eval_nat_numeral
2109 * Refactoring of code-generation specific operations in theory List:
2115 mem_iff ~> member_def
2116 null_empty ~> null_def
2118 INCOMPATIBILITY. Note that these were not supposed to be used
2119 regularly unless for striking reasons; their main purpose was code
2122 Various operations from the Haskell prelude are used for generating
2125 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
2126 "surj f" is now an abbreviation of "range f = UNIV". The theorems
2127 bij_def and surj_def are unchanged. INCOMPATIBILITY.
2129 * Abolished some non-alphabetic type names: "prod" and "sum" replace
2130 "*" and "+" respectively. INCOMPATIBILITY.
2132 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
2133 "Sum_Type.Plus" instead.
2135 * Constant "split" has been merged with constant "prod_case"; names of
2136 ML functions, facts etc. involving split have been retained so far,
2137 though. INCOMPATIBILITY.
2139 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
2140 instead. INCOMPATIBILITY.
2142 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
2145 * Former theory Library/Enum is now part of the HOL-Main image.
2146 INCOMPATIBILITY: all constants of the Enum theory now have to be
2147 referred to by its qualified name.
2150 nlists ~> Enum.nlists
2151 product ~> Enum.product
2153 * Theory Library/Monad_Syntax provides do-syntax for monad types.
2154 Syntax in Library/State_Monad has been changed to avoid ambiguities.
2157 * Theory Library/SetsAndFunctions has been split into
2158 Library/Function_Algebras and Library/Set_Algebras; canonical names
2159 for instance definitions for functions; various improvements.
2162 * Theory Library/Multiset provides stable quicksort implementation of
2165 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
2168 * Session Multivariate_Analysis: introduced a type class for euclidean
2169 space. Most theorems are now stated in terms of euclidean spaces
2170 instead of finite cartesian products.
2173 real ^ 'n ~> 'a::real_vector
2174 ~> 'a::euclidean_space
2175 ~> 'a::ordered_euclidean_space
2176 (depends on your needs)
2180 \<chi> x. _ ~> \<chi>\<chi> x. _
2183 Also note that the indices are now natural numbers and not from some
2184 finite type. Finite cartesian products of euclidean spaces, products
2185 of euclidean spaces the real and complex numbers are instantiated to
2186 be euclidean_spaces. INCOMPATIBILITY.
2188 * Session Probability: introduced pextreal as positive extended real
2189 numbers. Use pextreal as value for measures. Introduce the
2190 Radon-Nikodym derivative, product spaces and Fubini's theorem for
2191 arbitrary sigma finite measures. Introduces Lebesgue measure based on
2192 the integral in Multivariate Analysis. INCOMPATIBILITY.
2194 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
2197 * Session SPARK (with image HOL-SPARK) provides commands to load and
2198 prove verification conditions generated by the SPARK Ada program
2199 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
2204 * Theorems for additive ring operations (locale abelian_monoid and
2205 descendants) are generated by interpretation from their multiplicative
2206 counterparts. Names (in particular theorem names) have the mandatory
2207 qualifier 'add'. Previous theorem names are redeclared for
2210 * Structure "int_ring" is now an abbreviation (previously a
2211 definition). This fits more natural with advanced interpretations.
2216 * The domain package now runs in definitional mode by default: The
2217 former command 'new_domain' is now called 'domain'. To use the domain
2218 package in its original axiomatic mode, use 'domain (unsafe)'.
2221 * The new class "domain" is now the default sort. Class "predomain"
2222 is an unpointed version of "domain". Theories can be updated by
2223 replacing sort annotations as shown below. INCOMPATIBILITY.
2225 'a::type ~> 'a::countable
2226 'a::cpo ~> 'a::predomain
2227 'a::pcpo ~> 'a::domain
2229 * The old type class "rep" has been superseded by class "domain".
2230 Accordingly, users of the definitional package must remove any
2231 "default_sort rep" declarations. INCOMPATIBILITY.
2233 * The domain package (definitional mode) now supports unpointed
2234 predomain argument types, as long as they are marked 'lazy'. (Strict
2235 arguments must be in class "domain".) For example, the following
2236 domain definition now works:
2238 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
2240 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
2241 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
2242 'a option, and 'a list. Additionally, it configures fixrec and the
2243 domain package to work with these types. For example:
2245 fixrec isInl :: "('a + 'b) u -> tr"
2246 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
2248 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
2250 * The "(permissive)" option of fixrec has been replaced with a
2251 per-equation "(unchecked)" option. See
2252 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
2254 * The "bifinite" class no longer fixes a constant "approx"; the class
2255 now just asserts that such a function exists. INCOMPATIBILITY.
2257 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
2258 defines an embedding of type 'a defl into udom by default; instances
2259 of "bifinite" and "domain" classes are available in
2260 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
2262 * The syntax "REP('a)" has been replaced with "DEFL('a)".
2264 * The predicate "directed" has been removed. INCOMPATIBILITY.
2266 * The type class "finite_po" has been removed. INCOMPATIBILITY.
2268 * The function "cprod_map" has been renamed to "prod_map".
2271 * The monadic bind operator on each powerdomain has new binder syntax
2272 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
2273 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
2275 * The infix syntax for binary union on each powerdomain has changed
2276 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
2277 syntax. INCOMPATIBILITY.
2279 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
2280 still supported as an input translation.
2282 * Renamed some theorems (the original names are also still available).
2284 expand_fun_below ~> fun_below_iff
2285 below_fun_ext ~> fun_belowI
2286 expand_cfun_eq ~> cfun_eq_iff
2287 ext_cfun ~> cfun_eqI
2288 expand_cfun_below ~> cfun_below_iff
2289 below_cfun_ext ~> cfun_belowI
2290 cont2cont_Rep_CFun ~> cont2cont_APP
2292 * The Abs and Rep functions for various types have changed names.
2293 Related theorem names have also changed to match. INCOMPATIBILITY.
2295 Rep_CFun ~> Rep_cfun
2296 Abs_CFun ~> Abs_cfun
2297 Rep_Sprod ~> Rep_sprod
2298 Abs_Sprod ~> Abs_sprod
2299 Rep_Ssum ~> Rep_ssum
2300 Abs_Ssum ~> Abs_ssum
2302 * Lemmas with names of the form *_defined_iff or *_strict_iff have
2303 been renamed to *_bottom_iff. INCOMPATIBILITY.
2305 * Various changes to bisimulation/coinduction with domain package:
2307 - Definitions of "bisim" constants no longer mention definedness.
2308 - With mutual recursion, "bisim" predicate is now curried.
2309 - With mutual recursion, each type gets a separate coind theorem.
2310 - Variable names in bisim_def and coinduct rules have changed.
2314 * Case combinators generated by the domain package for type "foo" are
2315 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
2317 * Several theorems have been renamed to more accurately reflect the
2318 names of constants and types involved. INCOMPATIBILITY.
2320 thelub_const ~> lub_const
2321 lub_const ~> is_lub_const
2323 is_lub_lub ~> is_lubD2
2325 unique_lub ~> is_lub_unique
2326 is_ub_lub ~> is_lub_rangeD1
2327 lub_bin_chain ~> is_lub_bin_chain
2328 lub_fun ~> is_lub_fun
2329 thelub_fun ~> lub_fun
2330 thelub_cfun ~> lub_cfun
2331 thelub_Pair ~> lub_Pair
2332 lub_cprod ~> is_lub_prod
2333 thelub_cprod ~> lub_prod
2334 minimal_cprod ~> minimal_prod
2335 inst_cprod_pcpo ~> inst_prod_pcpo
2337 compact_UU ~> compact_bottom
2338 deflation_UU ~> deflation_bottom
2339 finite_deflation_UU ~> finite_deflation_bottom
2341 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
2343 sq_ord_less_eq_trans ~> below_eq_trans
2344 sq_ord_eq_less_trans ~> eq_below_trans
2345 refl_less ~> below_refl
2346 trans_less ~> below_trans
2347 antisym_less ~> below_antisym
2348 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
2349 box_less ~> box_below
2350 rev_trans_less ~> rev_below_trans
2351 not_less2not_eq ~> not_below2not_eq
2352 less_UU_iff ~> below_UU_iff
2353 flat_less_iff ~> flat_below_iff
2354 adm_less ~> adm_below
2355 adm_not_less ~> adm_not_below
2356 adm_compact_not_less ~> adm_compact_not_below
2357 less_fun_def ~> below_fun_def
2358 expand_fun_less ~> fun_below_iff
2359 less_fun_ext ~> fun_belowI
2360 less_discr_def ~> below_discr_def
2361 discr_less_eq ~> discr_below_eq
2362 less_unit_def ~> below_unit_def
2363 less_cprod_def ~> below_prod_def
2364 prod_lessI ~> prod_belowI
2365 Pair_less_iff ~> Pair_below_iff
2366 fst_less_iff ~> fst_below_iff
2367 snd_less_iff ~> snd_below_iff
2368 expand_cfun_less ~> cfun_below_iff
2369 less_cfun_ext ~> cfun_belowI
2370 injection_less ~> injection_below
2371 less_up_def ~> below_up_def
2372 not_Iup_less ~> not_Iup_below
2373 Iup_less ~> Iup_below
2375 Def_inject_less_eq ~> Def_below_Def
2376 Def_less_is_eq ~> Def_below_iff
2377 spair_less_iff ~> spair_below_iff
2378 less_sprod ~> below_sprod
2379 spair_less ~> spair_below
2380 sfst_less_iff ~> sfst_below_iff
2381 ssnd_less_iff ~> ssnd_below_iff
2382 fix_least_less ~> fix_least_below
2383 dist_less_one ~> dist_below_one
2384 less_ONE ~> below_ONE
2385 ONE_less_iff ~> ONE_below_iff
2386 less_sinlD ~> below_sinlD
2387 less_sinrD ~> below_sinrD
2392 * All constant names are now qualified internally and use proper
2393 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
2398 * Antiquotation @{assert} inlines a function bool -> unit that raises
2399 Fail if the argument is false. Due to inlining the source position of
2400 failed assertions is included in the error output.
2402 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
2403 text is in practice always evaluated with a stable theory checkpoint.
2404 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
2406 * Antiquotation @{theory A} refers to theory A from the ancestry of
2407 the current context, not any accidental theory loader state as before.
2408 Potential INCOMPATIBILITY, subtle change in semantics.
2410 * Syntax.pretty_priority (default 0) configures the required priority
2411 of pretty-printed output and thus affects insertion of parentheses.
2413 * Syntax.default_root (default "any") configures the inner syntax
2414 category (nonterminal symbol) for parsing of terms.
2416 * Former exception Library.UnequalLengths now coincides with
2417 ListPair.UnequalLengths.
2419 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
2420 main functionality is provided by structure Simplifier.
2422 * Renamed raw "explode" function to "raw_explode" to emphasize its
2423 meaning. Note that internally to Isabelle, Symbol.explode is used in
2424 almost all situations.
2426 * Discontinued obsolete function sys_error and exception SYS_ERROR.
2427 See implementation manual for further details on exceptions in
2430 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
2433 * Renamed structure PureThy to Pure_Thy and moved most of its
2434 operations to structure Global_Theory, to emphasize that this is
2435 rarely-used global-only stuff.
2437 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
2438 instead (or tracing for high-volume output).
2440 * Configuration option show_question_marks only affects regular pretty
2441 printing of types and terms, not raw Term.string_of_vname.
2443 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
2444 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
2445 @{thms} for most purposes.
2447 * ML structure Unsynchronized is never opened, not even in Isar
2448 interaction mode as before. Old Unsynchronized.set etc. have been
2449 discontinued -- use plain := instead. This should be *rare* anyway,
2450 since modern tools always work via official context data, notably
2451 configuration options.
2453 * Parallel and asynchronous execution requires special care concerning
2454 interrupts. Structure Exn provides some convenience functions that
2455 avoid working directly with raw Interrupt. User code must not absorb
2456 interrupts -- intermediate handling (for cleanup etc.) needs to be
2457 followed by re-raising of the original exception. Another common
2458 source of mistakes are "handle _" patterns, which make the meaning of
2459 the program subject to physical effects of the environment.
2463 New in Isabelle2009-2 (June 2010)
2464 ---------------------------------
2468 * Authentic syntax for *all* logical entities (type classes, type
2469 constructors, term constants): provides simple and robust
2470 correspondence between formal entities and concrete syntax. Within
2471 the parse tree / AST representations, "constants" are decorated by
2472 their category (class, type, const) and spelled out explicitly with
2473 their full internal name.
2475 Substantial INCOMPATIBILITY concerning low-level syntax declarations
2476 and translations (translation rules and translation functions in ML).
2477 Some hints on upgrading:
2479 - Many existing uses of 'syntax' and 'translations' can be replaced
2480 by more modern 'type_notation', 'notation' and 'abbreviation',
2481 which are independent of this issue.
2483 - 'translations' require markup within the AST; the term syntax
2484 provides the following special forms:
2486 CONST c -- produces syntax version of constant c from context
2487 XCONST c -- literally c, checked as constant from context
2488 c -- literally c, if declared by 'syntax'
2490 Plain identifiers are treated as AST variables -- occasionally the
2491 system indicates accidental variables via the error "rhs contains
2494 Type classes and type constructors are marked according to their
2495 concrete syntax. Some old translations rules need to be written
2496 for the "type" category, using type constructor application
2497 instead of pseudo-term application of the default category
2500 - 'parse_translation' etc. in ML may use the following
2503 @{class_syntax c} -- type class c within parse tree / AST
2504 @{term_syntax c} -- type constructor c within parse tree / AST
2505 @{const_syntax c} -- ML version of "CONST c" above
2506 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
2508 - Literal types within 'typed_print_translations', i.e. those *not*
2509 represented as pseudo-terms are represented verbatim. Use @{class
2510 c} or @{type_name c} here instead of the above syntax
2513 Note that old non-authentic syntax was based on unqualified base
2514 names, so all of the above "constant" names would coincide. Recall
2515 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
2516 diagnose syntax problems.
2518 * Type constructors admit general mixfix syntax, not just infix.
2520 * Concrete syntax may be attached to local entities without a proof
2521 body, too. This works via regular mixfix annotations for 'fix',
2522 'def', 'obtain' etc. or via the explicit 'write' command, which is
2523 similar to the 'notation' command in theory specifications.
2525 * Discontinued unnamed infix syntax (legacy feature for many years) --
2526 need to specify constant name and syntax separately. Internal ML
2527 datatype constructors have been renamed from InfixName to Infix etc.
2528 Minor INCOMPATIBILITY.
2530 * Schematic theorem statements need to be explicitly markup as such,
2531 via commands 'schematic_lemma', 'schematic_theorem',
2532 'schematic_corollary'. Thus the relevance of the proof is made
2533 syntactically clear, which impacts performance in a parallel or
2534 asynchronous interactive environment. Minor INCOMPATIBILITY.
2536 * Use of cumulative prems via "!" in some proof methods has been
2537 discontinued (old legacy feature).
2539 * References 'trace_simp' and 'debug_simp' have been replaced by
2540 configuration options stored in the context. Enabling tracing (the
2541 case of debugging is similar) in proofs works via
2543 using [[trace_simp = true]]
2545 Tracing is then active for all invocations of the simplifier in
2546 subsequent goal refinement steps. Tracing may also still be enabled or
2547 disabled via the ProofGeneral settings menu.
2549 * Separate commands 'hide_class', 'hide_type', 'hide_const',
2550 'hide_fact' replace the former 'hide' KIND command. Minor
2553 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
2554 more efficient than combinations with -q1 or -q2.
2559 * Proofterms record type-class reasoning explicitly, using the
2560 "unconstrain" operation internally. This eliminates all sort
2561 constraints from a theorem and proof, introducing explicit
2562 OFCLASS-premises. On the proof term level, this operation is
2563 automatically applied at theorem boundaries, such that closed proofs
2564 are always free of sort constraints. INCOMPATIBILITY for tools that
2565 inspect proof terms.
2567 * Local theory specifications may depend on extra type variables that
2568 are not present in the result type -- arguments TYPE('a) :: 'a itself
2569 are added internally. For example:
2571 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
2573 * Predicates of locales introduced by classes carry a mandatory
2574 "class" prefix. INCOMPATIBILITY.
2576 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
2578 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
2581 * Command 'code_reflect' allows to incorporate generated ML code into
2582 runtime environment; replaces immature code_datatype antiquotation.
2585 * Code generator: simple concept for abstract datatypes obeying
2588 * Code generator: details of internal data cache have no impact on the
2589 user space functionality any longer.
2591 * Methods "unfold_locales" and "intro_locales" ignore non-locale
2592 subgoals. This is more appropriate for interpretations with 'where'.
2595 * Command 'example_proof' opens an empty proof body. This allows to
2596 experiment with Isar, without producing any persistent result.
2598 * Commands 'type_notation' and 'no_type_notation' declare type syntax
2599 within a local theory context, with explicit checking of the
2600 constructors involved (in contrast to the raw 'syntax' versions).
2602 * Commands 'types' and 'typedecl' now work within a local theory
2603 context -- without introducing dependencies on parameters or
2604 assumptions, which is not possible in Isabelle/Pure.
2606 * Command 'defaultsort' has been renamed to 'default_sort', it works
2607 within a local theory context. Minor INCOMPATIBILITY.
2612 * Command 'typedef' now works within a local theory context -- without
2613 introducing dependencies on parameters or assumptions, which is not
2614 possible in Isabelle/Pure/HOL. Note that the logical environment may
2615 contain multiple interpretations of local typedefs (with different
2616 non-emptiness proofs), even in a global theory context.
2618 * New package for quotient types. Commands 'quotient_type' and
2619 'quotient_definition' may be used for defining types and constants by
2620 quotient constructions. An example is the type of integers created by
2621 quotienting pairs of natural numbers:
2624 intrel :: "(nat * nat) => (nat * nat) => bool"
2626 "intrel (x, y) (u, v) = (x + v = u + y)"
2628 quotient_type int = "nat * nat" / intrel
2629 by (auto simp add: equivp_def expand_fun_eq)
2632 "0::int" is "(0::nat, 0::nat)"
2634 The method "lifting" can be used to lift of theorems from the
2635 underlying "raw" type to the quotient type. The example
2636 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
2637 construction and provides a reasoning infrastructure for finite sets.
2639 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
2640 clash with new theory Quotient in Main HOL.
2642 * Moved the SMT binding into the main HOL session, eliminating
2643 separate HOL-SMT session.
2645 * List membership infix mem operation is only an input abbreviation.
2648 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
2649 for future developements; former Library/Word.thy is still present in
2650 the AFP entry RSAPPS.
2652 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
2653 longer shadowed. INCOMPATIBILITY.
2655 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
2658 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
2661 * Dropped normalizing_semiring etc; use the facts in semiring classes
2662 instead. INCOMPATIBILITY.
2664 * Dropped several real-specific versions of lemmas about floor and
2665 ceiling; use the generic lemmas from theory "Archimedean_Field"
2666 instead. INCOMPATIBILITY.
2668 floor_number_of_eq ~> floor_number_of
2669 le_floor_eq_number_of ~> number_of_le_floor
2670 le_floor_eq_zero ~> zero_le_floor
2671 le_floor_eq_one ~> one_le_floor
2672 floor_less_eq_number_of ~> floor_less_number_of
2673 floor_less_eq_zero ~> floor_less_zero
2674 floor_less_eq_one ~> floor_less_one
2675 less_floor_eq_number_of ~> number_of_less_floor
2676 less_floor_eq_zero ~> zero_less_floor
2677 less_floor_eq_one ~> one_less_floor
2678 floor_le_eq_number_of ~> floor_le_number_of
2679 floor_le_eq_zero ~> floor_le_zero
2680 floor_le_eq_one ~> floor_le_one
2681 floor_subtract_number_of ~> floor_diff_number_of
2682 floor_subtract_one ~> floor_diff_one
2683 ceiling_number_of_eq ~> ceiling_number_of
2684 ceiling_le_eq_number_of ~> ceiling_le_number_of
2685 ceiling_le_zero_eq ~> ceiling_le_zero
2686 ceiling_le_eq_one ~> ceiling_le_one
2687 less_ceiling_eq_number_of ~> number_of_less_ceiling
2688 less_ceiling_eq_zero ~> zero_less_ceiling
2689 less_ceiling_eq_one ~> one_less_ceiling
2690 ceiling_less_eq_number_of ~> ceiling_less_number_of
2691 ceiling_less_eq_zero ~> ceiling_less_zero
2692 ceiling_less_eq_one ~> ceiling_less_one
2693 le_ceiling_eq_number_of ~> number_of_le_ceiling
2694 le_ceiling_eq_zero ~> zero_le_ceiling
2695 le_ceiling_eq_one ~> one_le_ceiling
2696 ceiling_subtract_number_of ~> ceiling_diff_number_of
2697 ceiling_subtract_one ~> ceiling_diff_one
2699 * Theory "Finite_Set": various folding_XXX locales facilitate the
2700 application of the various fold combinators on finite sets.
2702 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
2703 provides abstract red-black tree type which is backed by "RBT_Impl" as
2704 implementation. INCOMPATIBILTY.
2706 * Theory Library/Coinductive_List has been removed -- superseded by
2707 AFP/thys/Coinductive.
2709 * Theory PReal, including the type "preal" and related operations, has
2710 been removed. INCOMPATIBILITY.
2712 * Real: new development using Cauchy Sequences.
2714 * Split off theory "Big_Operators" containing setsum, setprod,
2715 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
2717 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
2718 "Int" etc. INCOMPATIBILITY.
2720 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
2722 * New set of rules "ac_simps" provides combined assoc / commute
2723 rewrites for all interpretations of the appropriate generic locales.
2725 * Renamed theory "OrderedGroup" to "Groups" and split theory
2726 "Ring_and_Field" into theories "Rings" and "Fields"; for more
2727 appropriate and more consistent names suitable for name prefixes
2728 within the HOL theories. INCOMPATIBILITY.
2730 * Some generic constants have been put to appropriate theories:
2731 - less_eq, less: Orderings
2732 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
2733 - inverse, divide: Rings
2736 * More consistent naming of type classes involving orderings (and
2739 lower_semilattice ~> semilattice_inf
2740 upper_semilattice ~> semilattice_sup
2742 dense_linear_order ~> dense_linorder
2744 pordered_ab_group_add ~> ordered_ab_group_add
2745 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
2746 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
2747 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
2748 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
2749 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
2750 pordered_cancel_semiring ~> ordered_cancel_semiring
2751 pordered_comm_monoid_add ~> ordered_comm_monoid_add
2752 pordered_comm_ring ~> ordered_comm_ring
2753 pordered_comm_semiring ~> ordered_comm_semiring
2754 pordered_ring ~> ordered_ring
2755 pordered_ring_abs ~> ordered_ring_abs
2756 pordered_semiring ~> ordered_semiring
2758 ordered_ab_group_add ~> linordered_ab_group_add
2759 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
2760 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
2761 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
2762 ordered_field ~> linordered_field
2763 ordered_field_no_lb ~> linordered_field_no_lb
2764 ordered_field_no_ub ~> linordered_field_no_ub
2765 ordered_field_dense_linear_order ~> dense_linordered_field
2766 ordered_idom ~> linordered_idom
2767 ordered_ring ~> linordered_ring
2768 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
2769 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
2770 ordered_ring_strict ~> linordered_ring_strict
2771 ordered_semidom ~> linordered_semidom
2772 ordered_semiring ~> linordered_semiring
2773 ordered_semiring_1 ~> linordered_semiring_1
2774 ordered_semiring_1_strict ~> linordered_semiring_1_strict
2775 ordered_semiring_strict ~> linordered_semiring_strict
2777 The following slightly odd type classes have been moved to a
2778 separate theory Library/Lattice_Algebras:
2780 lordered_ab_group_add ~> lattice_ab_group_add
2781 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
2782 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
2783 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
2784 lordered_ring ~> lattice_ring
2788 * Refined field classes:
2789 - classes division_ring_inverse_zero, field_inverse_zero,
2790 linordered_field_inverse_zero include rule inverse 0 = 0 --
2791 subsumes former division_by_zero class;
2792 - numerous lemmas have been ported from field to division_ring.
2795 * Refined algebra theorem collections:
2796 - dropped theorem group group_simps, use algebra_simps instead;
2797 - dropped theorem group ring_simps, use field_simps instead;
2798 - proper theorem collection field_simps subsumes former theorem
2799 groups field_eq_simps and field_simps;
2800 - dropped lemma eq_minus_self_iff which is a duplicate for
2804 * Theory Finite_Set and List: some lemmas have been generalized from
2807 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
2808 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
2809 inter_Inter_fold_inter ~> inf_Inf_fold_inf
2810 union_Union_fold_union ~> sup_Sup_fold_sup
2811 Inter_fold_inter ~> Inf_fold_inf
2812 Union_fold_union ~> Sup_fold_sup
2813 inter_INTER_fold_inter ~> inf_INFI_fold_inf
2814 union_UNION_fold_union ~> sup_SUPR_fold_sup
2815 INTER_fold_inter ~> INFI_fold_inf
2816 UNION_fold_union ~> SUPR_fold_sup
2818 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
2819 replaced by the more convenient lemmas Inf_empty and Sup_empty.
2820 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
2821 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
2822 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
2823 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
2825 * Reorganized theory Multiset: swapped notation of pointwise and
2828 - pointwise ordering is instance of class order with standard syntax
2830 - multiset ordering has syntax <=# and <#; partial order properties
2831 are provided by means of interpretation with prefix
2833 - less duplication, less historical organization of sections,
2834 conversion from associations lists to multisets, rudimentary code
2836 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
2841 multiset_eq_conv_count_eq ~> multiset_ext_iff
2842 multi_count_ext ~> multiset_ext
2843 diff_union_inverse2 ~> diff_union_cancelR
2847 * Theory Permutation: replaced local "remove" by List.remove1.
2849 * Code generation: ML and OCaml code is decorated with signatures.
2851 * Theory List: added transpose.
2853 * Library/Nat_Bijection.thy is a collection of bijective functions
2854 between nat and other types, which supersedes the older libraries
2855 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
2858 Nat_Int_Bij.nat2_to_nat ~> prod_encode
2859 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
2860 Nat_Int_Bij.int_to_nat_bij ~> int_encode
2861 Nat_Int_Bij.nat_to_int_bij ~> int_decode
2862 Countable.pair_encode ~> prod_encode
2863 NatIso.prod2nat ~> prod_encode
2864 NatIso.nat2prod ~> prod_decode
2865 NatIso.sum2nat ~> sum_encode
2866 NatIso.nat2sum ~> sum_decode
2867 NatIso.list2nat ~> list_encode
2868 NatIso.nat2list ~> list_decode
2869 NatIso.set2nat ~> set_encode
2870 NatIso.nat2set ~> set_decode
2873 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
2874 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
2875 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
2876 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
2877 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
2878 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
2879 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
2880 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
2881 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
2882 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
2883 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
2884 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
2885 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
2888 - Renamed ATP commands:
2889 atp_info ~> sledgehammer running_atps
2890 atp_kill ~> sledgehammer kill_atps
2891 atp_messages ~> sledgehammer messages
2892 atp_minimize ~> sledgehammer minimize
2893 print_atps ~> sledgehammer available_atps
2895 - Added user's manual ("isabelle doc sledgehammer").
2896 - Added option syntax and "sledgehammer_params" to customize
2897 Sledgehammer's behavior. See the manual for details.
2898 - Modified the Isar proof reconstruction code so that it produces
2899 direct proofs rather than proofs by contradiction. (This feature
2900 is still experimental.)
2901 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
2903 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
2906 - Added and implemented "binary_ints" and "bits" options.
2907 - Added "std" option and implemented support for nonstandard models.
2908 - Added and implemented "finitize" option to improve the precision
2909 of infinite datatypes based on a monotonicity analysis.
2910 - Added support for quotient types.
2911 - Added support for "specification" and "ax_specification"
2913 - Added support for local definitions (for "function" and
2914 "termination" proofs).
2915 - Added support for term postprocessors.
2916 - Optimized "Multiset.multiset" and "FinFun.finfun".
2917 - Improved efficiency of "destroy_constrs" optimization.
2918 - Fixed soundness bugs related to "destroy_constrs" optimization and
2920 - Fixed soundness bug related to higher-order constructors.
2921 - Fixed soundness bug when "full_descrs" is enabled.
2922 - Improved precision of set constructs.
2923 - Added "atoms" option.
2924 - Added cache to speed up repeated Kodkod invocations on the same
2926 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
2927 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
2928 "SAT4J_Light". INCOMPATIBILITY.
2929 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
2930 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
2931 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
2933 * Method "induct" now takes instantiations of the form t, where t is not
2934 a variable, as a shorthand for "x == t", where x is a fresh variable.
2935 If this is not intended, t has to be enclosed in parentheses.
2936 By default, the equalities generated by definitional instantiations
2937 are pre-simplified, which may cause parameters of inductive cases
2938 to disappear, or may even delete some of the inductive cases.
2939 Use "induct (no_simp)" instead of "induct" to restore the old
2940 behaviour. The (no_simp) option is also understood by the "cases"
2941 and "nominal_induct" methods, which now perform pre-simplification, too.
2947 * Variable names in lemmas generated by the domain package have
2948 changed; the naming scheme is now consistent with the HOL datatype
2949 package. Some proof scripts may be affected, INCOMPATIBILITY.
2951 * The domain package no longer defines the function "foo_copy" for
2952 recursive domain "foo". The reach lemma is now stated directly in
2953 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
2954 be reformulated in terms of "foo_take", INCOMPATIBILITY.
2956 * Most definedness lemmas generated by the domain package (previously
2957 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
2958 like "foo$x = UU <-> x = UU", which works better as a simp rule.
2959 Proofs that used definedness lemmas as intro rules may break,
2960 potential INCOMPATIBILITY.
2962 * Induction and casedist rules generated by the domain package now
2963 declare proper case_names (one called "bottom", and one named for each
2964 constructor). INCOMPATIBILITY.
2966 * For mutually-recursive domains, separate "reach" and "take_lemma"
2967 rules are generated for each domain, INCOMPATIBILITY.
2969 foo_bar.reach ~> foo.reach bar.reach
2970 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
2972 * Some lemmas generated by the domain package have been renamed for
2973 consistency with the datatype package, INCOMPATIBILITY.
2975 foo.ind ~> foo.induct
2976 foo.finite_ind ~> foo.finite_induct
2977 foo.coind ~> foo.coinduct
2978 foo.casedist ~> foo.exhaust
2979 foo.exhaust ~> foo.nchotomy
2981 * For consistency with other definition packages, the fixrec package
2982 now generates qualified theorem names, INCOMPATIBILITY.
2984 foo_simps ~> foo.simps
2985 foo_unfold ~> foo.unfold
2986 foo_induct ~> foo.induct
2988 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
2989 method and internal fixrec proofs now use the default simpset instead.
2992 * The "contlub" predicate has been removed. Proof scripts should use
2993 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
2995 * The "admw" predicate has been removed, INCOMPATIBILITY.
2997 * The constants cpair, cfst, and csnd have been removed in favor of
2998 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
3003 * Antiquotations for basic formal entities:
3005 @{class NAME} -- type class
3006 @{class_syntax NAME} -- syntax representation of the above
3008 @{type_name NAME} -- logical type
3009 @{type_abbrev NAME} -- type abbreviation
3010 @{nonterminal NAME} -- type of concrete syntactic category
3011 @{type_syntax NAME} -- syntax representation of any of the above
3013 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
3014 @{const_abbrev NAME} -- abbreviated constant
3015 @{const_syntax NAME} -- syntax representation of any of the above
3017 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
3018 syntax constant (cf. 'syntax' command).
3020 * Antiquotation @{make_string} inlines a function to print arbitrary
3021 values similar to the ML toplevel. The result is compiler dependent
3022 and may fall back on "?" in certain situations.
3024 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
3025 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
3026 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
3027 not work with the asynchronous Isar document model.
3029 * Configuration options now admit dynamic default values, depending on
3030 the context or even global references.
3032 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
3033 uses an efficient external library if available (for Poly/ML).
3035 * Renamed some important ML structures, while keeping the old names
3036 for some time as aliases within the structure Legacy:
3038 OuterKeyword ~> Keyword
3041 OuterSyntax ~> Outer_Syntax
3042 PrintMode ~> Print_Mode
3043 SpecParse ~> Parse_Spec
3046 ThyOutput ~> Thy_Output
3047 TypeInfer ~> Type_Infer
3049 Note that "open Legacy" simplifies porting of sources, but forgetting
3050 to remove it again will complicate porting again in the future.
3052 * Most operations that refer to a global context are named
3053 accordingly, e.g. Simplifier.global_context or
3054 ProofContext.init_global. There are some situations where a global
3055 context actually works, but under normal circumstances one needs to
3056 pass the proper local context through the code!
3058 * Discontinued old TheoryDataFun with its copy/init operation -- data
3059 needs to be pure. Functor Theory_Data_PP retains the traditional
3060 Pretty.pp argument to merge, which is absent in the standard
3061 Theory_Data version.
3063 * Sorts.certify_sort and derived "cert" operations for types and terms
3064 no longer minimize sorts. Thus certification at the boundary of the
3065 inference kernel becomes invariant under addition of class relations,
3066 which is an important monotonicity principle. Sorts are now minimized
3067 in the syntax layer only, at the boundary between the end-user and the
3068 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
3069 explicitly in rare situations.
3071 * Renamed old-style Drule.standard to Drule.export_without_context, to
3072 emphasize that this is in no way a standard operation.
3075 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
3076 usual for resolution. Rare INCOMPATIBILITY.
3078 * Renamed varify/unvarify operations to varify_global/unvarify_global
3079 to emphasize that these only work in a global situation (which is
3082 * Curried take and drop in library.ML; negative length is interpreted
3083 as infinity (as in chop). Subtle INCOMPATIBILITY.
3085 * Proof terms: type substitutions on proof constants now use canonical
3086 order of type variables. INCOMPATIBILITY for tools working with proof
3089 * Raw axioms/defs may no longer carry sort constraints, and raw defs
3090 may no longer carry premises. User-level specifications are
3091 transformed accordingly by Thm.add_axiom/add_def.
3096 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
3097 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
3098 proof terms are enabled unconditionally in the new HOL-Proofs image.
3100 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
3101 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
3104 * Old lib/scripts/polyml-platform is superseded by the
3105 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
3106 variant, even on a 64 bit machine. The following example setting
3107 prefers 64 bit if available:
3109 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
3111 * The preliminary Isabelle/jEdit application demonstrates the emerging
3112 Isabelle/Scala layer for advanced prover interaction and integration.
3113 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
3116 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
3117 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
3118 similar to the default assignment of the document preparation system
3119 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
3120 provides some operations for direct access to the font without asking
3121 the user for manual installation.
3125 New in Isabelle2009-1 (December 2009)
3126 -------------------------------------
3130 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
3131 one backslash should be used, even in ML sources.
3136 * Locale interpretation propagates mixins along the locale hierarchy.
3137 The currently only available mixins are the equations used to map
3138 local definitions to terms of the target domain of an interpretation.
3140 * Reactivated diagnostic command 'print_interps'. Use "print_interps
3141 loc" to print all interpretations of locale "loc" in the theory.
3142 Interpretations in proofs are not shown.
3144 * Thoroughly revised locales tutorial. New section on conditional
3147 * On instantiation of classes, remaining undefined class parameters
3148 are formally declared. INCOMPATIBILITY.
3151 *** Document preparation ***
3153 * New generalized style concept for printing terms: @{foo (style) ...}
3154 instead of @{foo_style style ...} (old form is still retained for
3155 backward compatibility). Styles can be also applied for
3156 antiquotations prop, term_type and typeof.
3161 * New proof method "smt" for a combination of first-order logic with
3162 equality, linear and nonlinear (natural/integer/real) arithmetic, and
3163 fixed-size bitvectors; there is also basic support for higher-order
3164 features (esp. lambda abstractions). It is an incomplete decision
3165 procedure based on external SMT solvers using the oracle mechanism;
3166 for the SMT solver Z3, this method is proof-producing. Certificates
3167 are provided to avoid calling the external solvers solely for
3168 re-checking proofs. Due to a remote SMT service there is no need for
3169 installing SMT solvers locally. See src/HOL/SMT.
3171 * New commands to load and prove verification conditions generated by
3172 the Boogie program verifier or derived systems (e.g. the Verifying C
3173 Compiler (VCC) or Spec#). See src/HOL/Boogie.
3175 * New counterexample generator tool 'nitpick' based on the Kodkod
3176 relational model finder. See src/HOL/Tools/Nitpick and
3177 src/HOL/Nitpick_Examples.
3179 * New commands 'code_pred' and 'values' to invoke the predicate
3180 compiler and to enumerate values of inductive predicates.
3182 * A tabled implementation of the reflexive transitive closure.
3184 * New implementation of quickcheck uses generic code generator;
3185 default generators are provided for all suitable HOL types, records
3186 and datatypes. Old quickcheck can be re-activated importing theory
3187 Library/SML_Quickcheck.
3189 * New testing tool Mirabelle for automated proof tools. Applies
3190 several tools and tactics like sledgehammer, metis, or quickcheck, to
3191 every proof step in a theory. To be used in batch mode via the
3192 "mirabelle" utility.
3194 * New proof method "sos" (sum of squares) for nonlinear real
3195 arithmetic (originally due to John Harison). It requires theory
3196 Library/Sum_Of_Squares. It is not a complete decision procedure but
3197 works well in practice on quantifier-free real arithmetic with +, -,
3198 *, ^, =, <= and <, i.e. boolean combinations of equalities and
3199 inequalities between polynomials. It makes use of external
3200 semidefinite programming solvers. Method "sos" generates a
3201 certificate that can be pasted into the proof thus avoiding the need
3202 to call an external tool every time the proof is checked. See
3203 src/HOL/Library/Sum_Of_Squares.
3205 * New method "linarith" invokes existing linear arithmetic decision
3208 * New command 'atp_minimal' reduces result produced by Sledgehammer.
3210 * New Sledgehammer option "Full Types" in Proof General settings menu.
3211 Causes full type information to be output to the ATPs. This slows
3212 ATPs down considerably but eliminates a source of unsound "proofs"
3215 * New method "metisFT": A version of metis that uses full type
3216 information in order to avoid failures of proof reconstruction.
3218 * New evaluator "approximate" approximates an real valued term using
3219 the same method as the approximation method.
3221 * Method "approximate" now supports arithmetic expressions as
3222 boundaries of intervals and implements interval splitting and Taylor
3225 * ML antiquotation @{code_datatype} inserts definition of a datatype
3226 generated by the code generator; e.g. see src/HOL/Predicate.thy.
3228 * New theory SupInf of the supremum and infimum operators for sets of
3231 * New theory Probability, which contains a development of measure
3232 theory, eventually leading to Lebesgue integration and probability.
3234 * Extended Multivariate Analysis to include derivation and Brouwer's
3237 * Reorganization of number theory, INCOMPATIBILITY:
3238 - new number theory development for nat and int, in theories Divides
3239 and GCD as well as in new session Number_Theory
3240 - some constants and facts now suffixed with _nat and _int
3242 - former session NumberTheory now named Old_Number_Theory, including
3243 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
3244 - moved theory Pocklington from src/HOL/Library to
3245 src/HOL/Old_Number_Theory
3247 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
3248 lcm of finite and infinite sets. It is shown that they form a complete
3251 * Class semiring_div requires superclass no_zero_divisors and proof of
3252 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
3253 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
3254 generalized to class semiring_div, subsuming former theorems
3255 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
3256 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
3259 * Refinements to lattice classes and sets:
3260 - less default intro/elim rules in locale variant, more default
3261 intro/elim rules in class variant: more uniformity
3262 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
3264 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
3266 - renamed ACI to inf_sup_aci
3267 - new class "boolean_algebra"
3268 - class "complete_lattice" moved to separate theory
3269 "Complete_Lattice"; corresponding constants (and abbreviations)
3270 renamed and with authentic syntax:
3271 Set.Inf ~> Complete_Lattice.Inf
3272 Set.Sup ~> Complete_Lattice.Sup
3273 Set.INFI ~> Complete_Lattice.INFI
3274 Set.SUPR ~> Complete_Lattice.SUPR
3275 Set.Inter ~> Complete_Lattice.Inter
3276 Set.Union ~> Complete_Lattice.Union
3277 Set.INTER ~> Complete_Lattice.INTER
3278 Set.UNION ~> Complete_Lattice.UNION
3279 - authentic syntax for
3282 - mere abbreviations:
3285 Set.inter (for inf, formerly Set.Int)
3286 Set.union (for sup, formerly Set.Un)
3287 Complete_Lattice.Inter (for Inf)
3288 Complete_Lattice.Union (for Sup)
3289 Complete_Lattice.INTER (for INFI)
3290 Complete_Lattice.UNION (for SUPR)
3291 - object-logic definitions as far as appropriate
3293 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
3294 Un_subset_iff are explicitly deleted as default simp rules; then also
3295 their lattice counterparts le_inf_iff and le_sup_iff have to be
3296 deleted to achieve the desired effect.
3298 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
3299 rules by default any longer; the same applies to min_max.inf_absorb1
3300 etc. INCOMPATIBILITY.
3302 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
3303 pred_set_conv by default. INCOMPATIBILITY.
3305 * Power operations on relations and functions are now one dedicated
3306 constant "compow" with infix syntax "^^". Power operation on
3307 multiplicative monoids retains syntax "^" and is now defined generic
3308 in class power. INCOMPATIBILITY.
3310 * Relation composition "R O S" now has a more standard argument order:
3311 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
3312 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
3313 break, since the O_assoc rule was not rewritten like this. Fix using
3314 O_assoc[symmetric]. The same applies to the curried version "R OO S".
3316 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
3317 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
3320 * Most rules produced by inductive and datatype package have mandatory
3321 prefixes. INCOMPATIBILITY.
3323 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
3324 the attribute of the same name. Each of the theorems in the list
3325 DERIV_intros assumes composition with an additional function and
3326 matches a variable to the derivative, which has to be solved by the
3327 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
3328 of most elementary terms. Former Maclauren.DERIV_tac and
3329 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
3332 * Code generator attributes follow the usual underscore convention:
3333 code_unfold replaces code unfold
3334 code_post replaces code post
3339 sizechange -> size_change
3340 induct_scheme -> induction_schema
3343 * Discontinued abbreviation "arbitrary" of constant "undefined".
3344 INCOMPATIBILITY, use "undefined" directly.
3347 Suc_eq_add_numeral_1 -> Suc_eq_plus1
3348 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
3349 Suc_plus1 -> Suc_eq_plus1
3350 *anti_sym -> *antisym*
3351 vector_less_eq_def -> vector_le_def
3354 * Added theorem List.map_map as [simp]. Removed List.map_compose.
3357 * Removed predicate "M hassize n" (<--> card M = n & finite M).
3363 * Theory Representable defines a class "rep" of domains that are
3364 representable (via an ep-pair) in the universal domain type "udom".
3365 Instances are provided for all type constructors defined in HOLCF.
3367 * The 'new_domain' command is a purely definitional version of the
3368 domain package, for representable domains. Syntax is identical to the
3369 old domain package. The 'new_domain' package also supports indirect
3370 recursion using previously-defined type constructors. See
3371 src/HOLCF/ex/New_Domain.thy for examples.
3373 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
3374 on the left-hand side of an equation, and then performs
3375 simplification. Rewriting is done using rules declared with the
3376 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
3377 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
3379 * The pattern-match compiler in 'fixrec' can now handle constructors
3380 with HOL function types. Pattern-match combinators for the Pair
3381 constructor are pre-configured.
3383 * The 'fixrec' package now produces better fixed-point induction rules
3384 for mutually-recursive definitions: Induction rules have conclusions
3385 of the form "P foo bar" instead of "P <foo, bar>".
3387 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
3388 been renamed to "below". The name "below" now replaces "less" in many
3389 theorem names. (Legacy theorem names using "less" are still supported
3392 * The 'fixrec' package now supports "bottom patterns". Bottom
3393 patterns can be used to generate strictness rules, or to make
3394 functions more strict (much like the bang-patterns supported by the
3395 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
3401 * Support for Poly/ML 5.3.0, with improved reporting of compiler
3402 errors and run-time exceptions, including detailed source positions.
3404 * Structure Name_Space (formerly NameSpace) now manages uniquely
3405 identified entries, with some additional information such as source
3406 position, logical grouping etc.
3408 * Theory and context data is now introduced by the simplified and
3409 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
3410 to be pure, but the old TheoryDataFun for mutable data (with explicit
3411 copy operation) is still available for some time.
3413 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
3414 provides a high-level programming interface to synchronized state
3415 variables with atomic update. This works via pure function
3416 application within a critical section -- its runtime should be as
3417 short as possible; beware of deadlocks if critical code is nested,
3418 either directly or indirectly via other synchronized variables!
3420 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
3421 wraps raw ML references, explicitly indicating their non-thread-safe
3422 behaviour. The Isar toplevel keeps this structure open, to
3423 accommodate Proof General as well as quick and dirty interactive
3424 experiments with references.
3426 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
3427 parallel tactical reasoning.
3429 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
3430 are similar to SUBPROOF, but are slightly more flexible: only the
3431 specified parts of the subgoal are imported into the context, and the
3432 body tactic may introduce new subgoals and schematic variables.
3434 * Old tactical METAHYPS, which does not observe the proof context, has
3435 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
3436 or Subgoal.FOCUS etc.
3438 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
3439 functors have their own ML name space there is no point to mark them
3440 separately.) Minor INCOMPATIBILITY.
3442 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
3444 * Renamed several structures FooBar to Foo_Bar. Occasional,
3447 * Operations of structure Skip_Proof no longer require quick_and_dirty
3448 mode, which avoids critical setmp.
3450 * Eliminated old Attrib.add_attributes, Method.add_methods and related
3451 combinators for "args". INCOMPATIBILITY, need to use simplified
3452 Attrib/Method.setup introduced in Isabelle2009.
3454 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
3455 back on global_simpset_of, global_claset_of, global_clasimpset_of as
3456 last resort. INCOMPATIBILITY.
3458 * Display.pretty_thm now requires a proper context (cf. former
3459 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
3460 or even Display.pretty_thm_without_context as last resort.
3463 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
3464 Syntax.pretty_typ/term directly, preferably with proper context
3465 instead of global theory.
3470 * Further fine tuning of parallel proof checking, scales up to 8 cores
3471 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
3474 * Support for additional "Isabelle components" via etc/components, see
3475 also the system manual.
3477 * The isabelle makeall tool now operates on all components with
3478 IsaMakefile, not just hardwired "logics".
3480 * Removed "compress" option from isabelle-process and isabelle usedir;
3481 this is always enabled.
3483 * Discontinued support for Poly/ML 4.x versions.
3485 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
3486 on a given logic image. This requires the lighttpd webserver and is
3487 currently supported on Linux only.
3491 New in Isabelle2009 (April 2009)
3492 --------------------------------
3496 * Simplified main Isabelle executables, with less surprises on
3497 case-insensitive file-systems (such as Mac OS).
3499 - The main Isabelle tool wrapper is now called "isabelle" instead of
3502 - The former "isabelle" alias for "isabelle-process" has been
3503 removed (should rarely occur to regular users).
3505 - The former "isabelle-interface" and its alias "Isabelle" have been
3506 removed (interfaces are now regular Isabelle tools).
3508 Within scripts and make files, the Isabelle environment variables
3509 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
3510 respectively. (The latter are still available as legacy feature.)
3512 The old isabelle-interface wrapper could react in confusing ways if
3513 the interface was uninstalled or changed otherwise. Individual
3514 interface tool configuration is now more explicit, see also the
3515 Isabelle system manual. In particular, Proof General is now available
3516 via "isabelle emacs".
3518 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
3519 purge installed copies of Isabelle executables and re-run "isabelle
3520 install -p ...", or use symlinks.
3522 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
3523 old ~/isabelle, which was slightly non-standard and apt to cause
3524 surprises on case-insensitive file-systems (such as Mac OS).
3526 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
3527 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
3528 care is required when using older releases of Isabelle. Note that
3529 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
3530 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
3532 * Proofs of fully specified statements are run in parallel on
3533 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
3534 a regular 4-core machine, if the initial heap space is made reasonably
3535 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
3537 * The main reference manuals ("isar-ref", "implementation", and
3538 "system") have been updated and extended. Formally checked references
3539 as hyperlinks are now available uniformly.
3544 * Complete re-implementation of locales. INCOMPATIBILITY in several
3545 respects. The most important changes are listed below. See the
3546 Tutorial on Locales ("locales" manual) for details.
3548 - In locale expressions, instantiation replaces renaming. Parameters
3549 must be declared in a for clause. To aid compatibility with previous
3550 parameter inheritance, in locale declarations, parameters that are not
3551 'touched' (instantiation position "_" or omitted) are implicitly added
3552 with their syntax at the beginning of the for clause.
3554 - Syntax from abbreviations and definitions in locales is available in
3555 locale expressions and context elements. The latter is particularly
3556 useful in locale declarations.
3558 - More flexible mechanisms to qualify names generated by locale
3559 expressions. Qualifiers (prefixes) may be specified in locale
3560 expressions, and can be marked as mandatory (syntax: "name!:") or
3561 optional (syntax "name?:"). The default depends for plain "name:"
3562 depends on the situation where a locale expression is used: in
3563 commands 'locale' and 'sublocale' prefixes are optional, in
3564 'interpretation' and 'interpret' prefixes are mandatory. The old
3565 implicit qualifiers derived from the parameter names of a locale are
3566 no longer generated.
3568 - Command "sublocale l < e" replaces "interpretation l < e". The
3569 instantiation clause in "interpretation" and "interpret" (square
3570 brackets) is no longer available. Use locale expressions.
3572 - When converting proof scripts, mandatory qualifiers in
3573 'interpretation' and 'interpret' should be retained by default, even
3574 if this is an INCOMPATIBILITY compared to former behavior. In the
3575 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
3576 in locale expressions range over a single locale instance only.
3578 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
3579 In existing theorem specifications replace the includes element by the
3580 respective context elements of the included locale, omitting those
3581 that are already present in the theorem specification. Multiple
3582 assume elements of a locale should be replaced by a single one
3583 involving the locale predicate. In the proof body, declarations (most
3584 notably theorems) may be regained by interpreting the respective
3585 locales in the proof context as required (command "interpret").
3587 If using "includes" in replacement of a target solely because the
3588 parameter types in the theorem are not as general as in the target,
3589 consider declaring a new locale with additional type constraints on
3590 the parameters (context element "constrains").
3592 - Discontinued "locale (open)". INCOMPATIBILITY.
3594 - Locale interpretation commands no longer attempt to simplify goal.
3595 INCOMPATIBILITY: in rare situations the generated goal differs. Use
3596 methods intro_locales and unfold_locales to clarify.
3598 - Locale interpretation commands no longer accept interpretation
3599 attributes. INCOMPATIBILITY.
3601 * Class declaration: so-called "base sort" must not be given in import
3602 list any longer, but is inferred from the specification. Particularly
3609 class foo = type + ...
3611 * Class target: global versions of theorems stemming do not carry a
3612 parameter prefix any longer. INCOMPATIBILITY.
3614 * Class 'instance' command no longer accepts attached definitions.
3615 INCOMPATIBILITY, use proper 'instantiation' target instead.
3617 * Recovered hiding of consts, which was accidentally broken in
3618 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
3619 makes c inaccessible; consider using ``hide (open) const c'' instead.
3621 * Slightly more coherent Pure syntax, with updated documentation in
3622 isar-ref manual. Removed locales meta_term_syntax and
3623 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
3624 INCOMPATIBILITY in rare situations. Note that &&& should not be used
3625 directly in regular applications.
3627 * There is a new syntactic category "float_const" for signed decimal
3628 fractions (e.g. 123.45 or -123.45).
3630 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
3631 interface with 'setup' command instead.
3633 * Command 'local_setup' is similar to 'setup', but operates on a local
3636 * The 'axiomatization' command now only works within a global theory
3637 context. INCOMPATIBILITY.
3639 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
3640 hypotheses. Sorts required in the course of reasoning need to be
3641 covered by the constraints in the initial statement, completed by the
3642 type instance information of the background theory. Non-trivial sort
3643 hypotheses, which rarely occur in practice, may be specified via
3644 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
3646 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
3648 The result contains an implicit sort hypotheses as before --
3649 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
3652 * Generalized Isar history, with support for linear undo, direct state
3655 * Changed defaults for unify configuration options:
3657 unify_trace_bound = 50 (formerly 25)
3658 unify_search_bound = 60 (formerly 30)
3660 * Different bookkeeping for code equations (INCOMPATIBILITY):
3662 a) On theory merge, the last set of code equations for a particular
3663 constant is taken (in accordance with the policy applied by other
3664 parts of the code generator framework).
3666 b) Code equations stemming from explicit declarations (e.g. code
3667 attribute) gain priority over default code equations stemming
3668 from definition, primrec, fun etc.
3670 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
3672 * Unified theorem tables for both code generators. Thus [code
3673 func] has disappeared and only [code] remains. INCOMPATIBILITY.
3675 * Command 'find_consts' searches for constants based on type and name
3678 find_consts "_ => bool"
3680 By default, matching is against subtypes, but it may be restricted to
3681 the whole type. Searching by name is possible. Multiple queries are
3682 conjunctive and queries may be negated by prefixing them with a
3685 find_consts strict: "_ => bool" name: "Int" -"int => int"
3687 * New 'find_theorems' criterion "solves" matches theorems that
3688 directly solve the current goal (modulo higher-order unification).
3690 * Auto solve feature for main theorem statements: whenever a new goal
3691 is stated, "find_theorems solves" is called; any theorems that could
3692 solve the lemma directly are listed as part of the goal state.
3693 Cf. associated options in Proof General Isabelle settings menu,
3694 enabled by default, with reasonable timeout for pathological cases of
3695 higher-order unification.
3698 *** Document preparation ***
3700 * Antiquotation @{lemma} now imitates a regular terminal proof,
3701 demanding keyword 'by' and supporting the full method expression
3702 syntax just like the Isar command 'by'.
3707 * Integrated main parts of former image HOL-Complex with HOL. Entry
3708 points Main and Complex_Main remain as before.
3710 * Logic image HOL-Plain provides a minimal HOL with the most important
3711 tools available (inductive, datatype, primrec, ...). This facilitates
3712 experimentation and tool development. Note that user applications
3713 (and library theories) should never refer to anything below theory
3716 * Logic image HOL-Main stops at theory Main, and thus facilitates
3717 experimentation due to shorter build times.
3719 * Logic image HOL-NSA contains theories of nonstandard analysis which
3720 were previously part of former HOL-Complex. Entry point Hyperreal
3721 remains valid, but theories formerly using Complex_Main should now use
3722 new entry point Hypercomplex.
3724 * Generic ATP manager for Sledgehammer, based on ML threads instead of
3725 Posix processes. Avoids potentially expensive forking of the ML
3726 process. New thread-based implementation also works on non-Unix
3727 platforms (Cygwin). Provers are no longer hardwired, but defined
3728 within the theory via plain ML wrapper functions. Basic Sledgehammer
3729 commands are covered in the isar-ref manual.
3731 * Wrapper scripts for remote SystemOnTPTP service allows to use
3732 sledgehammer without local ATP installation (Vampire etc.). Other
3733 provers may be included via suitable ML wrappers, see also
3734 src/HOL/ATP_Linkup.thy.
3736 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
3739 * The metis method no longer fails because the theorem is too trivial
3740 (contains the empty clause).
3742 * The metis method now fails in the usual manner, rather than raising
3743 an exception, if it determines that it cannot prove the theorem.
3745 * Method "coherent" implements a prover for coherent logic (see also
3746 src/Tools/coherent.ML).
3748 * Constants "undefined" and "default" replace "arbitrary". Usually
3749 "undefined" is the right choice to replace "arbitrary", though
3750 logically there is no difference. INCOMPATIBILITY.
3752 * Command "value" now integrates different evaluation mechanisms. The
3753 result of the first successful evaluation mechanism is printed. In
3754 square brackets a particular named evaluation mechanisms may be
3755 specified (currently, [SML], [code] or [nbe]). See further
3756 src/HOL/ex/Eval_Examples.thy.
3758 * Normalization by evaluation now allows non-leftlinear equations.
3759 Declare with attribute [code nbe].
3761 * Methods "case_tac" and "induct_tac" now refer to the very same rules
3762 as the structured Isar versions "cases" and "induct", cf. the
3763 corresponding "cases" and "induct" attributes. Mutual induction rules
3764 are now presented as a list of individual projections
3765 (e.g. foo_bar.inducts for types foo and bar); the old format with
3766 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
3767 rare situations a different rule is selected --- notably nested tuple
3768 elimination instead of former prod.exhaust: use explicit (case_tac t
3769 rule: prod.exhaust) here.
3771 * Attributes "cases", "induct", "coinduct" support "del" option.
3773 * Removed fact "case_split_thm", which duplicates "case_split".
3775 * The option datatype has been moved to a new theory Option. Renamed
3776 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
3778 * New predicate "strict_mono" classifies strict functions on partial
3779 orders. With strict functions on linear orders, reasoning about
3780 (in)equalities is facilitated by theorems "strict_mono_eq",
3781 "strict_mono_less_eq" and "strict_mono_less".
3783 * Some set operations are now proper qualified constants with
3784 authentic syntax. INCOMPATIBILITY:
3795 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
3798 * Auxiliary class "itself" has disappeared -- classes without any
3799 parameter are treated as expected by the 'class' command.
3801 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
3803 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
3804 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
3806 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
3807 method "approximation". It proves formulas on real values by using
3808 interval arithmetic. In the formulas are also the transcendental
3809 functions sin, cos, tan, atan, ln, exp and the constant pi are
3810 allowed. For examples see
3811 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
3813 * Theory "Reflection" now resides in HOL/Library.
3815 * Entry point to Word library now simply named "Word".
3818 * Made source layout more coherent with logical distribution
3821 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
3822 src/HOL/Library/Code_Message.thy ~> src/HOL/
3823 src/HOL/Library/GCD.thy ~> src/HOL/
3824 src/HOL/Library/Order_Relation.thy ~> src/HOL/
3825 src/HOL/Library/Parity.thy ~> src/HOL/
3826 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
3827 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
3828 src/HOL/Real/Lubs.thy ~> src/HOL/
3829 src/HOL/Real/PReal.thy ~> src/HOL/
3830 src/HOL/Real/Rational.thy ~> src/HOL/
3831 src/HOL/Real/RComplete.thy ~> src/HOL/
3832 src/HOL/Real/RealDef.thy ~> src/HOL/
3833 src/HOL/Real/RealPow.thy ~> src/HOL/
3834 src/HOL/Real/Real.thy ~> src/HOL/
3835 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
3836 src/HOL/Complex/Complex.thy ~> src/HOL/
3837 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
3838 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
3839 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
3840 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
3841 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
3842 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
3843 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
3844 src/HOL/Hyperreal/Log.thy ~> src/HOL/
3845 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
3846 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
3847 src/HOL/Hyperreal/Series.thy ~> src/HOL/
3848 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
3849 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
3850 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
3851 src/HOL/Real/Float ~> src/HOL/Library/
3852 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
3853 src/HOL/Real/RealVector.thy ~> src/HOL/
3855 src/HOL/arith_data.ML ~> src/HOL/Tools
3856 src/HOL/hologic.ML ~> src/HOL/Tools
3857 src/HOL/simpdata.ML ~> src/HOL/Tools
3858 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
3859 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
3860 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
3861 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
3862 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
3863 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
3864 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
3866 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
3867 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
3868 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
3869 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
3870 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
3871 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
3873 * If methods "eval" and "evaluation" encounter a structured proof
3874 state with !!/==>, only the conclusion is evaluated to True (if
3875 possible), avoiding strange error messages.
3877 * Method "sizechange" automates termination proofs using (a
3878 modification of) the size-change principle. Requires SAT solver. See
3879 src/HOL/ex/Termination.thy for examples.
3881 * Simplifier: simproc for let expressions now unfolds if bound
3882 variable occurs at most once in let expression body. INCOMPATIBILITY.
3884 * Method "arith": Linear arithmetic now ignores all inequalities when
3885 fast_arith_neq_limit is exceeded, instead of giving up entirely.
3887 * New attribute "arith" for facts that should always be used
3888 automatically by arithmetic. It is intended to be used locally in
3891 assumes [arith]: "x > 0"
3893 Global usage is discouraged because of possible performance impact.
3895 * New classes "top" and "bot" with corresponding operations "top" and
3896 "bot" in theory Orderings; instantiation of class "complete_lattice"
3897 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
3899 * Changed definition lemma "less_fun_def" in order to provide an
3900 instance for preorders on functions; use lemma "less_le" instead.
3903 * Theory Orderings: class "wellorder" moved here, with explicit
3904 induction rule "less_induct" as assumption. For instantiation of
3905 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
3908 * Theory Orderings: added class "preorder" as superclass of "order".
3909 INCOMPATIBILITY: Instantiation proofs for order, linorder
3910 etc. slightly changed. Some theorems named order_class.* now named
3913 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
3916 * Theory Finite_Set: added a new fold combinator of type
3918 ('a => 'b => 'b) => 'b => 'a set => 'b
3920 Occasionally this is more convenient than the old fold combinator
3921 which is now defined in terms of the new one and renamed to
3924 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
3925 and "ring_simps" have been replaced by "algebra_simps" (which can be
3926 extended with further lemmas!). At the moment both still exist but
3927 the former will disappear at some point.
3929 * Theory Power: Lemma power_Suc is now declared as a simp rule in
3930 class recpower. Type-specific simp rules for various recpower types
3931 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
3933 rat_power_0 -> power_0
3934 rat_power_Suc -> power_Suc
3935 realpow_0 -> power_0
3936 realpow_Suc -> power_Suc
3937 complexpow_0 -> power_0
3938 complexpow_Suc -> power_Suc
3939 power_poly_0 -> power_0
3940 power_poly_Suc -> power_Suc
3942 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
3943 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
3944 dvd has been generalized to class comm_semiring_1. Likewise a bunch
3945 of lemmas from Divides has been generalized from nat to class
3946 semiring_div. INCOMPATIBILITY. This involves the following theorem
3947 renames resulting from duplicate elimination:
3949 dvd_def_mod ~> dvd_eq_mod_eq_0
3950 zero_dvd_iff ~> dvd_0_left_iff
3951 dvd_0 ~> dvd_0_right
3952 DIVISION_BY_ZERO_DIV ~> div_by_0
3953 DIVISION_BY_ZERO_MOD ~> mod_by_0
3954 mult_div ~> div_mult_self2_is_id
3955 mult_mod ~> mod_mult_self2_is_0
3957 * Theory IntDiv: removed many lemmas that are instances of class-based
3958 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
3959 rename old lemmas as follows:
3961 dvd_diff -> nat_dvd_diff
3962 dvd_zminus_iff -> dvd_minus_iff
3963 mod_add1_eq -> mod_add_eq
3964 mod_mult1_eq -> mod_mult_right_eq
3965 mod_mult1_eq' -> mod_mult_left_eq
3966 mod_mult_distrib_mod -> mod_mult_eq
3967 nat_mod_add_left_eq -> mod_add_left_eq
3968 nat_mod_add_right_eq -> mod_add_right_eq
3969 nat_mod_div_trivial -> mod_div_trivial
3970 nat_mod_mod_trivial -> mod_mod_trivial
3971 zdiv_zadd_self1 -> div_add_self1
3972 zdiv_zadd_self2 -> div_add_self2
3973 zdiv_zmult_self1 -> div_mult_self2_is_id
3974 zdiv_zmult_self2 -> div_mult_self1_is_id
3975 zdvd_triv_left -> dvd_triv_left
3976 zdvd_triv_right -> dvd_triv_right
3977 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
3978 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
3979 zmod_zadd_left_eq -> mod_add_left_eq
3980 zmod_zadd_right_eq -> mod_add_right_eq
3981 zmod_zadd_self1 -> mod_add_self1
3982 zmod_zadd_self2 -> mod_add_self2
3983 zmod_zadd1_eq -> mod_add_eq
3984 zmod_zdiff1_eq -> mod_diff_eq
3985 zmod_zdvd_zmod -> mod_mod_cancel
3986 zmod_zmod_cancel -> mod_mod_cancel
3987 zmod_zmult_self1 -> mod_mult_self2_is_0
3988 zmod_zmult_self2 -> mod_mult_self1_is_0
3991 zdvd_abs1 -> abs_dvd_iff
3992 zdvd_abs2 -> dvd_abs_iff
3993 zdvd_refl -> dvd_refl
3994 zdvd_trans -> dvd_trans
3995 zdvd_zadd -> dvd_add
3996 zdvd_zdiff -> dvd_diff
3997 zdvd_zminus_iff -> dvd_minus_iff
3998 zdvd_zminus2_iff -> minus_dvd_iff
3999 zdvd_zmultD -> dvd_mult_right
4000 zdvd_zmultD2 -> dvd_mult_left
4001 zdvd_zmult_mono -> mult_dvd_mono
4002 zdvd_0_right -> dvd_0_right
4003 zdvd_0_left -> dvd_0_left_iff
4004 zdvd_1_left -> one_dvd
4005 zminus_dvd_iff -> minus_dvd_iff
4007 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
4009 * The real numbers offer decimal input syntax: 12.34 is translated
4010 into 1234/10^2. This translation is not reversed upon output.
4012 * Theory Library/Polynomial defines an abstract type 'a poly of
4013 univariate polynomials with coefficients of type 'a. In addition to
4014 the standard ring operations, it also supports div and mod. Code
4015 generation is also supported, using list-style constructors.
4017 * Theory Library/Inner_Product defines a class of real_inner for real
4018 inner product spaces, with an overloaded operation inner :: 'a => 'a
4019 => real. Class real_inner is a subclass of real_normed_vector from
4022 * Theory Library/Product_Vector provides instances for the product
4023 type 'a * 'b of several classes from RealVector and Inner_Product.
4024 Definitions of addition, subtraction, scalar multiplication, norms,
4025 and inner products are included.
4027 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
4028 addition to the field operations, numerals and case syntax are also
4031 * Theory Library/Diagonalize provides constructive version of Cantor's
4032 first diagonalization argument.
4034 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
4035 zlcm (for int); carried together from various gcd/lcm developements in
4036 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
4037 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
4038 may recover tupled syntax as follows:
4040 hide (open) const gcd
4041 abbreviation gcd where
4042 "gcd == (%(a, b). GCD.gcd a b)"
4044 GCD.gcd ("gcd '(_, _')")
4046 The same works for lcm, zgcd, zlcm.
4048 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
4049 instantiations for algebraic structures. Removed some duplicate
4050 theorems. Changes in simp rules. INCOMPATIBILITY.
4052 * ML antiquotation @{code} takes a constant as argument and generates
4053 corresponding code in background and inserts name of the corresponding
4054 resulting ML value/function/datatype constructor binding in place.
4055 All occurrences of @{code} with a single ML block are generated
4056 simultaneously. Provides a generic and safe interface for
4057 instrumentalizing code generation. See
4058 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
4059 In future you ought to refrain from ad-hoc compiling generated SML
4060 code on the ML toplevel. Note that (for technical reasons) @{code}
4061 cannot refer to constants for which user-defined serializations are
4062 set. Refer to the corresponding ML counterpart directly in that
4065 * Command 'rep_datatype': instead of theorem names the command now
4066 takes a list of terms denoting the constructors of the type to be
4067 represented as datatype. The characteristic theorems have to be
4068 proven. INCOMPATIBILITY. Also observe that the following theorems
4069 have disappeared in favour of existing ones:
4071 unit_induct ~> unit.induct
4072 prod_induct ~> prod.induct
4073 sum_induct ~> sum.induct
4074 Suc_Suc_eq ~> nat.inject
4075 Suc_not_Zero Zero_not_Suc ~> nat.distinct
4080 * New locales for orders and lattices where the equivalence relation
4081 is not restricted to equality. INCOMPATIBILITY: all order and lattice
4082 locales use a record structure with field eq for the equivalence.
4084 * New theory of factorial domains.
4086 * Units_l_inv and Units_r_inv are now simp rules by default.
4087 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
4088 and/or r_inv will now also require deletion of these lemmas.
4090 * Renamed the following theorems, INCOMPATIBILITY:
4092 UpperD ~> Upper_memD
4093 LowerD ~> Lower_memD
4094 least_carrier ~> least_closed
4095 greatest_carrier ~> greatest_closed
4096 greatest_Lower_above ~> greatest_Lower_below
4097 one_zero ~> carrier_one_zero
4098 one_not_zero ~> carrier_one_not_zero (collision with assumption)
4103 * Nominal datatypes can now contain type-variables.
4105 * Commands 'nominal_inductive' and 'equivariance' work with local
4108 * Nominal primrec can now works with local theory targets and its
4109 specification syntax now conforms to the general format as seen in
4112 * Method "perm_simp" honours the standard simplifier attributes
4113 (no_asm), (no_asm_use) etc.
4115 * The new predicate #* is defined like freshness, except that on the
4116 left hand side can be a set or list of atoms.
4118 * Experimental command 'nominal_inductive2' derives strong induction
4119 principles for inductive definitions. In contrast to
4120 'nominal_inductive', which can only deal with a fixed number of
4121 binders, it can deal with arbitrary expressions standing for sets of
4122 atoms to be avoided. The only inductive definition we have at the
4123 moment that needs this generalisation is the typing rule for Lets in
4126 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
4127 -----------------------------------------------------------------
4128 Gamma |- Let x be t1 in t2 : T2
4130 In this rule one wants to avoid all the binders that are introduced by
4131 "close Gamma T1". We are looking for other examples where this
4132 feature might be useful. Please let us know.
4137 * Reimplemented the simplification procedure for proving continuity
4138 subgoals. The new simproc is extensible; users can declare additional
4139 continuity introduction rules with the attribute [cont2cont].
4141 * The continuity simproc now uses a different introduction rule for
4142 solving continuity subgoals on terms with lambda abstractions. In
4143 some rare cases the new simproc may fail to solve subgoals that the
4144 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
4145 Potential INCOMPATIBILITY.
4147 * Command 'fixrec': specification syntax now conforms to the general
4148 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
4149 examples. INCOMPATIBILITY.
4154 * Proof of Zorn's Lemma for partial orders.
4159 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
4160 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
4161 depends on multithreading, so timouts will not work before Poly/ML
4164 * High-level support for concurrent ML programming, see
4165 src/Pure/Cuncurrent. The data-oriented model of "future values" is
4166 particularly convenient to organize independent functional
4167 computations. The concept of "synchronized variables" provides a
4168 higher-order interface for components with shared state, avoiding the
4169 delicate details of mutexes and condition variables. (Requires
4170 Poly/ML 5.2.1 or later.)
4172 * ML bindings produced via Isar commands are stored within the Isar
4173 context (theory or proof). Consequently, commands like 'use' and 'ML'
4174 become thread-safe and work with undo as expected (concerning
4175 top-level bindings, not side-effects on global references).
4176 INCOMPATIBILITY, need to provide proper Isar context when invoking the
4177 compiler at runtime; really global bindings need to be given outside a
4178 theory. (Requires Poly/ML 5.2 or later.)
4180 * Command 'ML_prf' is analogous to 'ML' but works within a proof
4181 context. Top-level ML bindings are stored within the proof context in
4182 a purely sequential fashion, disregarding the nested proof structure.
4183 ML bindings introduced by 'ML_prf' are discarded at the end of the
4184 proof. (Requires Poly/ML 5.2 or later.)
4186 * Simplified ML attribute and method setup, cf. functions Attrib.setup
4187 and Method.setup, as well as Isar commands 'attribute_setup' and
4188 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
4189 existing code accordingly, or use plain 'setup' together with old
4192 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
4193 to 'a -> thm, while results are always tagged with an authentic oracle
4194 name. The Isar command 'oracle' is now polymorphic, no argument type
4195 is specified. INCOMPATIBILITY, need to simplify existing oracle code
4196 accordingly. Note that extra performance may be gained by producing
4197 the cterm carefully, avoiding slow Thm.cterm_of.
4199 * Simplified interface for defining document antiquotations via
4200 ThyOutput.antiquotation, ThyOutput.output, and optionally
4201 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
4202 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
4205 * More systematic treatment of long names, abstract name bindings, and
4206 name space operations. Basic operations on qualified names have been
4207 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
4208 Long_Name.append. Old type bstring has been mostly replaced by
4209 abstract type binding (see structure Binding), which supports precise
4210 qualification by packages and local theory targets, as well as proper
4211 tracking of source positions. INCOMPATIBILITY, need to wrap old
4212 bstring values into Binding.name, or better pass through abstract
4213 bindings everywhere. See further src/Pure/General/long_name.ML,
4214 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
4216 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
4217 LocalTheory.note etc.) now refer to the *full* internal name, not the
4218 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
4220 * Disposed old type and term read functions (Sign.read_def_typ,
4221 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
4222 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
4223 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
4224 Syntax.read_term_global etc.; see also OldGoals.read_term as last
4225 resort for legacy applications.
4227 * Disposed old declarations, tactics, tactic combinators that refer to
4228 the simpset or claset of an implicit theory (such as Addsimps,
4229 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
4230 embedded ML text, or local_simpset_of with a proper context passed as
4231 explicit runtime argument.
4233 * Rules and tactics that read instantiations (read_instantiate,
4234 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
4235 context, which is required for parsing and type-checking. Moreover,
4236 the variables are specified as plain indexnames, not string encodings
4237 thereof. INCOMPATIBILITY.
4239 * Generic Toplevel.add_hook interface allows to analyze the result of
4240 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
4241 for theorem dependency output of transactions resulting in a new
4244 * ML antiquotations: block-structured compilation context indicated by
4245 \<lbrace> ... \<rbrace>; additional antiquotation forms:
4247 @{binding name} - basic name binding
4248 @{let ?pat = term} - term abbreviation (HO matching)
4249 @{note name = fact} - fact abbreviation
4250 @{thm fact} - singleton fact (with attributes)
4251 @{thms fact} - general fact (with attributes)
4252 @{lemma prop by method} - singleton goal
4253 @{lemma prop by meth1 meth2} - singleton goal
4254 @{lemma prop1 ... propN by method} - general goal
4255 @{lemma prop1 ... propN by meth1 meth2} - general goal
4256 @{lemma (open) ...} - open derivation
4261 * The Isabelle "emacs" tool provides a specific interface to invoke
4262 Proof General / Emacs, with more explicit failure if that is not
4263 installed (the old isabelle-interface script silently falls back on
4264 isabelle-process). The PROOFGENERAL_HOME setting determines the
4265 installation location of the Proof General distribution.
4267 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
4268 the Isabelle process into a JVM/Scala application. See
4269 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
4270 process wrapper has been discontinued.)
4272 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
4274 * Various status messages (with exact source position information) are
4275 emitted, if proper markup print mode is enabled. This allows
4276 user-interface components to provide detailed feedback on internal
4281 New in Isabelle2008 (June 2008)
4282 -------------------------------
4286 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
4287 and updated, with formally checked references as hyperlinks.
4289 * Theory loader: use_thy (and similar operations) no longer set the
4290 implicit ML context, which was occasionally hard to predict and in
4291 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
4292 provides a proper context already.
4294 * Theory loader: old-style ML proof scripts being *attached* to a thy
4295 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
4296 'use' within a theory file will do the job.
4298 * Name space merge now observes canonical order, i.e. the second space
4299 is inserted into the first one, while existing entries in the first
4300 space take precedence. INCOMPATIBILITY in rare situations, may try to
4301 swap theory imports.
4303 * Syntax: symbol \<chi> is now considered a letter. Potential
4304 INCOMPATIBILITY in identifier syntax etc.
4306 * Outer syntax: string tokens no longer admit escaped white space,
4307 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
4308 white space without escapes.
4310 * Outer syntax: string tokens may contain arbitrary character codes
4311 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
4317 * Context-dependent token translations. Default setup reverts locally
4318 fixed variables, and adds hilite markup for undeclared frees.
4320 * Unused theorems can be found using the new command 'unused_thms'.
4321 There are three ways of invoking it:
4324 Only finds unused theorems in the current theory.
4326 (2) unused_thms thy_1 ... thy_n -
4327 Finds unused theorems in the current theory and all of its ancestors,
4328 excluding the theories thy_1 ... thy_n and all of their ancestors.
4330 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
4331 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
4332 their ancestors, excluding the theories thy_1 ... thy_n and all of
4335 In order to increase the readability of the list produced by
4336 unused_thms, theorems that have been created by a particular instance
4337 of a theory command such as 'inductive' or 'function' are considered
4338 to belong to the same "group", meaning that if at least one theorem in
4339 this group is used, the other theorems in the same group are no longer
4340 reported as unused. Moreover, if all theorems in the group are
4341 unused, only one theorem in the group is displayed.
4343 Note that proof objects have to be switched on in order for
4344 unused_thms to work properly (i.e. !proofs must be >= 1, which is
4345 usually the case when using Proof General with the default settings).
4347 * Authentic naming of facts disallows ad-hoc overwriting of previous
4348 theorems within the same name space. INCOMPATIBILITY, need to remove
4349 duplicate fact bindings, or even accidental fact duplications. Note
4350 that tools may maintain dynamically scoped facts systematically, using
4351 PureThy.add_thms_dynamic.
4353 * Command 'hide' now allows to hide from "fact" name space as well.
4355 * Eliminated destructive theorem database, simpset, claset, and
4356 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
4357 update of theories within ML code.
4359 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
4360 INCOMPATIBILITY, object-logics depending on former Pure require
4361 additional setup PureThy.old_appl_syntax_setup; object-logics
4362 depending on former CPure need to refer to Pure.
4364 * Commands 'use' and 'ML' are now purely functional, operating on
4365 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
4366 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
4369 * Command 'setup': discontinued implicit version with ML reference.
4371 * Instantiation target allows for simultaneous specification of class
4372 instance operations together with an instantiation proof.
4373 Type-checking phase allows to refer to class operations uniformly.
4374 See src/HOL/Complex/Complex.thy for an Isar example and
4375 src/HOL/Library/Eval.thy for an ML example.
4377 * Indexing of literal facts: be more serious about including only
4378 facts from the visible specification/proof context, but not the
4379 background context (locale etc.). Affects `prop` notation and method
4380 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
4383 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
4384 "(open)" option, which used to expose internal bound variables to the
4387 * Isar statements: removed obsolete case "rule_context".
4388 INCOMPATIBILITY, better use explicit fixes/assumes.
4390 * Locale proofs: default proof step now includes 'unfold_locales';
4391 hence 'proof' without argument may be used to unfold locale
4395 *** Document preparation ***
4397 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
4398 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
4399 obsolete thumbpdf setup (contemporary PDF viewers do this on the
4400 spot); renamed link color from "darkblue" to "linkcolor" (default
4401 value unchanged, can be redefined via \definecolor); no longer sets
4402 "a4paper" option (unnecessary or even intrusive).
4404 * Antiquotation @{lemma A method} proves proposition A by the given
4405 method (either a method name or a method name plus (optional) method
4406 arguments in parentheses) and prints A just like @{prop A}.
4411 * New primrec package. Specification syntax conforms in style to
4412 definition/function/.... No separate induction rule is provided. The
4413 "primrec" command distinguishes old-style and new-style specifications
4414 by syntax. The former primrec package is now named OldPrimrecPackage.
4415 When adjusting theories, beware: constants stemming from new-style
4416 primrec specifications have authentic syntax.
4418 * Metis prover is now an order of magnitude faster, and also works
4419 with multithreading.
4421 * Metis: the maximum number of clauses that can be produced from a
4422 theorem is now given by the attribute max_clauses. Theorems that
4423 exceed this number are ignored, with a warning printed.
4425 * Sledgehammer no longer produces structured proofs by default. To
4426 enable, declare [[sledgehammer_full = true]]. Attributes
4427 reconstruction_modulus, reconstruction_sorts renamed
4428 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
4430 * Method "induct_scheme" derives user-specified induction rules
4431 from well-founded induction and completeness of patterns. This factors
4432 out some operations that are done internally by the function package
4433 and makes them available separately. See
4434 src/HOL/ex/Induction_Scheme.thy for examples.
4436 * More flexible generation of measure functions for termination
4437 proofs: Measure functions can be declared by proving a rule of the
4438 form "is_measure f" and giving it the [measure_function] attribute.
4439 The "is_measure" predicate is logically meaningless (always true), and
4440 just guides the heuristic. To find suitable measure functions, the
4441 termination prover sets up the goal "is_measure ?f" of the appropriate
4442 type and generates all solutions by prolog-style backwards proof using
4445 This setup also deals with rules like
4447 "is_measure f ==> is_measure (list_size f)"
4449 which accommodates nested datatypes that recurse through lists.
4450 Similar rules are predeclared for products and option types.
4452 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
4456 - Definitions of overloaded constants on sets have to be replaced by
4457 definitions on => and bool.
4459 - Some definitions of overloaded operators on sets can now be proved
4460 using the definitions of the operators on => and bool. Therefore,
4461 the following theorems have been renamed:
4463 subset_def -> subset_eq
4464 psubset_def -> psubset_eq
4465 set_diff_def -> set_diff_eq
4466 Compl_def -> Compl_eq
4467 Sup_set_def -> Sup_set_eq
4468 Inf_set_def -> Inf_set_eq
4469 sup_set_def -> sup_set_eq
4470 inf_set_def -> inf_set_eq
4472 - Due to the incompleteness of the HO unification algorithm, some
4473 rules such as subst may require manual instantiation, if some of
4474 the unknowns in the rule is a set.
4476 - Higher order unification and forward proofs:
4479 have "P (S::'a set)" <...>
4480 then have "EX S. P S" ..
4482 no longer works (due to the incompleteness of the HO unification
4483 algorithm) and must be replaced by the pattern
4490 - Calculational reasoning with subst (or similar rules):
4493 have "P (S::'a set)" <...>
4494 also have "S = T" <...>
4495 finally have "P T" .
4497 no longer works (for similar reasons as the previous example) and
4498 must be replaced by something like
4500 have "P (S::'a set)" <...>
4501 moreover have "S = T" <...>
4502 ultimately have "P T" by simp
4504 - Tactics or packages written in ML code:
4505 Code performing pattern matching on types via
4507 Type ("set", [T]) => ...
4509 must be rewritten. Moreover, functions like strip_type or
4510 binder_types no longer return the right value when applied to a
4513 T1 => ... => Tn => U => bool
4517 T1 => ... => Tn => U set
4519 * Merged theories Wellfounded_Recursion, Accessible_Part and
4520 Wellfounded_Relations to theory Wellfounded.
4522 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
4524 * Class finite no longer treats UNIV as class parameter. Use class
4525 enum from theory Library/Enum instead to achieve a similar effect.
4528 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
4529 and "Cons". INCOMPATIBILITY.
4531 * HOL (and FOL): renamed variables in rules imp_elim and swap.
4532 Potential INCOMPATIBILITY.
4534 * Theory Product_Type: duplicated lemmas split_Pair_apply and
4535 injective_fst_snd removed, use split_eta and prod_eqI instead.
4536 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
4538 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
4539 the same name in theory Orderings:
4549 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
4550 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
4551 and different variable names.
4553 * Library/Option_ord.thy: Canonical order on option type.
4555 * Library/RBT.thy: Red-black trees, an efficient implementation of
4558 * Library/Countable.thy: Type class for countable types.
4560 * Theory Int: The representation of numerals has changed. The infix
4561 operator BIT and the bit datatype with constructors B0 and B1 have
4562 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
4563 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
4564 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
4567 * Theory Nat: definition of <= and < on natural numbers no longer
4568 depend on well-founded relations. INCOMPATIBILITY. Definitions
4569 le_def and less_def have disappeared. Consider lemmas not_less
4570 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
4572 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
4573 (whose purpose mainly is for various fold_set functionals) have been
4574 abandoned in favor of the existing algebraic classes
4575 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
4576 lower_semilattice (resp. upper_semilattice) and linorder.
4579 * Theory Transitive_Closure: induct and cases rules now declare proper
4580 case_names ("base" and "step"). INCOMPATIBILITY.
4582 * Theorem Inductive.lfp_ordinal_induct generalized to complete
4583 lattices. The form set-specific version is available as
4584 Inductive.lfp_ordinal_induct_set.
4586 * Renamed theorems "power.simps" to "power_int.simps".
4589 * Class semiring_div provides basic abstract properties of semirings
4590 with division and modulo operations. Subsumes former class dvd_mod.
4592 * Merged theories IntDef, Numeral and IntArith into unified theory
4593 Int. INCOMPATIBILITY.
4595 * Theory Library/Code_Index: type "index" now represents natural
4596 numbers rather than integers. INCOMPATIBILITY.
4598 * New class "uminus" with operation "uminus" (split of from class
4599 "minus" which now only has operation "minus", binary).
4602 * Constants "card", "internal_split", "option_map" now with authentic
4603 syntax. INCOMPATIBILITY.
4605 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
4606 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
4607 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
4608 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
4609 Sup_set_def, le_def, less_def, option_map_def now with object
4610 equality. INCOMPATIBILITY.
4612 * Records. Removed K_record, and replaced it by pure lambda term
4613 %x. c. The simplifier setup is now more robust against eta expansion.
4614 INCOMPATIBILITY: in cases explicitly referring to K_record.
4616 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
4618 * Library/ListVector: new theory of arithmetic vector operations.
4620 * Library/Order_Relation: new theory of various orderings as sets of
4621 pairs. Defines preorders, partial orders, linear orders and
4622 well-orders on sets and on types.
4627 * Renamed some theories to allow to loading both ZF and HOL in the
4630 Datatype -> Datatype_ZF
4631 Inductive -> Inductive_ZF
4638 INCOMPATIBILITY: ZF theories that import individual theories below
4639 Main might need to be adapted. Regular theory Main is still
4640 available, as trivial extension of Main_ZF.
4645 * ML within Isar: antiquotation @{const name} or @{const
4646 name(typargs)} produces statically-checked Const term.
4648 * Functor NamedThmsFun: data is available to the user as dynamic fact
4649 (of the same name). Removed obsolete print command.
4651 * Removed obsolete "use_legacy_bindings" function.
4653 * The ``print mode'' is now a thread-local value derived from a global
4654 template (the former print_mode reference), thus access becomes
4655 non-critical. The global print_mode reference is for session
4656 management only; user-code should use print_mode_value,
4657 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
4659 * Functions system/system_out provide a robust way to invoke external
4660 shell commands, with propagation of interrupts (requires Poly/ML
4661 5.2.1). Do not use OS.Process.system etc. from the basis library!
4666 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
4667 in accordance with Proof General 3.7, which prefers GNU emacs.
4669 * isatool tty runs Isabelle process with plain tty interaction;
4670 optional line editor may be specified via ISABELLE_LINE_EDITOR
4671 setting, the default settings attempt to locate "ledit" and "rlwrap".
4673 * isatool browser now works with Cygwin as well, using general
4674 "javapath" function defined in Isabelle process environment.
4676 * YXML notation provides a simple and efficient alternative to
4677 standard XML transfer syntax. See src/Pure/General/yxml.ML and
4678 isatool yxml as described in the Isabelle system manual.
4680 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
4681 provides general wrapper for managing an Isabelle process in a robust
4682 fashion, with ``cooked'' output from stdin/stderr.
4684 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
4685 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
4687 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
4688 way of changing the user's settings is via
4689 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
4692 * Multithreading.max_threads := 0 refers to the number of actual CPU
4693 cores of the underlying machine, which is a good starting point for
4694 optimal performance tuning. The corresponding usedir option -M allows
4695 "max" as an alias for "0". WARNING: does not work on certain versions
4696 of Mac OS (with Poly/ML 5.1).
4698 * isabelle-process: non-ML sessions are run with "nice", to reduce the
4699 adverse effect of Isabelle flooding interactive front-ends (notably
4700 ProofGeneral / XEmacs).
4704 New in Isabelle2007 (November 2007)
4705 -----------------------------------
4709 * More uniform information about legacy features, notably a
4710 warning/error of "Legacy feature: ...", depending on the state of the
4711 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
4712 legacy features will disappear eventually.
4714 * Theory syntax: the header format ``theory A = B + C:'' has been
4715 discontinued in favour of ``theory A imports B C begin''. Use isatool
4716 fixheaders to convert existing theory files. INCOMPATIBILITY.
4718 * Theory syntax: the old non-Isar theory file format has been
4719 discontinued altogether. Note that ML proof scripts may still be used
4720 with Isar theories; migration is usually quite simple with the ML
4721 function use_legacy_bindings. INCOMPATIBILITY.
4723 * Theory syntax: some popular names (e.g. 'class', 'declaration',
4724 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
4727 * Theory loader: be more serious about observing the static theory
4728 header specifications (including optional directories), but not the
4729 accidental file locations of previously successful loads. The strict
4730 update policy of former update_thy is now already performed by
4731 use_thy, so the former has been removed; use_thys updates several
4732 theories simultaneously, just as 'imports' within a theory header
4733 specification, but without merging the results. Potential
4734 INCOMPATIBILITY: may need to refine theory headers and commands
4735 ROOT.ML which depend on load order.
4737 * Theory loader: optional support for content-based file
4738 identification, instead of the traditional scheme of full physical
4739 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
4740 (cf. the system manual). The new scheme allows to work with
4741 non-finished theories in persistent session images, such that source
4742 files may be moved later on without requiring reloads.
4744 * Theory loader: old-style ML proof scripts being *attached* to a thy
4745 file (with the same base name as the theory) are considered a legacy
4746 feature, which will disappear eventually. Even now, the theory loader
4747 no longer maintains dependencies on such files.
4749 * Syntax: the scope for resolving ambiguities via type-inference is
4750 now limited to individual terms, instead of whole simultaneous
4751 specifications as before. This greatly reduces the complexity of the
4752 syntax module and improves flexibility by separating parsing and
4753 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
4754 'fixes' etc.) are required in rare situations.
4756 * Syntax: constants introduced by new-style packages ('definition',
4757 'abbreviation' etc.) are passed through the syntax module in
4758 ``authentic mode''. This means that associated mixfix annotations
4759 really stick to such constants, independently of potential name space
4760 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
4761 trees are represented slightly differently, may need to adapt syntax
4762 translations accordingly. Use CONST marker in 'translations' and
4763 @{const_syntax} antiquotation in 'parse_translation' etc.
4765 * Legacy goal package: reduced interface to the bare minimum required
4766 to keep existing proof scripts running. Most other user-level
4767 functions are now part of the OldGoals structure, which is *not* open
4768 by default (consider isatool expandshort before open OldGoals).
4769 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
4770 these tend to cause confusion about the actual goal (!) context being
4771 used here, which is not necessarily the same as the_context().
4773 * Command 'find_theorems': supports "*" wild-card in "name:"
4774 criterion; "with_dups" option. Certain ProofGeneral versions might
4775 support a specific search form (see ProofGeneral/CHANGES).
4777 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
4778 by default, which means that "prems" (and also "fixed variables") are
4779 suppressed from proof state output. Note that the ProofGeneral
4780 settings mechanism allows to change and save options persistently, but
4781 older versions of Isabelle will fail to start up if a negative prems
4784 * Local theory targets may be specified by non-nested blocks of
4785 ``context/locale/class ... begin'' followed by ``end''. The body may
4786 contain definitions, theorems etc., including any derived mechanism
4787 that has been implemented on top of these primitives. This concept
4788 generalizes the existing ``theorem (in ...)'' towards more versatility
4791 * Proof General interface: proper undo of final 'end' command;
4792 discontinued Isabelle/classic mode (ML proof scripts).
4795 *** Document preparation ***
4797 * Added antiquotation @{theory name} which prints the given name,
4798 after checking that it refers to a valid ancestor theory in the
4801 * Added antiquotations @{ML_type text} and @{ML_struct text} which
4802 check the given source text as ML type/structure, printing verbatim.
4804 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
4805 "c args == rhs" given in the current context. (Any number of
4806 arguments may be given on the LHS.)
4811 * The 'class' package offers a combination of axclass and locale to
4812 achieve Haskell-like type classes in Isabelle. Definitions and
4813 theorems within a class context produce both relative results (with
4814 implicit parameters according to the locale context), and polymorphic
4815 constants with qualified polymorphism (according to the class
4816 context). Within the body context of a 'class' target, a separate
4817 syntax layer ("user space type system") takes care of converting
4818 between global polymorphic consts and internal locale representation.
4819 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
4820 "isatool doc classes" provides a tutorial.
4822 * Generic code generator framework allows to generate executable
4823 code for ML and Haskell (including Isabelle classes). A short usage
4826 internal compilation:
4827 export_code <list of constants (term syntax)> in SML
4828 writing SML code to a file:
4829 export_code <list of constants (term syntax)> in SML <filename>
4830 writing OCaml code to a file:
4831 export_code <list of constants (term syntax)> in OCaml <filename>
4832 writing Haskell code to a bunch of files:
4833 export_code <list of constants (term syntax)> in Haskell <filename>
4835 evaluating closed propositions to True/False using code generation:
4838 Reasonable default setup of framework in HOL.
4840 Theorem attributs for selecting and transforming function equations theorems:
4842 [code fun]: select a theorem as function equation for a specific constant
4843 [code fun del]: deselect a theorem as function equation for a specific constant
4844 [code inline]: select an equation theorem for unfolding (inlining) in place
4845 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
4847 User-defined serializations (target in {SML, OCaml, Haskell}):
4849 code_const <and-list of constants (term syntax)>
4850 {(target) <and-list of const target syntax>}+
4852 code_type <and-list of type constructors>
4853 {(target) <and-list of type target syntax>}+
4855 code_instance <and-list of instances>
4857 where instance ::= <type constructor> :: <class>
4859 code_class <and_list of classes>
4860 {(target) <and-list of class target syntax>}+
4861 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
4863 code_instance and code_class only are effective to target Haskell.
4865 For example usage see src/HOL/ex/Codegenerator.thy and
4866 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
4867 generation from Isabelle/HOL theories is available via "isatool doc
4870 * Code generator: consts in 'consts_code' Isar commands are now
4871 referred to by usual term syntax (including optional type
4874 * Command 'no_translations' removes translation rules from theory
4877 * Overloaded definitions are now actually checked for acyclic
4878 dependencies. The overloading scheme is slightly more general than
4879 that of Haskell98, although Isabelle does not demand an exact
4880 correspondence to type class and instance declarations.
4881 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
4882 exotic versions of overloading -- at the discretion of the user!
4884 Polymorphic constants are represented via type arguments, i.e. the
4885 instantiation that matches an instance against the most general
4886 declaration given in the signature. For example, with the declaration
4887 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
4888 as c(nat). Overloading is essentially simultaneous structural
4889 recursion over such type arguments. Incomplete specification patterns
4890 impose global constraints on all occurrences, e.g. c('a * 'a) on the
4891 LHS means that more general c('a * 'b) will be disallowed on any RHS.
4892 Command 'print_theory' outputs the normalized system of recursive
4893 equations, see section "definitions".
4895 * Configuration options are maintained within the theory or proof
4896 context (with name and type bool/int/string), providing a very simple
4897 interface to a poor-man's version of general context data. Tools may
4898 declare options in ML (e.g. using Attrib.config_int) and then refer to
4899 these values using Config.get etc. Users may change options via an
4900 associated attribute of the same name. This form of context
4901 declaration works particularly well with commands 'declare' or
4902 'using', for example ``declare [[foo = 42]]''. Thus it has become
4903 very easy to avoid global references, which would not observe Isar
4904 toplevel undo/redo and fail to work with multithreading.
4906 Various global ML references of Pure and HOL have been turned into
4907 configuration options:
4909 Unify.search_bound unify_search_bound
4910 Unify.trace_bound unify_trace_bound
4911 Unify.trace_simp unify_trace_simp
4912 Unify.trace_types unify_trace_types
4913 Simplifier.simp_depth_limit simp_depth_limit
4914 Blast.depth_limit blast_depth_limit
4915 DatatypeProp.dtK datatype_distinctness_limit
4916 fast_arith_neq_limit fast_arith_neq_limit
4917 fast_arith_split_limit fast_arith_split_limit
4919 * Named collections of theorems may be easily installed as context
4920 data using the functor NamedThmsFun (see also
4921 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
4922 attributes; there is also a toplevel print command. This facility is
4923 just a common case of general context data, which is the preferred way
4924 for anything more complex than just a list of facts in canonical
4927 * Isar: command 'declaration' augments a local theory by generic
4928 declaration functions written in ML. This enables arbitrary content
4929 being added to the context, depending on a morphism that tells the
4930 difference of the original declaration context wrt. the application
4931 context encountered later on.
4933 * Isar: proper interfaces for simplification procedures. Command
4934 'simproc_setup' declares named simprocs (with match patterns, and body
4935 text in ML). Attribute "simproc" adds/deletes simprocs in the current
4936 context. ML antiquotation @{simproc name} retrieves named simprocs.
4938 * Isar: an extra pair of brackets around attribute declarations
4939 abbreviates a theorem reference involving an internal dummy fact,
4940 which will be ignored later --- only the effect of the attribute on
4941 the background context will persist. This form of in-place
4942 declarations is particularly useful with commands like 'declare' and
4943 'using', for example ``have A using [[simproc a]] by simp''.
4945 * Isar: method "assumption" (and implicit closing of subproofs) now
4946 takes simple non-atomic goal assumptions into account: after applying
4947 an assumption as a rule the resulting subgoals are solved by atomic
4948 assumption steps. This is particularly useful to finish 'obtain'
4949 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
4950 without referring to the original premise "!!x. P x ==> thesis" in the
4951 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
4954 * Isar: implicit use of prems from the Isar proof context is
4955 considered a legacy feature. Common applications like ``have A .''
4956 may be replaced by ``have A by fact'' or ``note `A`''. In general,
4957 referencing facts explicitly here improves readability and
4958 maintainability of proof texts.
4960 * Isar: improper proof element 'guess' is like 'obtain', but derives
4961 the obtained context from the course of reasoning! For example:
4963 assume "EX x y. A x & B y" -- "any previous fact"
4964 then guess x and y by clarify
4966 This technique is potentially adventurous, depending on the facts and
4967 proof tools being involved here.
4969 * Isar: known facts from the proof context may be specified as literal
4970 propositions, using ASCII back-quote syntax. This works wherever
4971 named facts used to be allowed so far, in proof commands, proof
4972 methods, attributes etc. Literal facts are retrieved from the context
4973 according to unification of type and term parameters. For example,
4974 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
4975 theorems in the current context, then these are valid literal facts:
4976 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
4978 There is also a proof method "fact" which does the same composition
4979 for explicit goal states, e.g. the following proof texts coincide with
4980 certain special cases of literal facts:
4982 have "A" by fact == note `A`
4983 have "A ==> B" by fact == note `A ==> B`
4984 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
4985 have "P a ==> Q a" by fact == note `P a ==> Q a`
4987 * Isar: ":" (colon) is no longer a symbolic identifier character in
4988 outer syntax. Thus symbolic identifiers may be used without
4989 additional white space in declarations like this: ``assume *: A''.
4991 * Isar: 'print_facts' prints all local facts of the current context,
4992 both named and unnamed ones.
4994 * Isar: 'def' now admits simultaneous definitions, e.g.:
4996 def x == "t" and y == "u"
4998 * Isar: added command 'unfolding', which is structurally similar to
4999 'using', but affects both the goal state and facts by unfolding given
5000 rewrite rules. Thus many occurrences of the 'unfold' method or
5001 'unfolded' attribute may be replaced by first-class proof text.
5003 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
5004 and command 'unfolding' now all support object-level equalities
5005 (potentially conditional). The underlying notion of rewrite rule is
5006 analogous to the 'rule_format' attribute, but *not* that of the
5007 Simplifier (which is usually more generous).
5009 * Isar: the new attribute [rotated n] (default n = 1) rotates the
5010 premises of a theorem by n. Useful in conjunction with drule.
5012 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
5013 method expression within a sandbox consisting of the first N
5014 sub-goals, which need to exist. For example, ``simp_all [3]''
5015 simplifies the first three sub-goals, while (rule foo, simp_all)[]
5016 simplifies all new goals that emerge from applying rule foo to the
5017 originally first one.
5019 * Isar: schematic goals are no longer restricted to higher-order
5020 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
5023 * Isar: the conclusion of a long theorem statement is now either
5024 'shows' (a simultaneous conjunction, as before), or 'obtains'
5025 (essentially a disjunction of cases with local parameters and
5026 assumptions). The latter allows to express general elimination rules
5027 adequately; in this notation common elimination rules look like this:
5029 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
5031 obtains x where "P x"
5033 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
5037 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
5043 The subsequent classical rules even refer to the formal "thesis"
5046 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
5049 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
5050 obtains "thesis ==> something"
5052 The actual proof of an 'obtains' statement is analogous to that of the
5053 Isar proof element 'obtain', only that there may be several cases.
5054 Optional case names may be specified in parentheses; these will be
5055 available both in the present proof and as annotations in the
5056 resulting rule, for later use with the 'cases' method (cf. attribute
5059 * Isar: the assumptions of a long theorem statement are available as
5060 "assms" fact in the proof context. This is more appropriate than the
5061 (historical) "prems", which refers to all assumptions of the current
5062 context, including those from the target locale, proof body etc.
5064 * Isar: 'print_statement' prints theorems from the current theory or
5065 proof context in long statement form, according to the syntax of a
5068 * Isar: 'obtain' takes an optional case name for the local context
5069 introduction rule (default "that").
5071 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
5072 explicit (is "_ ==> ?foo") in the rare cases where this still happens
5075 * Pure: syntax "CONST name" produces a fully internalized constant
5076 according to the current context. This is particularly useful for
5077 syntax translations that should refer to internal constant
5078 representations independently of name spaces.
5080 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
5081 instead of "FOO ". This allows multiple binder declarations to coexist
5082 in the same context. INCOMPATIBILITY.
5084 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
5085 primitive that also works in a locale context (both for constants and
5086 fixed variables). Type declaration and internal syntactic representation
5087 of given constants retrieved from the context. Likewise, the
5088 'no_notation' command allows to remove given syntax annotations from the
5091 * Isar/locales: new derived specification elements 'axiomatization',
5092 'definition', 'abbreviation', which support type-inference, admit
5093 object-level specifications (equality, equivalence). See also the
5094 isar-ref manual. Examples:
5097 eq (infix "===" 50) where
5098 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
5100 definition "f x y = x + y + 1"
5101 definition g where "g x = f x x"
5104 neq (infix "=!=" 50) where
5105 "x =!= y == ~ (x === y)"
5107 These specifications may be also used in a locale context. Then the
5108 constants being introduced depend on certain fixed parameters, and the
5109 constant name is qualified by the locale base name. An internal
5110 abbreviation takes care for convenient input and output, making the
5111 parameters implicit and using the original short name. See also
5112 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
5113 entities from a monomorphic theory.
5115 Presently, abbreviations are only available 'in' a target locale, but
5116 not inherited by general import expressions. Also note that
5117 'abbreviation' may be used as a type-safe replacement for 'syntax' +
5118 'translations' in common applications. The "no_abbrevs" print mode
5119 prevents folding of abbreviations in term output.
5121 Concrete syntax is attached to specified constants in internal form,
5122 independently of name spaces. The parse tree representation is
5123 slightly different -- use 'notation' instead of raw 'syntax', and
5124 'translations' with explicit "CONST" markup to accommodate this.
5126 * Pure/Isar: unified syntax for new-style specification mechanisms
5127 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
5128 full type inference and dummy patterns ("_"). For example:
5130 definition "K x _ = x"
5132 inductive conj for A B
5133 where "A ==> B ==> conj A B"
5135 * Pure: command 'print_abbrevs' prints all constant abbreviations of
5136 the current context. Print mode "no_abbrevs" prevents inversion of
5137 abbreviations on output.
5139 * Isar/locales: improved parameter handling: use of locales "var" and
5140 "struct" no longer necessary; - parameter renamings are no longer
5141 required to be injective. For example, this allows to define
5142 endomorphisms as locale endom = homom mult mult h.
5144 * Isar/locales: changed the way locales with predicates are defined.
5145 Instead of accumulating the specification, the imported expression is
5146 now an interpretation. INCOMPATIBILITY: different normal form of
5147 locale expressions. In particular, in interpretations of locales with
5148 predicates, goals repesenting already interpreted fragments are not
5149 removed automatically. Use methods `intro_locales' and
5150 `unfold_locales'; see below.
5152 * Isar/locales: new methods `intro_locales' and `unfold_locales'
5153 provide backward reasoning on locales predicates. The methods are
5154 aware of interpretations and discharge corresponding goals.
5155 `intro_locales' is less aggressive then `unfold_locales' and does not
5156 unfold predicates to assumptions.
5158 * Isar/locales: the order in which locale fragments are accumulated
5159 has changed. This enables to override declarations from fragments due
5160 to interpretations -- for example, unwanted simp rules.
5162 * Isar/locales: interpretation in theories and proof contexts has been
5163 extended. One may now specify (and prove) equations, which are
5164 unfolded in interpreted theorems. This is useful for replacing
5165 defined concepts (constants depending on locale parameters) by
5166 concepts already existing in the target context. Example:
5168 interpretation partial_order ["op <= :: [int, int] => bool"]
5169 where "partial_order.less (op <=) (x::int) y = (x < y)"
5171 Typically, the constant `partial_order.less' is created by a
5172 definition specification element in the context of locale
5175 * Method "induct": improved internal context management to support
5176 local fixes and defines on-the-fly. Thus explicit meta-level
5177 connectives !! and ==> are rarely required anymore in inductive goals
5178 (using object-logic connectives for this purpose has been long
5179 obsolete anyway). Common proof patterns are explained in
5180 src/HOL/Induct/Common_Patterns.thy, see also
5181 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
5184 * Method "induct": improved handling of simultaneous goals. Instead of
5185 introducing object-level conjunction, the statement is now split into
5186 several conclusions, while the corresponding symbolic cases are nested
5187 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
5188 see src/HOL/Induct/Common_Patterns.thy, for example.
5190 * Method "induct": mutual induction rules are now specified as a list
5191 of rule sharing the same induction cases. HOL packages usually provide
5192 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
5193 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
5194 mutual induction rules differently, i.e. like this:
5196 (induct rule: foo_bar.inducts)
5197 (induct set: foo bar)
5198 (induct pred: foo bar)
5199 (induct type: foo bar)
5201 The ML function ProjectRule.projections turns old-style rules into the
5204 * Method "coinduct": dual of induction, see
5205 src/HOL/Library/Coinductive_List.thy for various examples.
5207 * Method "cases", "induct", "coinduct": the ``(open)'' option is
5208 considered a legacy feature.
5210 * Attribute "symmetric" produces result with standardized schematic
5211 variables (index 0). Potential INCOMPATIBILITY.
5213 * Simplifier: by default the simplifier trace only shows top level
5214 rewrites now. That is, trace_simp_depth_limit is set to 1 by
5215 default. Thus there is less danger of being flooded by the trace. The
5216 trace indicates where parts have been suppressed.
5218 * Provers/classical: removed obsolete classical version of elim_format
5219 attribute; classical elim/dest rules are now treated uniformly when
5220 manipulating the claset.
5222 * Provers/classical: stricter checks to ensure that supplied intro,
5223 dest and elim rules are well-formed; dest and elim rules must have at
5226 * Provers/classical: attributes dest/elim/intro take an optional
5227 weight argument for the rule (just as the Pure versions). Weights are
5228 ignored by automated tools, but determine the search order of single
5231 * Syntax: input syntax now supports dummy variable binding "%_. b",
5232 where the body does not mention the bound variable. Note that dummy
5233 patterns implicitly depend on their context of bounds, which makes
5234 "{_. _}" match any set comprehension as expected. Potential
5235 INCOMPATIBILITY -- parse translations need to cope with syntactic
5236 constant "_idtdummy" in the binding position.
5238 * Syntax: removed obsolete syntactic constant "_K" and its associated
5239 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
5240 for example "A -> B" => "Pi A (%_. B)".
5242 * Pure: 'class_deps' command visualizes the subclass relation, using
5243 the graph browser tool.
5245 * Pure: 'print_theory' now suppresses certain internal declarations by
5246 default; use '!' option for full details.
5251 * Method "metis" proves goals by applying the Metis general-purpose
5252 resolution prover (see also http://gilith.com/software/metis/).
5253 Examples are in the directory MetisExamples. WARNING: the
5254 Isabelle/HOL-Metis integration does not yet work properly with
5257 * Command 'sledgehammer' invokes external automatic theorem provers as
5258 background processes. It generates calls to the "metis" method if
5259 successful. These can be pasted into the proof. Users do not have to
5260 wait for the automatic provers to return. WARNING: does not really
5261 work with multi-threading.
5263 * New "auto_quickcheck" feature tests outermost goal statements for
5264 potential counter-examples. Controlled by ML references
5265 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
5266 5000 milliseconds). Fails silently if statements is outside of
5267 executable fragment, or any other codgenerator problem occurs.
5269 * New constant "undefined" with axiom "undefined x = undefined".
5271 * Added class "HOL.eq", allowing for code generation with polymorphic
5274 * Some renaming of class constants due to canonical name prefixing in
5275 the new 'class' package:
5277 HOL.abs ~> HOL.abs_class.abs
5278 HOL.divide ~> HOL.divide_class.divide
5279 0 ~> HOL.zero_class.zero
5280 1 ~> HOL.one_class.one
5281 op + ~> HOL.plus_class.plus
5282 op - ~> HOL.minus_class.minus
5283 uminus ~> HOL.minus_class.uminus
5284 op * ~> HOL.times_class.times
5285 op < ~> HOL.ord_class.less
5286 op <= > HOL.ord_class.less_eq
5287 Nat.power ~> Power.power_class.power
5288 Nat.size ~> Nat.size_class.size
5289 Numeral.number_of ~> Numeral.number_class.number_of
5290 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
5291 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
5292 Orderings.min ~> Orderings.ord_class.min
5293 Orderings.max ~> Orderings.ord_class.max
5294 Divides.op div ~> Divides.div_class.div
5295 Divides.op mod ~> Divides.div_class.mod
5296 Divides.op dvd ~> Divides.div_class.dvd
5298 INCOMPATIBILITY. Adaptions may be required in the following cases:
5300 a) User-defined constants using any of the names "plus", "minus",
5301 "times", "less" or "less_eq". The standard syntax translations for
5302 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
5305 b) Variables named "plus", "minus", "times", "less", "less_eq"
5306 INCOMPATIBILITY: use more specific names.
5308 c) Permutative equations (e.g. "a + b = b + a")
5309 Since the change of names also changes the order of terms, permutative
5310 rewrite rules may get applied in a different order. Experience shows
5311 that this is rarely the case (only two adaptions in the whole Isabelle
5312 distribution). INCOMPATIBILITY: rewrite proofs
5314 d) ML code directly refering to constant names
5315 This in general only affects hand-written proof tactics, simprocs and
5316 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
5317 Consider using @{const_name} antiquotation.
5319 * New class "default" with associated constant "default".
5321 * Function "sgn" is now overloaded and available on int, real, complex
5322 (and other numeric types), using class "sgn". Two possible defs of
5323 sgn are given as equational assumptions in the classes sgn_if and
5324 sgn_div_norm; ordered_idom now also inherits from sgn_if.
5327 * Locale "partial_order" now unified with class "order" (cf. theory
5328 Orderings), added parameter "less". INCOMPATIBILITY.
5330 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
5331 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
5332 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
5334 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
5335 changed order of proof goals in instance proofs.
5337 * The transitivity reasoner for partial and linear orders is set up
5338 for classes "order" and "linorder". Instances of the reasoner are available
5339 in all contexts importing or interpreting the corresponding locales.
5340 Method "order" invokes the reasoner separately; the reasoner
5341 is also integrated with the Simplifier as a solver. Diagnostic
5342 command 'print_orders' shows the available instances of the reasoner
5343 in the current context.
5345 * Localized monotonicity predicate in theory "Orderings"; integrated
5346 lemmas max_of_mono and min_of_mono with this predicate.
5349 * Formulation of theorem "dense" changed slightly due to integration
5350 with new class dense_linear_order.
5352 * Uniform lattice theory development in HOL.
5354 constants "meet" and "join" now named "inf" and "sup"
5355 constant "Meet" now named "Inf"
5357 classes "meet_semilorder" and "join_semilorder" now named
5358 "lower_semilattice" and "upper_semilattice"
5359 class "lorder" now named "lattice"
5360 class "comp_lat" now named "complete_lattice"
5362 Instantiation of lattice classes allows explicit definitions
5363 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
5365 INCOMPATIBILITY. Theorem renames:
5367 meet_left_le ~> inf_le1
5368 meet_right_le ~> inf_le2
5369 join_left_le ~> sup_ge1
5370 join_right_le ~> sup_ge2
5371 meet_join_le ~> inf_sup_ord
5374 le_meet ~> le_inf_iff
5375 le_join ~> ge_sup_conv
5376 meet_idempotent ~> inf_idem
5377 join_idempotent ~> sup_idem
5378 meet_comm ~> inf_commute
5379 join_comm ~> sup_commute
5380 meet_leI1 ~> le_infI1
5381 meet_leI2 ~> le_infI2
5382 le_joinI1 ~> le_supI1
5383 le_joinI2 ~> le_supI2
5384 meet_assoc ~> inf_assoc
5385 join_assoc ~> sup_assoc
5386 meet_left_comm ~> inf_left_commute
5387 meet_left_idempotent ~> inf_left_idem
5388 join_left_comm ~> sup_left_commute
5389 join_left_idempotent ~> sup_left_idem
5392 le_def_meet ~> le_iff_inf
5393 le_def_join ~> le_iff_sup
5394 join_absorp2 ~> sup_absorb2
5395 join_absorp1 ~> sup_absorb1
5396 meet_absorp1 ~> inf_absorb1
5397 meet_absorp2 ~> inf_absorb2
5398 meet_join_absorp ~> inf_sup_absorb
5399 join_meet_absorp ~> sup_inf_absorb
5400 distrib_join_le ~> distrib_sup_le
5401 distrib_meet_le ~> distrib_inf_le
5403 add_meet_distrib_left ~> add_inf_distrib_left
5404 add_join_distrib_left ~> add_sup_distrib_left
5405 is_join_neg_meet ~> is_join_neg_inf
5406 is_meet_neg_join ~> is_meet_neg_sup
5407 add_meet_distrib_right ~> add_inf_distrib_right
5408 add_join_distrib_right ~> add_sup_distrib_right
5409 add_meet_join_distribs ~> add_sup_inf_distribs
5410 join_eq_neg_meet ~> sup_eq_neg_inf
5411 meet_eq_neg_join ~> inf_eq_neg_sup
5412 add_eq_meet_join ~> add_eq_inf_sup
5413 meet_0_imp_0 ~> inf_0_imp_0
5414 join_0_imp_0 ~> sup_0_imp_0
5415 meet_0_eq_0 ~> inf_0_eq_0
5416 join_0_eq_0 ~> sup_0_eq_0
5417 neg_meet_eq_join ~> neg_inf_eq_sup
5418 neg_join_eq_meet ~> neg_sup_eq_inf
5419 join_eq_if ~> sup_eq_if
5421 mono_meet ~> mono_inf
5422 mono_join ~> mono_sup
5423 meet_bool_eq ~> inf_bool_eq
5424 join_bool_eq ~> sup_bool_eq
5425 meet_fun_eq ~> inf_fun_eq
5426 join_fun_eq ~> sup_fun_eq
5427 meet_set_eq ~> inf_set_eq
5428 join_set_eq ~> sup_set_eq
5429 meet1_iff ~> inf1_iff
5430 meet2_iff ~> inf2_iff
5439 join1_iff ~> sup1_iff
5440 join2_iff ~> sup2_iff
5450 is_meet_Meet ~> is_meet_Inf
5451 Meet_bool_def ~> Inf_bool_def
5452 Meet_fun_def ~> Inf_fun_def
5453 Meet_greatest ~> Inf_greatest
5454 Meet_lower ~> Inf_lower
5455 Meet_set_def ~> Inf_set_def
5458 Sup_bool_eq ~> Sup_bool_def
5459 Sup_fun_eq ~> Sup_fun_def
5460 Sup_set_eq ~> Sup_set_def
5462 listsp_meetI ~> listsp_infI
5463 listsp_meet_eq ~> listsp_inf_eq
5468 * Added syntactic class "size"; overloaded constant "size" now has
5469 type "'a::size ==> bool"
5471 * Internal reorganisation of `size' of datatypes: size theorems
5472 "foo.size" are no longer subsumed by "foo.simps" (but are still
5473 simplification rules by default!); theorems "prod.size" now named
5476 * Class "div" now inherits from class "times" rather than "type".
5479 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
5480 Linorder etc. have disappeared; operations defined in terms of
5481 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
5483 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
5485 * HOL-Word: New extensive library and type for generic, fixed size
5486 machine words, with arithmetic, bit-wise, shifting and rotating
5487 operations, reflection into int, nat, and bool lists, automation for
5488 linear arithmetic (by automatic reflection into nat or int), including
5489 lemmas on overflow and monotonicity. Instantiated to all appropriate
5490 arithmetic type classes, supporting automatic simplification of
5491 numerals on all operations.
5493 * Library/Boolean_Algebra: locales for abstract boolean algebras.
5495 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
5497 * Code generator library theories:
5498 - Code_Integer represents HOL integers by big integer literals in target
5500 - Code_Char represents HOL characters by character literals in target
5502 - Code_Char_chr like Code_Char, but also offers treatment of character
5503 codes; includes Code_Integer.
5504 - Executable_Set allows to generate code for finite sets using lists.
5505 - Executable_Rat implements rational numbers as triples (sign, enumerator,
5507 - Executable_Real implements a subset of real numbers, namly those
5508 representable by rational numbers.
5509 - Efficient_Nat implements natural numbers by integers, which in general will
5510 result in higher efficency; pattern matching with 0/Suc is eliminated;
5511 includes Code_Integer.
5512 - Code_Index provides an additional datatype index which is mapped to
5513 target-language built-in integers.
5514 - Code_Message provides an additional datatype message_string which is isomorphic to
5515 strings; messages are mapped to target-language strings.
5517 * New package for inductive predicates
5519 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
5522 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5523 for z_1 :: U_1 and ... and z_n :: U_m
5525 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5528 with full support for type-inference, rather than
5530 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5532 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5533 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5535 inductive "s z_1 ... z_m"
5537 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5540 For backward compatibility, there is a wrapper allowing inductive
5541 sets to be defined with the new package via
5544 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5545 for z_1 :: U_1 and ... and z_n :: U_m
5547 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5553 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5554 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5555 for z_1 :: U_1 and ... and z_n :: U_m
5557 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5558 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5561 if the additional syntax "p ..." is required.
5563 Numerous examples can be found in the subdirectories src/HOL/Auth,
5564 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
5568 - Since declaration and definition of inductive sets or predicates
5569 is no longer separated, abbreviations involving the newly
5570 introduced sets or predicates must be specified together with the
5571 introduction rules after the 'where' keyword (see above), rather
5572 than before the actual inductive definition.
5574 - The variables in induction and elimination rules are now
5575 quantified in the order of their occurrence in the introduction
5576 rules, rather than in alphabetical order. Since this may break
5577 some proofs, these proofs either have to be repaired, e.g. by
5578 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
5579 statements of the form
5581 case (rule_i a_i_1 ... a_i_{k_i})
5583 or the old order of quantification has to be restored by explicitly adding
5584 meta-level quantifiers in the introduction rules, i.e.
5586 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
5588 - The format of the elimination rules is now
5590 p z_1 ... z_m x_1 ... x_n ==>
5591 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5596 (x_1, ..., x_n) : s z_1 ... z_m ==>
5597 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5600 for sets rather than
5602 x : s z_1 ... z_m ==>
5603 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
5606 This may require terms in goals to be expanded to n-tuples
5607 (e.g. using case_tac or simplification with the split_paired_all
5608 rule) before the above elimination rule is applicable.
5610 - The elimination or case analysis rules for (mutually) inductive
5611 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
5612 list of rules "p_1_..._p_k.elims" is no longer available.
5614 * New package "function"/"fun" for general recursive functions,
5615 supporting mutual and nested recursion, definitions in local contexts,
5616 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
5617 for small examples, and the separate tutorial on the function
5618 package. The old recdef "package" is still available as before, but
5619 users are encouraged to use the new package.
5621 * Method "lexicographic_order" automatically synthesizes termination
5622 relations as lexicographic combinations of size measures.
5624 * Case-expressions allow arbitrary constructor-patterns (including
5625 "_") and take their order into account, like in functional
5626 programming. Internally, this is translated into nested
5627 case-expressions; missing cases are added and mapped to the predefined
5628 constant "undefined". In complicated cases printing may no longer show
5629 the original input but the internal form. Lambda-abstractions allow
5630 the same form of pattern matching: "% pat1 => e1 | ..." is an
5631 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
5634 * IntDef: The constant "int :: nat => int" has been removed; now "int"
5635 is an abbreviation for "of_nat :: nat => int". The simplification
5636 rules for "of_nat" have been changed to work like "int" did
5637 previously. Potential INCOMPATIBILITY:
5638 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
5639 - of_nat_diff and of_nat_mult are no longer default simp rules
5641 * Method "algebra" solves polynomial equations over (semi)rings using
5642 Groebner bases. The (semi)ring structure is defined by locales and the
5643 tool setup depends on that generic context. Installing the method for
5644 a specific type involves instantiating the locale and possibly adding
5645 declarations for computation on the coefficients. The method is
5646 already instantiated for natural numbers and for the axiomatic class
5647 of idoms with numerals. See also the paper by Chaieb and Wenzel at
5648 CALCULEMUS 2007 for the general principles underlying this
5649 architecture of context-aware proof-tools.
5651 * Method "ferrack" implements quantifier elimination over
5652 special-purpose dense linear orders using locales (analogous to
5653 "algebra"). The method is already installed for class
5654 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
5657 * Former constant "List.op @" now named "List.append". Use ML
5658 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
5659 circumvent possible incompatibilities when working on ML level.
5661 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
5663 * New function listsum :: 'a list => 'a for arbitrary monoids.
5664 Special syntax: "SUM x <- xs. f x" (and latex variants)
5666 * New syntax for Haskell-like list comprehension (input only), eg.
5667 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
5669 * The special syntax for function "filter" has changed from [x :
5670 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
5671 comprehension syntax, and for uniformity. INCOMPATIBILITY.
5673 * [a..b] is now defined for arbitrary linear orders. It used to be
5674 defined on nat only, as an abbreviation for [a..<Suc b]
5677 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
5679 * New functions "sorted" and "sort" in src/HOL/List.thy.
5681 * New lemma collection field_simps (an extension of ring_simps) for
5682 manipulating (in)equations involving division. Multiplies with all
5683 denominators that can be proved to be non-zero (in equations) or
5684 positive/negative (in inequations).
5686 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
5687 have been improved and renamed to ring_simps, group_simps and
5688 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
5689 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
5691 * Theory Library/Commutative_Ring: switched from recdef to function
5692 package; constants add, mul, pow now curried. Infix syntax for
5693 algebraic operations.
5695 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
5698 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
5701 * HOL/records: generalised field-update to take a function on the
5702 field rather than the new value: r(|A := x|) is translated to A_update
5703 (K x) r The K-combinator that is internally used is called K_record.
5704 INCOMPATIBILITY: Usage of the plain update functions has to be
5707 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
5708 * x = 0, which are required for a semiring. Richer structures do not
5709 inherit from semiring_0 anymore, because this property is a theorem
5710 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
5711 there is more to prove, but this is mostly trivial.
5713 * Class "recpower" is generalized to arbitrary monoids, not just
5714 commutative semirings. INCOMPATIBILITY: may need to incorporate
5715 commutativity or semiring properties additionally.
5717 * Constant "List.list_all2" in List.thy now uses authentic syntax.
5718 INCOMPATIBILITY: translations containing list_all2 may go wrong,
5719 better use 'abbreviation'.
5721 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
5723 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
5724 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
5725 significant changes for setting up numeral syntax for types:
5726 - New constants Numeral.pred and Numeral.succ instead
5727 of former Numeral.bin_pred and Numeral.bin_succ.
5728 - Use integer operations instead of bin_add, bin_mult and so on.
5729 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
5730 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
5732 See src/HOL/Integ/IntArith.thy for an example setup.
5734 * Command 'normal_form' computes the normal form of a term that may
5735 contain free variables. For example ``normal_form "rev [a, b, c]"''
5736 produces ``[b, c, a]'' (without proof). This command is suitable for
5737 heavy-duty computations because the functions are compiled to ML
5738 first. Correspondingly, a method "normalization" is provided. See
5739 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
5741 * Alternative iff syntax "A <-> B" for equality on bool (with priority
5742 25 like -->); output depends on the "iff" print_mode, the default is
5743 "A = B" (with priority 50).
5745 * Relations less (<) and less_eq (<=) are also available on type bool.
5746 Modified syntax to disallow nesting without explicit parentheses,
5747 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
5750 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
5752 * Relation composition operator "op O" now has precedence 75 and binds
5753 stronger than union and intersection. INCOMPATIBILITY.
5755 * The old set interval syntax "{m..n(}" (and relatives) has been
5756 removed. Use "{m..<n}" (and relatives) instead.
5758 * In the context of the assumption "~(s = t)" the Simplifier rewrites
5759 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
5760 ``declare [[simproc del: neq]]''.
5762 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
5765 * Theorem Cons_eq_map_conv no longer declared as "simp".
5767 * Theorem setsum_mult renamed to setsum_right_distrib.
5769 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
5772 * Reimplemented methods "sat" and "satx", with several improvements:
5773 goals no longer need to be stated as "<prems> ==> False", equivalences
5774 (i.e. "=" on type bool) are handled, variable names of the form
5775 "lit_<n>" are no longer reserved, significant speedup.
5777 * Methods "sat" and "satx" can now replay MiniSat proof traces.
5778 zChaff is still supported as well.
5780 * 'inductive' and 'datatype': provide projections of mutual rules,
5781 bundled as foo_bar.inducts;
5783 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
5786 * Library: moved theory Accessible_Part to main HOL.
5788 * Library: added theory Coinductive_List of potentially infinite lists
5789 as greatest fixed-point.
5791 * Library: added theory AssocList which implements (finite) maps as
5794 * Method "evaluation" solves goals (i.e. a boolean expression)
5795 efficiently by compiling it to ML. The goal is "proved" (via an
5796 oracle) if it evaluates to True.
5798 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
5799 also when invoked by the simplifier. This results in the Simplifier
5800 being more powerful on arithmetic goals. INCOMPATIBILITY.
5801 Configuration option fast_arith_split_limit=0 recovers the old
5804 * Support for hex (0x20) and binary (0b1001) numerals.
5806 * New method: reify eqs (t), where eqs are equations for an
5807 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
5808 parameter, computes a term s::'b and a list xs::'a list and proves the
5809 theorem I xs s = t. This is also known as reification or quoting. The
5810 resulting theorem is applied to the subgoal to substitute t with I xs
5811 s. If t is omitted, the subgoal itself is reified.
5813 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
5814 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
5815 where f is supposed to be a computable function (in the sense of code
5816 generattion). The method uses reify to compute s and xs as above then
5817 applies corr_thm and uses normalization by evaluation to "prove" f s =
5818 r and finally gets the theorem t = r, which is again applied to the
5819 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
5821 * Reflection: Automatic reification now handels binding, an example is
5822 available in src/HOL/ex/ReflectionEx.thy
5824 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
5825 command 'statespace' that is similar to 'record', but introduces an
5826 abstract specification based on the locale infrastructure instead of
5827 HOL types. This leads to extra flexibility in composing state spaces,
5828 in particular multiple inheritance and renaming of components.
5833 * Hyperreal: Functions root and sqrt are now defined on negative real
5834 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
5835 Nonnegativity side conditions have been removed from many lemmas, so
5836 that more subgoals may now be solved by simplification; potential
5839 * Real: new type classes formalize real normed vector spaces and
5840 algebras, using new overloaded constants scaleR :: real => 'a => 'a
5841 and norm :: 'a => real.
5843 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
5844 reals into other types. The overloaded constant Reals :: 'a set is now
5845 defined as range of_real; potential INCOMPATIBILITY.
5847 * Real: proper support for ML code generation, including 'quickcheck'.
5848 Reals are implemented as arbitrary precision rationals.
5850 * Hyperreal: Several constants that previously worked only for the
5851 reals have been generalized, so they now work over arbitrary vector
5852 spaces. Type annotations may need to be added in some cases; potential
5855 Infinitesimal :: ('a::real_normed_vector) star set
5856 HFinite :: ('a::real_normed_vector) star set
5857 HInfinite :: ('a::real_normed_vector) star set
5858 approx :: ('a::real_normed_vector) star => 'a star => bool
5859 monad :: ('a::real_normed_vector) star => 'a star set
5860 galaxy :: ('a::real_normed_vector) star => 'a star set
5861 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
5862 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
5863 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
5864 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
5865 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
5866 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
5867 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
5868 sgn :: 'a::real_normed_vector => 'a
5869 exp :: 'a::{recpower,real_normed_field,banach} => 'a
5871 * Complex: Some complex-specific constants are now abbreviations for
5872 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
5873 hnorm. Other constants have been entirely removed in favor of the
5874 polymorphic versions (INCOMPATIBILITY):
5878 HInfinite <-- CInfinite
5879 Infinitesimal <-- CInfinitesimal
5882 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
5883 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
5884 (ns)deriv <-- (ns)cderiv
5889 * Formalisation of ideals and the quotient construction over rings.
5891 * Order and lattice theory no longer based on records.
5894 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
5895 greatest_closed. INCOMPATIBILITY.
5897 * Method algebra is now set up via an attribute. For examples see
5898 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
5899 of algebraic structures.
5901 * Renamed theory CRing to Ring.
5906 * Substantial, yet incomplete support for nominal datatypes (binding
5907 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
5908 src/HOL/Nominal/Examples. Prospective users should consult
5909 http://isabelle.in.tum.de/nominal/
5914 * ML basics: just one true type int, which coincides with IntInf.int
5917 * ML within Isar: antiquotations allow to embed statically-checked
5918 formal entities in the source, referring to the context available at
5919 compile-time. For example:
5921 ML {* @{sort "{zero,one}"} *}
5922 ML {* @{typ "'a => 'b"} *}
5923 ML {* @{term "%x. x"} *}
5924 ML {* @{prop "x == y"} *}
5925 ML {* @{ctyp "'a => 'b"} *}
5926 ML {* @{cterm "%x. x"} *}
5927 ML {* @{cprop "x == y"} *}
5928 ML {* @{thm asm_rl} *}
5929 ML {* @{thms asm_rl} *}
5930 ML {* @{type_name c} *}
5931 ML {* @{type_syntax c} *}
5932 ML {* @{const_name c} *}
5933 ML {* @{const_syntax c} *}
5936 ML {* @{theory Pure} *}
5937 ML {* @{theory_ref} *}
5938 ML {* @{theory_ref Pure} *}
5941 ML {* @{clasimpset} *}
5943 The same works for sources being ``used'' within an Isar context.
5945 * ML in Isar: improved error reporting; extra verbosity with
5946 ML_Context.trace enabled.
5948 * Pure/General/table.ML: the join operations now works via exceptions
5949 DUP/SAME instead of type option. This is simpler in simple cases, and
5950 admits slightly more efficient complex applications.
5952 * Pure: 'advanced' translation functions (parse_translation etc.) now
5953 use Context.generic instead of just theory.
5955 * Pure: datatype Context.generic joins theory/Proof.context and
5956 provides some facilities for code that works in either kind of
5957 context, notably GenericDataFun for uniform theory and proof data.
5959 * Pure: simplified internal attribute type, which is now always
5960 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
5961 local (Proof.context) attributes have been discontinued, while
5962 minimizing code duplication. Thm.rule_attribute and
5963 Thm.declaration_attribute build canonical attributes; see also structure
5964 Context for further operations on Context.generic, notably
5965 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
5966 declarations and definitions.
5968 * Context data interfaces (Theory/Proof/GenericDataFun): removed
5969 name/print, uninitialized data defaults to ad-hoc copy of empty value,
5970 init only required for impure data. INCOMPATIBILITY: empty really need
5971 to be empty (no dependencies on theory content!)
5973 * Pure/kernel: consts certification ignores sort constraints given in
5974 signature declarations. (This information is not relevant to the
5975 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
5976 potential INCOMPATIBILITY.
5978 * Pure: axiomatic type classes are now purely definitional, with
5979 explicit proofs of class axioms and super class relations performed
5980 internally. See Pure/axclass.ML for the main internal interfaces --
5981 notably AxClass.define_class supercedes AxClass.add_axclass, and
5982 AxClass.axiomatize_class/classrel/arity supersede
5983 Sign.add_classes/classrel/arities.
5985 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
5986 global/local versions on theory vs. Proof.context have been
5987 discontinued; Attrib.syntax and Method.syntax have been adapted
5988 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
5989 attributes, methods, etc.
5991 * Pure: several functions of signature "... -> theory -> theory * ..."
5992 have been reoriented to "... -> theory -> ... * theory" in order to
5993 allow natural usage in combination with the ||>, ||>>, |-> and
5994 fold_map combinators.
5996 * Pure: official theorem names (closed derivations) and additional
5997 comments (tags) are now strictly separate. Name hints -- which are
5998 maintained as tags -- may be attached any time without affecting the
6001 * Pure: primitive rule lift_rule now takes goal cterm instead of an
6002 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
6003 achieve the old behaviour.
6005 * Pure: the "Goal" constant is now called "prop", supporting a
6006 slightly more general idea of ``protecting'' meta-level rule
6009 * Pure: Logic.(un)varify only works in a global context, which is now
6010 enforced instead of silently assumed. INCOMPATIBILITY, may use
6011 Logic.legacy_(un)varify as temporary workaround.
6013 * Pure: structure Name provides scalable operations for generating
6014 internal variable names, notably Name.variants etc. This replaces
6015 some popular functions from term.ML:
6017 Term.variant -> Name.variant
6018 Term.variantlist -> Name.variant_list
6019 Term.invent_names -> Name.invent_list
6021 Note that low-level renaming rarely occurs in new code -- operations
6022 from structure Variable are used instead (see below).
6024 * Pure: structure Variable provides fundamental operations for proper
6025 treatment of fixed/schematic variables in a context. For example,
6026 Variable.import introduces fixes for schematics of given facts and
6027 Variable.export reverses the effect (up to renaming) -- this replaces
6028 various freeze_thaw operations.
6030 * Pure: structure Goal provides simple interfaces for
6031 init/conclude/finish and tactical prove operations (replacing former
6032 Tactic.prove). Goal.prove is the canonical way to prove results
6033 within a given context; Goal.prove_global is a degraded version for
6034 theory level goals, including a global Drule.standard. Note that
6035 OldGoals.prove_goalw_cterm has long been obsolete, since it is
6036 ill-behaved in a local proof context (e.g. with local fixes/assumes or
6037 in a locale context).
6039 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
6040 and type checking (Syntax.check_term etc.), with common combinations
6041 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
6042 which are considered legacy and await removal.
6044 * Pure/Syntax: generic interfaces for type unchecking
6045 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
6046 with common combinations (Syntax.pretty_term, Syntax.string_of_term
6047 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
6048 available for convenience, but refer to the very same operations using
6049 a mere theory instead of a full context.
6051 * Isar: simplified treatment of user-level errors, using exception
6052 ERROR of string uniformly. Function error now merely raises ERROR,
6053 without any side effect on output channels. The Isar toplevel takes
6054 care of proper display of ERROR exceptions. ML code may use plain
6055 handle/can/try; cat_error may be used to concatenate errors like this:
6057 ... handle ERROR msg => cat_error msg "..."
6059 Toplevel ML code (run directly or through the Isar toplevel) may be
6060 embedded into the Isar toplevel with exception display/debug like
6063 Isar.toplevel (fn () => ...)
6065 INCOMPATIBILITY, removed special transform_error facilities, removed
6066 obsolete variants of user-level exceptions (ERROR_MESSAGE,
6067 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
6068 -- use plain ERROR instead.
6070 * Isar: theory setup now has type (theory -> theory), instead of a
6071 list. INCOMPATIBILITY, may use #> to compose setup functions.
6073 * Isar: ML toplevel pretty printer for type Proof.context, subject to
6074 ProofContext.debug/verbose flags.
6076 * Isar: Toplevel.theory_to_proof admits transactions that modify the
6077 theory before entering a proof state. Transactions now always see a
6078 quasi-functional intermediate checkpoint, both in interactive and
6081 * Isar: simplified interfaces for outer syntax. Renamed
6082 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
6083 OuterSyntax.add_parsers -- this functionality is now included in
6084 OuterSyntax.command etc. INCOMPATIBILITY.
6086 * Simplifier: the simpset of a running simplification process now
6087 contains a proof context (cf. Simplifier.the_context), which is the
6088 very context that the initial simpset has been retrieved from (by
6089 simpset_of/local_simpset_of). Consequently, all plug-in components
6090 (solver, looper etc.) may depend on arbitrary proof data.
6092 * Simplifier.inherit_context inherits the proof context (plus the
6093 local bounds) of the current simplification process; any simproc
6094 etc. that calls the Simplifier recursively should do this! Removed
6095 former Simplifier.inherit_bounds, which is already included here --
6096 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
6097 specify an explicit context using Simplifier.context/theory_context.
6099 * Simplifier/Classical Reasoner: more abstract interfaces
6100 change_simpset/claset for modifying the simpset/claset reference of a
6101 theory; raw versions simpset/claset_ref etc. have been discontinued --
6104 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
6110 * settings: the default heap location within ISABELLE_HOME_USER now
6111 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
6112 Isabelle installations.
6114 * isabelle-process: option -S (secure mode) disables some critical
6115 operations, notably runtime compilation and evaluation of ML source
6118 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
6120 * Support for parallel execution, using native multicore support of
6121 Poly/ML 5.1. The theory loader exploits parallelism when processing
6122 independent theories, according to the given theory header
6123 specifications. The maximum number of worker threads is specified via
6124 usedir option -M or the "max-threads" setting in Proof General. A
6125 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
6126 to 6 on a 8-core machine. User-code needs to observe certain
6127 guidelines for thread-safe programming, see appendix A in the Isar
6128 Implementation manual.
6132 New in Isabelle2005 (October 2005)
6133 ----------------------------------
6137 * Theory headers: the new header syntax for Isar theories is
6140 imports <theory1> ... <theoryN>
6141 uses <file1> ... <fileM>
6144 where the 'uses' part is optional. The previous syntax
6146 theory <name> = <theory1> + ... + <theoryN>:
6148 will disappear in the next release. Use isatool fixheaders to convert
6149 existing theory files. Note that there is no change in ancient
6150 non-Isar theories now, but these will disappear soon.
6152 * Theory loader: parent theories can now also be referred to via
6153 relative and absolute paths.
6155 * Command 'find_theorems' searches for a list of criteria instead of a
6156 list of constants. Known criteria are: intro, elim, dest, name:string,
6157 simp:term, and any term. Criteria can be preceded by '-' to select
6158 theorems that do not match. Intro, elim, dest select theorems that
6159 match the current goal, name:s selects theorems whose fully qualified
6160 name contain s, and simp:term selects all simplification rules whose
6161 lhs match term. Any other term is interpreted as pattern and selects
6162 all theorems matching the pattern. Available in ProofGeneral under
6163 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
6165 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
6167 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
6168 matching the current goal as introduction rule and not having "HOL."
6169 in their name (i.e. not being defined in theory HOL).
6171 * Command 'thms_containing' has been discontinued in favour of
6172 'find_theorems'; INCOMPATIBILITY.
6174 * Communication with Proof General is now 8bit clean, which means that
6175 Unicode text in UTF-8 encoding may be used within theory texts (both
6176 formal and informal parts). Cf. option -U of the Isabelle Proof
6177 General interface. Here are some simple examples (cf. src/HOL/ex):
6179 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
6180 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
6182 * Improved efficiency of the Simplifier and, to a lesser degree, the
6183 Classical Reasoner. Typical big applications run around 2 times
6187 *** Document preparation ***
6189 * Commands 'display_drafts' and 'print_drafts' perform simple output
6190 of raw sources. Only those symbols that do not require additional
6191 LaTeX packages (depending on comments in isabellesym.sty) are
6192 displayed properly, everything else is left verbatim. isatool display
6193 and isatool print are used as front ends (these are subject to the
6194 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
6196 * Command tags control specific markup of certain regions of text,
6197 notably folding and hiding. Predefined tags include "theory" (for
6198 theory begin and end), "proof" for proof commands, and "ML" for
6199 commands involving ML code; the additional tags "visible" and
6200 "invisible" are unused by default. Users may give explicit tag
6201 specifications in the text, e.g. ''by %invisible (auto)''. The
6202 interpretation of tags is determined by the LaTeX job during document
6203 preparation: see option -V of isatool usedir, or options -n and -t of
6204 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
6207 Several document versions may be produced at the same time via isatool
6208 usedir (the generated index.html will link all of them). Typical
6209 specifications include ''-V document=theory,proof,ML'' to present
6210 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
6211 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
6212 these parts without any formal replacement text. The Isabelle site
6213 default settings produce ''document'' and ''outline'' versions as
6216 * Several new antiquotations:
6218 @{term_type term} prints a term with its type annotated;
6220 @{typeof term} prints the type of a term;
6222 @{const const} is the same as @{term const}, but checks that the
6223 argument is a known logical constant;
6225 @{term_style style term} and @{thm_style style thm} print a term or
6226 theorem applying a "style" to it
6230 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
6231 definitions, equations, inequations etc., 'concl' printing only the
6232 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
6233 to print the specified premise. TermStyle.add_style provides an ML
6234 interface for introducing further styles. See also the "LaTeX Sugar"
6235 document practical applications. The ML antiquotation prints
6236 type-checked ML expressions verbatim.
6238 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
6239 and 'text' support optional locale specification '(in loc)', which
6240 specifies the default context for interpreting antiquotations. For
6241 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
6243 * Option 'locale=NAME' of antiquotations specifies an alternative
6244 context interpreting the subsequent argument. For example: @{thm
6245 [locale=lattice] inf_assoc}.
6247 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
6250 * Proper output of antiquotations for theory commands involving a
6251 proof context (such as 'locale' or 'theorem (in loc) ...').
6253 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
6254 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
6256 * isatool usedir: new option -C (default true) controls whether option
6257 -D should include a copy of the original document directory; -C false
6258 prevents unwanted effects such as copying of administrative CVS data.
6263 * Considerably improved version of 'constdefs' command. Now performs
6264 automatic type-inference of declared constants; additional support for
6265 local structure declarations (cf. locales and HOL records), see also
6266 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
6267 sequential dependencies of definitions within a single 'constdefs'
6268 section; moreover, the declared name needs to be an identifier. If
6269 all fails, consider to fall back on 'consts' and 'defs' separately.
6271 * Improved indexed syntax and implicit structures. First of all,
6272 indexed syntax provides a notational device for subscripted
6273 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
6274 expressions. Secondly, in a local context with structure
6275 declarations, number indexes \<^sub>n or the empty index (default
6276 number 1) refer to a certain fixed variable implicitly; option
6277 show_structs controls printing of implicit structures. Typical
6278 applications of these concepts involve record types and locales.
6280 * New command 'no_syntax' removes grammar declarations (and
6281 translations) resulting from the given syntax specification, which is
6282 interpreted in the same manner as for the 'syntax' command.
6284 * 'Advanced' translation functions (parse_translation etc.) may depend
6285 on the signature of the theory context being presently used for
6286 parsing/printing, see also isar-ref manual.
6288 * Improved 'oracle' command provides a type-safe interface to turn an
6289 ML expression of type theory -> T -> term into a primitive rule of
6290 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
6291 is already included here); see also FOL/ex/IffExample.thy;
6294 * axclass: name space prefix for class "c" is now "c_class" (was "c"
6295 before); "cI" is no longer bound, use "c.intro" instead.
6296 INCOMPATIBILITY. This change avoids clashes of fact bindings for
6297 axclasses vs. locales.
6299 * Improved internal renaming of symbolic identifiers -- attach primes
6300 instead of base 26 numbers.
6302 * New flag show_question_marks controls printing of leading question
6303 marks in schematic variable names.
6305 * In schematic variable names, *any* symbol following \<^isub> or
6306 \<^isup> is now treated as part of the base name. For example, the
6307 following works without printing of awkward ".0" indexes:
6309 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
6312 * Inner syntax includes (*(*nested*) comments*).
6314 * Pretty printer now supports unbreakable blocks, specified in mixfix
6315 annotations as "(00...)".
6317 * Clear separation of logical types and nonterminals, where the latter
6318 may only occur in 'syntax' specifications or type abbreviations.
6319 Before that distinction was only partially implemented via type class
6320 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
6321 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
6322 exotic syntax specifications may require further adaption
6323 (e.g. Cube/Cube.thy).
6325 * Removed obsolete type class "logic", use the top sort {} instead.
6326 Note that non-logical types should be declared as 'nonterminals'
6327 rather than 'types'. INCOMPATIBILITY for new object-logic
6330 * Attributes 'induct' and 'cases': type or set names may now be
6331 locally fixed variables as well.
6333 * Simplifier: can now control the depth to which conditional rewriting
6334 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
6337 * Simplifier: simplification procedures may now take the current
6338 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
6339 interface), which is very useful for calling the Simplifier
6340 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
6341 is gone -- use prems_of_ss on the simpset instead. Moreover, the
6342 low-level mk_simproc no longer applies Logic.varify internally, to
6343 allow for use in a context of fixed variables.
6345 * thin_tac now works even if the assumption being deleted contains !!
6346 or ==>. More generally, erule now works even if the major premise of
6347 the elimination rule contains !! or ==>.
6349 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
6351 * Reorganized bootstrapping of the Pure theories; CPure is now derived
6352 from Pure, which contains all common declarations already. Both
6353 theories are defined via plain Isabelle/Isar .thy files.
6354 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
6355 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
6356 use isatool fixcpure to adapt your theory and ML sources.
6358 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
6359 selections of theorems in named facts via index ranges.
6361 * 'print_theorems': in theory mode, really print the difference
6362 wrt. the last state (works for interactive theory development only),
6363 in proof mode print all local facts (cf. 'print_facts');
6365 * 'hide': option '(open)' hides only base names.
6367 * More efficient treatment of intermediate checkpoints in interactive
6370 * Code generator is now invoked via code_module (incremental code
6371 generation) and code_library (modular code generation, ML structures
6372 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
6373 must be quoted when used as identifiers.
6375 * New 'value' command for reading, evaluating and printing terms using
6376 the code generator. INCOMPATIBILITY: command keyword 'value' must be
6377 quoted when used as identifier.
6382 * New commands for the interpretation of locale expressions in
6383 theories (1), locales (2) and proof contexts (3). These generate
6384 proof obligations from the expression specification. After the
6385 obligations have been discharged, theorems of the expression are added
6386 to the theory, target locale or proof context. The synopsis of the
6387 commands is a follows:
6389 (1) interpretation expr inst
6390 (2) interpretation target < expr
6391 (3) interpret expr inst
6393 Interpretation in theories and proof contexts require a parameter
6394 instantiation of terms from the current context. This is applied to
6395 specifications and theorems of the interpreted expression.
6396 Interpretation in locales only permits parameter renaming through the
6397 locale expression. Interpretation is smart in that interpretations
6398 that are active already do not occur in proof obligations, neither are
6399 instantiated theorems stored in duplicate. Use 'print_interps' to
6400 inspect active interpretations of a particular locale. For details,
6401 see the Isar Reference manual. Examples can be found in
6402 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
6404 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
6405 'interpret' instead.
6407 * New context element 'constrains' for adding type constraints to
6410 * Context expressions: renaming of parameters with syntax
6413 * Locale declaration: 'includes' disallowed.
6415 * Proper static binding of attribute syntax -- i.e. types / terms /
6416 facts mentioned as arguments are always those of the locale definition
6417 context, independently of the context of later invocations. Moreover,
6418 locale operations (renaming and type / term instantiation) are applied
6419 to attribute arguments as expected.
6421 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
6422 actual attributes; rare situations may require Attrib.attribute to
6423 embed those attributes into Attrib.src that lack concrete syntax.
6424 Attribute implementations need to cooperate properly with the static
6425 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
6426 Attrib.XXX_thm etc. already do the right thing without further
6427 intervention. Only unusual applications -- such as "where" or "of"
6428 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
6429 on the context and the facts involved -- may have to assign parsed
6430 values to argument tokens explicitly.
6432 * Changed parameter management in theorem generation for long goal
6433 statements with 'includes'. INCOMPATIBILITY: produces a different
6434 theorem statement in rare situations.
6436 * Locale inspection command 'print_locale' omits notes elements. Use
6437 'print_locale!' to have them included in the output.
6442 * Provers/hypsubst.ML: improved version of the subst method, for
6443 single-step rewriting: it now works in bound variable contexts. New is
6444 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
6445 rewrite a different subterm than the original subst method, which is
6446 still available as 'simplesubst'.
6448 * Provers/quasi.ML: new transitivity reasoners for transitivity only
6451 * Provers/trancl.ML: new transitivity reasoner for transitive and
6452 reflexive-transitive closure of relations.
6454 * Provers/blast.ML: new reference depth_limit to make blast's depth
6455 limit (previously hard-coded with a value of 20) user-definable.
6457 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
6458 is peformed already. Object-logics merely need to finish their
6459 initial simpset configuration as before. INCOMPATIBILITY.
6464 * Symbolic syntax of Hilbert Choice Operator is now as follows:
6467 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
6469 The symbol \<some> is displayed as the alternative epsilon of LaTeX
6470 and x-symbol; use option '-m epsilon' to get it actually printed.
6471 Moreover, the mathematically important symbolic identifier \<epsilon>
6472 becomes available as variable, constant etc. INCOMPATIBILITY,
6474 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
6475 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
6476 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
6477 support corresponding Isar calculations.
6479 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
6482 * theory SetInterval: changed the syntax for open intervals:
6491 The old syntax is still supported but will disappear in the next
6492 release. For conversion use the following Emacs search and replace
6493 patterns (these are not perfect but work quite well):
6495 {)\([^\.]*\)\.\. -> {\1<\.\.}
6496 \.\.\([^(}]*\)(} -> \.\.<\1}
6498 * Theory Commutative_Ring (in Library): method comm_ring for proving
6499 equalities in commutative rings; method 'algebra' provides a generic
6502 * Theory Finite_Set: changed the syntax for 'setsum', summation over
6503 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
6504 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
6507 Some new syntax forms are available:
6509 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
6510 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
6511 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
6512 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
6514 The latter form "\<Sum>x < k. e" used to be based on a separate
6515 function "Summation", which has been discontinued.
6517 * theory Finite_Set: in structured induction proofs, the insert case
6518 is now 'case (insert x F)' instead of the old counterintuitive 'case
6521 * The 'refute' command has been extended to support a much larger
6522 fragment of HOL, including axiomatic type classes, constdefs and
6523 typedefs, inductive datatypes and recursion.
6525 * New tactics 'sat' and 'satx' to prove propositional tautologies.
6526 Requires zChaff with proof generation to be installed. See
6527 HOL/ex/SAT_Examples.thy for examples.
6529 * Datatype induction via method 'induct' now preserves the name of the
6530 induction variable. For example, when proving P(xs::'a list) by
6531 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
6532 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
6533 in unstructured proof scripts.
6535 * Reworked implementation of records. Improved scalability for
6536 records with many fields, avoiding performance problems for type
6537 inference. Records are no longer composed of nested field types, but
6538 of nested extension types. Therefore the record type only grows linear
6539 in the number of extensions and not in the number of fields. The
6540 top-level (users) view on records is preserved. Potential
6541 INCOMPATIBILITY only in strange cases, where the theory depends on the
6542 old record representation. The type generated for a record is called
6543 <record_name>_ext_type.
6545 Flag record_quick_and_dirty_sensitive can be enabled to skip the
6546 proofs triggered by a record definition or a simproc (if
6547 quick_and_dirty is enabled). Definitions of large records can take
6550 New simproc record_upd_simproc for simplification of multiple record
6551 updates enabled by default. Moreover, trivial updates are also
6552 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
6553 occasionally, since simplification is more powerful by default.
6555 * typedef: proper support for polymorphic sets, which contain extra
6556 type-variables in the term.
6558 * Simplifier: automatically reasons about transitivity chains
6559 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
6560 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
6561 old proofs break occasionally as simplification may now solve more
6562 goals than previously.
6564 * Simplifier: converts x <= y into x = y if assumption y <= x is
6565 present. Works for all partial orders (class "order"), in particular
6566 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
6569 * Simplifier: new simproc for "let x = a in f x". If a is a free or
6570 bound variable or a constant then the let is unfolded. Otherwise
6571 first a is simplified to b, and then f b is simplified to g. If
6572 possible we abstract b from g arriving at "let x = b in h x",
6573 otherwise we unfold the let and arrive at g. The simproc can be
6574 enabled/disabled by the reference use_let_simproc. Potential
6575 INCOMPATIBILITY since simplification is more powerful by default.
6577 * Classical reasoning: the meson method now accepts theorems as arguments.
6579 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
6580 jobs to provide advice on the provability of subgoals.
6582 * Theory OrderedGroup and Ring_and_Field: various additions and
6583 improvements to faciliate calculations involving equalities and
6586 The following theorems have been eliminated or modified
6589 abs_eq now named abs_of_nonneg
6590 abs_of_ge_0 now named abs_of_nonneg
6591 abs_minus_eq now named abs_of_nonpos
6592 imp_abs_id now named abs_of_nonneg
6593 imp_abs_neg_id now named abs_of_nonpos
6594 mult_pos now named mult_pos_pos
6595 mult_pos_le now named mult_nonneg_nonneg
6596 mult_pos_neg_le now named mult_nonneg_nonpos
6597 mult_pos_neg2_le now named mult_nonneg_nonpos2
6598 mult_neg now named mult_neg_neg
6599 mult_neg_le now named mult_nonpos_nonpos
6601 * The following lemmas in Ring_and_Field have been added to the simplifier:
6604 not_square_less_zero
6606 The following lemmas have been deleted from Real/RealPow:
6616 * Theory Parity: added rules for simplifying exponents.
6620 The following theorems have been eliminated or modified
6623 list_all_Nil now named list_all.simps(1)
6624 list_all_Cons now named list_all.simps(2)
6625 list_all_conv now named list_all_iff
6626 set_mem_eq now named mem_iff
6628 * Theories SetsAndFunctions and BigO (see HOL/Library) support
6629 asymptotic "big O" calculations. See the notes in BigO.thy.
6634 * Theory RealDef: better support for embedding natural numbers and
6635 integers in the reals.
6637 The following theorems have been eliminated or modified
6640 exp_ge_add_one_self now requires no hypotheses
6641 real_of_int_add reversed direction of equality (use [symmetric])
6642 real_of_int_minus reversed direction of equality (use [symmetric])
6643 real_of_int_diff reversed direction of equality (use [symmetric])
6644 real_of_int_mult reversed direction of equality (use [symmetric])
6646 * Theory RComplete: expanded support for floor and ceiling functions.
6648 * Theory Ln is new, with properties of the natural logarithm
6650 * Hyperreal: There is a new type constructor "star" for making
6651 nonstandard types. The old type names are now type synonyms:
6655 hcomplex = complex star
6657 * Hyperreal: Many groups of similarly-defined constants have been
6658 replaced by polymorphic versions (INCOMPATIBILITY):
6660 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
6662 starset <-- starsetNat, starsetC
6663 *s* <-- *sNat*, *sc*
6664 starset_n <-- starsetNat_n, starsetC_n
6665 *sn* <-- *sNatn*, *scn*
6666 InternalSets <-- InternalNatSets, InternalCSets
6668 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6669 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
6670 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
6671 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
6672 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
6674 * Hyperreal: Many type-specific theorems have been removed in favor of
6675 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
6677 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
6678 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
6679 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
6680 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
6681 right_minus <-- hypreal_add_minus
6682 left_minus <-- {hypreal,hcomplex}_add_minus_left
6683 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
6684 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
6685 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
6686 mult_1_right <-- hcomplex_mult_one_right
6687 mult_zero_left <-- hcomplex_mult_zero_left
6688 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
6689 right_distrib <-- hypnat_add_mult_distrib2
6690 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
6691 right_inverse <-- hypreal_mult_inverse
6692 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
6693 order_refl <-- {hypreal,hypnat}_le_refl
6694 order_trans <-- {hypreal,hypnat}_le_trans
6695 order_antisym <-- {hypreal,hypnat}_le_anti_sym
6696 order_less_le <-- {hypreal,hypnat}_less_le
6697 linorder_linear <-- {hypreal,hypnat}_le_linear
6698 add_left_mono <-- {hypreal,hypnat}_add_left_mono
6699 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
6700 add_nonneg_nonneg <-- hypreal_le_add_order
6702 * Hyperreal: Separate theorems having to do with type-specific
6703 versions of constants have been merged into theorems that apply to the
6704 new polymorphic constants (INCOMPATIBILITY):
6706 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
6707 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
6708 STAR_Un <-- {STAR,NatStar,STARC}_Un
6709 STAR_Int <-- {STAR,NatStar,STARC}_Int
6710 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
6711 STAR_subset <-- {STAR,NatStar,STARC}_subset
6712 STAR_mem <-- {STAR,NatStar,STARC}_mem
6713 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
6714 STAR_diff <-- {STAR,STARC}_diff
6715 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
6716 STARC_hcomplex_of_complex}_image_subset
6717 starset_n_Un <-- starset{Nat,C}_n_Un
6718 starset_n_Int <-- starset{Nat,C}_n_Int
6719 starset_n_Compl <-- starset{Nat,C}_n_Compl
6720 starset_n_diff <-- starset{Nat,C}_n_diff
6721 InternalSets_Un <-- Internal{Nat,C}Sets_Un
6722 InternalSets_Int <-- Internal{Nat,C}Sets_Int
6723 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
6724 InternalSets_diff <-- Internal{Nat,C}Sets_diff
6725 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
6726 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
6727 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
6728 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
6729 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
6730 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6731 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
6732 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
6733 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
6734 starfun_diff <-- starfun{C,RC,CR}_diff
6735 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
6736 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
6737 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
6738 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
6739 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
6740 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
6741 starfun_Id <-- starfunC_Id
6742 starfun_approx <-- starfun{Nat,CR}_approx
6743 starfun_capprox <-- starfun{C,RC}_capprox
6744 starfun_abs <-- starfunNat_rabs
6745 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
6746 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
6747 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
6748 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
6749 starfun_add_capprox <-- starfun{C,RC}_add_capprox
6750 starfun_add_approx <-- starfunCR_add_approx
6751 starfun_inverse_inverse <-- starfunC_inverse_inverse
6752 starfun_divide <-- starfun{C,CR,RC}_divide
6753 starfun_n <-- starfun{Nat,C}_n
6754 starfun_n_mult <-- starfun{Nat,C}_n_mult
6755 starfun_n_add <-- starfun{Nat,C}_n_add
6756 starfun_n_add_minus <-- starfunNat_n_add_minus
6757 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
6758 starfun_n_minus <-- starfun{Nat,C}_n_minus
6759 starfun_n_eq <-- starfun{Nat,C}_n_eq
6761 star_n_add <-- {hypreal,hypnat,hcomplex}_add
6762 star_n_minus <-- {hypreal,hcomplex}_minus
6763 star_n_diff <-- {hypreal,hcomplex}_diff
6764 star_n_mult <-- {hypreal,hcomplex}_mult
6765 star_n_inverse <-- {hypreal,hcomplex}_inverse
6766 star_n_le <-- {hypreal,hypnat}_le
6767 star_n_less <-- {hypreal,hypnat}_less
6768 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
6769 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
6770 star_n_abs <-- hypreal_hrabs
6771 star_n_divide <-- hcomplex_divide
6773 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
6774 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
6775 star_of_diff <-- hypreal_of_real_diff
6776 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
6777 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
6778 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
6779 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
6780 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
6781 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
6782 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
6783 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
6784 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
6785 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
6786 star_of_number_of <-- {hypreal,hcomplex}_number_of
6787 star_of_number_less <-- number_of_less_hypreal_of_real_iff
6788 star_of_number_le <-- number_of_le_hypreal_of_real_iff
6789 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
6790 star_of_less_number <-- hypreal_of_real_less_number_of_iff
6791 star_of_le_number <-- hypreal_of_real_le_number_of_iff
6792 star_of_power <-- hypreal_of_real_power
6793 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
6795 * Hyperreal: new method "transfer" that implements the transfer
6796 principle of nonstandard analysis. With a subgoal that mentions
6797 nonstandard types like "'a star", the command "apply transfer"
6798 replaces it with an equivalent one that mentions only standard types.
6799 To be successful, all free variables must have standard types; non-
6800 standard variables must have explicit universal quantifiers.
6802 * Hyperreal: A theory of Taylor series.
6807 * Discontinued special version of 'constdefs' (which used to support
6808 continuous functions) in favor of the general Pure one with full
6811 * New simplification procedure for solving continuity conditions; it
6812 is much faster on terms with many nested lambda abstractions (cubic
6813 instead of exponential time).
6815 * New syntax for domain package: selector names are now optional.
6816 Parentheses should be omitted unless argument is lazy, for example:
6818 domain 'a stream = cons "'a" (lazy "'a stream")
6820 * New command 'fixrec' for defining recursive functions with pattern
6821 matching; defining multiple functions with mutual recursion is also
6822 supported. Patterns may include the constants cpair, spair, up, sinl,
6823 sinr, or any data constructor defined by the domain package. The given
6824 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
6825 syntax and examples.
6827 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
6828 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
6829 but the proof obligation additionally includes an admissibility
6830 requirement. The packages generate instances of class cpo or pcpo,
6831 with continuity and strictness theorems for Rep and Abs.
6833 * HOLCF: Many theorems have been renamed according to a more standard naming
6834 scheme (INCOMPATIBILITY):
6836 foo_inject: "foo$x = foo$y ==> x = y"
6837 foo_eq: "(foo$x = foo$y) = (x = y)"
6838 foo_less: "(foo$x << foo$y) = (x << y)"
6839 foo_strict: "foo$UU = UU"
6840 foo_defined: "... ==> foo$x ~= UU"
6841 foo_defined_iff: "(foo$x = UU) = (x = UU)"
6846 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
6847 including the First Isomorphism Theorem (on quotienting by the kernel
6850 * ZF/Simplifier: install second copy of type solver that actually
6851 makes use of TC rules declared to Isar proof contexts (or locales);
6852 the old version is still required for ML proof scripts.
6857 * Converted to Isar theory format; use locales instead of axiomatic
6863 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
6866 * Pure/library.ML no longer defines its own option datatype, but uses
6867 that of the SML basis, which has constructors NONE and SOME instead of
6868 None and Some, as well as exception Option.Option instead of OPTION.
6869 The functions the, if_none, is_some, is_none have been adapted
6870 accordingly, while Option.map replaces apsome.
6872 * Pure/library.ML: the exception LIST has been given up in favour of
6873 the standard exceptions Empty and Subscript, as well as
6874 Library.UnequalLengths. Function like Library.hd and Library.tl are
6875 superceded by the standard hd and tl functions etc.
6877 A number of basic list functions are no longer exported to the ML
6878 toplevel, as they are variants of predefined functions. The following
6879 suggests how one can translate existing code:
6881 rev_append xs ys = List.revAppend (xs, ys)
6882 nth_elem (i, xs) = List.nth (xs, i)
6883 last_elem xs = List.last xs
6884 flat xss = List.concat xss
6885 seq fs = List.app fs
6886 partition P xs = List.partition P xs
6887 mapfilter f xs = List.mapPartial f xs
6889 * Pure/library.ML: several combinators for linear functional
6890 transformations, notably reverse application and composition:
6893 (x, y) |-> f f #-> g
6895 * Pure/library.ML: introduced/changed precedence of infix operators:
6897 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
6899 infix 3 o oo ooo oooo;
6900 infix 4 ~~ upto downto;
6902 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
6905 * Pure/library.ML: natural list combinators fold, fold_rev, and
6906 fold_map support linear functional transformations and nesting. For
6909 fold f [x1, ..., xN] y =
6910 y |> f x1 |> ... |> f xN
6912 (fold o fold) f [xs1, ..., xsN] y =
6913 y |> fold f xs1 |> ... |> fold f xsN
6915 fold f [x1, ..., xN] =
6918 (fold o fold) f [xs1, ..., xsN] =
6919 fold f xs1 #> ... #> fold f xsN
6921 * Pure/library.ML: the following selectors on type 'a option are
6924 the: 'a option -> 'a (*partial*)
6925 these: 'a option -> 'a where 'a = 'b list
6926 the_default: 'a -> 'a option -> 'a
6927 the_list: 'a option -> 'a list
6929 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6930 basic operations for association lists, following natural argument
6931 order; moreover the explicit equality predicate passed here avoids
6932 potentially expensive polymorphic runtime equality checks.
6933 The old functions may be expressed as follows:
6935 assoc = uncurry (AList.lookup (op =))
6936 assocs = these oo AList.lookup (op =)
6937 overwrite = uncurry (AList.update (op =)) o swap
6939 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6941 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
6942 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
6944 replacing make_keylist and keyfilter (occassionally used)
6947 make_keylist = AList.make
6948 keyfilter = AList.find (op =)
6950 * eq_fst and eq_snd now take explicit equality parameter, thus
6951 avoiding eqtypes. Naive rewrites:
6953 eq_fst = eq_fst (op =)
6954 eq_snd = eq_snd (op =)
6956 * Removed deprecated apl and apr (rarely used).
6959 apl (n, op) =>>= curry op n
6960 apr (op, m) =>>= fn n => op (n, m)
6962 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
6963 provides a reasonably efficient light-weight implementation of sets as
6966 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
6967 few new operations; existing lookup and update are now curried to
6968 follow natural argument order (for use with fold etc.);
6969 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
6971 * Pure/General: output via the Isabelle channels of
6972 writeln/warning/error etc. is now passed through Output.output, with a
6973 hook for arbitrary transformations depending on the print_mode
6974 (cf. Output.add_mode -- the first active mode that provides a output
6975 function wins). Already formatted output may be embedded into further
6976 text via Output.raw; the result of Pretty.string_of/str_of and derived
6977 functions (string_of_term/cterm/thm etc.) is already marked raw to
6978 accommodate easy composition of diagnostic messages etc. Programmers
6979 rarely need to care about Output.output or Output.raw at all, with
6980 some notable exceptions: Output.output is required when bypassing the
6981 standard channels (writeln etc.), or in token translations to produce
6982 properly formatted results; Output.raw is required when capturing
6983 already output material that will eventually be presented to the user
6984 a second time. For the default print mode, both Output.output and
6985 Output.raw have no effect.
6987 * Pure/General: Output.time_accumulator NAME creates an operator ('a
6988 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
6989 cumulative results are displayed at the end of a batch session.
6991 * Pure/General: File.sysify_path and File.quote_sysify path have been
6992 replaced by File.platform_path and File.shell_path (with appropriate
6993 hooks). This provides a clean interface for unusual systems where the
6994 internal and external process view of file names are different.
6996 * Pure: more efficient orders for basic syntactic entities: added
6997 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
6998 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
6999 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
7000 orders now -- potential INCOMPATIBILITY for code that depends on a
7001 particular order for Symtab.keys, Symtab.dest, etc. (consider using
7002 Library.sort_strings on result).
7004 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
7005 fold_types traverse types/terms from left to right, observing natural
7006 argument order. Supercedes previous foldl_XXX versions, add_frees,
7007 add_vars etc. have been adapted as well: INCOMPATIBILITY.
7009 * Pure: name spaces have been refined, with significant changes of the
7010 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
7011 to extern(_table). The plain name entry path is superceded by a
7012 general 'naming' context, which also includes the 'policy' to produce
7013 a fully qualified name and external accesses of a fully qualified
7014 name; NameSpace.extend is superceded by context dependent
7015 Sign.declare_name. Several theory and proof context operations modify
7016 the naming context. Especially note Theory.restore_naming and
7017 ProofContext.restore_naming to get back to a sane state; note that
7018 Theory.add_path is no longer sufficient to recover from
7019 Theory.absolute_path in particular.
7021 * Pure: new flags short_names (default false) and unique_names
7022 (default true) for controlling output of qualified names. If
7023 short_names is set, names are printed unqualified. If unique_names is
7024 reset, the name prefix is reduced to the minimum required to achieve
7025 the original result when interning again, even if there is an overlap
7026 with earlier declarations.
7028 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
7029 now 'extend', and 'merge' gets an additional Pretty.pp argument
7030 (useful for printing error messages). INCOMPATIBILITY.
7032 * Pure: major reorganization of the theory context. Type Sign.sg and
7033 Theory.theory are now identified, referring to the universal
7034 Context.theory (see Pure/context.ML). Actual signature and theory
7035 content is managed as theory data. The old code and interfaces were
7036 spread over many files and structures; the new arrangement introduces
7037 considerable INCOMPATIBILITY to gain more clarity:
7039 Context -- theory management operations (name, identity, inclusion,
7040 parents, ancestors, merge, etc.), plus generic theory data;
7042 Sign -- logical signature and syntax operations (declaring consts,
7043 types, etc.), plus certify/read for common entities;
7045 Theory -- logical theory operations (stating axioms, definitions,
7046 oracles), plus a copy of logical signature operations (consts,
7047 types, etc.); also a few basic management operations (Theory.copy,
7050 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
7051 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
7052 for convenience -- they merely return the theory.
7054 * Pure: type Type.tsig is superceded by theory in most interfaces.
7056 * Pure: the Isar proof context type is already defined early in Pure
7057 as Context.proof (note that ProofContext.context and Proof.context are
7058 aliases, where the latter is the preferred name). This enables other
7059 Isabelle components to refer to that type even before Isar is present.
7061 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
7062 typeK, constK, axiomK, oracleK), but provide explicit operations for
7063 any of these kinds. For example, Sign.intern typeK is now
7064 Sign.intern_type, Theory.hide_space Sign.typeK is now
7065 Theory.hide_types. Also note that former
7066 Theory.hide_classes/types/consts are now
7067 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
7068 internalize their arguments! INCOMPATIBILITY.
7070 * Pure: get_thm interface (of PureThy and ProofContext) expects
7071 datatype thmref (with constructors Name and NameSelection) instead of
7072 plain string -- INCOMPATIBILITY;
7074 * Pure: cases produced by proof methods specify options, where NONE
7075 means to remove case bindings -- INCOMPATIBILITY in
7078 * Pure: the following operations retrieve axioms or theorems from a
7079 theory node or theory hierarchy, respectively:
7081 Theory.axioms_of: theory -> (string * term) list
7082 Theory.all_axioms_of: theory -> (string * term) list
7083 PureThy.thms_of: theory -> (string * thm) list
7084 PureThy.all_thms_of: theory -> (string * thm) list
7086 * Pure: print_tac now outputs the goal through the trace channel.
7088 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
7089 Reference Toplevel.debug (default false) controls detailed printing
7090 and tracing of low-level exceptions; Toplevel.profiling (default 0)
7091 controls execution profiling -- set to 1 for time and 2 for space
7092 (both increase the runtime).
7094 * Isar session: The initial use of ROOT.ML is now always timed,
7095 i.e. the log will show the actual process times, in contrast to the
7096 elapsed wall-clock time that the outer shell wrapper produces.
7098 * Simplifier: improved handling of bound variables (nameless
7099 representation, avoid allocating new strings). Simprocs that invoke
7100 the Simplifier recursively should use Simplifier.inherit_bounds to
7101 avoid local name clashes. Failure to do so produces warnings
7102 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
7103 for further details.
7105 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
7106 bindings for all theorems stored within a given theory; this may help
7107 in porting non-Isar theories to Isar ones, while keeping ML proof
7108 scripts for the time being.
7110 * ML operator HTML.with_charset specifies the charset begin used for
7111 generated HTML files. For example:
7113 HTML.with_charset "utf-8" use_thy "Hebrew";
7114 HTML.with_charset "utf-8" use_thy "Chinese";
7119 * Allow symlinks to all proper Isabelle executables (Isabelle,
7120 isabelle, isatool etc.).
7122 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
7123 isatool doc, isatool mkdir, display_drafts etc.).
7125 * isatool usedir: option -f allows specification of the ML file to be
7126 used by Isabelle; default is ROOT.ML.
7128 * New isatool version outputs the version identifier of the Isabelle
7129 distribution being used.
7131 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
7132 (containing Boolean satisfiability problems) into Isabelle/HOL
7137 New in Isabelle2004 (April 2004)
7138 --------------------------------
7142 * Provers/order.ML: new efficient reasoner for partial and linear orders.
7143 Replaces linorder.ML.
7145 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
7146 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
7147 (\<a>...\<z>), are now considered normal letters, and can therefore
7148 be used anywhere where an ASCII letter (a...zA...Z) has until
7149 now. COMPATIBILITY: This obviously changes the parsing of some
7150 terms, especially where a symbol has been used as a binder, say
7151 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
7152 as an identifier. Fix it by inserting a space around former
7153 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
7154 existing theory and ML files.
7156 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
7158 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
7159 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
7160 a normal (but invisible) letter. For multiple letter subscripts repeat
7161 \<^isub> like this: x\<^isub>1\<^isub>2.
7163 * Pure: There are now sub-/superscripts that can span more than one
7164 character. Text between \<^bsub> and \<^esub> is set in subscript in
7165 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
7166 superscript. The new control characters are not identifier parts.
7168 * Pure: Control-symbols of the form \<^raw:...> will literally print the
7169 content of "..." to the latex file instead of \isacntrl... . The "..."
7170 may consist of any printable characters excluding the end bracket >.
7172 * Pure: Using new Isar command "finalconsts" (or the ML functions
7173 Theory.add_finals or Theory.add_finals_i) it is now possible to
7174 declare constants "final", which prevents their being given a definition
7175 later. It is useful for constants whose behaviour is fixed axiomatically
7176 rather than definitionally, such as the meta-logic connectives.
7178 * Pure: 'instance' now handles general arities with general sorts
7179 (i.e. intersections of classes),
7181 * Presentation: generated HTML now uses a CSS style sheet to make layout
7182 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
7183 It can be changed to alter the colors/layout of generated pages.
7188 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
7189 cut_tac, subgoal_tac and thin_tac:
7190 - Now understand static (Isar) contexts. As a consequence, users of Isar
7191 locales are no longer forced to write Isar proof scripts.
7192 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
7194 - INCOMPATIBILITY: names of variables to be instantiated may no
7195 longer be enclosed in quotes. Instead, precede variable name with `?'.
7196 This is consistent with the instantiation attribute "where".
7198 * Attributes "where" and "of":
7199 - Now take type variables of instantiated theorem into account when reading
7200 the instantiation string. This fixes a bug that caused instantiated
7201 theorems to have too special types in some circumstances.
7202 - "where" permits explicit instantiations of type variables.
7204 * Calculation commands "moreover" and "also" no longer interfere with
7205 current facts ("this"), admitting arbitrary combinations with "then"
7209 - Goal statements involving the context element "includes" no longer
7210 generate theorems with internal delta predicates (those ending on
7211 "_axioms") in the premise.
7212 Resolve particular premise with <locale>.intro to obtain old form.
7213 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
7214 specification and "includes" elements in goal statement.
7215 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
7216 [intro?] and [elim?] (respectively) by default.
7217 - Experimental command for instantiation of locales in proof contexts:
7218 instantiate <label>[<attrs>]: <loc>
7219 Instantiates locale <loc> and adds all its theorems to the current context
7220 taking into account their attributes. Label and attrs are optional
7221 modifiers, like in theorem declarations. If present, names of
7222 instantiated theorems are qualified with <label>, and the attributes
7223 <attrs> are applied after any attributes these theorems might have already.
7224 If the locale has assumptions, a chained fact of the form
7225 "<loc> t1 ... tn" is expected from which instantiations of the parameters
7226 are derived. The command does not support old-style locales declared
7227 with "locale (open)".
7228 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
7230 * HOL: Tactic emulation methods induct_tac and case_tac understand static
7236 * Proof import: new image HOL4 contains the imported library from
7237 the HOL4 system with about 2500 theorems. It is imported by
7238 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
7239 can be used like any other Isabelle image. See
7240 HOL/Import/HOL/README for more information.
7243 - Much improved handling of linear and partial orders.
7244 Reasoners for linear and partial orders are set up for type classes
7245 "linorder" and "order" respectively, and are added to the default simpset
7246 as solvers. This means that the simplifier can build transitivity chains
7247 to solve goals from the assumptions.
7248 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
7249 of blast or auto after simplification become unnecessary because the goal
7250 is solved by simplification already.
7252 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
7253 all proved in axiomatic type classes for semirings, rings and fields.
7256 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
7257 now formalized using the Ring_and_Field theory mentioned above.
7258 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
7259 than before, because now they are set up once in a generic manner.
7260 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
7261 Look for the general versions in Ring_and_Field (and Power if they concern
7264 * Type "rat" of the rational numbers is now available in HOL-Complex.
7267 - Record types are now by default printed with their type abbreviation
7268 instead of the list of all field types. This can be configured via
7269 the reference "print_record_type_abbr".
7270 - Simproc "record_upd_simproc" for simplification of multiple updates added
7271 (not enabled by default).
7272 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
7273 EX x. x = sel r to True (not enabled by default).
7274 - Tactic "record_split_simp_tac" to split and simplify records added.
7276 * 'specification' command added, allowing for definition by
7277 specification. There is also an 'ax_specification' command that
7278 introduces the new constants axiomatically.
7280 * arith(_tac) is now able to generate counterexamples for reals as well.
7282 * HOL-Algebra: new locale "ring" for non-commutative rings.
7284 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
7285 definitions, thanks to Sava Krsti\'{c} and John Matthews.
7287 * HOL-Matrix: a first theory for matrices in HOL with an application of
7288 matrix theory to linear programming.
7290 * Unions and Intersections:
7291 The latex output syntax of UN and INT has been changed
7292 from "\Union x \in A. B" to "\Union_{x \in A} B"
7293 i.e. the index formulae has become a subscript.
7294 Similarly for "\Union x. B", and for \Inter instead of \Union.
7296 * Unions and Intersections over Intervals:
7297 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
7298 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
7299 like in normal math, and corresponding versions for < and for intersection.
7301 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
7302 lexicographic dictonary ordering has been added as "lexord".
7304 * ML: the legacy theory structures Int and List have been removed. They had
7305 conflicted with ML Basis Library structures having the same names.
7307 * 'refute' command added to search for (finite) countermodels. Only works
7308 for a fragment of HOL. The installation of an external SAT solver is
7309 highly recommended. See "HOL/Refute.thy" for details.
7311 * 'quickcheck' command: Allows to find counterexamples by evaluating
7312 formulae under an assignment of free variables to random values.
7313 In contrast to 'refute', it can deal with inductive datatypes,
7314 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
7320 * Streams now come with concatenation and are part of the HOLCF image
7324 New in Isabelle2003 (May 2003)
7325 ------------------------------
7329 * Provers/simplifier:
7331 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
7332 Assumptions are now subject to complete mutual simplification,
7333 not just from left to right. The simplifier now preserves
7334 the order of assumptions.
7336 Potential INCOMPATIBILITY:
7338 -- simp sometimes diverges where the old version did
7339 not, e.g. invoking simp on the goal
7341 [| P (f x); y = x; f x = f y |] ==> Q
7343 now gives rise to the infinite reduction sequence
7345 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
7347 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
7350 -- Tactics combining classical reasoner and simplification (such as auto)
7351 are also affected by this change, because many of them rely on
7352 simp. They may sometimes diverge as well or yield a different numbers
7353 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
7354 in case of problems. Sometimes subsequent calls to the classical
7355 reasoner will fail because a preceeding call to the simplifier too
7356 eagerly simplified the goal, e.g. deleted redundant premises.
7358 - The simplifier trace now shows the names of the applied rewrite rules
7360 - You can limit the number of recursive invocations of the simplifier
7361 during conditional rewriting (where the simplifie tries to solve the
7362 conditions before applying the rewrite rule):
7363 ML "simp_depth_limit := n"
7364 where n is an integer. Thus you can force termination where previously
7365 the simplifier would diverge.
7367 - Accepts free variables as head terms in congruence rules. Useful in Isar.
7369 - No longer aborts on failed congruence proof. Instead, the
7370 congruence is ignored.
7372 * Pure: New generic framework for extracting programs from constructive
7373 proofs. See HOL/Extraction.thy for an example instantiation, as well
7374 as HOL/Extraction for some case studies.
7376 * Pure: The main goal of the proof state is no longer shown by default, only
7377 the subgoals. This behaviour is controlled by a new flag.
7378 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
7379 (ML: Proof.show_main_goal).
7381 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
7382 rules whose conclusion matches subgoal 1:
7383 PG menu: Isabelle/Isar -> Show me -> matching rules
7384 The rules are ordered by how closely they match the subgoal.
7385 In particular, rules that solve a subgoal outright are displayed first
7386 (or rather last, the way they are printed).
7387 (ML: ProofGeneral.print_intros())
7389 * Pure: New flag trace_unify_fail causes unification to print
7390 diagnostic information (PG: in trace buffer) when it fails. This is
7391 useful for figuring out why single step proofs like rule, erule or
7394 * Pure: Locale specifications now produce predicate definitions
7395 according to the body of text (covering assumptions modulo local
7396 definitions); predicate "loc_axioms" covers newly introduced text,
7397 while "loc" is cumulative wrt. all included locale expressions; the
7398 latter view is presented only on export into the global theory
7399 context; potential INCOMPATIBILITY, use "(open)" option to fall back
7400 on the old view without predicates;
7402 * Pure: predefined locales "var" and "struct" are useful for sharing
7403 parameters (as in CASL, for example); just specify something like
7404 ``var x + var y + struct M'' as import;
7406 * Pure: improved thms_containing: proper indexing of facts instead of
7407 raw theorems; check validity of results wrt. current name space;
7408 include local facts of proof configuration (also covers active
7409 locales), cover fixed variables in index; may use "_" in term
7410 specification; an optional limit for the number of printed facts may
7411 be given (the default is 40);
7413 * Pure: disallow duplicate fact bindings within new-style theory files
7416 * Provers: improved induct method: assumptions introduced by case
7417 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
7418 the goal statement); "foo" still refers to all facts collectively;
7420 * Provers: the function blast.overloaded has been removed: all constants
7421 are regarded as potentially overloaded, which improves robustness in exchange
7422 for slight decrease in efficiency;
7424 * Provers/linorder: New generic prover for transitivity reasoning over
7425 linear orders. Note: this prover is not efficient!
7427 * Isar: preview of problems to finish 'show' now produce an error
7428 rather than just a warning (in interactive mode);
7435 - Produces a counter example if it cannot prove a goal.
7436 Note that the counter example may be spurious if the goal is not a formula
7437 of quantifier-free linear arithmetic.
7438 In ProofGeneral the counter example appears in the trace buffer.
7440 - Knows about div k and mod k where k is a numeral of type nat or int.
7442 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
7443 linear arithmetic fails. This takes account of quantifiers and divisibility.
7444 Presburger arithmetic can also be called explicitly via presburger(_tac).
7446 * simp's arithmetic capabilities have been enhanced a bit: it now
7447 takes ~= in premises into account (by performing a case split);
7449 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
7450 are distributed over a sum of terms;
7452 * New tactic "trans_tac" and method "trans" instantiate
7453 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
7456 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
7457 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
7459 * 'typedef' command has new option "open" to suppress the set
7462 * functions Min and Max on finite sets have been introduced (theory
7465 * attribute [symmetric] now works for relations as well; it turns
7466 (x,y) : R^-1 into (y,x) : R, and vice versa;
7468 * induct over a !!-quantified statement (say !!x1..xn):
7469 each "case" automatically performs "fix x1 .. xn" with exactly those names.
7471 * Map: `empty' is no longer a constant but a syntactic abbreviation for
7472 %x. None. Warning: empty_def now refers to the previously hidden definition
7475 * Algebra: formalization of classical algebra. Intended as base for
7476 any algebraic development in Isabelle. Currently covers group theory
7477 (up to Sylow's theorem) and ring theory (Universal Property of
7478 Univariate Polynomials). Contributions welcome;
7480 * GroupTheory: deleted, since its material has been moved to Algebra;
7482 * Complex: new directory of the complex numbers with numeric constants,
7483 nonstandard complex numbers, and some complex analysis, standard and
7484 nonstandard (Jacques Fleuriot);
7486 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
7488 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
7491 * Real/HahnBanach: updated and adapted to locales;
7493 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
7496 * UNITY: added the Meier-Sanders theory of progress sets;
7498 * MicroJava: bytecode verifier and lightweight bytecode verifier
7499 as abstract algorithms, instantiated to the JVM;
7501 * Bali: Java source language formalization. Type system, operational
7502 semantics, axiomatic semantics. Supported language features:
7503 classes, interfaces, objects,virtual methods, static methods,
7504 static/instance fields, arrays, access modifiers, definite
7505 assignment, exceptions.
7510 * ZF/Constructible: consistency proof for AC (Gdel's constructible
7513 * Main ZF: virtually all theories converted to new-style format;
7518 * Pure: Tactic.prove provides sane interface for internal proofs;
7519 omits the infamous "standard" operation, so this is more appropriate
7520 than prove_goalw_cterm in many situations (e.g. in simprocs);
7522 * Pure: improved error reporting of simprocs;
7524 * Provers: Simplifier.simproc(_i) provides sane interface for setting
7528 *** Document preparation ***
7530 * uses \par instead of \\ for line breaks in theory text. This may
7531 shift some page breaks in large documents. To get the old behaviour
7532 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
7534 * minimized dependencies of isabelle.sty and isabellesym.sty on
7537 * \<euro> now needs package babel/greek instead of marvosym (which
7540 * normal size for \<zero>...\<nine> (uses \mathbf instead of
7545 New in Isabelle2002 (March 2002)
7546 --------------------------------
7548 *** Document preparation ***
7550 * greatly simplified document preparation setup, including more
7551 graceful interpretation of isatool usedir -i/-d/-D options, and more
7552 instructive isatool mkdir; users should basically be able to get
7553 started with "isatool mkdir HOL Test && isatool make"; alternatively,
7554 users may run a separate document processing stage manually like this:
7555 "isatool usedir -D output HOL Test && isatool document Test/output";
7557 * theory dependency graph may now be incorporated into documents;
7558 isatool usedir -g true will produce session_graph.eps/.pdf for use
7559 with \includegraphics of LaTeX;
7561 * proper spacing of consecutive markup elements, especially text
7562 blocks after section headings;
7564 * support bold style (for single symbols only), input syntax is like
7565 this: "\<^bold>\<alpha>" or "\<^bold>A";
7567 * \<bullet> is now output as bold \cdot by default, which looks much
7568 better in printed text;
7570 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
7571 note that these symbols are currently unavailable in Proof General /
7572 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
7574 * isatool latex no longer depends on changed TEXINPUTS, instead
7575 isatool document copies the Isabelle style files to the target
7581 * Pure/Provers: improved proof by cases and induction;
7582 - 'case' command admits impromptu naming of parameters (such as
7584 - 'induct' method divinates rule instantiation from the inductive
7585 claim; no longer requires excessive ?P bindings for proper
7586 instantiation of cases;
7587 - 'induct' method properly enumerates all possibilities of set/type
7588 rules; as a consequence facts may be also passed through *type*
7589 rules without further ado;
7590 - 'induct' method now derives symbolic cases from the *rulified*
7591 rule (before it used to rulify cases stemming from the internal
7592 atomized version); this means that the context of a non-atomic
7593 statement becomes is included in the hypothesis, avoiding the
7594 slightly cumbersome show "PROP ?case" form;
7595 - 'induct' may now use elim-style induction rules without chaining
7596 facts, using ``missing'' premises from the goal state; this allows
7597 rules stemming from inductive sets to be applied in unstructured
7598 scripts, while still benefitting from proper handling of non-atomic
7599 statements; NB: major inductive premises need to be put first, all
7600 the rest of the goal is passed through the induction;
7601 - 'induct' proper support for mutual induction involving non-atomic
7602 rule statements (uses the new concept of simultaneous goals, see
7604 - append all possible rule selections, but only use the first
7605 success (no backtracking);
7606 - removed obsolete "(simplified)" and "(stripped)" options of methods;
7607 - undeclared rule case names default to numbers 1, 2, 3, ...;
7608 - added 'print_induct_rules' (covered by help item in recent Proof
7610 - moved induct/cases attributes to Pure, methods to Provers;
7611 - generic method setup instantiated for FOL and HOL;
7613 * Pure: support multiple simultaneous goal statements, for example
7614 "have a: A and b: B" (same for 'theorem' etc.); being a pure
7615 meta-level mechanism, this acts as if several individual goals had
7616 been stated separately; in particular common proof methods need to be
7617 repeated in order to cover all claims; note that a single elimination
7618 step is *not* sufficient to establish the two conjunctions, so this
7621 assume "A & B" then have A and B .. (*".." fails*)
7623 better use "obtain" in situations as above; alternative refer to
7624 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
7626 * Pure: proper integration with ``locales''; unlike the original
7627 version by Florian Kammller, Isar locales package high-level proof
7628 contexts rather than raw logical ones (e.g. we admit to include
7629 attributes everywhere); operations on locales include merge and
7630 rename; support for implicit arguments (``structures''); simultaneous
7631 type-inference over imports and text; see also HOL/ex/Locales.thy for
7634 * Pure: the following commands have been ``localized'', supporting a
7635 target locale specification "(in name)": 'lemma', 'theorem',
7636 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
7637 stored both within the locale and at the theory level (exported and
7638 qualified by the locale name);
7640 * Pure: theory goals may now be specified in ``long'' form, with
7641 ad-hoc contexts consisting of arbitrary locale elements. for example
7642 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
7643 definitions may be given, too); the result is a meta-level rule with
7644 the context elements being discharged in the obvious way;
7646 * Pure: new proof command 'using' allows to augment currently used
7647 facts after a goal statement ('using' is syntactically analogous to
7648 'apply', but acts on the goal's facts only); this allows chained facts
7649 to be separated into parts given before and after a claim, as in
7650 ``from a and b have C using d and e <proof>'';
7652 * Pure: renamed "antecedent" case to "rule_context";
7654 * Pure: new 'judgment' command records explicit information about the
7655 object-logic embedding (used by several tools internally); no longer
7656 use hard-wired "Trueprop";
7658 * Pure: added 'corollary' command;
7660 * Pure: fixed 'token_translation' command;
7662 * Pure: removed obsolete 'exported' attribute;
7664 * Pure: dummy pattern "_" in is/let is now automatically lifted over
7665 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
7666 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
7668 * Pure: method 'atomize' presents local goal premises as object-level
7669 statements (atomic meta-level propositions); setup controlled via
7670 rewrite rules declarations of 'atomize' attribute; example
7671 application: 'induct' method with proper rule statements in improper
7674 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
7675 now consider the syntactic context of assumptions, giving a better
7676 chance to get type-inference of the arguments right (this is
7677 especially important for locales);
7679 * Pure: "sorry" no longer requires quick_and_dirty in interactive
7682 * Pure/obtain: the formal conclusion "thesis", being marked as
7683 ``internal'', may no longer be reference directly in the text;
7684 potential INCOMPATIBILITY, may need to use "?thesis" in rare
7687 * Pure: generic 'sym' attribute which declares a rule both as pure
7688 'elim?' and for the 'symmetric' operation;
7690 * Pure: marginal comments ``--'' may now occur just anywhere in the
7691 text; the fixed correlation with particular command syntax has been
7694 * Pure: new method 'rules' is particularly well-suited for proof
7695 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
7696 but often produces more compact proof terms with less detours;
7698 * Pure/Provers/classical: simplified integration with pure rule
7699 attributes and methods; the classical "intro?/elim?/dest?"
7700 declarations coincide with the pure ones; the "rule" method no longer
7701 includes classically swapped intros; "intro" and "elim" methods no
7702 longer pick rules from the context; also got rid of ML declarations
7703 AddXIs/AddXEs/AddXDs; all of this has some potential for
7706 * Provers/classical: attribute 'swapped' produces classical inversions
7707 of introduction rules;
7709 * Provers/simplifier: 'simplified' attribute may refer to explicit
7710 rules instead of full simplifier context; 'iff' attribute handles
7713 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
7715 * HOL: 'recdef' now fails on unfinished automated proofs, use
7716 "(permissive)" option to recover old behavior;
7718 * HOL: 'inductive' no longer features separate (collective) attributes
7719 for 'intros' (was found too confusing);
7721 * HOL: properly declared induction rules less_induct and
7727 * HOL: moved over to sane numeral syntax; the new policy is as
7730 - 0 and 1 are polymorphic constants, which are defined on any
7731 numeric type (nat, int, real etc.);
7733 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
7734 binary representation internally;
7736 - type nat has special constructor Suc, and generally prefers Suc 0
7737 over 1::nat and Suc (Suc 0) over 2::nat;
7739 This change may cause significant problems of INCOMPATIBILITY; here
7740 are some hints on converting existing sources:
7742 - due to the new "num" token, "-0" and "-1" etc. are now atomic
7743 entities, so expressions involving "-" (unary or binary minus) need
7744 to be spaced properly;
7746 - existing occurrences of "1" may need to be constraint "1::nat" or
7747 even replaced by Suc 0; similar for old "2";
7749 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
7751 - remove all special provisions on numerals in proofs;
7753 * HOL: simp rules nat_number expand numerals on nat to Suc/0
7754 representation (depends on bin_arith_simps in the default context);
7756 * HOL: symbolic syntax for x^2 (numeral 2);
7758 * HOL: the class of all HOL types is now called "type" rather than
7759 "term"; INCOMPATIBILITY, need to adapt references to this type class
7760 in axclass/classes, instance/arities, and (usually rare) occurrences
7761 in typings (of consts etc.); internally the class is called
7762 "HOL.type", ML programs should refer to HOLogic.typeS;
7764 * HOL/record package improvements:
7765 - new derived operations "fields" to build a partial record section,
7766 "extend" to promote a fixed record to a record scheme, and
7767 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
7768 declared as simp by default;
7769 - shared operations ("more", "fields", etc.) now need to be always
7770 qualified) --- potential INCOMPATIBILITY;
7771 - removed "make_scheme" operations (use "make" with "extend") --
7773 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
7774 - provides cases/induct rules for use with corresponding Isar
7775 methods (for concrete records, record schemes, concrete more
7776 parts, and schematic more parts -- in that order);
7777 - internal definitions directly based on a light-weight abstract
7778 theory of product types over typedef rather than datatype;
7780 * HOL: generic code generator for generating executable ML code from
7781 specifications; specific support for HOL constructs such as inductive
7782 datatypes and sets, as well as recursive functions; can be invoked
7783 via 'generate_code' theory section;
7785 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
7787 * HOL: consolidated and renamed several theories. In particular:
7788 Ord.thy has been absorbed into HOL.thy
7789 String.thy has been absorbed into List.thy
7791 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
7792 (beware of argument permutation!);
7794 * HOL: linorder_less_split superseded by linorder_cases;
7796 * HOL/List: "nodups" renamed to "distinct";
7798 * HOL: added "The" definite description operator; move Hilbert's "Eps"
7799 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
7800 - Ex_def has changed, now need to use some_eq_ex
7802 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
7803 in this (rare) case use:
7805 delSWrapper "split_all_tac"
7806 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
7808 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
7811 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
7812 Isabelle's type classes, ^ on functions and relations has too general
7813 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
7814 necessary to attach explicit type constraints;
7816 * HOL/Relation: the prefix name of the infix "O" has been changed from
7817 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
7818 renamed accordingly (eg "compI" -> "rel_compI").
7820 * HOL: syntax translations now work properly with numerals and records
7823 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
7824 of "lam" -- INCOMPATIBILITY;
7826 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
7827 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
7828 renamed "Product_Type.unit";
7830 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
7832 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
7833 the "cases" method);
7835 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
7838 * HOL/IMP: updated and converted to new-style theory format; several
7839 parts turned into readable document, with proper Isar proof texts and
7840 some explanations (by Gerwin Klein);
7842 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
7844 * HOL-Hyperreal is now a logic image;
7849 * Isar: consts/constdefs supports mixfix syntax for continuous
7852 * Isar: domain package adapted to new-style theory format, e.g. see
7855 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
7856 potential INCOMPATIBILITY; now use plain induct_tac instead of former
7857 lift.induct_tac, always use UU instead of Undef;
7859 * HOLCF/IMP: updated and converted to new-style theory;
7864 * Isar: proper integration of logic-specific tools and packages,
7865 including theory commands '(co)inductive', '(co)datatype',
7866 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
7867 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
7869 * theory Main no longer includes AC; for the Axiom of Choice, base
7870 your theory on Main_ZFC;
7872 * the integer library now covers quotients and remainders, with many
7873 laws relating division to addition, multiplication, etc.;
7875 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
7876 typeless version of the formalism;
7878 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
7881 * ZF/Induct: new directory for examples of inductive definitions,
7882 including theory Multiset for multiset orderings; converted to
7883 new-style theory format;
7885 * ZF: many new theorems about lists, ordinals, etc.;
7890 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
7891 variable proof controls level of detail: 0 = no proofs (only oracle
7892 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
7893 also ref manual for further ML interfaces;
7895 * Pure/axclass: removed obsolete ML interface
7896 goal_subclass/goal_arity;
7898 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
7899 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
7900 separate tokens, so expressions involving minus need to be spaced
7903 * Pure/syntax: support non-oriented infixes, using keyword "infix"
7904 rather than "infixl" or "infixr";
7906 * Pure/syntax: concrete syntax for dummy type variables admits genuine
7907 sort constraint specifications in type inference; e.g. "x::_::foo"
7908 ensures that the type of "x" is of sort "foo" (but not necessarily a
7911 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
7912 control output of nested => (types); the default behavior is
7915 * Pure/syntax: builtin parse translation for "_constify" turns valued
7916 tokens into AST constants;
7918 * Pure/syntax: prefer later declarations of translations and print
7919 translation functions; potential INCOMPATIBILITY: need to reverse
7920 multiple declarations for same syntax element constant;
7922 * Pure/show_hyps reset by default (in accordance to existing Isar
7925 * Provers/classical: renamed addaltern to addafter, addSaltern to
7928 * Provers/clasimp: ``iff'' declarations now handle conditional rules
7931 * system: tested support for MacOS X; should be able to get Isabelle +
7932 Proof General to work in a plain Terminal after installing Poly/ML
7933 (e.g. from the Isabelle distribution area) and GNU bash alone
7934 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
7935 support requires further installations, e.g. from
7936 http://fink.sourceforge.net/);
7938 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
7940 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
7941 of 40 MB), cf. ML_OPTIONS;
7943 * system: Proof General keywords specification is now part of the
7944 Isabelle distribution (see etc/isar-keywords.el);
7946 * system: support for persistent Proof General sessions (refrain from
7947 outdating all loaded theories on startup); user may create writable
7948 logic images like this: ``isabelle -q HOL Test'';
7950 * system: smart selection of Isabelle process versus Isabelle
7951 interface, accommodates case-insensitive file systems (e.g. HFS+); may
7952 run both "isabelle" and "Isabelle" even if file names are badly
7953 damaged (executable inspects the case of the first letter of its own
7954 name); added separate "isabelle-process" and "isabelle-interface";
7956 * system: refrain from any attempt at filtering input streams; no
7957 longer support ``8bit'' encoding of old isabelle font, instead proper
7958 iso-latin characters may now be used; the related isatools
7959 "symbolinput" and "nonascii" have disappeared as well;
7961 * system: removed old "xterm" interface (the print modes "xterm" and
7962 "xterm_color" are still available for direct use in a suitable
7967 New in Isabelle99-2 (February 2001)
7968 -----------------------------------
7970 *** Overview of INCOMPATIBILITIES ***
7972 * HOL: please note that theories in the Library and elsewhere often use the
7973 new-style (Isar) format; to refer to their theorems in an ML script you must
7974 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
7976 * HOL: inductive package no longer splits induction rule aggressively,
7977 but only as far as specified by the introductions given; the old
7978 format may be recovered via ML function complete_split_rule or attribute
7979 'split_rule (complete)';
7981 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
7982 gfp_Tarski to gfp_unfold;
7984 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
7986 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
7987 relation); infix "^^" has been renamed "``"; infix "``" has been
7988 renamed "`"; "univalent" has been renamed "single_valued";
7990 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
7993 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
7995 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
7997 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
7998 consequence, it is no longer monotonic wrt. the local goal context
7999 (which is now passed through the inductive cases);
8001 * Document preparation: renamed standard symbols \<ll> to \<lless> and
8002 \<gg> to \<ggreater>;
8005 *** Document preparation ***
8007 * \isabellestyle{NAME} selects version of Isabelle output (currently
8008 available: are "it" for near math-mode best-style output, "sl" for
8009 slanted text style, and "tt" for plain type-writer; if no
8010 \isabellestyle command is given, output is according to slanted
8013 * support sub/super scripts (for single symbols only), input syntax is
8014 like this: "A\<^sup>*" or "A\<^sup>\<star>";
8016 * some more standard symbols; see Appendix A of the system manual for
8017 the complete list of symbols defined in isabellesym.sty;
8019 * improved isabelle style files; more abstract symbol implementation
8020 (should now use \isamath{...} and \isatext{...} in custom symbol
8023 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
8024 state; Note that presentation of goal states does not conform to
8025 actual human-readable proof documents. Please do not include goal
8026 states into document output unless you really know what you are doing!
8028 * proper indentation of antiquoted output with proportional LaTeX
8031 * no_document ML operator temporarily disables LaTeX document
8034 * isatool unsymbolize tunes sources for plain ASCII communication;
8039 * Pure: Isar now suffers initial goal statements to contain unbound
8040 schematic variables (this does not conform to actual readable proof
8041 documents, due to unpredictable outcome and non-compositional proof
8042 checking); users who know what they are doing may use schematic goals
8043 for Prolog-style synthesis of proven results;
8045 * Pure: assumption method (an implicit finishing) now handles actual
8048 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
8049 initial goal, declare "that" only as Pure intro (only for single
8050 steps); the "that" rule assumption may now be involved in implicit
8051 finishing, thus ".." becomes a feasible for trivial obtains;
8053 * Pure: default proof step now includes 'intro_classes'; thus trivial
8054 instance proofs may be performed by "..";
8056 * Pure: ?thesis / ?this / "..." now work for pure meta-level
8059 * Pure: more robust selection of calculational rules;
8061 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
8062 rule (as well as the assumption rule);
8064 * Pure: 'thm_deps' command visualizes dependencies of theorems and
8065 lemmas, using the graph browser tool;
8067 * Pure: predict failure of "show" in interactive mode;
8069 * Pure: 'thms_containing' now takes actual terms as arguments;
8071 * HOL: improved method 'induct' --- now handles non-atomic goals
8072 (potential INCOMPATIBILITY); tuned error handling;
8074 * HOL: cases and induct rules now provide explicit hints about the
8075 number of facts to be consumed (0 for "type" and 1 for "set" rules);
8076 any remaining facts are inserted into the goal verbatim;
8078 * HOL: local contexts (aka cases) may now contain term bindings as
8079 well; the 'cases' and 'induct' methods new provide a ?case binding for
8080 the result to be shown in each case;
8082 * HOL: added 'recdef_tc' command;
8084 * isatool convert assists in eliminating legacy ML scripts;
8089 * HOL/Library: a collection of generic theories to be used together
8090 with main HOL; the theory loader path already includes this directory
8091 by default; the following existing theories have been moved here:
8092 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
8093 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
8095 * HOL/Unix: "Some aspects of Unix file-system security", a typical
8096 modelling and verification task performed in Isabelle/HOL +
8097 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
8099 * HOL/Algebra: special summation operator SUM no longer exists, it has
8100 been replaced by setsum; infix 'assoc' now has priority 50 (like
8101 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
8102 'domain', this makes the theory consistent with mathematical
8105 * HOL basics: added overloaded operations "inverse" and "divide"
8106 (infix "/"), syntax for generic "abs" operation, generic summation
8109 * HOL/typedef: simplified package, provide more useful rules (see also
8112 * HOL/datatype: induction rule for arbitrarily branching datatypes is
8113 now expressed as a proper nested rule (old-style tactic scripts may
8114 require atomize_strip_tac to cope with non-atomic premises);
8116 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
8117 to "split_conv" (old name still available for compatibility);
8119 * HOL: improved concrete syntax for strings (e.g. allows translation
8120 rules with string literals);
8122 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
8123 and Fleuriot's mechanization of analysis, including the transcendental
8124 functions for the reals;
8126 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
8131 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
8132 "lam" is displayed as TWO lambda-symbols
8134 * CTT: theory Main now available, containing everything (that is, Bool
8140 * Pure: the Simplifier has been implemented properly as a derived rule
8141 outside of the actual kernel (at last!); the overall performance
8142 penalty in practical applications is about 50%, while reliability of
8143 the Isabelle inference kernel has been greatly improved;
8145 * print modes "brackets" and "no_brackets" control output of nested =>
8146 (types) and ==> (props); the default behaviour is "brackets";
8148 * Provers: fast_tac (and friends) now handle actual object-logic rules
8149 as assumptions as well;
8151 * system: support Poly/ML 4.0;
8153 * system: isatool install handles KDE version 1 or 2;
8157 New in Isabelle99-1 (October 2000)
8158 ----------------------------------
8160 *** Overview of INCOMPATIBILITIES ***
8162 * HOL: simplification of natural numbers is much changed; to partly
8163 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
8164 issue the following ML commands:
8166 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
8167 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
8169 * HOL: simplification no longer dives into case-expressions; this is
8170 controlled by "t.weak_case_cong" for each datatype t;
8172 * HOL: nat_less_induct renamed to less_induct;
8174 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
8175 fixsome to patch .thy and .ML sources automatically;
8177 select_equality -> some_equality
8178 select_eq_Ex -> some_eq_ex
8179 selectI2EX -> someI2_ex
8182 select1_equality -> some1_equality
8183 Eps_sym_eq -> some_sym_eq_trivial
8184 Eps_eq -> some_eq_trivial
8186 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
8188 * HOL: removed obsolete theorem binding expand_if (refer to split_if
8191 * HOL: the recursion equations generated by 'recdef' are now called
8192 f.simps instead of f.rules;
8194 * HOL: qed_spec_mp now also handles bounded ALL as well;
8196 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
8197 sometimes be needed;
8199 * HOL: the constant for "f``x" is now "image" rather than "op ``";
8201 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
8203 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
8204 product is now "<*>" instead of "Times"; the lexicographic product is
8205 now "<*lex*>" instead of "**";
8207 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
8208 of main HOL, but was unused); better use HOL's datatype package;
8210 * HOL: removed "symbols" syntax for constant "override" of theory Map;
8211 the old syntax may be recovered as follows:
8214 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
8215 (infixl "\\<oplus>" 100)
8217 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8219 * HOL/ML: even fewer consts are declared as global (see theories Ord,
8220 Lfp, Gfp, WF); this only affects ML packages that refer to const names
8223 * HOL and ZF: syntax for quotienting wrt an equivalence relation
8224 changed from A/r to A//r;
8226 * ZF: new treatment of arithmetic (nat & int) may break some old
8229 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
8230 rulify -> rule_format, elimify -> elim_format, ...);
8232 * Isar/Provers: intro/elim/dest attributes changed; renamed
8233 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
8234 should have to change intro!! to intro? only); replaced "delrule" by
8237 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
8239 * Provers: strengthened force_tac by using new first_best_tac;
8241 * LaTeX document preparation: several changes of isabelle.sty (see
8245 *** Document preparation ***
8247 * formal comments (text blocks etc.) in new-style theories may now
8248 contain antiquotations of thm/prop/term/typ/text to be presented
8249 according to latex print mode; concrete syntax is like this:
8250 @{term[show_types] "f(x) = a + x"};
8252 * isatool mkdir provides easy setup of Isabelle session directories,
8253 including proper document sources;
8255 * generated LaTeX sources are now deleted after successful run
8256 (isatool document -c); may retain a copy somewhere else via -D option
8259 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
8260 style files, achieving self-contained LaTeX sources and simplifying
8263 * old-style theories now produce (crude) LaTeX output as well;
8265 * browser info session directories are now self-contained (may be put
8266 on WWW server seperately); improved graphs of nested sessions; removed
8267 graph for 'all sessions';
8269 * several improvements in isabelle style files; \isabellestyle{it}
8270 produces fake math mode output; \isamarkupheader is now \section by
8271 default; see lib/texinputs/isabelle.sty etc.;
8276 * Isar/Pure: local results and corresponding term bindings are now
8277 subject to Hindley-Milner polymorphism (similar to ML); this
8278 accommodates incremental type-inference very nicely;
8280 * Isar/Pure: new derived language element 'obtain' supports
8281 generalized existence reasoning;
8283 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
8284 support accumulation of results, without applying any rules yet;
8285 useful to collect intermediate results without explicit name
8286 references, and for use with transitivity rules with more than 2
8289 * Isar/Pure: scalable support for case-analysis type proofs: new
8290 'case' language element refers to local contexts symbolically, as
8291 produced by certain proof methods; internally, case names are attached
8292 to theorems as "tags";
8294 * Isar/Pure: theory command 'hide' removes declarations from
8295 class/type/const name spaces;
8297 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
8298 indicate potential overloading;
8300 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
8302 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
8303 "{a,b,c}" instead of {a,b,c};
8305 * Isar/Pure now provides its own version of intro/elim/dest
8306 attributes; useful for building new logics, but beware of confusion
8307 with the version in Provers/classical;
8309 * Isar/Pure: the local context of (non-atomic) goals is provided via
8310 case name 'antecedent';
8312 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
8313 to the current context is now done automatically);
8315 * Isar/Pure: theory command 'method_setup' provides a simple interface
8316 for definining proof methods in ML;
8318 * Isar/Provers: intro/elim/dest attributes changed; renamed
8319 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
8320 most cases, one should have to change intro!! to intro? only);
8321 replaced "delrule" by "rule del";
8323 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
8324 'symmetric' attribute (the latter supercedes [RS sym]);
8326 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
8327 method modifier); 'simp' method: 'only:' modifier removes loopers as
8328 well (including splits);
8330 * Isar/Provers: Simplifier and Classical methods now support all kind
8331 of modifiers used in the past, including 'cong', 'iff', etc.
8333 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
8334 of Simplifier and Classical reasoner);
8336 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
8337 now support named cases; major packages (inductive, datatype, primrec,
8338 recdef) support case names and properly name parameters;
8340 * Isar/HOL: new transitivity rules for substitution in inequalities --
8341 monotonicity conditions are extracted to be proven at end of
8344 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
8347 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
8348 split_if split_if_asm; datatype package provides theorems foo.splits =
8349 foo.split foo.split_asm for each datatype;
8351 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
8352 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
8353 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
8354 use "(cases (simplified))" method in proper proof texts);
8356 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
8358 * Isar: names of theorems etc. may be natural numbers as well;
8360 * Isar: 'pr' command: optional arguments for goals_limit and
8361 ProofContext.prems_limit; no longer prints theory contexts, but only
8364 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
8365 additional print modes to be specified; e.g. "pr(latex)" will print
8366 proof state according to the Isabelle LaTeX style;
8368 * Isar: improved support for emulating tactic scripts, including proof
8369 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
8370 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
8371 (for HOL datatypes);
8373 * Isar: simplified (more robust) goal selection of proof methods: 1st
8374 goal, all goals, or explicit goal specifier (tactic emulation); thus
8375 'proof method scripts' have to be in depth-first order;
8377 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
8379 * Isar: removed 'help' command, which hasn't been too helpful anyway;
8380 should instead use individual commands for printing items
8381 (print_commands, print_methods etc.);
8383 * Isar: added 'nothing' --- the empty list of theorems;
8388 * HOL/MicroJava: formalization of a fragment of Java, together with a
8389 corresponding virtual machine and a specification of its bytecode
8390 verifier and a lightweight bytecode verifier, including proofs of
8391 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
8392 Cornelia Pusch (see also the homepage of project Bali at
8393 http://isabelle.in.tum.de/Bali/);
8395 * HOL/Algebra: new theory of rings and univariate polynomials, by
8398 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
8399 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
8402 * HOL/Lattice: fundamental concepts of lattice theory and order
8403 structures, including duals, properties of bounds versus algebraic
8404 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
8405 Theorem for complete lattices etc.; may also serve as a demonstration
8406 for abstract algebraic reasoning using axiomatic type classes, and
8407 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
8409 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
8412 * HOL/IMPP: extension of IMP with local variables and mutually
8413 recursive procedures, by David von Oheimb;
8415 * HOL/Lambda: converted into new-style theory and document;
8417 * HOL/ex/Multiquote: example of multiple nested quotations and
8418 anti-quotations -- basically a generalized version of de-Bruijn
8419 representation; very useful in avoiding lifting of operations;
8421 * HOL/record: added general record equality rule to simpset; fixed
8422 select-update simplification procedure to handle extended records as
8423 well; admit "r" as field name;
8425 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
8426 other numeric types and also as the identity of groups, rings, etc.;
8428 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
8429 Types nat and int belong to this axclass;
8431 * HOL: greatly improved simplification involving numerals of type nat, int, real:
8432 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
8433 i*j + k + j*#3*i simplifies to #4*(i*j) + k
8434 two terms #m*u and #n*u are replaced by #(m+n)*u
8435 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
8436 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
8437 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
8439 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
8440 powerful prover for predicate logic but knows nothing of clasets; see
8441 ex/mesontest.ML and ex/mesontest2.ML for example applications;
8443 * HOL: new version of "case_tac" subsumes both boolean case split and
8444 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
8445 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
8447 * HOL: simplification no longer dives into case-expressions: only the
8448 selector expression is simplified, but not the remaining arms; to
8449 enable full simplification of case-expressions for datatype t, you may
8450 remove t.weak_case_cong from the simpset, either globally (Delcongs
8451 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
8453 * HOL/recdef: the recursion equations generated by 'recdef' for
8454 function 'f' are now called f.simps instead of f.rules; if all
8455 termination conditions are proved automatically, these simplification
8456 rules are added to the simpset, as in primrec; rules may be named
8457 individually as well, resulting in a separate list of theorems for
8460 * HOL/While is a new theory that provides a while-combinator. It
8461 permits the definition of tail-recursive functions without the
8462 provision of a termination measure. The latter is necessary once the
8463 invariant proof rule for while is applied.
8465 * HOL: new (overloaded) notation for the set of elements below/above
8466 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
8468 * HOL: theorems impI, allI, ballI bound as "strip";
8470 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
8471 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
8472 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
8474 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8476 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
8477 main HOL, but was unused);
8479 * HOL: fewer consts declared as global (e.g. have to refer to
8480 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
8482 * HOL: tuned AST representation of nested pairs, avoiding bogus output
8483 in case of overlap with user translations (e.g. judgements over
8484 tuples); (note that the underlying logical represenation is still
8490 * ZF: simplification automatically cancels common terms in arithmetic
8491 expressions over nat and int;
8493 * ZF: new treatment of nat to minimize type-checking: all operators
8494 coerce their operands to a natural number using the function natify,
8495 making the algebraic laws unconditional;
8497 * ZF: as above, for int: operators coerce their operands to an integer
8498 using the function intify;
8500 * ZF: the integer library now contains many of the usual laws for the
8501 orderings, including $<=, and monotonicity laws for $+ and $*;
8503 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
8506 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
8507 to the simplifier and classical reasoner simultaneously;
8512 * Provers: blast_tac now handles actual object-logic rules as
8513 assumptions; note that auto_tac uses blast_tac internally as well;
8515 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
8516 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
8518 * Provers: delrules now handles destruct rules as well (no longer need
8519 explicit make_elim);
8521 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
8522 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8523 use instead the strong form,
8524 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8525 in HOL, FOL and ZF the function cla_make_elim will create such rules
8526 from destruct-rules;
8528 * Provers: Simplifier.easy_setup provides a fast path to basic
8529 Simplifier setup for new object-logics;
8531 * Pure: AST translation rules no longer require constant head on LHS;
8533 * Pure: improved name spaces: ambiguous output is qualified; support
8534 for hiding of names;
8536 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
8537 XSYMBOL_HOME; no longer need to do manual configuration in most
8540 * system: compression of ML heaps images may now be controlled via -c
8541 option of isabelle and isatool usedir (currently only observed by
8544 * system: isatool installfonts may handle X-Symbol fonts as well (very
8545 useful for remote X11);
8547 * system: provide TAGS file for Isabelle sources;
8549 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
8552 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
8553 timing flag supersedes proof_timing and Toplevel.trace;
8555 * ML: new combinators |>> and |>>> for incremental transformations
8556 with secondary results (e.g. certain theory extensions):
8558 * ML: PureThy.add_defs gets additional argument to indicate potential
8559 overloading (usually false);
8561 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
8566 New in Isabelle99 (October 1999)
8567 --------------------------------
8569 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8571 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
8572 are no longer simplified. (This allows the simplifier to unfold recursive
8573 functional programs.) To restore the old behaviour, declare
8575 Delcongs [if_weak_cong];
8577 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
8580 * HOL: the predicate "inj" is now defined by translation to "inj_on";
8582 * HOL/datatype: mutual_induct_tac no longer exists --
8583 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
8585 * HOL/typedef: fixed type inference for representing set; type
8586 arguments now have to occur explicitly on the rhs as type constraints;
8588 * ZF: The con_defs part of an inductive definition may no longer refer
8589 to constants declared in the same theory;
8591 * HOL, ZF: the function mk_cases, generated by the inductive
8592 definition package, has lost an argument. To simplify its result, it
8593 uses the default simpset instead of a supplied list of theorems.
8595 * HOL/List: the constructors of type list are now Nil and Cons;
8597 * Simplifier: the type of the infix ML functions
8598 setSSolver addSSolver setSolver addSolver
8599 is now simpset * solver -> simpset where `solver' is a new abstract type
8600 for packaging solvers. A solver is created via
8601 mk_solver: string -> (thm list -> int -> tactic) -> solver
8602 where the string argument is only a comment.
8607 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
8608 decision procedure for linear arithmetic. Currently it is used for
8609 types `nat', `int', and `real' in HOL (see below); it can, should and
8610 will be instantiated for other types and logics as well.
8612 * The simplifier now accepts rewrite rules with flexible heads, eg
8613 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
8614 They are applied like any rule with a non-pattern lhs, i.e. by first-order
8620 * New Isabelle/Isar subsystem provides an alternative to traditional
8621 tactical theorem proving; together with the ProofGeneral/isar user
8622 interface it offers an interactive environment for developing human
8623 readable proof documents (Isar == Intelligible semi-automated
8624 reasoning); for further information see isatool doc isar-ref,
8625 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
8627 * improved and simplified presentation of theories: better HTML markup
8628 (including colors), graph views in several sizes; isatool usedir now
8629 provides a proper interface for user theories (via -P option); actual
8630 document preparation based on (PDF)LaTeX is available as well (for
8631 new-style theories only); see isatool doc system for more information;
8633 * native support for Proof General, both for classic Isabelle and
8636 * ML function thm_deps visualizes dependencies of theorems and lemmas,
8637 using the graph browser tool;
8639 * Isabelle manuals now also available as PDF;
8641 * theory loader rewritten from scratch (may not be fully
8642 bug-compatible); old loadpath variable has been replaced by show_path,
8643 add_path, del_path, reset_path functions; new operations such as
8644 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
8647 * improved isatool install: option -k creates KDE application icon,
8648 option -p DIR installs standalone binaries;
8650 * added ML_PLATFORM setting (useful for cross-platform installations);
8651 more robust handling of platform specific ML images for SML/NJ;
8653 * the settings environment is now statically scoped, i.e. it is never
8654 created again in sub-processes invoked from isabelle, isatool, or
8657 * path element specification '~~' refers to '$ISABELLE_HOME';
8659 * in locales, the "assumes" and "defines" parts may be omitted if
8662 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
8665 * new print_mode "HTML";
8667 * new flag show_tags controls display of tags of theorems (which are
8668 basically just comments that may be attached by some tools);
8670 * Isamode 2.6 requires patch to accomodate change of Isabelle font
8671 mode and goal output format:
8673 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
8675 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
8677 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
8678 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
8680 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
8682 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
8684 * function bind_thms stores lists of theorems (cf. bind_thm);
8686 * new shorthand tactics ftac, eatac, datac, fatac;
8688 * qed (and friends) now accept "" as result name; in that case the
8689 theorem is not stored, but proper checks and presentation of the
8692 * theorem database now also indexes constants "Trueprop", "all",
8693 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
8698 ** HOL arithmetic **
8700 * There are now decision procedures for linear arithmetic over nat and
8703 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
8704 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
8705 are treated as atomic; subformulae not involving type `nat' or `int'
8706 are ignored; quantified subformulae are ignored unless they are
8707 positive universal or negative existential. The tactic has to be
8708 invoked by hand and can be a little bit slow. In particular, the
8709 running time is exponential in the number of occurrences of `min' and
8710 `max', and `-' on `nat'.
8712 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
8713 (negated) (in)equalities among the premises and the conclusion into
8714 account (i.e. no compound formulae) and does not know about `min' and
8715 `max', and `-' on `nat'. It is fast and is used automatically by the
8718 NB: At the moment, these decision procedures do not cope with mixed
8719 nat/int formulae where the two parts interact, such as `m < n ==>
8722 * HOL/Numeral provides a generic theory of numerals (encoded
8723 efficiently as bit strings); setup for types nat/int/real is in place;
8724 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
8725 int, existing theories and proof scripts may require a few additional
8728 * integer division and remainder can now be performed on constant
8731 * many properties of integer multiplication, division and remainder
8734 * An interface to the Stanford Validity Checker (SVC) is available through the
8735 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
8736 are proved automatically. SVC must be installed separately, and its results
8737 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
8738 invocation of the underlying oracle). For SVC see
8739 http://verify.stanford.edu/SVC
8741 * IsaMakefile: the HOL-Real target now builds an actual image;
8746 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
8747 (in Isabelle/Isar) -- by Gertrud Bauer;
8749 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
8750 analysis for assembly languages with subtypes;
8752 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
8753 -- avoids syntactic ambiguities and treats state, transition, and
8754 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
8755 changed syntax and (many) tactics;
8757 * HOL/inductive: Now also handles more general introduction rules such
8758 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
8759 theorems are now maintained within the theory (maintained via the
8762 * HOL/datatype: Now also handles arbitrarily branching datatypes
8763 (using function types) such as
8765 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
8767 * HOL/record: record_simproc (part of the default simpset) takes care
8768 of selectors applied to updated records; record_split_tac is no longer
8769 part of the default claset; update_defs may now be removed from the
8770 simpset in many cases; COMPATIBILITY: old behavior achieved by
8772 claset_ref () := claset() addSWrapper record_split_wrapper;
8773 Delsimprocs [record_simproc]
8775 * HOL/typedef: fixed type inference for representing set; type
8776 arguments now have to occur explicitly on the rhs as type constraints;
8778 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
8779 names rather than an ML expression;
8781 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
8782 supplied later. Program schemes can be defined, such as
8783 "While B C s = (if B s then While B C (C s) else s)"
8784 where the well-founded relation can be chosen after B and C have been given.
8786 * HOL/List: the constructors of type list are now Nil and Cons;
8787 INCOMPATIBILITY: while [] and infix # syntax is still there, of
8788 course, ML tools referring to List.list.op # etc. have to be adapted;
8790 * HOL_quantifiers flag superseded by "HOL" print mode, which is
8791 disabled by default; run isabelle with option -m HOL to get back to
8792 the original Gordon/HOL-style output;
8794 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
8795 ALL x<=y. P, EX x<y. P, EX x<=y. P;
8797 * HOL basic syntax simplified (more orthogonal): all variants of
8798 All/Ex now support plain / symbolic / HOL notation; plain syntax for
8799 Eps operator is provided as well: "SOME x. P[x]";
8801 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
8803 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
8804 thus available for user theories;
8806 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
8807 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
8810 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
8811 several times and then mp;
8816 * the notation <<...>> is now available as a notation for sequences of
8819 * the simplifier is now installed
8821 * the axiom system has been generalized (thanks to Soren Heilmann)
8823 * the classical reasoner now has a default rule database
8828 * new primrec section allows primitive recursive functions to be given
8829 directly (as in HOL) over datatypes and the natural numbers;
8831 * new tactics induct_tac and exhaust_tac for induction (or case
8832 analysis) over datatypes and the natural numbers;
8834 * the datatype declaration of type T now defines the recursor T_rec;
8836 * simplification automatically does freeness reasoning for datatype
8839 * automatic type-inference, with AddTCs command to insert new
8840 type-checking rules;
8842 * datatype introduction rules are now added as Safe Introduction rules
8845 * the syntax "if P then x else y" is now available in addition to
8849 *** Internal programming interfaces ***
8851 * tuned simplifier trace output; new flag debug_simp;
8853 * structures Vartab / Termtab (instances of TableFun) offer efficient
8854 tables indexed by indexname_ord / term_ord (compatible with aconv);
8856 * AxClass.axclass_tac lost the theory argument;
8858 * tuned current_goals_markers semantics: begin / end goal avoids
8859 printing empty lines;
8861 * removed prs and prs_fn hook, which was broken because it did not
8862 include \n in its semantics, forcing writeln to add one
8863 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
8864 string -> unit if you really want to output text without newline;
8866 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
8867 plain output, interface builders may have to enable 'isabelle_font'
8868 mode to get Isabelle font glyphs as before;
8870 * refined token_translation interface; INCOMPATIBILITY: output length
8871 now of type real instead of int;
8873 * theory loader actions may be traced via new ThyInfo.add_hook
8874 interface (see src/Pure/Thy/thy_info.ML); example application: keep
8875 your own database of information attached to *whole* theories -- as
8876 opposed to intra-theory data slots offered via TheoryDataFun;
8878 * proper handling of dangling sort hypotheses (at last!);
8879 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
8880 extra sort hypotheses that can be witnessed from the type signature;
8881 the force_strip_shyps flag is gone, any remaining shyps are simply
8882 left in the theorem (with a warning issued by strip_shyps_warning);
8886 New in Isabelle98-1 (October 1998)
8887 ----------------------------------
8889 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8891 * several changes of automated proof tools;
8893 * HOL: major changes to the inductive and datatype packages, including
8894 some minor incompatibilities of theory syntax;
8896 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
8899 * HOL: removed duplicate thms in Arith:
8900 less_imp_add_less should be replaced by trans_less_add1
8901 le_imp_add_le should be replaced by trans_le_add1
8903 * HOL: unary minus is now overloaded (new type constraints may be
8906 * HOL and ZF: unary minus for integers is now #- instead of #~. In
8907 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
8908 now taken as an integer constant.
8910 * Pure: ML function 'theory_of' renamed to 'theory';
8916 1. Asm_full_simp_tac is now more aggressive.
8917 1. It will sometimes reorient premises if that increases their power to
8919 2. It does no longer proceed strictly from left to right but may also
8920 rotate premises to achieve further simplification.
8921 For compatibility reasons there is now Asm_lr_simp_tac which is like the
8922 old Asm_full_simp_tac in that it does not rotate premises.
8923 2. The simplifier now knows a little bit about nat-arithmetic.
8925 * Classical reasoner: wrapper mechanism for the classical reasoner now
8926 allows for selected deletion of wrappers, by introduction of names for
8927 wrapper functionals. This implies that addbefore, addSbefore,
8928 addaltern, and addSaltern now take a pair (name, tactic) as argument,
8929 and that adding two tactics with the same name overwrites the first
8930 one (emitting a warning).
8931 type wrapper = (int -> tactic) -> (int -> tactic)
8932 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
8933 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
8934 delWrapper, delSWrapper: claset * string -> claset
8935 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
8937 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
8938 semantics; addbefore now affects only the unsafe part of step_tac
8939 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
8940 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
8943 * Classical reasoner: setwrapper to setWrapper and compwrapper to
8944 compWrapper; added safe wrapper (and access functions for it);
8946 * HOL/split_all_tac is now much faster and fails if there is nothing
8947 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
8948 and the names of the automatically generated variables have changed.
8949 split_all_tac has moved within claset() from unsafe wrappers to safe
8950 wrappers, which means that !!-bound variables are split much more
8951 aggressively, and safe_tac and clarify_tac now split such variables.
8952 If this splitting is not appropriate, use delSWrapper "split_all_tac".
8953 Note: the same holds for record_split_tac, which does the job of
8954 split_all_tac for record fields.
8956 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
8957 permanently to the default simpset using Addsplits just like
8958 Addsimps. They can be removed via Delsplits just like
8959 Delsimps. Lower-case versions are also available.
8961 * HOL/Simplifier: The rule split_if is now part of the default
8962 simpset. This means that the simplifier will eliminate all occurrences
8963 of if-then-else in the conclusion of a goal. To prevent this, you can
8964 either remove split_if completely from the default simpset by
8965 `Delsplits [split_if]' or remove it in a specific call of the
8966 simplifier using `... delsplits [split_if]'. You can also add/delete
8967 other case splitting rules to/from the default simpset: every datatype
8968 generates suitable rules `split_t_case' and `split_t_case_asm' (where
8969 t is the name of the datatype).
8971 * Classical reasoner / Simplifier combination: new force_tac (and
8972 derivatives Force_tac, force) combines rewriting and classical
8973 reasoning (and whatever other tools) similarly to auto_tac, but is
8974 aimed to solve the given subgoal completely.
8979 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
8980 and `goalw': the theory is no longer needed as an explicit argument -
8981 the current theory context is used; assumptions are no longer returned
8982 at the ML-level unless one of them starts with ==> or !!; it is
8983 recommended to convert to these new commands using isatool fixgoal
8984 (backup your sources first!);
8986 * new top-level commands 'thm' and 'thms' for retrieving theorems from
8987 the current theory context, and 'theory' to lookup stored theories;
8989 * new theory section 'locale' for declaring constants, assumptions and
8990 definitions that have local scope;
8992 * new theory section 'nonterminals' for purely syntactic types;
8994 * new theory section 'setup' for generic ML setup functions
8995 (e.g. package initialization);
8997 * the distribution now includes Isabelle icons: see
8998 lib/logo/isabelle-{small,tiny}.xpm;
9000 * isatool install - install binaries with absolute references to
9003 * isatool logo -- create instances of the Isabelle logo (as EPS);
9005 * print mode 'emacs' reserved for Isamode;
9007 * support multiple print (ast) translations per constant name;
9009 * theorems involving oracles are now printed with a suffixed [!];
9014 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
9016 * HOL/inductive package reorganized and improved: now supports mutual
9022 oddI "n : EVEN ==> Suc n : ODD"
9023 evenI "n : ODD ==> Suc n : EVEN"
9025 new theorem list "elims" contains an elimination rule for each of the
9026 recursive sets; inductive definitions now handle disjunctive premises
9027 correctly (also ZF);
9029 INCOMPATIBILITIES: requires Inductive as an ancestor; component
9030 "mutual_induct" no longer exists - the induction rule is always
9031 contained in "induct";
9034 * HOL/datatype package re-implemented and greatly improved: now
9035 supports mutually recursive datatypes such as
9038 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
9039 | SUM ('a aexp) ('a aexp)
9040 | DIFF ('a aexp) ('a aexp)
9043 'a bexp = LESS ('a aexp) ('a aexp)
9044 | AND ('a bexp) ('a bexp)
9045 | OR ('a bexp) ('a bexp)
9047 as well as indirectly recursive datatypes such as
9050 ('a, 'b) term = Var 'a
9051 | App 'b ((('a, 'b) term) list)
9053 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
9054 induction on mutually / indirectly recursive datatypes.
9056 Primrec equations are now stored in theory and can be accessed via
9057 <function_name>.simps.
9061 - Theories using datatypes must now have theory Datatype as an
9063 - The specific <typename>.induct_tac no longer exists - use the
9064 generic induct_tac instead.
9065 - natE has been renamed to nat.exhaust - use exhaust_tac
9066 instead of res_inst_tac ... natE. Note that the variable
9067 names in nat.exhaust differ from the names in natE, this
9068 may cause some "fragile" proofs to fail.
9069 - The theorems split_<typename>_case and split_<typename>_case_asm
9070 have been renamed to <typename>.split and <typename>.split_asm.
9071 - Since default sorts of type variables are now handled correctly,
9072 some datatype definitions may have to be annotated with explicit
9074 - Primrec definitions no longer require function name and type
9075 of recursive argument.
9077 Consider using isatool fixdatatype to adapt your theories and proof
9078 scripts to the new package (backup your sources first!).
9081 * HOL/record package: considerably improved implementation; now
9082 includes concrete syntax for record types, terms, updates; theorems
9083 for surjective pairing and splitting !!-bound record variables; proof
9084 support is as follows:
9086 1) standard conversions (selectors or updates applied to record
9087 constructor terms) are part of the standard simpset;
9089 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
9090 made part of standard simpset and claset via addIffs;
9092 3) a tactic for record field splitting (record_split_tac) is part of
9093 the standard claset (addSWrapper);
9095 To get a better idea about these rules you may retrieve them via
9096 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
9097 the name of your record type.
9099 The split tactic 3) conceptually simplifies by the following rule:
9101 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
9103 Thus any record variable that is bound by meta-all will automatically
9104 blow up into some record constructor term, consequently the
9105 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
9106 solve record problems automatically.
9109 * reorganized the main HOL image: HOL/Integ and String loaded by
9110 default; theory Main includes everything;
9112 * automatic simplification of integer sums and comparisons, using cancellation;
9114 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
9116 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
9118 * many new identities for unions, intersections, set difference, etc.;
9120 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
9121 called split_if, split_split, split_sum_case and split_nat_case (to go
9122 with add/delsplits);
9124 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
9125 (?x::unit) = (); this is made part of the default simpset, which COULD
9126 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
9127 'Delsimprocs [unit_eq_proc];' as last resort); also note that
9128 unit_abs_eta_conv is added in order to counter the effect of
9129 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
9132 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
9135 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9136 It and 'sym RS equals0D' are now in the default claset, giving automatic
9137 disjointness reasoning but breaking a few old proofs.
9139 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
9140 to 'converse' from 'inverse' (for compatibility with ZF and some
9143 * HOL/recdef can now declare non-recursive functions, with {} supplied as
9144 the well-founded relation;
9146 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
9147 Compl A. The "Compl" syntax remains available as input syntax for this
9150 * HOL/Update: new theory of function updates:
9151 f(a:=b) == %x. if x=a then b else f x
9152 may also be iterated as in f(a:=b,c:=d,...);
9154 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
9157 - new function list_update written xs[i:=v] that updates the i-th
9158 list position. May also be iterated as in xs[i:=a,j:=b,...].
9159 - new function `upt' written [i..j(] which generates the list
9160 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
9161 bound write [i..j], which is a shorthand for [i..j+1(].
9162 - new lexicographic orderings and corresponding wellfoundedness theorems.
9165 - removed 'pred' (predecessor) function;
9166 - generalized some theorems about n-1;
9167 - many new laws about "div" and "mod";
9168 - new laws about greatest common divisors (see theory ex/Primes);
9170 * HOL/Relation: renamed the relational operator r^-1 "converse"
9171 instead of "inverse";
9173 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
9174 of the multiset ordering;
9176 * directory HOL/Real: a construction of the reals using Dedekind cuts
9177 (not included by default);
9179 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
9181 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
9182 programs, i.e. different program variables may have different types.
9184 * calling (stac rew i) now fails if "rew" has no effect on the goal
9185 [previously, this check worked only if the rewrite rule was unconditional]
9186 Now rew can involve either definitions or equalities (either == or =).
9191 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
9192 only the theorems proved on ZF.ML;
9194 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9195 It and 'sym RS equals0D' are now in the default claset, giving automatic
9196 disjointness reasoning but breaking a few old proofs.
9198 * ZF/Update: new theory of function updates
9199 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
9200 may also be iterated as in f(a:=b,c:=d,...);
9202 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
9204 * calling (stac rew i) now fails if "rew" has no effect on the goal
9205 [previously, this check worked only if the rewrite rule was unconditional]
9206 Now rew can involve either definitions or equalities (either == or =).
9208 * case_tac provided for compatibility with HOL
9209 (like the old excluded_middle_tac, but with subgoals swapped)
9212 *** Internal programming interfaces ***
9214 * Pure: several new basic modules made available for general use, see
9215 also src/Pure/README;
9217 * improved the theory data mechanism to support encapsulation (data
9218 kind name replaced by private Object.kind, acting as authorization
9219 key); new type-safe user interface via functor TheoryDataFun; generic
9220 print_data function becomes basically useless;
9222 * removed global_names compatibility flag -- all theory declarations
9223 are qualified by default;
9225 * module Pure/Syntax now offers quote / antiquote translation
9226 functions (useful for Hoare logic etc. with implicit dependencies);
9227 see HOL/ex/Antiquote for an example use;
9229 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
9232 * new tactical CHANGED_GOAL for checking that a tactic modifies a
9235 * Display.print_goals function moved to Locale.print_goals;
9237 * standard print function for goals supports current_goals_markers
9238 variable for marking begin of proof, end of proof, start of goal; the
9239 default is ("", "", ""); setting current_goals_markers := ("<proof>",
9240 "</proof>", "<goal>") causes SGML like tagged proof state printing,
9245 New in Isabelle98 (January 1998)
9246 --------------------------------
9248 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9250 * changed lexical syntax of terms / types: dots made part of long
9251 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
9253 * simpset (and claset) reference variable replaced by functions
9254 simpset / simpset_ref;
9256 * no longer supports theory aliases (via merge) and non-trivial
9257 implicit merge of thms' signatures;
9259 * most internal names of constants changed due to qualified names;
9261 * changed Pure/Sequence interface (see Pure/seq.ML);
9264 *** General Changes ***
9266 * hierachically structured name spaces (for consts, types, axms, thms
9267 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
9268 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
9269 isatool fixdots ensures space after dots (e.g. "%x. x"); set
9270 long_names for fully qualified output names; NOTE: ML programs
9271 (special tactics, packages etc.) referring to internal names may have
9272 to be adapted to cope with fully qualified names; in case of severe
9273 backward campatibility problems try setting 'global_names' at compile
9274 time to have enrything declared within a flat name space; one may also
9275 fine tune name declarations in theories via the 'global' and 'local'
9278 * reimplemented the implicit simpset and claset using the new anytype
9279 data filed in signatures; references simpset:simpset ref etc. are
9280 replaced by functions simpset:unit->simpset and
9281 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
9282 to patch your ML files accordingly;
9284 * HTML output now includes theory graph data for display with Java
9285 applet or isatool browser; data generated automatically via isatool
9286 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
9288 * defs may now be conditional; improved rewrite_goals_tac to handle
9289 conditional equations;
9291 * defs now admits additional type arguments, using TYPE('a) syntax;
9293 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
9294 creates a new theory node; implicit merge of thms' signatures is
9295 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
9296 transfer:theory->thm->thm in (rare) cases;
9298 * improved handling of draft signatures / theories; draft thms (and
9299 ctyps, cterms) are automatically promoted to real ones;
9301 * slightly changed interfaces for oracles: admit many per theory, named
9302 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
9304 * print_goals: optional output of const types (set show_consts and
9307 * improved output of warnings (###) and errors (***);
9309 * subgoal_tac displays a warning if the new subgoal has type variables;
9311 * removed old README and Makefiles;
9313 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
9315 * removed obsolete init_pps and init_database;
9317 * deleted the obsolete tactical STATE, which was declared by
9318 fun STATE tacfun st = tacfun st st;
9320 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
9321 (which abbreviates $HOME);
9323 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
9324 use isatool fixseq to adapt your ML programs (this works for fully
9325 qualified references to the Sequence structure only!);
9327 * use_thy no longer requires writable current directory; it always
9328 reloads .ML *and* .thy file, if either one is out of date;
9331 *** Classical Reasoner ***
9333 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
9334 tactics that use classical reasoning to simplify a subgoal without
9335 splitting it into several subgoals;
9337 * Safe_tac: like safe_tac but uses the default claset;
9342 * added simplification meta rules:
9343 (asm_)(full_)simplify: simpset -> thm -> thm;
9345 * simplifier.ML no longer part of Pure -- has to be loaded by object
9348 * added prems argument to simplification procedures;
9350 * HOL, FOL, ZF: added infix function `addsplits':
9351 instead of `<simpset> setloop (split_tac <thms>)'
9352 you can simply write `<simpset> addsplits <thms>'
9357 * TYPE('a) syntax for type reflection terms;
9359 * no longer handles consts with name "" -- declare as 'syntax' instead;
9361 * pretty printer: changed order of mixfix annotation preference (again!);
9363 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
9368 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
9369 with `addloop' of the simplifier to faciliate case splitting in premises.
9371 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
9373 * HOL/Auth: new protocol proofs including some for the Internet
9376 * HOL/Map: new theory of `maps' a la VDM;
9378 * HOL/simplifier: simplification procedures nat_cancel_sums for
9379 cancelling out common nat summands from =, <, <= (in)equalities, or
9380 differences; simplification procedures nat_cancel_factor for
9381 cancelling common factor from =, <, <= (in)equalities over natural
9382 sums; nat_cancel contains both kinds of procedures, it is installed by
9383 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
9385 * HOL/simplifier: terms of the form
9386 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
9388 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
9389 and those of the form
9390 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
9392 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
9395 Each datatype `t' now comes with a theorem `split_t_case' of the form
9397 P(t_case f1 ... fn x) =
9398 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
9400 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
9403 and a theorem `split_t_case_asm' of the form
9405 P(t_case f1 ... fn x) =
9406 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
9408 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
9410 which can be added to a simpset via `addsplits'. The existing theorems
9411 expand_list_case and expand_option_case have been renamed to
9412 split_list_case and split_option_case.
9415 - `pred n' is automatically converted to `n-1'.
9416 Users are strongly encouraged not to use `pred' any longer,
9417 because it will disappear altogether at some point.
9418 - Users are strongly encouraged to write "0 < n" rather than
9419 "n ~= 0". Theorems and proof tools have been modified towards this
9423 the function "set_of_list" has been renamed "set" (and its theorems too);
9424 the function "nth" now takes its arguments in the reverse order and
9425 has acquired the infix notation "!" as in "xs!n".
9427 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
9429 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
9430 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
9432 * HOL/record: extensible records with schematic structural subtyping
9433 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
9434 still lacks various theorems and concrete record syntax;
9439 * removed "axioms" and "generated by" sections;
9441 * replaced "ops" section by extended "consts" section, which is capable of
9442 handling the continuous function space "->" directly;
9445 . proves theorems immediately and stores them in the theory,
9446 . creates hierachical name space,
9447 . now uses normal mixfix annotations (instead of cinfix...),
9448 . minor changes to some names and values (for consistency),
9449 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
9450 . separator between mutual domain defs: changed "," to "and",
9451 . improved handling of sort constraints; now they have to
9452 appear on the left-hand side of the equations only;
9454 * fixed LAM <x,y,zs>.b syntax;
9456 * added extended adm_tac to simplifier in HOLCF -- can now discharge
9457 adm (%x. P (t x)), where P is chainfinite and t continuous;
9462 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
9463 with `addloop' of the simplifier to faciliate case splitting in premises.
9465 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
9466 in HOL, they strip ALL and --> from proved theorems;
9470 New in Isabelle94-8 (May 1997)
9471 ------------------------------
9473 *** General Changes ***
9475 * new utilities to build / run / maintain Isabelle etc. (in parts
9476 still somewhat experimental); old Makefiles etc. still functional;
9478 * new 'Isabelle System Manual';
9480 * INSTALL text, together with ./configure and ./build scripts;
9482 * reimplemented type inference for greater efficiency, better error
9483 messages and clean internal interface;
9485 * prlim command for dealing with lots of subgoals (an easier way of
9486 setting goals_limit);
9491 * supports alternative (named) syntax tables (parser and pretty
9492 printer); internal interface is provided by add_modesyntax(_i);
9494 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
9495 be used in conjunction with the Isabelle symbol font; uses the
9496 "symbols" syntax table;
9498 * added token_translation interface (may translate name tokens in
9499 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
9500 the current print_mode); IMPORTANT: user print translation functions
9501 are responsible for marking newly introduced bounds
9502 (Syntax.mark_boundT);
9504 * token translations for modes "xterm" and "xterm_color" that display
9505 names in bold, underline etc. or colors (which requires a color
9508 * infixes may now be declared with names independent of their syntax;
9510 * added typed_print_translation (like print_translation, but may
9511 access type of constant);
9514 *** Classical Reasoner ***
9516 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
9517 some limitations. Blast_tac...
9518 + ignores addss, addbefore, addafter; this restriction is intrinsic
9519 + ignores elimination rules that don't have the correct format
9520 (the conclusion MUST be a formula variable)
9521 + ignores types, which can make HOL proofs fail
9522 + rules must not require higher-order unification, e.g. apply_type in ZF
9523 [message "Function Var's argument not a bound variable" relates to this]
9524 + its proof strategy is more general but can actually be slower
9526 * substitution with equality assumptions no longer permutes other
9529 * minor changes in semantics of addafter (now called addaltern); renamed
9530 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
9531 (and access functions for it);
9533 * improved combination of classical reasoner and simplifier:
9534 + functions for handling clasimpsets
9535 + improvement of addss: now the simplifier is called _after_ the
9537 + safe variant of addss called addSss: uses safe simplifications
9538 _during_ the safe steps. It is more complete as it allows multiple
9539 instantiations of unknowns (e.g. with slow_tac).
9543 * added interface for simplification procedures (functions that
9544 produce *proven* rewrite rules on the fly, depending on current
9547 * ordering on terms as parameter (used for ordered rewriting);
9549 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
9551 * the solver is now split into a safe and an unsafe part.
9552 This should be invisible for the normal user, except that the
9553 functions setsolver and addsolver have been renamed to setSolver and
9554 addSolver; added safe_asm_full_simp_tac;
9559 * a generic induction tactic `induct_tac' which works for all datatypes and
9560 also for type `nat';
9562 * a generic case distinction tactic `exhaust_tac' which works for all
9563 datatypes and also for type `nat';
9565 * each datatype comes with a function `size';
9567 * patterns in case expressions allow tuple patterns as arguments to
9568 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
9570 * primrec now also works with type nat;
9572 * recdef: a new declaration form, allows general recursive functions to be
9573 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
9575 * the constant for negation has been renamed from "not" to "Not" to
9576 harmonize with FOL, ZF, LK, etc.;
9578 * HOL/ex/LFilter theory of a corecursive "filter" functional for
9581 * HOL/Modelcheck demonstrates invocation of model checker oracle;
9583 * HOL/ex/Ring.thy declares cring_simp, which solves equational
9584 problems in commutative rings, using axiomatic type classes for + and *;
9586 * more examples in HOL/MiniML and HOL/Auth;
9588 * more default rewrite rules for quantifiers, union/intersection;
9590 * a new constant `arbitrary == @x.False';
9592 * HOLCF/IOA replaces old HOL/IOA;
9594 * HOLCF changes: derived all rules and arities
9595 + axiomatic type classes instead of classes
9596 + typedef instead of faking type definitions
9597 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
9598 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
9599 + eliminated the types void, one, tr
9600 + use unit lift and bool lift (with translations) instead of one and tr
9601 + eliminated blift from Lift3.thy (use Def instead of blift)
9602 all eliminated rules are derived as theorems --> no visible changes ;
9607 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
9608 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
9609 as ZF_cs addSIs [equalityI];
9613 New in Isabelle94-7 (November 96)
9614 ---------------------------------
9616 * allowing negative levels (as offsets) in prlev and choplev;
9618 * super-linear speedup for large simplifications;
9620 * FOL, ZF and HOL now use miniscoping: rewriting pushes
9621 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
9622 FAIL); can suppress it using the command Delsimps (ex_simps @
9623 all_simps); De Morgan laws are also now included, by default;
9625 * improved printing of ==> : ~:
9627 * new object-logic "Sequents" adds linear logic, while replacing LK
9628 and Modal (thanks to Sara Kalvala);
9630 * HOL/Auth: correctness proofs for authentication protocols;
9632 * HOL: new auto_tac combines rewriting and classical reasoning (many
9633 examples on HOL/Auth);
9635 * HOL: new command AddIffs for declaring theorems of the form P=Q to
9636 the rewriter and classical reasoner simultaneously;
9638 * function uresult no longer returns theorems in "standard" format;
9639 regain previous version by: val uresult = standard o uresult;
9646 * oracles -- these establish an interface between Isabelle and trusted
9647 external reasoners, which may deliver results as theorems;
9649 * proof objects (in particular record all uses of oracles);
9651 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
9653 * "constdefs" section in theory files;
9655 * "primrec" section (HOL) no longer requires names;
9657 * internal type "tactic" now simply "thm -> thm Sequence.seq";
9664 * reduced space requirements;
9666 * automatic HTML generation from theories;
9668 * theory files no longer require "..." (quotes) around most types;
9670 * new examples, including two proofs of the Church-Rosser theorem;
9672 * non-curried (1994) version of HOL is no longer distributed;
9679 * greatly reduced space requirements;
9681 * theory files (.thy) no longer require \...\ escapes at line breaks;
9683 * searchable theorem database (see the section "Retrieving theorems" on
9684 page 8 of the Reference Manual);
9686 * new examples, including Grabczewski's monumental case study of the
9689 * The previous version of HOL renamed to Old_HOL;
9691 * The new version of HOL (previously called CHOL) uses a curried syntax
9692 for functions. Application looks like f a b instead of f(a,b);
9694 * Mutually recursive inductive definitions finally work in HOL;
9696 * In ZF, pattern-matching on tuples is now available in all abstractions and
9697 translates to the operator "split";
9704 * new infix operator, addss, allowing the classical reasoner to
9705 perform simplification at each step of its search. Example:
9706 fast_tac (cs addss ss)
9708 * a new logic, CHOL, the same as HOL, but with a curried syntax
9709 for functions. Application looks like f a b instead of f(a,b). Also pairs
9710 look like (a,b) instead of <a,b>;
9712 * PLEASE NOTE: CHOL will eventually replace HOL!
9714 * In CHOL, pattern-matching on tuples is now available in all abstractions.
9715 It translates to the operator "split". A new theory of integers is available;
9717 * In ZF, integer numerals now denote two's-complement binary integers.
9718 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
9720 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
9721 of the Axiom of Choice;
9728 * Significantly faster resolution;
9730 * the different sections in a .thy file can now be mixed and repeated
9733 * Database of theorems for FOL, HOL and ZF. New
9734 commands including qed, qed_goal and bind_thm store theorems in the database.
9736 * Simple database queries: return a named theorem (get_thm) or all theorems of
9737 a given theory (thms_of), or find out what theory a theorem was proved in
9740 * Bugs fixed in the inductive definition and datatype packages;
9742 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
9743 and HOL_dup_cs obsolete;
9745 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
9748 * Simpler definition of function space in ZF;
9750 * new results about cardinal and ordinal arithmetic in ZF;
9752 * 'subtype' facility in HOL for introducing new types as subsets of existing
9755 :mode=text:wrap=hard:maxLineLen=72: