1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
10 is called fastforce / fast_force_tac already since Isabelle2011-1.
12 * Updated and extended "isar-ref" manual, reduced remaining material
18 * Command "export_code": relative file names are interpreted
19 relatively to master directory of current theory rather than
20 the rather arbitrary current working directory.
23 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
24 use regular rule composition via "OF" / "THEN", or explicit proof
25 structure instead. Note that Isabelle/ML provides a variety of
26 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
27 with some care where this is really required.
32 * Library/Debug.thy and Library/Parallel.thy: debugging and parallel
33 execution for code generated towards Isabelle/ML.
35 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
40 - added an optimisation for equality premises.
41 It is switched on by default, and can be switched off by setting
42 the configuration quickcheck_optimise_equality to false.
44 * The SMT solver Z3 has now by default a restricted set of directly
45 supported features. For the full set of features (div/mod, nonlinear
46 arithmetic, datatypes/records) with potential proof reconstruction
47 failures, enable the configuration option "z3_with_extensions".
48 Minor INCOMPATIBILITY.
52 - Added MaSh relevance filter based on machine-learning; see the
53 Sledgehammer manual for details.
54 - Rationalized type encodings ("type_enc" option).
56 max_relevant ~> max_facts
57 relevance_thresholds ~> fact_thresholds
60 *** Document preparation ***
62 * Default for \<euro> is now based on eurosym package, instead of
63 slightly exotic babel/greek.
68 * Discontinued support for Poly/ML 5.2.1, which was the last version
69 without exception positions and advanced ML compiler/toplevel
74 New in Isabelle2012 (May 2012)
75 ------------------------------
79 * Prover IDE (PIDE) improvements:
81 - more robust Sledgehammer integration (as before the sledgehammer
82 command-line needs to be typed into the source buffer)
83 - markup for bound variables
84 - markup for types of term variables (displayed as tooltips)
85 - support for user-defined Isar commands within the running session
86 - improved support for Unicode outside original 16bit range
87 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
89 * Forward declaration of outer syntax keywords within the theory
90 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
91 commands to be used in the same theory where defined.
93 * Auxiliary contexts indicate block structure for specifications with
94 additional parameters and assumptions. Such unnamed contexts may be
95 nested within other targets, like 'theory', 'locale', 'class',
96 'instantiation' etc. Results from the local context are generalized
97 accordingly and applied to the enclosing target context. Example:
101 assumes xy: "x = y" and yz: "y = z"
104 lemma my_trans: "x = z" using xy yz by simp
110 The most basic application is to factor-out context elements of
111 several fixes/assumes/shows theorem statements, e.g. see
112 ~~/src/HOL/Isar_Examples/Group_Context.thy
114 Any other local theory specification element works within the "context
115 ... begin ... end" block as well.
117 * Bundled declarations associate attributed fact expressions with a
118 given name in the context. These may be later included in other
119 contexts. This allows to manage context extensions casually, without
120 the logical dependencies of locales and locale interpretation. See
121 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
123 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
124 declaration, and results are standardized before being stored. Thus
125 old-style "standard" after instantiation or composition of facts
126 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
127 indices of schematic variables.
129 * Rule attributes in local theory declarations (e.g. locale or class)
130 are now statically evaluated: the resulting theorem is stored instead
131 of the original expression. INCOMPATIBILITY in rare situations, where
132 the historic accident of dynamic re-evaluation in interpretations
135 * New tutorial "Programming and Proving in Isabelle/HOL"
136 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
137 Structured Isar Proofs" ("isar-overview"), which has been removed. It
138 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
139 Logic" as the recommended beginners tutorial, but does not cover all
140 of the material of that old tutorial.
142 * Updated and extended reference manuals: "isar-ref",
143 "implementation", "system"; reduced remaining material in old "ref"
149 * Command 'definition' no longer exports the foundational "raw_def"
150 into the user context. Minor INCOMPATIBILITY, may use the regular
151 "def" result with attribute "abs_def" to imitate the old version.
153 * Attribute "abs_def" turns an equation of the form "f x y == t" into
154 "f == %x y. t", which ensures that "simp" or "unfold" steps always
155 expand it. This also works for object-logic equality. (Formerly
156 undocumented feature.)
158 * Sort constraints are now propagated in simultaneous statements, just
159 like type constraints. INCOMPATIBILITY in rare situations, where
160 distinct sorts used to be assigned accidentally. For example:
162 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
164 lemma "P (x::'a)" and "Q (y::'a::bar)"
165 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
167 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
168 tolerant against multiple unifiers, as long as the final result is
169 unique. (As before, rules are composed in canonical right-to-left
170 order to accommodate newly introduced premises.)
172 * Renamed some inner syntax categories:
178 Minor INCOMPATIBILITY. Note that in practice "num_const" or
179 "num_position" etc. are mainly used instead (which also include
180 position information via constraints).
182 * Simplified configuration options for syntax ambiguity: see
183 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
184 manual. Minor INCOMPATIBILITY.
186 * Discontinued configuration option "syntax_positions": atomic terms
187 in parse trees are always annotated by position constraints.
189 * Old code generator for SML and its commands 'code_module',
190 'code_library', 'consts_code', 'types_code' have been discontinued.
191 Use commands of the generic code generator instead. INCOMPATIBILITY.
193 * Redundant attribute "code_inline" has been discontinued. Use
194 "code_unfold" instead. INCOMPATIBILITY.
196 * Dropped attribute "code_unfold_post" in favor of the its dual
197 "code_abbrev", which yields a common pattern in definitions like
199 definition [code_abbrev]: "f = t"
203 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
204 instead. INCOMPATIBILITY.
206 * Discontinued old "prems" fact, which used to refer to the accidental
207 collection of foundational premises in the context (already marked as
208 legacy since Isabelle2011).
213 * Type 'a set is now a proper type constructor (just as before
214 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
215 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
216 sets separate, it is often sufficient to rephrase some set S that has
217 been accidentally used as predicates by "%x. x : S", and some
218 predicate P that has been accidentally used as set by "{x. P x}".
219 Corresponding proofs in a first step should be pruned from any
220 tinkering with former theorems mem_def and Collect_def as far as
223 For developments which deliberately mix predicates and sets, a
224 planning step is necessary to determine what should become a predicate
225 and what a set. It can be helpful to carry out that step in
226 Isabelle2011-1 before jumping right into the current release.
228 * Code generation by default implements sets as container type rather
229 than predicates. INCOMPATIBILITY.
231 * New type synonym 'a rel = ('a * 'a) set
233 * The representation of numerals has changed. Datatype "num"
234 represents strictly positive binary numerals, along with functions
235 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
236 positive and negated numeric literals, respectively. See also
237 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
238 user theories may require adaptations as follows:
240 - Theorems with number_ring or number_semiring constraints: These
241 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
243 - Theories defining numeric types: Remove number, number_semiring,
244 and number_ring instances. Defer all theorems about numerals until
245 after classes one and semigroup_add have been instantiated.
247 - Numeral-only simp rules: Replace each rule having a "number_of v"
248 pattern with two copies, one for numeral and one for neg_numeral.
250 - Theorems about subclasses of semiring_1 or ring_1: These classes
251 automatically support numerals now, so more simp rules and
252 simprocs may now apply within the proof.
254 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
255 Redefine using other integer operations.
257 * Transfer: New package intended to generalize the existing
258 "descending" method and related theorem attributes from the Quotient
259 package. (Not all functionality is implemented yet, but future
260 development will focus on Transfer as an eventual replacement for the
261 corresponding parts of the Quotient package.)
263 - transfer_rule attribute: Maintains a collection of transfer rules,
264 which relate constants at two different types. Transfer rules may
265 relate different type instances of the same polymorphic constant,
266 or they may relate an operation on a raw type to a corresponding
267 operation on an abstract type (quotient or subtype). For example:
269 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
270 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
272 - transfer method: Replaces a subgoal on abstract types with an
273 equivalent subgoal on the corresponding raw types. Constants are
274 replaced with corresponding ones according to the transfer rules.
275 Goals are generalized over all free variables by default; this is
276 necessary for variables whose types change, but can be overridden
277 for specific variables with e.g. "transfer fixing: x y z". The
278 variant transfer' method allows replacing a subgoal with one that
279 is logically stronger (rather than equivalent).
281 - relator_eq attribute: Collects identity laws for relators of
282 various type constructors, e.g. "list_all2 (op =) = (op =)". The
283 transfer method uses these lemmas to infer transfer rules for
284 non-polymorphic constants on the fly.
286 - transfer_prover method: Assists with proving a transfer rule for a
287 new constant, provided the constant is defined in terms of other
288 constants that already have transfer rules. It should be applied
289 after unfolding the constant definitions.
291 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
292 from type nat to type int.
294 * Lifting: New package intended to generalize the quotient_definition
295 facility of the Quotient package; designed to work with Transfer.
297 - lift_definition command: Defines operations on an abstract type in
298 terms of a corresponding operation on a representation
299 type. Example syntax:
301 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
304 Users must discharge a respectfulness proof obligation when each
305 constant is defined. (For a type copy, i.e. a typedef with UNIV,
306 the proof is discharged automatically.) The obligation is
307 presented in a user-friendly, readable form; a respectfulness
308 theorem in the standard format and a transfer rule are generated
311 - Integration with code_abstype: For typedefs (e.g. subtypes
312 corresponding to a datatype invariant, such as dlist),
313 lift_definition generates a code certificate theorem and sets up
314 code generation for each constant.
316 - setup_lifting command: Sets up the Lifting package to work with a
317 user-defined type. The user must provide either a quotient theorem
318 or a type_definition theorem. The package configures transfer
319 rules for equality and quantifiers on the type, and sets up the
320 lift_definition command to work with the type.
322 - Usage examples: See Quotient_Examples/Lift_DList.thy,
323 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
324 Word/Word.thy and Library/Float.thy.
328 - The 'quotient_type' command now supports a 'morphisms' option with
329 rep and abs functions, similar to typedef.
331 - 'quotient_type' sets up new types to work with the Lifting and
332 Transfer packages, as with 'setup_lifting'.
334 - The 'quotient_definition' command now requires the user to prove a
335 respectfulness property at the point where the constant is
336 defined, similar to lift_definition; INCOMPATIBILITY.
338 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
339 accordingly, INCOMPATIBILITY.
341 * New diagnostic command 'find_unused_assms' to find potentially
342 superfluous assumptions in theorems using Quickcheck.
346 - Quickcheck returns variable assignments as counterexamples, which
347 allows to reveal the underspecification of functions under test.
348 For example, refuting "hd xs = x", it presents the variable
349 assignment xs = [] and x = a1 as a counterexample, assuming that
350 any property is false whenever "hd []" occurs in it.
352 These counterexample are marked as potentially spurious, as
353 Quickcheck also returns "xs = []" as a counterexample to the
354 obvious theorem "hd xs = hd xs".
356 After finding a potentially spurious counterexample, Quickcheck
357 continues searching for genuine ones.
359 By default, Quickcheck shows potentially spurious and genuine
360 counterexamples. The option "genuine_only" sets quickcheck to only
361 show genuine counterexamples.
363 - The command 'quickcheck_generator' creates random and exhaustive
364 value generators for a given type and operations.
366 It generates values by using the operations as if they were
367 constructors of that type.
369 - Support for multisets.
371 - Added "use_subtype" options.
373 - Added "quickcheck_locale" configuration to specify how to process
374 conjectures in a locale context.
376 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
377 and affecting 'rat' and 'real'.
380 - Integrated more tightly with SPASS, as described in the ITP 2012
381 paper "More SPASS with Isabelle".
382 - Made it try "smt" as a fallback if "metis" fails or times out.
383 - Added support for the following provers: Alt-Ergo (via Why3 and
384 TFF1), iProver, iProver-Eq.
385 - Sped up the minimizer.
386 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
387 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
388 - Renamed "sound" option to "strict".
390 * Metis: Added possibility to specify lambda translations scheme as a
391 parenthesized argument (e.g., "by (metis (lifting) ...)").
393 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
395 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
397 * New "case_product" attribute to generate a case rule doing multiple
398 case distinctions at the same time. E.g.
400 list.exhaust [case_product nat.exhaust]
402 produces a rule which can be used to perform case distinction on both
405 * New "eventually_elim" method as a generalized variant of the
406 eventually_elim* rules. Supports structured proofs.
408 * Typedef with implicit set definition is considered legacy. Use
409 "typedef (open)" form instead, which will eventually become the
412 * Record: code generation can be switched off manually with
414 declare [[record_coden = false]] -- "default true"
416 * Datatype: type parameters allow explicit sort constraints.
418 * Concrete syntax for case expressions includes constraints for source
419 positions, and thus produces Prover IDE markup for its bindings.
420 INCOMPATIBILITY for old-style syntax translations that augment the
421 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
424 * Clarified attribute "mono_set": pure declaration without modifying
425 the result of the fact expression.
427 * More default pred/set conversions on a couple of relation operations
428 and predicates. Added powers of predicate relations. Consolidation
429 of some relation theorems:
431 converse_def ~> converse_unfold
432 rel_comp_def ~> relcomp_unfold
433 symp_def ~> (modified, use symp_def and sym_def instead)
434 transp_def ~> transp_trans
435 Domain_def ~> Domain_unfold
436 Range_def ~> Domain_converse [symmetric]
438 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
440 See theory "Relation" for examples for making use of pred/set
441 conversions by means of attributes "to_set" and "to_pred".
445 * Renamed facts about the power operation on relations, i.e., relpow
446 to match the constant's name:
448 rel_pow_1 ~> relpow_1
449 rel_pow_0_I ~> relpow_0_I
450 rel_pow_Suc_I ~> relpow_Suc_I
451 rel_pow_Suc_I2 ~> relpow_Suc_I2
452 rel_pow_0_E ~> relpow_0_E
453 rel_pow_Suc_E ~> relpow_Suc_E
454 rel_pow_E ~> relpow_E
455 rel_pow_Suc_D2 ~> relpow_Suc_D2
456 rel_pow_Suc_E2 ~> relpow_Suc_E2
457 rel_pow_Suc_D2' ~> relpow_Suc_D2'
458 rel_pow_E2 ~> relpow_E2
459 rel_pow_add ~> relpow_add
460 rel_pow_commute ~> relpow
461 rel_pow_empty ~> relpow_empty:
462 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
463 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
464 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
465 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
466 rel_pow_fun_conv ~> relpow_fun_conv
467 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
468 rel_pow_finite_bounded ~> relpow_finite_bounded
469 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
470 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
471 single_valued_rel_pow ~> single_valued_relpow
475 * Theory Relation: Consolidated constant name for relation composition
476 and corresponding theorem names:
478 - Renamed constant rel_comp to relcomp.
480 - Dropped abbreviation pred_comp. Use relcompp instead.
484 rel_compI ~> relcompI
485 rel_compEpair ~> relcompEpair
486 rel_compE ~> relcompE
487 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
488 rel_comp_empty1 ~> relcomp_empty1
489 rel_comp_mono ~> relcomp_mono
490 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
491 rel_comp_distrib ~> relcomp_distrib
492 rel_comp_distrib2 ~> relcomp_distrib2
493 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
494 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
495 single_valued_rel_comp ~> single_valued_relcomp
496 rel_comp_def ~> relcomp_unfold
497 converse_rel_comp ~> converse_relcomp
498 pred_compI ~> relcomppI
499 pred_compE ~> relcomppE
500 pred_comp_bot1 ~> relcompp_bot1
501 pred_comp_bot2 ~> relcompp_bot2
502 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
503 pred_comp_mono ~> relcompp_mono
504 pred_comp_distrib ~> relcompp_distrib
505 pred_comp_distrib2 ~> relcompp_distrib2
506 converse_pred_comp ~> converse_relcompp
508 finite_rel_comp ~> finite_relcomp
510 set_rel_comp ~> set_relcomp
514 * Theory Divides: Discontinued redundant theorems about div and mod.
515 INCOMPATIBILITY, use the corresponding generic theorems instead.
517 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
518 zdiv_self ~> div_self
519 zmod_self ~> mod_self
522 zdiv_zmod_equality ~> div_mod_equality2
523 zdiv_zmod_equality2 ~> div_mod_equality
524 zmod_zdiv_trivial ~> mod_div_trivial
525 zdiv_zminus_zminus ~> div_minus_minus
526 zmod_zminus_zminus ~> mod_minus_minus
527 zdiv_zminus2 ~> div_minus_right
528 zmod_zminus2 ~> mod_minus_right
529 zdiv_minus1_right ~> div_minus1_right
530 zmod_minus1_right ~> mod_minus1_right
531 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
532 zmod_zmult1_eq ~> mod_mult_right_eq
533 zpower_zmod ~> power_mod
535 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
536 mod_mult_distrib ~> mult_mod_left
537 mod_mult_distrib2 ~> mult_mod_right
539 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
540 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
542 * Finite_Set.fold now qualified. INCOMPATIBILITY.
544 * Consolidated theorem names concerning fold combinators:
546 inf_INFI_fold_inf ~> inf_INF_fold_inf
547 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
548 INFI_fold_inf ~> INF_fold_inf
549 SUPR_fold_sup ~> SUP_fold_sup
550 union_set ~> union_set_fold
551 minus_set ~> minus_set_fold
552 INFI_set_fold ~> INF_set_fold
553 SUPR_set_fold ~> SUP_set_fold
554 INF_code ~> INF_set_foldr
555 SUP_code ~> SUP_set_foldr
556 foldr.simps ~> foldr.simps (in point-free formulation)
557 foldr_fold_rev ~> foldr_conv_fold
558 foldl_fold ~> foldl_conv_fold
559 foldr_foldr ~> foldr_conv_foldl
560 foldl_foldr ~> foldl_conv_foldr
561 fold_set_remdups ~> fold_set_fold_remdups
562 fold_set ~> fold_set_fold
563 fold1_set ~> fold1_set_fold
567 * Dropped rarely useful theorems concerning fold combinators:
568 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
569 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
570 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
571 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
572 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
573 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
574 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
575 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
576 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
577 unfolding "foldr_conv_fold" and "foldl_conv_fold".
579 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
580 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
581 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
582 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
583 lemmas over fold rather than foldr, or make use of lemmas
584 fold_conv_foldr and fold_rev.
586 * Congruence rules Option.map_cong and Option.bind_cong for recursion
587 through option types.
589 * "Transitive_Closure.ntrancl": bounded transitive closure on
592 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
594 * Theory Int: Discontinued many legacy theorems specific to type int.
595 INCOMPATIBILITY, use the corresponding generic theorems instead.
597 zminus_zminus ~> minus_minus
598 zminus_0 ~> minus_zero
599 zminus_zadd_distrib ~> minus_add_distrib
600 zadd_commute ~> add_commute
601 zadd_assoc ~> add_assoc
602 zadd_left_commute ~> add_left_commute
606 zadd_0_right ~> add_0_right
607 zadd_zminus_inverse2 ~> left_minus
608 zmult_zminus ~> mult_minus_left
609 zmult_commute ~> mult_commute
610 zmult_assoc ~> mult_assoc
611 zadd_zmult_distrib ~> left_distrib
612 zadd_zmult_distrib2 ~> right_distrib
613 zdiff_zmult_distrib ~> left_diff_distrib
614 zdiff_zmult_distrib2 ~> right_diff_distrib
615 zmult_1 ~> mult_1_left
616 zmult_1_right ~> mult_1_right
617 zle_refl ~> order_refl
618 zle_trans ~> order_trans
619 zle_antisym ~> order_antisym
620 zle_linear ~> linorder_linear
621 zless_linear ~> linorder_less_linear
622 zadd_left_mono ~> add_left_mono
623 zadd_strict_right_mono ~> add_strict_right_mono
624 zadd_zless_mono ~> add_less_le_mono
625 int_0_less_1 ~> zero_less_one
626 int_0_neq_1 ~> zero_neq_one
628 zpower_zadd_distrib ~> power_add
629 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
630 zero_le_zpower_abs ~> zero_le_power_abs
632 * Theory Deriv: Renamed
634 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
636 * Theory Library/Multiset: Improved code generation of multisets.
638 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
639 are expressed via type classes again. The special syntax
640 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
641 setsum_set, which is now subsumed by Big_Operators.setsum.
644 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
645 use theory HOL/Library/Nat_Bijection instead.
647 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
648 trees is now inside a type class context. Names of affected
649 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
650 theories working directly with raw red-black trees, adapt the names as
654 bulkload -> rbt_bulkload
655 del_from_left -> rbt_del_from_left
656 del_from_right -> rbt_del_from_right
661 insertw -> rbt_insert_with
662 insert_with_key -> rbt_insert_with_key
663 map_entry -> rbt_map_entry
666 tree_greater -> rbt_greater
667 tree_less -> rbt_less
668 tree_less_symbol -> rbt_less_symbol
670 union_with -> rbt_union_with
671 union_with_key -> rbt_union_with_key
674 balance_left_sorted -> balance_left_rbt_sorted
675 balance_left_tree_greater -> balance_left_rbt_greater
676 balance_left_tree_less -> balance_left_rbt_less
677 balance_right_sorted -> balance_right_rbt_sorted
678 balance_right_tree_greater -> balance_right_rbt_greater
679 balance_right_tree_less -> balance_right_rbt_less
680 balance_sorted -> balance_rbt_sorted
681 balance_tree_greater -> balance_rbt_greater
682 balance_tree_less -> balance_rbt_less
683 bulkload_is_rbt -> rbt_bulkload_is_rbt
684 combine_sorted -> combine_rbt_sorted
685 combine_tree_greater -> combine_rbt_greater
686 combine_tree_less -> combine_rbt_less
687 delete_in_tree -> rbt_delete_in_tree
688 delete_is_rbt -> rbt_delete_is_rbt
689 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
690 del_from_left_tree_less -> rbt_del_from_left_rbt_less
691 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
692 del_from_right_tree_less -> rbt_del_from_right_rbt_less
693 del_in_tree -> rbt_del_in_tree
694 del_inv1_inv2 -> rbt_del_inv1_inv2
695 del_sorted -> rbt_del_rbt_sorted
696 del_tree_greater -> rbt_del_rbt_greater
697 del_tree_less -> rbt_del_rbt_less
698 dom_lookup_Branch -> dom_rbt_lookup_Branch
699 entries_lookup -> entries_rbt_lookup
700 finite_dom_lookup -> finite_dom_rbt_lookup
701 insert_sorted -> rbt_insert_rbt_sorted
702 insertw_is_rbt -> rbt_insertw_is_rbt
703 insertwk_is_rbt -> rbt_insertwk_is_rbt
704 insertwk_sorted -> rbt_insertwk_rbt_sorted
705 insertw_sorted -> rbt_insertw_rbt_sorted
706 ins_sorted -> ins_rbt_sorted
707 ins_tree_greater -> ins_rbt_greater
708 ins_tree_less -> ins_rbt_less
709 is_rbt_sorted -> is_rbt_rbt_sorted
710 lookup_balance -> rbt_lookup_balance
711 lookup_bulkload -> rbt_lookup_rbt_bulkload
712 lookup_delete -> rbt_lookup_rbt_delete
713 lookup_Empty -> rbt_lookup_Empty
714 lookup_from_in_tree -> rbt_lookup_from_in_tree
715 lookup_in_tree -> rbt_lookup_in_tree
716 lookup_ins -> rbt_lookup_ins
717 lookup_insert -> rbt_lookup_rbt_insert
718 lookup_insertw -> rbt_lookup_rbt_insertw
719 lookup_insertwk -> rbt_lookup_rbt_insertwk
720 lookup_keys -> rbt_lookup_keys
721 lookup_map -> rbt_lookup_map
722 lookup_map_entry -> rbt_lookup_rbt_map_entry
723 lookup_tree_greater -> rbt_lookup_rbt_greater
724 lookup_tree_less -> rbt_lookup_rbt_less
725 lookup_union -> rbt_lookup_rbt_union
726 map_entry_color_of -> rbt_map_entry_color_of
727 map_entry_inv1 -> rbt_map_entry_inv1
728 map_entry_inv2 -> rbt_map_entry_inv2
729 map_entry_is_rbt -> rbt_map_entry_is_rbt
730 map_entry_sorted -> rbt_map_entry_rbt_sorted
731 map_entry_tree_greater -> rbt_map_entry_rbt_greater
732 map_entry_tree_less -> rbt_map_entry_rbt_less
733 map_tree_greater -> map_rbt_greater
734 map_tree_less -> map_rbt_less
735 map_sorted -> map_rbt_sorted
736 paint_sorted -> paint_rbt_sorted
737 paint_lookup -> paint_rbt_lookup
738 paint_tree_greater -> paint_rbt_greater
739 paint_tree_less -> paint_rbt_less
740 sorted_entries -> rbt_sorted_entries
741 tree_greater_eq_trans -> rbt_greater_eq_trans
742 tree_greater_nit -> rbt_greater_nit
743 tree_greater_prop -> rbt_greater_prop
744 tree_greater_simps -> rbt_greater_simps
745 tree_greater_trans -> rbt_greater_trans
746 tree_less_eq_trans -> rbt_less_eq_trans
747 tree_less_nit -> rbt_less_nit
748 tree_less_prop -> rbt_less_prop
749 tree_less_simps -> rbt_less_simps
750 tree_less_trans -> rbt_less_trans
751 tree_ord_props -> rbt_ord_props
752 union_Branch -> rbt_union_Branch
753 union_is_rbt -> rbt_union_is_rbt
754 unionw_is_rbt -> rbt_unionw_is_rbt
755 unionwk_is_rbt -> rbt_unionwk_is_rbt
756 unionwk_sorted -> rbt_unionwk_rbt_sorted
758 * Theory HOL/Library/Float: Floating point numbers are now defined as
759 a subset of the real numbers. All operations are defined using the
760 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
767 round_down -> float_round_down
768 round_up -> float_round_up
772 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
775 abs_float_def -> Float.compute_float_abs
776 bitlen_ge0 -> bitlen_nonneg
777 bitlen.simps -> Float.compute_bitlen
778 float_components -> Float_mantissa_exponent
779 float_divl.simps -> Float.compute_float_divl
780 float_divr.simps -> Float.compute_float_divr
781 float_eq_odd -> mult_powr_eq_mult_powr_iff
782 float_power -> real_of_float_power
783 lapprox_posrat_def -> Float.compute_lapprox_posrat
784 lapprox_rat.simps -> Float.compute_lapprox_rat
785 le_float_def' -> Float.compute_float_le
786 le_float_def -> less_eq_float.rep_eq
787 less_float_def' -> Float.compute_float_less
788 less_float_def -> less_float.rep_eq
789 normfloat_def -> Float.compute_normfloat
790 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
791 normfloat -> normfloat_def
792 normfloat_unique -> use normfloat_def
793 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
794 one_float_def -> Float.compute_float_one
795 plus_float_def -> Float.compute_float_plus
796 rapprox_posrat_def -> Float.compute_rapprox_posrat
797 rapprox_rat.simps -> Float.compute_rapprox_rat
798 real_of_float_0 -> zero_float.rep_eq
799 real_of_float_1 -> one_float.rep_eq
800 real_of_float_abs -> abs_float.rep_eq
801 real_of_float_add -> plus_float.rep_eq
802 real_of_float_minus -> uminus_float.rep_eq
803 real_of_float_mult -> times_float.rep_eq
804 real_of_float_simp -> Float.rep_eq
805 real_of_float_sub -> minus_float.rep_eq
806 round_down.simps -> Float.compute_float_round_down
807 round_up.simps -> Float.compute_float_round_up
808 times_float_def -> Float.compute_float_times
809 uminus_float_def -> Float.compute_float_uminus
810 zero_float_def -> Float.compute_float_zero
812 Lemmas not necessary anymore, use the transfer method:
813 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
814 float_divr, float_le_simp, float_less1_mantissa_bound,
815 float_less_simp, float_less_zero, float_le_zero,
816 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
817 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
818 lapprox_rat_bottom, normalized_float, rapprox_posrat,
819 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
820 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
821 round_up, zero_le_float, zero_less_float
823 * New theory HOL/Library/DAList provides an abstract type for
824 association lists with distinct keys.
826 * Session HOL/IMP: Added new theory of abstract interpretation of
829 * Session HOL-Import: Re-implementation from scratch is faster,
830 simpler, and more scalable. Requires a proof bundle, which is
831 available as an external component. Discontinued old (and mostly
832 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
834 * Session HOL-Word: Discontinued many redundant theorems specific to
835 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
838 word_sub_alt ~> word_sub_wi
839 word_add_alt ~> word_add_def
840 word_mult_alt ~> word_mult_def
841 word_minus_alt ~> word_minus_def
842 word_0_alt ~> word_0_wi
843 word_1_alt ~> word_1_wi
844 word_add_0 ~> add_0_left
845 word_add_0_right ~> add_0_right
846 word_mult_1 ~> mult_1_left
847 word_mult_1_right ~> mult_1_right
848 word_add_commute ~> add_commute
849 word_add_assoc ~> add_assoc
850 word_add_left_commute ~> add_left_commute
851 word_mult_commute ~> mult_commute
852 word_mult_assoc ~> mult_assoc
853 word_mult_left_commute ~> mult_left_commute
854 word_left_distrib ~> left_distrib
855 word_right_distrib ~> right_distrib
856 word_left_minus ~> left_minus
857 word_diff_0_right ~> diff_0_right
858 word_diff_self ~> diff_self
859 word_sub_def ~> diff_minus
860 word_diff_minus ~> diff_minus
861 word_add_ac ~> add_ac
862 word_mult_ac ~> mult_ac
863 word_plus_ac0 ~> add_0_left add_0_right add_ac
864 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
865 word_order_trans ~> order_trans
866 word_order_refl ~> order_refl
867 word_order_antisym ~> order_antisym
868 word_order_linear ~> linorder_linear
869 lenw1_zero_neq_one ~> zero_neq_one
870 word_number_of_eq ~> number_of_eq
871 word_of_int_add_hom ~> wi_hom_add
872 word_of_int_sub_hom ~> wi_hom_sub
873 word_of_int_mult_hom ~> wi_hom_mult
874 word_of_int_minus_hom ~> wi_hom_neg
875 word_of_int_succ_hom ~> wi_hom_succ
876 word_of_int_pred_hom ~> wi_hom_pred
877 word_of_int_0_hom ~> word_0_wi
878 word_of_int_1_hom ~> word_1_wi
880 * Session HOL-Word: New proof method "word_bitwise" for splitting
881 machine word equalities and inequalities into logical circuits,
882 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
883 multiplication, shifting by constants, bitwise operators and numeric
884 constants. Requires fixed-length word types, not 'a word. Solves
885 many standard word identities outright and converts more into first
886 order problems amenable to blast or similar. See also examples in
887 HOL/Word/Examples/WordExamples.thy.
889 * Session HOL-Probability: Introduced the type "'a measure" to
890 represent measures, this replaces the records 'a algebra and 'a
891 measure_space. The locales based on subset_class now have two
892 locale-parameters the space \<Omega> and the set of measurable sets M.
893 The product of probability spaces uses now the same constant as the
894 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
895 measure". Most constants are defined now outside of locales and gain
896 an additional parameter, like null_sets, almost_eventually or \<mu>'.
897 Measure space constructions for distributions and densities now got
898 their own constants distr and density. Instead of using locales to
899 describe measure spaces with a finite space, the measure count_space
900 and point_measure is introduced. INCOMPATIBILITY.
904 finite_measure.\<mu>' -> measure
905 product_algebra_generator -> prod_algebra
906 product_prob_space.emb -> prod_emb
907 product_prob_space.infprod_algebra -> PiM
910 completeable_measure_space
913 finite_product_finite_prob_space
914 finite_product_sigma_algebra
917 pair_finite_prob_space
918 pair_finite_sigma_algebra
921 product_sigma_algebra
925 distribution -> use distr measure, or distributed predicate
927 joint_distribution -> use distr measure, or distributed predicate
928 pair_measure_generator
929 product_prob_space.infprod_algebra -> use PiM
932 Replacement theorems:
933 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
934 finite_measure.empty_measure -> measure_empty
935 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
936 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
937 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
938 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
939 finite_measure.finite_measure -> finite_measure.emeasure_finite
940 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
941 finite_measure.positive_measure' -> measure_nonneg
942 finite_measure.real_measure -> finite_measure.emeasure_real
943 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
944 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
945 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
946 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
947 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
948 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
949 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
950 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
951 information_space.entropy_commute -> information_space.entropy_commute_simple
952 information_space.entropy_eq -> information_space.entropy_simple_distributed
953 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
954 information_space.entropy_positive -> information_space.entropy_nonneg_simple
955 information_space.entropy_uniform_max -> information_space.entropy_uniform
956 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
957 information_space.KL_eq_0 -> information_space.KL_same_eq_0
958 information_space.KL_ge_0 -> information_space.KL_nonneg
959 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
960 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
961 Int_stable_cuboids -> Int_stable_atLeastAtMost
962 Int_stable_product_algebra_generator -> positive_integral
963 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
964 measure_space.additive -> emeasure_additive
965 measure_space.AE_iff_null_set -> AE_iff_null
966 measure_space.almost_everywhere_def -> eventually_ae_filter
967 measure_space.almost_everywhere_vimage -> AE_distrD
968 measure_space.continuity_from_above -> INF_emeasure_decseq
969 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
970 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
971 measure_space.continuity_from_below -> SUP_emeasure_incseq
972 measure_space_density -> emeasure_density
973 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
974 measure_space.integrable_vimage -> integrable_distr
975 measure_space.integral_translated_density -> integral_density
976 measure_space.integral_vimage -> integral_distr
977 measure_space.measure_additive -> plus_emeasure
978 measure_space.measure_compl -> emeasure_compl
979 measure_space.measure_countable_increasing -> emeasure_countable_increasing
980 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
981 measure_space.measure_decseq -> decseq_emeasure
982 measure_space.measure_Diff -> emeasure_Diff
983 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
984 measure_space.measure_eq_0 -> emeasure_eq_0
985 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
986 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
987 measure_space.measure_incseq -> incseq_emeasure
988 measure_space.measure_insert -> emeasure_insert
989 measure_space.measure_mono -> emeasure_mono
990 measure_space.measure_not_negative -> emeasure_not_MInf
991 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
992 measure_space.measure_setsum -> setsum_emeasure
993 measure_space.measure_setsum_split -> setsum_emeasure_cover
994 measure_space.measure_space_vimage -> emeasure_distr
995 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
996 measure_space.measure_subadditive -> subadditive
997 measure_space.measure_top -> emeasure_space
998 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
999 measure_space.measure_Un_null_set -> emeasure_Un_null_set
1000 measure_space.positive_integral_translated_density -> positive_integral_density
1001 measure_space.positive_integral_vimage -> positive_integral_distr
1002 measure_space.real_continuity_from_above -> Lim_measure_decseq
1003 measure_space.real_continuity_from_below -> Lim_measure_incseq
1004 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
1005 measure_space.real_measure_Diff -> measure_Diff
1006 measure_space.real_measure_finite_Union -> measure_finite_Union
1007 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
1008 measure_space.real_measure_subadditive -> measure_subadditive
1009 measure_space.real_measure_Union -> measure_Union
1010 measure_space.real_measure_UNION -> measure_UNION
1011 measure_space.simple_function_vimage -> simple_function_comp
1012 measure_space.simple_integral_vimage -> simple_integral_distr
1013 measure_space.simple_integral_vimage -> simple_integral_distr
1014 measure_unique_Int_stable -> measure_eqI_generator_eq
1015 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
1016 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
1017 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
1018 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
1019 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
1020 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
1021 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
1022 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
1023 pair_sigma_algebra.sets_swap -> sets_pair_swap
1024 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
1025 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
1026 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
1027 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
1028 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
1029 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
1030 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
1031 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
1032 prob_space.measure_space_1 -> prob_space.emeasure_space_1
1033 prob_space.prob_space_vimage -> prob_space_distr
1034 prob_space.random_variable_restrict -> measurable_restrict
1035 prob_space_unique_Int_stable -> measure_eqI_prob_space
1036 product_algebraE -> prod_algebraE_all
1037 product_algebra_generator_der -> prod_algebra_eq_finite
1038 product_algebra_generator_into_space -> prod_algebra_sets_into_space
1039 product_algebraI -> sets_PiM_I_finite
1040 product_measure_exists -> product_sigma_finite.sigma_finite
1041 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
1042 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
1043 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
1044 product_prob_space.measurable_component -> measurable_component_singleton
1045 product_prob_space.measurable_emb -> measurable_prod_emb
1046 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
1047 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
1048 product_prob_space.measure_emb -> emeasure_prod_emb
1049 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
1050 product_sigma_algebra.product_algebra_into_space -> space_closed
1051 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
1052 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
1053 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
1054 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
1055 sets_product_algebra -> sets_PiM
1056 sigma_algebra.measurable_sigma -> measurable_measure_of
1057 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
1058 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
1059 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
1060 space_product_algebra -> space_PiM
1062 * Session HOL-TPTP: support to parse and import TPTP problems (all
1063 languages) into Isabelle/HOL.
1068 * New "case_product" attribute (see HOL).
1073 * Greater support for structured proofs involving induction or case
1076 * Much greater use of mathematical symbols.
1078 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1083 * Antiquotation @{keyword "name"} produces a parser for outer syntax
1084 from a minor keyword introduced via theory header declaration.
1086 * Antiquotation @{command_spec "name"} produces the
1087 Outer_Syntax.command_spec from a major keyword introduced via theory
1088 header declaration; it can be passed to Outer_Syntax.command etc.
1090 * Local_Theory.define no longer hard-wires default theorem name
1091 "foo_def", but retains the binding as given. If that is Binding.empty
1092 / Attrib.empty_binding, the result is not registered as user-level
1093 fact. The Local_Theory.define_internal variant allows to specify a
1094 non-empty name (used for the foundation in the background theory),
1095 while omitting the fact binding in the user-context. Potential
1096 INCOMPATIBILITY for derived definitional packages: need to specify
1097 naming policy for primitive definitions more explicitly.
1099 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
1100 conformance with similar operations in structure Term and Logic.
1102 * Antiquotation @{attributes [...]} embeds attribute source
1103 representation into the ML text, which is particularly useful with
1104 declarations like Local_Theory.note.
1106 * Structure Proof_Context follows standard naming scheme. Old
1107 ProofContext has been discontinued. INCOMPATIBILITY.
1109 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
1110 change of semantics: update is applied to auxiliary local theory
1113 * Modernized some old-style infix operations:
1115 addeqcongs ~> Simplifier.add_eqcong
1116 deleqcongs ~> Simplifier.del_eqcong
1117 addcongs ~> Simplifier.add_cong
1118 delcongs ~> Simplifier.del_cong
1119 setmksimps ~> Simplifier.set_mksimps
1120 setmkcong ~> Simplifier.set_mkcong
1121 setmksym ~> Simplifier.set_mksym
1122 setmkeqTrue ~> Simplifier.set_mkeqTrue
1123 settermless ~> Simplifier.set_termless
1124 setsubgoaler ~> Simplifier.set_subgoaler
1125 addsplits ~> Splitter.add_split
1126 delsplits ~> Splitter.del_split
1131 * USER_HOME settings variable points to cross-platform user home
1132 directory, which coincides with HOME on POSIX systems only. Likewise,
1133 the Isabelle path specification "~" now expands to $USER_HOME, instead
1134 of former $HOME. A different default for USER_HOME may be set
1135 explicitly in shell environment, before Isabelle settings are
1136 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
1137 the generic user home was intended.
1139 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
1140 notation, which is useful for the jEdit file browser, for example.
1142 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
1147 New in Isabelle2011-1 (October 2011)
1148 ------------------------------------
1152 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
1153 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
1155 - Management of multiple theory files directly from the editor
1156 buffer store -- bypassing the file-system (no requirement to save
1157 files for checking).
1159 - Markup of formal entities within the text buffer, with semantic
1160 highlighting, tooltips and hyperlinks to jump to defining source
1163 - Improved text rendering, with sub/superscripts in the source
1164 buffer (including support for copy/paste wrt. output panel, HTML
1165 theory output and other non-Isabelle text boxes).
1167 - Refined scheduling of proof checking and printing of results,
1168 based on interactive editor view. (Note: jEdit folding and
1169 narrowing allows to restrict buffer perspectives explicitly.)
1171 - Reduced CPU performance requirements, usable on machines with few
1174 - Reduced memory requirements due to pruning of unused document
1175 versions (garbage collection).
1177 See also ~~/src/Tools/jEdit/README.html for further information,
1178 including some remaining limitations.
1180 * Theory loader: source files are exclusively located via the master
1181 directory of each theory node (where the .thy file itself resides).
1182 The global load path (such as src/HOL/Library) has been discontinued.
1183 Note that the path element ~~ may be used to reference theories in the
1184 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
1187 * Theory loader: source files are identified by content via SHA1
1188 digests. Discontinued former path/modtime identification and optional
1189 ISABELLE_FILE_IDENT plugin scripts.
1191 * Parallelization of nested Isar proofs is subject to
1192 Goal.parallel_proofs_threshold (default 100). See also isabelle
1195 * Name space: former unsynchronized references are now proper
1196 configuration options, with more conventional names:
1198 long_names ~> names_long
1199 short_names ~> names_short
1200 unique_names ~> names_unique
1202 Minor INCOMPATIBILITY, need to declare options in context like this:
1204 declare [[names_unique = false]]
1206 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
1207 that the result needs to be unique, which means fact specifications
1208 may have to be refined after enriching a proof context.
1210 * Attribute "case_names" has been refined: the assumptions in each case
1211 can be named now by following the case name with [name1 name2 ...].
1213 * Isabelle/Isar reference manual has been updated and extended:
1214 - "Synopsis" provides a catalog of main Isar language concepts.
1215 - Formal references in syntax diagrams, via @{rail} antiquotation.
1216 - Updated material from classic "ref" manual, notably about
1217 "Classical Reasoner".
1222 * Class bot and top require underlying partial order rather than
1223 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
1225 * Class complete_lattice: generalized a couple of lemmas from sets;
1226 generalized theorems INF_cong and SUP_cong. New type classes for
1227 complete boolean algebras and complete linear orders. Lemmas
1228 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
1229 class complete_linorder.
1231 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
1232 Sup_fun_def, Inf_apply, Sup_apply.
1234 Removed redundant lemmas (the right hand side gives hints how to
1235 replace them for (metis ...), or (simp only: ...) proofs):
1237 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
1238 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
1239 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
1240 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
1241 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
1242 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
1243 Inter_def ~> INF_def, image_def
1244 Union_def ~> SUP_def, image_def
1245 INT_eq ~> INF_def, and image_def
1246 UN_eq ~> SUP_def, and image_def
1247 INF_subset ~> INF_superset_mono [OF _ order_refl]
1249 More consistent and comprehensive names:
1251 INTER_eq_Inter_image ~> INF_def
1252 UNION_eq_Union_image ~> SUP_def
1255 INF_leI ~> INF_lower
1256 INF_leI2 ~> INF_lower2
1257 le_INFI ~> INF_greatest
1258 le_SUPI ~> SUP_upper
1259 le_SUPI2 ~> SUP_upper2
1260 SUP_leI ~> SUP_least
1261 INFI_bool_eq ~> INF_bool_eq
1262 SUPR_bool_eq ~> SUP_bool_eq
1263 INFI_apply ~> INF_apply
1264 SUPR_apply ~> SUP_apply
1265 INTER_def ~> INTER_eq
1266 UNION_def ~> UNION_eq
1270 * Renamed theory Complete_Lattice to Complete_Lattices.
1273 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
1274 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
1275 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
1276 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
1278 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
1279 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
1280 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
1283 * Added syntactic classes "inf" and "sup" for the respective
1284 constants. INCOMPATIBILITY: Changes in the argument order of the
1285 (mostly internal) locale predicates for some derived classes.
1287 * Theorem collections ball_simps and bex_simps do not contain theorems
1288 referring to UNION any longer; these have been moved to collection
1289 UN_ball_bex_simps. INCOMPATIBILITY.
1291 * Theory Archimedean_Field: floor now is defined as parameter of a
1292 separate type class floor_ceiling.
1294 * Theory Finite_Set: more coherent development of fold_set locales:
1296 locale fun_left_comm ~> locale comp_fun_commute
1297 locale fun_left_comm_idem ~> locale comp_fun_idem
1299 Both use point-free characterization; interpretation proofs may need
1300 adjustment. INCOMPATIBILITY.
1302 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
1303 accordance with standard mathematical terminology. INCOMPATIBILITY.
1305 * Theory Complex_Main: The locale interpretations for the
1306 bounded_linear and bounded_bilinear locales have been removed, in
1307 order to reduce the number of duplicate lemmas. Users must use the
1308 original names for distributivity theorems, potential INCOMPATIBILITY.
1310 divide.add ~> add_divide_distrib
1311 divide.diff ~> diff_divide_distrib
1312 divide.setsum ~> setsum_divide_distrib
1313 mult.add_right ~> right_distrib
1314 mult.diff_right ~> right_diff_distrib
1315 mult_right.setsum ~> setsum_right_distrib
1316 mult_left.diff ~> left_diff_distrib
1318 * Theory Complex_Main: Several redundant theorems have been removed or
1319 replaced by more general versions. INCOMPATIBILITY.
1321 real_diff_def ~> minus_real_def
1322 real_divide_def ~> divide_real_def
1323 real_less_def ~> less_le
1324 real_abs_def ~> abs_real_def
1325 real_sgn_def ~> sgn_real_def
1326 real_mult_commute ~> mult_commute
1327 real_mult_assoc ~> mult_assoc
1328 real_mult_1 ~> mult_1_left
1329 real_add_mult_distrib ~> left_distrib
1330 real_zero_not_eq_one ~> zero_neq_one
1331 real_mult_inverse_left ~> left_inverse
1332 INVERSE_ZERO ~> inverse_zero
1333 real_le_refl ~> order_refl
1334 real_le_antisym ~> order_antisym
1335 real_le_trans ~> order_trans
1336 real_le_linear ~> linear
1337 real_le_eq_diff ~> le_iff_diff_le_0
1338 real_add_left_mono ~> add_left_mono
1339 real_mult_order ~> mult_pos_pos
1340 real_mult_less_mono2 ~> mult_strict_left_mono
1341 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
1342 real_0_le_divide_iff ~> zero_le_divide_iff
1343 realpow_two_disj ~> power2_eq_iff
1344 real_squared_diff_one_factored ~> square_diff_one_factored
1345 realpow_two_diff ~> square_diff_square_factored
1346 reals_complete2 ~> complete_real
1347 real_sum_squared_expand ~> power2_sum
1348 exp_ln_eq ~> ln_unique
1350 expi_zero ~> exp_zero
1351 lemma_DERIV_subst ~> DERIV_cong
1352 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
1353 LIMSEQ_const ~> tendsto_const
1354 LIMSEQ_norm ~> tendsto_norm
1355 LIMSEQ_add ~> tendsto_add
1356 LIMSEQ_minus ~> tendsto_minus
1357 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
1358 LIMSEQ_diff ~> tendsto_diff
1359 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
1360 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
1361 LIMSEQ_mult ~> tendsto_mult
1362 LIMSEQ_inverse ~> tendsto_inverse
1363 LIMSEQ_divide ~> tendsto_divide
1364 LIMSEQ_pow ~> tendsto_power
1365 LIMSEQ_setsum ~> tendsto_setsum
1366 LIMSEQ_setprod ~> tendsto_setprod
1367 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
1368 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
1369 LIMSEQ_imp_rabs ~> tendsto_rabs
1370 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
1371 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
1372 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
1373 LIMSEQ_Complex ~> tendsto_Complex
1374 LIM_ident ~> tendsto_ident_at
1375 LIM_const ~> tendsto_const
1376 LIM_add ~> tendsto_add
1377 LIM_add_zero ~> tendsto_add_zero
1378 LIM_minus ~> tendsto_minus
1379 LIM_diff ~> tendsto_diff
1380 LIM_norm ~> tendsto_norm
1381 LIM_norm_zero ~> tendsto_norm_zero
1382 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
1383 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
1384 LIM_rabs ~> tendsto_rabs
1385 LIM_rabs_zero ~> tendsto_rabs_zero
1386 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
1387 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
1388 LIM_compose ~> tendsto_compose
1389 LIM_mult ~> tendsto_mult
1390 LIM_scaleR ~> tendsto_scaleR
1391 LIM_of_real ~> tendsto_of_real
1392 LIM_power ~> tendsto_power
1393 LIM_inverse ~> tendsto_inverse
1394 LIM_sgn ~> tendsto_sgn
1395 isCont_LIM_compose ~> isCont_tendsto_compose
1396 bounded_linear.LIM ~> bounded_linear.tendsto
1397 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
1398 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
1399 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
1400 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
1401 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
1402 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
1404 * Theory Complex_Main: The definition of infinite series was
1405 generalized. Now it is defined on the type class {topological_space,
1406 comm_monoid_add}. Hence it is useable also for extended real numbers.
1408 * Theory Complex_Main: The complex exponential function "expi" is now
1409 a type-constrained abbreviation for "exp :: complex => complex"; thus
1410 several polymorphic lemmas about "exp" are now applicable to "expi".
1414 - Theory Library/Code_Char_ord provides native ordering of
1415 characters in the target language.
1417 - Commands code_module and code_library are legacy, use export_code
1420 - Method "evaluation" is legacy, use method "eval" instead.
1422 - Legacy evaluator "SML" is deactivated by default. May be
1423 reactivated by the following theory command:
1425 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
1427 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
1429 * New proof method "induction" that gives induction hypotheses the
1430 name "IH", thus distinguishing them from further hypotheses that come
1431 from rule induction. The latter are still called "hyps". Method
1432 "induction" is a thin wrapper around "induct" and follows the same
1435 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
1436 still available as a legacy feature for some time.
1439 - Added "need" and "total_consts" options.
1440 - Reintroduced "show_skolems" option by popular demand.
1441 - Renamed attribute: nitpick_def ~> nitpick_unfold.
1445 - Use quasi-sound (and efficient) translations by default.
1446 - Added support for the following provers: E-ToFoF, LEO-II,
1447 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
1448 - Automatically preplay and minimize proofs before showing them if
1449 this can be done within reasonable time.
1450 - sledgehammer available_provers ~> sledgehammer supported_provers.
1452 - Added "preplay_timeout", "slicing", "type_enc", "sound",
1453 "max_mono_iters", and "max_new_mono_instances" options.
1454 - Removed "explicit_apply" and "full_types" options as well as "Full
1455 Types" Proof General menu item. INCOMPATIBILITY.
1458 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
1459 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
1463 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
1464 "elim:" options. INCOMPATIBILITY.
1465 - Introduced 'try' that not only runs 'try_methods' but also
1466 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
1469 - Added "eval" option to evaluate terms for the found counterexample
1470 (currently only supported by the default (exhaustive) tester).
1471 - Added post-processing of terms to obtain readable counterexamples
1472 (currently only supported by the default (exhaustive) tester).
1473 - New counterexample generator quickcheck[narrowing] enables
1474 narrowing-based testing. Requires the Glasgow Haskell compiler
1475 with its installation location defined in the Isabelle settings
1476 environment as ISABELLE_GHC.
1477 - Removed quickcheck tester "SML" based on the SML code generator
1478 (formly in HOL/Library).
1480 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
1481 use 'partial_function' instead.
1483 * Theory Library/Extended_Reals replaces now the positive extended
1484 reals found in probability theory. This file is extended by
1485 Multivariate_Analysis/Extended_Real_Limits.
1487 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
1488 from where it must be imported explicitly if it is really required.
1491 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
1492 been moved here. INCOMPATIBILITY.
1494 * Theory Library/Saturated provides type of numbers with saturated
1497 * Theory Library/Product_Lattice defines a pointwise ordering for the
1498 product type 'a * 'b, and provides instance proofs for various order
1499 and lattice type classes.
1501 * Theory Library/Countable now provides the "countable_datatype" proof
1502 method for proving "countable" class instances for datatypes.
1504 * Theory Library/Cset_Monad allows do notation for computable sets
1505 (cset) via the generic monad ad-hoc overloading facility.
1507 * Library: Theories of common data structures are split into theories
1508 for implementation, an invariant-ensuring type, and connection to an
1509 abstract type. INCOMPATIBILITY.
1511 - RBT is split into RBT and RBT_Mapping.
1512 - AssocList is split and renamed into AList and AList_Mapping.
1513 - DList is split into DList_Impl, DList, and DList_Cset.
1514 - Cset is split into Cset and List_Cset.
1516 * Theory Library/Nat_Infinity has been renamed to
1517 Library/Extended_Nat, with name changes of the following types and
1520 type inat ~> type enat
1522 Infty ~> infinity (overloaded)
1526 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
1527 been renamed accordingly. INCOMPATIBILITY.
1529 * Session Multivariate_Analysis: The euclidean_space type class now
1530 fixes a constant "Basis :: 'a set" consisting of the standard
1531 orthonormal basis for the type. Users now have the option of
1532 quantifying over this set instead of using the "basis" function, e.g.
1533 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
1535 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
1536 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
1537 "Cart_nth" and "Cart_lambda" have been respectively renamed to
1538 "vec_nth" and "vec_lambda"; theorems mentioning those names have
1539 changed to match. Definition theorems for overloaded constants now use
1540 the standard "foo_vec_def" naming scheme. A few other theorems have
1541 been renamed as follows (INCOMPATIBILITY):
1543 Cart_eq ~> vec_eq_iff
1544 dist_nth_le_cart ~> dist_vec_nth_le
1545 tendsto_vector ~> vec_tendstoI
1546 Cauchy_vector ~> vec_CauchyI
1548 * Session Multivariate_Analysis: Several duplicate theorems have been
1549 removed, and other theorems have been renamed or replaced with more
1550 general versions. INCOMPATIBILITY.
1552 finite_choice ~> finite_set_choice
1553 eventually_conjI ~> eventually_conj
1554 eventually_and ~> eventually_conj_iff
1555 eventually_false ~> eventually_False
1556 setsum_norm ~> norm_setsum
1557 Lim_sequentially ~> LIMSEQ_def
1558 Lim_ident_at ~> LIM_ident
1559 Lim_const ~> tendsto_const
1560 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
1561 Lim_neg ~> tendsto_minus
1562 Lim_add ~> tendsto_add
1563 Lim_sub ~> tendsto_diff
1564 Lim_mul ~> tendsto_scaleR
1565 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
1566 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
1567 Lim_linear ~> bounded_linear.tendsto
1568 Lim_component ~> tendsto_euclidean_component
1569 Lim_component_cart ~> tendsto_vec_nth
1570 Lim_inner ~> tendsto_inner [OF tendsto_const]
1571 dot_lsum ~> inner_setsum_left
1572 dot_rsum ~> inner_setsum_right
1573 continuous_cmul ~> continuous_scaleR [OF continuous_const]
1574 continuous_neg ~> continuous_minus
1575 continuous_sub ~> continuous_diff
1576 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
1577 continuous_mul ~> continuous_scaleR
1578 continuous_inv ~> continuous_inverse
1579 continuous_at_within_inv ~> continuous_at_within_inverse
1580 continuous_at_inv ~> continuous_at_inverse
1581 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
1582 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
1583 continuous_at_component ~> continuous_component [OF continuous_at_id]
1584 continuous_on_neg ~> continuous_on_minus
1585 continuous_on_sub ~> continuous_on_diff
1586 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
1587 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
1588 continuous_on_mul ~> continuous_on_scaleR
1589 continuous_on_mul_real ~> continuous_on_mult
1590 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
1591 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
1592 continuous_on_inverse ~> continuous_on_inv
1593 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
1594 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
1595 subset_interior ~> interior_mono
1596 subset_closure ~> closure_mono
1597 closure_univ ~> closure_UNIV
1598 real_arch_lt ~> reals_Archimedean2
1599 real_arch ~> reals_Archimedean3
1600 real_abs_norm ~> abs_norm_cancel
1601 real_abs_sub_norm ~> norm_triangle_ineq3
1602 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
1604 * Session HOL-Probability:
1605 - Caratheodory's extension lemma is now proved for ring_of_sets.
1606 - Infinite products of probability measures are now available.
1607 - Sigma closure is independent, if the generator is independent
1608 - Use extended reals instead of positive extended
1609 reals. INCOMPATIBILITY.
1611 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
1613 expand_fun_below ~> fun_below_iff
1614 below_fun_ext ~> fun_belowI
1615 expand_cfun_eq ~> cfun_eq_iff
1616 ext_cfun ~> cfun_eqI
1617 expand_cfun_below ~> cfun_below_iff
1618 below_cfun_ext ~> cfun_belowI
1619 monofun_fun_fun ~> fun_belowD
1620 monofun_fun_arg ~> monofunE
1621 monofun_lub_fun ~> adm_monofun [THEN admD]
1622 cont_lub_fun ~> adm_cont [THEN admD]
1623 cont2cont_Rep_CFun ~> cont2cont_APP
1624 cont_Rep_CFun_app ~> cont_APP_app
1625 cont_Rep_CFun_app_app ~> cont_APP_app_app
1626 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
1627 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
1628 contlub_cfun ~> lub_APP [symmetric]
1629 contlub_LAM ~> lub_LAM [symmetric]
1632 lift_distinct1 ~> lift.distinct(1)
1633 lift_distinct2 ~> lift.distinct(2)
1634 Def_not_UU ~> lift.distinct(2)
1635 Def_inject ~> lift.inject
1636 below_UU_iff ~> below_bottom_iff
1637 eq_UU_iff ~> eq_bottom_iff
1640 *** Document preparation ***
1642 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
1643 isar-ref manual, both for description and actual application of the
1646 * Antiquotation @{value} evaluates the given term and presents its
1649 * Antiquotations: term style "isub" provides ad-hoc conversion of
1650 variables x1, y23 into subscripted form x\<^isub>1,
1651 y\<^isub>2\<^isub>3.
1653 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
1654 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
1656 * Localized \isabellestyle switch can be used within blocks or groups
1659 \isabellestyle{it} %preferred default
1660 {\isabellestylett @{text "typewriter stuff"}}
1662 * Discontinued special treatment of hard tabulators. Implicit
1663 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
1669 * The inner syntax of sort/type/term/prop supports inlined YXML
1670 representations within quoted string tokens. By encoding logical
1671 entities via Term_XML (in ML or Scala) concrete syntax can be
1672 bypassed, which is particularly useful for producing bits of text
1673 under external program control.
1675 * Antiquotations for ML and document preparation are managed as theory
1676 data, which requires explicit setup.
1678 * Isabelle_Process.is_active allows tools to check if the official
1679 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
1680 (better known as Proof General).
1682 * Structure Proof_Context follows standard naming scheme. Old
1683 ProofContext is still available for some time as legacy alias.
1685 * Structure Timing provides various operations for timing; supersedes
1686 former start_timing/end_timing etc.
1688 * Path.print is the official way to show file-system paths to users
1689 (including quotes etc.).
1691 * Inner syntax: identifiers in parse trees of generic categories
1692 "logic", "aprop", "idt" etc. carry position information (disguised as
1693 type constraints). Occasional INCOMPATIBILITY with non-compliant
1694 translations that choke on unexpected type constraints. Positions can
1695 be stripped in ML translations via Syntax.strip_positions /
1696 Syntax.strip_positions_ast, or via the syntax constant
1697 "_strip_positions" within parse trees. As last resort, positions can
1698 be disabled via the configuration option Syntax.positions, which is
1699 called "syntax_positions" in Isar attribute syntax.
1701 * Discontinued special status of various ML structures that contribute
1702 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
1703 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
1704 refer directly to Ast.Constant, Lexicon.is_identifier,
1705 Syntax_Trans.mk_binder_tr etc.
1707 * Typed print translation: discontinued show_sorts argument, which is
1708 already available via context of "advanced" translation.
1710 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
1711 goal states; body tactic needs to address all subgoals uniformly.
1713 * Slightly more special eq_list/eq_set, with shortcut involving
1714 pointer equality (assumes that eq relation is reflexive).
1716 * Classical tactics use proper Proof.context instead of historic types
1717 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
1718 operate directly on Proof.context. Raw type claset retains its use as
1719 snapshot of the classical context, which can be recovered via
1720 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
1721 INCOMPATIBILITY, classical tactics and derived proof methods require
1722 proper Proof.context.
1727 * Discontinued support for Poly/ML 5.2, which was the last version
1728 without proper multithreading and TimeLimit implementation.
1730 * Discontinued old lib/scripts/polyml-platform, which has been
1731 obsolete since Isabelle2009-2.
1733 * Various optional external tools are referenced more robustly and
1734 uniformly by explicit Isabelle settings as follows:
1736 ISABELLE_CSDP (formerly CSDP_EXE)
1737 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
1738 ISABELLE_OCAML (formerly EXEC_OCAML)
1739 ISABELLE_SWIPL (formerly EXEC_SWIPL)
1740 ISABELLE_YAP (formerly EXEC_YAP)
1742 Note that automated detection from the file-system or search path has
1743 been discontinued. INCOMPATIBILITY.
1745 * Scala layer provides JVM method invocation service for static
1746 methods of type (String)String, see Invoke_Scala.method in ML. For
1749 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
1751 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
1752 this allows to pass structured values between ML and Scala.
1754 * The IsabelleText fonts includes some further glyphs to support the
1755 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
1756 installed a local copy (which is normally *not* required) need to
1757 delete or update it from ~~/lib/fonts/.
1761 New in Isabelle2011 (January 2011)
1762 ----------------------------------
1766 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
1767 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
1768 useful tooltips and hyperlinks produced from its static analysis. The
1769 bundled component provides an executable Isabelle tool that can be run
1772 Isabelle2011/bin/isabelle jedit
1774 * Significantly improved Isabelle/Isar implementation manual.
1776 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
1777 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
1778 while the default heap location within that directory lacks that extra
1779 suffix. This isolates multiple Isabelle installations from each
1780 other, avoiding problems with old settings in new versions.
1781 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
1783 * Source files are always encoded as UTF-8, instead of old-fashioned
1784 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
1785 the following package declarations:
1787 \usepackage[utf8]{inputenc}
1788 \usepackage{textcomp}
1790 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
1791 a Unicode character is treated as a single symbol, not a sequence of
1792 non-ASCII bytes as before. Since Isabelle/ML string literals may
1793 contain symbols without further backslash escapes, Unicode can now be
1794 used here as well. Recall that Symbol.explode in ML provides a
1795 consistent view on symbols, while raw explode (or String.explode)
1796 merely give a byte-oriented representation.
1798 * Theory loader: source files are primarily located via the master
1799 directory of each theory node (where the .thy file itself resides).
1800 The global load path is still partially available as legacy feature.
1801 Minor INCOMPATIBILITY due to subtle change in file lookup: use
1802 explicit paths, relatively to the theory.
1804 * Special treatment of ML file names has been discontinued.
1805 Historically, optional extensions .ML or .sml were added on demand --
1806 at the cost of clarity of file dependencies. Recall that Isabelle/ML
1807 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
1809 * Various options that affect pretty printing etc. are now properly
1810 handled within the context via configuration options, instead of
1811 unsynchronized references or print modes. There are both ML Config.T
1812 entities and Isar declaration attributes to access these.
1814 ML (Config.T) Isar (attribute)
1816 eta_contract eta_contract
1817 show_brackets show_brackets
1818 show_sorts show_sorts
1819 show_types show_types
1820 show_question_marks show_question_marks
1821 show_consts show_consts
1822 show_abbrevs show_abbrevs
1824 Syntax.ast_trace syntax_ast_trace
1825 Syntax.ast_stat syntax_ast_stat
1826 Syntax.ambiguity_level syntax_ambiguity_level
1828 Goal_Display.goals_limit goals_limit
1829 Goal_Display.show_main_goal show_main_goal
1831 Method.rule_trace rule_trace
1833 Thy_Output.display thy_output_display
1834 Thy_Output.quotes thy_output_quotes
1835 Thy_Output.indent thy_output_indent
1836 Thy_Output.source thy_output_source
1837 Thy_Output.break thy_output_break
1839 Note that corresponding "..._default" references in ML may only be
1840 changed globally at the ROOT session setup, but *not* within a theory.
1841 The option "show_abbrevs" supersedes the former print mode
1842 "no_abbrevs" with inverted meaning.
1844 * More systematic naming of some configuration options.
1847 trace_simp ~> simp_trace
1848 debug_simp ~> simp_debug
1850 * Support for real valued configuration options, using simplistic
1851 floating-point notation that coincides with the inner syntax for
1854 * Support for real valued preferences (with approximative PGIP type):
1855 front-ends need to accept "pgint" values in float notation.
1858 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
1861 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
1866 * Command 'type_synonym' (with single argument) replaces somewhat
1867 outdated 'types', which is still available as legacy feature for some
1870 * Command 'nonterminal' (with 'and' separated list of arguments)
1871 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
1873 * Command 'notepad' replaces former 'example_proof' for
1874 experimentation in Isar without any result. INCOMPATIBILITY.
1876 * Locale interpretation commands 'interpret' and 'sublocale' accept
1877 lists of equations to map definitions in a locale to appropriate
1878 entities in the context of the interpretation. The 'interpretation'
1879 command already provided this functionality.
1881 * Diagnostic command 'print_dependencies' prints the locale instances
1882 that would be activated if the specified expression was interpreted in
1883 the current context. Variant "print_dependencies!" assumes a context
1884 without interpretations.
1886 * Diagnostic command 'print_interps' prints interpretations in proofs
1887 in addition to interpretations in theories.
1889 * Discontinued obsolete 'global' and 'local' commands to manipulate
1890 the theory name space. Rare INCOMPATIBILITY. The ML functions
1891 Sign.root_path and Sign.local_path may be applied directly where this
1892 feature is still required for historical reasons.
1894 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
1895 'definition' instead.
1897 * The "prems" fact, which refers to the accidental collection of
1898 foundational premises in the context, is now explicitly marked as
1899 legacy feature and will be discontinued soon. Consider using "assms"
1900 of the head statement or reference facts by explicit names.
1902 * Document antiquotations @{class} and @{type} print classes and type
1905 * Document antiquotation @{file} checks file/directory entries within
1906 the local file system.
1911 * Coercive subtyping: functions can be declared as coercions and type
1912 inference will add them as necessary upon input of a term. Theory
1913 Complex_Main declares real :: nat => real and real :: int => real as
1914 coercions. A coercion function f is declared like this:
1916 declare [[coercion f]]
1918 To lift coercions through type constructors (e.g. from nat => real to
1919 nat list => real list), map functions can be declared, e.g.
1921 declare [[coercion_map map]]
1923 Currently coercion inference is activated only in theories including
1924 real numbers, i.e. descendants of Complex_Main. This is controlled by
1925 the configuration option "coercion_enabled", e.g. it can be enabled in
1926 other theories like this:
1928 declare [[coercion_enabled]]
1930 * Command 'partial_function' provides basic support for recursive
1931 function definitions over complete partial orders. Concrete instances
1932 are provided for i) the option type, ii) tail recursion on arbitrary
1933 types, and iii) the heap monad of Imperative_HOL. See
1934 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
1937 * Function package: f.psimps rules are no longer implicitly declared
1938 as [simp]. INCOMPATIBILITY.
1940 * Datatype package: theorems generated for executable equality (class
1941 "eq") carry proper names and are treated as default code equations.
1943 * Inductive package: now offers command 'inductive_simps' to
1944 automatically derive instantiated and simplified equations for
1945 inductive predicates, similar to 'inductive_cases'.
1947 * Command 'enriched_type' allows to register properties of the
1948 functorial structure of types.
1950 * Improved infrastructure for term evaluation using code generator
1951 techniques, in particular static evaluation conversions.
1953 * Code generator: Scala (2.8 or higher) has been added to the target
1956 * Code generator: globbing constant expressions "*" and "Theory.*"
1957 have been replaced by the more idiomatic "_" and "Theory._".
1960 * Code generator: export_code without explicit file declaration prints
1961 to standard output. INCOMPATIBILITY.
1963 * Code generator: do not print function definitions for case
1964 combinators any longer.
1966 * Code generator: simplification with rules determined with
1967 src/Tools/Code/code_simp.ML and method "code_simp".
1969 * Code generator for records: more idiomatic representation of record
1970 types. Warning: records are not covered by ancient SML code
1971 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
1972 rep_datatype declaration helps to succeed then:
1976 rep_datatype foo_ext ...
1978 * Records: logical foundation type for records does not carry a
1979 '_type' suffix any longer (obsolete due to authentic syntax).
1982 * Quickcheck now by default uses exhaustive testing instead of random
1983 testing. Random testing can be invoked by "quickcheck [random]",
1984 exhaustive testing by "quickcheck [exhaustive]".
1986 * Quickcheck instantiates polymorphic types with small finite
1987 datatypes by default. This enables a simple execution mechanism to
1988 handle quantifiers and function equality over the finite datatypes.
1990 * Quickcheck random generator has been renamed from "code" to
1991 "random". INCOMPATIBILITY.
1993 * Quickcheck now has a configurable time limit which is set to 30
1994 seconds by default. This can be changed by adding [timeout = n] to the
1995 quickcheck command. The time limit for Auto Quickcheck is still set
1998 * Quickcheck in locales considers interpretations of that locale for
1999 counter example search.
2002 - Added "smt" and "remote_smt" provers based on the "smt" proof
2003 method. See the Sledgehammer manual for details ("isabelle doc
2006 sledgehammer atp_info ~> sledgehammer running_provers
2007 sledgehammer atp_kill ~> sledgehammer kill_provers
2008 sledgehammer available_atps ~> sledgehammer available_provers
2011 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
2012 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
2013 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
2014 (and "ms" and "min" are no longer supported)
2019 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
2020 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
2022 - Added support for partial quotient types.
2023 - Added local versions of the "Nitpick.register_xxx" functions.
2024 - Added "whack" option.
2025 - Allow registration of quotient types as codatatypes.
2026 - Improved "merge_type_vars" option to merge more types.
2027 - Removed unsound "fast_descrs" option.
2028 - Added custom symmetry breaking for datatypes, making it possible to reach
2029 higher cardinalities.
2030 - Prevent the expansion of too large definitions.
2032 * Proof methods "metis" and "meson" now have configuration options
2033 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
2034 to diagnose these tools. E.g.
2036 using [[metis_trace = true]]
2038 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
2039 manually as command 'solve_direct'.
2041 * The default SMT solver Z3 must be enabled explicitly (due to
2042 licensing issues) by setting the environment variable
2043 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
2044 commercial applications, the SMT solver CVC3 is provided as fall-back;
2045 changing the SMT solver is done via the configuration option
2048 * Remote SMT solvers need to be referred to by the "remote_" prefix,
2049 i.e. "remote_cvc3" and "remote_z3".
2051 * Added basic SMT support for datatypes, records, and typedefs using
2052 the oracle mode (no proofs). Direct support of pairs has been dropped
2053 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
2054 support for a similar behavior). Minor INCOMPATIBILITY.
2056 * Changed SMT configuration options:
2058 z3_proofs ~> smt_oracle (with inverted meaning)
2059 z3_trace_assms ~> smt_trace_used_facts
2072 * Boogie output files (.b2i files) need to be declared in the theory
2075 * Simplification procedure "list_to_set_comprehension" rewrites list
2076 comprehensions applied to List.set to set comprehensions. Occasional
2077 INCOMPATIBILITY, may be deactivated like this:
2079 declare [[simproc del: list_to_set_comprehension]]
2081 * Removed old version of primrec package. INCOMPATIBILITY.
2083 * Removed simplifier congruence rule of "prod_case", as has for long
2084 been the case with "split". INCOMPATIBILITY.
2086 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
2088 * Removed [split_format ... and ... and ...] version of
2089 [split_format]. Potential INCOMPATIBILITY.
2091 * Predicate "sorted" now defined inductively, with nice induction
2092 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
2094 * Constant "contents" renamed to "the_elem", to free the generic name
2095 contents for other uses. INCOMPATIBILITY.
2097 * Renamed class eq and constant eq (for code generation) to class
2098 equal and constant equal, plus renaming of related facts and various
2099 tuning. INCOMPATIBILITY.
2101 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
2103 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
2106 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
2107 avoid confusion with finite sets. INCOMPATIBILITY.
2109 * Abandoned locales equiv, congruent and congruent2 for equivalence
2110 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
2113 * Some previously unqualified names have been qualified:
2120 Trueprop ~> HOL.Trueprop
2125 op --> ~> HOL.implies
2137 Pair ~> Product_Type.Pair
2138 fst ~> Product_Type.fst
2139 snd ~> Product_Type.snd
2140 curry ~> Product_Type.curry
2142 Collect ~> Set.Collect
2146 * More canonical naming convention for some fundamental definitions:
2148 bot_bool_eq ~> bot_bool_def
2149 top_bool_eq ~> top_bool_def
2150 inf_bool_eq ~> inf_bool_def
2151 sup_bool_eq ~> sup_bool_def
2152 bot_fun_eq ~> bot_fun_def
2153 top_fun_eq ~> top_fun_def
2154 inf_fun_eq ~> inf_fun_def
2155 sup_fun_eq ~> sup_fun_def
2159 * More stylized fact names:
2161 expand_fun_eq ~> fun_eq_iff
2162 expand_set_eq ~> set_eq_iff
2164 nat_number ~> eval_nat_numeral
2168 * Refactoring of code-generation specific operations in theory List:
2174 mem_iff ~> member_def
2175 null_empty ~> null_def
2177 INCOMPATIBILITY. Note that these were not supposed to be used
2178 regularly unless for striking reasons; their main purpose was code
2181 Various operations from the Haskell prelude are used for generating
2184 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
2185 "surj f" is now an abbreviation of "range f = UNIV". The theorems
2186 bij_def and surj_def are unchanged. INCOMPATIBILITY.
2188 * Abolished some non-alphabetic type names: "prod" and "sum" replace
2189 "*" and "+" respectively. INCOMPATIBILITY.
2191 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
2192 "Sum_Type.Plus" instead.
2194 * Constant "split" has been merged with constant "prod_case"; names of
2195 ML functions, facts etc. involving split have been retained so far,
2196 though. INCOMPATIBILITY.
2198 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
2199 instead. INCOMPATIBILITY.
2201 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
2204 * Former theory Library/Enum is now part of the HOL-Main image.
2205 INCOMPATIBILITY: all constants of the Enum theory now have to be
2206 referred to by its qualified name.
2209 nlists ~> Enum.nlists
2210 product ~> Enum.product
2212 * Theory Library/Monad_Syntax provides do-syntax for monad types.
2213 Syntax in Library/State_Monad has been changed to avoid ambiguities.
2216 * Theory Library/SetsAndFunctions has been split into
2217 Library/Function_Algebras and Library/Set_Algebras; canonical names
2218 for instance definitions for functions; various improvements.
2221 * Theory Library/Multiset provides stable quicksort implementation of
2224 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
2227 * Session Multivariate_Analysis: introduced a type class for euclidean
2228 space. Most theorems are now stated in terms of euclidean spaces
2229 instead of finite cartesian products.
2232 real ^ 'n ~> 'a::real_vector
2233 ~> 'a::euclidean_space
2234 ~> 'a::ordered_euclidean_space
2235 (depends on your needs)
2239 \<chi> x. _ ~> \<chi>\<chi> x. _
2242 Also note that the indices are now natural numbers and not from some
2243 finite type. Finite cartesian products of euclidean spaces, products
2244 of euclidean spaces the real and complex numbers are instantiated to
2245 be euclidean_spaces. INCOMPATIBILITY.
2247 * Session Probability: introduced pextreal as positive extended real
2248 numbers. Use pextreal as value for measures. Introduce the
2249 Radon-Nikodym derivative, product spaces and Fubini's theorem for
2250 arbitrary sigma finite measures. Introduces Lebesgue measure based on
2251 the integral in Multivariate Analysis. INCOMPATIBILITY.
2253 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
2256 * Session SPARK (with image HOL-SPARK) provides commands to load and
2257 prove verification conditions generated by the SPARK Ada program
2258 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
2263 * Theorems for additive ring operations (locale abelian_monoid and
2264 descendants) are generated by interpretation from their multiplicative
2265 counterparts. Names (in particular theorem names) have the mandatory
2266 qualifier 'add'. Previous theorem names are redeclared for
2269 * Structure "int_ring" is now an abbreviation (previously a
2270 definition). This fits more natural with advanced interpretations.
2275 * The domain package now runs in definitional mode by default: The
2276 former command 'new_domain' is now called 'domain'. To use the domain
2277 package in its original axiomatic mode, use 'domain (unsafe)'.
2280 * The new class "domain" is now the default sort. Class "predomain"
2281 is an unpointed version of "domain". Theories can be updated by
2282 replacing sort annotations as shown below. INCOMPATIBILITY.
2284 'a::type ~> 'a::countable
2285 'a::cpo ~> 'a::predomain
2286 'a::pcpo ~> 'a::domain
2288 * The old type class "rep" has been superseded by class "domain".
2289 Accordingly, users of the definitional package must remove any
2290 "default_sort rep" declarations. INCOMPATIBILITY.
2292 * The domain package (definitional mode) now supports unpointed
2293 predomain argument types, as long as they are marked 'lazy'. (Strict
2294 arguments must be in class "domain".) For example, the following
2295 domain definition now works:
2297 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
2299 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
2300 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
2301 'a option, and 'a list. Additionally, it configures fixrec and the
2302 domain package to work with these types. For example:
2304 fixrec isInl :: "('a + 'b) u -> tr"
2305 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
2307 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
2309 * The "(permissive)" option of fixrec has been replaced with a
2310 per-equation "(unchecked)" option. See
2311 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
2313 * The "bifinite" class no longer fixes a constant "approx"; the class
2314 now just asserts that such a function exists. INCOMPATIBILITY.
2316 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
2317 defines an embedding of type 'a defl into udom by default; instances
2318 of "bifinite" and "domain" classes are available in
2319 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
2321 * The syntax "REP('a)" has been replaced with "DEFL('a)".
2323 * The predicate "directed" has been removed. INCOMPATIBILITY.
2325 * The type class "finite_po" has been removed. INCOMPATIBILITY.
2327 * The function "cprod_map" has been renamed to "prod_map".
2330 * The monadic bind operator on each powerdomain has new binder syntax
2331 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
2332 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
2334 * The infix syntax for binary union on each powerdomain has changed
2335 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
2336 syntax. INCOMPATIBILITY.
2338 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
2339 still supported as an input translation.
2341 * Renamed some theorems (the original names are also still available).
2343 expand_fun_below ~> fun_below_iff
2344 below_fun_ext ~> fun_belowI
2345 expand_cfun_eq ~> cfun_eq_iff
2346 ext_cfun ~> cfun_eqI
2347 expand_cfun_below ~> cfun_below_iff
2348 below_cfun_ext ~> cfun_belowI
2349 cont2cont_Rep_CFun ~> cont2cont_APP
2351 * The Abs and Rep functions for various types have changed names.
2352 Related theorem names have also changed to match. INCOMPATIBILITY.
2354 Rep_CFun ~> Rep_cfun
2355 Abs_CFun ~> Abs_cfun
2356 Rep_Sprod ~> Rep_sprod
2357 Abs_Sprod ~> Abs_sprod
2358 Rep_Ssum ~> Rep_ssum
2359 Abs_Ssum ~> Abs_ssum
2361 * Lemmas with names of the form *_defined_iff or *_strict_iff have
2362 been renamed to *_bottom_iff. INCOMPATIBILITY.
2364 * Various changes to bisimulation/coinduction with domain package:
2366 - Definitions of "bisim" constants no longer mention definedness.
2367 - With mutual recursion, "bisim" predicate is now curried.
2368 - With mutual recursion, each type gets a separate coind theorem.
2369 - Variable names in bisim_def and coinduct rules have changed.
2373 * Case combinators generated by the domain package for type "foo" are
2374 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
2376 * Several theorems have been renamed to more accurately reflect the
2377 names of constants and types involved. INCOMPATIBILITY.
2379 thelub_const ~> lub_const
2380 lub_const ~> is_lub_const
2382 is_lub_lub ~> is_lubD2
2384 unique_lub ~> is_lub_unique
2385 is_ub_lub ~> is_lub_rangeD1
2386 lub_bin_chain ~> is_lub_bin_chain
2387 lub_fun ~> is_lub_fun
2388 thelub_fun ~> lub_fun
2389 thelub_cfun ~> lub_cfun
2390 thelub_Pair ~> lub_Pair
2391 lub_cprod ~> is_lub_prod
2392 thelub_cprod ~> lub_prod
2393 minimal_cprod ~> minimal_prod
2394 inst_cprod_pcpo ~> inst_prod_pcpo
2396 compact_UU ~> compact_bottom
2397 deflation_UU ~> deflation_bottom
2398 finite_deflation_UU ~> finite_deflation_bottom
2400 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
2402 sq_ord_less_eq_trans ~> below_eq_trans
2403 sq_ord_eq_less_trans ~> eq_below_trans
2404 refl_less ~> below_refl
2405 trans_less ~> below_trans
2406 antisym_less ~> below_antisym
2407 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
2408 box_less ~> box_below
2409 rev_trans_less ~> rev_below_trans
2410 not_less2not_eq ~> not_below2not_eq
2411 less_UU_iff ~> below_UU_iff
2412 flat_less_iff ~> flat_below_iff
2413 adm_less ~> adm_below
2414 adm_not_less ~> adm_not_below
2415 adm_compact_not_less ~> adm_compact_not_below
2416 less_fun_def ~> below_fun_def
2417 expand_fun_less ~> fun_below_iff
2418 less_fun_ext ~> fun_belowI
2419 less_discr_def ~> below_discr_def
2420 discr_less_eq ~> discr_below_eq
2421 less_unit_def ~> below_unit_def
2422 less_cprod_def ~> below_prod_def
2423 prod_lessI ~> prod_belowI
2424 Pair_less_iff ~> Pair_below_iff
2425 fst_less_iff ~> fst_below_iff
2426 snd_less_iff ~> snd_below_iff
2427 expand_cfun_less ~> cfun_below_iff
2428 less_cfun_ext ~> cfun_belowI
2429 injection_less ~> injection_below
2430 less_up_def ~> below_up_def
2431 not_Iup_less ~> not_Iup_below
2432 Iup_less ~> Iup_below
2434 Def_inject_less_eq ~> Def_below_Def
2435 Def_less_is_eq ~> Def_below_iff
2436 spair_less_iff ~> spair_below_iff
2437 less_sprod ~> below_sprod
2438 spair_less ~> spair_below
2439 sfst_less_iff ~> sfst_below_iff
2440 ssnd_less_iff ~> ssnd_below_iff
2441 fix_least_less ~> fix_least_below
2442 dist_less_one ~> dist_below_one
2443 less_ONE ~> below_ONE
2444 ONE_less_iff ~> ONE_below_iff
2445 less_sinlD ~> below_sinlD
2446 less_sinrD ~> below_sinrD
2451 * All constant names are now qualified internally and use proper
2452 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
2457 * Antiquotation @{assert} inlines a function bool -> unit that raises
2458 Fail if the argument is false. Due to inlining the source position of
2459 failed assertions is included in the error output.
2461 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
2462 text is in practice always evaluated with a stable theory checkpoint.
2463 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
2465 * Antiquotation @{theory A} refers to theory A from the ancestry of
2466 the current context, not any accidental theory loader state as before.
2467 Potential INCOMPATIBILITY, subtle change in semantics.
2469 * Syntax.pretty_priority (default 0) configures the required priority
2470 of pretty-printed output and thus affects insertion of parentheses.
2472 * Syntax.default_root (default "any") configures the inner syntax
2473 category (nonterminal symbol) for parsing of terms.
2475 * Former exception Library.UnequalLengths now coincides with
2476 ListPair.UnequalLengths.
2478 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
2479 main functionality is provided by structure Simplifier.
2481 * Renamed raw "explode" function to "raw_explode" to emphasize its
2482 meaning. Note that internally to Isabelle, Symbol.explode is used in
2483 almost all situations.
2485 * Discontinued obsolete function sys_error and exception SYS_ERROR.
2486 See implementation manual for further details on exceptions in
2489 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
2492 * Renamed structure PureThy to Pure_Thy and moved most of its
2493 operations to structure Global_Theory, to emphasize that this is
2494 rarely-used global-only stuff.
2496 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
2497 instead (or tracing for high-volume output).
2499 * Configuration option show_question_marks only affects regular pretty
2500 printing of types and terms, not raw Term.string_of_vname.
2502 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
2503 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
2504 @{thms} for most purposes.
2506 * ML structure Unsynchronized is never opened, not even in Isar
2507 interaction mode as before. Old Unsynchronized.set etc. have been
2508 discontinued -- use plain := instead. This should be *rare* anyway,
2509 since modern tools always work via official context data, notably
2510 configuration options.
2512 * Parallel and asynchronous execution requires special care concerning
2513 interrupts. Structure Exn provides some convenience functions that
2514 avoid working directly with raw Interrupt. User code must not absorb
2515 interrupts -- intermediate handling (for cleanup etc.) needs to be
2516 followed by re-raising of the original exception. Another common
2517 source of mistakes are "handle _" patterns, which make the meaning of
2518 the program subject to physical effects of the environment.
2522 New in Isabelle2009-2 (June 2010)
2523 ---------------------------------
2527 * Authentic syntax for *all* logical entities (type classes, type
2528 constructors, term constants): provides simple and robust
2529 correspondence between formal entities and concrete syntax. Within
2530 the parse tree / AST representations, "constants" are decorated by
2531 their category (class, type, const) and spelled out explicitly with
2532 their full internal name.
2534 Substantial INCOMPATIBILITY concerning low-level syntax declarations
2535 and translations (translation rules and translation functions in ML).
2536 Some hints on upgrading:
2538 - Many existing uses of 'syntax' and 'translations' can be replaced
2539 by more modern 'type_notation', 'notation' and 'abbreviation',
2540 which are independent of this issue.
2542 - 'translations' require markup within the AST; the term syntax
2543 provides the following special forms:
2545 CONST c -- produces syntax version of constant c from context
2546 XCONST c -- literally c, checked as constant from context
2547 c -- literally c, if declared by 'syntax'
2549 Plain identifiers are treated as AST variables -- occasionally the
2550 system indicates accidental variables via the error "rhs contains
2553 Type classes and type constructors are marked according to their
2554 concrete syntax. Some old translations rules need to be written
2555 for the "type" category, using type constructor application
2556 instead of pseudo-term application of the default category
2559 - 'parse_translation' etc. in ML may use the following
2562 @{class_syntax c} -- type class c within parse tree / AST
2563 @{term_syntax c} -- type constructor c within parse tree / AST
2564 @{const_syntax c} -- ML version of "CONST c" above
2565 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
2567 - Literal types within 'typed_print_translations', i.e. those *not*
2568 represented as pseudo-terms are represented verbatim. Use @{class
2569 c} or @{type_name c} here instead of the above syntax
2572 Note that old non-authentic syntax was based on unqualified base
2573 names, so all of the above "constant" names would coincide. Recall
2574 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
2575 diagnose syntax problems.
2577 * Type constructors admit general mixfix syntax, not just infix.
2579 * Concrete syntax may be attached to local entities without a proof
2580 body, too. This works via regular mixfix annotations for 'fix',
2581 'def', 'obtain' etc. or via the explicit 'write' command, which is
2582 similar to the 'notation' command in theory specifications.
2584 * Discontinued unnamed infix syntax (legacy feature for many years) --
2585 need to specify constant name and syntax separately. Internal ML
2586 datatype constructors have been renamed from InfixName to Infix etc.
2587 Minor INCOMPATIBILITY.
2589 * Schematic theorem statements need to be explicitly markup as such,
2590 via commands 'schematic_lemma', 'schematic_theorem',
2591 'schematic_corollary'. Thus the relevance of the proof is made
2592 syntactically clear, which impacts performance in a parallel or
2593 asynchronous interactive environment. Minor INCOMPATIBILITY.
2595 * Use of cumulative prems via "!" in some proof methods has been
2596 discontinued (old legacy feature).
2598 * References 'trace_simp' and 'debug_simp' have been replaced by
2599 configuration options stored in the context. Enabling tracing (the
2600 case of debugging is similar) in proofs works via
2602 using [[trace_simp = true]]
2604 Tracing is then active for all invocations of the simplifier in
2605 subsequent goal refinement steps. Tracing may also still be enabled or
2606 disabled via the ProofGeneral settings menu.
2608 * Separate commands 'hide_class', 'hide_type', 'hide_const',
2609 'hide_fact' replace the former 'hide' KIND command. Minor
2612 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
2613 more efficient than combinations with -q1 or -q2.
2618 * Proofterms record type-class reasoning explicitly, using the
2619 "unconstrain" operation internally. This eliminates all sort
2620 constraints from a theorem and proof, introducing explicit
2621 OFCLASS-premises. On the proof term level, this operation is
2622 automatically applied at theorem boundaries, such that closed proofs
2623 are always free of sort constraints. INCOMPATIBILITY for tools that
2624 inspect proof terms.
2626 * Local theory specifications may depend on extra type variables that
2627 are not present in the result type -- arguments TYPE('a) :: 'a itself
2628 are added internally. For example:
2630 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
2632 * Predicates of locales introduced by classes carry a mandatory
2633 "class" prefix. INCOMPATIBILITY.
2635 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
2637 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
2640 * Command 'code_reflect' allows to incorporate generated ML code into
2641 runtime environment; replaces immature code_datatype antiquotation.
2644 * Code generator: simple concept for abstract datatypes obeying
2647 * Code generator: details of internal data cache have no impact on the
2648 user space functionality any longer.
2650 * Methods "unfold_locales" and "intro_locales" ignore non-locale
2651 subgoals. This is more appropriate for interpretations with 'where'.
2654 * Command 'example_proof' opens an empty proof body. This allows to
2655 experiment with Isar, without producing any persistent result.
2657 * Commands 'type_notation' and 'no_type_notation' declare type syntax
2658 within a local theory context, with explicit checking of the
2659 constructors involved (in contrast to the raw 'syntax' versions).
2661 * Commands 'types' and 'typedecl' now work within a local theory
2662 context -- without introducing dependencies on parameters or
2663 assumptions, which is not possible in Isabelle/Pure.
2665 * Command 'defaultsort' has been renamed to 'default_sort', it works
2666 within a local theory context. Minor INCOMPATIBILITY.
2671 * Command 'typedef' now works within a local theory context -- without
2672 introducing dependencies on parameters or assumptions, which is not
2673 possible in Isabelle/Pure/HOL. Note that the logical environment may
2674 contain multiple interpretations of local typedefs (with different
2675 non-emptiness proofs), even in a global theory context.
2677 * New package for quotient types. Commands 'quotient_type' and
2678 'quotient_definition' may be used for defining types and constants by
2679 quotient constructions. An example is the type of integers created by
2680 quotienting pairs of natural numbers:
2683 intrel :: "(nat * nat) => (nat * nat) => bool"
2685 "intrel (x, y) (u, v) = (x + v = u + y)"
2687 quotient_type int = "nat * nat" / intrel
2688 by (auto simp add: equivp_def expand_fun_eq)
2691 "0::int" is "(0::nat, 0::nat)"
2693 The method "lifting" can be used to lift of theorems from the
2694 underlying "raw" type to the quotient type. The example
2695 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
2696 construction and provides a reasoning infrastructure for finite sets.
2698 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
2699 clash with new theory Quotient in Main HOL.
2701 * Moved the SMT binding into the main HOL session, eliminating
2702 separate HOL-SMT session.
2704 * List membership infix mem operation is only an input abbreviation.
2707 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
2708 for future developements; former Library/Word.thy is still present in
2709 the AFP entry RSAPPS.
2711 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
2712 longer shadowed. INCOMPATIBILITY.
2714 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
2717 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
2720 * Dropped normalizing_semiring etc; use the facts in semiring classes
2721 instead. INCOMPATIBILITY.
2723 * Dropped several real-specific versions of lemmas about floor and
2724 ceiling; use the generic lemmas from theory "Archimedean_Field"
2725 instead. INCOMPATIBILITY.
2727 floor_number_of_eq ~> floor_number_of
2728 le_floor_eq_number_of ~> number_of_le_floor
2729 le_floor_eq_zero ~> zero_le_floor
2730 le_floor_eq_one ~> one_le_floor
2731 floor_less_eq_number_of ~> floor_less_number_of
2732 floor_less_eq_zero ~> floor_less_zero
2733 floor_less_eq_one ~> floor_less_one
2734 less_floor_eq_number_of ~> number_of_less_floor
2735 less_floor_eq_zero ~> zero_less_floor
2736 less_floor_eq_one ~> one_less_floor
2737 floor_le_eq_number_of ~> floor_le_number_of
2738 floor_le_eq_zero ~> floor_le_zero
2739 floor_le_eq_one ~> floor_le_one
2740 floor_subtract_number_of ~> floor_diff_number_of
2741 floor_subtract_one ~> floor_diff_one
2742 ceiling_number_of_eq ~> ceiling_number_of
2743 ceiling_le_eq_number_of ~> ceiling_le_number_of
2744 ceiling_le_zero_eq ~> ceiling_le_zero
2745 ceiling_le_eq_one ~> ceiling_le_one
2746 less_ceiling_eq_number_of ~> number_of_less_ceiling
2747 less_ceiling_eq_zero ~> zero_less_ceiling
2748 less_ceiling_eq_one ~> one_less_ceiling
2749 ceiling_less_eq_number_of ~> ceiling_less_number_of
2750 ceiling_less_eq_zero ~> ceiling_less_zero
2751 ceiling_less_eq_one ~> ceiling_less_one
2752 le_ceiling_eq_number_of ~> number_of_le_ceiling
2753 le_ceiling_eq_zero ~> zero_le_ceiling
2754 le_ceiling_eq_one ~> one_le_ceiling
2755 ceiling_subtract_number_of ~> ceiling_diff_number_of
2756 ceiling_subtract_one ~> ceiling_diff_one
2758 * Theory "Finite_Set": various folding_XXX locales facilitate the
2759 application of the various fold combinators on finite sets.
2761 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
2762 provides abstract red-black tree type which is backed by "RBT_Impl" as
2763 implementation. INCOMPATIBILTY.
2765 * Theory Library/Coinductive_List has been removed -- superseded by
2766 AFP/thys/Coinductive.
2768 * Theory PReal, including the type "preal" and related operations, has
2769 been removed. INCOMPATIBILITY.
2771 * Real: new development using Cauchy Sequences.
2773 * Split off theory "Big_Operators" containing setsum, setprod,
2774 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
2776 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
2777 "Int" etc. INCOMPATIBILITY.
2779 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
2781 * New set of rules "ac_simps" provides combined assoc / commute
2782 rewrites for all interpretations of the appropriate generic locales.
2784 * Renamed theory "OrderedGroup" to "Groups" and split theory
2785 "Ring_and_Field" into theories "Rings" and "Fields"; for more
2786 appropriate and more consistent names suitable for name prefixes
2787 within the HOL theories. INCOMPATIBILITY.
2789 * Some generic constants have been put to appropriate theories:
2790 - less_eq, less: Orderings
2791 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
2792 - inverse, divide: Rings
2795 * More consistent naming of type classes involving orderings (and
2798 lower_semilattice ~> semilattice_inf
2799 upper_semilattice ~> semilattice_sup
2801 dense_linear_order ~> dense_linorder
2803 pordered_ab_group_add ~> ordered_ab_group_add
2804 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
2805 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
2806 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
2807 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
2808 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
2809 pordered_cancel_semiring ~> ordered_cancel_semiring
2810 pordered_comm_monoid_add ~> ordered_comm_monoid_add
2811 pordered_comm_ring ~> ordered_comm_ring
2812 pordered_comm_semiring ~> ordered_comm_semiring
2813 pordered_ring ~> ordered_ring
2814 pordered_ring_abs ~> ordered_ring_abs
2815 pordered_semiring ~> ordered_semiring
2817 ordered_ab_group_add ~> linordered_ab_group_add
2818 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
2819 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
2820 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
2821 ordered_field ~> linordered_field
2822 ordered_field_no_lb ~> linordered_field_no_lb
2823 ordered_field_no_ub ~> linordered_field_no_ub
2824 ordered_field_dense_linear_order ~> dense_linordered_field
2825 ordered_idom ~> linordered_idom
2826 ordered_ring ~> linordered_ring
2827 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
2828 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
2829 ordered_ring_strict ~> linordered_ring_strict
2830 ordered_semidom ~> linordered_semidom
2831 ordered_semiring ~> linordered_semiring
2832 ordered_semiring_1 ~> linordered_semiring_1
2833 ordered_semiring_1_strict ~> linordered_semiring_1_strict
2834 ordered_semiring_strict ~> linordered_semiring_strict
2836 The following slightly odd type classes have been moved to a
2837 separate theory Library/Lattice_Algebras:
2839 lordered_ab_group_add ~> lattice_ab_group_add
2840 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
2841 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
2842 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
2843 lordered_ring ~> lattice_ring
2847 * Refined field classes:
2848 - classes division_ring_inverse_zero, field_inverse_zero,
2849 linordered_field_inverse_zero include rule inverse 0 = 0 --
2850 subsumes former division_by_zero class;
2851 - numerous lemmas have been ported from field to division_ring.
2854 * Refined algebra theorem collections:
2855 - dropped theorem group group_simps, use algebra_simps instead;
2856 - dropped theorem group ring_simps, use field_simps instead;
2857 - proper theorem collection field_simps subsumes former theorem
2858 groups field_eq_simps and field_simps;
2859 - dropped lemma eq_minus_self_iff which is a duplicate for
2863 * Theory Finite_Set and List: some lemmas have been generalized from
2866 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
2867 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
2868 inter_Inter_fold_inter ~> inf_Inf_fold_inf
2869 union_Union_fold_union ~> sup_Sup_fold_sup
2870 Inter_fold_inter ~> Inf_fold_inf
2871 Union_fold_union ~> Sup_fold_sup
2872 inter_INTER_fold_inter ~> inf_INFI_fold_inf
2873 union_UNION_fold_union ~> sup_SUPR_fold_sup
2874 INTER_fold_inter ~> INFI_fold_inf
2875 UNION_fold_union ~> SUPR_fold_sup
2877 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
2878 replaced by the more convenient lemmas Inf_empty and Sup_empty.
2879 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
2880 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
2881 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
2882 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
2884 * Reorganized theory Multiset: swapped notation of pointwise and
2887 - pointwise ordering is instance of class order with standard syntax
2889 - multiset ordering has syntax <=# and <#; partial order properties
2890 are provided by means of interpretation with prefix
2892 - less duplication, less historical organization of sections,
2893 conversion from associations lists to multisets, rudimentary code
2895 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
2900 multiset_eq_conv_count_eq ~> multiset_ext_iff
2901 multi_count_ext ~> multiset_ext
2902 diff_union_inverse2 ~> diff_union_cancelR
2906 * Theory Permutation: replaced local "remove" by List.remove1.
2908 * Code generation: ML and OCaml code is decorated with signatures.
2910 * Theory List: added transpose.
2912 * Library/Nat_Bijection.thy is a collection of bijective functions
2913 between nat and other types, which supersedes the older libraries
2914 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
2917 Nat_Int_Bij.nat2_to_nat ~> prod_encode
2918 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
2919 Nat_Int_Bij.int_to_nat_bij ~> int_encode
2920 Nat_Int_Bij.nat_to_int_bij ~> int_decode
2921 Countable.pair_encode ~> prod_encode
2922 NatIso.prod2nat ~> prod_encode
2923 NatIso.nat2prod ~> prod_decode
2924 NatIso.sum2nat ~> sum_encode
2925 NatIso.nat2sum ~> sum_decode
2926 NatIso.list2nat ~> list_encode
2927 NatIso.nat2list ~> list_decode
2928 NatIso.set2nat ~> set_encode
2929 NatIso.nat2set ~> set_decode
2932 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
2933 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
2934 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
2935 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
2936 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
2937 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
2938 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
2939 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
2940 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
2941 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
2942 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
2943 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
2944 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
2947 - Renamed ATP commands:
2948 atp_info ~> sledgehammer running_atps
2949 atp_kill ~> sledgehammer kill_atps
2950 atp_messages ~> sledgehammer messages
2951 atp_minimize ~> sledgehammer minimize
2952 print_atps ~> sledgehammer available_atps
2954 - Added user's manual ("isabelle doc sledgehammer").
2955 - Added option syntax and "sledgehammer_params" to customize
2956 Sledgehammer's behavior. See the manual for details.
2957 - Modified the Isar proof reconstruction code so that it produces
2958 direct proofs rather than proofs by contradiction. (This feature
2959 is still experimental.)
2960 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
2962 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
2965 - Added and implemented "binary_ints" and "bits" options.
2966 - Added "std" option and implemented support for nonstandard models.
2967 - Added and implemented "finitize" option to improve the precision
2968 of infinite datatypes based on a monotonicity analysis.
2969 - Added support for quotient types.
2970 - Added support for "specification" and "ax_specification"
2972 - Added support for local definitions (for "function" and
2973 "termination" proofs).
2974 - Added support for term postprocessors.
2975 - Optimized "Multiset.multiset" and "FinFun.finfun".
2976 - Improved efficiency of "destroy_constrs" optimization.
2977 - Fixed soundness bugs related to "destroy_constrs" optimization and
2979 - Fixed soundness bug related to higher-order constructors.
2980 - Fixed soundness bug when "full_descrs" is enabled.
2981 - Improved precision of set constructs.
2982 - Added "atoms" option.
2983 - Added cache to speed up repeated Kodkod invocations on the same
2985 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
2986 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
2987 "SAT4J_Light". INCOMPATIBILITY.
2988 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
2989 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
2990 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
2992 * Method "induct" now takes instantiations of the form t, where t is not
2993 a variable, as a shorthand for "x == t", where x is a fresh variable.
2994 If this is not intended, t has to be enclosed in parentheses.
2995 By default, the equalities generated by definitional instantiations
2996 are pre-simplified, which may cause parameters of inductive cases
2997 to disappear, or may even delete some of the inductive cases.
2998 Use "induct (no_simp)" instead of "induct" to restore the old
2999 behaviour. The (no_simp) option is also understood by the "cases"
3000 and "nominal_induct" methods, which now perform pre-simplification, too.
3006 * Variable names in lemmas generated by the domain package have
3007 changed; the naming scheme is now consistent with the HOL datatype
3008 package. Some proof scripts may be affected, INCOMPATIBILITY.
3010 * The domain package no longer defines the function "foo_copy" for
3011 recursive domain "foo". The reach lemma is now stated directly in
3012 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
3013 be reformulated in terms of "foo_take", INCOMPATIBILITY.
3015 * Most definedness lemmas generated by the domain package (previously
3016 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
3017 like "foo$x = UU <-> x = UU", which works better as a simp rule.
3018 Proofs that used definedness lemmas as intro rules may break,
3019 potential INCOMPATIBILITY.
3021 * Induction and casedist rules generated by the domain package now
3022 declare proper case_names (one called "bottom", and one named for each
3023 constructor). INCOMPATIBILITY.
3025 * For mutually-recursive domains, separate "reach" and "take_lemma"
3026 rules are generated for each domain, INCOMPATIBILITY.
3028 foo_bar.reach ~> foo.reach bar.reach
3029 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
3031 * Some lemmas generated by the domain package have been renamed for
3032 consistency with the datatype package, INCOMPATIBILITY.
3034 foo.ind ~> foo.induct
3035 foo.finite_ind ~> foo.finite_induct
3036 foo.coind ~> foo.coinduct
3037 foo.casedist ~> foo.exhaust
3038 foo.exhaust ~> foo.nchotomy
3040 * For consistency with other definition packages, the fixrec package
3041 now generates qualified theorem names, INCOMPATIBILITY.
3043 foo_simps ~> foo.simps
3044 foo_unfold ~> foo.unfold
3045 foo_induct ~> foo.induct
3047 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
3048 method and internal fixrec proofs now use the default simpset instead.
3051 * The "contlub" predicate has been removed. Proof scripts should use
3052 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
3054 * The "admw" predicate has been removed, INCOMPATIBILITY.
3056 * The constants cpair, cfst, and csnd have been removed in favor of
3057 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
3062 * Antiquotations for basic formal entities:
3064 @{class NAME} -- type class
3065 @{class_syntax NAME} -- syntax representation of the above
3067 @{type_name NAME} -- logical type
3068 @{type_abbrev NAME} -- type abbreviation
3069 @{nonterminal NAME} -- type of concrete syntactic category
3070 @{type_syntax NAME} -- syntax representation of any of the above
3072 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
3073 @{const_abbrev NAME} -- abbreviated constant
3074 @{const_syntax NAME} -- syntax representation of any of the above
3076 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
3077 syntax constant (cf. 'syntax' command).
3079 * Antiquotation @{make_string} inlines a function to print arbitrary
3080 values similar to the ML toplevel. The result is compiler dependent
3081 and may fall back on "?" in certain situations.
3083 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
3084 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
3085 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
3086 not work with the asynchronous Isar document model.
3088 * Configuration options now admit dynamic default values, depending on
3089 the context or even global references.
3091 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
3092 uses an efficient external library if available (for Poly/ML).
3094 * Renamed some important ML structures, while keeping the old names
3095 for some time as aliases within the structure Legacy:
3097 OuterKeyword ~> Keyword
3100 OuterSyntax ~> Outer_Syntax
3101 PrintMode ~> Print_Mode
3102 SpecParse ~> Parse_Spec
3105 ThyOutput ~> Thy_Output
3106 TypeInfer ~> Type_Infer
3108 Note that "open Legacy" simplifies porting of sources, but forgetting
3109 to remove it again will complicate porting again in the future.
3111 * Most operations that refer to a global context are named
3112 accordingly, e.g. Simplifier.global_context or
3113 ProofContext.init_global. There are some situations where a global
3114 context actually works, but under normal circumstances one needs to
3115 pass the proper local context through the code!
3117 * Discontinued old TheoryDataFun with its copy/init operation -- data
3118 needs to be pure. Functor Theory_Data_PP retains the traditional
3119 Pretty.pp argument to merge, which is absent in the standard
3120 Theory_Data version.
3122 * Sorts.certify_sort and derived "cert" operations for types and terms
3123 no longer minimize sorts. Thus certification at the boundary of the
3124 inference kernel becomes invariant under addition of class relations,
3125 which is an important monotonicity principle. Sorts are now minimized
3126 in the syntax layer only, at the boundary between the end-user and the
3127 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
3128 explicitly in rare situations.
3130 * Renamed old-style Drule.standard to Drule.export_without_context, to
3131 emphasize that this is in no way a standard operation.
3134 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
3135 usual for resolution. Rare INCOMPATIBILITY.
3137 * Renamed varify/unvarify operations to varify_global/unvarify_global
3138 to emphasize that these only work in a global situation (which is
3141 * Curried take and drop in library.ML; negative length is interpreted
3142 as infinity (as in chop). Subtle INCOMPATIBILITY.
3144 * Proof terms: type substitutions on proof constants now use canonical
3145 order of type variables. INCOMPATIBILITY for tools working with proof
3148 * Raw axioms/defs may no longer carry sort constraints, and raw defs
3149 may no longer carry premises. User-level specifications are
3150 transformed accordingly by Thm.add_axiom/add_def.
3155 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
3156 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
3157 proof terms are enabled unconditionally in the new HOL-Proofs image.
3159 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
3160 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
3163 * Old lib/scripts/polyml-platform is superseded by the
3164 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
3165 variant, even on a 64 bit machine. The following example setting
3166 prefers 64 bit if available:
3168 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
3170 * The preliminary Isabelle/jEdit application demonstrates the emerging
3171 Isabelle/Scala layer for advanced prover interaction and integration.
3172 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
3175 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
3176 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
3177 similar to the default assignment of the document preparation system
3178 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
3179 provides some operations for direct access to the font without asking
3180 the user for manual installation.
3184 New in Isabelle2009-1 (December 2009)
3185 -------------------------------------
3189 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
3190 one backslash should be used, even in ML sources.
3195 * Locale interpretation propagates mixins along the locale hierarchy.
3196 The currently only available mixins are the equations used to map
3197 local definitions to terms of the target domain of an interpretation.
3199 * Reactivated diagnostic command 'print_interps'. Use "print_interps
3200 loc" to print all interpretations of locale "loc" in the theory.
3201 Interpretations in proofs are not shown.
3203 * Thoroughly revised locales tutorial. New section on conditional
3206 * On instantiation of classes, remaining undefined class parameters
3207 are formally declared. INCOMPATIBILITY.
3210 *** Document preparation ***
3212 * New generalized style concept for printing terms: @{foo (style) ...}
3213 instead of @{foo_style style ...} (old form is still retained for
3214 backward compatibility). Styles can be also applied for
3215 antiquotations prop, term_type and typeof.
3220 * New proof method "smt" for a combination of first-order logic with
3221 equality, linear and nonlinear (natural/integer/real) arithmetic, and
3222 fixed-size bitvectors; there is also basic support for higher-order
3223 features (esp. lambda abstractions). It is an incomplete decision
3224 procedure based on external SMT solvers using the oracle mechanism;
3225 for the SMT solver Z3, this method is proof-producing. Certificates
3226 are provided to avoid calling the external solvers solely for
3227 re-checking proofs. Due to a remote SMT service there is no need for
3228 installing SMT solvers locally. See src/HOL/SMT.
3230 * New commands to load and prove verification conditions generated by
3231 the Boogie program verifier or derived systems (e.g. the Verifying C
3232 Compiler (VCC) or Spec#). See src/HOL/Boogie.
3234 * New counterexample generator tool 'nitpick' based on the Kodkod
3235 relational model finder. See src/HOL/Tools/Nitpick and
3236 src/HOL/Nitpick_Examples.
3238 * New commands 'code_pred' and 'values' to invoke the predicate
3239 compiler and to enumerate values of inductive predicates.
3241 * A tabled implementation of the reflexive transitive closure.
3243 * New implementation of quickcheck uses generic code generator;
3244 default generators are provided for all suitable HOL types, records
3245 and datatypes. Old quickcheck can be re-activated importing theory
3246 Library/SML_Quickcheck.
3248 * New testing tool Mirabelle for automated proof tools. Applies
3249 several tools and tactics like sledgehammer, metis, or quickcheck, to
3250 every proof step in a theory. To be used in batch mode via the
3251 "mirabelle" utility.
3253 * New proof method "sos" (sum of squares) for nonlinear real
3254 arithmetic (originally due to John Harison). It requires theory
3255 Library/Sum_Of_Squares. It is not a complete decision procedure but
3256 works well in practice on quantifier-free real arithmetic with +, -,
3257 *, ^, =, <= and <, i.e. boolean combinations of equalities and
3258 inequalities between polynomials. It makes use of external
3259 semidefinite programming solvers. Method "sos" generates a
3260 certificate that can be pasted into the proof thus avoiding the need
3261 to call an external tool every time the proof is checked. See
3262 src/HOL/Library/Sum_Of_Squares.
3264 * New method "linarith" invokes existing linear arithmetic decision
3267 * New command 'atp_minimal' reduces result produced by Sledgehammer.
3269 * New Sledgehammer option "Full Types" in Proof General settings menu.
3270 Causes full type information to be output to the ATPs. This slows
3271 ATPs down considerably but eliminates a source of unsound "proofs"
3274 * New method "metisFT": A version of metis that uses full type
3275 information in order to avoid failures of proof reconstruction.
3277 * New evaluator "approximate" approximates an real valued term using
3278 the same method as the approximation method.
3280 * Method "approximate" now supports arithmetic expressions as
3281 boundaries of intervals and implements interval splitting and Taylor
3284 * ML antiquotation @{code_datatype} inserts definition of a datatype
3285 generated by the code generator; e.g. see src/HOL/Predicate.thy.
3287 * New theory SupInf of the supremum and infimum operators for sets of
3290 * New theory Probability, which contains a development of measure
3291 theory, eventually leading to Lebesgue integration and probability.
3293 * Extended Multivariate Analysis to include derivation and Brouwer's
3296 * Reorganization of number theory, INCOMPATIBILITY:
3297 - new number theory development for nat and int, in theories Divides
3298 and GCD as well as in new session Number_Theory
3299 - some constants and facts now suffixed with _nat and _int
3301 - former session NumberTheory now named Old_Number_Theory, including
3302 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
3303 - moved theory Pocklington from src/HOL/Library to
3304 src/HOL/Old_Number_Theory
3306 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
3307 lcm of finite and infinite sets. It is shown that they form a complete
3310 * Class semiring_div requires superclass no_zero_divisors and proof of
3311 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
3312 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
3313 generalized to class semiring_div, subsuming former theorems
3314 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
3315 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
3318 * Refinements to lattice classes and sets:
3319 - less default intro/elim rules in locale variant, more default
3320 intro/elim rules in class variant: more uniformity
3321 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
3323 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
3325 - renamed ACI to inf_sup_aci
3326 - new class "boolean_algebra"
3327 - class "complete_lattice" moved to separate theory
3328 "Complete_Lattice"; corresponding constants (and abbreviations)
3329 renamed and with authentic syntax:
3330 Set.Inf ~> Complete_Lattice.Inf
3331 Set.Sup ~> Complete_Lattice.Sup
3332 Set.INFI ~> Complete_Lattice.INFI
3333 Set.SUPR ~> Complete_Lattice.SUPR
3334 Set.Inter ~> Complete_Lattice.Inter
3335 Set.Union ~> Complete_Lattice.Union
3336 Set.INTER ~> Complete_Lattice.INTER
3337 Set.UNION ~> Complete_Lattice.UNION
3338 - authentic syntax for
3341 - mere abbreviations:
3344 Set.inter (for inf, formerly Set.Int)
3345 Set.union (for sup, formerly Set.Un)
3346 Complete_Lattice.Inter (for Inf)
3347 Complete_Lattice.Union (for Sup)
3348 Complete_Lattice.INTER (for INFI)
3349 Complete_Lattice.UNION (for SUPR)
3350 - object-logic definitions as far as appropriate
3352 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
3353 Un_subset_iff are explicitly deleted as default simp rules; then also
3354 their lattice counterparts le_inf_iff and le_sup_iff have to be
3355 deleted to achieve the desired effect.
3357 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
3358 rules by default any longer; the same applies to min_max.inf_absorb1
3359 etc. INCOMPATIBILITY.
3361 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
3362 pred_set_conv by default. INCOMPATIBILITY.
3364 * Power operations on relations and functions are now one dedicated
3365 constant "compow" with infix syntax "^^". Power operation on
3366 multiplicative monoids retains syntax "^" and is now defined generic
3367 in class power. INCOMPATIBILITY.
3369 * Relation composition "R O S" now has a more standard argument order:
3370 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
3371 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
3372 break, since the O_assoc rule was not rewritten like this. Fix using
3373 O_assoc[symmetric]. The same applies to the curried version "R OO S".
3375 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
3376 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
3379 * Most rules produced by inductive and datatype package have mandatory
3380 prefixes. INCOMPATIBILITY.
3382 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
3383 the attribute of the same name. Each of the theorems in the list
3384 DERIV_intros assumes composition with an additional function and
3385 matches a variable to the derivative, which has to be solved by the
3386 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
3387 of most elementary terms. Former Maclauren.DERIV_tac and
3388 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
3391 * Code generator attributes follow the usual underscore convention:
3392 code_unfold replaces code unfold
3393 code_post replaces code post
3398 sizechange -> size_change
3399 induct_scheme -> induction_schema
3402 * Discontinued abbreviation "arbitrary" of constant "undefined".
3403 INCOMPATIBILITY, use "undefined" directly.
3406 Suc_eq_add_numeral_1 -> Suc_eq_plus1
3407 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
3408 Suc_plus1 -> Suc_eq_plus1
3409 *anti_sym -> *antisym*
3410 vector_less_eq_def -> vector_le_def
3413 * Added theorem List.map_map as [simp]. Removed List.map_compose.
3416 * Removed predicate "M hassize n" (<--> card M = n & finite M).
3422 * Theory Representable defines a class "rep" of domains that are
3423 representable (via an ep-pair) in the universal domain type "udom".
3424 Instances are provided for all type constructors defined in HOLCF.
3426 * The 'new_domain' command is a purely definitional version of the
3427 domain package, for representable domains. Syntax is identical to the
3428 old domain package. The 'new_domain' package also supports indirect
3429 recursion using previously-defined type constructors. See
3430 src/HOLCF/ex/New_Domain.thy for examples.
3432 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
3433 on the left-hand side of an equation, and then performs
3434 simplification. Rewriting is done using rules declared with the
3435 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
3436 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
3438 * The pattern-match compiler in 'fixrec' can now handle constructors
3439 with HOL function types. Pattern-match combinators for the Pair
3440 constructor are pre-configured.
3442 * The 'fixrec' package now produces better fixed-point induction rules
3443 for mutually-recursive definitions: Induction rules have conclusions
3444 of the form "P foo bar" instead of "P <foo, bar>".
3446 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
3447 been renamed to "below". The name "below" now replaces "less" in many
3448 theorem names. (Legacy theorem names using "less" are still supported
3451 * The 'fixrec' package now supports "bottom patterns". Bottom
3452 patterns can be used to generate strictness rules, or to make
3453 functions more strict (much like the bang-patterns supported by the
3454 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
3460 * Support for Poly/ML 5.3.0, with improved reporting of compiler
3461 errors and run-time exceptions, including detailed source positions.
3463 * Structure Name_Space (formerly NameSpace) now manages uniquely
3464 identified entries, with some additional information such as source
3465 position, logical grouping etc.
3467 * Theory and context data is now introduced by the simplified and
3468 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
3469 to be pure, but the old TheoryDataFun for mutable data (with explicit
3470 copy operation) is still available for some time.
3472 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
3473 provides a high-level programming interface to synchronized state
3474 variables with atomic update. This works via pure function
3475 application within a critical section -- its runtime should be as
3476 short as possible; beware of deadlocks if critical code is nested,
3477 either directly or indirectly via other synchronized variables!
3479 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
3480 wraps raw ML references, explicitly indicating their non-thread-safe
3481 behaviour. The Isar toplevel keeps this structure open, to
3482 accommodate Proof General as well as quick and dirty interactive
3483 experiments with references.
3485 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
3486 parallel tactical reasoning.
3488 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
3489 are similar to SUBPROOF, but are slightly more flexible: only the
3490 specified parts of the subgoal are imported into the context, and the
3491 body tactic may introduce new subgoals and schematic variables.
3493 * Old tactical METAHYPS, which does not observe the proof context, has
3494 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
3495 or Subgoal.FOCUS etc.
3497 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
3498 functors have their own ML name space there is no point to mark them
3499 separately.) Minor INCOMPATIBILITY.
3501 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
3503 * Renamed several structures FooBar to Foo_Bar. Occasional,
3506 * Operations of structure Skip_Proof no longer require quick_and_dirty
3507 mode, which avoids critical setmp.
3509 * Eliminated old Attrib.add_attributes, Method.add_methods and related
3510 combinators for "args". INCOMPATIBILITY, need to use simplified
3511 Attrib/Method.setup introduced in Isabelle2009.
3513 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
3514 back on global_simpset_of, global_claset_of, global_clasimpset_of as
3515 last resort. INCOMPATIBILITY.
3517 * Display.pretty_thm now requires a proper context (cf. former
3518 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
3519 or even Display.pretty_thm_without_context as last resort.
3522 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
3523 Syntax.pretty_typ/term directly, preferably with proper context
3524 instead of global theory.
3529 * Further fine tuning of parallel proof checking, scales up to 8 cores
3530 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
3533 * Support for additional "Isabelle components" via etc/components, see
3534 also the system manual.
3536 * The isabelle makeall tool now operates on all components with
3537 IsaMakefile, not just hardwired "logics".
3539 * Removed "compress" option from isabelle-process and isabelle usedir;
3540 this is always enabled.
3542 * Discontinued support for Poly/ML 4.x versions.
3544 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
3545 on a given logic image. This requires the lighttpd webserver and is
3546 currently supported on Linux only.
3550 New in Isabelle2009 (April 2009)
3551 --------------------------------
3555 * Simplified main Isabelle executables, with less surprises on
3556 case-insensitive file-systems (such as Mac OS).
3558 - The main Isabelle tool wrapper is now called "isabelle" instead of
3561 - The former "isabelle" alias for "isabelle-process" has been
3562 removed (should rarely occur to regular users).
3564 - The former "isabelle-interface" and its alias "Isabelle" have been
3565 removed (interfaces are now regular Isabelle tools).
3567 Within scripts and make files, the Isabelle environment variables
3568 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
3569 respectively. (The latter are still available as legacy feature.)
3571 The old isabelle-interface wrapper could react in confusing ways if
3572 the interface was uninstalled or changed otherwise. Individual
3573 interface tool configuration is now more explicit, see also the
3574 Isabelle system manual. In particular, Proof General is now available
3575 via "isabelle emacs".
3577 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
3578 purge installed copies of Isabelle executables and re-run "isabelle
3579 install -p ...", or use symlinks.
3581 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
3582 old ~/isabelle, which was slightly non-standard and apt to cause
3583 surprises on case-insensitive file-systems (such as Mac OS).
3585 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
3586 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
3587 care is required when using older releases of Isabelle. Note that
3588 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
3589 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
3591 * Proofs of fully specified statements are run in parallel on
3592 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
3593 a regular 4-core machine, if the initial heap space is made reasonably
3594 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
3596 * The main reference manuals ("isar-ref", "implementation", and
3597 "system") have been updated and extended. Formally checked references
3598 as hyperlinks are now available uniformly.
3603 * Complete re-implementation of locales. INCOMPATIBILITY in several
3604 respects. The most important changes are listed below. See the
3605 Tutorial on Locales ("locales" manual) for details.
3607 - In locale expressions, instantiation replaces renaming. Parameters
3608 must be declared in a for clause. To aid compatibility with previous
3609 parameter inheritance, in locale declarations, parameters that are not
3610 'touched' (instantiation position "_" or omitted) are implicitly added
3611 with their syntax at the beginning of the for clause.
3613 - Syntax from abbreviations and definitions in locales is available in
3614 locale expressions and context elements. The latter is particularly
3615 useful in locale declarations.
3617 - More flexible mechanisms to qualify names generated by locale
3618 expressions. Qualifiers (prefixes) may be specified in locale
3619 expressions, and can be marked as mandatory (syntax: "name!:") or
3620 optional (syntax "name?:"). The default depends for plain "name:"
3621 depends on the situation where a locale expression is used: in
3622 commands 'locale' and 'sublocale' prefixes are optional, in
3623 'interpretation' and 'interpret' prefixes are mandatory. The old
3624 implicit qualifiers derived from the parameter names of a locale are
3625 no longer generated.
3627 - Command "sublocale l < e" replaces "interpretation l < e". The
3628 instantiation clause in "interpretation" and "interpret" (square
3629 brackets) is no longer available. Use locale expressions.
3631 - When converting proof scripts, mandatory qualifiers in
3632 'interpretation' and 'interpret' should be retained by default, even
3633 if this is an INCOMPATIBILITY compared to former behavior. In the
3634 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
3635 in locale expressions range over a single locale instance only.
3637 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
3638 In existing theorem specifications replace the includes element by the
3639 respective context elements of the included locale, omitting those
3640 that are already present in the theorem specification. Multiple
3641 assume elements of a locale should be replaced by a single one
3642 involving the locale predicate. In the proof body, declarations (most
3643 notably theorems) may be regained by interpreting the respective
3644 locales in the proof context as required (command "interpret").
3646 If using "includes" in replacement of a target solely because the
3647 parameter types in the theorem are not as general as in the target,
3648 consider declaring a new locale with additional type constraints on
3649 the parameters (context element "constrains").
3651 - Discontinued "locale (open)". INCOMPATIBILITY.
3653 - Locale interpretation commands no longer attempt to simplify goal.
3654 INCOMPATIBILITY: in rare situations the generated goal differs. Use
3655 methods intro_locales and unfold_locales to clarify.
3657 - Locale interpretation commands no longer accept interpretation
3658 attributes. INCOMPATIBILITY.
3660 * Class declaration: so-called "base sort" must not be given in import
3661 list any longer, but is inferred from the specification. Particularly
3668 class foo = type + ...
3670 * Class target: global versions of theorems stemming do not carry a
3671 parameter prefix any longer. INCOMPATIBILITY.
3673 * Class 'instance' command no longer accepts attached definitions.
3674 INCOMPATIBILITY, use proper 'instantiation' target instead.
3676 * Recovered hiding of consts, which was accidentally broken in
3677 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
3678 makes c inaccessible; consider using ``hide (open) const c'' instead.
3680 * Slightly more coherent Pure syntax, with updated documentation in
3681 isar-ref manual. Removed locales meta_term_syntax and
3682 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
3683 INCOMPATIBILITY in rare situations. Note that &&& should not be used
3684 directly in regular applications.
3686 * There is a new syntactic category "float_const" for signed decimal
3687 fractions (e.g. 123.45 or -123.45).
3689 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
3690 interface with 'setup' command instead.
3692 * Command 'local_setup' is similar to 'setup', but operates on a local
3695 * The 'axiomatization' command now only works within a global theory
3696 context. INCOMPATIBILITY.
3698 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
3699 hypotheses. Sorts required in the course of reasoning need to be
3700 covered by the constraints in the initial statement, completed by the
3701 type instance information of the background theory. Non-trivial sort
3702 hypotheses, which rarely occur in practice, may be specified via
3703 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
3705 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
3707 The result contains an implicit sort hypotheses as before --
3708 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
3711 * Generalized Isar history, with support for linear undo, direct state
3714 * Changed defaults for unify configuration options:
3716 unify_trace_bound = 50 (formerly 25)
3717 unify_search_bound = 60 (formerly 30)
3719 * Different bookkeeping for code equations (INCOMPATIBILITY):
3721 a) On theory merge, the last set of code equations for a particular
3722 constant is taken (in accordance with the policy applied by other
3723 parts of the code generator framework).
3725 b) Code equations stemming from explicit declarations (e.g. code
3726 attribute) gain priority over default code equations stemming
3727 from definition, primrec, fun etc.
3729 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
3731 * Unified theorem tables for both code generators. Thus [code
3732 func] has disappeared and only [code] remains. INCOMPATIBILITY.
3734 * Command 'find_consts' searches for constants based on type and name
3737 find_consts "_ => bool"
3739 By default, matching is against subtypes, but it may be restricted to
3740 the whole type. Searching by name is possible. Multiple queries are
3741 conjunctive and queries may be negated by prefixing them with a
3744 find_consts strict: "_ => bool" name: "Int" -"int => int"
3746 * New 'find_theorems' criterion "solves" matches theorems that
3747 directly solve the current goal (modulo higher-order unification).
3749 * Auto solve feature for main theorem statements: whenever a new goal
3750 is stated, "find_theorems solves" is called; any theorems that could
3751 solve the lemma directly are listed as part of the goal state.
3752 Cf. associated options in Proof General Isabelle settings menu,
3753 enabled by default, with reasonable timeout for pathological cases of
3754 higher-order unification.
3757 *** Document preparation ***
3759 * Antiquotation @{lemma} now imitates a regular terminal proof,
3760 demanding keyword 'by' and supporting the full method expression
3761 syntax just like the Isar command 'by'.
3766 * Integrated main parts of former image HOL-Complex with HOL. Entry
3767 points Main and Complex_Main remain as before.
3769 * Logic image HOL-Plain provides a minimal HOL with the most important
3770 tools available (inductive, datatype, primrec, ...). This facilitates
3771 experimentation and tool development. Note that user applications
3772 (and library theories) should never refer to anything below theory
3775 * Logic image HOL-Main stops at theory Main, and thus facilitates
3776 experimentation due to shorter build times.
3778 * Logic image HOL-NSA contains theories of nonstandard analysis which
3779 were previously part of former HOL-Complex. Entry point Hyperreal
3780 remains valid, but theories formerly using Complex_Main should now use
3781 new entry point Hypercomplex.
3783 * Generic ATP manager for Sledgehammer, based on ML threads instead of
3784 Posix processes. Avoids potentially expensive forking of the ML
3785 process. New thread-based implementation also works on non-Unix
3786 platforms (Cygwin). Provers are no longer hardwired, but defined
3787 within the theory via plain ML wrapper functions. Basic Sledgehammer
3788 commands are covered in the isar-ref manual.
3790 * Wrapper scripts for remote SystemOnTPTP service allows to use
3791 sledgehammer without local ATP installation (Vampire etc.). Other
3792 provers may be included via suitable ML wrappers, see also
3793 src/HOL/ATP_Linkup.thy.
3795 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
3798 * The metis method no longer fails because the theorem is too trivial
3799 (contains the empty clause).
3801 * The metis method now fails in the usual manner, rather than raising
3802 an exception, if it determines that it cannot prove the theorem.
3804 * Method "coherent" implements a prover for coherent logic (see also
3805 src/Tools/coherent.ML).
3807 * Constants "undefined" and "default" replace "arbitrary". Usually
3808 "undefined" is the right choice to replace "arbitrary", though
3809 logically there is no difference. INCOMPATIBILITY.
3811 * Command "value" now integrates different evaluation mechanisms. The
3812 result of the first successful evaluation mechanism is printed. In
3813 square brackets a particular named evaluation mechanisms may be
3814 specified (currently, [SML], [code] or [nbe]). See further
3815 src/HOL/ex/Eval_Examples.thy.
3817 * Normalization by evaluation now allows non-leftlinear equations.
3818 Declare with attribute [code nbe].
3820 * Methods "case_tac" and "induct_tac" now refer to the very same rules
3821 as the structured Isar versions "cases" and "induct", cf. the
3822 corresponding "cases" and "induct" attributes. Mutual induction rules
3823 are now presented as a list of individual projections
3824 (e.g. foo_bar.inducts for types foo and bar); the old format with
3825 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
3826 rare situations a different rule is selected --- notably nested tuple
3827 elimination instead of former prod.exhaust: use explicit (case_tac t
3828 rule: prod.exhaust) here.
3830 * Attributes "cases", "induct", "coinduct" support "del" option.
3832 * Removed fact "case_split_thm", which duplicates "case_split".
3834 * The option datatype has been moved to a new theory Option. Renamed
3835 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
3837 * New predicate "strict_mono" classifies strict functions on partial
3838 orders. With strict functions on linear orders, reasoning about
3839 (in)equalities is facilitated by theorems "strict_mono_eq",
3840 "strict_mono_less_eq" and "strict_mono_less".
3842 * Some set operations are now proper qualified constants with
3843 authentic syntax. INCOMPATIBILITY:
3854 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
3857 * Auxiliary class "itself" has disappeared -- classes without any
3858 parameter are treated as expected by the 'class' command.
3860 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
3862 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
3863 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
3865 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
3866 method "approximation". It proves formulas on real values by using
3867 interval arithmetic. In the formulas are also the transcendental
3868 functions sin, cos, tan, atan, ln, exp and the constant pi are
3869 allowed. For examples see
3870 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
3872 * Theory "Reflection" now resides in HOL/Library.
3874 * Entry point to Word library now simply named "Word".
3877 * Made source layout more coherent with logical distribution
3880 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
3881 src/HOL/Library/Code_Message.thy ~> src/HOL/
3882 src/HOL/Library/GCD.thy ~> src/HOL/
3883 src/HOL/Library/Order_Relation.thy ~> src/HOL/
3884 src/HOL/Library/Parity.thy ~> src/HOL/
3885 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
3886 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
3887 src/HOL/Real/Lubs.thy ~> src/HOL/
3888 src/HOL/Real/PReal.thy ~> src/HOL/
3889 src/HOL/Real/Rational.thy ~> src/HOL/
3890 src/HOL/Real/RComplete.thy ~> src/HOL/
3891 src/HOL/Real/RealDef.thy ~> src/HOL/
3892 src/HOL/Real/RealPow.thy ~> src/HOL/
3893 src/HOL/Real/Real.thy ~> src/HOL/
3894 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
3895 src/HOL/Complex/Complex.thy ~> src/HOL/
3896 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
3897 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
3898 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
3899 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
3900 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
3901 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
3902 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
3903 src/HOL/Hyperreal/Log.thy ~> src/HOL/
3904 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
3905 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
3906 src/HOL/Hyperreal/Series.thy ~> src/HOL/
3907 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
3908 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
3909 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
3910 src/HOL/Real/Float ~> src/HOL/Library/
3911 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
3912 src/HOL/Real/RealVector.thy ~> src/HOL/
3914 src/HOL/arith_data.ML ~> src/HOL/Tools
3915 src/HOL/hologic.ML ~> src/HOL/Tools
3916 src/HOL/simpdata.ML ~> src/HOL/Tools
3917 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
3918 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
3919 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
3920 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
3921 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
3922 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
3923 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
3925 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
3926 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
3927 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
3928 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
3929 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
3930 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
3932 * If methods "eval" and "evaluation" encounter a structured proof
3933 state with !!/==>, only the conclusion is evaluated to True (if
3934 possible), avoiding strange error messages.
3936 * Method "sizechange" automates termination proofs using (a
3937 modification of) the size-change principle. Requires SAT solver. See
3938 src/HOL/ex/Termination.thy for examples.
3940 * Simplifier: simproc for let expressions now unfolds if bound
3941 variable occurs at most once in let expression body. INCOMPATIBILITY.
3943 * Method "arith": Linear arithmetic now ignores all inequalities when
3944 fast_arith_neq_limit is exceeded, instead of giving up entirely.
3946 * New attribute "arith" for facts that should always be used
3947 automatically by arithmetic. It is intended to be used locally in
3950 assumes [arith]: "x > 0"
3952 Global usage is discouraged because of possible performance impact.
3954 * New classes "top" and "bot" with corresponding operations "top" and
3955 "bot" in theory Orderings; instantiation of class "complete_lattice"
3956 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
3958 * Changed definition lemma "less_fun_def" in order to provide an
3959 instance for preorders on functions; use lemma "less_le" instead.
3962 * Theory Orderings: class "wellorder" moved here, with explicit
3963 induction rule "less_induct" as assumption. For instantiation of
3964 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
3967 * Theory Orderings: added class "preorder" as superclass of "order".
3968 INCOMPATIBILITY: Instantiation proofs for order, linorder
3969 etc. slightly changed. Some theorems named order_class.* now named
3972 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
3975 * Theory Finite_Set: added a new fold combinator of type
3977 ('a => 'b => 'b) => 'b => 'a set => 'b
3979 Occasionally this is more convenient than the old fold combinator
3980 which is now defined in terms of the new one and renamed to
3983 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
3984 and "ring_simps" have been replaced by "algebra_simps" (which can be
3985 extended with further lemmas!). At the moment both still exist but
3986 the former will disappear at some point.
3988 * Theory Power: Lemma power_Suc is now declared as a simp rule in
3989 class recpower. Type-specific simp rules for various recpower types
3990 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
3992 rat_power_0 -> power_0
3993 rat_power_Suc -> power_Suc
3994 realpow_0 -> power_0
3995 realpow_Suc -> power_Suc
3996 complexpow_0 -> power_0
3997 complexpow_Suc -> power_Suc
3998 power_poly_0 -> power_0
3999 power_poly_Suc -> power_Suc
4001 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
4002 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
4003 dvd has been generalized to class comm_semiring_1. Likewise a bunch
4004 of lemmas from Divides has been generalized from nat to class
4005 semiring_div. INCOMPATIBILITY. This involves the following theorem
4006 renames resulting from duplicate elimination:
4008 dvd_def_mod ~> dvd_eq_mod_eq_0
4009 zero_dvd_iff ~> dvd_0_left_iff
4010 dvd_0 ~> dvd_0_right
4011 DIVISION_BY_ZERO_DIV ~> div_by_0
4012 DIVISION_BY_ZERO_MOD ~> mod_by_0
4013 mult_div ~> div_mult_self2_is_id
4014 mult_mod ~> mod_mult_self2_is_0
4016 * Theory IntDiv: removed many lemmas that are instances of class-based
4017 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
4018 rename old lemmas as follows:
4020 dvd_diff -> nat_dvd_diff
4021 dvd_zminus_iff -> dvd_minus_iff
4022 mod_add1_eq -> mod_add_eq
4023 mod_mult1_eq -> mod_mult_right_eq
4024 mod_mult1_eq' -> mod_mult_left_eq
4025 mod_mult_distrib_mod -> mod_mult_eq
4026 nat_mod_add_left_eq -> mod_add_left_eq
4027 nat_mod_add_right_eq -> mod_add_right_eq
4028 nat_mod_div_trivial -> mod_div_trivial
4029 nat_mod_mod_trivial -> mod_mod_trivial
4030 zdiv_zadd_self1 -> div_add_self1
4031 zdiv_zadd_self2 -> div_add_self2
4032 zdiv_zmult_self1 -> div_mult_self2_is_id
4033 zdiv_zmult_self2 -> div_mult_self1_is_id
4034 zdvd_triv_left -> dvd_triv_left
4035 zdvd_triv_right -> dvd_triv_right
4036 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
4037 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
4038 zmod_zadd_left_eq -> mod_add_left_eq
4039 zmod_zadd_right_eq -> mod_add_right_eq
4040 zmod_zadd_self1 -> mod_add_self1
4041 zmod_zadd_self2 -> mod_add_self2
4042 zmod_zadd1_eq -> mod_add_eq
4043 zmod_zdiff1_eq -> mod_diff_eq
4044 zmod_zdvd_zmod -> mod_mod_cancel
4045 zmod_zmod_cancel -> mod_mod_cancel
4046 zmod_zmult_self1 -> mod_mult_self2_is_0
4047 zmod_zmult_self2 -> mod_mult_self1_is_0
4050 zdvd_abs1 -> abs_dvd_iff
4051 zdvd_abs2 -> dvd_abs_iff
4052 zdvd_refl -> dvd_refl
4053 zdvd_trans -> dvd_trans
4054 zdvd_zadd -> dvd_add
4055 zdvd_zdiff -> dvd_diff
4056 zdvd_zminus_iff -> dvd_minus_iff
4057 zdvd_zminus2_iff -> minus_dvd_iff
4058 zdvd_zmultD -> dvd_mult_right
4059 zdvd_zmultD2 -> dvd_mult_left
4060 zdvd_zmult_mono -> mult_dvd_mono
4061 zdvd_0_right -> dvd_0_right
4062 zdvd_0_left -> dvd_0_left_iff
4063 zdvd_1_left -> one_dvd
4064 zminus_dvd_iff -> minus_dvd_iff
4066 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
4068 * The real numbers offer decimal input syntax: 12.34 is translated
4069 into 1234/10^2. This translation is not reversed upon output.
4071 * Theory Library/Polynomial defines an abstract type 'a poly of
4072 univariate polynomials with coefficients of type 'a. In addition to
4073 the standard ring operations, it also supports div and mod. Code
4074 generation is also supported, using list-style constructors.
4076 * Theory Library/Inner_Product defines a class of real_inner for real
4077 inner product spaces, with an overloaded operation inner :: 'a => 'a
4078 => real. Class real_inner is a subclass of real_normed_vector from
4081 * Theory Library/Product_Vector provides instances for the product
4082 type 'a * 'b of several classes from RealVector and Inner_Product.
4083 Definitions of addition, subtraction, scalar multiplication, norms,
4084 and inner products are included.
4086 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
4087 addition to the field operations, numerals and case syntax are also
4090 * Theory Library/Diagonalize provides constructive version of Cantor's
4091 first diagonalization argument.
4093 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
4094 zlcm (for int); carried together from various gcd/lcm developements in
4095 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
4096 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
4097 may recover tupled syntax as follows:
4099 hide (open) const gcd
4100 abbreviation gcd where
4101 "gcd == (%(a, b). GCD.gcd a b)"
4103 GCD.gcd ("gcd '(_, _')")
4105 The same works for lcm, zgcd, zlcm.
4107 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
4108 instantiations for algebraic structures. Removed some duplicate
4109 theorems. Changes in simp rules. INCOMPATIBILITY.
4111 * ML antiquotation @{code} takes a constant as argument and generates
4112 corresponding code in background and inserts name of the corresponding
4113 resulting ML value/function/datatype constructor binding in place.
4114 All occurrences of @{code} with a single ML block are generated
4115 simultaneously. Provides a generic and safe interface for
4116 instrumentalizing code generation. See
4117 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
4118 In future you ought to refrain from ad-hoc compiling generated SML
4119 code on the ML toplevel. Note that (for technical reasons) @{code}
4120 cannot refer to constants for which user-defined serializations are
4121 set. Refer to the corresponding ML counterpart directly in that
4124 * Command 'rep_datatype': instead of theorem names the command now
4125 takes a list of terms denoting the constructors of the type to be
4126 represented as datatype. The characteristic theorems have to be
4127 proven. INCOMPATIBILITY. Also observe that the following theorems
4128 have disappeared in favour of existing ones:
4130 unit_induct ~> unit.induct
4131 prod_induct ~> prod.induct
4132 sum_induct ~> sum.induct
4133 Suc_Suc_eq ~> nat.inject
4134 Suc_not_Zero Zero_not_Suc ~> nat.distinct
4139 * New locales for orders and lattices where the equivalence relation
4140 is not restricted to equality. INCOMPATIBILITY: all order and lattice
4141 locales use a record structure with field eq for the equivalence.
4143 * New theory of factorial domains.
4145 * Units_l_inv and Units_r_inv are now simp rules by default.
4146 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
4147 and/or r_inv will now also require deletion of these lemmas.
4149 * Renamed the following theorems, INCOMPATIBILITY:
4151 UpperD ~> Upper_memD
4152 LowerD ~> Lower_memD
4153 least_carrier ~> least_closed
4154 greatest_carrier ~> greatest_closed
4155 greatest_Lower_above ~> greatest_Lower_below
4156 one_zero ~> carrier_one_zero
4157 one_not_zero ~> carrier_one_not_zero (collision with assumption)
4162 * Nominal datatypes can now contain type-variables.
4164 * Commands 'nominal_inductive' and 'equivariance' work with local
4167 * Nominal primrec can now works with local theory targets and its
4168 specification syntax now conforms to the general format as seen in
4171 * Method "perm_simp" honours the standard simplifier attributes
4172 (no_asm), (no_asm_use) etc.
4174 * The new predicate #* is defined like freshness, except that on the
4175 left hand side can be a set or list of atoms.
4177 * Experimental command 'nominal_inductive2' derives strong induction
4178 principles for inductive definitions. In contrast to
4179 'nominal_inductive', which can only deal with a fixed number of
4180 binders, it can deal with arbitrary expressions standing for sets of
4181 atoms to be avoided. The only inductive definition we have at the
4182 moment that needs this generalisation is the typing rule for Lets in
4185 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
4186 -----------------------------------------------------------------
4187 Gamma |- Let x be t1 in t2 : T2
4189 In this rule one wants to avoid all the binders that are introduced by
4190 "close Gamma T1". We are looking for other examples where this
4191 feature might be useful. Please let us know.
4196 * Reimplemented the simplification procedure for proving continuity
4197 subgoals. The new simproc is extensible; users can declare additional
4198 continuity introduction rules with the attribute [cont2cont].
4200 * The continuity simproc now uses a different introduction rule for
4201 solving continuity subgoals on terms with lambda abstractions. In
4202 some rare cases the new simproc may fail to solve subgoals that the
4203 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
4204 Potential INCOMPATIBILITY.
4206 * Command 'fixrec': specification syntax now conforms to the general
4207 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
4208 examples. INCOMPATIBILITY.
4213 * Proof of Zorn's Lemma for partial orders.
4218 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
4219 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
4220 depends on multithreading, so timouts will not work before Poly/ML
4223 * High-level support for concurrent ML programming, see
4224 src/Pure/Cuncurrent. The data-oriented model of "future values" is
4225 particularly convenient to organize independent functional
4226 computations. The concept of "synchronized variables" provides a
4227 higher-order interface for components with shared state, avoiding the
4228 delicate details of mutexes and condition variables. (Requires
4229 Poly/ML 5.2.1 or later.)
4231 * ML bindings produced via Isar commands are stored within the Isar
4232 context (theory or proof). Consequently, commands like 'use' and 'ML'
4233 become thread-safe and work with undo as expected (concerning
4234 top-level bindings, not side-effects on global references).
4235 INCOMPATIBILITY, need to provide proper Isar context when invoking the
4236 compiler at runtime; really global bindings need to be given outside a
4237 theory. (Requires Poly/ML 5.2 or later.)
4239 * Command 'ML_prf' is analogous to 'ML' but works within a proof
4240 context. Top-level ML bindings are stored within the proof context in
4241 a purely sequential fashion, disregarding the nested proof structure.
4242 ML bindings introduced by 'ML_prf' are discarded at the end of the
4243 proof. (Requires Poly/ML 5.2 or later.)
4245 * Simplified ML attribute and method setup, cf. functions Attrib.setup
4246 and Method.setup, as well as Isar commands 'attribute_setup' and
4247 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
4248 existing code accordingly, or use plain 'setup' together with old
4251 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
4252 to 'a -> thm, while results are always tagged with an authentic oracle
4253 name. The Isar command 'oracle' is now polymorphic, no argument type
4254 is specified. INCOMPATIBILITY, need to simplify existing oracle code
4255 accordingly. Note that extra performance may be gained by producing
4256 the cterm carefully, avoiding slow Thm.cterm_of.
4258 * Simplified interface for defining document antiquotations via
4259 ThyOutput.antiquotation, ThyOutput.output, and optionally
4260 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
4261 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
4264 * More systematic treatment of long names, abstract name bindings, and
4265 name space operations. Basic operations on qualified names have been
4266 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
4267 Long_Name.append. Old type bstring has been mostly replaced by
4268 abstract type binding (see structure Binding), which supports precise
4269 qualification by packages and local theory targets, as well as proper
4270 tracking of source positions. INCOMPATIBILITY, need to wrap old
4271 bstring values into Binding.name, or better pass through abstract
4272 bindings everywhere. See further src/Pure/General/long_name.ML,
4273 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
4275 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
4276 LocalTheory.note etc.) now refer to the *full* internal name, not the
4277 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
4279 * Disposed old type and term read functions (Sign.read_def_typ,
4280 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
4281 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
4282 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
4283 Syntax.read_term_global etc.; see also OldGoals.read_term as last
4284 resort for legacy applications.
4286 * Disposed old declarations, tactics, tactic combinators that refer to
4287 the simpset or claset of an implicit theory (such as Addsimps,
4288 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
4289 embedded ML text, or local_simpset_of with a proper context passed as
4290 explicit runtime argument.
4292 * Rules and tactics that read instantiations (read_instantiate,
4293 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
4294 context, which is required for parsing and type-checking. Moreover,
4295 the variables are specified as plain indexnames, not string encodings
4296 thereof. INCOMPATIBILITY.
4298 * Generic Toplevel.add_hook interface allows to analyze the result of
4299 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
4300 for theorem dependency output of transactions resulting in a new
4303 * ML antiquotations: block-structured compilation context indicated by
4304 \<lbrace> ... \<rbrace>; additional antiquotation forms:
4306 @{binding name} - basic name binding
4307 @{let ?pat = term} - term abbreviation (HO matching)
4308 @{note name = fact} - fact abbreviation
4309 @{thm fact} - singleton fact (with attributes)
4310 @{thms fact} - general fact (with attributes)
4311 @{lemma prop by method} - singleton goal
4312 @{lemma prop by meth1 meth2} - singleton goal
4313 @{lemma prop1 ... propN by method} - general goal
4314 @{lemma prop1 ... propN by meth1 meth2} - general goal
4315 @{lemma (open) ...} - open derivation
4320 * The Isabelle "emacs" tool provides a specific interface to invoke
4321 Proof General / Emacs, with more explicit failure if that is not
4322 installed (the old isabelle-interface script silently falls back on
4323 isabelle-process). The PROOFGENERAL_HOME setting determines the
4324 installation location of the Proof General distribution.
4326 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
4327 the Isabelle process into a JVM/Scala application. See
4328 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
4329 process wrapper has been discontinued.)
4331 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
4333 * Various status messages (with exact source position information) are
4334 emitted, if proper markup print mode is enabled. This allows
4335 user-interface components to provide detailed feedback on internal
4340 New in Isabelle2008 (June 2008)
4341 -------------------------------
4345 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
4346 and updated, with formally checked references as hyperlinks.
4348 * Theory loader: use_thy (and similar operations) no longer set the
4349 implicit ML context, which was occasionally hard to predict and in
4350 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
4351 provides a proper context already.
4353 * Theory loader: old-style ML proof scripts being *attached* to a thy
4354 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
4355 'use' within a theory file will do the job.
4357 * Name space merge now observes canonical order, i.e. the second space
4358 is inserted into the first one, while existing entries in the first
4359 space take precedence. INCOMPATIBILITY in rare situations, may try to
4360 swap theory imports.
4362 * Syntax: symbol \<chi> is now considered a letter. Potential
4363 INCOMPATIBILITY in identifier syntax etc.
4365 * Outer syntax: string tokens no longer admit escaped white space,
4366 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
4367 white space without escapes.
4369 * Outer syntax: string tokens may contain arbitrary character codes
4370 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
4376 * Context-dependent token translations. Default setup reverts locally
4377 fixed variables, and adds hilite markup for undeclared frees.
4379 * Unused theorems can be found using the new command 'unused_thms'.
4380 There are three ways of invoking it:
4383 Only finds unused theorems in the current theory.
4385 (2) unused_thms thy_1 ... thy_n -
4386 Finds unused theorems in the current theory and all of its ancestors,
4387 excluding the theories thy_1 ... thy_n and all of their ancestors.
4389 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
4390 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
4391 their ancestors, excluding the theories thy_1 ... thy_n and all of
4394 In order to increase the readability of the list produced by
4395 unused_thms, theorems that have been created by a particular instance
4396 of a theory command such as 'inductive' or 'function' are considered
4397 to belong to the same "group", meaning that if at least one theorem in
4398 this group is used, the other theorems in the same group are no longer
4399 reported as unused. Moreover, if all theorems in the group are
4400 unused, only one theorem in the group is displayed.
4402 Note that proof objects have to be switched on in order for
4403 unused_thms to work properly (i.e. !proofs must be >= 1, which is
4404 usually the case when using Proof General with the default settings).
4406 * Authentic naming of facts disallows ad-hoc overwriting of previous
4407 theorems within the same name space. INCOMPATIBILITY, need to remove
4408 duplicate fact bindings, or even accidental fact duplications. Note
4409 that tools may maintain dynamically scoped facts systematically, using
4410 PureThy.add_thms_dynamic.
4412 * Command 'hide' now allows to hide from "fact" name space as well.
4414 * Eliminated destructive theorem database, simpset, claset, and
4415 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
4416 update of theories within ML code.
4418 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
4419 INCOMPATIBILITY, object-logics depending on former Pure require
4420 additional setup PureThy.old_appl_syntax_setup; object-logics
4421 depending on former CPure need to refer to Pure.
4423 * Commands 'use' and 'ML' are now purely functional, operating on
4424 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
4425 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
4428 * Command 'setup': discontinued implicit version with ML reference.
4430 * Instantiation target allows for simultaneous specification of class
4431 instance operations together with an instantiation proof.
4432 Type-checking phase allows to refer to class operations uniformly.
4433 See src/HOL/Complex/Complex.thy for an Isar example and
4434 src/HOL/Library/Eval.thy for an ML example.
4436 * Indexing of literal facts: be more serious about including only
4437 facts from the visible specification/proof context, but not the
4438 background context (locale etc.). Affects `prop` notation and method
4439 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
4442 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
4443 "(open)" option, which used to expose internal bound variables to the
4446 * Isar statements: removed obsolete case "rule_context".
4447 INCOMPATIBILITY, better use explicit fixes/assumes.
4449 * Locale proofs: default proof step now includes 'unfold_locales';
4450 hence 'proof' without argument may be used to unfold locale
4454 *** Document preparation ***
4456 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
4457 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
4458 obsolete thumbpdf setup (contemporary PDF viewers do this on the
4459 spot); renamed link color from "darkblue" to "linkcolor" (default
4460 value unchanged, can be redefined via \definecolor); no longer sets
4461 "a4paper" option (unnecessary or even intrusive).
4463 * Antiquotation @{lemma A method} proves proposition A by the given
4464 method (either a method name or a method name plus (optional) method
4465 arguments in parentheses) and prints A just like @{prop A}.
4470 * New primrec package. Specification syntax conforms in style to
4471 definition/function/.... No separate induction rule is provided. The
4472 "primrec" command distinguishes old-style and new-style specifications
4473 by syntax. The former primrec package is now named OldPrimrecPackage.
4474 When adjusting theories, beware: constants stemming from new-style
4475 primrec specifications have authentic syntax.
4477 * Metis prover is now an order of magnitude faster, and also works
4478 with multithreading.
4480 * Metis: the maximum number of clauses that can be produced from a
4481 theorem is now given by the attribute max_clauses. Theorems that
4482 exceed this number are ignored, with a warning printed.
4484 * Sledgehammer no longer produces structured proofs by default. To
4485 enable, declare [[sledgehammer_full = true]]. Attributes
4486 reconstruction_modulus, reconstruction_sorts renamed
4487 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
4489 * Method "induct_scheme" derives user-specified induction rules
4490 from well-founded induction and completeness of patterns. This factors
4491 out some operations that are done internally by the function package
4492 and makes them available separately. See
4493 src/HOL/ex/Induction_Scheme.thy for examples.
4495 * More flexible generation of measure functions for termination
4496 proofs: Measure functions can be declared by proving a rule of the
4497 form "is_measure f" and giving it the [measure_function] attribute.
4498 The "is_measure" predicate is logically meaningless (always true), and
4499 just guides the heuristic. To find suitable measure functions, the
4500 termination prover sets up the goal "is_measure ?f" of the appropriate
4501 type and generates all solutions by prolog-style backwards proof using
4504 This setup also deals with rules like
4506 "is_measure f ==> is_measure (list_size f)"
4508 which accommodates nested datatypes that recurse through lists.
4509 Similar rules are predeclared for products and option types.
4511 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
4515 - Definitions of overloaded constants on sets have to be replaced by
4516 definitions on => and bool.
4518 - Some definitions of overloaded operators on sets can now be proved
4519 using the definitions of the operators on => and bool. Therefore,
4520 the following theorems have been renamed:
4522 subset_def -> subset_eq
4523 psubset_def -> psubset_eq
4524 set_diff_def -> set_diff_eq
4525 Compl_def -> Compl_eq
4526 Sup_set_def -> Sup_set_eq
4527 Inf_set_def -> Inf_set_eq
4528 sup_set_def -> sup_set_eq
4529 inf_set_def -> inf_set_eq
4531 - Due to the incompleteness of the HO unification algorithm, some
4532 rules such as subst may require manual instantiation, if some of
4533 the unknowns in the rule is a set.
4535 - Higher order unification and forward proofs:
4538 have "P (S::'a set)" <...>
4539 then have "EX S. P S" ..
4541 no longer works (due to the incompleteness of the HO unification
4542 algorithm) and must be replaced by the pattern
4549 - Calculational reasoning with subst (or similar rules):
4552 have "P (S::'a set)" <...>
4553 also have "S = T" <...>
4554 finally have "P T" .
4556 no longer works (for similar reasons as the previous example) and
4557 must be replaced by something like
4559 have "P (S::'a set)" <...>
4560 moreover have "S = T" <...>
4561 ultimately have "P T" by simp
4563 - Tactics or packages written in ML code:
4564 Code performing pattern matching on types via
4566 Type ("set", [T]) => ...
4568 must be rewritten. Moreover, functions like strip_type or
4569 binder_types no longer return the right value when applied to a
4572 T1 => ... => Tn => U => bool
4576 T1 => ... => Tn => U set
4578 * Merged theories Wellfounded_Recursion, Accessible_Part and
4579 Wellfounded_Relations to theory Wellfounded.
4581 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
4583 * Class finite no longer treats UNIV as class parameter. Use class
4584 enum from theory Library/Enum instead to achieve a similar effect.
4587 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
4588 and "Cons". INCOMPATIBILITY.
4590 * HOL (and FOL): renamed variables in rules imp_elim and swap.
4591 Potential INCOMPATIBILITY.
4593 * Theory Product_Type: duplicated lemmas split_Pair_apply and
4594 injective_fst_snd removed, use split_eta and prod_eqI instead.
4595 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
4597 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
4598 the same name in theory Orderings:
4608 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
4609 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
4610 and different variable names.
4612 * Library/Option_ord.thy: Canonical order on option type.
4614 * Library/RBT.thy: Red-black trees, an efficient implementation of
4617 * Library/Countable.thy: Type class for countable types.
4619 * Theory Int: The representation of numerals has changed. The infix
4620 operator BIT and the bit datatype with constructors B0 and B1 have
4621 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
4622 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
4623 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
4626 * Theory Nat: definition of <= and < on natural numbers no longer
4627 depend on well-founded relations. INCOMPATIBILITY. Definitions
4628 le_def and less_def have disappeared. Consider lemmas not_less
4629 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
4631 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
4632 (whose purpose mainly is for various fold_set functionals) have been
4633 abandoned in favor of the existing algebraic classes
4634 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
4635 lower_semilattice (resp. upper_semilattice) and linorder.
4638 * Theory Transitive_Closure: induct and cases rules now declare proper
4639 case_names ("base" and "step"). INCOMPATIBILITY.
4641 * Theorem Inductive.lfp_ordinal_induct generalized to complete
4642 lattices. The form set-specific version is available as
4643 Inductive.lfp_ordinal_induct_set.
4645 * Renamed theorems "power.simps" to "power_int.simps".
4648 * Class semiring_div provides basic abstract properties of semirings
4649 with division and modulo operations. Subsumes former class dvd_mod.
4651 * Merged theories IntDef, Numeral and IntArith into unified theory
4652 Int. INCOMPATIBILITY.
4654 * Theory Library/Code_Index: type "index" now represents natural
4655 numbers rather than integers. INCOMPATIBILITY.
4657 * New class "uminus" with operation "uminus" (split of from class
4658 "minus" which now only has operation "minus", binary).
4661 * Constants "card", "internal_split", "option_map" now with authentic
4662 syntax. INCOMPATIBILITY.
4664 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
4665 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
4666 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
4667 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
4668 Sup_set_def, le_def, less_def, option_map_def now with object
4669 equality. INCOMPATIBILITY.
4671 * Records. Removed K_record, and replaced it by pure lambda term
4672 %x. c. The simplifier setup is now more robust against eta expansion.
4673 INCOMPATIBILITY: in cases explicitly referring to K_record.
4675 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
4677 * Library/ListVector: new theory of arithmetic vector operations.
4679 * Library/Order_Relation: new theory of various orderings as sets of
4680 pairs. Defines preorders, partial orders, linear orders and
4681 well-orders on sets and on types.
4686 * Renamed some theories to allow to loading both ZF and HOL in the
4689 Datatype -> Datatype_ZF
4690 Inductive -> Inductive_ZF
4697 INCOMPATIBILITY: ZF theories that import individual theories below
4698 Main might need to be adapted. Regular theory Main is still
4699 available, as trivial extension of Main_ZF.
4704 * ML within Isar: antiquotation @{const name} or @{const
4705 name(typargs)} produces statically-checked Const term.
4707 * Functor NamedThmsFun: data is available to the user as dynamic fact
4708 (of the same name). Removed obsolete print command.
4710 * Removed obsolete "use_legacy_bindings" function.
4712 * The ``print mode'' is now a thread-local value derived from a global
4713 template (the former print_mode reference), thus access becomes
4714 non-critical. The global print_mode reference is for session
4715 management only; user-code should use print_mode_value,
4716 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
4718 * Functions system/system_out provide a robust way to invoke external
4719 shell commands, with propagation of interrupts (requires Poly/ML
4720 5.2.1). Do not use OS.Process.system etc. from the basis library!
4725 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
4726 in accordance with Proof General 3.7, which prefers GNU emacs.
4728 * isatool tty runs Isabelle process with plain tty interaction;
4729 optional line editor may be specified via ISABELLE_LINE_EDITOR
4730 setting, the default settings attempt to locate "ledit" and "rlwrap".
4732 * isatool browser now works with Cygwin as well, using general
4733 "javapath" function defined in Isabelle process environment.
4735 * YXML notation provides a simple and efficient alternative to
4736 standard XML transfer syntax. See src/Pure/General/yxml.ML and
4737 isatool yxml as described in the Isabelle system manual.
4739 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
4740 provides general wrapper for managing an Isabelle process in a robust
4741 fashion, with ``cooked'' output from stdin/stderr.
4743 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
4744 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
4746 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
4747 way of changing the user's settings is via
4748 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
4751 * Multithreading.max_threads := 0 refers to the number of actual CPU
4752 cores of the underlying machine, which is a good starting point for
4753 optimal performance tuning. The corresponding usedir option -M allows
4754 "max" as an alias for "0". WARNING: does not work on certain versions
4755 of Mac OS (with Poly/ML 5.1).
4757 * isabelle-process: non-ML sessions are run with "nice", to reduce the
4758 adverse effect of Isabelle flooding interactive front-ends (notably
4759 ProofGeneral / XEmacs).
4763 New in Isabelle2007 (November 2007)
4764 -----------------------------------
4768 * More uniform information about legacy features, notably a
4769 warning/error of "Legacy feature: ...", depending on the state of the
4770 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
4771 legacy features will disappear eventually.
4773 * Theory syntax: the header format ``theory A = B + C:'' has been
4774 discontinued in favour of ``theory A imports B C begin''. Use isatool
4775 fixheaders to convert existing theory files. INCOMPATIBILITY.
4777 * Theory syntax: the old non-Isar theory file format has been
4778 discontinued altogether. Note that ML proof scripts may still be used
4779 with Isar theories; migration is usually quite simple with the ML
4780 function use_legacy_bindings. INCOMPATIBILITY.
4782 * Theory syntax: some popular names (e.g. 'class', 'declaration',
4783 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
4786 * Theory loader: be more serious about observing the static theory
4787 header specifications (including optional directories), but not the
4788 accidental file locations of previously successful loads. The strict
4789 update policy of former update_thy is now already performed by
4790 use_thy, so the former has been removed; use_thys updates several
4791 theories simultaneously, just as 'imports' within a theory header
4792 specification, but without merging the results. Potential
4793 INCOMPATIBILITY: may need to refine theory headers and commands
4794 ROOT.ML which depend on load order.
4796 * Theory loader: optional support for content-based file
4797 identification, instead of the traditional scheme of full physical
4798 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
4799 (cf. the system manual). The new scheme allows to work with
4800 non-finished theories in persistent session images, such that source
4801 files may be moved later on without requiring reloads.
4803 * Theory loader: old-style ML proof scripts being *attached* to a thy
4804 file (with the same base name as the theory) are considered a legacy
4805 feature, which will disappear eventually. Even now, the theory loader
4806 no longer maintains dependencies on such files.
4808 * Syntax: the scope for resolving ambiguities via type-inference is
4809 now limited to individual terms, instead of whole simultaneous
4810 specifications as before. This greatly reduces the complexity of the
4811 syntax module and improves flexibility by separating parsing and
4812 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
4813 'fixes' etc.) are required in rare situations.
4815 * Syntax: constants introduced by new-style packages ('definition',
4816 'abbreviation' etc.) are passed through the syntax module in
4817 ``authentic mode''. This means that associated mixfix annotations
4818 really stick to such constants, independently of potential name space
4819 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
4820 trees are represented slightly differently, may need to adapt syntax
4821 translations accordingly. Use CONST marker in 'translations' and
4822 @{const_syntax} antiquotation in 'parse_translation' etc.
4824 * Legacy goal package: reduced interface to the bare minimum required
4825 to keep existing proof scripts running. Most other user-level
4826 functions are now part of the OldGoals structure, which is *not* open
4827 by default (consider isatool expandshort before open OldGoals).
4828 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
4829 these tend to cause confusion about the actual goal (!) context being
4830 used here, which is not necessarily the same as the_context().
4832 * Command 'find_theorems': supports "*" wild-card in "name:"
4833 criterion; "with_dups" option. Certain ProofGeneral versions might
4834 support a specific search form (see ProofGeneral/CHANGES).
4836 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
4837 by default, which means that "prems" (and also "fixed variables") are
4838 suppressed from proof state output. Note that the ProofGeneral
4839 settings mechanism allows to change and save options persistently, but
4840 older versions of Isabelle will fail to start up if a negative prems
4843 * Local theory targets may be specified by non-nested blocks of
4844 ``context/locale/class ... begin'' followed by ``end''. The body may
4845 contain definitions, theorems etc., including any derived mechanism
4846 that has been implemented on top of these primitives. This concept
4847 generalizes the existing ``theorem (in ...)'' towards more versatility
4850 * Proof General interface: proper undo of final 'end' command;
4851 discontinued Isabelle/classic mode (ML proof scripts).
4854 *** Document preparation ***
4856 * Added antiquotation @{theory name} which prints the given name,
4857 after checking that it refers to a valid ancestor theory in the
4860 * Added antiquotations @{ML_type text} and @{ML_struct text} which
4861 check the given source text as ML type/structure, printing verbatim.
4863 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
4864 "c args == rhs" given in the current context. (Any number of
4865 arguments may be given on the LHS.)
4870 * The 'class' package offers a combination of axclass and locale to
4871 achieve Haskell-like type classes in Isabelle. Definitions and
4872 theorems within a class context produce both relative results (with
4873 implicit parameters according to the locale context), and polymorphic
4874 constants with qualified polymorphism (according to the class
4875 context). Within the body context of a 'class' target, a separate
4876 syntax layer ("user space type system") takes care of converting
4877 between global polymorphic consts and internal locale representation.
4878 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
4879 "isatool doc classes" provides a tutorial.
4881 * Generic code generator framework allows to generate executable
4882 code for ML and Haskell (including Isabelle classes). A short usage
4885 internal compilation:
4886 export_code <list of constants (term syntax)> in SML
4887 writing SML code to a file:
4888 export_code <list of constants (term syntax)> in SML <filename>
4889 writing OCaml code to a file:
4890 export_code <list of constants (term syntax)> in OCaml <filename>
4891 writing Haskell code to a bunch of files:
4892 export_code <list of constants (term syntax)> in Haskell <filename>
4894 evaluating closed propositions to True/False using code generation:
4897 Reasonable default setup of framework in HOL.
4899 Theorem attributs for selecting and transforming function equations theorems:
4901 [code fun]: select a theorem as function equation for a specific constant
4902 [code fun del]: deselect a theorem as function equation for a specific constant
4903 [code inline]: select an equation theorem for unfolding (inlining) in place
4904 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
4906 User-defined serializations (target in {SML, OCaml, Haskell}):
4908 code_const <and-list of constants (term syntax)>
4909 {(target) <and-list of const target syntax>}+
4911 code_type <and-list of type constructors>
4912 {(target) <and-list of type target syntax>}+
4914 code_instance <and-list of instances>
4916 where instance ::= <type constructor> :: <class>
4918 code_class <and_list of classes>
4919 {(target) <and-list of class target syntax>}+
4920 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
4922 code_instance and code_class only are effective to target Haskell.
4924 For example usage see src/HOL/ex/Codegenerator.thy and
4925 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
4926 generation from Isabelle/HOL theories is available via "isatool doc
4929 * Code generator: consts in 'consts_code' Isar commands are now
4930 referred to by usual term syntax (including optional type
4933 * Command 'no_translations' removes translation rules from theory
4936 * Overloaded definitions are now actually checked for acyclic
4937 dependencies. The overloading scheme is slightly more general than
4938 that of Haskell98, although Isabelle does not demand an exact
4939 correspondence to type class and instance declarations.
4940 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
4941 exotic versions of overloading -- at the discretion of the user!
4943 Polymorphic constants are represented via type arguments, i.e. the
4944 instantiation that matches an instance against the most general
4945 declaration given in the signature. For example, with the declaration
4946 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
4947 as c(nat). Overloading is essentially simultaneous structural
4948 recursion over such type arguments. Incomplete specification patterns
4949 impose global constraints on all occurrences, e.g. c('a * 'a) on the
4950 LHS means that more general c('a * 'b) will be disallowed on any RHS.
4951 Command 'print_theory' outputs the normalized system of recursive
4952 equations, see section "definitions".
4954 * Configuration options are maintained within the theory or proof
4955 context (with name and type bool/int/string), providing a very simple
4956 interface to a poor-man's version of general context data. Tools may
4957 declare options in ML (e.g. using Attrib.config_int) and then refer to
4958 these values using Config.get etc. Users may change options via an
4959 associated attribute of the same name. This form of context
4960 declaration works particularly well with commands 'declare' or
4961 'using', for example ``declare [[foo = 42]]''. Thus it has become
4962 very easy to avoid global references, which would not observe Isar
4963 toplevel undo/redo and fail to work with multithreading.
4965 Various global ML references of Pure and HOL have been turned into
4966 configuration options:
4968 Unify.search_bound unify_search_bound
4969 Unify.trace_bound unify_trace_bound
4970 Unify.trace_simp unify_trace_simp
4971 Unify.trace_types unify_trace_types
4972 Simplifier.simp_depth_limit simp_depth_limit
4973 Blast.depth_limit blast_depth_limit
4974 DatatypeProp.dtK datatype_distinctness_limit
4975 fast_arith_neq_limit fast_arith_neq_limit
4976 fast_arith_split_limit fast_arith_split_limit
4978 * Named collections of theorems may be easily installed as context
4979 data using the functor NamedThmsFun (see also
4980 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
4981 attributes; there is also a toplevel print command. This facility is
4982 just a common case of general context data, which is the preferred way
4983 for anything more complex than just a list of facts in canonical
4986 * Isar: command 'declaration' augments a local theory by generic
4987 declaration functions written in ML. This enables arbitrary content
4988 being added to the context, depending on a morphism that tells the
4989 difference of the original declaration context wrt. the application
4990 context encountered later on.
4992 * Isar: proper interfaces for simplification procedures. Command
4993 'simproc_setup' declares named simprocs (with match patterns, and body
4994 text in ML). Attribute "simproc" adds/deletes simprocs in the current
4995 context. ML antiquotation @{simproc name} retrieves named simprocs.
4997 * Isar: an extra pair of brackets around attribute declarations
4998 abbreviates a theorem reference involving an internal dummy fact,
4999 which will be ignored later --- only the effect of the attribute on
5000 the background context will persist. This form of in-place
5001 declarations is particularly useful with commands like 'declare' and
5002 'using', for example ``have A using [[simproc a]] by simp''.
5004 * Isar: method "assumption" (and implicit closing of subproofs) now
5005 takes simple non-atomic goal assumptions into account: after applying
5006 an assumption as a rule the resulting subgoals are solved by atomic
5007 assumption steps. This is particularly useful to finish 'obtain'
5008 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
5009 without referring to the original premise "!!x. P x ==> thesis" in the
5010 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
5013 * Isar: implicit use of prems from the Isar proof context is
5014 considered a legacy feature. Common applications like ``have A .''
5015 may be replaced by ``have A by fact'' or ``note `A`''. In general,
5016 referencing facts explicitly here improves readability and
5017 maintainability of proof texts.
5019 * Isar: improper proof element 'guess' is like 'obtain', but derives
5020 the obtained context from the course of reasoning! For example:
5022 assume "EX x y. A x & B y" -- "any previous fact"
5023 then guess x and y by clarify
5025 This technique is potentially adventurous, depending on the facts and
5026 proof tools being involved here.
5028 * Isar: known facts from the proof context may be specified as literal
5029 propositions, using ASCII back-quote syntax. This works wherever
5030 named facts used to be allowed so far, in proof commands, proof
5031 methods, attributes etc. Literal facts are retrieved from the context
5032 according to unification of type and term parameters. For example,
5033 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
5034 theorems in the current context, then these are valid literal facts:
5035 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
5037 There is also a proof method "fact" which does the same composition
5038 for explicit goal states, e.g. the following proof texts coincide with
5039 certain special cases of literal facts:
5041 have "A" by fact == note `A`
5042 have "A ==> B" by fact == note `A ==> B`
5043 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
5044 have "P a ==> Q a" by fact == note `P a ==> Q a`
5046 * Isar: ":" (colon) is no longer a symbolic identifier character in
5047 outer syntax. Thus symbolic identifiers may be used without
5048 additional white space in declarations like this: ``assume *: A''.
5050 * Isar: 'print_facts' prints all local facts of the current context,
5051 both named and unnamed ones.
5053 * Isar: 'def' now admits simultaneous definitions, e.g.:
5055 def x == "t" and y == "u"
5057 * Isar: added command 'unfolding', which is structurally similar to
5058 'using', but affects both the goal state and facts by unfolding given
5059 rewrite rules. Thus many occurrences of the 'unfold' method or
5060 'unfolded' attribute may be replaced by first-class proof text.
5062 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
5063 and command 'unfolding' now all support object-level equalities
5064 (potentially conditional). The underlying notion of rewrite rule is
5065 analogous to the 'rule_format' attribute, but *not* that of the
5066 Simplifier (which is usually more generous).
5068 * Isar: the new attribute [rotated n] (default n = 1) rotates the
5069 premises of a theorem by n. Useful in conjunction with drule.
5071 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
5072 method expression within a sandbox consisting of the first N
5073 sub-goals, which need to exist. For example, ``simp_all [3]''
5074 simplifies the first three sub-goals, while (rule foo, simp_all)[]
5075 simplifies all new goals that emerge from applying rule foo to the
5076 originally first one.
5078 * Isar: schematic goals are no longer restricted to higher-order
5079 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
5082 * Isar: the conclusion of a long theorem statement is now either
5083 'shows' (a simultaneous conjunction, as before), or 'obtains'
5084 (essentially a disjunction of cases with local parameters and
5085 assumptions). The latter allows to express general elimination rules
5086 adequately; in this notation common elimination rules look like this:
5088 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
5090 obtains x where "P x"
5092 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
5096 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
5102 The subsequent classical rules even refer to the formal "thesis"
5105 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
5108 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
5109 obtains "thesis ==> something"
5111 The actual proof of an 'obtains' statement is analogous to that of the
5112 Isar proof element 'obtain', only that there may be several cases.
5113 Optional case names may be specified in parentheses; these will be
5114 available both in the present proof and as annotations in the
5115 resulting rule, for later use with the 'cases' method (cf. attribute
5118 * Isar: the assumptions of a long theorem statement are available as
5119 "assms" fact in the proof context. This is more appropriate than the
5120 (historical) "prems", which refers to all assumptions of the current
5121 context, including those from the target locale, proof body etc.
5123 * Isar: 'print_statement' prints theorems from the current theory or
5124 proof context in long statement form, according to the syntax of a
5127 * Isar: 'obtain' takes an optional case name for the local context
5128 introduction rule (default "that").
5130 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
5131 explicit (is "_ ==> ?foo") in the rare cases where this still happens
5134 * Pure: syntax "CONST name" produces a fully internalized constant
5135 according to the current context. This is particularly useful for
5136 syntax translations that should refer to internal constant
5137 representations independently of name spaces.
5139 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
5140 instead of "FOO ". This allows multiple binder declarations to coexist
5141 in the same context. INCOMPATIBILITY.
5143 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
5144 primitive that also works in a locale context (both for constants and
5145 fixed variables). Type declaration and internal syntactic representation
5146 of given constants retrieved from the context. Likewise, the
5147 'no_notation' command allows to remove given syntax annotations from the
5150 * Isar/locales: new derived specification elements 'axiomatization',
5151 'definition', 'abbreviation', which support type-inference, admit
5152 object-level specifications (equality, equivalence). See also the
5153 isar-ref manual. Examples:
5156 eq (infix "===" 50) where
5157 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
5159 definition "f x y = x + y + 1"
5160 definition g where "g x = f x x"
5163 neq (infix "=!=" 50) where
5164 "x =!= y == ~ (x === y)"
5166 These specifications may be also used in a locale context. Then the
5167 constants being introduced depend on certain fixed parameters, and the
5168 constant name is qualified by the locale base name. An internal
5169 abbreviation takes care for convenient input and output, making the
5170 parameters implicit and using the original short name. See also
5171 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
5172 entities from a monomorphic theory.
5174 Presently, abbreviations are only available 'in' a target locale, but
5175 not inherited by general import expressions. Also note that
5176 'abbreviation' may be used as a type-safe replacement for 'syntax' +
5177 'translations' in common applications. The "no_abbrevs" print mode
5178 prevents folding of abbreviations in term output.
5180 Concrete syntax is attached to specified constants in internal form,
5181 independently of name spaces. The parse tree representation is
5182 slightly different -- use 'notation' instead of raw 'syntax', and
5183 'translations' with explicit "CONST" markup to accommodate this.
5185 * Pure/Isar: unified syntax for new-style specification mechanisms
5186 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
5187 full type inference and dummy patterns ("_"). For example:
5189 definition "K x _ = x"
5191 inductive conj for A B
5192 where "A ==> B ==> conj A B"
5194 * Pure: command 'print_abbrevs' prints all constant abbreviations of
5195 the current context. Print mode "no_abbrevs" prevents inversion of
5196 abbreviations on output.
5198 * Isar/locales: improved parameter handling: use of locales "var" and
5199 "struct" no longer necessary; - parameter renamings are no longer
5200 required to be injective. For example, this allows to define
5201 endomorphisms as locale endom = homom mult mult h.
5203 * Isar/locales: changed the way locales with predicates are defined.
5204 Instead of accumulating the specification, the imported expression is
5205 now an interpretation. INCOMPATIBILITY: different normal form of
5206 locale expressions. In particular, in interpretations of locales with
5207 predicates, goals repesenting already interpreted fragments are not
5208 removed automatically. Use methods `intro_locales' and
5209 `unfold_locales'; see below.
5211 * Isar/locales: new methods `intro_locales' and `unfold_locales'
5212 provide backward reasoning on locales predicates. The methods are
5213 aware of interpretations and discharge corresponding goals.
5214 `intro_locales' is less aggressive then `unfold_locales' and does not
5215 unfold predicates to assumptions.
5217 * Isar/locales: the order in which locale fragments are accumulated
5218 has changed. This enables to override declarations from fragments due
5219 to interpretations -- for example, unwanted simp rules.
5221 * Isar/locales: interpretation in theories and proof contexts has been
5222 extended. One may now specify (and prove) equations, which are
5223 unfolded in interpreted theorems. This is useful for replacing
5224 defined concepts (constants depending on locale parameters) by
5225 concepts already existing in the target context. Example:
5227 interpretation partial_order ["op <= :: [int, int] => bool"]
5228 where "partial_order.less (op <=) (x::int) y = (x < y)"
5230 Typically, the constant `partial_order.less' is created by a
5231 definition specification element in the context of locale
5234 * Method "induct": improved internal context management to support
5235 local fixes and defines on-the-fly. Thus explicit meta-level
5236 connectives !! and ==> are rarely required anymore in inductive goals
5237 (using object-logic connectives for this purpose has been long
5238 obsolete anyway). Common proof patterns are explained in
5239 src/HOL/Induct/Common_Patterns.thy, see also
5240 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
5243 * Method "induct": improved handling of simultaneous goals. Instead of
5244 introducing object-level conjunction, the statement is now split into
5245 several conclusions, while the corresponding symbolic cases are nested
5246 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
5247 see src/HOL/Induct/Common_Patterns.thy, for example.
5249 * Method "induct": mutual induction rules are now specified as a list
5250 of rule sharing the same induction cases. HOL packages usually provide
5251 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
5252 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
5253 mutual induction rules differently, i.e. like this:
5255 (induct rule: foo_bar.inducts)
5256 (induct set: foo bar)
5257 (induct pred: foo bar)
5258 (induct type: foo bar)
5260 The ML function ProjectRule.projections turns old-style rules into the
5263 * Method "coinduct": dual of induction, see
5264 src/HOL/Library/Coinductive_List.thy for various examples.
5266 * Method "cases", "induct", "coinduct": the ``(open)'' option is
5267 considered a legacy feature.
5269 * Attribute "symmetric" produces result with standardized schematic
5270 variables (index 0). Potential INCOMPATIBILITY.
5272 * Simplifier: by default the simplifier trace only shows top level
5273 rewrites now. That is, trace_simp_depth_limit is set to 1 by
5274 default. Thus there is less danger of being flooded by the trace. The
5275 trace indicates where parts have been suppressed.
5277 * Provers/classical: removed obsolete classical version of elim_format
5278 attribute; classical elim/dest rules are now treated uniformly when
5279 manipulating the claset.
5281 * Provers/classical: stricter checks to ensure that supplied intro,
5282 dest and elim rules are well-formed; dest and elim rules must have at
5285 * Provers/classical: attributes dest/elim/intro take an optional
5286 weight argument for the rule (just as the Pure versions). Weights are
5287 ignored by automated tools, but determine the search order of single
5290 * Syntax: input syntax now supports dummy variable binding "%_. b",
5291 where the body does not mention the bound variable. Note that dummy
5292 patterns implicitly depend on their context of bounds, which makes
5293 "{_. _}" match any set comprehension as expected. Potential
5294 INCOMPATIBILITY -- parse translations need to cope with syntactic
5295 constant "_idtdummy" in the binding position.
5297 * Syntax: removed obsolete syntactic constant "_K" and its associated
5298 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
5299 for example "A -> B" => "Pi A (%_. B)".
5301 * Pure: 'class_deps' command visualizes the subclass relation, using
5302 the graph browser tool.
5304 * Pure: 'print_theory' now suppresses certain internal declarations by
5305 default; use '!' option for full details.
5310 * Method "metis" proves goals by applying the Metis general-purpose
5311 resolution prover (see also http://gilith.com/software/metis/).
5312 Examples are in the directory MetisExamples. WARNING: the
5313 Isabelle/HOL-Metis integration does not yet work properly with
5316 * Command 'sledgehammer' invokes external automatic theorem provers as
5317 background processes. It generates calls to the "metis" method if
5318 successful. These can be pasted into the proof. Users do not have to
5319 wait for the automatic provers to return. WARNING: does not really
5320 work with multi-threading.
5322 * New "auto_quickcheck" feature tests outermost goal statements for
5323 potential counter-examples. Controlled by ML references
5324 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
5325 5000 milliseconds). Fails silently if statements is outside of
5326 executable fragment, or any other codgenerator problem occurs.
5328 * New constant "undefined" with axiom "undefined x = undefined".
5330 * Added class "HOL.eq", allowing for code generation with polymorphic
5333 * Some renaming of class constants due to canonical name prefixing in
5334 the new 'class' package:
5336 HOL.abs ~> HOL.abs_class.abs
5337 HOL.divide ~> HOL.divide_class.divide
5338 0 ~> HOL.zero_class.zero
5339 1 ~> HOL.one_class.one
5340 op + ~> HOL.plus_class.plus
5341 op - ~> HOL.minus_class.minus
5342 uminus ~> HOL.minus_class.uminus
5343 op * ~> HOL.times_class.times
5344 op < ~> HOL.ord_class.less
5345 op <= > HOL.ord_class.less_eq
5346 Nat.power ~> Power.power_class.power
5347 Nat.size ~> Nat.size_class.size
5348 Numeral.number_of ~> Numeral.number_class.number_of
5349 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
5350 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
5351 Orderings.min ~> Orderings.ord_class.min
5352 Orderings.max ~> Orderings.ord_class.max
5353 Divides.op div ~> Divides.div_class.div
5354 Divides.op mod ~> Divides.div_class.mod
5355 Divides.op dvd ~> Divides.div_class.dvd
5357 INCOMPATIBILITY. Adaptions may be required in the following cases:
5359 a) User-defined constants using any of the names "plus", "minus",
5360 "times", "less" or "less_eq". The standard syntax translations for
5361 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
5364 b) Variables named "plus", "minus", "times", "less", "less_eq"
5365 INCOMPATIBILITY: use more specific names.
5367 c) Permutative equations (e.g. "a + b = b + a")
5368 Since the change of names also changes the order of terms, permutative
5369 rewrite rules may get applied in a different order. Experience shows
5370 that this is rarely the case (only two adaptions in the whole Isabelle
5371 distribution). INCOMPATIBILITY: rewrite proofs
5373 d) ML code directly refering to constant names
5374 This in general only affects hand-written proof tactics, simprocs and
5375 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
5376 Consider using @{const_name} antiquotation.
5378 * New class "default" with associated constant "default".
5380 * Function "sgn" is now overloaded and available on int, real, complex
5381 (and other numeric types), using class "sgn". Two possible defs of
5382 sgn are given as equational assumptions in the classes sgn_if and
5383 sgn_div_norm; ordered_idom now also inherits from sgn_if.
5386 * Locale "partial_order" now unified with class "order" (cf. theory
5387 Orderings), added parameter "less". INCOMPATIBILITY.
5389 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
5390 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
5391 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
5393 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
5394 changed order of proof goals in instance proofs.
5396 * The transitivity reasoner for partial and linear orders is set up
5397 for classes "order" and "linorder". Instances of the reasoner are available
5398 in all contexts importing or interpreting the corresponding locales.
5399 Method "order" invokes the reasoner separately; the reasoner
5400 is also integrated with the Simplifier as a solver. Diagnostic
5401 command 'print_orders' shows the available instances of the reasoner
5402 in the current context.
5404 * Localized monotonicity predicate in theory "Orderings"; integrated
5405 lemmas max_of_mono and min_of_mono with this predicate.
5408 * Formulation of theorem "dense" changed slightly due to integration
5409 with new class dense_linear_order.
5411 * Uniform lattice theory development in HOL.
5413 constants "meet" and "join" now named "inf" and "sup"
5414 constant "Meet" now named "Inf"
5416 classes "meet_semilorder" and "join_semilorder" now named
5417 "lower_semilattice" and "upper_semilattice"
5418 class "lorder" now named "lattice"
5419 class "comp_lat" now named "complete_lattice"
5421 Instantiation of lattice classes allows explicit definitions
5422 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
5424 INCOMPATIBILITY. Theorem renames:
5426 meet_left_le ~> inf_le1
5427 meet_right_le ~> inf_le2
5428 join_left_le ~> sup_ge1
5429 join_right_le ~> sup_ge2
5430 meet_join_le ~> inf_sup_ord
5433 le_meet ~> le_inf_iff
5434 le_join ~> ge_sup_conv
5435 meet_idempotent ~> inf_idem
5436 join_idempotent ~> sup_idem
5437 meet_comm ~> inf_commute
5438 join_comm ~> sup_commute
5439 meet_leI1 ~> le_infI1
5440 meet_leI2 ~> le_infI2
5441 le_joinI1 ~> le_supI1
5442 le_joinI2 ~> le_supI2
5443 meet_assoc ~> inf_assoc
5444 join_assoc ~> sup_assoc
5445 meet_left_comm ~> inf_left_commute
5446 meet_left_idempotent ~> inf_left_idem
5447 join_left_comm ~> sup_left_commute
5448 join_left_idempotent ~> sup_left_idem
5451 le_def_meet ~> le_iff_inf
5452 le_def_join ~> le_iff_sup
5453 join_absorp2 ~> sup_absorb2
5454 join_absorp1 ~> sup_absorb1
5455 meet_absorp1 ~> inf_absorb1
5456 meet_absorp2 ~> inf_absorb2
5457 meet_join_absorp ~> inf_sup_absorb
5458 join_meet_absorp ~> sup_inf_absorb
5459 distrib_join_le ~> distrib_sup_le
5460 distrib_meet_le ~> distrib_inf_le
5462 add_meet_distrib_left ~> add_inf_distrib_left
5463 add_join_distrib_left ~> add_sup_distrib_left
5464 is_join_neg_meet ~> is_join_neg_inf
5465 is_meet_neg_join ~> is_meet_neg_sup
5466 add_meet_distrib_right ~> add_inf_distrib_right
5467 add_join_distrib_right ~> add_sup_distrib_right
5468 add_meet_join_distribs ~> add_sup_inf_distribs
5469 join_eq_neg_meet ~> sup_eq_neg_inf
5470 meet_eq_neg_join ~> inf_eq_neg_sup
5471 add_eq_meet_join ~> add_eq_inf_sup
5472 meet_0_imp_0 ~> inf_0_imp_0
5473 join_0_imp_0 ~> sup_0_imp_0
5474 meet_0_eq_0 ~> inf_0_eq_0
5475 join_0_eq_0 ~> sup_0_eq_0
5476 neg_meet_eq_join ~> neg_inf_eq_sup
5477 neg_join_eq_meet ~> neg_sup_eq_inf
5478 join_eq_if ~> sup_eq_if
5480 mono_meet ~> mono_inf
5481 mono_join ~> mono_sup
5482 meet_bool_eq ~> inf_bool_eq
5483 join_bool_eq ~> sup_bool_eq
5484 meet_fun_eq ~> inf_fun_eq
5485 join_fun_eq ~> sup_fun_eq
5486 meet_set_eq ~> inf_set_eq
5487 join_set_eq ~> sup_set_eq
5488 meet1_iff ~> inf1_iff
5489 meet2_iff ~> inf2_iff
5498 join1_iff ~> sup1_iff
5499 join2_iff ~> sup2_iff
5509 is_meet_Meet ~> is_meet_Inf
5510 Meet_bool_def ~> Inf_bool_def
5511 Meet_fun_def ~> Inf_fun_def
5512 Meet_greatest ~> Inf_greatest
5513 Meet_lower ~> Inf_lower
5514 Meet_set_def ~> Inf_set_def
5517 Sup_bool_eq ~> Sup_bool_def
5518 Sup_fun_eq ~> Sup_fun_def
5519 Sup_set_eq ~> Sup_set_def
5521 listsp_meetI ~> listsp_infI
5522 listsp_meet_eq ~> listsp_inf_eq
5527 * Added syntactic class "size"; overloaded constant "size" now has
5528 type "'a::size ==> bool"
5530 * Internal reorganisation of `size' of datatypes: size theorems
5531 "foo.size" are no longer subsumed by "foo.simps" (but are still
5532 simplification rules by default!); theorems "prod.size" now named
5535 * Class "div" now inherits from class "times" rather than "type".
5538 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
5539 Linorder etc. have disappeared; operations defined in terms of
5540 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
5542 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
5544 * HOL-Word: New extensive library and type for generic, fixed size
5545 machine words, with arithmetic, bit-wise, shifting and rotating
5546 operations, reflection into int, nat, and bool lists, automation for
5547 linear arithmetic (by automatic reflection into nat or int), including
5548 lemmas on overflow and monotonicity. Instantiated to all appropriate
5549 arithmetic type classes, supporting automatic simplification of
5550 numerals on all operations.
5552 * Library/Boolean_Algebra: locales for abstract boolean algebras.
5554 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
5556 * Code generator library theories:
5557 - Code_Integer represents HOL integers by big integer literals in target
5559 - Code_Char represents HOL characters by character literals in target
5561 - Code_Char_chr like Code_Char, but also offers treatment of character
5562 codes; includes Code_Integer.
5563 - Executable_Set allows to generate code for finite sets using lists.
5564 - Executable_Rat implements rational numbers as triples (sign, enumerator,
5566 - Executable_Real implements a subset of real numbers, namly those
5567 representable by rational numbers.
5568 - Efficient_Nat implements natural numbers by integers, which in general will
5569 result in higher efficency; pattern matching with 0/Suc is eliminated;
5570 includes Code_Integer.
5571 - Code_Index provides an additional datatype index which is mapped to
5572 target-language built-in integers.
5573 - Code_Message provides an additional datatype message_string which is isomorphic to
5574 strings; messages are mapped to target-language strings.
5576 * New package for inductive predicates
5578 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
5581 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5582 for z_1 :: U_1 and ... and z_n :: U_m
5584 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5587 with full support for type-inference, rather than
5589 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5591 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5592 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5594 inductive "s z_1 ... z_m"
5596 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5599 For backward compatibility, there is a wrapper allowing inductive
5600 sets to be defined with the new package via
5603 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5604 for z_1 :: U_1 and ... and z_n :: U_m
5606 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5612 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5613 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5614 for z_1 :: U_1 and ... and z_n :: U_m
5616 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5617 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5620 if the additional syntax "p ..." is required.
5622 Numerous examples can be found in the subdirectories src/HOL/Auth,
5623 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
5627 - Since declaration and definition of inductive sets or predicates
5628 is no longer separated, abbreviations involving the newly
5629 introduced sets or predicates must be specified together with the
5630 introduction rules after the 'where' keyword (see above), rather
5631 than before the actual inductive definition.
5633 - The variables in induction and elimination rules are now
5634 quantified in the order of their occurrence in the introduction
5635 rules, rather than in alphabetical order. Since this may break
5636 some proofs, these proofs either have to be repaired, e.g. by
5637 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
5638 statements of the form
5640 case (rule_i a_i_1 ... a_i_{k_i})
5642 or the old order of quantification has to be restored by explicitly adding
5643 meta-level quantifiers in the introduction rules, i.e.
5645 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
5647 - The format of the elimination rules is now
5649 p z_1 ... z_m x_1 ... x_n ==>
5650 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5655 (x_1, ..., x_n) : s z_1 ... z_m ==>
5656 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5659 for sets rather than
5661 x : s z_1 ... z_m ==>
5662 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
5665 This may require terms in goals to be expanded to n-tuples
5666 (e.g. using case_tac or simplification with the split_paired_all
5667 rule) before the above elimination rule is applicable.
5669 - The elimination or case analysis rules for (mutually) inductive
5670 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
5671 list of rules "p_1_..._p_k.elims" is no longer available.
5673 * New package "function"/"fun" for general recursive functions,
5674 supporting mutual and nested recursion, definitions in local contexts,
5675 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
5676 for small examples, and the separate tutorial on the function
5677 package. The old recdef "package" is still available as before, but
5678 users are encouraged to use the new package.
5680 * Method "lexicographic_order" automatically synthesizes termination
5681 relations as lexicographic combinations of size measures.
5683 * Case-expressions allow arbitrary constructor-patterns (including
5684 "_") and take their order into account, like in functional
5685 programming. Internally, this is translated into nested
5686 case-expressions; missing cases are added and mapped to the predefined
5687 constant "undefined". In complicated cases printing may no longer show
5688 the original input but the internal form. Lambda-abstractions allow
5689 the same form of pattern matching: "% pat1 => e1 | ..." is an
5690 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
5693 * IntDef: The constant "int :: nat => int" has been removed; now "int"
5694 is an abbreviation for "of_nat :: nat => int". The simplification
5695 rules for "of_nat" have been changed to work like "int" did
5696 previously. Potential INCOMPATIBILITY:
5697 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
5698 - of_nat_diff and of_nat_mult are no longer default simp rules
5700 * Method "algebra" solves polynomial equations over (semi)rings using
5701 Groebner bases. The (semi)ring structure is defined by locales and the
5702 tool setup depends on that generic context. Installing the method for
5703 a specific type involves instantiating the locale and possibly adding
5704 declarations for computation on the coefficients. The method is
5705 already instantiated for natural numbers and for the axiomatic class
5706 of idoms with numerals. See also the paper by Chaieb and Wenzel at
5707 CALCULEMUS 2007 for the general principles underlying this
5708 architecture of context-aware proof-tools.
5710 * Method "ferrack" implements quantifier elimination over
5711 special-purpose dense linear orders using locales (analogous to
5712 "algebra"). The method is already installed for class
5713 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
5716 * Former constant "List.op @" now named "List.append". Use ML
5717 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
5718 circumvent possible incompatibilities when working on ML level.
5720 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
5722 * New function listsum :: 'a list => 'a for arbitrary monoids.
5723 Special syntax: "SUM x <- xs. f x" (and latex variants)
5725 * New syntax for Haskell-like list comprehension (input only), eg.
5726 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
5728 * The special syntax for function "filter" has changed from [x :
5729 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
5730 comprehension syntax, and for uniformity. INCOMPATIBILITY.
5732 * [a..b] is now defined for arbitrary linear orders. It used to be
5733 defined on nat only, as an abbreviation for [a..<Suc b]
5736 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
5738 * New functions "sorted" and "sort" in src/HOL/List.thy.
5740 * New lemma collection field_simps (an extension of ring_simps) for
5741 manipulating (in)equations involving division. Multiplies with all
5742 denominators that can be proved to be non-zero (in equations) or
5743 positive/negative (in inequations).
5745 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
5746 have been improved and renamed to ring_simps, group_simps and
5747 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
5748 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
5750 * Theory Library/Commutative_Ring: switched from recdef to function
5751 package; constants add, mul, pow now curried. Infix syntax for
5752 algebraic operations.
5754 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
5757 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
5760 * HOL/records: generalised field-update to take a function on the
5761 field rather than the new value: r(|A := x|) is translated to A_update
5762 (K x) r The K-combinator that is internally used is called K_record.
5763 INCOMPATIBILITY: Usage of the plain update functions has to be
5766 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
5767 * x = 0, which are required for a semiring. Richer structures do not
5768 inherit from semiring_0 anymore, because this property is a theorem
5769 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
5770 there is more to prove, but this is mostly trivial.
5772 * Class "recpower" is generalized to arbitrary monoids, not just
5773 commutative semirings. INCOMPATIBILITY: may need to incorporate
5774 commutativity or semiring properties additionally.
5776 * Constant "List.list_all2" in List.thy now uses authentic syntax.
5777 INCOMPATIBILITY: translations containing list_all2 may go wrong,
5778 better use 'abbreviation'.
5780 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
5782 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
5783 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
5784 significant changes for setting up numeral syntax for types:
5785 - New constants Numeral.pred and Numeral.succ instead
5786 of former Numeral.bin_pred and Numeral.bin_succ.
5787 - Use integer operations instead of bin_add, bin_mult and so on.
5788 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
5789 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
5791 See src/HOL/Integ/IntArith.thy for an example setup.
5793 * Command 'normal_form' computes the normal form of a term that may
5794 contain free variables. For example ``normal_form "rev [a, b, c]"''
5795 produces ``[b, c, a]'' (without proof). This command is suitable for
5796 heavy-duty computations because the functions are compiled to ML
5797 first. Correspondingly, a method "normalization" is provided. See
5798 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
5800 * Alternative iff syntax "A <-> B" for equality on bool (with priority
5801 25 like -->); output depends on the "iff" print_mode, the default is
5802 "A = B" (with priority 50).
5804 * Relations less (<) and less_eq (<=) are also available on type bool.
5805 Modified syntax to disallow nesting without explicit parentheses,
5806 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
5809 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
5811 * Relation composition operator "op O" now has precedence 75 and binds
5812 stronger than union and intersection. INCOMPATIBILITY.
5814 * The old set interval syntax "{m..n(}" (and relatives) has been
5815 removed. Use "{m..<n}" (and relatives) instead.
5817 * In the context of the assumption "~(s = t)" the Simplifier rewrites
5818 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
5819 ``declare [[simproc del: neq]]''.
5821 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
5824 * Theorem Cons_eq_map_conv no longer declared as "simp".
5826 * Theorem setsum_mult renamed to setsum_right_distrib.
5828 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
5831 * Reimplemented methods "sat" and "satx", with several improvements:
5832 goals no longer need to be stated as "<prems> ==> False", equivalences
5833 (i.e. "=" on type bool) are handled, variable names of the form
5834 "lit_<n>" are no longer reserved, significant speedup.
5836 * Methods "sat" and "satx" can now replay MiniSat proof traces.
5837 zChaff is still supported as well.
5839 * 'inductive' and 'datatype': provide projections of mutual rules,
5840 bundled as foo_bar.inducts;
5842 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
5845 * Library: moved theory Accessible_Part to main HOL.
5847 * Library: added theory Coinductive_List of potentially infinite lists
5848 as greatest fixed-point.
5850 * Library: added theory AssocList which implements (finite) maps as
5853 * Method "evaluation" solves goals (i.e. a boolean expression)
5854 efficiently by compiling it to ML. The goal is "proved" (via an
5855 oracle) if it evaluates to True.
5857 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
5858 also when invoked by the simplifier. This results in the Simplifier
5859 being more powerful on arithmetic goals. INCOMPATIBILITY.
5860 Configuration option fast_arith_split_limit=0 recovers the old
5863 * Support for hex (0x20) and binary (0b1001) numerals.
5865 * New method: reify eqs (t), where eqs are equations for an
5866 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
5867 parameter, computes a term s::'b and a list xs::'a list and proves the
5868 theorem I xs s = t. This is also known as reification or quoting. The
5869 resulting theorem is applied to the subgoal to substitute t with I xs
5870 s. If t is omitted, the subgoal itself is reified.
5872 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
5873 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
5874 where f is supposed to be a computable function (in the sense of code
5875 generattion). The method uses reify to compute s and xs as above then
5876 applies corr_thm and uses normalization by evaluation to "prove" f s =
5877 r and finally gets the theorem t = r, which is again applied to the
5878 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
5880 * Reflection: Automatic reification now handels binding, an example is
5881 available in src/HOL/ex/ReflectionEx.thy
5883 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
5884 command 'statespace' that is similar to 'record', but introduces an
5885 abstract specification based on the locale infrastructure instead of
5886 HOL types. This leads to extra flexibility in composing state spaces,
5887 in particular multiple inheritance and renaming of components.
5892 * Hyperreal: Functions root and sqrt are now defined on negative real
5893 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
5894 Nonnegativity side conditions have been removed from many lemmas, so
5895 that more subgoals may now be solved by simplification; potential
5898 * Real: new type classes formalize real normed vector spaces and
5899 algebras, using new overloaded constants scaleR :: real => 'a => 'a
5900 and norm :: 'a => real.
5902 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
5903 reals into other types. The overloaded constant Reals :: 'a set is now
5904 defined as range of_real; potential INCOMPATIBILITY.
5906 * Real: proper support for ML code generation, including 'quickcheck'.
5907 Reals are implemented as arbitrary precision rationals.
5909 * Hyperreal: Several constants that previously worked only for the
5910 reals have been generalized, so they now work over arbitrary vector
5911 spaces. Type annotations may need to be added in some cases; potential
5914 Infinitesimal :: ('a::real_normed_vector) star set
5915 HFinite :: ('a::real_normed_vector) star set
5916 HInfinite :: ('a::real_normed_vector) star set
5917 approx :: ('a::real_normed_vector) star => 'a star => bool
5918 monad :: ('a::real_normed_vector) star => 'a star set
5919 galaxy :: ('a::real_normed_vector) star => 'a star set
5920 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
5921 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
5922 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
5923 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
5924 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
5925 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
5926 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
5927 sgn :: 'a::real_normed_vector => 'a
5928 exp :: 'a::{recpower,real_normed_field,banach} => 'a
5930 * Complex: Some complex-specific constants are now abbreviations for
5931 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
5932 hnorm. Other constants have been entirely removed in favor of the
5933 polymorphic versions (INCOMPATIBILITY):
5937 HInfinite <-- CInfinite
5938 Infinitesimal <-- CInfinitesimal
5941 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
5942 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
5943 (ns)deriv <-- (ns)cderiv
5948 * Formalisation of ideals and the quotient construction over rings.
5950 * Order and lattice theory no longer based on records.
5953 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
5954 greatest_closed. INCOMPATIBILITY.
5956 * Method algebra is now set up via an attribute. For examples see
5957 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
5958 of algebraic structures.
5960 * Renamed theory CRing to Ring.
5965 * Substantial, yet incomplete support for nominal datatypes (binding
5966 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
5967 src/HOL/Nominal/Examples. Prospective users should consult
5968 http://isabelle.in.tum.de/nominal/
5973 * ML basics: just one true type int, which coincides with IntInf.int
5976 * ML within Isar: antiquotations allow to embed statically-checked
5977 formal entities in the source, referring to the context available at
5978 compile-time. For example:
5980 ML {* @{sort "{zero,one}"} *}
5981 ML {* @{typ "'a => 'b"} *}
5982 ML {* @{term "%x. x"} *}
5983 ML {* @{prop "x == y"} *}
5984 ML {* @{ctyp "'a => 'b"} *}
5985 ML {* @{cterm "%x. x"} *}
5986 ML {* @{cprop "x == y"} *}
5987 ML {* @{thm asm_rl} *}
5988 ML {* @{thms asm_rl} *}
5989 ML {* @{type_name c} *}
5990 ML {* @{type_syntax c} *}
5991 ML {* @{const_name c} *}
5992 ML {* @{const_syntax c} *}
5995 ML {* @{theory Pure} *}
5996 ML {* @{theory_ref} *}
5997 ML {* @{theory_ref Pure} *}
6000 ML {* @{clasimpset} *}
6002 The same works for sources being ``used'' within an Isar context.
6004 * ML in Isar: improved error reporting; extra verbosity with
6005 ML_Context.trace enabled.
6007 * Pure/General/table.ML: the join operations now works via exceptions
6008 DUP/SAME instead of type option. This is simpler in simple cases, and
6009 admits slightly more efficient complex applications.
6011 * Pure: 'advanced' translation functions (parse_translation etc.) now
6012 use Context.generic instead of just theory.
6014 * Pure: datatype Context.generic joins theory/Proof.context and
6015 provides some facilities for code that works in either kind of
6016 context, notably GenericDataFun for uniform theory and proof data.
6018 * Pure: simplified internal attribute type, which is now always
6019 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
6020 local (Proof.context) attributes have been discontinued, while
6021 minimizing code duplication. Thm.rule_attribute and
6022 Thm.declaration_attribute build canonical attributes; see also structure
6023 Context for further operations on Context.generic, notably
6024 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
6025 declarations and definitions.
6027 * Context data interfaces (Theory/Proof/GenericDataFun): removed
6028 name/print, uninitialized data defaults to ad-hoc copy of empty value,
6029 init only required for impure data. INCOMPATIBILITY: empty really need
6030 to be empty (no dependencies on theory content!)
6032 * Pure/kernel: consts certification ignores sort constraints given in
6033 signature declarations. (This information is not relevant to the
6034 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
6035 potential INCOMPATIBILITY.
6037 * Pure: axiomatic type classes are now purely definitional, with
6038 explicit proofs of class axioms and super class relations performed
6039 internally. See Pure/axclass.ML for the main internal interfaces --
6040 notably AxClass.define_class supercedes AxClass.add_axclass, and
6041 AxClass.axiomatize_class/classrel/arity supersede
6042 Sign.add_classes/classrel/arities.
6044 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
6045 global/local versions on theory vs. Proof.context have been
6046 discontinued; Attrib.syntax and Method.syntax have been adapted
6047 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
6048 attributes, methods, etc.
6050 * Pure: several functions of signature "... -> theory -> theory * ..."
6051 have been reoriented to "... -> theory -> ... * theory" in order to
6052 allow natural usage in combination with the ||>, ||>>, |-> and
6053 fold_map combinators.
6055 * Pure: official theorem names (closed derivations) and additional
6056 comments (tags) are now strictly separate. Name hints -- which are
6057 maintained as tags -- may be attached any time without affecting the
6060 * Pure: primitive rule lift_rule now takes goal cterm instead of an
6061 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
6062 achieve the old behaviour.
6064 * Pure: the "Goal" constant is now called "prop", supporting a
6065 slightly more general idea of ``protecting'' meta-level rule
6068 * Pure: Logic.(un)varify only works in a global context, which is now
6069 enforced instead of silently assumed. INCOMPATIBILITY, may use
6070 Logic.legacy_(un)varify as temporary workaround.
6072 * Pure: structure Name provides scalable operations for generating
6073 internal variable names, notably Name.variants etc. This replaces
6074 some popular functions from term.ML:
6076 Term.variant -> Name.variant
6077 Term.variantlist -> Name.variant_list
6078 Term.invent_names -> Name.invent_list
6080 Note that low-level renaming rarely occurs in new code -- operations
6081 from structure Variable are used instead (see below).
6083 * Pure: structure Variable provides fundamental operations for proper
6084 treatment of fixed/schematic variables in a context. For example,
6085 Variable.import introduces fixes for schematics of given facts and
6086 Variable.export reverses the effect (up to renaming) -- this replaces
6087 various freeze_thaw operations.
6089 * Pure: structure Goal provides simple interfaces for
6090 init/conclude/finish and tactical prove operations (replacing former
6091 Tactic.prove). Goal.prove is the canonical way to prove results
6092 within a given context; Goal.prove_global is a degraded version for
6093 theory level goals, including a global Drule.standard. Note that
6094 OldGoals.prove_goalw_cterm has long been obsolete, since it is
6095 ill-behaved in a local proof context (e.g. with local fixes/assumes or
6096 in a locale context).
6098 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
6099 and type checking (Syntax.check_term etc.), with common combinations
6100 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
6101 which are considered legacy and await removal.
6103 * Pure/Syntax: generic interfaces for type unchecking
6104 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
6105 with common combinations (Syntax.pretty_term, Syntax.string_of_term
6106 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
6107 available for convenience, but refer to the very same operations using
6108 a mere theory instead of a full context.
6110 * Isar: simplified treatment of user-level errors, using exception
6111 ERROR of string uniformly. Function error now merely raises ERROR,
6112 without any side effect on output channels. The Isar toplevel takes
6113 care of proper display of ERROR exceptions. ML code may use plain
6114 handle/can/try; cat_error may be used to concatenate errors like this:
6116 ... handle ERROR msg => cat_error msg "..."
6118 Toplevel ML code (run directly or through the Isar toplevel) may be
6119 embedded into the Isar toplevel with exception display/debug like
6122 Isar.toplevel (fn () => ...)
6124 INCOMPATIBILITY, removed special transform_error facilities, removed
6125 obsolete variants of user-level exceptions (ERROR_MESSAGE,
6126 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
6127 -- use plain ERROR instead.
6129 * Isar: theory setup now has type (theory -> theory), instead of a
6130 list. INCOMPATIBILITY, may use #> to compose setup functions.
6132 * Isar: ML toplevel pretty printer for type Proof.context, subject to
6133 ProofContext.debug/verbose flags.
6135 * Isar: Toplevel.theory_to_proof admits transactions that modify the
6136 theory before entering a proof state. Transactions now always see a
6137 quasi-functional intermediate checkpoint, both in interactive and
6140 * Isar: simplified interfaces for outer syntax. Renamed
6141 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
6142 OuterSyntax.add_parsers -- this functionality is now included in
6143 OuterSyntax.command etc. INCOMPATIBILITY.
6145 * Simplifier: the simpset of a running simplification process now
6146 contains a proof context (cf. Simplifier.the_context), which is the
6147 very context that the initial simpset has been retrieved from (by
6148 simpset_of/local_simpset_of). Consequently, all plug-in components
6149 (solver, looper etc.) may depend on arbitrary proof data.
6151 * Simplifier.inherit_context inherits the proof context (plus the
6152 local bounds) of the current simplification process; any simproc
6153 etc. that calls the Simplifier recursively should do this! Removed
6154 former Simplifier.inherit_bounds, which is already included here --
6155 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
6156 specify an explicit context using Simplifier.context/theory_context.
6158 * Simplifier/Classical Reasoner: more abstract interfaces
6159 change_simpset/claset for modifying the simpset/claset reference of a
6160 theory; raw versions simpset/claset_ref etc. have been discontinued --
6163 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
6169 * settings: the default heap location within ISABELLE_HOME_USER now
6170 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
6171 Isabelle installations.
6173 * isabelle-process: option -S (secure mode) disables some critical
6174 operations, notably runtime compilation and evaluation of ML source
6177 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
6179 * Support for parallel execution, using native multicore support of
6180 Poly/ML 5.1. The theory loader exploits parallelism when processing
6181 independent theories, according to the given theory header
6182 specifications. The maximum number of worker threads is specified via
6183 usedir option -M or the "max-threads" setting in Proof General. A
6184 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
6185 to 6 on a 8-core machine. User-code needs to observe certain
6186 guidelines for thread-safe programming, see appendix A in the Isar
6187 Implementation manual.
6191 New in Isabelle2005 (October 2005)
6192 ----------------------------------
6196 * Theory headers: the new header syntax for Isar theories is
6199 imports <theory1> ... <theoryN>
6200 uses <file1> ... <fileM>
6203 where the 'uses' part is optional. The previous syntax
6205 theory <name> = <theory1> + ... + <theoryN>:
6207 will disappear in the next release. Use isatool fixheaders to convert
6208 existing theory files. Note that there is no change in ancient
6209 non-Isar theories now, but these will disappear soon.
6211 * Theory loader: parent theories can now also be referred to via
6212 relative and absolute paths.
6214 * Command 'find_theorems' searches for a list of criteria instead of a
6215 list of constants. Known criteria are: intro, elim, dest, name:string,
6216 simp:term, and any term. Criteria can be preceded by '-' to select
6217 theorems that do not match. Intro, elim, dest select theorems that
6218 match the current goal, name:s selects theorems whose fully qualified
6219 name contain s, and simp:term selects all simplification rules whose
6220 lhs match term. Any other term is interpreted as pattern and selects
6221 all theorems matching the pattern. Available in ProofGeneral under
6222 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
6224 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
6226 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
6227 matching the current goal as introduction rule and not having "HOL."
6228 in their name (i.e. not being defined in theory HOL).
6230 * Command 'thms_containing' has been discontinued in favour of
6231 'find_theorems'; INCOMPATIBILITY.
6233 * Communication with Proof General is now 8bit clean, which means that
6234 Unicode text in UTF-8 encoding may be used within theory texts (both
6235 formal and informal parts). Cf. option -U of the Isabelle Proof
6236 General interface. Here are some simple examples (cf. src/HOL/ex):
6238 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
6239 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
6241 * Improved efficiency of the Simplifier and, to a lesser degree, the
6242 Classical Reasoner. Typical big applications run around 2 times
6246 *** Document preparation ***
6248 * Commands 'display_drafts' and 'print_drafts' perform simple output
6249 of raw sources. Only those symbols that do not require additional
6250 LaTeX packages (depending on comments in isabellesym.sty) are
6251 displayed properly, everything else is left verbatim. isatool display
6252 and isatool print are used as front ends (these are subject to the
6253 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
6255 * Command tags control specific markup of certain regions of text,
6256 notably folding and hiding. Predefined tags include "theory" (for
6257 theory begin and end), "proof" for proof commands, and "ML" for
6258 commands involving ML code; the additional tags "visible" and
6259 "invisible" are unused by default. Users may give explicit tag
6260 specifications in the text, e.g. ''by %invisible (auto)''. The
6261 interpretation of tags is determined by the LaTeX job during document
6262 preparation: see option -V of isatool usedir, or options -n and -t of
6263 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
6266 Several document versions may be produced at the same time via isatool
6267 usedir (the generated index.html will link all of them). Typical
6268 specifications include ''-V document=theory,proof,ML'' to present
6269 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
6270 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
6271 these parts without any formal replacement text. The Isabelle site
6272 default settings produce ''document'' and ''outline'' versions as
6275 * Several new antiquotations:
6277 @{term_type term} prints a term with its type annotated;
6279 @{typeof term} prints the type of a term;
6281 @{const const} is the same as @{term const}, but checks that the
6282 argument is a known logical constant;
6284 @{term_style style term} and @{thm_style style thm} print a term or
6285 theorem applying a "style" to it
6289 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
6290 definitions, equations, inequations etc., 'concl' printing only the
6291 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
6292 to print the specified premise. TermStyle.add_style provides an ML
6293 interface for introducing further styles. See also the "LaTeX Sugar"
6294 document practical applications. The ML antiquotation prints
6295 type-checked ML expressions verbatim.
6297 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
6298 and 'text' support optional locale specification '(in loc)', which
6299 specifies the default context for interpreting antiquotations. For
6300 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
6302 * Option 'locale=NAME' of antiquotations specifies an alternative
6303 context interpreting the subsequent argument. For example: @{thm
6304 [locale=lattice] inf_assoc}.
6306 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
6309 * Proper output of antiquotations for theory commands involving a
6310 proof context (such as 'locale' or 'theorem (in loc) ...').
6312 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
6313 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
6315 * isatool usedir: new option -C (default true) controls whether option
6316 -D should include a copy of the original document directory; -C false
6317 prevents unwanted effects such as copying of administrative CVS data.
6322 * Considerably improved version of 'constdefs' command. Now performs
6323 automatic type-inference of declared constants; additional support for
6324 local structure declarations (cf. locales and HOL records), see also
6325 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
6326 sequential dependencies of definitions within a single 'constdefs'
6327 section; moreover, the declared name needs to be an identifier. If
6328 all fails, consider to fall back on 'consts' and 'defs' separately.
6330 * Improved indexed syntax and implicit structures. First of all,
6331 indexed syntax provides a notational device for subscripted
6332 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
6333 expressions. Secondly, in a local context with structure
6334 declarations, number indexes \<^sub>n or the empty index (default
6335 number 1) refer to a certain fixed variable implicitly; option
6336 show_structs controls printing of implicit structures. Typical
6337 applications of these concepts involve record types and locales.
6339 * New command 'no_syntax' removes grammar declarations (and
6340 translations) resulting from the given syntax specification, which is
6341 interpreted in the same manner as for the 'syntax' command.
6343 * 'Advanced' translation functions (parse_translation etc.) may depend
6344 on the signature of the theory context being presently used for
6345 parsing/printing, see also isar-ref manual.
6347 * Improved 'oracle' command provides a type-safe interface to turn an
6348 ML expression of type theory -> T -> term into a primitive rule of
6349 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
6350 is already included here); see also FOL/ex/IffExample.thy;
6353 * axclass: name space prefix for class "c" is now "c_class" (was "c"
6354 before); "cI" is no longer bound, use "c.intro" instead.
6355 INCOMPATIBILITY. This change avoids clashes of fact bindings for
6356 axclasses vs. locales.
6358 * Improved internal renaming of symbolic identifiers -- attach primes
6359 instead of base 26 numbers.
6361 * New flag show_question_marks controls printing of leading question
6362 marks in schematic variable names.
6364 * In schematic variable names, *any* symbol following \<^isub> or
6365 \<^isup> is now treated as part of the base name. For example, the
6366 following works without printing of awkward ".0" indexes:
6368 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
6371 * Inner syntax includes (*(*nested*) comments*).
6373 * Pretty printer now supports unbreakable blocks, specified in mixfix
6374 annotations as "(00...)".
6376 * Clear separation of logical types and nonterminals, where the latter
6377 may only occur in 'syntax' specifications or type abbreviations.
6378 Before that distinction was only partially implemented via type class
6379 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
6380 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
6381 exotic syntax specifications may require further adaption
6382 (e.g. Cube/Cube.thy).
6384 * Removed obsolete type class "logic", use the top sort {} instead.
6385 Note that non-logical types should be declared as 'nonterminals'
6386 rather than 'types'. INCOMPATIBILITY for new object-logic
6389 * Attributes 'induct' and 'cases': type or set names may now be
6390 locally fixed variables as well.
6392 * Simplifier: can now control the depth to which conditional rewriting
6393 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
6396 * Simplifier: simplification procedures may now take the current
6397 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
6398 interface), which is very useful for calling the Simplifier
6399 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
6400 is gone -- use prems_of_ss on the simpset instead. Moreover, the
6401 low-level mk_simproc no longer applies Logic.varify internally, to
6402 allow for use in a context of fixed variables.
6404 * thin_tac now works even if the assumption being deleted contains !!
6405 or ==>. More generally, erule now works even if the major premise of
6406 the elimination rule contains !! or ==>.
6408 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
6410 * Reorganized bootstrapping of the Pure theories; CPure is now derived
6411 from Pure, which contains all common declarations already. Both
6412 theories are defined via plain Isabelle/Isar .thy files.
6413 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
6414 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
6415 use isatool fixcpure to adapt your theory and ML sources.
6417 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
6418 selections of theorems in named facts via index ranges.
6420 * 'print_theorems': in theory mode, really print the difference
6421 wrt. the last state (works for interactive theory development only),
6422 in proof mode print all local facts (cf. 'print_facts');
6424 * 'hide': option '(open)' hides only base names.
6426 * More efficient treatment of intermediate checkpoints in interactive
6429 * Code generator is now invoked via code_module (incremental code
6430 generation) and code_library (modular code generation, ML structures
6431 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
6432 must be quoted when used as identifiers.
6434 * New 'value' command for reading, evaluating and printing terms using
6435 the code generator. INCOMPATIBILITY: command keyword 'value' must be
6436 quoted when used as identifier.
6441 * New commands for the interpretation of locale expressions in
6442 theories (1), locales (2) and proof contexts (3). These generate
6443 proof obligations from the expression specification. After the
6444 obligations have been discharged, theorems of the expression are added
6445 to the theory, target locale or proof context. The synopsis of the
6446 commands is a follows:
6448 (1) interpretation expr inst
6449 (2) interpretation target < expr
6450 (3) interpret expr inst
6452 Interpretation in theories and proof contexts require a parameter
6453 instantiation of terms from the current context. This is applied to
6454 specifications and theorems of the interpreted expression.
6455 Interpretation in locales only permits parameter renaming through the
6456 locale expression. Interpretation is smart in that interpretations
6457 that are active already do not occur in proof obligations, neither are
6458 instantiated theorems stored in duplicate. Use 'print_interps' to
6459 inspect active interpretations of a particular locale. For details,
6460 see the Isar Reference manual. Examples can be found in
6461 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
6463 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
6464 'interpret' instead.
6466 * New context element 'constrains' for adding type constraints to
6469 * Context expressions: renaming of parameters with syntax
6472 * Locale declaration: 'includes' disallowed.
6474 * Proper static binding of attribute syntax -- i.e. types / terms /
6475 facts mentioned as arguments are always those of the locale definition
6476 context, independently of the context of later invocations. Moreover,
6477 locale operations (renaming and type / term instantiation) are applied
6478 to attribute arguments as expected.
6480 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
6481 actual attributes; rare situations may require Attrib.attribute to
6482 embed those attributes into Attrib.src that lack concrete syntax.
6483 Attribute implementations need to cooperate properly with the static
6484 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
6485 Attrib.XXX_thm etc. already do the right thing without further
6486 intervention. Only unusual applications -- such as "where" or "of"
6487 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
6488 on the context and the facts involved -- may have to assign parsed
6489 values to argument tokens explicitly.
6491 * Changed parameter management in theorem generation for long goal
6492 statements with 'includes'. INCOMPATIBILITY: produces a different
6493 theorem statement in rare situations.
6495 * Locale inspection command 'print_locale' omits notes elements. Use
6496 'print_locale!' to have them included in the output.
6501 * Provers/hypsubst.ML: improved version of the subst method, for
6502 single-step rewriting: it now works in bound variable contexts. New is
6503 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
6504 rewrite a different subterm than the original subst method, which is
6505 still available as 'simplesubst'.
6507 * Provers/quasi.ML: new transitivity reasoners for transitivity only
6510 * Provers/trancl.ML: new transitivity reasoner for transitive and
6511 reflexive-transitive closure of relations.
6513 * Provers/blast.ML: new reference depth_limit to make blast's depth
6514 limit (previously hard-coded with a value of 20) user-definable.
6516 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
6517 is peformed already. Object-logics merely need to finish their
6518 initial simpset configuration as before. INCOMPATIBILITY.
6523 * Symbolic syntax of Hilbert Choice Operator is now as follows:
6526 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
6528 The symbol \<some> is displayed as the alternative epsilon of LaTeX
6529 and x-symbol; use option '-m epsilon' to get it actually printed.
6530 Moreover, the mathematically important symbolic identifier \<epsilon>
6531 becomes available as variable, constant etc. INCOMPATIBILITY,
6533 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
6534 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
6535 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
6536 support corresponding Isar calculations.
6538 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
6541 * theory SetInterval: changed the syntax for open intervals:
6550 The old syntax is still supported but will disappear in the next
6551 release. For conversion use the following Emacs search and replace
6552 patterns (these are not perfect but work quite well):
6554 {)\([^\.]*\)\.\. -> {\1<\.\.}
6555 \.\.\([^(}]*\)(} -> \.\.<\1}
6557 * Theory Commutative_Ring (in Library): method comm_ring for proving
6558 equalities in commutative rings; method 'algebra' provides a generic
6561 * Theory Finite_Set: changed the syntax for 'setsum', summation over
6562 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
6563 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
6566 Some new syntax forms are available:
6568 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
6569 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
6570 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
6571 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
6573 The latter form "\<Sum>x < k. e" used to be based on a separate
6574 function "Summation", which has been discontinued.
6576 * theory Finite_Set: in structured induction proofs, the insert case
6577 is now 'case (insert x F)' instead of the old counterintuitive 'case
6580 * The 'refute' command has been extended to support a much larger
6581 fragment of HOL, including axiomatic type classes, constdefs and
6582 typedefs, inductive datatypes and recursion.
6584 * New tactics 'sat' and 'satx' to prove propositional tautologies.
6585 Requires zChaff with proof generation to be installed. See
6586 HOL/ex/SAT_Examples.thy for examples.
6588 * Datatype induction via method 'induct' now preserves the name of the
6589 induction variable. For example, when proving P(xs::'a list) by
6590 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
6591 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
6592 in unstructured proof scripts.
6594 * Reworked implementation of records. Improved scalability for
6595 records with many fields, avoiding performance problems for type
6596 inference. Records are no longer composed of nested field types, but
6597 of nested extension types. Therefore the record type only grows linear
6598 in the number of extensions and not in the number of fields. The
6599 top-level (users) view on records is preserved. Potential
6600 INCOMPATIBILITY only in strange cases, where the theory depends on the
6601 old record representation. The type generated for a record is called
6602 <record_name>_ext_type.
6604 Flag record_quick_and_dirty_sensitive can be enabled to skip the
6605 proofs triggered by a record definition or a simproc (if
6606 quick_and_dirty is enabled). Definitions of large records can take
6609 New simproc record_upd_simproc for simplification of multiple record
6610 updates enabled by default. Moreover, trivial updates are also
6611 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
6612 occasionally, since simplification is more powerful by default.
6614 * typedef: proper support for polymorphic sets, which contain extra
6615 type-variables in the term.
6617 * Simplifier: automatically reasons about transitivity chains
6618 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
6619 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
6620 old proofs break occasionally as simplification may now solve more
6621 goals than previously.
6623 * Simplifier: converts x <= y into x = y if assumption y <= x is
6624 present. Works for all partial orders (class "order"), in particular
6625 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
6628 * Simplifier: new simproc for "let x = a in f x". If a is a free or
6629 bound variable or a constant then the let is unfolded. Otherwise
6630 first a is simplified to b, and then f b is simplified to g. If
6631 possible we abstract b from g arriving at "let x = b in h x",
6632 otherwise we unfold the let and arrive at g. The simproc can be
6633 enabled/disabled by the reference use_let_simproc. Potential
6634 INCOMPATIBILITY since simplification is more powerful by default.
6636 * Classical reasoning: the meson method now accepts theorems as arguments.
6638 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
6639 jobs to provide advice on the provability of subgoals.
6641 * Theory OrderedGroup and Ring_and_Field: various additions and
6642 improvements to faciliate calculations involving equalities and
6645 The following theorems have been eliminated or modified
6648 abs_eq now named abs_of_nonneg
6649 abs_of_ge_0 now named abs_of_nonneg
6650 abs_minus_eq now named abs_of_nonpos
6651 imp_abs_id now named abs_of_nonneg
6652 imp_abs_neg_id now named abs_of_nonpos
6653 mult_pos now named mult_pos_pos
6654 mult_pos_le now named mult_nonneg_nonneg
6655 mult_pos_neg_le now named mult_nonneg_nonpos
6656 mult_pos_neg2_le now named mult_nonneg_nonpos2
6657 mult_neg now named mult_neg_neg
6658 mult_neg_le now named mult_nonpos_nonpos
6660 * The following lemmas in Ring_and_Field have been added to the simplifier:
6663 not_square_less_zero
6665 The following lemmas have been deleted from Real/RealPow:
6675 * Theory Parity: added rules for simplifying exponents.
6679 The following theorems have been eliminated or modified
6682 list_all_Nil now named list_all.simps(1)
6683 list_all_Cons now named list_all.simps(2)
6684 list_all_conv now named list_all_iff
6685 set_mem_eq now named mem_iff
6687 * Theories SetsAndFunctions and BigO (see HOL/Library) support
6688 asymptotic "big O" calculations. See the notes in BigO.thy.
6693 * Theory RealDef: better support for embedding natural numbers and
6694 integers in the reals.
6696 The following theorems have been eliminated or modified
6699 exp_ge_add_one_self now requires no hypotheses
6700 real_of_int_add reversed direction of equality (use [symmetric])
6701 real_of_int_minus reversed direction of equality (use [symmetric])
6702 real_of_int_diff reversed direction of equality (use [symmetric])
6703 real_of_int_mult reversed direction of equality (use [symmetric])
6705 * Theory RComplete: expanded support for floor and ceiling functions.
6707 * Theory Ln is new, with properties of the natural logarithm
6709 * Hyperreal: There is a new type constructor "star" for making
6710 nonstandard types. The old type names are now type synonyms:
6714 hcomplex = complex star
6716 * Hyperreal: Many groups of similarly-defined constants have been
6717 replaced by polymorphic versions (INCOMPATIBILITY):
6719 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
6721 starset <-- starsetNat, starsetC
6722 *s* <-- *sNat*, *sc*
6723 starset_n <-- starsetNat_n, starsetC_n
6724 *sn* <-- *sNatn*, *scn*
6725 InternalSets <-- InternalNatSets, InternalCSets
6727 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6728 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
6729 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
6730 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
6731 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
6733 * Hyperreal: Many type-specific theorems have been removed in favor of
6734 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
6736 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
6737 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
6738 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
6739 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
6740 right_minus <-- hypreal_add_minus
6741 left_minus <-- {hypreal,hcomplex}_add_minus_left
6742 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
6743 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
6744 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
6745 mult_1_right <-- hcomplex_mult_one_right
6746 mult_zero_left <-- hcomplex_mult_zero_left
6747 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
6748 right_distrib <-- hypnat_add_mult_distrib2
6749 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
6750 right_inverse <-- hypreal_mult_inverse
6751 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
6752 order_refl <-- {hypreal,hypnat}_le_refl
6753 order_trans <-- {hypreal,hypnat}_le_trans
6754 order_antisym <-- {hypreal,hypnat}_le_anti_sym
6755 order_less_le <-- {hypreal,hypnat}_less_le
6756 linorder_linear <-- {hypreal,hypnat}_le_linear
6757 add_left_mono <-- {hypreal,hypnat}_add_left_mono
6758 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
6759 add_nonneg_nonneg <-- hypreal_le_add_order
6761 * Hyperreal: Separate theorems having to do with type-specific
6762 versions of constants have been merged into theorems that apply to the
6763 new polymorphic constants (INCOMPATIBILITY):
6765 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
6766 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
6767 STAR_Un <-- {STAR,NatStar,STARC}_Un
6768 STAR_Int <-- {STAR,NatStar,STARC}_Int
6769 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
6770 STAR_subset <-- {STAR,NatStar,STARC}_subset
6771 STAR_mem <-- {STAR,NatStar,STARC}_mem
6772 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
6773 STAR_diff <-- {STAR,STARC}_diff
6774 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
6775 STARC_hcomplex_of_complex}_image_subset
6776 starset_n_Un <-- starset{Nat,C}_n_Un
6777 starset_n_Int <-- starset{Nat,C}_n_Int
6778 starset_n_Compl <-- starset{Nat,C}_n_Compl
6779 starset_n_diff <-- starset{Nat,C}_n_diff
6780 InternalSets_Un <-- Internal{Nat,C}Sets_Un
6781 InternalSets_Int <-- Internal{Nat,C}Sets_Int
6782 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
6783 InternalSets_diff <-- Internal{Nat,C}Sets_diff
6784 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
6785 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
6786 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
6787 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
6788 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
6789 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6790 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
6791 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
6792 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
6793 starfun_diff <-- starfun{C,RC,CR}_diff
6794 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
6795 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
6796 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
6797 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
6798 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
6799 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
6800 starfun_Id <-- starfunC_Id
6801 starfun_approx <-- starfun{Nat,CR}_approx
6802 starfun_capprox <-- starfun{C,RC}_capprox
6803 starfun_abs <-- starfunNat_rabs
6804 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
6805 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
6806 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
6807 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
6808 starfun_add_capprox <-- starfun{C,RC}_add_capprox
6809 starfun_add_approx <-- starfunCR_add_approx
6810 starfun_inverse_inverse <-- starfunC_inverse_inverse
6811 starfun_divide <-- starfun{C,CR,RC}_divide
6812 starfun_n <-- starfun{Nat,C}_n
6813 starfun_n_mult <-- starfun{Nat,C}_n_mult
6814 starfun_n_add <-- starfun{Nat,C}_n_add
6815 starfun_n_add_minus <-- starfunNat_n_add_minus
6816 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
6817 starfun_n_minus <-- starfun{Nat,C}_n_minus
6818 starfun_n_eq <-- starfun{Nat,C}_n_eq
6820 star_n_add <-- {hypreal,hypnat,hcomplex}_add
6821 star_n_minus <-- {hypreal,hcomplex}_minus
6822 star_n_diff <-- {hypreal,hcomplex}_diff
6823 star_n_mult <-- {hypreal,hcomplex}_mult
6824 star_n_inverse <-- {hypreal,hcomplex}_inverse
6825 star_n_le <-- {hypreal,hypnat}_le
6826 star_n_less <-- {hypreal,hypnat}_less
6827 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
6828 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
6829 star_n_abs <-- hypreal_hrabs
6830 star_n_divide <-- hcomplex_divide
6832 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
6833 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
6834 star_of_diff <-- hypreal_of_real_diff
6835 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
6836 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
6837 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
6838 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
6839 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
6840 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
6841 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
6842 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
6843 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
6844 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
6845 star_of_number_of <-- {hypreal,hcomplex}_number_of
6846 star_of_number_less <-- number_of_less_hypreal_of_real_iff
6847 star_of_number_le <-- number_of_le_hypreal_of_real_iff
6848 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
6849 star_of_less_number <-- hypreal_of_real_less_number_of_iff
6850 star_of_le_number <-- hypreal_of_real_le_number_of_iff
6851 star_of_power <-- hypreal_of_real_power
6852 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
6854 * Hyperreal: new method "transfer" that implements the transfer
6855 principle of nonstandard analysis. With a subgoal that mentions
6856 nonstandard types like "'a star", the command "apply transfer"
6857 replaces it with an equivalent one that mentions only standard types.
6858 To be successful, all free variables must have standard types; non-
6859 standard variables must have explicit universal quantifiers.
6861 * Hyperreal: A theory of Taylor series.
6866 * Discontinued special version of 'constdefs' (which used to support
6867 continuous functions) in favor of the general Pure one with full
6870 * New simplification procedure for solving continuity conditions; it
6871 is much faster on terms with many nested lambda abstractions (cubic
6872 instead of exponential time).
6874 * New syntax for domain package: selector names are now optional.
6875 Parentheses should be omitted unless argument is lazy, for example:
6877 domain 'a stream = cons "'a" (lazy "'a stream")
6879 * New command 'fixrec' for defining recursive functions with pattern
6880 matching; defining multiple functions with mutual recursion is also
6881 supported. Patterns may include the constants cpair, spair, up, sinl,
6882 sinr, or any data constructor defined by the domain package. The given
6883 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
6884 syntax and examples.
6886 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
6887 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
6888 but the proof obligation additionally includes an admissibility
6889 requirement. The packages generate instances of class cpo or pcpo,
6890 with continuity and strictness theorems for Rep and Abs.
6892 * HOLCF: Many theorems have been renamed according to a more standard naming
6893 scheme (INCOMPATIBILITY):
6895 foo_inject: "foo$x = foo$y ==> x = y"
6896 foo_eq: "(foo$x = foo$y) = (x = y)"
6897 foo_less: "(foo$x << foo$y) = (x << y)"
6898 foo_strict: "foo$UU = UU"
6899 foo_defined: "... ==> foo$x ~= UU"
6900 foo_defined_iff: "(foo$x = UU) = (x = UU)"
6905 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
6906 including the First Isomorphism Theorem (on quotienting by the kernel
6909 * ZF/Simplifier: install second copy of type solver that actually
6910 makes use of TC rules declared to Isar proof contexts (or locales);
6911 the old version is still required for ML proof scripts.
6916 * Converted to Isar theory format; use locales instead of axiomatic
6922 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
6925 * Pure/library.ML no longer defines its own option datatype, but uses
6926 that of the SML basis, which has constructors NONE and SOME instead of
6927 None and Some, as well as exception Option.Option instead of OPTION.
6928 The functions the, if_none, is_some, is_none have been adapted
6929 accordingly, while Option.map replaces apsome.
6931 * Pure/library.ML: the exception LIST has been given up in favour of
6932 the standard exceptions Empty and Subscript, as well as
6933 Library.UnequalLengths. Function like Library.hd and Library.tl are
6934 superceded by the standard hd and tl functions etc.
6936 A number of basic list functions are no longer exported to the ML
6937 toplevel, as they are variants of predefined functions. The following
6938 suggests how one can translate existing code:
6940 rev_append xs ys = List.revAppend (xs, ys)
6941 nth_elem (i, xs) = List.nth (xs, i)
6942 last_elem xs = List.last xs
6943 flat xss = List.concat xss
6944 seq fs = List.app fs
6945 partition P xs = List.partition P xs
6946 mapfilter f xs = List.mapPartial f xs
6948 * Pure/library.ML: several combinators for linear functional
6949 transformations, notably reverse application and composition:
6952 (x, y) |-> f f #-> g
6954 * Pure/library.ML: introduced/changed precedence of infix operators:
6956 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
6958 infix 3 o oo ooo oooo;
6959 infix 4 ~~ upto downto;
6961 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
6964 * Pure/library.ML: natural list combinators fold, fold_rev, and
6965 fold_map support linear functional transformations and nesting. For
6968 fold f [x1, ..., xN] y =
6969 y |> f x1 |> ... |> f xN
6971 (fold o fold) f [xs1, ..., xsN] y =
6972 y |> fold f xs1 |> ... |> fold f xsN
6974 fold f [x1, ..., xN] =
6977 (fold o fold) f [xs1, ..., xsN] =
6978 fold f xs1 #> ... #> fold f xsN
6980 * Pure/library.ML: the following selectors on type 'a option are
6983 the: 'a option -> 'a (*partial*)
6984 these: 'a option -> 'a where 'a = 'b list
6985 the_default: 'a -> 'a option -> 'a
6986 the_list: 'a option -> 'a list
6988 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6989 basic operations for association lists, following natural argument
6990 order; moreover the explicit equality predicate passed here avoids
6991 potentially expensive polymorphic runtime equality checks.
6992 The old functions may be expressed as follows:
6994 assoc = uncurry (AList.lookup (op =))
6995 assocs = these oo AList.lookup (op =)
6996 overwrite = uncurry (AList.update (op =)) o swap
6998 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7000 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
7001 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
7003 replacing make_keylist and keyfilter (occassionally used)
7006 make_keylist = AList.make
7007 keyfilter = AList.find (op =)
7009 * eq_fst and eq_snd now take explicit equality parameter, thus
7010 avoiding eqtypes. Naive rewrites:
7012 eq_fst = eq_fst (op =)
7013 eq_snd = eq_snd (op =)
7015 * Removed deprecated apl and apr (rarely used).
7018 apl (n, op) =>>= curry op n
7019 apr (op, m) =>>= fn n => op (n, m)
7021 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
7022 provides a reasonably efficient light-weight implementation of sets as
7025 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
7026 few new operations; existing lookup and update are now curried to
7027 follow natural argument order (for use with fold etc.);
7028 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
7030 * Pure/General: output via the Isabelle channels of
7031 writeln/warning/error etc. is now passed through Output.output, with a
7032 hook for arbitrary transformations depending on the print_mode
7033 (cf. Output.add_mode -- the first active mode that provides a output
7034 function wins). Already formatted output may be embedded into further
7035 text via Output.raw; the result of Pretty.string_of/str_of and derived
7036 functions (string_of_term/cterm/thm etc.) is already marked raw to
7037 accommodate easy composition of diagnostic messages etc. Programmers
7038 rarely need to care about Output.output or Output.raw at all, with
7039 some notable exceptions: Output.output is required when bypassing the
7040 standard channels (writeln etc.), or in token translations to produce
7041 properly formatted results; Output.raw is required when capturing
7042 already output material that will eventually be presented to the user
7043 a second time. For the default print mode, both Output.output and
7044 Output.raw have no effect.
7046 * Pure/General: Output.time_accumulator NAME creates an operator ('a
7047 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
7048 cumulative results are displayed at the end of a batch session.
7050 * Pure/General: File.sysify_path and File.quote_sysify path have been
7051 replaced by File.platform_path and File.shell_path (with appropriate
7052 hooks). This provides a clean interface for unusual systems where the
7053 internal and external process view of file names are different.
7055 * Pure: more efficient orders for basic syntactic entities: added
7056 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
7057 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
7058 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
7059 orders now -- potential INCOMPATIBILITY for code that depends on a
7060 particular order for Symtab.keys, Symtab.dest, etc. (consider using
7061 Library.sort_strings on result).
7063 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
7064 fold_types traverse types/terms from left to right, observing natural
7065 argument order. Supercedes previous foldl_XXX versions, add_frees,
7066 add_vars etc. have been adapted as well: INCOMPATIBILITY.
7068 * Pure: name spaces have been refined, with significant changes of the
7069 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
7070 to extern(_table). The plain name entry path is superceded by a
7071 general 'naming' context, which also includes the 'policy' to produce
7072 a fully qualified name and external accesses of a fully qualified
7073 name; NameSpace.extend is superceded by context dependent
7074 Sign.declare_name. Several theory and proof context operations modify
7075 the naming context. Especially note Theory.restore_naming and
7076 ProofContext.restore_naming to get back to a sane state; note that
7077 Theory.add_path is no longer sufficient to recover from
7078 Theory.absolute_path in particular.
7080 * Pure: new flags short_names (default false) and unique_names
7081 (default true) for controlling output of qualified names. If
7082 short_names is set, names are printed unqualified. If unique_names is
7083 reset, the name prefix is reduced to the minimum required to achieve
7084 the original result when interning again, even if there is an overlap
7085 with earlier declarations.
7087 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
7088 now 'extend', and 'merge' gets an additional Pretty.pp argument
7089 (useful for printing error messages). INCOMPATIBILITY.
7091 * Pure: major reorganization of the theory context. Type Sign.sg and
7092 Theory.theory are now identified, referring to the universal
7093 Context.theory (see Pure/context.ML). Actual signature and theory
7094 content is managed as theory data. The old code and interfaces were
7095 spread over many files and structures; the new arrangement introduces
7096 considerable INCOMPATIBILITY to gain more clarity:
7098 Context -- theory management operations (name, identity, inclusion,
7099 parents, ancestors, merge, etc.), plus generic theory data;
7101 Sign -- logical signature and syntax operations (declaring consts,
7102 types, etc.), plus certify/read for common entities;
7104 Theory -- logical theory operations (stating axioms, definitions,
7105 oracles), plus a copy of logical signature operations (consts,
7106 types, etc.); also a few basic management operations (Theory.copy,
7109 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
7110 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
7111 for convenience -- they merely return the theory.
7113 * Pure: type Type.tsig is superceded by theory in most interfaces.
7115 * Pure: the Isar proof context type is already defined early in Pure
7116 as Context.proof (note that ProofContext.context and Proof.context are
7117 aliases, where the latter is the preferred name). This enables other
7118 Isabelle components to refer to that type even before Isar is present.
7120 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
7121 typeK, constK, axiomK, oracleK), but provide explicit operations for
7122 any of these kinds. For example, Sign.intern typeK is now
7123 Sign.intern_type, Theory.hide_space Sign.typeK is now
7124 Theory.hide_types. Also note that former
7125 Theory.hide_classes/types/consts are now
7126 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
7127 internalize their arguments! INCOMPATIBILITY.
7129 * Pure: get_thm interface (of PureThy and ProofContext) expects
7130 datatype thmref (with constructors Name and NameSelection) instead of
7131 plain string -- INCOMPATIBILITY;
7133 * Pure: cases produced by proof methods specify options, where NONE
7134 means to remove case bindings -- INCOMPATIBILITY in
7137 * Pure: the following operations retrieve axioms or theorems from a
7138 theory node or theory hierarchy, respectively:
7140 Theory.axioms_of: theory -> (string * term) list
7141 Theory.all_axioms_of: theory -> (string * term) list
7142 PureThy.thms_of: theory -> (string * thm) list
7143 PureThy.all_thms_of: theory -> (string * thm) list
7145 * Pure: print_tac now outputs the goal through the trace channel.
7147 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
7148 Reference Toplevel.debug (default false) controls detailed printing
7149 and tracing of low-level exceptions; Toplevel.profiling (default 0)
7150 controls execution profiling -- set to 1 for time and 2 for space
7151 (both increase the runtime).
7153 * Isar session: The initial use of ROOT.ML is now always timed,
7154 i.e. the log will show the actual process times, in contrast to the
7155 elapsed wall-clock time that the outer shell wrapper produces.
7157 * Simplifier: improved handling of bound variables (nameless
7158 representation, avoid allocating new strings). Simprocs that invoke
7159 the Simplifier recursively should use Simplifier.inherit_bounds to
7160 avoid local name clashes. Failure to do so produces warnings
7161 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
7162 for further details.
7164 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
7165 bindings for all theorems stored within a given theory; this may help
7166 in porting non-Isar theories to Isar ones, while keeping ML proof
7167 scripts for the time being.
7169 * ML operator HTML.with_charset specifies the charset begin used for
7170 generated HTML files. For example:
7172 HTML.with_charset "utf-8" use_thy "Hebrew";
7173 HTML.with_charset "utf-8" use_thy "Chinese";
7178 * Allow symlinks to all proper Isabelle executables (Isabelle,
7179 isabelle, isatool etc.).
7181 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
7182 isatool doc, isatool mkdir, display_drafts etc.).
7184 * isatool usedir: option -f allows specification of the ML file to be
7185 used by Isabelle; default is ROOT.ML.
7187 * New isatool version outputs the version identifier of the Isabelle
7188 distribution being used.
7190 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
7191 (containing Boolean satisfiability problems) into Isabelle/HOL
7196 New in Isabelle2004 (April 2004)
7197 --------------------------------
7201 * Provers/order.ML: new efficient reasoner for partial and linear orders.
7202 Replaces linorder.ML.
7204 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
7205 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
7206 (\<a>...\<z>), are now considered normal letters, and can therefore
7207 be used anywhere where an ASCII letter (a...zA...Z) has until
7208 now. COMPATIBILITY: This obviously changes the parsing of some
7209 terms, especially where a symbol has been used as a binder, say
7210 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
7211 as an identifier. Fix it by inserting a space around former
7212 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
7213 existing theory and ML files.
7215 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
7217 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
7218 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
7219 a normal (but invisible) letter. For multiple letter subscripts repeat
7220 \<^isub> like this: x\<^isub>1\<^isub>2.
7222 * Pure: There are now sub-/superscripts that can span more than one
7223 character. Text between \<^bsub> and \<^esub> is set in subscript in
7224 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
7225 superscript. The new control characters are not identifier parts.
7227 * Pure: Control-symbols of the form \<^raw:...> will literally print the
7228 content of "..." to the latex file instead of \isacntrl... . The "..."
7229 may consist of any printable characters excluding the end bracket >.
7231 * Pure: Using new Isar command "finalconsts" (or the ML functions
7232 Theory.add_finals or Theory.add_finals_i) it is now possible to
7233 declare constants "final", which prevents their being given a definition
7234 later. It is useful for constants whose behaviour is fixed axiomatically
7235 rather than definitionally, such as the meta-logic connectives.
7237 * Pure: 'instance' now handles general arities with general sorts
7238 (i.e. intersections of classes),
7240 * Presentation: generated HTML now uses a CSS style sheet to make layout
7241 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
7242 It can be changed to alter the colors/layout of generated pages.
7247 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
7248 cut_tac, subgoal_tac and thin_tac:
7249 - Now understand static (Isar) contexts. As a consequence, users of Isar
7250 locales are no longer forced to write Isar proof scripts.
7251 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
7253 - INCOMPATIBILITY: names of variables to be instantiated may no
7254 longer be enclosed in quotes. Instead, precede variable name with `?'.
7255 This is consistent with the instantiation attribute "where".
7257 * Attributes "where" and "of":
7258 - Now take type variables of instantiated theorem into account when reading
7259 the instantiation string. This fixes a bug that caused instantiated
7260 theorems to have too special types in some circumstances.
7261 - "where" permits explicit instantiations of type variables.
7263 * Calculation commands "moreover" and "also" no longer interfere with
7264 current facts ("this"), admitting arbitrary combinations with "then"
7268 - Goal statements involving the context element "includes" no longer
7269 generate theorems with internal delta predicates (those ending on
7270 "_axioms") in the premise.
7271 Resolve particular premise with <locale>.intro to obtain old form.
7272 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
7273 specification and "includes" elements in goal statement.
7274 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
7275 [intro?] and [elim?] (respectively) by default.
7276 - Experimental command for instantiation of locales in proof contexts:
7277 instantiate <label>[<attrs>]: <loc>
7278 Instantiates locale <loc> and adds all its theorems to the current context
7279 taking into account their attributes. Label and attrs are optional
7280 modifiers, like in theorem declarations. If present, names of
7281 instantiated theorems are qualified with <label>, and the attributes
7282 <attrs> are applied after any attributes these theorems might have already.
7283 If the locale has assumptions, a chained fact of the form
7284 "<loc> t1 ... tn" is expected from which instantiations of the parameters
7285 are derived. The command does not support old-style locales declared
7286 with "locale (open)".
7287 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
7289 * HOL: Tactic emulation methods induct_tac and case_tac understand static
7295 * Proof import: new image HOL4 contains the imported library from
7296 the HOL4 system with about 2500 theorems. It is imported by
7297 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
7298 can be used like any other Isabelle image. See
7299 HOL/Import/HOL/README for more information.
7302 - Much improved handling of linear and partial orders.
7303 Reasoners for linear and partial orders are set up for type classes
7304 "linorder" and "order" respectively, and are added to the default simpset
7305 as solvers. This means that the simplifier can build transitivity chains
7306 to solve goals from the assumptions.
7307 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
7308 of blast or auto after simplification become unnecessary because the goal
7309 is solved by simplification already.
7311 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
7312 all proved in axiomatic type classes for semirings, rings and fields.
7315 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
7316 now formalized using the Ring_and_Field theory mentioned above.
7317 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
7318 than before, because now they are set up once in a generic manner.
7319 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
7320 Look for the general versions in Ring_and_Field (and Power if they concern
7323 * Type "rat" of the rational numbers is now available in HOL-Complex.
7326 - Record types are now by default printed with their type abbreviation
7327 instead of the list of all field types. This can be configured via
7328 the reference "print_record_type_abbr".
7329 - Simproc "record_upd_simproc" for simplification of multiple updates added
7330 (not enabled by default).
7331 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
7332 EX x. x = sel r to True (not enabled by default).
7333 - Tactic "record_split_simp_tac" to split and simplify records added.
7335 * 'specification' command added, allowing for definition by
7336 specification. There is also an 'ax_specification' command that
7337 introduces the new constants axiomatically.
7339 * arith(_tac) is now able to generate counterexamples for reals as well.
7341 * HOL-Algebra: new locale "ring" for non-commutative rings.
7343 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
7344 definitions, thanks to Sava Krsti\'{c} and John Matthews.
7346 * HOL-Matrix: a first theory for matrices in HOL with an application of
7347 matrix theory to linear programming.
7349 * Unions and Intersections:
7350 The latex output syntax of UN and INT has been changed
7351 from "\Union x \in A. B" to "\Union_{x \in A} B"
7352 i.e. the index formulae has become a subscript.
7353 Similarly for "\Union x. B", and for \Inter instead of \Union.
7355 * Unions and Intersections over Intervals:
7356 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
7357 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
7358 like in normal math, and corresponding versions for < and for intersection.
7360 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
7361 lexicographic dictonary ordering has been added as "lexord".
7363 * ML: the legacy theory structures Int and List have been removed. They had
7364 conflicted with ML Basis Library structures having the same names.
7366 * 'refute' command added to search for (finite) countermodels. Only works
7367 for a fragment of HOL. The installation of an external SAT solver is
7368 highly recommended. See "HOL/Refute.thy" for details.
7370 * 'quickcheck' command: Allows to find counterexamples by evaluating
7371 formulae under an assignment of free variables to random values.
7372 In contrast to 'refute', it can deal with inductive datatypes,
7373 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
7379 * Streams now come with concatenation and are part of the HOLCF image
7383 New in Isabelle2003 (May 2003)
7384 ------------------------------
7388 * Provers/simplifier:
7390 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
7391 Assumptions are now subject to complete mutual simplification,
7392 not just from left to right. The simplifier now preserves
7393 the order of assumptions.
7395 Potential INCOMPATIBILITY:
7397 -- simp sometimes diverges where the old version did
7398 not, e.g. invoking simp on the goal
7400 [| P (f x); y = x; f x = f y |] ==> Q
7402 now gives rise to the infinite reduction sequence
7404 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
7406 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
7409 -- Tactics combining classical reasoner and simplification (such as auto)
7410 are also affected by this change, because many of them rely on
7411 simp. They may sometimes diverge as well or yield a different numbers
7412 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
7413 in case of problems. Sometimes subsequent calls to the classical
7414 reasoner will fail because a preceeding call to the simplifier too
7415 eagerly simplified the goal, e.g. deleted redundant premises.
7417 - The simplifier trace now shows the names of the applied rewrite rules
7419 - You can limit the number of recursive invocations of the simplifier
7420 during conditional rewriting (where the simplifie tries to solve the
7421 conditions before applying the rewrite rule):
7422 ML "simp_depth_limit := n"
7423 where n is an integer. Thus you can force termination where previously
7424 the simplifier would diverge.
7426 - Accepts free variables as head terms in congruence rules. Useful in Isar.
7428 - No longer aborts on failed congruence proof. Instead, the
7429 congruence is ignored.
7431 * Pure: New generic framework for extracting programs from constructive
7432 proofs. See HOL/Extraction.thy for an example instantiation, as well
7433 as HOL/Extraction for some case studies.
7435 * Pure: The main goal of the proof state is no longer shown by default, only
7436 the subgoals. This behaviour is controlled by a new flag.
7437 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
7438 (ML: Proof.show_main_goal).
7440 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
7441 rules whose conclusion matches subgoal 1:
7442 PG menu: Isabelle/Isar -> Show me -> matching rules
7443 The rules are ordered by how closely they match the subgoal.
7444 In particular, rules that solve a subgoal outright are displayed first
7445 (or rather last, the way they are printed).
7446 (ML: ProofGeneral.print_intros())
7448 * Pure: New flag trace_unify_fail causes unification to print
7449 diagnostic information (PG: in trace buffer) when it fails. This is
7450 useful for figuring out why single step proofs like rule, erule or
7453 * Pure: Locale specifications now produce predicate definitions
7454 according to the body of text (covering assumptions modulo local
7455 definitions); predicate "loc_axioms" covers newly introduced text,
7456 while "loc" is cumulative wrt. all included locale expressions; the
7457 latter view is presented only on export into the global theory
7458 context; potential INCOMPATIBILITY, use "(open)" option to fall back
7459 on the old view without predicates;
7461 * Pure: predefined locales "var" and "struct" are useful for sharing
7462 parameters (as in CASL, for example); just specify something like
7463 ``var x + var y + struct M'' as import;
7465 * Pure: improved thms_containing: proper indexing of facts instead of
7466 raw theorems; check validity of results wrt. current name space;
7467 include local facts of proof configuration (also covers active
7468 locales), cover fixed variables in index; may use "_" in term
7469 specification; an optional limit for the number of printed facts may
7470 be given (the default is 40);
7472 * Pure: disallow duplicate fact bindings within new-style theory files
7475 * Provers: improved induct method: assumptions introduced by case
7476 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
7477 the goal statement); "foo" still refers to all facts collectively;
7479 * Provers: the function blast.overloaded has been removed: all constants
7480 are regarded as potentially overloaded, which improves robustness in exchange
7481 for slight decrease in efficiency;
7483 * Provers/linorder: New generic prover for transitivity reasoning over
7484 linear orders. Note: this prover is not efficient!
7486 * Isar: preview of problems to finish 'show' now produce an error
7487 rather than just a warning (in interactive mode);
7494 - Produces a counter example if it cannot prove a goal.
7495 Note that the counter example may be spurious if the goal is not a formula
7496 of quantifier-free linear arithmetic.
7497 In ProofGeneral the counter example appears in the trace buffer.
7499 - Knows about div k and mod k where k is a numeral of type nat or int.
7501 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
7502 linear arithmetic fails. This takes account of quantifiers and divisibility.
7503 Presburger arithmetic can also be called explicitly via presburger(_tac).
7505 * simp's arithmetic capabilities have been enhanced a bit: it now
7506 takes ~= in premises into account (by performing a case split);
7508 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
7509 are distributed over a sum of terms;
7511 * New tactic "trans_tac" and method "trans" instantiate
7512 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
7515 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
7516 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
7518 * 'typedef' command has new option "open" to suppress the set
7521 * functions Min and Max on finite sets have been introduced (theory
7524 * attribute [symmetric] now works for relations as well; it turns
7525 (x,y) : R^-1 into (y,x) : R, and vice versa;
7527 * induct over a !!-quantified statement (say !!x1..xn):
7528 each "case" automatically performs "fix x1 .. xn" with exactly those names.
7530 * Map: `empty' is no longer a constant but a syntactic abbreviation for
7531 %x. None. Warning: empty_def now refers to the previously hidden definition
7534 * Algebra: formalization of classical algebra. Intended as base for
7535 any algebraic development in Isabelle. Currently covers group theory
7536 (up to Sylow's theorem) and ring theory (Universal Property of
7537 Univariate Polynomials). Contributions welcome;
7539 * GroupTheory: deleted, since its material has been moved to Algebra;
7541 * Complex: new directory of the complex numbers with numeric constants,
7542 nonstandard complex numbers, and some complex analysis, standard and
7543 nonstandard (Jacques Fleuriot);
7545 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
7547 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
7550 * Real/HahnBanach: updated and adapted to locales;
7552 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
7555 * UNITY: added the Meier-Sanders theory of progress sets;
7557 * MicroJava: bytecode verifier and lightweight bytecode verifier
7558 as abstract algorithms, instantiated to the JVM;
7560 * Bali: Java source language formalization. Type system, operational
7561 semantics, axiomatic semantics. Supported language features:
7562 classes, interfaces, objects,virtual methods, static methods,
7563 static/instance fields, arrays, access modifiers, definite
7564 assignment, exceptions.
7569 * ZF/Constructible: consistency proof for AC (Gdel's constructible
7572 * Main ZF: virtually all theories converted to new-style format;
7577 * Pure: Tactic.prove provides sane interface for internal proofs;
7578 omits the infamous "standard" operation, so this is more appropriate
7579 than prove_goalw_cterm in many situations (e.g. in simprocs);
7581 * Pure: improved error reporting of simprocs;
7583 * Provers: Simplifier.simproc(_i) provides sane interface for setting
7587 *** Document preparation ***
7589 * uses \par instead of \\ for line breaks in theory text. This may
7590 shift some page breaks in large documents. To get the old behaviour
7591 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
7593 * minimized dependencies of isabelle.sty and isabellesym.sty on
7596 * \<euro> now needs package babel/greek instead of marvosym (which
7599 * normal size for \<zero>...\<nine> (uses \mathbf instead of
7604 New in Isabelle2002 (March 2002)
7605 --------------------------------
7607 *** Document preparation ***
7609 * greatly simplified document preparation setup, including more
7610 graceful interpretation of isatool usedir -i/-d/-D options, and more
7611 instructive isatool mkdir; users should basically be able to get
7612 started with "isatool mkdir HOL Test && isatool make"; alternatively,
7613 users may run a separate document processing stage manually like this:
7614 "isatool usedir -D output HOL Test && isatool document Test/output";
7616 * theory dependency graph may now be incorporated into documents;
7617 isatool usedir -g true will produce session_graph.eps/.pdf for use
7618 with \includegraphics of LaTeX;
7620 * proper spacing of consecutive markup elements, especially text
7621 blocks after section headings;
7623 * support bold style (for single symbols only), input syntax is like
7624 this: "\<^bold>\<alpha>" or "\<^bold>A";
7626 * \<bullet> is now output as bold \cdot by default, which looks much
7627 better in printed text;
7629 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
7630 note that these symbols are currently unavailable in Proof General /
7631 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
7633 * isatool latex no longer depends on changed TEXINPUTS, instead
7634 isatool document copies the Isabelle style files to the target
7640 * Pure/Provers: improved proof by cases and induction;
7641 - 'case' command admits impromptu naming of parameters (such as
7643 - 'induct' method divinates rule instantiation from the inductive
7644 claim; no longer requires excessive ?P bindings for proper
7645 instantiation of cases;
7646 - 'induct' method properly enumerates all possibilities of set/type
7647 rules; as a consequence facts may be also passed through *type*
7648 rules without further ado;
7649 - 'induct' method now derives symbolic cases from the *rulified*
7650 rule (before it used to rulify cases stemming from the internal
7651 atomized version); this means that the context of a non-atomic
7652 statement becomes is included in the hypothesis, avoiding the
7653 slightly cumbersome show "PROP ?case" form;
7654 - 'induct' may now use elim-style induction rules without chaining
7655 facts, using ``missing'' premises from the goal state; this allows
7656 rules stemming from inductive sets to be applied in unstructured
7657 scripts, while still benefitting from proper handling of non-atomic
7658 statements; NB: major inductive premises need to be put first, all
7659 the rest of the goal is passed through the induction;
7660 - 'induct' proper support for mutual induction involving non-atomic
7661 rule statements (uses the new concept of simultaneous goals, see
7663 - append all possible rule selections, but only use the first
7664 success (no backtracking);
7665 - removed obsolete "(simplified)" and "(stripped)" options of methods;
7666 - undeclared rule case names default to numbers 1, 2, 3, ...;
7667 - added 'print_induct_rules' (covered by help item in recent Proof
7669 - moved induct/cases attributes to Pure, methods to Provers;
7670 - generic method setup instantiated for FOL and HOL;
7672 * Pure: support multiple simultaneous goal statements, for example
7673 "have a: A and b: B" (same for 'theorem' etc.); being a pure
7674 meta-level mechanism, this acts as if several individual goals had
7675 been stated separately; in particular common proof methods need to be
7676 repeated in order to cover all claims; note that a single elimination
7677 step is *not* sufficient to establish the two conjunctions, so this
7680 assume "A & B" then have A and B .. (*".." fails*)
7682 better use "obtain" in situations as above; alternative refer to
7683 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
7685 * Pure: proper integration with ``locales''; unlike the original
7686 version by Florian Kammller, Isar locales package high-level proof
7687 contexts rather than raw logical ones (e.g. we admit to include
7688 attributes everywhere); operations on locales include merge and
7689 rename; support for implicit arguments (``structures''); simultaneous
7690 type-inference over imports and text; see also HOL/ex/Locales.thy for
7693 * Pure: the following commands have been ``localized'', supporting a
7694 target locale specification "(in name)": 'lemma', 'theorem',
7695 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
7696 stored both within the locale and at the theory level (exported and
7697 qualified by the locale name);
7699 * Pure: theory goals may now be specified in ``long'' form, with
7700 ad-hoc contexts consisting of arbitrary locale elements. for example
7701 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
7702 definitions may be given, too); the result is a meta-level rule with
7703 the context elements being discharged in the obvious way;
7705 * Pure: new proof command 'using' allows to augment currently used
7706 facts after a goal statement ('using' is syntactically analogous to
7707 'apply', but acts on the goal's facts only); this allows chained facts
7708 to be separated into parts given before and after a claim, as in
7709 ``from a and b have C using d and e <proof>'';
7711 * Pure: renamed "antecedent" case to "rule_context";
7713 * Pure: new 'judgment' command records explicit information about the
7714 object-logic embedding (used by several tools internally); no longer
7715 use hard-wired "Trueprop";
7717 * Pure: added 'corollary' command;
7719 * Pure: fixed 'token_translation' command;
7721 * Pure: removed obsolete 'exported' attribute;
7723 * Pure: dummy pattern "_" in is/let is now automatically lifted over
7724 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
7725 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
7727 * Pure: method 'atomize' presents local goal premises as object-level
7728 statements (atomic meta-level propositions); setup controlled via
7729 rewrite rules declarations of 'atomize' attribute; example
7730 application: 'induct' method with proper rule statements in improper
7733 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
7734 now consider the syntactic context of assumptions, giving a better
7735 chance to get type-inference of the arguments right (this is
7736 especially important for locales);
7738 * Pure: "sorry" no longer requires quick_and_dirty in interactive
7741 * Pure/obtain: the formal conclusion "thesis", being marked as
7742 ``internal'', may no longer be reference directly in the text;
7743 potential INCOMPATIBILITY, may need to use "?thesis" in rare
7746 * Pure: generic 'sym' attribute which declares a rule both as pure
7747 'elim?' and for the 'symmetric' operation;
7749 * Pure: marginal comments ``--'' may now occur just anywhere in the
7750 text; the fixed correlation with particular command syntax has been
7753 * Pure: new method 'rules' is particularly well-suited for proof
7754 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
7755 but often produces more compact proof terms with less detours;
7757 * Pure/Provers/classical: simplified integration with pure rule
7758 attributes and methods; the classical "intro?/elim?/dest?"
7759 declarations coincide with the pure ones; the "rule" method no longer
7760 includes classically swapped intros; "intro" and "elim" methods no
7761 longer pick rules from the context; also got rid of ML declarations
7762 AddXIs/AddXEs/AddXDs; all of this has some potential for
7765 * Provers/classical: attribute 'swapped' produces classical inversions
7766 of introduction rules;
7768 * Provers/simplifier: 'simplified' attribute may refer to explicit
7769 rules instead of full simplifier context; 'iff' attribute handles
7772 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
7774 * HOL: 'recdef' now fails on unfinished automated proofs, use
7775 "(permissive)" option to recover old behavior;
7777 * HOL: 'inductive' no longer features separate (collective) attributes
7778 for 'intros' (was found too confusing);
7780 * HOL: properly declared induction rules less_induct and
7786 * HOL: moved over to sane numeral syntax; the new policy is as
7789 - 0 and 1 are polymorphic constants, which are defined on any
7790 numeric type (nat, int, real etc.);
7792 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
7793 binary representation internally;
7795 - type nat has special constructor Suc, and generally prefers Suc 0
7796 over 1::nat and Suc (Suc 0) over 2::nat;
7798 This change may cause significant problems of INCOMPATIBILITY; here
7799 are some hints on converting existing sources:
7801 - due to the new "num" token, "-0" and "-1" etc. are now atomic
7802 entities, so expressions involving "-" (unary or binary minus) need
7803 to be spaced properly;
7805 - existing occurrences of "1" may need to be constraint "1::nat" or
7806 even replaced by Suc 0; similar for old "2";
7808 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
7810 - remove all special provisions on numerals in proofs;
7812 * HOL: simp rules nat_number expand numerals on nat to Suc/0
7813 representation (depends on bin_arith_simps in the default context);
7815 * HOL: symbolic syntax for x^2 (numeral 2);
7817 * HOL: the class of all HOL types is now called "type" rather than
7818 "term"; INCOMPATIBILITY, need to adapt references to this type class
7819 in axclass/classes, instance/arities, and (usually rare) occurrences
7820 in typings (of consts etc.); internally the class is called
7821 "HOL.type", ML programs should refer to HOLogic.typeS;
7823 * HOL/record package improvements:
7824 - new derived operations "fields" to build a partial record section,
7825 "extend" to promote a fixed record to a record scheme, and
7826 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
7827 declared as simp by default;
7828 - shared operations ("more", "fields", etc.) now need to be always
7829 qualified) --- potential INCOMPATIBILITY;
7830 - removed "make_scheme" operations (use "make" with "extend") --
7832 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
7833 - provides cases/induct rules for use with corresponding Isar
7834 methods (for concrete records, record schemes, concrete more
7835 parts, and schematic more parts -- in that order);
7836 - internal definitions directly based on a light-weight abstract
7837 theory of product types over typedef rather than datatype;
7839 * HOL: generic code generator for generating executable ML code from
7840 specifications; specific support for HOL constructs such as inductive
7841 datatypes and sets, as well as recursive functions; can be invoked
7842 via 'generate_code' theory section;
7844 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
7846 * HOL: consolidated and renamed several theories. In particular:
7847 Ord.thy has been absorbed into HOL.thy
7848 String.thy has been absorbed into List.thy
7850 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
7851 (beware of argument permutation!);
7853 * HOL: linorder_less_split superseded by linorder_cases;
7855 * HOL/List: "nodups" renamed to "distinct";
7857 * HOL: added "The" definite description operator; move Hilbert's "Eps"
7858 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
7859 - Ex_def has changed, now need to use some_eq_ex
7861 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
7862 in this (rare) case use:
7864 delSWrapper "split_all_tac"
7865 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
7867 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
7870 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
7871 Isabelle's type classes, ^ on functions and relations has too general
7872 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
7873 necessary to attach explicit type constraints;
7875 * HOL/Relation: the prefix name of the infix "O" has been changed from
7876 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
7877 renamed accordingly (eg "compI" -> "rel_compI").
7879 * HOL: syntax translations now work properly with numerals and records
7882 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
7883 of "lam" -- INCOMPATIBILITY;
7885 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
7886 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
7887 renamed "Product_Type.unit";
7889 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
7891 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
7892 the "cases" method);
7894 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
7897 * HOL/IMP: updated and converted to new-style theory format; several
7898 parts turned into readable document, with proper Isar proof texts and
7899 some explanations (by Gerwin Klein);
7901 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
7903 * HOL-Hyperreal is now a logic image;
7908 * Isar: consts/constdefs supports mixfix syntax for continuous
7911 * Isar: domain package adapted to new-style theory format, e.g. see
7914 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
7915 potential INCOMPATIBILITY; now use plain induct_tac instead of former
7916 lift.induct_tac, always use UU instead of Undef;
7918 * HOLCF/IMP: updated and converted to new-style theory;
7923 * Isar: proper integration of logic-specific tools and packages,
7924 including theory commands '(co)inductive', '(co)datatype',
7925 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
7926 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
7928 * theory Main no longer includes AC; for the Axiom of Choice, base
7929 your theory on Main_ZFC;
7931 * the integer library now covers quotients and remainders, with many
7932 laws relating division to addition, multiplication, etc.;
7934 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
7935 typeless version of the formalism;
7937 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
7940 * ZF/Induct: new directory for examples of inductive definitions,
7941 including theory Multiset for multiset orderings; converted to
7942 new-style theory format;
7944 * ZF: many new theorems about lists, ordinals, etc.;
7949 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
7950 variable proof controls level of detail: 0 = no proofs (only oracle
7951 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
7952 also ref manual for further ML interfaces;
7954 * Pure/axclass: removed obsolete ML interface
7955 goal_subclass/goal_arity;
7957 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
7958 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
7959 separate tokens, so expressions involving minus need to be spaced
7962 * Pure/syntax: support non-oriented infixes, using keyword "infix"
7963 rather than "infixl" or "infixr";
7965 * Pure/syntax: concrete syntax for dummy type variables admits genuine
7966 sort constraint specifications in type inference; e.g. "x::_::foo"
7967 ensures that the type of "x" is of sort "foo" (but not necessarily a
7970 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
7971 control output of nested => (types); the default behavior is
7974 * Pure/syntax: builtin parse translation for "_constify" turns valued
7975 tokens into AST constants;
7977 * Pure/syntax: prefer later declarations of translations and print
7978 translation functions; potential INCOMPATIBILITY: need to reverse
7979 multiple declarations for same syntax element constant;
7981 * Pure/show_hyps reset by default (in accordance to existing Isar
7984 * Provers/classical: renamed addaltern to addafter, addSaltern to
7987 * Provers/clasimp: ``iff'' declarations now handle conditional rules
7990 * system: tested support for MacOS X; should be able to get Isabelle +
7991 Proof General to work in a plain Terminal after installing Poly/ML
7992 (e.g. from the Isabelle distribution area) and GNU bash alone
7993 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
7994 support requires further installations, e.g. from
7995 http://fink.sourceforge.net/);
7997 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
7999 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
8000 of 40 MB), cf. ML_OPTIONS;
8002 * system: Proof General keywords specification is now part of the
8003 Isabelle distribution (see etc/isar-keywords.el);
8005 * system: support for persistent Proof General sessions (refrain from
8006 outdating all loaded theories on startup); user may create writable
8007 logic images like this: ``isabelle -q HOL Test'';
8009 * system: smart selection of Isabelle process versus Isabelle
8010 interface, accommodates case-insensitive file systems (e.g. HFS+); may
8011 run both "isabelle" and "Isabelle" even if file names are badly
8012 damaged (executable inspects the case of the first letter of its own
8013 name); added separate "isabelle-process" and "isabelle-interface";
8015 * system: refrain from any attempt at filtering input streams; no
8016 longer support ``8bit'' encoding of old isabelle font, instead proper
8017 iso-latin characters may now be used; the related isatools
8018 "symbolinput" and "nonascii" have disappeared as well;
8020 * system: removed old "xterm" interface (the print modes "xterm" and
8021 "xterm_color" are still available for direct use in a suitable
8026 New in Isabelle99-2 (February 2001)
8027 -----------------------------------
8029 *** Overview of INCOMPATIBILITIES ***
8031 * HOL: please note that theories in the Library and elsewhere often use the
8032 new-style (Isar) format; to refer to their theorems in an ML script you must
8033 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
8035 * HOL: inductive package no longer splits induction rule aggressively,
8036 but only as far as specified by the introductions given; the old
8037 format may be recovered via ML function complete_split_rule or attribute
8038 'split_rule (complete)';
8040 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
8041 gfp_Tarski to gfp_unfold;
8043 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
8045 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
8046 relation); infix "^^" has been renamed "``"; infix "``" has been
8047 renamed "`"; "univalent" has been renamed "single_valued";
8049 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
8052 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
8054 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
8056 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
8057 consequence, it is no longer monotonic wrt. the local goal context
8058 (which is now passed through the inductive cases);
8060 * Document preparation: renamed standard symbols \<ll> to \<lless> and
8061 \<gg> to \<ggreater>;
8064 *** Document preparation ***
8066 * \isabellestyle{NAME} selects version of Isabelle output (currently
8067 available: are "it" for near math-mode best-style output, "sl" for
8068 slanted text style, and "tt" for plain type-writer; if no
8069 \isabellestyle command is given, output is according to slanted
8072 * support sub/super scripts (for single symbols only), input syntax is
8073 like this: "A\<^sup>*" or "A\<^sup>\<star>";
8075 * some more standard symbols; see Appendix A of the system manual for
8076 the complete list of symbols defined in isabellesym.sty;
8078 * improved isabelle style files; more abstract symbol implementation
8079 (should now use \isamath{...} and \isatext{...} in custom symbol
8082 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
8083 state; Note that presentation of goal states does not conform to
8084 actual human-readable proof documents. Please do not include goal
8085 states into document output unless you really know what you are doing!
8087 * proper indentation of antiquoted output with proportional LaTeX
8090 * no_document ML operator temporarily disables LaTeX document
8093 * isatool unsymbolize tunes sources for plain ASCII communication;
8098 * Pure: Isar now suffers initial goal statements to contain unbound
8099 schematic variables (this does not conform to actual readable proof
8100 documents, due to unpredictable outcome and non-compositional proof
8101 checking); users who know what they are doing may use schematic goals
8102 for Prolog-style synthesis of proven results;
8104 * Pure: assumption method (an implicit finishing) now handles actual
8107 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
8108 initial goal, declare "that" only as Pure intro (only for single
8109 steps); the "that" rule assumption may now be involved in implicit
8110 finishing, thus ".." becomes a feasible for trivial obtains;
8112 * Pure: default proof step now includes 'intro_classes'; thus trivial
8113 instance proofs may be performed by "..";
8115 * Pure: ?thesis / ?this / "..." now work for pure meta-level
8118 * Pure: more robust selection of calculational rules;
8120 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
8121 rule (as well as the assumption rule);
8123 * Pure: 'thm_deps' command visualizes dependencies of theorems and
8124 lemmas, using the graph browser tool;
8126 * Pure: predict failure of "show" in interactive mode;
8128 * Pure: 'thms_containing' now takes actual terms as arguments;
8130 * HOL: improved method 'induct' --- now handles non-atomic goals
8131 (potential INCOMPATIBILITY); tuned error handling;
8133 * HOL: cases and induct rules now provide explicit hints about the
8134 number of facts to be consumed (0 for "type" and 1 for "set" rules);
8135 any remaining facts are inserted into the goal verbatim;
8137 * HOL: local contexts (aka cases) may now contain term bindings as
8138 well; the 'cases' and 'induct' methods new provide a ?case binding for
8139 the result to be shown in each case;
8141 * HOL: added 'recdef_tc' command;
8143 * isatool convert assists in eliminating legacy ML scripts;
8148 * HOL/Library: a collection of generic theories to be used together
8149 with main HOL; the theory loader path already includes this directory
8150 by default; the following existing theories have been moved here:
8151 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
8152 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
8154 * HOL/Unix: "Some aspects of Unix file-system security", a typical
8155 modelling and verification task performed in Isabelle/HOL +
8156 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
8158 * HOL/Algebra: special summation operator SUM no longer exists, it has
8159 been replaced by setsum; infix 'assoc' now has priority 50 (like
8160 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
8161 'domain', this makes the theory consistent with mathematical
8164 * HOL basics: added overloaded operations "inverse" and "divide"
8165 (infix "/"), syntax for generic "abs" operation, generic summation
8168 * HOL/typedef: simplified package, provide more useful rules (see also
8171 * HOL/datatype: induction rule for arbitrarily branching datatypes is
8172 now expressed as a proper nested rule (old-style tactic scripts may
8173 require atomize_strip_tac to cope with non-atomic premises);
8175 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
8176 to "split_conv" (old name still available for compatibility);
8178 * HOL: improved concrete syntax for strings (e.g. allows translation
8179 rules with string literals);
8181 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
8182 and Fleuriot's mechanization of analysis, including the transcendental
8183 functions for the reals;
8185 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
8190 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
8191 "lam" is displayed as TWO lambda-symbols
8193 * CTT: theory Main now available, containing everything (that is, Bool
8199 * Pure: the Simplifier has been implemented properly as a derived rule
8200 outside of the actual kernel (at last!); the overall performance
8201 penalty in practical applications is about 50%, while reliability of
8202 the Isabelle inference kernel has been greatly improved;
8204 * print modes "brackets" and "no_brackets" control output of nested =>
8205 (types) and ==> (props); the default behaviour is "brackets";
8207 * Provers: fast_tac (and friends) now handle actual object-logic rules
8208 as assumptions as well;
8210 * system: support Poly/ML 4.0;
8212 * system: isatool install handles KDE version 1 or 2;
8216 New in Isabelle99-1 (October 2000)
8217 ----------------------------------
8219 *** Overview of INCOMPATIBILITIES ***
8221 * HOL: simplification of natural numbers is much changed; to partly
8222 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
8223 issue the following ML commands:
8225 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
8226 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
8228 * HOL: simplification no longer dives into case-expressions; this is
8229 controlled by "t.weak_case_cong" for each datatype t;
8231 * HOL: nat_less_induct renamed to less_induct;
8233 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
8234 fixsome to patch .thy and .ML sources automatically;
8236 select_equality -> some_equality
8237 select_eq_Ex -> some_eq_ex
8238 selectI2EX -> someI2_ex
8241 select1_equality -> some1_equality
8242 Eps_sym_eq -> some_sym_eq_trivial
8243 Eps_eq -> some_eq_trivial
8245 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
8247 * HOL: removed obsolete theorem binding expand_if (refer to split_if
8250 * HOL: the recursion equations generated by 'recdef' are now called
8251 f.simps instead of f.rules;
8253 * HOL: qed_spec_mp now also handles bounded ALL as well;
8255 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
8256 sometimes be needed;
8258 * HOL: the constant for "f``x" is now "image" rather than "op ``";
8260 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
8262 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
8263 product is now "<*>" instead of "Times"; the lexicographic product is
8264 now "<*lex*>" instead of "**";
8266 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
8267 of main HOL, but was unused); better use HOL's datatype package;
8269 * HOL: removed "symbols" syntax for constant "override" of theory Map;
8270 the old syntax may be recovered as follows:
8273 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
8274 (infixl "\\<oplus>" 100)
8276 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8278 * HOL/ML: even fewer consts are declared as global (see theories Ord,
8279 Lfp, Gfp, WF); this only affects ML packages that refer to const names
8282 * HOL and ZF: syntax for quotienting wrt an equivalence relation
8283 changed from A/r to A//r;
8285 * ZF: new treatment of arithmetic (nat & int) may break some old
8288 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
8289 rulify -> rule_format, elimify -> elim_format, ...);
8291 * Isar/Provers: intro/elim/dest attributes changed; renamed
8292 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
8293 should have to change intro!! to intro? only); replaced "delrule" by
8296 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
8298 * Provers: strengthened force_tac by using new first_best_tac;
8300 * LaTeX document preparation: several changes of isabelle.sty (see
8304 *** Document preparation ***
8306 * formal comments (text blocks etc.) in new-style theories may now
8307 contain antiquotations of thm/prop/term/typ/text to be presented
8308 according to latex print mode; concrete syntax is like this:
8309 @{term[show_types] "f(x) = a + x"};
8311 * isatool mkdir provides easy setup of Isabelle session directories,
8312 including proper document sources;
8314 * generated LaTeX sources are now deleted after successful run
8315 (isatool document -c); may retain a copy somewhere else via -D option
8318 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
8319 style files, achieving self-contained LaTeX sources and simplifying
8322 * old-style theories now produce (crude) LaTeX output as well;
8324 * browser info session directories are now self-contained (may be put
8325 on WWW server seperately); improved graphs of nested sessions; removed
8326 graph for 'all sessions';
8328 * several improvements in isabelle style files; \isabellestyle{it}
8329 produces fake math mode output; \isamarkupheader is now \section by
8330 default; see lib/texinputs/isabelle.sty etc.;
8335 * Isar/Pure: local results and corresponding term bindings are now
8336 subject to Hindley-Milner polymorphism (similar to ML); this
8337 accommodates incremental type-inference very nicely;
8339 * Isar/Pure: new derived language element 'obtain' supports
8340 generalized existence reasoning;
8342 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
8343 support accumulation of results, without applying any rules yet;
8344 useful to collect intermediate results without explicit name
8345 references, and for use with transitivity rules with more than 2
8348 * Isar/Pure: scalable support for case-analysis type proofs: new
8349 'case' language element refers to local contexts symbolically, as
8350 produced by certain proof methods; internally, case names are attached
8351 to theorems as "tags";
8353 * Isar/Pure: theory command 'hide' removes declarations from
8354 class/type/const name spaces;
8356 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
8357 indicate potential overloading;
8359 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
8361 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
8362 "{a,b,c}" instead of {a,b,c};
8364 * Isar/Pure now provides its own version of intro/elim/dest
8365 attributes; useful for building new logics, but beware of confusion
8366 with the version in Provers/classical;
8368 * Isar/Pure: the local context of (non-atomic) goals is provided via
8369 case name 'antecedent';
8371 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
8372 to the current context is now done automatically);
8374 * Isar/Pure: theory command 'method_setup' provides a simple interface
8375 for definining proof methods in ML;
8377 * Isar/Provers: intro/elim/dest attributes changed; renamed
8378 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
8379 most cases, one should have to change intro!! to intro? only);
8380 replaced "delrule" by "rule del";
8382 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
8383 'symmetric' attribute (the latter supercedes [RS sym]);
8385 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
8386 method modifier); 'simp' method: 'only:' modifier removes loopers as
8387 well (including splits);
8389 * Isar/Provers: Simplifier and Classical methods now support all kind
8390 of modifiers used in the past, including 'cong', 'iff', etc.
8392 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
8393 of Simplifier and Classical reasoner);
8395 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
8396 now support named cases; major packages (inductive, datatype, primrec,
8397 recdef) support case names and properly name parameters;
8399 * Isar/HOL: new transitivity rules for substitution in inequalities --
8400 monotonicity conditions are extracted to be proven at end of
8403 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
8406 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
8407 split_if split_if_asm; datatype package provides theorems foo.splits =
8408 foo.split foo.split_asm for each datatype;
8410 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
8411 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
8412 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
8413 use "(cases (simplified))" method in proper proof texts);
8415 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
8417 * Isar: names of theorems etc. may be natural numbers as well;
8419 * Isar: 'pr' command: optional arguments for goals_limit and
8420 ProofContext.prems_limit; no longer prints theory contexts, but only
8423 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
8424 additional print modes to be specified; e.g. "pr(latex)" will print
8425 proof state according to the Isabelle LaTeX style;
8427 * Isar: improved support for emulating tactic scripts, including proof
8428 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
8429 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
8430 (for HOL datatypes);
8432 * Isar: simplified (more robust) goal selection of proof methods: 1st
8433 goal, all goals, or explicit goal specifier (tactic emulation); thus
8434 'proof method scripts' have to be in depth-first order;
8436 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
8438 * Isar: removed 'help' command, which hasn't been too helpful anyway;
8439 should instead use individual commands for printing items
8440 (print_commands, print_methods etc.);
8442 * Isar: added 'nothing' --- the empty list of theorems;
8447 * HOL/MicroJava: formalization of a fragment of Java, together with a
8448 corresponding virtual machine and a specification of its bytecode
8449 verifier and a lightweight bytecode verifier, including proofs of
8450 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
8451 Cornelia Pusch (see also the homepage of project Bali at
8452 http://isabelle.in.tum.de/Bali/);
8454 * HOL/Algebra: new theory of rings and univariate polynomials, by
8457 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
8458 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
8461 * HOL/Lattice: fundamental concepts of lattice theory and order
8462 structures, including duals, properties of bounds versus algebraic
8463 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
8464 Theorem for complete lattices etc.; may also serve as a demonstration
8465 for abstract algebraic reasoning using axiomatic type classes, and
8466 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
8468 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
8471 * HOL/IMPP: extension of IMP with local variables and mutually
8472 recursive procedures, by David von Oheimb;
8474 * HOL/Lambda: converted into new-style theory and document;
8476 * HOL/ex/Multiquote: example of multiple nested quotations and
8477 anti-quotations -- basically a generalized version of de-Bruijn
8478 representation; very useful in avoiding lifting of operations;
8480 * HOL/record: added general record equality rule to simpset; fixed
8481 select-update simplification procedure to handle extended records as
8482 well; admit "r" as field name;
8484 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
8485 other numeric types and also as the identity of groups, rings, etc.;
8487 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
8488 Types nat and int belong to this axclass;
8490 * HOL: greatly improved simplification involving numerals of type nat, int, real:
8491 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
8492 i*j + k + j*#3*i simplifies to #4*(i*j) + k
8493 two terms #m*u and #n*u are replaced by #(m+n)*u
8494 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
8495 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
8496 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
8498 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
8499 powerful prover for predicate logic but knows nothing of clasets; see
8500 ex/mesontest.ML and ex/mesontest2.ML for example applications;
8502 * HOL: new version of "case_tac" subsumes both boolean case split and
8503 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
8504 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
8506 * HOL: simplification no longer dives into case-expressions: only the
8507 selector expression is simplified, but not the remaining arms; to
8508 enable full simplification of case-expressions for datatype t, you may
8509 remove t.weak_case_cong from the simpset, either globally (Delcongs
8510 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
8512 * HOL/recdef: the recursion equations generated by 'recdef' for
8513 function 'f' are now called f.simps instead of f.rules; if all
8514 termination conditions are proved automatically, these simplification
8515 rules are added to the simpset, as in primrec; rules may be named
8516 individually as well, resulting in a separate list of theorems for
8519 * HOL/While is a new theory that provides a while-combinator. It
8520 permits the definition of tail-recursive functions without the
8521 provision of a termination measure. The latter is necessary once the
8522 invariant proof rule for while is applied.
8524 * HOL: new (overloaded) notation for the set of elements below/above
8525 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
8527 * HOL: theorems impI, allI, ballI bound as "strip";
8529 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
8530 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
8531 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
8533 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8535 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
8536 main HOL, but was unused);
8538 * HOL: fewer consts declared as global (e.g. have to refer to
8539 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
8541 * HOL: tuned AST representation of nested pairs, avoiding bogus output
8542 in case of overlap with user translations (e.g. judgements over
8543 tuples); (note that the underlying logical represenation is still
8549 * ZF: simplification automatically cancels common terms in arithmetic
8550 expressions over nat and int;
8552 * ZF: new treatment of nat to minimize type-checking: all operators
8553 coerce their operands to a natural number using the function natify,
8554 making the algebraic laws unconditional;
8556 * ZF: as above, for int: operators coerce their operands to an integer
8557 using the function intify;
8559 * ZF: the integer library now contains many of the usual laws for the
8560 orderings, including $<=, and monotonicity laws for $+ and $*;
8562 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
8565 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
8566 to the simplifier and classical reasoner simultaneously;
8571 * Provers: blast_tac now handles actual object-logic rules as
8572 assumptions; note that auto_tac uses blast_tac internally as well;
8574 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
8575 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
8577 * Provers: delrules now handles destruct rules as well (no longer need
8578 explicit make_elim);
8580 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
8581 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8582 use instead the strong form,
8583 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8584 in HOL, FOL and ZF the function cla_make_elim will create such rules
8585 from destruct-rules;
8587 * Provers: Simplifier.easy_setup provides a fast path to basic
8588 Simplifier setup for new object-logics;
8590 * Pure: AST translation rules no longer require constant head on LHS;
8592 * Pure: improved name spaces: ambiguous output is qualified; support
8593 for hiding of names;
8595 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
8596 XSYMBOL_HOME; no longer need to do manual configuration in most
8599 * system: compression of ML heaps images may now be controlled via -c
8600 option of isabelle and isatool usedir (currently only observed by
8603 * system: isatool installfonts may handle X-Symbol fonts as well (very
8604 useful for remote X11);
8606 * system: provide TAGS file for Isabelle sources;
8608 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
8611 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
8612 timing flag supersedes proof_timing and Toplevel.trace;
8614 * ML: new combinators |>> and |>>> for incremental transformations
8615 with secondary results (e.g. certain theory extensions):
8617 * ML: PureThy.add_defs gets additional argument to indicate potential
8618 overloading (usually false);
8620 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
8625 New in Isabelle99 (October 1999)
8626 --------------------------------
8628 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8630 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
8631 are no longer simplified. (This allows the simplifier to unfold recursive
8632 functional programs.) To restore the old behaviour, declare
8634 Delcongs [if_weak_cong];
8636 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
8639 * HOL: the predicate "inj" is now defined by translation to "inj_on";
8641 * HOL/datatype: mutual_induct_tac no longer exists --
8642 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
8644 * HOL/typedef: fixed type inference for representing set; type
8645 arguments now have to occur explicitly on the rhs as type constraints;
8647 * ZF: The con_defs part of an inductive definition may no longer refer
8648 to constants declared in the same theory;
8650 * HOL, ZF: the function mk_cases, generated by the inductive
8651 definition package, has lost an argument. To simplify its result, it
8652 uses the default simpset instead of a supplied list of theorems.
8654 * HOL/List: the constructors of type list are now Nil and Cons;
8656 * Simplifier: the type of the infix ML functions
8657 setSSolver addSSolver setSolver addSolver
8658 is now simpset * solver -> simpset where `solver' is a new abstract type
8659 for packaging solvers. A solver is created via
8660 mk_solver: string -> (thm list -> int -> tactic) -> solver
8661 where the string argument is only a comment.
8666 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
8667 decision procedure for linear arithmetic. Currently it is used for
8668 types `nat', `int', and `real' in HOL (see below); it can, should and
8669 will be instantiated for other types and logics as well.
8671 * The simplifier now accepts rewrite rules with flexible heads, eg
8672 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
8673 They are applied like any rule with a non-pattern lhs, i.e. by first-order
8679 * New Isabelle/Isar subsystem provides an alternative to traditional
8680 tactical theorem proving; together with the ProofGeneral/isar user
8681 interface it offers an interactive environment for developing human
8682 readable proof documents (Isar == Intelligible semi-automated
8683 reasoning); for further information see isatool doc isar-ref,
8684 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
8686 * improved and simplified presentation of theories: better HTML markup
8687 (including colors), graph views in several sizes; isatool usedir now
8688 provides a proper interface for user theories (via -P option); actual
8689 document preparation based on (PDF)LaTeX is available as well (for
8690 new-style theories only); see isatool doc system for more information;
8692 * native support for Proof General, both for classic Isabelle and
8695 * ML function thm_deps visualizes dependencies of theorems and lemmas,
8696 using the graph browser tool;
8698 * Isabelle manuals now also available as PDF;
8700 * theory loader rewritten from scratch (may not be fully
8701 bug-compatible); old loadpath variable has been replaced by show_path,
8702 add_path, del_path, reset_path functions; new operations such as
8703 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
8706 * improved isatool install: option -k creates KDE application icon,
8707 option -p DIR installs standalone binaries;
8709 * added ML_PLATFORM setting (useful for cross-platform installations);
8710 more robust handling of platform specific ML images for SML/NJ;
8712 * the settings environment is now statically scoped, i.e. it is never
8713 created again in sub-processes invoked from isabelle, isatool, or
8716 * path element specification '~~' refers to '$ISABELLE_HOME';
8718 * in locales, the "assumes" and "defines" parts may be omitted if
8721 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
8724 * new print_mode "HTML";
8726 * new flag show_tags controls display of tags of theorems (which are
8727 basically just comments that may be attached by some tools);
8729 * Isamode 2.6 requires patch to accomodate change of Isabelle font
8730 mode and goal output format:
8732 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
8734 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
8736 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
8737 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
8739 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
8741 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
8743 * function bind_thms stores lists of theorems (cf. bind_thm);
8745 * new shorthand tactics ftac, eatac, datac, fatac;
8747 * qed (and friends) now accept "" as result name; in that case the
8748 theorem is not stored, but proper checks and presentation of the
8751 * theorem database now also indexes constants "Trueprop", "all",
8752 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
8757 ** HOL arithmetic **
8759 * There are now decision procedures for linear arithmetic over nat and
8762 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
8763 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
8764 are treated as atomic; subformulae not involving type `nat' or `int'
8765 are ignored; quantified subformulae are ignored unless they are
8766 positive universal or negative existential. The tactic has to be
8767 invoked by hand and can be a little bit slow. In particular, the
8768 running time is exponential in the number of occurrences of `min' and
8769 `max', and `-' on `nat'.
8771 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
8772 (negated) (in)equalities among the premises and the conclusion into
8773 account (i.e. no compound formulae) and does not know about `min' and
8774 `max', and `-' on `nat'. It is fast and is used automatically by the
8777 NB: At the moment, these decision procedures do not cope with mixed
8778 nat/int formulae where the two parts interact, such as `m < n ==>
8781 * HOL/Numeral provides a generic theory of numerals (encoded
8782 efficiently as bit strings); setup for types nat/int/real is in place;
8783 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
8784 int, existing theories and proof scripts may require a few additional
8787 * integer division and remainder can now be performed on constant
8790 * many properties of integer multiplication, division and remainder
8793 * An interface to the Stanford Validity Checker (SVC) is available through the
8794 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
8795 are proved automatically. SVC must be installed separately, and its results
8796 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
8797 invocation of the underlying oracle). For SVC see
8798 http://verify.stanford.edu/SVC
8800 * IsaMakefile: the HOL-Real target now builds an actual image;
8805 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
8806 (in Isabelle/Isar) -- by Gertrud Bauer;
8808 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
8809 analysis for assembly languages with subtypes;
8811 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
8812 -- avoids syntactic ambiguities and treats state, transition, and
8813 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
8814 changed syntax and (many) tactics;
8816 * HOL/inductive: Now also handles more general introduction rules such
8817 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
8818 theorems are now maintained within the theory (maintained via the
8821 * HOL/datatype: Now also handles arbitrarily branching datatypes
8822 (using function types) such as
8824 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
8826 * HOL/record: record_simproc (part of the default simpset) takes care
8827 of selectors applied to updated records; record_split_tac is no longer
8828 part of the default claset; update_defs may now be removed from the
8829 simpset in many cases; COMPATIBILITY: old behavior achieved by
8831 claset_ref () := claset() addSWrapper record_split_wrapper;
8832 Delsimprocs [record_simproc]
8834 * HOL/typedef: fixed type inference for representing set; type
8835 arguments now have to occur explicitly on the rhs as type constraints;
8837 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
8838 names rather than an ML expression;
8840 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
8841 supplied later. Program schemes can be defined, such as
8842 "While B C s = (if B s then While B C (C s) else s)"
8843 where the well-founded relation can be chosen after B and C have been given.
8845 * HOL/List: the constructors of type list are now Nil and Cons;
8846 INCOMPATIBILITY: while [] and infix # syntax is still there, of
8847 course, ML tools referring to List.list.op # etc. have to be adapted;
8849 * HOL_quantifiers flag superseded by "HOL" print mode, which is
8850 disabled by default; run isabelle with option -m HOL to get back to
8851 the original Gordon/HOL-style output;
8853 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
8854 ALL x<=y. P, EX x<y. P, EX x<=y. P;
8856 * HOL basic syntax simplified (more orthogonal): all variants of
8857 All/Ex now support plain / symbolic / HOL notation; plain syntax for
8858 Eps operator is provided as well: "SOME x. P[x]";
8860 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
8862 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
8863 thus available for user theories;
8865 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
8866 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
8869 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
8870 several times and then mp;
8875 * the notation <<...>> is now available as a notation for sequences of
8878 * the simplifier is now installed
8880 * the axiom system has been generalized (thanks to Soren Heilmann)
8882 * the classical reasoner now has a default rule database
8887 * new primrec section allows primitive recursive functions to be given
8888 directly (as in HOL) over datatypes and the natural numbers;
8890 * new tactics induct_tac and exhaust_tac for induction (or case
8891 analysis) over datatypes and the natural numbers;
8893 * the datatype declaration of type T now defines the recursor T_rec;
8895 * simplification automatically does freeness reasoning for datatype
8898 * automatic type-inference, with AddTCs command to insert new
8899 type-checking rules;
8901 * datatype introduction rules are now added as Safe Introduction rules
8904 * the syntax "if P then x else y" is now available in addition to
8908 *** Internal programming interfaces ***
8910 * tuned simplifier trace output; new flag debug_simp;
8912 * structures Vartab / Termtab (instances of TableFun) offer efficient
8913 tables indexed by indexname_ord / term_ord (compatible with aconv);
8915 * AxClass.axclass_tac lost the theory argument;
8917 * tuned current_goals_markers semantics: begin / end goal avoids
8918 printing empty lines;
8920 * removed prs and prs_fn hook, which was broken because it did not
8921 include \n in its semantics, forcing writeln to add one
8922 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
8923 string -> unit if you really want to output text without newline;
8925 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
8926 plain output, interface builders may have to enable 'isabelle_font'
8927 mode to get Isabelle font glyphs as before;
8929 * refined token_translation interface; INCOMPATIBILITY: output length
8930 now of type real instead of int;
8932 * theory loader actions may be traced via new ThyInfo.add_hook
8933 interface (see src/Pure/Thy/thy_info.ML); example application: keep
8934 your own database of information attached to *whole* theories -- as
8935 opposed to intra-theory data slots offered via TheoryDataFun;
8937 * proper handling of dangling sort hypotheses (at last!);
8938 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
8939 extra sort hypotheses that can be witnessed from the type signature;
8940 the force_strip_shyps flag is gone, any remaining shyps are simply
8941 left in the theorem (with a warning issued by strip_shyps_warning);
8945 New in Isabelle98-1 (October 1998)
8946 ----------------------------------
8948 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8950 * several changes of automated proof tools;
8952 * HOL: major changes to the inductive and datatype packages, including
8953 some minor incompatibilities of theory syntax;
8955 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
8958 * HOL: removed duplicate thms in Arith:
8959 less_imp_add_less should be replaced by trans_less_add1
8960 le_imp_add_le should be replaced by trans_le_add1
8962 * HOL: unary minus is now overloaded (new type constraints may be
8965 * HOL and ZF: unary minus for integers is now #- instead of #~. In
8966 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
8967 now taken as an integer constant.
8969 * Pure: ML function 'theory_of' renamed to 'theory';
8975 1. Asm_full_simp_tac is now more aggressive.
8976 1. It will sometimes reorient premises if that increases their power to
8978 2. It does no longer proceed strictly from left to right but may also
8979 rotate premises to achieve further simplification.
8980 For compatibility reasons there is now Asm_lr_simp_tac which is like the
8981 old Asm_full_simp_tac in that it does not rotate premises.
8982 2. The simplifier now knows a little bit about nat-arithmetic.
8984 * Classical reasoner: wrapper mechanism for the classical reasoner now
8985 allows for selected deletion of wrappers, by introduction of names for
8986 wrapper functionals. This implies that addbefore, addSbefore,
8987 addaltern, and addSaltern now take a pair (name, tactic) as argument,
8988 and that adding two tactics with the same name overwrites the first
8989 one (emitting a warning).
8990 type wrapper = (int -> tactic) -> (int -> tactic)
8991 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
8992 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
8993 delWrapper, delSWrapper: claset * string -> claset
8994 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
8996 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
8997 semantics; addbefore now affects only the unsafe part of step_tac
8998 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
8999 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
9002 * Classical reasoner: setwrapper to setWrapper and compwrapper to
9003 compWrapper; added safe wrapper (and access functions for it);
9005 * HOL/split_all_tac is now much faster and fails if there is nothing
9006 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
9007 and the names of the automatically generated variables have changed.
9008 split_all_tac has moved within claset() from unsafe wrappers to safe
9009 wrappers, which means that !!-bound variables are split much more
9010 aggressively, and safe_tac and clarify_tac now split such variables.
9011 If this splitting is not appropriate, use delSWrapper "split_all_tac".
9012 Note: the same holds for record_split_tac, which does the job of
9013 split_all_tac for record fields.
9015 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
9016 permanently to the default simpset using Addsplits just like
9017 Addsimps. They can be removed via Delsplits just like
9018 Delsimps. Lower-case versions are also available.
9020 * HOL/Simplifier: The rule split_if is now part of the default
9021 simpset. This means that the simplifier will eliminate all occurrences
9022 of if-then-else in the conclusion of a goal. To prevent this, you can
9023 either remove split_if completely from the default simpset by
9024 `Delsplits [split_if]' or remove it in a specific call of the
9025 simplifier using `... delsplits [split_if]'. You can also add/delete
9026 other case splitting rules to/from the default simpset: every datatype
9027 generates suitable rules `split_t_case' and `split_t_case_asm' (where
9028 t is the name of the datatype).
9030 * Classical reasoner / Simplifier combination: new force_tac (and
9031 derivatives Force_tac, force) combines rewriting and classical
9032 reasoning (and whatever other tools) similarly to auto_tac, but is
9033 aimed to solve the given subgoal completely.
9038 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
9039 and `goalw': the theory is no longer needed as an explicit argument -
9040 the current theory context is used; assumptions are no longer returned
9041 at the ML-level unless one of them starts with ==> or !!; it is
9042 recommended to convert to these new commands using isatool fixgoal
9043 (backup your sources first!);
9045 * new top-level commands 'thm' and 'thms' for retrieving theorems from
9046 the current theory context, and 'theory' to lookup stored theories;
9048 * new theory section 'locale' for declaring constants, assumptions and
9049 definitions that have local scope;
9051 * new theory section 'nonterminals' for purely syntactic types;
9053 * new theory section 'setup' for generic ML setup functions
9054 (e.g. package initialization);
9056 * the distribution now includes Isabelle icons: see
9057 lib/logo/isabelle-{small,tiny}.xpm;
9059 * isatool install - install binaries with absolute references to
9062 * isatool logo -- create instances of the Isabelle logo (as EPS);
9064 * print mode 'emacs' reserved for Isamode;
9066 * support multiple print (ast) translations per constant name;
9068 * theorems involving oracles are now printed with a suffixed [!];
9073 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
9075 * HOL/inductive package reorganized and improved: now supports mutual
9081 oddI "n : EVEN ==> Suc n : ODD"
9082 evenI "n : ODD ==> Suc n : EVEN"
9084 new theorem list "elims" contains an elimination rule for each of the
9085 recursive sets; inductive definitions now handle disjunctive premises
9086 correctly (also ZF);
9088 INCOMPATIBILITIES: requires Inductive as an ancestor; component
9089 "mutual_induct" no longer exists - the induction rule is always
9090 contained in "induct";
9093 * HOL/datatype package re-implemented and greatly improved: now
9094 supports mutually recursive datatypes such as
9097 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
9098 | SUM ('a aexp) ('a aexp)
9099 | DIFF ('a aexp) ('a aexp)
9102 'a bexp = LESS ('a aexp) ('a aexp)
9103 | AND ('a bexp) ('a bexp)
9104 | OR ('a bexp) ('a bexp)
9106 as well as indirectly recursive datatypes such as
9109 ('a, 'b) term = Var 'a
9110 | App 'b ((('a, 'b) term) list)
9112 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
9113 induction on mutually / indirectly recursive datatypes.
9115 Primrec equations are now stored in theory and can be accessed via
9116 <function_name>.simps.
9120 - Theories using datatypes must now have theory Datatype as an
9122 - The specific <typename>.induct_tac no longer exists - use the
9123 generic induct_tac instead.
9124 - natE has been renamed to nat.exhaust - use exhaust_tac
9125 instead of res_inst_tac ... natE. Note that the variable
9126 names in nat.exhaust differ from the names in natE, this
9127 may cause some "fragile" proofs to fail.
9128 - The theorems split_<typename>_case and split_<typename>_case_asm
9129 have been renamed to <typename>.split and <typename>.split_asm.
9130 - Since default sorts of type variables are now handled correctly,
9131 some datatype definitions may have to be annotated with explicit
9133 - Primrec definitions no longer require function name and type
9134 of recursive argument.
9136 Consider using isatool fixdatatype to adapt your theories and proof
9137 scripts to the new package (backup your sources first!).
9140 * HOL/record package: considerably improved implementation; now
9141 includes concrete syntax for record types, terms, updates; theorems
9142 for surjective pairing and splitting !!-bound record variables; proof
9143 support is as follows:
9145 1) standard conversions (selectors or updates applied to record
9146 constructor terms) are part of the standard simpset;
9148 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
9149 made part of standard simpset and claset via addIffs;
9151 3) a tactic for record field splitting (record_split_tac) is part of
9152 the standard claset (addSWrapper);
9154 To get a better idea about these rules you may retrieve them via
9155 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
9156 the name of your record type.
9158 The split tactic 3) conceptually simplifies by the following rule:
9160 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
9162 Thus any record variable that is bound by meta-all will automatically
9163 blow up into some record constructor term, consequently the
9164 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
9165 solve record problems automatically.
9168 * reorganized the main HOL image: HOL/Integ and String loaded by
9169 default; theory Main includes everything;
9171 * automatic simplification of integer sums and comparisons, using cancellation;
9173 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
9175 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
9177 * many new identities for unions, intersections, set difference, etc.;
9179 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
9180 called split_if, split_split, split_sum_case and split_nat_case (to go
9181 with add/delsplits);
9183 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
9184 (?x::unit) = (); this is made part of the default simpset, which COULD
9185 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
9186 'Delsimprocs [unit_eq_proc];' as last resort); also note that
9187 unit_abs_eta_conv is added in order to counter the effect of
9188 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
9191 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
9194 * HOL/Set 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 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
9199 to 'converse' from 'inverse' (for compatibility with ZF and some
9202 * HOL/recdef can now declare non-recursive functions, with {} supplied as
9203 the well-founded relation;
9205 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
9206 Compl A. The "Compl" syntax remains available as input syntax for this
9209 * HOL/Update: new theory of function updates:
9210 f(a:=b) == %x. if x=a then b else f x
9211 may also be iterated as in f(a:=b,c:=d,...);
9213 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
9216 - new function list_update written xs[i:=v] that updates the i-th
9217 list position. May also be iterated as in xs[i:=a,j:=b,...].
9218 - new function `upt' written [i..j(] which generates the list
9219 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
9220 bound write [i..j], which is a shorthand for [i..j+1(].
9221 - new lexicographic orderings and corresponding wellfoundedness theorems.
9224 - removed 'pred' (predecessor) function;
9225 - generalized some theorems about n-1;
9226 - many new laws about "div" and "mod";
9227 - new laws about greatest common divisors (see theory ex/Primes);
9229 * HOL/Relation: renamed the relational operator r^-1 "converse"
9230 instead of "inverse";
9232 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
9233 of the multiset ordering;
9235 * directory HOL/Real: a construction of the reals using Dedekind cuts
9236 (not included by default);
9238 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
9240 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
9241 programs, i.e. different program variables may have different types.
9243 * calling (stac rew i) now fails if "rew" has no effect on the goal
9244 [previously, this check worked only if the rewrite rule was unconditional]
9245 Now rew can involve either definitions or equalities (either == or =).
9250 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
9251 only the theorems proved on ZF.ML;
9253 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9254 It and 'sym RS equals0D' are now in the default claset, giving automatic
9255 disjointness reasoning but breaking a few old proofs.
9257 * ZF/Update: new theory of function updates
9258 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
9259 may also be iterated as in f(a:=b,c:=d,...);
9261 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
9263 * calling (stac rew i) now fails if "rew" has no effect on the goal
9264 [previously, this check worked only if the rewrite rule was unconditional]
9265 Now rew can involve either definitions or equalities (either == or =).
9267 * case_tac provided for compatibility with HOL
9268 (like the old excluded_middle_tac, but with subgoals swapped)
9271 *** Internal programming interfaces ***
9273 * Pure: several new basic modules made available for general use, see
9274 also src/Pure/README;
9276 * improved the theory data mechanism to support encapsulation (data
9277 kind name replaced by private Object.kind, acting as authorization
9278 key); new type-safe user interface via functor TheoryDataFun; generic
9279 print_data function becomes basically useless;
9281 * removed global_names compatibility flag -- all theory declarations
9282 are qualified by default;
9284 * module Pure/Syntax now offers quote / antiquote translation
9285 functions (useful for Hoare logic etc. with implicit dependencies);
9286 see HOL/ex/Antiquote for an example use;
9288 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
9291 * new tactical CHANGED_GOAL for checking that a tactic modifies a
9294 * Display.print_goals function moved to Locale.print_goals;
9296 * standard print function for goals supports current_goals_markers
9297 variable for marking begin of proof, end of proof, start of goal; the
9298 default is ("", "", ""); setting current_goals_markers := ("<proof>",
9299 "</proof>", "<goal>") causes SGML like tagged proof state printing,
9304 New in Isabelle98 (January 1998)
9305 --------------------------------
9307 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9309 * changed lexical syntax of terms / types: dots made part of long
9310 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
9312 * simpset (and claset) reference variable replaced by functions
9313 simpset / simpset_ref;
9315 * no longer supports theory aliases (via merge) and non-trivial
9316 implicit merge of thms' signatures;
9318 * most internal names of constants changed due to qualified names;
9320 * changed Pure/Sequence interface (see Pure/seq.ML);
9323 *** General Changes ***
9325 * hierachically structured name spaces (for consts, types, axms, thms
9326 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
9327 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
9328 isatool fixdots ensures space after dots (e.g. "%x. x"); set
9329 long_names for fully qualified output names; NOTE: ML programs
9330 (special tactics, packages etc.) referring to internal names may have
9331 to be adapted to cope with fully qualified names; in case of severe
9332 backward campatibility problems try setting 'global_names' at compile
9333 time to have enrything declared within a flat name space; one may also
9334 fine tune name declarations in theories via the 'global' and 'local'
9337 * reimplemented the implicit simpset and claset using the new anytype
9338 data filed in signatures; references simpset:simpset ref etc. are
9339 replaced by functions simpset:unit->simpset and
9340 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
9341 to patch your ML files accordingly;
9343 * HTML output now includes theory graph data for display with Java
9344 applet or isatool browser; data generated automatically via isatool
9345 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
9347 * defs may now be conditional; improved rewrite_goals_tac to handle
9348 conditional equations;
9350 * defs now admits additional type arguments, using TYPE('a) syntax;
9352 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
9353 creates a new theory node; implicit merge of thms' signatures is
9354 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
9355 transfer:theory->thm->thm in (rare) cases;
9357 * improved handling of draft signatures / theories; draft thms (and
9358 ctyps, cterms) are automatically promoted to real ones;
9360 * slightly changed interfaces for oracles: admit many per theory, named
9361 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
9363 * print_goals: optional output of const types (set show_consts and
9366 * improved output of warnings (###) and errors (***);
9368 * subgoal_tac displays a warning if the new subgoal has type variables;
9370 * removed old README and Makefiles;
9372 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
9374 * removed obsolete init_pps and init_database;
9376 * deleted the obsolete tactical STATE, which was declared by
9377 fun STATE tacfun st = tacfun st st;
9379 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
9380 (which abbreviates $HOME);
9382 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
9383 use isatool fixseq to adapt your ML programs (this works for fully
9384 qualified references to the Sequence structure only!);
9386 * use_thy no longer requires writable current directory; it always
9387 reloads .ML *and* .thy file, if either one is out of date;
9390 *** Classical Reasoner ***
9392 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
9393 tactics that use classical reasoning to simplify a subgoal without
9394 splitting it into several subgoals;
9396 * Safe_tac: like safe_tac but uses the default claset;
9401 * added simplification meta rules:
9402 (asm_)(full_)simplify: simpset -> thm -> thm;
9404 * simplifier.ML no longer part of Pure -- has to be loaded by object
9407 * added prems argument to simplification procedures;
9409 * HOL, FOL, ZF: added infix function `addsplits':
9410 instead of `<simpset> setloop (split_tac <thms>)'
9411 you can simply write `<simpset> addsplits <thms>'
9416 * TYPE('a) syntax for type reflection terms;
9418 * no longer handles consts with name "" -- declare as 'syntax' instead;
9420 * pretty printer: changed order of mixfix annotation preference (again!);
9422 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
9427 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
9428 with `addloop' of the simplifier to faciliate case splitting in premises.
9430 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
9432 * HOL/Auth: new protocol proofs including some for the Internet
9435 * HOL/Map: new theory of `maps' a la VDM;
9437 * HOL/simplifier: simplification procedures nat_cancel_sums for
9438 cancelling out common nat summands from =, <, <= (in)equalities, or
9439 differences; simplification procedures nat_cancel_factor for
9440 cancelling common factor from =, <, <= (in)equalities over natural
9441 sums; nat_cancel contains both kinds of procedures, it is installed by
9442 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
9444 * HOL/simplifier: terms of the form
9445 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
9447 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
9448 and those of the form
9449 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
9451 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
9454 Each datatype `t' now comes with a theorem `split_t_case' of the form
9456 P(t_case f1 ... fn x) =
9457 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
9459 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
9462 and a theorem `split_t_case_asm' of the form
9464 P(t_case f1 ... fn x) =
9465 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
9467 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
9469 which can be added to a simpset via `addsplits'. The existing theorems
9470 expand_list_case and expand_option_case have been renamed to
9471 split_list_case and split_option_case.
9474 - `pred n' is automatically converted to `n-1'.
9475 Users are strongly encouraged not to use `pred' any longer,
9476 because it will disappear altogether at some point.
9477 - Users are strongly encouraged to write "0 < n" rather than
9478 "n ~= 0". Theorems and proof tools have been modified towards this
9482 the function "set_of_list" has been renamed "set" (and its theorems too);
9483 the function "nth" now takes its arguments in the reverse order and
9484 has acquired the infix notation "!" as in "xs!n".
9486 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
9488 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
9489 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
9491 * HOL/record: extensible records with schematic structural subtyping
9492 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
9493 still lacks various theorems and concrete record syntax;
9498 * removed "axioms" and "generated by" sections;
9500 * replaced "ops" section by extended "consts" section, which is capable of
9501 handling the continuous function space "->" directly;
9504 . proves theorems immediately and stores them in the theory,
9505 . creates hierachical name space,
9506 . now uses normal mixfix annotations (instead of cinfix...),
9507 . minor changes to some names and values (for consistency),
9508 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
9509 . separator between mutual domain defs: changed "," to "and",
9510 . improved handling of sort constraints; now they have to
9511 appear on the left-hand side of the equations only;
9513 * fixed LAM <x,y,zs>.b syntax;
9515 * added extended adm_tac to simplifier in HOLCF -- can now discharge
9516 adm (%x. P (t x)), where P is chainfinite and t continuous;
9521 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
9522 with `addloop' of the simplifier to faciliate case splitting in premises.
9524 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
9525 in HOL, they strip ALL and --> from proved theorems;
9529 New in Isabelle94-8 (May 1997)
9530 ------------------------------
9532 *** General Changes ***
9534 * new utilities to build / run / maintain Isabelle etc. (in parts
9535 still somewhat experimental); old Makefiles etc. still functional;
9537 * new 'Isabelle System Manual';
9539 * INSTALL text, together with ./configure and ./build scripts;
9541 * reimplemented type inference for greater efficiency, better error
9542 messages and clean internal interface;
9544 * prlim command for dealing with lots of subgoals (an easier way of
9545 setting goals_limit);
9550 * supports alternative (named) syntax tables (parser and pretty
9551 printer); internal interface is provided by add_modesyntax(_i);
9553 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
9554 be used in conjunction with the Isabelle symbol font; uses the
9555 "symbols" syntax table;
9557 * added token_translation interface (may translate name tokens in
9558 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
9559 the current print_mode); IMPORTANT: user print translation functions
9560 are responsible for marking newly introduced bounds
9561 (Syntax.mark_boundT);
9563 * token translations for modes "xterm" and "xterm_color" that display
9564 names in bold, underline etc. or colors (which requires a color
9567 * infixes may now be declared with names independent of their syntax;
9569 * added typed_print_translation (like print_translation, but may
9570 access type of constant);
9573 *** Classical Reasoner ***
9575 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
9576 some limitations. Blast_tac...
9577 + ignores addss, addbefore, addafter; this restriction is intrinsic
9578 + ignores elimination rules that don't have the correct format
9579 (the conclusion MUST be a formula variable)
9580 + ignores types, which can make HOL proofs fail
9581 + rules must not require higher-order unification, e.g. apply_type in ZF
9582 [message "Function Var's argument not a bound variable" relates to this]
9583 + its proof strategy is more general but can actually be slower
9585 * substitution with equality assumptions no longer permutes other
9588 * minor changes in semantics of addafter (now called addaltern); renamed
9589 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
9590 (and access functions for it);
9592 * improved combination of classical reasoner and simplifier:
9593 + functions for handling clasimpsets
9594 + improvement of addss: now the simplifier is called _after_ the
9596 + safe variant of addss called addSss: uses safe simplifications
9597 _during_ the safe steps. It is more complete as it allows multiple
9598 instantiations of unknowns (e.g. with slow_tac).
9602 * added interface for simplification procedures (functions that
9603 produce *proven* rewrite rules on the fly, depending on current
9606 * ordering on terms as parameter (used for ordered rewriting);
9608 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
9610 * the solver is now split into a safe and an unsafe part.
9611 This should be invisible for the normal user, except that the
9612 functions setsolver and addsolver have been renamed to setSolver and
9613 addSolver; added safe_asm_full_simp_tac;
9618 * a generic induction tactic `induct_tac' which works for all datatypes and
9619 also for type `nat';
9621 * a generic case distinction tactic `exhaust_tac' which works for all
9622 datatypes and also for type `nat';
9624 * each datatype comes with a function `size';
9626 * patterns in case expressions allow tuple patterns as arguments to
9627 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
9629 * primrec now also works with type nat;
9631 * recdef: a new declaration form, allows general recursive functions to be
9632 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
9634 * the constant for negation has been renamed from "not" to "Not" to
9635 harmonize with FOL, ZF, LK, etc.;
9637 * HOL/ex/LFilter theory of a corecursive "filter" functional for
9640 * HOL/Modelcheck demonstrates invocation of model checker oracle;
9642 * HOL/ex/Ring.thy declares cring_simp, which solves equational
9643 problems in commutative rings, using axiomatic type classes for + and *;
9645 * more examples in HOL/MiniML and HOL/Auth;
9647 * more default rewrite rules for quantifiers, union/intersection;
9649 * a new constant `arbitrary == @x.False';
9651 * HOLCF/IOA replaces old HOL/IOA;
9653 * HOLCF changes: derived all rules and arities
9654 + axiomatic type classes instead of classes
9655 + typedef instead of faking type definitions
9656 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
9657 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
9658 + eliminated the types void, one, tr
9659 + use unit lift and bool lift (with translations) instead of one and tr
9660 + eliminated blift from Lift3.thy (use Def instead of blift)
9661 all eliminated rules are derived as theorems --> no visible changes ;
9666 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
9667 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
9668 as ZF_cs addSIs [equalityI];
9672 New in Isabelle94-7 (November 96)
9673 ---------------------------------
9675 * allowing negative levels (as offsets) in prlev and choplev;
9677 * super-linear speedup for large simplifications;
9679 * FOL, ZF and HOL now use miniscoping: rewriting pushes
9680 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
9681 FAIL); can suppress it using the command Delsimps (ex_simps @
9682 all_simps); De Morgan laws are also now included, by default;
9684 * improved printing of ==> : ~:
9686 * new object-logic "Sequents" adds linear logic, while replacing LK
9687 and Modal (thanks to Sara Kalvala);
9689 * HOL/Auth: correctness proofs for authentication protocols;
9691 * HOL: new auto_tac combines rewriting and classical reasoning (many
9692 examples on HOL/Auth);
9694 * HOL: new command AddIffs for declaring theorems of the form P=Q to
9695 the rewriter and classical reasoner simultaneously;
9697 * function uresult no longer returns theorems in "standard" format;
9698 regain previous version by: val uresult = standard o uresult;
9705 * oracles -- these establish an interface between Isabelle and trusted
9706 external reasoners, which may deliver results as theorems;
9708 * proof objects (in particular record all uses of oracles);
9710 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
9712 * "constdefs" section in theory files;
9714 * "primrec" section (HOL) no longer requires names;
9716 * internal type "tactic" now simply "thm -> thm Sequence.seq";
9723 * reduced space requirements;
9725 * automatic HTML generation from theories;
9727 * theory files no longer require "..." (quotes) around most types;
9729 * new examples, including two proofs of the Church-Rosser theorem;
9731 * non-curried (1994) version of HOL is no longer distributed;
9738 * greatly reduced space requirements;
9740 * theory files (.thy) no longer require \...\ escapes at line breaks;
9742 * searchable theorem database (see the section "Retrieving theorems" on
9743 page 8 of the Reference Manual);
9745 * new examples, including Grabczewski's monumental case study of the
9748 * The previous version of HOL renamed to Old_HOL;
9750 * The new version of HOL (previously called CHOL) uses a curried syntax
9751 for functions. Application looks like f a b instead of f(a,b);
9753 * Mutually recursive inductive definitions finally work in HOL;
9755 * In ZF, pattern-matching on tuples is now available in all abstractions and
9756 translates to the operator "split";
9763 * new infix operator, addss, allowing the classical reasoner to
9764 perform simplification at each step of its search. Example:
9765 fast_tac (cs addss ss)
9767 * a new logic, CHOL, the same as HOL, but with a curried syntax
9768 for functions. Application looks like f a b instead of f(a,b). Also pairs
9769 look like (a,b) instead of <a,b>;
9771 * PLEASE NOTE: CHOL will eventually replace HOL!
9773 * In CHOL, pattern-matching on tuples is now available in all abstractions.
9774 It translates to the operator "split". A new theory of integers is available;
9776 * In ZF, integer numerals now denote two's-complement binary integers.
9777 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
9779 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
9780 of the Axiom of Choice;
9787 * Significantly faster resolution;
9789 * the different sections in a .thy file can now be mixed and repeated
9792 * Database of theorems for FOL, HOL and ZF. New
9793 commands including qed, qed_goal and bind_thm store theorems in the database.
9795 * Simple database queries: return a named theorem (get_thm) or all theorems of
9796 a given theory (thms_of), or find out what theory a theorem was proved in
9799 * Bugs fixed in the inductive definition and datatype packages;
9801 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
9802 and HOL_dup_cs obsolete;
9804 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
9807 * Simpler definition of function space in ZF;
9809 * new results about cardinal and ordinal arithmetic in ZF;
9811 * 'subtype' facility in HOL for introducing new types as subsets of existing
9814 :mode=text:wrap=hard:maxLineLen=72: