separated registration of BNFs from bnf_def (BNFs are now stored only for bnf_def and (co)data commands)
1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Command 'ML_file' evaluates ML text from a file directly within the
10 theory, without any predeclaration via 'uses' in the theory header.
12 * Old command 'use' command and corresponding keyword 'uses' in the
13 theory header are legacy features and will be discontinued soon.
14 Tools that load their additional source files may imitate the
15 'ML_file' implementation, such that the system can take care of
16 dependencies properly.
18 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
19 is called fastforce / fast_force_tac already since Isabelle2011-1.
21 * Updated and extended "isar-ref" manual, reduced remaining material
27 * Code generation for Haskell: restrict unqualified imports from
28 Haskell Prelude to a small set of fundamental operations.
30 * Command "export_code": relative file names are interpreted
31 relatively to master directory of current theory rather than
32 the rather arbitrary current working directory.
35 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
36 use regular rule composition via "OF" / "THEN", or explicit proof
37 structure instead. Note that Isabelle/ML provides a variety of
38 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
39 with some care where this is really required.
41 * Command 'typ' supports an additional variant with explicit sort
42 constraint, to infer and check the most general type conforming to a
43 given given sort. Example (in HOL):
45 typ "_ * _ * bool * unit" :: finite
50 * Class "comm_monoid_diff" formalised properties of bounded
51 subtraction, with natural numbers and multisets as typical instances.
53 * Theory "Library/Option_ord" provides instantiation of option type
54 to lattice type classes.
56 * New combinator "Option.these" with type "'a option set => 'a option".
58 * Renamed theory Library/List_Prefix to Library/Sublist.
59 INCOMPATIBILITY. Related changes are:
64 strict_prefix ~> prefix
66 Renamed lemmas accordingly, INCOMPATIBILITY.
68 - Replaced constant "postfix" by "suffixeq" with swapped argument order
69 (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped old infix
70 syntax "xs >>= ys"; use "suffixeq ys xs" instead. Renamed lemmas
71 accordingly. INCOMPATIBILITY.
73 - New constant "emb" for homeomorphic embedding on lists. New
74 abbreviation "sub" for special case "emb (op =)".
76 - Library/Sublist does no longer provide "order" and "bot" type class
77 instances for the prefix order (merely corresponding locale
78 interpretations). The type class instances are to be found in
79 Library/Prefix_Order. INCOMPATIBILITY.
81 - The sublist relation from Library/Sublist_Order is now based on
82 "Sublist.sub". Replaced lemmas:
84 le_list_append_le_same_iff ~> Sublist.sub_append_le_same_iff
85 le_list_append_mono ~> Sublist.emb_append_mono
86 le_list_below_empty ~> Sublist.emb_Nil, Sublist.emb_Nil2
87 le_list_Cons_EX ~> Sublist.emb_ConsD
88 le_list_drop_Cons2 ~> Sublist.sub_Cons2'
89 le_list_drop_Cons_neq ~> Sublist.sub_Cons2_neq
90 le_list_drop_Cons ~> Sublist.sub_Cons'
91 le_list_drop_many ~> Sublist.sub_drop_many
92 le_list_filter_left ~> Sublist.sub_filter_left
93 le_list_rev_drop_many ~> Sublist.sub_rev_drop_many
94 le_list_rev_take_iff ~> Sublist.sub_append
95 le_list_same_length ~> Sublist.sub_same_length
96 le_list_take_many_iff ~> Sublist.sub_append'
97 less_eq_list.drop ~> less_eq_list_drop
98 less_eq_list.induct ~> less_eq_list_induct
99 not_le_list_length ~> Sublist.not_sub_length
103 * HOL/Codatatype: New (co)datatype package with support for mixed,
104 nested recursion and interesting non-free datatypes.
106 * HOL/Cardinals: Theories of ordinals and cardinals
107 (supersedes the AFP entry "Ordinals_and_Cardinals").
109 * Library/Debug.thy and Library/Parallel.thy: debugging and parallel
110 execution for code generated towards Isabelle/ML.
112 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
117 - added an optimisation for equality premises.
118 It is switched on by default, and can be switched off by setting
119 the configuration quickcheck_optimise_equality to false.
121 * The SMT solver Z3 has now by default a restricted set of directly
122 supported features. For the full set of features (div/mod, nonlinear
123 arithmetic, datatypes/records) with potential proof reconstruction
124 failures, enable the configuration option "z3_with_extensions".
125 Minor INCOMPATIBILITY.
129 - Added MaSh relevance filter based on machine-learning; see the
130 Sledgehammer manual for details.
131 - Rationalized type encodings ("type_enc" option).
132 - Renamed "kill_provers" subcommand to "kill"
134 max_relevant ~> max_facts
135 relevance_thresholds ~> fact_thresholds
138 *** Document preparation ***
140 * Default for \<euro> is now based on eurosym package, instead of
141 slightly exotic babel/greek.
143 * Document variant NAME may use different LaTeX entry point
144 document/root_NAME.tex if that file exists, instead of the common
147 * Simplified custom document/build script, instead of old-style
148 document/IsaMakefile. Minor INCOMPATIBILITY.
153 * Renamed Position.str_of to Position.here to emphasize that this is a
154 formal device to inline positions into message text, but not
155 necessarily printing visible text.
160 * The ML system is configured as regular component, and no longer
161 picked up from some surrounding directory. Potential INCOMPATIBILITY
162 for home-made configurations.
164 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
165 Minor INCOMPATIBILITY in command-line options.
167 * Advanced support for Isabelle sessions and build management, see
168 "system" manual for the chapter of that name, especially the "isabelle
169 build" tool and its examples. INCOMPATIBILITY, isabelle usedir /
170 mkdir / make are rendered obsolete.
172 * Discontinued obsolete "isabelle makeall".
174 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
175 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
176 provides some traditional targets that invoke "isabelle build". Note
177 that this is inefficient! Applications of Isabelle/HOL involving
178 "isabelle make" should be upgraded to use "isabelle build" directly.
180 * Discontinued obsolete Isabelle/build script, it is superseded by the
181 regular isabelle build tool. For example:
183 isabelle build -s -b HOLCF
185 * The "isabelle options" tool prints Isabelle system options, as
186 required for "isabelle build", for example.
188 * The "isabelle mkroot" tool prepares session root directories for use
189 with "isabelle build", similar to former "isabelle mkdir" for
192 * The "isabelle components" tool helps to resolve add-on components
193 that are not bundled, or referenced from a bare-bones repository
196 * Discontinued support for Poly/ML 5.2.1, which was the last version
197 without exception positions and advanced ML compiler/toplevel
200 * Discontinued special treatment of Proof General -- no longer guess
201 PROOFGENERAL_HOME based on accidental file-system layout. Minor
202 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
203 settings manually, or use a Proof General version that has been
204 bundled as Isabelle component.
207 New in Isabelle2012 (May 2012)
208 ------------------------------
212 * Prover IDE (PIDE) improvements:
214 - more robust Sledgehammer integration (as before the sledgehammer
215 command-line needs to be typed into the source buffer)
216 - markup for bound variables
217 - markup for types of term variables (displayed as tooltips)
218 - support for user-defined Isar commands within the running session
219 - improved support for Unicode outside original 16bit range
220 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
222 * Forward declaration of outer syntax keywords within the theory
223 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
224 commands to be used in the same theory where defined.
226 * Auxiliary contexts indicate block structure for specifications with
227 additional parameters and assumptions. Such unnamed contexts may be
228 nested within other targets, like 'theory', 'locale', 'class',
229 'instantiation' etc. Results from the local context are generalized
230 accordingly and applied to the enclosing target context. Example:
234 assumes xy: "x = y" and yz: "y = z"
237 lemma my_trans: "x = z" using xy yz by simp
243 The most basic application is to factor-out context elements of
244 several fixes/assumes/shows theorem statements, e.g. see
245 ~~/src/HOL/Isar_Examples/Group_Context.thy
247 Any other local theory specification element works within the "context
248 ... begin ... end" block as well.
250 * Bundled declarations associate attributed fact expressions with a
251 given name in the context. These may be later included in other
252 contexts. This allows to manage context extensions casually, without
253 the logical dependencies of locales and locale interpretation. See
254 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
256 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
257 declaration, and results are standardized before being stored. Thus
258 old-style "standard" after instantiation or composition of facts
259 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
260 indices of schematic variables.
262 * Rule attributes in local theory declarations (e.g. locale or class)
263 are now statically evaluated: the resulting theorem is stored instead
264 of the original expression. INCOMPATIBILITY in rare situations, where
265 the historic accident of dynamic re-evaluation in interpretations
268 * New tutorial "Programming and Proving in Isabelle/HOL"
269 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
270 Structured Isar Proofs" ("isar-overview"), which has been removed. It
271 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
272 Logic" as the recommended beginners tutorial, but does not cover all
273 of the material of that old tutorial.
275 * Updated and extended reference manuals: "isar-ref",
276 "implementation", "system"; reduced remaining material in old "ref"
282 * Command 'definition' no longer exports the foundational "raw_def"
283 into the user context. Minor INCOMPATIBILITY, may use the regular
284 "def" result with attribute "abs_def" to imitate the old version.
286 * Attribute "abs_def" turns an equation of the form "f x y == t" into
287 "f == %x y. t", which ensures that "simp" or "unfold" steps always
288 expand it. This also works for object-logic equality. (Formerly
289 undocumented feature.)
291 * Sort constraints are now propagated in simultaneous statements, just
292 like type constraints. INCOMPATIBILITY in rare situations, where
293 distinct sorts used to be assigned accidentally. For example:
295 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
297 lemma "P (x::'a)" and "Q (y::'a::bar)"
298 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
300 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
301 tolerant against multiple unifiers, as long as the final result is
302 unique. (As before, rules are composed in canonical right-to-left
303 order to accommodate newly introduced premises.)
305 * Renamed some inner syntax categories:
311 Minor INCOMPATIBILITY. Note that in practice "num_const" or
312 "num_position" etc. are mainly used instead (which also include
313 position information via constraints).
315 * Simplified configuration options for syntax ambiguity: see
316 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
317 manual. Minor INCOMPATIBILITY.
319 * Discontinued configuration option "syntax_positions": atomic terms
320 in parse trees are always annotated by position constraints.
322 * Old code generator for SML and its commands 'code_module',
323 'code_library', 'consts_code', 'types_code' have been discontinued.
324 Use commands of the generic code generator instead. INCOMPATIBILITY.
326 * Redundant attribute "code_inline" has been discontinued. Use
327 "code_unfold" instead. INCOMPATIBILITY.
329 * Dropped attribute "code_unfold_post" in favor of the its dual
330 "code_abbrev", which yields a common pattern in definitions like
332 definition [code_abbrev]: "f = t"
336 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
337 instead. INCOMPATIBILITY.
339 * Discontinued old "prems" fact, which used to refer to the accidental
340 collection of foundational premises in the context (already marked as
341 legacy since Isabelle2011).
346 * Type 'a set is now a proper type constructor (just as before
347 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
348 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
349 sets separate, it is often sufficient to rephrase some set S that has
350 been accidentally used as predicates by "%x. x : S", and some
351 predicate P that has been accidentally used as set by "{x. P x}".
352 Corresponding proofs in a first step should be pruned from any
353 tinkering with former theorems mem_def and Collect_def as far as
356 For developments which deliberately mix predicates and sets, a
357 planning step is necessary to determine what should become a predicate
358 and what a set. It can be helpful to carry out that step in
359 Isabelle2011-1 before jumping right into the current release.
361 * Code generation by default implements sets as container type rather
362 than predicates. INCOMPATIBILITY.
364 * New type synonym 'a rel = ('a * 'a) set
366 * The representation of numerals has changed. Datatype "num"
367 represents strictly positive binary numerals, along with functions
368 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
369 positive and negated numeric literals, respectively. See also
370 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
371 user theories may require adaptations as follows:
373 - Theorems with number_ring or number_semiring constraints: These
374 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
376 - Theories defining numeric types: Remove number, number_semiring,
377 and number_ring instances. Defer all theorems about numerals until
378 after classes one and semigroup_add have been instantiated.
380 - Numeral-only simp rules: Replace each rule having a "number_of v"
381 pattern with two copies, one for numeral and one for neg_numeral.
383 - Theorems about subclasses of semiring_1 or ring_1: These classes
384 automatically support numerals now, so more simp rules and
385 simprocs may now apply within the proof.
387 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
388 Redefine using other integer operations.
390 * Transfer: New package intended to generalize the existing
391 "descending" method and related theorem attributes from the Quotient
392 package. (Not all functionality is implemented yet, but future
393 development will focus on Transfer as an eventual replacement for the
394 corresponding parts of the Quotient package.)
396 - transfer_rule attribute: Maintains a collection of transfer rules,
397 which relate constants at two different types. Transfer rules may
398 relate different type instances of the same polymorphic constant,
399 or they may relate an operation on a raw type to a corresponding
400 operation on an abstract type (quotient or subtype). For example:
402 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
403 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
405 - transfer method: Replaces a subgoal on abstract types with an
406 equivalent subgoal on the corresponding raw types. Constants are
407 replaced with corresponding ones according to the transfer rules.
408 Goals are generalized over all free variables by default; this is
409 necessary for variables whose types change, but can be overridden
410 for specific variables with e.g. "transfer fixing: x y z". The
411 variant transfer' method allows replacing a subgoal with one that
412 is logically stronger (rather than equivalent).
414 - relator_eq attribute: Collects identity laws for relators of
415 various type constructors, e.g. "list_all2 (op =) = (op =)". The
416 transfer method uses these lemmas to infer transfer rules for
417 non-polymorphic constants on the fly.
419 - transfer_prover method: Assists with proving a transfer rule for a
420 new constant, provided the constant is defined in terms of other
421 constants that already have transfer rules. It should be applied
422 after unfolding the constant definitions.
424 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
425 from type nat to type int.
427 * Lifting: New package intended to generalize the quotient_definition
428 facility of the Quotient package; designed to work with Transfer.
430 - lift_definition command: Defines operations on an abstract type in
431 terms of a corresponding operation on a representation
432 type. Example syntax:
434 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
437 Users must discharge a respectfulness proof obligation when each
438 constant is defined. (For a type copy, i.e. a typedef with UNIV,
439 the proof is discharged automatically.) The obligation is
440 presented in a user-friendly, readable form; a respectfulness
441 theorem in the standard format and a transfer rule are generated
444 - Integration with code_abstype: For typedefs (e.g. subtypes
445 corresponding to a datatype invariant, such as dlist),
446 lift_definition generates a code certificate theorem and sets up
447 code generation for each constant.
449 - setup_lifting command: Sets up the Lifting package to work with a
450 user-defined type. The user must provide either a quotient theorem
451 or a type_definition theorem. The package configures transfer
452 rules for equality and quantifiers on the type, and sets up the
453 lift_definition command to work with the type.
455 - Usage examples: See Quotient_Examples/Lift_DList.thy,
456 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
457 Word/Word.thy and Library/Float.thy.
461 - The 'quotient_type' command now supports a 'morphisms' option with
462 rep and abs functions, similar to typedef.
464 - 'quotient_type' sets up new types to work with the Lifting and
465 Transfer packages, as with 'setup_lifting'.
467 - The 'quotient_definition' command now requires the user to prove a
468 respectfulness property at the point where the constant is
469 defined, similar to lift_definition; INCOMPATIBILITY.
471 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
472 accordingly, INCOMPATIBILITY.
474 * New diagnostic command 'find_unused_assms' to find potentially
475 superfluous assumptions in theorems using Quickcheck.
479 - Quickcheck returns variable assignments as counterexamples, which
480 allows to reveal the underspecification of functions under test.
481 For example, refuting "hd xs = x", it presents the variable
482 assignment xs = [] and x = a1 as a counterexample, assuming that
483 any property is false whenever "hd []" occurs in it.
485 These counterexample are marked as potentially spurious, as
486 Quickcheck also returns "xs = []" as a counterexample to the
487 obvious theorem "hd xs = hd xs".
489 After finding a potentially spurious counterexample, Quickcheck
490 continues searching for genuine ones.
492 By default, Quickcheck shows potentially spurious and genuine
493 counterexamples. The option "genuine_only" sets quickcheck to only
494 show genuine counterexamples.
496 - The command 'quickcheck_generator' creates random and exhaustive
497 value generators for a given type and operations.
499 It generates values by using the operations as if they were
500 constructors of that type.
502 - Support for multisets.
504 - Added "use_subtype" options.
506 - Added "quickcheck_locale" configuration to specify how to process
507 conjectures in a locale context.
509 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
510 and affecting 'rat' and 'real'.
513 - Integrated more tightly with SPASS, as described in the ITP 2012
514 paper "More SPASS with Isabelle".
515 - Made it try "smt" as a fallback if "metis" fails or times out.
516 - Added support for the following provers: Alt-Ergo (via Why3 and
517 TFF1), iProver, iProver-Eq.
518 - Sped up the minimizer.
519 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
520 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
521 - Renamed "sound" option to "strict".
523 * Metis: Added possibility to specify lambda translations scheme as a
524 parenthesized argument (e.g., "by (metis (lifting) ...)").
526 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
528 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
530 * New "case_product" attribute to generate a case rule doing multiple
531 case distinctions at the same time. E.g.
533 list.exhaust [case_product nat.exhaust]
535 produces a rule which can be used to perform case distinction on both
538 * New "eventually_elim" method as a generalized variant of the
539 eventually_elim* rules. Supports structured proofs.
541 * Typedef with implicit set definition is considered legacy. Use
542 "typedef (open)" form instead, which will eventually become the
545 * Record: code generation can be switched off manually with
547 declare [[record_coden = false]] -- "default true"
549 * Datatype: type parameters allow explicit sort constraints.
551 * Concrete syntax for case expressions includes constraints for source
552 positions, and thus produces Prover IDE markup for its bindings.
553 INCOMPATIBILITY for old-style syntax translations that augment the
554 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
557 * Clarified attribute "mono_set": pure declaration without modifying
558 the result of the fact expression.
560 * More default pred/set conversions on a couple of relation operations
561 and predicates. Added powers of predicate relations. Consolidation
562 of some relation theorems:
564 converse_def ~> converse_unfold
565 rel_comp_def ~> relcomp_unfold
566 symp_def ~> (modified, use symp_def and sym_def instead)
567 transp_def ~> transp_trans
568 Domain_def ~> Domain_unfold
569 Range_def ~> Domain_converse [symmetric]
571 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
573 See theory "Relation" for examples for making use of pred/set
574 conversions by means of attributes "to_set" and "to_pred".
578 * Renamed facts about the power operation on relations, i.e., relpow
579 to match the constant's name:
581 rel_pow_1 ~> relpow_1
582 rel_pow_0_I ~> relpow_0_I
583 rel_pow_Suc_I ~> relpow_Suc_I
584 rel_pow_Suc_I2 ~> relpow_Suc_I2
585 rel_pow_0_E ~> relpow_0_E
586 rel_pow_Suc_E ~> relpow_Suc_E
587 rel_pow_E ~> relpow_E
588 rel_pow_Suc_D2 ~> relpow_Suc_D2
589 rel_pow_Suc_E2 ~> relpow_Suc_E2
590 rel_pow_Suc_D2' ~> relpow_Suc_D2'
591 rel_pow_E2 ~> relpow_E2
592 rel_pow_add ~> relpow_add
593 rel_pow_commute ~> relpow
594 rel_pow_empty ~> relpow_empty:
595 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
596 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
597 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
598 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
599 rel_pow_fun_conv ~> relpow_fun_conv
600 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
601 rel_pow_finite_bounded ~> relpow_finite_bounded
602 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
603 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
604 single_valued_rel_pow ~> single_valued_relpow
608 * Theory Relation: Consolidated constant name for relation composition
609 and corresponding theorem names:
611 - Renamed constant rel_comp to relcomp.
613 - Dropped abbreviation pred_comp. Use relcompp instead.
617 rel_compI ~> relcompI
618 rel_compEpair ~> relcompEpair
619 rel_compE ~> relcompE
620 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
621 rel_comp_empty1 ~> relcomp_empty1
622 rel_comp_mono ~> relcomp_mono
623 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
624 rel_comp_distrib ~> relcomp_distrib
625 rel_comp_distrib2 ~> relcomp_distrib2
626 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
627 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
628 single_valued_rel_comp ~> single_valued_relcomp
629 rel_comp_def ~> relcomp_unfold
630 converse_rel_comp ~> converse_relcomp
631 pred_compI ~> relcomppI
632 pred_compE ~> relcomppE
633 pred_comp_bot1 ~> relcompp_bot1
634 pred_comp_bot2 ~> relcompp_bot2
635 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
636 pred_comp_mono ~> relcompp_mono
637 pred_comp_distrib ~> relcompp_distrib
638 pred_comp_distrib2 ~> relcompp_distrib2
639 converse_pred_comp ~> converse_relcompp
641 finite_rel_comp ~> finite_relcomp
643 set_rel_comp ~> set_relcomp
647 * Theory Divides: Discontinued redundant theorems about div and mod.
648 INCOMPATIBILITY, use the corresponding generic theorems instead.
650 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
651 zdiv_self ~> div_self
652 zmod_self ~> mod_self
655 zdiv_zmod_equality ~> div_mod_equality2
656 zdiv_zmod_equality2 ~> div_mod_equality
657 zmod_zdiv_trivial ~> mod_div_trivial
658 zdiv_zminus_zminus ~> div_minus_minus
659 zmod_zminus_zminus ~> mod_minus_minus
660 zdiv_zminus2 ~> div_minus_right
661 zmod_zminus2 ~> mod_minus_right
662 zdiv_minus1_right ~> div_minus1_right
663 zmod_minus1_right ~> mod_minus1_right
664 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
665 zmod_zmult1_eq ~> mod_mult_right_eq
666 zpower_zmod ~> power_mod
668 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
669 mod_mult_distrib ~> mult_mod_left
670 mod_mult_distrib2 ~> mult_mod_right
672 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
673 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
675 * Finite_Set.fold now qualified. INCOMPATIBILITY.
677 * Consolidated theorem names concerning fold combinators:
679 inf_INFI_fold_inf ~> inf_INF_fold_inf
680 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
681 INFI_fold_inf ~> INF_fold_inf
682 SUPR_fold_sup ~> SUP_fold_sup
683 union_set ~> union_set_fold
684 minus_set ~> minus_set_fold
685 INFI_set_fold ~> INF_set_fold
686 SUPR_set_fold ~> SUP_set_fold
687 INF_code ~> INF_set_foldr
688 SUP_code ~> SUP_set_foldr
689 foldr.simps ~> foldr.simps (in point-free formulation)
690 foldr_fold_rev ~> foldr_conv_fold
691 foldl_fold ~> foldl_conv_fold
692 foldr_foldr ~> foldr_conv_foldl
693 foldl_foldr ~> foldl_conv_foldr
694 fold_set_remdups ~> fold_set_fold_remdups
695 fold_set ~> fold_set_fold
696 fold1_set ~> fold1_set_fold
700 * Dropped rarely useful theorems concerning fold combinators:
701 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
702 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
703 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
704 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
705 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
706 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
707 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
708 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
709 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
710 unfolding "foldr_conv_fold" and "foldl_conv_fold".
712 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
713 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
714 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
715 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
716 lemmas over fold rather than foldr, or make use of lemmas
717 fold_conv_foldr and fold_rev.
719 * Congruence rules Option.map_cong and Option.bind_cong for recursion
720 through option types.
722 * "Transitive_Closure.ntrancl": bounded transitive closure on
725 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
727 * Theory Int: Discontinued many legacy theorems specific to type int.
728 INCOMPATIBILITY, use the corresponding generic theorems instead.
730 zminus_zminus ~> minus_minus
731 zminus_0 ~> minus_zero
732 zminus_zadd_distrib ~> minus_add_distrib
733 zadd_commute ~> add_commute
734 zadd_assoc ~> add_assoc
735 zadd_left_commute ~> add_left_commute
739 zadd_0_right ~> add_0_right
740 zadd_zminus_inverse2 ~> left_minus
741 zmult_zminus ~> mult_minus_left
742 zmult_commute ~> mult_commute
743 zmult_assoc ~> mult_assoc
744 zadd_zmult_distrib ~> left_distrib
745 zadd_zmult_distrib2 ~> right_distrib
746 zdiff_zmult_distrib ~> left_diff_distrib
747 zdiff_zmult_distrib2 ~> right_diff_distrib
748 zmult_1 ~> mult_1_left
749 zmult_1_right ~> mult_1_right
750 zle_refl ~> order_refl
751 zle_trans ~> order_trans
752 zle_antisym ~> order_antisym
753 zle_linear ~> linorder_linear
754 zless_linear ~> linorder_less_linear
755 zadd_left_mono ~> add_left_mono
756 zadd_strict_right_mono ~> add_strict_right_mono
757 zadd_zless_mono ~> add_less_le_mono
758 int_0_less_1 ~> zero_less_one
759 int_0_neq_1 ~> zero_neq_one
761 zpower_zadd_distrib ~> power_add
762 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
763 zero_le_zpower_abs ~> zero_le_power_abs
765 * Theory Deriv: Renamed
767 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
769 * Theory Library/Multiset: Improved code generation of multisets.
771 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
772 are expressed via type classes again. The special syntax
773 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
774 setsum_set, which is now subsumed by Big_Operators.setsum.
777 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
778 use theory HOL/Library/Nat_Bijection instead.
780 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
781 trees is now inside a type class context. Names of affected
782 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
783 theories working directly with raw red-black trees, adapt the names as
787 bulkload -> rbt_bulkload
788 del_from_left -> rbt_del_from_left
789 del_from_right -> rbt_del_from_right
794 insertw -> rbt_insert_with
795 insert_with_key -> rbt_insert_with_key
796 map_entry -> rbt_map_entry
799 tree_greater -> rbt_greater
800 tree_less -> rbt_less
801 tree_less_symbol -> rbt_less_symbol
803 union_with -> rbt_union_with
804 union_with_key -> rbt_union_with_key
807 balance_left_sorted -> balance_left_rbt_sorted
808 balance_left_tree_greater -> balance_left_rbt_greater
809 balance_left_tree_less -> balance_left_rbt_less
810 balance_right_sorted -> balance_right_rbt_sorted
811 balance_right_tree_greater -> balance_right_rbt_greater
812 balance_right_tree_less -> balance_right_rbt_less
813 balance_sorted -> balance_rbt_sorted
814 balance_tree_greater -> balance_rbt_greater
815 balance_tree_less -> balance_rbt_less
816 bulkload_is_rbt -> rbt_bulkload_is_rbt
817 combine_sorted -> combine_rbt_sorted
818 combine_tree_greater -> combine_rbt_greater
819 combine_tree_less -> combine_rbt_less
820 delete_in_tree -> rbt_delete_in_tree
821 delete_is_rbt -> rbt_delete_is_rbt
822 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
823 del_from_left_tree_less -> rbt_del_from_left_rbt_less
824 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
825 del_from_right_tree_less -> rbt_del_from_right_rbt_less
826 del_in_tree -> rbt_del_in_tree
827 del_inv1_inv2 -> rbt_del_inv1_inv2
828 del_sorted -> rbt_del_rbt_sorted
829 del_tree_greater -> rbt_del_rbt_greater
830 del_tree_less -> rbt_del_rbt_less
831 dom_lookup_Branch -> dom_rbt_lookup_Branch
832 entries_lookup -> entries_rbt_lookup
833 finite_dom_lookup -> finite_dom_rbt_lookup
834 insert_sorted -> rbt_insert_rbt_sorted
835 insertw_is_rbt -> rbt_insertw_is_rbt
836 insertwk_is_rbt -> rbt_insertwk_is_rbt
837 insertwk_sorted -> rbt_insertwk_rbt_sorted
838 insertw_sorted -> rbt_insertw_rbt_sorted
839 ins_sorted -> ins_rbt_sorted
840 ins_tree_greater -> ins_rbt_greater
841 ins_tree_less -> ins_rbt_less
842 is_rbt_sorted -> is_rbt_rbt_sorted
843 lookup_balance -> rbt_lookup_balance
844 lookup_bulkload -> rbt_lookup_rbt_bulkload
845 lookup_delete -> rbt_lookup_rbt_delete
846 lookup_Empty -> rbt_lookup_Empty
847 lookup_from_in_tree -> rbt_lookup_from_in_tree
848 lookup_in_tree -> rbt_lookup_in_tree
849 lookup_ins -> rbt_lookup_ins
850 lookup_insert -> rbt_lookup_rbt_insert
851 lookup_insertw -> rbt_lookup_rbt_insertw
852 lookup_insertwk -> rbt_lookup_rbt_insertwk
853 lookup_keys -> rbt_lookup_keys
854 lookup_map -> rbt_lookup_map
855 lookup_map_entry -> rbt_lookup_rbt_map_entry
856 lookup_tree_greater -> rbt_lookup_rbt_greater
857 lookup_tree_less -> rbt_lookup_rbt_less
858 lookup_union -> rbt_lookup_rbt_union
859 map_entry_color_of -> rbt_map_entry_color_of
860 map_entry_inv1 -> rbt_map_entry_inv1
861 map_entry_inv2 -> rbt_map_entry_inv2
862 map_entry_is_rbt -> rbt_map_entry_is_rbt
863 map_entry_sorted -> rbt_map_entry_rbt_sorted
864 map_entry_tree_greater -> rbt_map_entry_rbt_greater
865 map_entry_tree_less -> rbt_map_entry_rbt_less
866 map_tree_greater -> map_rbt_greater
867 map_tree_less -> map_rbt_less
868 map_sorted -> map_rbt_sorted
869 paint_sorted -> paint_rbt_sorted
870 paint_lookup -> paint_rbt_lookup
871 paint_tree_greater -> paint_rbt_greater
872 paint_tree_less -> paint_rbt_less
873 sorted_entries -> rbt_sorted_entries
874 tree_greater_eq_trans -> rbt_greater_eq_trans
875 tree_greater_nit -> rbt_greater_nit
876 tree_greater_prop -> rbt_greater_prop
877 tree_greater_simps -> rbt_greater_simps
878 tree_greater_trans -> rbt_greater_trans
879 tree_less_eq_trans -> rbt_less_eq_trans
880 tree_less_nit -> rbt_less_nit
881 tree_less_prop -> rbt_less_prop
882 tree_less_simps -> rbt_less_simps
883 tree_less_trans -> rbt_less_trans
884 tree_ord_props -> rbt_ord_props
885 union_Branch -> rbt_union_Branch
886 union_is_rbt -> rbt_union_is_rbt
887 unionw_is_rbt -> rbt_unionw_is_rbt
888 unionwk_is_rbt -> rbt_unionwk_is_rbt
889 unionwk_sorted -> rbt_unionwk_rbt_sorted
891 * Theory HOL/Library/Float: Floating point numbers are now defined as
892 a subset of the real numbers. All operations are defined using the
893 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
900 round_down -> float_round_down
901 round_up -> float_round_up
905 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
908 abs_float_def -> Float.compute_float_abs
909 bitlen_ge0 -> bitlen_nonneg
910 bitlen.simps -> Float.compute_bitlen
911 float_components -> Float_mantissa_exponent
912 float_divl.simps -> Float.compute_float_divl
913 float_divr.simps -> Float.compute_float_divr
914 float_eq_odd -> mult_powr_eq_mult_powr_iff
915 float_power -> real_of_float_power
916 lapprox_posrat_def -> Float.compute_lapprox_posrat
917 lapprox_rat.simps -> Float.compute_lapprox_rat
918 le_float_def' -> Float.compute_float_le
919 le_float_def -> less_eq_float.rep_eq
920 less_float_def' -> Float.compute_float_less
921 less_float_def -> less_float.rep_eq
922 normfloat_def -> Float.compute_normfloat
923 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
924 normfloat -> normfloat_def
925 normfloat_unique -> use normfloat_def
926 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
927 one_float_def -> Float.compute_float_one
928 plus_float_def -> Float.compute_float_plus
929 rapprox_posrat_def -> Float.compute_rapprox_posrat
930 rapprox_rat.simps -> Float.compute_rapprox_rat
931 real_of_float_0 -> zero_float.rep_eq
932 real_of_float_1 -> one_float.rep_eq
933 real_of_float_abs -> abs_float.rep_eq
934 real_of_float_add -> plus_float.rep_eq
935 real_of_float_minus -> uminus_float.rep_eq
936 real_of_float_mult -> times_float.rep_eq
937 real_of_float_simp -> Float.rep_eq
938 real_of_float_sub -> minus_float.rep_eq
939 round_down.simps -> Float.compute_float_round_down
940 round_up.simps -> Float.compute_float_round_up
941 times_float_def -> Float.compute_float_times
942 uminus_float_def -> Float.compute_float_uminus
943 zero_float_def -> Float.compute_float_zero
945 Lemmas not necessary anymore, use the transfer method:
946 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
947 float_divr, float_le_simp, float_less1_mantissa_bound,
948 float_less_simp, float_less_zero, float_le_zero,
949 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
950 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
951 lapprox_rat_bottom, normalized_float, rapprox_posrat,
952 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
953 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
954 round_up, zero_le_float, zero_less_float
956 * New theory HOL/Library/DAList provides an abstract type for
957 association lists with distinct keys.
959 * Session HOL/IMP: Added new theory of abstract interpretation of
962 * Session HOL-Import: Re-implementation from scratch is faster,
963 simpler, and more scalable. Requires a proof bundle, which is
964 available as an external component. Discontinued old (and mostly
965 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
967 * Session HOL-Word: Discontinued many redundant theorems specific to
968 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
971 word_sub_alt ~> word_sub_wi
972 word_add_alt ~> word_add_def
973 word_mult_alt ~> word_mult_def
974 word_minus_alt ~> word_minus_def
975 word_0_alt ~> word_0_wi
976 word_1_alt ~> word_1_wi
977 word_add_0 ~> add_0_left
978 word_add_0_right ~> add_0_right
979 word_mult_1 ~> mult_1_left
980 word_mult_1_right ~> mult_1_right
981 word_add_commute ~> add_commute
982 word_add_assoc ~> add_assoc
983 word_add_left_commute ~> add_left_commute
984 word_mult_commute ~> mult_commute
985 word_mult_assoc ~> mult_assoc
986 word_mult_left_commute ~> mult_left_commute
987 word_left_distrib ~> left_distrib
988 word_right_distrib ~> right_distrib
989 word_left_minus ~> left_minus
990 word_diff_0_right ~> diff_0_right
991 word_diff_self ~> diff_self
992 word_sub_def ~> diff_minus
993 word_diff_minus ~> diff_minus
994 word_add_ac ~> add_ac
995 word_mult_ac ~> mult_ac
996 word_plus_ac0 ~> add_0_left add_0_right add_ac
997 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
998 word_order_trans ~> order_trans
999 word_order_refl ~> order_refl
1000 word_order_antisym ~> order_antisym
1001 word_order_linear ~> linorder_linear
1002 lenw1_zero_neq_one ~> zero_neq_one
1003 word_number_of_eq ~> number_of_eq
1004 word_of_int_add_hom ~> wi_hom_add
1005 word_of_int_sub_hom ~> wi_hom_sub
1006 word_of_int_mult_hom ~> wi_hom_mult
1007 word_of_int_minus_hom ~> wi_hom_neg
1008 word_of_int_succ_hom ~> wi_hom_succ
1009 word_of_int_pred_hom ~> wi_hom_pred
1010 word_of_int_0_hom ~> word_0_wi
1011 word_of_int_1_hom ~> word_1_wi
1013 * Session HOL-Word: New proof method "word_bitwise" for splitting
1014 machine word equalities and inequalities into logical circuits,
1015 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
1016 multiplication, shifting by constants, bitwise operators and numeric
1017 constants. Requires fixed-length word types, not 'a word. Solves
1018 many standard word identities outright and converts more into first
1019 order problems amenable to blast or similar. See also examples in
1020 HOL/Word/Examples/WordExamples.thy.
1022 * Session HOL-Probability: Introduced the type "'a measure" to
1023 represent measures, this replaces the records 'a algebra and 'a
1024 measure_space. The locales based on subset_class now have two
1025 locale-parameters the space \<Omega> and the set of measurable sets M.
1026 The product of probability spaces uses now the same constant as the
1027 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
1028 measure". Most constants are defined now outside of locales and gain
1029 an additional parameter, like null_sets, almost_eventually or \<mu>'.
1030 Measure space constructions for distributions and densities now got
1031 their own constants distr and density. Instead of using locales to
1032 describe measure spaces with a finite space, the measure count_space
1033 and point_measure is introduced. INCOMPATIBILITY.
1037 finite_measure.\<mu>' -> measure
1038 product_algebra_generator -> prod_algebra
1039 product_prob_space.emb -> prod_emb
1040 product_prob_space.infprod_algebra -> PiM
1043 completeable_measure_space
1044 finite_measure_space
1046 finite_product_finite_prob_space
1047 finite_product_sigma_algebra
1048 finite_sigma_algebra
1050 pair_finite_prob_space
1051 pair_finite_sigma_algebra
1054 product_sigma_algebra
1058 distribution -> use distr measure, or distributed predicate
1060 joint_distribution -> use distr measure, or distributed predicate
1061 pair_measure_generator
1062 product_prob_space.infprod_algebra -> use PiM
1065 Replacement theorems:
1066 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
1067 finite_measure.empty_measure -> measure_empty
1068 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
1069 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
1070 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
1071 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
1072 finite_measure.finite_measure -> finite_measure.emeasure_finite
1073 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
1074 finite_measure.positive_measure' -> measure_nonneg
1075 finite_measure.real_measure -> finite_measure.emeasure_real
1076 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
1077 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
1078 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
1079 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
1080 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
1081 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
1082 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
1083 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
1084 information_space.entropy_commute -> information_space.entropy_commute_simple
1085 information_space.entropy_eq -> information_space.entropy_simple_distributed
1086 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
1087 information_space.entropy_positive -> information_space.entropy_nonneg_simple
1088 information_space.entropy_uniform_max -> information_space.entropy_uniform
1089 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
1090 information_space.KL_eq_0 -> information_space.KL_same_eq_0
1091 information_space.KL_ge_0 -> information_space.KL_nonneg
1092 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
1093 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
1094 Int_stable_cuboids -> Int_stable_atLeastAtMost
1095 Int_stable_product_algebra_generator -> positive_integral
1096 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
1097 measure_space.additive -> emeasure_additive
1098 measure_space.AE_iff_null_set -> AE_iff_null
1099 measure_space.almost_everywhere_def -> eventually_ae_filter
1100 measure_space.almost_everywhere_vimage -> AE_distrD
1101 measure_space.continuity_from_above -> INF_emeasure_decseq
1102 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
1103 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
1104 measure_space.continuity_from_below -> SUP_emeasure_incseq
1105 measure_space_density -> emeasure_density
1106 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
1107 measure_space.integrable_vimage -> integrable_distr
1108 measure_space.integral_translated_density -> integral_density
1109 measure_space.integral_vimage -> integral_distr
1110 measure_space.measure_additive -> plus_emeasure
1111 measure_space.measure_compl -> emeasure_compl
1112 measure_space.measure_countable_increasing -> emeasure_countable_increasing
1113 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
1114 measure_space.measure_decseq -> decseq_emeasure
1115 measure_space.measure_Diff -> emeasure_Diff
1116 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
1117 measure_space.measure_eq_0 -> emeasure_eq_0
1118 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
1119 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
1120 measure_space.measure_incseq -> incseq_emeasure
1121 measure_space.measure_insert -> emeasure_insert
1122 measure_space.measure_mono -> emeasure_mono
1123 measure_space.measure_not_negative -> emeasure_not_MInf
1124 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
1125 measure_space.measure_setsum -> setsum_emeasure
1126 measure_space.measure_setsum_split -> setsum_emeasure_cover
1127 measure_space.measure_space_vimage -> emeasure_distr
1128 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
1129 measure_space.measure_subadditive -> subadditive
1130 measure_space.measure_top -> emeasure_space
1131 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
1132 measure_space.measure_Un_null_set -> emeasure_Un_null_set
1133 measure_space.positive_integral_translated_density -> positive_integral_density
1134 measure_space.positive_integral_vimage -> positive_integral_distr
1135 measure_space.real_continuity_from_above -> Lim_measure_decseq
1136 measure_space.real_continuity_from_below -> Lim_measure_incseq
1137 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
1138 measure_space.real_measure_Diff -> measure_Diff
1139 measure_space.real_measure_finite_Union -> measure_finite_Union
1140 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
1141 measure_space.real_measure_subadditive -> measure_subadditive
1142 measure_space.real_measure_Union -> measure_Union
1143 measure_space.real_measure_UNION -> measure_UNION
1144 measure_space.simple_function_vimage -> simple_function_comp
1145 measure_space.simple_integral_vimage -> simple_integral_distr
1146 measure_space.simple_integral_vimage -> simple_integral_distr
1147 measure_unique_Int_stable -> measure_eqI_generator_eq
1148 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
1149 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
1150 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
1151 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
1152 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
1153 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
1154 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
1155 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
1156 pair_sigma_algebra.sets_swap -> sets_pair_swap
1157 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
1158 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
1159 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
1160 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
1161 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
1162 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
1163 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
1164 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
1165 prob_space.measure_space_1 -> prob_space.emeasure_space_1
1166 prob_space.prob_space_vimage -> prob_space_distr
1167 prob_space.random_variable_restrict -> measurable_restrict
1168 prob_space_unique_Int_stable -> measure_eqI_prob_space
1169 product_algebraE -> prod_algebraE_all
1170 product_algebra_generator_der -> prod_algebra_eq_finite
1171 product_algebra_generator_into_space -> prod_algebra_sets_into_space
1172 product_algebraI -> sets_PiM_I_finite
1173 product_measure_exists -> product_sigma_finite.sigma_finite
1174 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
1175 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
1176 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
1177 product_prob_space.measurable_component -> measurable_component_singleton
1178 product_prob_space.measurable_emb -> measurable_prod_emb
1179 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
1180 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
1181 product_prob_space.measure_emb -> emeasure_prod_emb
1182 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
1183 product_sigma_algebra.product_algebra_into_space -> space_closed
1184 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
1185 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
1186 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
1187 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
1188 sets_product_algebra -> sets_PiM
1189 sigma_algebra.measurable_sigma -> measurable_measure_of
1190 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
1191 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
1192 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
1193 space_product_algebra -> space_PiM
1195 * Session HOL-TPTP: support to parse and import TPTP problems (all
1196 languages) into Isabelle/HOL.
1201 * New "case_product" attribute (see HOL).
1206 * Greater support for structured proofs involving induction or case
1209 * Much greater use of mathematical symbols.
1211 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1216 * Antiquotation @{keyword "name"} produces a parser for outer syntax
1217 from a minor keyword introduced via theory header declaration.
1219 * Antiquotation @{command_spec "name"} produces the
1220 Outer_Syntax.command_spec from a major keyword introduced via theory
1221 header declaration; it can be passed to Outer_Syntax.command etc.
1223 * Local_Theory.define no longer hard-wires default theorem name
1224 "foo_def", but retains the binding as given. If that is Binding.empty
1225 / Attrib.empty_binding, the result is not registered as user-level
1226 fact. The Local_Theory.define_internal variant allows to specify a
1227 non-empty name (used for the foundation in the background theory),
1228 while omitting the fact binding in the user-context. Potential
1229 INCOMPATIBILITY for derived definitional packages: need to specify
1230 naming policy for primitive definitions more explicitly.
1232 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
1233 conformance with similar operations in structure Term and Logic.
1235 * Antiquotation @{attributes [...]} embeds attribute source
1236 representation into the ML text, which is particularly useful with
1237 declarations like Local_Theory.note.
1239 * Structure Proof_Context follows standard naming scheme. Old
1240 ProofContext has been discontinued. INCOMPATIBILITY.
1242 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
1243 change of semantics: update is applied to auxiliary local theory
1246 * Modernized some old-style infix operations:
1248 addeqcongs ~> Simplifier.add_eqcong
1249 deleqcongs ~> Simplifier.del_eqcong
1250 addcongs ~> Simplifier.add_cong
1251 delcongs ~> Simplifier.del_cong
1252 setmksimps ~> Simplifier.set_mksimps
1253 setmkcong ~> Simplifier.set_mkcong
1254 setmksym ~> Simplifier.set_mksym
1255 setmkeqTrue ~> Simplifier.set_mkeqTrue
1256 settermless ~> Simplifier.set_termless
1257 setsubgoaler ~> Simplifier.set_subgoaler
1258 addsplits ~> Splitter.add_split
1259 delsplits ~> Splitter.del_split
1264 * USER_HOME settings variable points to cross-platform user home
1265 directory, which coincides with HOME on POSIX systems only. Likewise,
1266 the Isabelle path specification "~" now expands to $USER_HOME, instead
1267 of former $HOME. A different default for USER_HOME may be set
1268 explicitly in shell environment, before Isabelle settings are
1269 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
1270 the generic user home was intended.
1272 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
1273 notation, which is useful for the jEdit file browser, for example.
1275 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
1280 New in Isabelle2011-1 (October 2011)
1281 ------------------------------------
1285 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
1286 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
1288 - Management of multiple theory files directly from the editor
1289 buffer store -- bypassing the file-system (no requirement to save
1290 files for checking).
1292 - Markup of formal entities within the text buffer, with semantic
1293 highlighting, tooltips and hyperlinks to jump to defining source
1296 - Improved text rendering, with sub/superscripts in the source
1297 buffer (including support for copy/paste wrt. output panel, HTML
1298 theory output and other non-Isabelle text boxes).
1300 - Refined scheduling of proof checking and printing of results,
1301 based on interactive editor view. (Note: jEdit folding and
1302 narrowing allows to restrict buffer perspectives explicitly.)
1304 - Reduced CPU performance requirements, usable on machines with few
1307 - Reduced memory requirements due to pruning of unused document
1308 versions (garbage collection).
1310 See also ~~/src/Tools/jEdit/README.html for further information,
1311 including some remaining limitations.
1313 * Theory loader: source files are exclusively located via the master
1314 directory of each theory node (where the .thy file itself resides).
1315 The global load path (such as src/HOL/Library) has been discontinued.
1316 Note that the path element ~~ may be used to reference theories in the
1317 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
1320 * Theory loader: source files are identified by content via SHA1
1321 digests. Discontinued former path/modtime identification and optional
1322 ISABELLE_FILE_IDENT plugin scripts.
1324 * Parallelization of nested Isar proofs is subject to
1325 Goal.parallel_proofs_threshold (default 100). See also isabelle
1328 * Name space: former unsynchronized references are now proper
1329 configuration options, with more conventional names:
1331 long_names ~> names_long
1332 short_names ~> names_short
1333 unique_names ~> names_unique
1335 Minor INCOMPATIBILITY, need to declare options in context like this:
1337 declare [[names_unique = false]]
1339 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
1340 that the result needs to be unique, which means fact specifications
1341 may have to be refined after enriching a proof context.
1343 * Attribute "case_names" has been refined: the assumptions in each case
1344 can be named now by following the case name with [name1 name2 ...].
1346 * Isabelle/Isar reference manual has been updated and extended:
1347 - "Synopsis" provides a catalog of main Isar language concepts.
1348 - Formal references in syntax diagrams, via @{rail} antiquotation.
1349 - Updated material from classic "ref" manual, notably about
1350 "Classical Reasoner".
1355 * Class bot and top require underlying partial order rather than
1356 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
1358 * Class complete_lattice: generalized a couple of lemmas from sets;
1359 generalized theorems INF_cong and SUP_cong. New type classes for
1360 complete boolean algebras and complete linear orders. Lemmas
1361 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
1362 class complete_linorder.
1364 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
1365 Sup_fun_def, Inf_apply, Sup_apply.
1367 Removed redundant lemmas (the right hand side gives hints how to
1368 replace them for (metis ...), or (simp only: ...) proofs):
1370 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
1371 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
1372 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
1373 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
1374 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
1375 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
1376 Inter_def ~> INF_def, image_def
1377 Union_def ~> SUP_def, image_def
1378 INT_eq ~> INF_def, and image_def
1379 UN_eq ~> SUP_def, and image_def
1380 INF_subset ~> INF_superset_mono [OF _ order_refl]
1382 More consistent and comprehensive names:
1384 INTER_eq_Inter_image ~> INF_def
1385 UNION_eq_Union_image ~> SUP_def
1388 INF_leI ~> INF_lower
1389 INF_leI2 ~> INF_lower2
1390 le_INFI ~> INF_greatest
1391 le_SUPI ~> SUP_upper
1392 le_SUPI2 ~> SUP_upper2
1393 SUP_leI ~> SUP_least
1394 INFI_bool_eq ~> INF_bool_eq
1395 SUPR_bool_eq ~> SUP_bool_eq
1396 INFI_apply ~> INF_apply
1397 SUPR_apply ~> SUP_apply
1398 INTER_def ~> INTER_eq
1399 UNION_def ~> UNION_eq
1403 * Renamed theory Complete_Lattice to Complete_Lattices.
1406 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
1407 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
1408 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
1409 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
1411 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
1412 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
1413 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
1416 * Added syntactic classes "inf" and "sup" for the respective
1417 constants. INCOMPATIBILITY: Changes in the argument order of the
1418 (mostly internal) locale predicates for some derived classes.
1420 * Theorem collections ball_simps and bex_simps do not contain theorems
1421 referring to UNION any longer; these have been moved to collection
1422 UN_ball_bex_simps. INCOMPATIBILITY.
1424 * Theory Archimedean_Field: floor now is defined as parameter of a
1425 separate type class floor_ceiling.
1427 * Theory Finite_Set: more coherent development of fold_set locales:
1429 locale fun_left_comm ~> locale comp_fun_commute
1430 locale fun_left_comm_idem ~> locale comp_fun_idem
1432 Both use point-free characterization; interpretation proofs may need
1433 adjustment. INCOMPATIBILITY.
1435 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
1436 accordance with standard mathematical terminology. INCOMPATIBILITY.
1438 * Theory Complex_Main: The locale interpretations for the
1439 bounded_linear and bounded_bilinear locales have been removed, in
1440 order to reduce the number of duplicate lemmas. Users must use the
1441 original names for distributivity theorems, potential INCOMPATIBILITY.
1443 divide.add ~> add_divide_distrib
1444 divide.diff ~> diff_divide_distrib
1445 divide.setsum ~> setsum_divide_distrib
1446 mult.add_right ~> right_distrib
1447 mult.diff_right ~> right_diff_distrib
1448 mult_right.setsum ~> setsum_right_distrib
1449 mult_left.diff ~> left_diff_distrib
1451 * Theory Complex_Main: Several redundant theorems have been removed or
1452 replaced by more general versions. INCOMPATIBILITY.
1454 real_diff_def ~> minus_real_def
1455 real_divide_def ~> divide_real_def
1456 real_less_def ~> less_le
1457 real_abs_def ~> abs_real_def
1458 real_sgn_def ~> sgn_real_def
1459 real_mult_commute ~> mult_commute
1460 real_mult_assoc ~> mult_assoc
1461 real_mult_1 ~> mult_1_left
1462 real_add_mult_distrib ~> left_distrib
1463 real_zero_not_eq_one ~> zero_neq_one
1464 real_mult_inverse_left ~> left_inverse
1465 INVERSE_ZERO ~> inverse_zero
1466 real_le_refl ~> order_refl
1467 real_le_antisym ~> order_antisym
1468 real_le_trans ~> order_trans
1469 real_le_linear ~> linear
1470 real_le_eq_diff ~> le_iff_diff_le_0
1471 real_add_left_mono ~> add_left_mono
1472 real_mult_order ~> mult_pos_pos
1473 real_mult_less_mono2 ~> mult_strict_left_mono
1474 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
1475 real_0_le_divide_iff ~> zero_le_divide_iff
1476 realpow_two_disj ~> power2_eq_iff
1477 real_squared_diff_one_factored ~> square_diff_one_factored
1478 realpow_two_diff ~> square_diff_square_factored
1479 reals_complete2 ~> complete_real
1480 real_sum_squared_expand ~> power2_sum
1481 exp_ln_eq ~> ln_unique
1483 expi_zero ~> exp_zero
1484 lemma_DERIV_subst ~> DERIV_cong
1485 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
1486 LIMSEQ_const ~> tendsto_const
1487 LIMSEQ_norm ~> tendsto_norm
1488 LIMSEQ_add ~> tendsto_add
1489 LIMSEQ_minus ~> tendsto_minus
1490 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
1491 LIMSEQ_diff ~> tendsto_diff
1492 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
1493 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
1494 LIMSEQ_mult ~> tendsto_mult
1495 LIMSEQ_inverse ~> tendsto_inverse
1496 LIMSEQ_divide ~> tendsto_divide
1497 LIMSEQ_pow ~> tendsto_power
1498 LIMSEQ_setsum ~> tendsto_setsum
1499 LIMSEQ_setprod ~> tendsto_setprod
1500 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
1501 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
1502 LIMSEQ_imp_rabs ~> tendsto_rabs
1503 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
1504 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
1505 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
1506 LIMSEQ_Complex ~> tendsto_Complex
1507 LIM_ident ~> tendsto_ident_at
1508 LIM_const ~> tendsto_const
1509 LIM_add ~> tendsto_add
1510 LIM_add_zero ~> tendsto_add_zero
1511 LIM_minus ~> tendsto_minus
1512 LIM_diff ~> tendsto_diff
1513 LIM_norm ~> tendsto_norm
1514 LIM_norm_zero ~> tendsto_norm_zero
1515 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
1516 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
1517 LIM_rabs ~> tendsto_rabs
1518 LIM_rabs_zero ~> tendsto_rabs_zero
1519 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
1520 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
1521 LIM_compose ~> tendsto_compose
1522 LIM_mult ~> tendsto_mult
1523 LIM_scaleR ~> tendsto_scaleR
1524 LIM_of_real ~> tendsto_of_real
1525 LIM_power ~> tendsto_power
1526 LIM_inverse ~> tendsto_inverse
1527 LIM_sgn ~> tendsto_sgn
1528 isCont_LIM_compose ~> isCont_tendsto_compose
1529 bounded_linear.LIM ~> bounded_linear.tendsto
1530 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
1531 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
1532 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
1533 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
1534 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
1535 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
1537 * Theory Complex_Main: The definition of infinite series was
1538 generalized. Now it is defined on the type class {topological_space,
1539 comm_monoid_add}. Hence it is useable also for extended real numbers.
1541 * Theory Complex_Main: The complex exponential function "expi" is now
1542 a type-constrained abbreviation for "exp :: complex => complex"; thus
1543 several polymorphic lemmas about "exp" are now applicable to "expi".
1547 - Theory Library/Code_Char_ord provides native ordering of
1548 characters in the target language.
1550 - Commands code_module and code_library are legacy, use export_code
1553 - Method "evaluation" is legacy, use method "eval" instead.
1555 - Legacy evaluator "SML" is deactivated by default. May be
1556 reactivated by the following theory command:
1558 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
1560 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
1562 * New proof method "induction" that gives induction hypotheses the
1563 name "IH", thus distinguishing them from further hypotheses that come
1564 from rule induction. The latter are still called "hyps". Method
1565 "induction" is a thin wrapper around "induct" and follows the same
1568 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
1569 still available as a legacy feature for some time.
1572 - Added "need" and "total_consts" options.
1573 - Reintroduced "show_skolems" option by popular demand.
1574 - Renamed attribute: nitpick_def ~> nitpick_unfold.
1578 - Use quasi-sound (and efficient) translations by default.
1579 - Added support for the following provers: E-ToFoF, LEO-II,
1580 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
1581 - Automatically preplay and minimize proofs before showing them if
1582 this can be done within reasonable time.
1583 - sledgehammer available_provers ~> sledgehammer supported_provers.
1585 - Added "preplay_timeout", "slicing", "type_enc", "sound",
1586 "max_mono_iters", and "max_new_mono_instances" options.
1587 - Removed "explicit_apply" and "full_types" options as well as "Full
1588 Types" Proof General menu item. INCOMPATIBILITY.
1591 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
1592 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
1596 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
1597 "elim:" options. INCOMPATIBILITY.
1598 - Introduced 'try' that not only runs 'try_methods' but also
1599 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
1602 - Added "eval" option to evaluate terms for the found counterexample
1603 (currently only supported by the default (exhaustive) tester).
1604 - Added post-processing of terms to obtain readable counterexamples
1605 (currently only supported by the default (exhaustive) tester).
1606 - New counterexample generator quickcheck[narrowing] enables
1607 narrowing-based testing. Requires the Glasgow Haskell compiler
1608 with its installation location defined in the Isabelle settings
1609 environment as ISABELLE_GHC.
1610 - Removed quickcheck tester "SML" based on the SML code generator
1611 (formly in HOL/Library).
1613 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
1614 use 'partial_function' instead.
1616 * Theory Library/Extended_Reals replaces now the positive extended
1617 reals found in probability theory. This file is extended by
1618 Multivariate_Analysis/Extended_Real_Limits.
1620 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
1621 from where it must be imported explicitly if it is really required.
1624 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
1625 been moved here. INCOMPATIBILITY.
1627 * Theory Library/Saturated provides type of numbers with saturated
1630 * Theory Library/Product_Lattice defines a pointwise ordering for the
1631 product type 'a * 'b, and provides instance proofs for various order
1632 and lattice type classes.
1634 * Theory Library/Countable now provides the "countable_datatype" proof
1635 method for proving "countable" class instances for datatypes.
1637 * Theory Library/Cset_Monad allows do notation for computable sets
1638 (cset) via the generic monad ad-hoc overloading facility.
1640 * Library: Theories of common data structures are split into theories
1641 for implementation, an invariant-ensuring type, and connection to an
1642 abstract type. INCOMPATIBILITY.
1644 - RBT is split into RBT and RBT_Mapping.
1645 - AssocList is split and renamed into AList and AList_Mapping.
1646 - DList is split into DList_Impl, DList, and DList_Cset.
1647 - Cset is split into Cset and List_Cset.
1649 * Theory Library/Nat_Infinity has been renamed to
1650 Library/Extended_Nat, with name changes of the following types and
1653 type inat ~> type enat
1655 Infty ~> infinity (overloaded)
1659 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
1660 been renamed accordingly. INCOMPATIBILITY.
1662 * Session Multivariate_Analysis: The euclidean_space type class now
1663 fixes a constant "Basis :: 'a set" consisting of the standard
1664 orthonormal basis for the type. Users now have the option of
1665 quantifying over this set instead of using the "basis" function, e.g.
1666 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
1668 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
1669 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
1670 "Cart_nth" and "Cart_lambda" have been respectively renamed to
1671 "vec_nth" and "vec_lambda"; theorems mentioning those names have
1672 changed to match. Definition theorems for overloaded constants now use
1673 the standard "foo_vec_def" naming scheme. A few other theorems have
1674 been renamed as follows (INCOMPATIBILITY):
1676 Cart_eq ~> vec_eq_iff
1677 dist_nth_le_cart ~> dist_vec_nth_le
1678 tendsto_vector ~> vec_tendstoI
1679 Cauchy_vector ~> vec_CauchyI
1681 * Session Multivariate_Analysis: Several duplicate theorems have been
1682 removed, and other theorems have been renamed or replaced with more
1683 general versions. INCOMPATIBILITY.
1685 finite_choice ~> finite_set_choice
1686 eventually_conjI ~> eventually_conj
1687 eventually_and ~> eventually_conj_iff
1688 eventually_false ~> eventually_False
1689 setsum_norm ~> norm_setsum
1690 Lim_sequentially ~> LIMSEQ_def
1691 Lim_ident_at ~> LIM_ident
1692 Lim_const ~> tendsto_const
1693 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
1694 Lim_neg ~> tendsto_minus
1695 Lim_add ~> tendsto_add
1696 Lim_sub ~> tendsto_diff
1697 Lim_mul ~> tendsto_scaleR
1698 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
1699 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
1700 Lim_linear ~> bounded_linear.tendsto
1701 Lim_component ~> tendsto_euclidean_component
1702 Lim_component_cart ~> tendsto_vec_nth
1703 Lim_inner ~> tendsto_inner [OF tendsto_const]
1704 dot_lsum ~> inner_setsum_left
1705 dot_rsum ~> inner_setsum_right
1706 continuous_cmul ~> continuous_scaleR [OF continuous_const]
1707 continuous_neg ~> continuous_minus
1708 continuous_sub ~> continuous_diff
1709 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
1710 continuous_mul ~> continuous_scaleR
1711 continuous_inv ~> continuous_inverse
1712 continuous_at_within_inv ~> continuous_at_within_inverse
1713 continuous_at_inv ~> continuous_at_inverse
1714 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
1715 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
1716 continuous_at_component ~> continuous_component [OF continuous_at_id]
1717 continuous_on_neg ~> continuous_on_minus
1718 continuous_on_sub ~> continuous_on_diff
1719 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
1720 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
1721 continuous_on_mul ~> continuous_on_scaleR
1722 continuous_on_mul_real ~> continuous_on_mult
1723 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
1724 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
1725 continuous_on_inverse ~> continuous_on_inv
1726 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
1727 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
1728 subset_interior ~> interior_mono
1729 subset_closure ~> closure_mono
1730 closure_univ ~> closure_UNIV
1731 real_arch_lt ~> reals_Archimedean2
1732 real_arch ~> reals_Archimedean3
1733 real_abs_norm ~> abs_norm_cancel
1734 real_abs_sub_norm ~> norm_triangle_ineq3
1735 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
1737 * Session HOL-Probability:
1738 - Caratheodory's extension lemma is now proved for ring_of_sets.
1739 - Infinite products of probability measures are now available.
1740 - Sigma closure is independent, if the generator is independent
1741 - Use extended reals instead of positive extended
1742 reals. INCOMPATIBILITY.
1744 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
1746 expand_fun_below ~> fun_below_iff
1747 below_fun_ext ~> fun_belowI
1748 expand_cfun_eq ~> cfun_eq_iff
1749 ext_cfun ~> cfun_eqI
1750 expand_cfun_below ~> cfun_below_iff
1751 below_cfun_ext ~> cfun_belowI
1752 monofun_fun_fun ~> fun_belowD
1753 monofun_fun_arg ~> monofunE
1754 monofun_lub_fun ~> adm_monofun [THEN admD]
1755 cont_lub_fun ~> adm_cont [THEN admD]
1756 cont2cont_Rep_CFun ~> cont2cont_APP
1757 cont_Rep_CFun_app ~> cont_APP_app
1758 cont_Rep_CFun_app_app ~> cont_APP_app_app
1759 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
1760 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
1761 contlub_cfun ~> lub_APP [symmetric]
1762 contlub_LAM ~> lub_LAM [symmetric]
1765 lift_distinct1 ~> lift.distinct(1)
1766 lift_distinct2 ~> lift.distinct(2)
1767 Def_not_UU ~> lift.distinct(2)
1768 Def_inject ~> lift.inject
1769 below_UU_iff ~> below_bottom_iff
1770 eq_UU_iff ~> eq_bottom_iff
1773 *** Document preparation ***
1775 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
1776 isar-ref manual, both for description and actual application of the
1779 * Antiquotation @{value} evaluates the given term and presents its
1782 * Antiquotations: term style "isub" provides ad-hoc conversion of
1783 variables x1, y23 into subscripted form x\<^isub>1,
1784 y\<^isub>2\<^isub>3.
1786 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
1787 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
1789 * Localized \isabellestyle switch can be used within blocks or groups
1792 \isabellestyle{it} %preferred default
1793 {\isabellestylett @{text "typewriter stuff"}}
1795 * Discontinued special treatment of hard tabulators. Implicit
1796 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
1802 * The inner syntax of sort/type/term/prop supports inlined YXML
1803 representations within quoted string tokens. By encoding logical
1804 entities via Term_XML (in ML or Scala) concrete syntax can be
1805 bypassed, which is particularly useful for producing bits of text
1806 under external program control.
1808 * Antiquotations for ML and document preparation are managed as theory
1809 data, which requires explicit setup.
1811 * Isabelle_Process.is_active allows tools to check if the official
1812 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
1813 (better known as Proof General).
1815 * Structure Proof_Context follows standard naming scheme. Old
1816 ProofContext is still available for some time as legacy alias.
1818 * Structure Timing provides various operations for timing; supersedes
1819 former start_timing/end_timing etc.
1821 * Path.print is the official way to show file-system paths to users
1822 (including quotes etc.).
1824 * Inner syntax: identifiers in parse trees of generic categories
1825 "logic", "aprop", "idt" etc. carry position information (disguised as
1826 type constraints). Occasional INCOMPATIBILITY with non-compliant
1827 translations that choke on unexpected type constraints. Positions can
1828 be stripped in ML translations via Syntax.strip_positions /
1829 Syntax.strip_positions_ast, or via the syntax constant
1830 "_strip_positions" within parse trees. As last resort, positions can
1831 be disabled via the configuration option Syntax.positions, which is
1832 called "syntax_positions" in Isar attribute syntax.
1834 * Discontinued special status of various ML structures that contribute
1835 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
1836 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
1837 refer directly to Ast.Constant, Lexicon.is_identifier,
1838 Syntax_Trans.mk_binder_tr etc.
1840 * Typed print translation: discontinued show_sorts argument, which is
1841 already available via context of "advanced" translation.
1843 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
1844 goal states; body tactic needs to address all subgoals uniformly.
1846 * Slightly more special eq_list/eq_set, with shortcut involving
1847 pointer equality (assumes that eq relation is reflexive).
1849 * Classical tactics use proper Proof.context instead of historic types
1850 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
1851 operate directly on Proof.context. Raw type claset retains its use as
1852 snapshot of the classical context, which can be recovered via
1853 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
1854 INCOMPATIBILITY, classical tactics and derived proof methods require
1855 proper Proof.context.
1860 * Discontinued support for Poly/ML 5.2, which was the last version
1861 without proper multithreading and TimeLimit implementation.
1863 * Discontinued old lib/scripts/polyml-platform, which has been
1864 obsolete since Isabelle2009-2.
1866 * Various optional external tools are referenced more robustly and
1867 uniformly by explicit Isabelle settings as follows:
1869 ISABELLE_CSDP (formerly CSDP_EXE)
1870 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
1871 ISABELLE_OCAML (formerly EXEC_OCAML)
1872 ISABELLE_SWIPL (formerly EXEC_SWIPL)
1873 ISABELLE_YAP (formerly EXEC_YAP)
1875 Note that automated detection from the file-system or search path has
1876 been discontinued. INCOMPATIBILITY.
1878 * Scala layer provides JVM method invocation service for static
1879 methods of type (String)String, see Invoke_Scala.method in ML. For
1882 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
1884 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
1885 this allows to pass structured values between ML and Scala.
1887 * The IsabelleText fonts includes some further glyphs to support the
1888 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
1889 installed a local copy (which is normally *not* required) need to
1890 delete or update it from ~~/lib/fonts/.
1894 New in Isabelle2011 (January 2011)
1895 ----------------------------------
1899 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
1900 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
1901 useful tooltips and hyperlinks produced from its static analysis. The
1902 bundled component provides an executable Isabelle tool that can be run
1905 Isabelle2011/bin/isabelle jedit
1907 * Significantly improved Isabelle/Isar implementation manual.
1909 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
1910 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
1911 while the default heap location within that directory lacks that extra
1912 suffix. This isolates multiple Isabelle installations from each
1913 other, avoiding problems with old settings in new versions.
1914 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
1916 * Source files are always encoded as UTF-8, instead of old-fashioned
1917 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
1918 the following package declarations:
1920 \usepackage[utf8]{inputenc}
1921 \usepackage{textcomp}
1923 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
1924 a Unicode character is treated as a single symbol, not a sequence of
1925 non-ASCII bytes as before. Since Isabelle/ML string literals may
1926 contain symbols without further backslash escapes, Unicode can now be
1927 used here as well. Recall that Symbol.explode in ML provides a
1928 consistent view on symbols, while raw explode (or String.explode)
1929 merely give a byte-oriented representation.
1931 * Theory loader: source files are primarily located via the master
1932 directory of each theory node (where the .thy file itself resides).
1933 The global load path is still partially available as legacy feature.
1934 Minor INCOMPATIBILITY due to subtle change in file lookup: use
1935 explicit paths, relatively to the theory.
1937 * Special treatment of ML file names has been discontinued.
1938 Historically, optional extensions .ML or .sml were added on demand --
1939 at the cost of clarity of file dependencies. Recall that Isabelle/ML
1940 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
1942 * Various options that affect pretty printing etc. are now properly
1943 handled within the context via configuration options, instead of
1944 unsynchronized references or print modes. There are both ML Config.T
1945 entities and Isar declaration attributes to access these.
1947 ML (Config.T) Isar (attribute)
1949 eta_contract eta_contract
1950 show_brackets show_brackets
1951 show_sorts show_sorts
1952 show_types show_types
1953 show_question_marks show_question_marks
1954 show_consts show_consts
1955 show_abbrevs show_abbrevs
1957 Syntax.ast_trace syntax_ast_trace
1958 Syntax.ast_stat syntax_ast_stat
1959 Syntax.ambiguity_level syntax_ambiguity_level
1961 Goal_Display.goals_limit goals_limit
1962 Goal_Display.show_main_goal show_main_goal
1964 Method.rule_trace rule_trace
1966 Thy_Output.display thy_output_display
1967 Thy_Output.quotes thy_output_quotes
1968 Thy_Output.indent thy_output_indent
1969 Thy_Output.source thy_output_source
1970 Thy_Output.break thy_output_break
1972 Note that corresponding "..._default" references in ML may only be
1973 changed globally at the ROOT session setup, but *not* within a theory.
1974 The option "show_abbrevs" supersedes the former print mode
1975 "no_abbrevs" with inverted meaning.
1977 * More systematic naming of some configuration options.
1980 trace_simp ~> simp_trace
1981 debug_simp ~> simp_debug
1983 * Support for real valued configuration options, using simplistic
1984 floating-point notation that coincides with the inner syntax for
1987 * Support for real valued preferences (with approximative PGIP type):
1988 front-ends need to accept "pgint" values in float notation.
1991 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
1994 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
1999 * Command 'type_synonym' (with single argument) replaces somewhat
2000 outdated 'types', which is still available as legacy feature for some
2003 * Command 'nonterminal' (with 'and' separated list of arguments)
2004 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
2006 * Command 'notepad' replaces former 'example_proof' for
2007 experimentation in Isar without any result. INCOMPATIBILITY.
2009 * Locale interpretation commands 'interpret' and 'sublocale' accept
2010 lists of equations to map definitions in a locale to appropriate
2011 entities in the context of the interpretation. The 'interpretation'
2012 command already provided this functionality.
2014 * Diagnostic command 'print_dependencies' prints the locale instances
2015 that would be activated if the specified expression was interpreted in
2016 the current context. Variant "print_dependencies!" assumes a context
2017 without interpretations.
2019 * Diagnostic command 'print_interps' prints interpretations in proofs
2020 in addition to interpretations in theories.
2022 * Discontinued obsolete 'global' and 'local' commands to manipulate
2023 the theory name space. Rare INCOMPATIBILITY. The ML functions
2024 Sign.root_path and Sign.local_path may be applied directly where this
2025 feature is still required for historical reasons.
2027 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
2028 'definition' instead.
2030 * The "prems" fact, which refers to the accidental collection of
2031 foundational premises in the context, is now explicitly marked as
2032 legacy feature and will be discontinued soon. Consider using "assms"
2033 of the head statement or reference facts by explicit names.
2035 * Document antiquotations @{class} and @{type} print classes and type
2038 * Document antiquotation @{file} checks file/directory entries within
2039 the local file system.
2044 * Coercive subtyping: functions can be declared as coercions and type
2045 inference will add them as necessary upon input of a term. Theory
2046 Complex_Main declares real :: nat => real and real :: int => real as
2047 coercions. A coercion function f is declared like this:
2049 declare [[coercion f]]
2051 To lift coercions through type constructors (e.g. from nat => real to
2052 nat list => real list), map functions can be declared, e.g.
2054 declare [[coercion_map map]]
2056 Currently coercion inference is activated only in theories including
2057 real numbers, i.e. descendants of Complex_Main. This is controlled by
2058 the configuration option "coercion_enabled", e.g. it can be enabled in
2059 other theories like this:
2061 declare [[coercion_enabled]]
2063 * Command 'partial_function' provides basic support for recursive
2064 function definitions over complete partial orders. Concrete instances
2065 are provided for i) the option type, ii) tail recursion on arbitrary
2066 types, and iii) the heap monad of Imperative_HOL. See
2067 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
2070 * Function package: f.psimps rules are no longer implicitly declared
2071 as [simp]. INCOMPATIBILITY.
2073 * Datatype package: theorems generated for executable equality (class
2074 "eq") carry proper names and are treated as default code equations.
2076 * Inductive package: now offers command 'inductive_simps' to
2077 automatically derive instantiated and simplified equations for
2078 inductive predicates, similar to 'inductive_cases'.
2080 * Command 'enriched_type' allows to register properties of the
2081 functorial structure of types.
2083 * Improved infrastructure for term evaluation using code generator
2084 techniques, in particular static evaluation conversions.
2086 * Code generator: Scala (2.8 or higher) has been added to the target
2089 * Code generator: globbing constant expressions "*" and "Theory.*"
2090 have been replaced by the more idiomatic "_" and "Theory._".
2093 * Code generator: export_code without explicit file declaration prints
2094 to standard output. INCOMPATIBILITY.
2096 * Code generator: do not print function definitions for case
2097 combinators any longer.
2099 * Code generator: simplification with rules determined with
2100 src/Tools/Code/code_simp.ML and method "code_simp".
2102 * Code generator for records: more idiomatic representation of record
2103 types. Warning: records are not covered by ancient SML code
2104 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
2105 rep_datatype declaration helps to succeed then:
2109 rep_datatype foo_ext ...
2111 * Records: logical foundation type for records does not carry a
2112 '_type' suffix any longer (obsolete due to authentic syntax).
2115 * Quickcheck now by default uses exhaustive testing instead of random
2116 testing. Random testing can be invoked by "quickcheck [random]",
2117 exhaustive testing by "quickcheck [exhaustive]".
2119 * Quickcheck instantiates polymorphic types with small finite
2120 datatypes by default. This enables a simple execution mechanism to
2121 handle quantifiers and function equality over the finite datatypes.
2123 * Quickcheck random generator has been renamed from "code" to
2124 "random". INCOMPATIBILITY.
2126 * Quickcheck now has a configurable time limit which is set to 30
2127 seconds by default. This can be changed by adding [timeout = n] to the
2128 quickcheck command. The time limit for Auto Quickcheck is still set
2131 * Quickcheck in locales considers interpretations of that locale for
2132 counter example search.
2135 - Added "smt" and "remote_smt" provers based on the "smt" proof
2136 method. See the Sledgehammer manual for details ("isabelle doc
2139 sledgehammer atp_info ~> sledgehammer running_provers
2140 sledgehammer atp_kill ~> sledgehammer kill_provers
2141 sledgehammer available_atps ~> sledgehammer available_provers
2144 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
2145 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
2146 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
2147 (and "ms" and "min" are no longer supported)
2152 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
2153 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
2155 - Added support for partial quotient types.
2156 - Added local versions of the "Nitpick.register_xxx" functions.
2157 - Added "whack" option.
2158 - Allow registration of quotient types as codatatypes.
2159 - Improved "merge_type_vars" option to merge more types.
2160 - Removed unsound "fast_descrs" option.
2161 - Added custom symmetry breaking for datatypes, making it possible to reach
2162 higher cardinalities.
2163 - Prevent the expansion of too large definitions.
2165 * Proof methods "metis" and "meson" now have configuration options
2166 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
2167 to diagnose these tools. E.g.
2169 using [[metis_trace = true]]
2171 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
2172 manually as command 'solve_direct'.
2174 * The default SMT solver Z3 must be enabled explicitly (due to
2175 licensing issues) by setting the environment variable
2176 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
2177 commercial applications, the SMT solver CVC3 is provided as fall-back;
2178 changing the SMT solver is done via the configuration option
2181 * Remote SMT solvers need to be referred to by the "remote_" prefix,
2182 i.e. "remote_cvc3" and "remote_z3".
2184 * Added basic SMT support for datatypes, records, and typedefs using
2185 the oracle mode (no proofs). Direct support of pairs has been dropped
2186 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
2187 support for a similar behavior). Minor INCOMPATIBILITY.
2189 * Changed SMT configuration options:
2191 z3_proofs ~> smt_oracle (with inverted meaning)
2192 z3_trace_assms ~> smt_trace_used_facts
2205 * Boogie output files (.b2i files) need to be declared in the theory
2208 * Simplification procedure "list_to_set_comprehension" rewrites list
2209 comprehensions applied to List.set to set comprehensions. Occasional
2210 INCOMPATIBILITY, may be deactivated like this:
2212 declare [[simproc del: list_to_set_comprehension]]
2214 * Removed old version of primrec package. INCOMPATIBILITY.
2216 * Removed simplifier congruence rule of "prod_case", as has for long
2217 been the case with "split". INCOMPATIBILITY.
2219 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
2221 * Removed [split_format ... and ... and ...] version of
2222 [split_format]. Potential INCOMPATIBILITY.
2224 * Predicate "sorted" now defined inductively, with nice induction
2225 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
2227 * Constant "contents" renamed to "the_elem", to free the generic name
2228 contents for other uses. INCOMPATIBILITY.
2230 * Renamed class eq and constant eq (for code generation) to class
2231 equal and constant equal, plus renaming of related facts and various
2232 tuning. INCOMPATIBILITY.
2234 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
2236 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
2239 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
2240 avoid confusion with finite sets. INCOMPATIBILITY.
2242 * Abandoned locales equiv, congruent and congruent2 for equivalence
2243 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
2246 * Some previously unqualified names have been qualified:
2253 Trueprop ~> HOL.Trueprop
2258 op --> ~> HOL.implies
2270 Pair ~> Product_Type.Pair
2271 fst ~> Product_Type.fst
2272 snd ~> Product_Type.snd
2273 curry ~> Product_Type.curry
2275 Collect ~> Set.Collect
2279 * More canonical naming convention for some fundamental definitions:
2281 bot_bool_eq ~> bot_bool_def
2282 top_bool_eq ~> top_bool_def
2283 inf_bool_eq ~> inf_bool_def
2284 sup_bool_eq ~> sup_bool_def
2285 bot_fun_eq ~> bot_fun_def
2286 top_fun_eq ~> top_fun_def
2287 inf_fun_eq ~> inf_fun_def
2288 sup_fun_eq ~> sup_fun_def
2292 * More stylized fact names:
2294 expand_fun_eq ~> fun_eq_iff
2295 expand_set_eq ~> set_eq_iff
2297 nat_number ~> eval_nat_numeral
2301 * Refactoring of code-generation specific operations in theory List:
2307 mem_iff ~> member_def
2308 null_empty ~> null_def
2310 INCOMPATIBILITY. Note that these were not supposed to be used
2311 regularly unless for striking reasons; their main purpose was code
2314 Various operations from the Haskell prelude are used for generating
2317 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
2318 "surj f" is now an abbreviation of "range f = UNIV". The theorems
2319 bij_def and surj_def are unchanged. INCOMPATIBILITY.
2321 * Abolished some non-alphabetic type names: "prod" and "sum" replace
2322 "*" and "+" respectively. INCOMPATIBILITY.
2324 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
2325 "Sum_Type.Plus" instead.
2327 * Constant "split" has been merged with constant "prod_case"; names of
2328 ML functions, facts etc. involving split have been retained so far,
2329 though. INCOMPATIBILITY.
2331 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
2332 instead. INCOMPATIBILITY.
2334 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
2337 * Former theory Library/Enum is now part of the HOL-Main image.
2338 INCOMPATIBILITY: all constants of the Enum theory now have to be
2339 referred to by its qualified name.
2342 nlists ~> Enum.nlists
2343 product ~> Enum.product
2345 * Theory Library/Monad_Syntax provides do-syntax for monad types.
2346 Syntax in Library/State_Monad has been changed to avoid ambiguities.
2349 * Theory Library/SetsAndFunctions has been split into
2350 Library/Function_Algebras and Library/Set_Algebras; canonical names
2351 for instance definitions for functions; various improvements.
2354 * Theory Library/Multiset provides stable quicksort implementation of
2357 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
2360 * Session Multivariate_Analysis: introduced a type class for euclidean
2361 space. Most theorems are now stated in terms of euclidean spaces
2362 instead of finite cartesian products.
2365 real ^ 'n ~> 'a::real_vector
2366 ~> 'a::euclidean_space
2367 ~> 'a::ordered_euclidean_space
2368 (depends on your needs)
2372 \<chi> x. _ ~> \<chi>\<chi> x. _
2375 Also note that the indices are now natural numbers and not from some
2376 finite type. Finite cartesian products of euclidean spaces, products
2377 of euclidean spaces the real and complex numbers are instantiated to
2378 be euclidean_spaces. INCOMPATIBILITY.
2380 * Session Probability: introduced pextreal as positive extended real
2381 numbers. Use pextreal as value for measures. Introduce the
2382 Radon-Nikodym derivative, product spaces and Fubini's theorem for
2383 arbitrary sigma finite measures. Introduces Lebesgue measure based on
2384 the integral in Multivariate Analysis. INCOMPATIBILITY.
2386 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
2389 * Session SPARK (with image HOL-SPARK) provides commands to load and
2390 prove verification conditions generated by the SPARK Ada program
2391 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
2396 * Theorems for additive ring operations (locale abelian_monoid and
2397 descendants) are generated by interpretation from their multiplicative
2398 counterparts. Names (in particular theorem names) have the mandatory
2399 qualifier 'add'. Previous theorem names are redeclared for
2402 * Structure "int_ring" is now an abbreviation (previously a
2403 definition). This fits more natural with advanced interpretations.
2408 * The domain package now runs in definitional mode by default: The
2409 former command 'new_domain' is now called 'domain'. To use the domain
2410 package in its original axiomatic mode, use 'domain (unsafe)'.
2413 * The new class "domain" is now the default sort. Class "predomain"
2414 is an unpointed version of "domain". Theories can be updated by
2415 replacing sort annotations as shown below. INCOMPATIBILITY.
2417 'a::type ~> 'a::countable
2418 'a::cpo ~> 'a::predomain
2419 'a::pcpo ~> 'a::domain
2421 * The old type class "rep" has been superseded by class "domain".
2422 Accordingly, users of the definitional package must remove any
2423 "default_sort rep" declarations. INCOMPATIBILITY.
2425 * The domain package (definitional mode) now supports unpointed
2426 predomain argument types, as long as they are marked 'lazy'. (Strict
2427 arguments must be in class "domain".) For example, the following
2428 domain definition now works:
2430 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
2432 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
2433 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
2434 'a option, and 'a list. Additionally, it configures fixrec and the
2435 domain package to work with these types. For example:
2437 fixrec isInl :: "('a + 'b) u -> tr"
2438 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
2440 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
2442 * The "(permissive)" option of fixrec has been replaced with a
2443 per-equation "(unchecked)" option. See
2444 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
2446 * The "bifinite" class no longer fixes a constant "approx"; the class
2447 now just asserts that such a function exists. INCOMPATIBILITY.
2449 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
2450 defines an embedding of type 'a defl into udom by default; instances
2451 of "bifinite" and "domain" classes are available in
2452 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
2454 * The syntax "REP('a)" has been replaced with "DEFL('a)".
2456 * The predicate "directed" has been removed. INCOMPATIBILITY.
2458 * The type class "finite_po" has been removed. INCOMPATIBILITY.
2460 * The function "cprod_map" has been renamed to "prod_map".
2463 * The monadic bind operator on each powerdomain has new binder syntax
2464 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
2465 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
2467 * The infix syntax for binary union on each powerdomain has changed
2468 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
2469 syntax. INCOMPATIBILITY.
2471 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
2472 still supported as an input translation.
2474 * Renamed some theorems (the original names are also still available).
2476 expand_fun_below ~> fun_below_iff
2477 below_fun_ext ~> fun_belowI
2478 expand_cfun_eq ~> cfun_eq_iff
2479 ext_cfun ~> cfun_eqI
2480 expand_cfun_below ~> cfun_below_iff
2481 below_cfun_ext ~> cfun_belowI
2482 cont2cont_Rep_CFun ~> cont2cont_APP
2484 * The Abs and Rep functions for various types have changed names.
2485 Related theorem names have also changed to match. INCOMPATIBILITY.
2487 Rep_CFun ~> Rep_cfun
2488 Abs_CFun ~> Abs_cfun
2489 Rep_Sprod ~> Rep_sprod
2490 Abs_Sprod ~> Abs_sprod
2491 Rep_Ssum ~> Rep_ssum
2492 Abs_Ssum ~> Abs_ssum
2494 * Lemmas with names of the form *_defined_iff or *_strict_iff have
2495 been renamed to *_bottom_iff. INCOMPATIBILITY.
2497 * Various changes to bisimulation/coinduction with domain package:
2499 - Definitions of "bisim" constants no longer mention definedness.
2500 - With mutual recursion, "bisim" predicate is now curried.
2501 - With mutual recursion, each type gets a separate coind theorem.
2502 - Variable names in bisim_def and coinduct rules have changed.
2506 * Case combinators generated by the domain package for type "foo" are
2507 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
2509 * Several theorems have been renamed to more accurately reflect the
2510 names of constants and types involved. INCOMPATIBILITY.
2512 thelub_const ~> lub_const
2513 lub_const ~> is_lub_const
2515 is_lub_lub ~> is_lubD2
2517 unique_lub ~> is_lub_unique
2518 is_ub_lub ~> is_lub_rangeD1
2519 lub_bin_chain ~> is_lub_bin_chain
2520 lub_fun ~> is_lub_fun
2521 thelub_fun ~> lub_fun
2522 thelub_cfun ~> lub_cfun
2523 thelub_Pair ~> lub_Pair
2524 lub_cprod ~> is_lub_prod
2525 thelub_cprod ~> lub_prod
2526 minimal_cprod ~> minimal_prod
2527 inst_cprod_pcpo ~> inst_prod_pcpo
2529 compact_UU ~> compact_bottom
2530 deflation_UU ~> deflation_bottom
2531 finite_deflation_UU ~> finite_deflation_bottom
2533 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
2535 sq_ord_less_eq_trans ~> below_eq_trans
2536 sq_ord_eq_less_trans ~> eq_below_trans
2537 refl_less ~> below_refl
2538 trans_less ~> below_trans
2539 antisym_less ~> below_antisym
2540 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
2541 box_less ~> box_below
2542 rev_trans_less ~> rev_below_trans
2543 not_less2not_eq ~> not_below2not_eq
2544 less_UU_iff ~> below_UU_iff
2545 flat_less_iff ~> flat_below_iff
2546 adm_less ~> adm_below
2547 adm_not_less ~> adm_not_below
2548 adm_compact_not_less ~> adm_compact_not_below
2549 less_fun_def ~> below_fun_def
2550 expand_fun_less ~> fun_below_iff
2551 less_fun_ext ~> fun_belowI
2552 less_discr_def ~> below_discr_def
2553 discr_less_eq ~> discr_below_eq
2554 less_unit_def ~> below_unit_def
2555 less_cprod_def ~> below_prod_def
2556 prod_lessI ~> prod_belowI
2557 Pair_less_iff ~> Pair_below_iff
2558 fst_less_iff ~> fst_below_iff
2559 snd_less_iff ~> snd_below_iff
2560 expand_cfun_less ~> cfun_below_iff
2561 less_cfun_ext ~> cfun_belowI
2562 injection_less ~> injection_below
2563 less_up_def ~> below_up_def
2564 not_Iup_less ~> not_Iup_below
2565 Iup_less ~> Iup_below
2567 Def_inject_less_eq ~> Def_below_Def
2568 Def_less_is_eq ~> Def_below_iff
2569 spair_less_iff ~> spair_below_iff
2570 less_sprod ~> below_sprod
2571 spair_less ~> spair_below
2572 sfst_less_iff ~> sfst_below_iff
2573 ssnd_less_iff ~> ssnd_below_iff
2574 fix_least_less ~> fix_least_below
2575 dist_less_one ~> dist_below_one
2576 less_ONE ~> below_ONE
2577 ONE_less_iff ~> ONE_below_iff
2578 less_sinlD ~> below_sinlD
2579 less_sinrD ~> below_sinrD
2584 * All constant names are now qualified internally and use proper
2585 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
2590 * Antiquotation @{assert} inlines a function bool -> unit that raises
2591 Fail if the argument is false. Due to inlining the source position of
2592 failed assertions is included in the error output.
2594 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
2595 text is in practice always evaluated with a stable theory checkpoint.
2596 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
2598 * Antiquotation @{theory A} refers to theory A from the ancestry of
2599 the current context, not any accidental theory loader state as before.
2600 Potential INCOMPATIBILITY, subtle change in semantics.
2602 * Syntax.pretty_priority (default 0) configures the required priority
2603 of pretty-printed output and thus affects insertion of parentheses.
2605 * Syntax.default_root (default "any") configures the inner syntax
2606 category (nonterminal symbol) for parsing of terms.
2608 * Former exception Library.UnequalLengths now coincides with
2609 ListPair.UnequalLengths.
2611 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
2612 main functionality is provided by structure Simplifier.
2614 * Renamed raw "explode" function to "raw_explode" to emphasize its
2615 meaning. Note that internally to Isabelle, Symbol.explode is used in
2616 almost all situations.
2618 * Discontinued obsolete function sys_error and exception SYS_ERROR.
2619 See implementation manual for further details on exceptions in
2622 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
2625 * Renamed structure PureThy to Pure_Thy and moved most of its
2626 operations to structure Global_Theory, to emphasize that this is
2627 rarely-used global-only stuff.
2629 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
2630 instead (or tracing for high-volume output).
2632 * Configuration option show_question_marks only affects regular pretty
2633 printing of types and terms, not raw Term.string_of_vname.
2635 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
2636 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
2637 @{thms} for most purposes.
2639 * ML structure Unsynchronized is never opened, not even in Isar
2640 interaction mode as before. Old Unsynchronized.set etc. have been
2641 discontinued -- use plain := instead. This should be *rare* anyway,
2642 since modern tools always work via official context data, notably
2643 configuration options.
2645 * Parallel and asynchronous execution requires special care concerning
2646 interrupts. Structure Exn provides some convenience functions that
2647 avoid working directly with raw Interrupt. User code must not absorb
2648 interrupts -- intermediate handling (for cleanup etc.) needs to be
2649 followed by re-raising of the original exception. Another common
2650 source of mistakes are "handle _" patterns, which make the meaning of
2651 the program subject to physical effects of the environment.
2655 New in Isabelle2009-2 (June 2010)
2656 ---------------------------------
2660 * Authentic syntax for *all* logical entities (type classes, type
2661 constructors, term constants): provides simple and robust
2662 correspondence between formal entities and concrete syntax. Within
2663 the parse tree / AST representations, "constants" are decorated by
2664 their category (class, type, const) and spelled out explicitly with
2665 their full internal name.
2667 Substantial INCOMPATIBILITY concerning low-level syntax declarations
2668 and translations (translation rules and translation functions in ML).
2669 Some hints on upgrading:
2671 - Many existing uses of 'syntax' and 'translations' can be replaced
2672 by more modern 'type_notation', 'notation' and 'abbreviation',
2673 which are independent of this issue.
2675 - 'translations' require markup within the AST; the term syntax
2676 provides the following special forms:
2678 CONST c -- produces syntax version of constant c from context
2679 XCONST c -- literally c, checked as constant from context
2680 c -- literally c, if declared by 'syntax'
2682 Plain identifiers are treated as AST variables -- occasionally the
2683 system indicates accidental variables via the error "rhs contains
2686 Type classes and type constructors are marked according to their
2687 concrete syntax. Some old translations rules need to be written
2688 for the "type" category, using type constructor application
2689 instead of pseudo-term application of the default category
2692 - 'parse_translation' etc. in ML may use the following
2695 @{class_syntax c} -- type class c within parse tree / AST
2696 @{term_syntax c} -- type constructor c within parse tree / AST
2697 @{const_syntax c} -- ML version of "CONST c" above
2698 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
2700 - Literal types within 'typed_print_translations', i.e. those *not*
2701 represented as pseudo-terms are represented verbatim. Use @{class
2702 c} or @{type_name c} here instead of the above syntax
2705 Note that old non-authentic syntax was based on unqualified base
2706 names, so all of the above "constant" names would coincide. Recall
2707 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
2708 diagnose syntax problems.
2710 * Type constructors admit general mixfix syntax, not just infix.
2712 * Concrete syntax may be attached to local entities without a proof
2713 body, too. This works via regular mixfix annotations for 'fix',
2714 'def', 'obtain' etc. or via the explicit 'write' command, which is
2715 similar to the 'notation' command in theory specifications.
2717 * Discontinued unnamed infix syntax (legacy feature for many years) --
2718 need to specify constant name and syntax separately. Internal ML
2719 datatype constructors have been renamed from InfixName to Infix etc.
2720 Minor INCOMPATIBILITY.
2722 * Schematic theorem statements need to be explicitly markup as such,
2723 via commands 'schematic_lemma', 'schematic_theorem',
2724 'schematic_corollary'. Thus the relevance of the proof is made
2725 syntactically clear, which impacts performance in a parallel or
2726 asynchronous interactive environment. Minor INCOMPATIBILITY.
2728 * Use of cumulative prems via "!" in some proof methods has been
2729 discontinued (old legacy feature).
2731 * References 'trace_simp' and 'debug_simp' have been replaced by
2732 configuration options stored in the context. Enabling tracing (the
2733 case of debugging is similar) in proofs works via
2735 using [[trace_simp = true]]
2737 Tracing is then active for all invocations of the simplifier in
2738 subsequent goal refinement steps. Tracing may also still be enabled or
2739 disabled via the ProofGeneral settings menu.
2741 * Separate commands 'hide_class', 'hide_type', 'hide_const',
2742 'hide_fact' replace the former 'hide' KIND command. Minor
2745 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
2746 more efficient than combinations with -q1 or -q2.
2751 * Proofterms record type-class reasoning explicitly, using the
2752 "unconstrain" operation internally. This eliminates all sort
2753 constraints from a theorem and proof, introducing explicit
2754 OFCLASS-premises. On the proof term level, this operation is
2755 automatically applied at theorem boundaries, such that closed proofs
2756 are always free of sort constraints. INCOMPATIBILITY for tools that
2757 inspect proof terms.
2759 * Local theory specifications may depend on extra type variables that
2760 are not present in the result type -- arguments TYPE('a) :: 'a itself
2761 are added internally. For example:
2763 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
2765 * Predicates of locales introduced by classes carry a mandatory
2766 "class" prefix. INCOMPATIBILITY.
2768 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
2770 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
2773 * Command 'code_reflect' allows to incorporate generated ML code into
2774 runtime environment; replaces immature code_datatype antiquotation.
2777 * Code generator: simple concept for abstract datatypes obeying
2780 * Code generator: details of internal data cache have no impact on the
2781 user space functionality any longer.
2783 * Methods "unfold_locales" and "intro_locales" ignore non-locale
2784 subgoals. This is more appropriate for interpretations with 'where'.
2787 * Command 'example_proof' opens an empty proof body. This allows to
2788 experiment with Isar, without producing any persistent result.
2790 * Commands 'type_notation' and 'no_type_notation' declare type syntax
2791 within a local theory context, with explicit checking of the
2792 constructors involved (in contrast to the raw 'syntax' versions).
2794 * Commands 'types' and 'typedecl' now work within a local theory
2795 context -- without introducing dependencies on parameters or
2796 assumptions, which is not possible in Isabelle/Pure.
2798 * Command 'defaultsort' has been renamed to 'default_sort', it works
2799 within a local theory context. Minor INCOMPATIBILITY.
2804 * Command 'typedef' now works within a local theory context -- without
2805 introducing dependencies on parameters or assumptions, which is not
2806 possible in Isabelle/Pure/HOL. Note that the logical environment may
2807 contain multiple interpretations of local typedefs (with different
2808 non-emptiness proofs), even in a global theory context.
2810 * New package for quotient types. Commands 'quotient_type' and
2811 'quotient_definition' may be used for defining types and constants by
2812 quotient constructions. An example is the type of integers created by
2813 quotienting pairs of natural numbers:
2816 intrel :: "(nat * nat) => (nat * nat) => bool"
2818 "intrel (x, y) (u, v) = (x + v = u + y)"
2820 quotient_type int = "nat * nat" / intrel
2821 by (auto simp add: equivp_def expand_fun_eq)
2824 "0::int" is "(0::nat, 0::nat)"
2826 The method "lifting" can be used to lift of theorems from the
2827 underlying "raw" type to the quotient type. The example
2828 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
2829 construction and provides a reasoning infrastructure for finite sets.
2831 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
2832 clash with new theory Quotient in Main HOL.
2834 * Moved the SMT binding into the main HOL session, eliminating
2835 separate HOL-SMT session.
2837 * List membership infix mem operation is only an input abbreviation.
2840 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
2841 for future developements; former Library/Word.thy is still present in
2842 the AFP entry RSAPPS.
2844 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
2845 longer shadowed. INCOMPATIBILITY.
2847 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
2850 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
2853 * Dropped normalizing_semiring etc; use the facts in semiring classes
2854 instead. INCOMPATIBILITY.
2856 * Dropped several real-specific versions of lemmas about floor and
2857 ceiling; use the generic lemmas from theory "Archimedean_Field"
2858 instead. INCOMPATIBILITY.
2860 floor_number_of_eq ~> floor_number_of
2861 le_floor_eq_number_of ~> number_of_le_floor
2862 le_floor_eq_zero ~> zero_le_floor
2863 le_floor_eq_one ~> one_le_floor
2864 floor_less_eq_number_of ~> floor_less_number_of
2865 floor_less_eq_zero ~> floor_less_zero
2866 floor_less_eq_one ~> floor_less_one
2867 less_floor_eq_number_of ~> number_of_less_floor
2868 less_floor_eq_zero ~> zero_less_floor
2869 less_floor_eq_one ~> one_less_floor
2870 floor_le_eq_number_of ~> floor_le_number_of
2871 floor_le_eq_zero ~> floor_le_zero
2872 floor_le_eq_one ~> floor_le_one
2873 floor_subtract_number_of ~> floor_diff_number_of
2874 floor_subtract_one ~> floor_diff_one
2875 ceiling_number_of_eq ~> ceiling_number_of
2876 ceiling_le_eq_number_of ~> ceiling_le_number_of
2877 ceiling_le_zero_eq ~> ceiling_le_zero
2878 ceiling_le_eq_one ~> ceiling_le_one
2879 less_ceiling_eq_number_of ~> number_of_less_ceiling
2880 less_ceiling_eq_zero ~> zero_less_ceiling
2881 less_ceiling_eq_one ~> one_less_ceiling
2882 ceiling_less_eq_number_of ~> ceiling_less_number_of
2883 ceiling_less_eq_zero ~> ceiling_less_zero
2884 ceiling_less_eq_one ~> ceiling_less_one
2885 le_ceiling_eq_number_of ~> number_of_le_ceiling
2886 le_ceiling_eq_zero ~> zero_le_ceiling
2887 le_ceiling_eq_one ~> one_le_ceiling
2888 ceiling_subtract_number_of ~> ceiling_diff_number_of
2889 ceiling_subtract_one ~> ceiling_diff_one
2891 * Theory "Finite_Set": various folding_XXX locales facilitate the
2892 application of the various fold combinators on finite sets.
2894 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
2895 provides abstract red-black tree type which is backed by "RBT_Impl" as
2896 implementation. INCOMPATIBILTY.
2898 * Theory Library/Coinductive_List has been removed -- superseded by
2899 AFP/thys/Coinductive.
2901 * Theory PReal, including the type "preal" and related operations, has
2902 been removed. INCOMPATIBILITY.
2904 * Real: new development using Cauchy Sequences.
2906 * Split off theory "Big_Operators" containing setsum, setprod,
2907 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
2909 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
2910 "Int" etc. INCOMPATIBILITY.
2912 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
2914 * New set of rules "ac_simps" provides combined assoc / commute
2915 rewrites for all interpretations of the appropriate generic locales.
2917 * Renamed theory "OrderedGroup" to "Groups" and split theory
2918 "Ring_and_Field" into theories "Rings" and "Fields"; for more
2919 appropriate and more consistent names suitable for name prefixes
2920 within the HOL theories. INCOMPATIBILITY.
2922 * Some generic constants have been put to appropriate theories:
2923 - less_eq, less: Orderings
2924 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
2925 - inverse, divide: Rings
2928 * More consistent naming of type classes involving orderings (and
2931 lower_semilattice ~> semilattice_inf
2932 upper_semilattice ~> semilattice_sup
2934 dense_linear_order ~> dense_linorder
2936 pordered_ab_group_add ~> ordered_ab_group_add
2937 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
2938 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
2939 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
2940 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
2941 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
2942 pordered_cancel_semiring ~> ordered_cancel_semiring
2943 pordered_comm_monoid_add ~> ordered_comm_monoid_add
2944 pordered_comm_ring ~> ordered_comm_ring
2945 pordered_comm_semiring ~> ordered_comm_semiring
2946 pordered_ring ~> ordered_ring
2947 pordered_ring_abs ~> ordered_ring_abs
2948 pordered_semiring ~> ordered_semiring
2950 ordered_ab_group_add ~> linordered_ab_group_add
2951 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
2952 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
2953 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
2954 ordered_field ~> linordered_field
2955 ordered_field_no_lb ~> linordered_field_no_lb
2956 ordered_field_no_ub ~> linordered_field_no_ub
2957 ordered_field_dense_linear_order ~> dense_linordered_field
2958 ordered_idom ~> linordered_idom
2959 ordered_ring ~> linordered_ring
2960 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
2961 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
2962 ordered_ring_strict ~> linordered_ring_strict
2963 ordered_semidom ~> linordered_semidom
2964 ordered_semiring ~> linordered_semiring
2965 ordered_semiring_1 ~> linordered_semiring_1
2966 ordered_semiring_1_strict ~> linordered_semiring_1_strict
2967 ordered_semiring_strict ~> linordered_semiring_strict
2969 The following slightly odd type classes have been moved to a
2970 separate theory Library/Lattice_Algebras:
2972 lordered_ab_group_add ~> lattice_ab_group_add
2973 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
2974 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
2975 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
2976 lordered_ring ~> lattice_ring
2980 * Refined field classes:
2981 - classes division_ring_inverse_zero, field_inverse_zero,
2982 linordered_field_inverse_zero include rule inverse 0 = 0 --
2983 subsumes former division_by_zero class;
2984 - numerous lemmas have been ported from field to division_ring.
2987 * Refined algebra theorem collections:
2988 - dropped theorem group group_simps, use algebra_simps instead;
2989 - dropped theorem group ring_simps, use field_simps instead;
2990 - proper theorem collection field_simps subsumes former theorem
2991 groups field_eq_simps and field_simps;
2992 - dropped lemma eq_minus_self_iff which is a duplicate for
2996 * Theory Finite_Set and List: some lemmas have been generalized from
2999 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
3000 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
3001 inter_Inter_fold_inter ~> inf_Inf_fold_inf
3002 union_Union_fold_union ~> sup_Sup_fold_sup
3003 Inter_fold_inter ~> Inf_fold_inf
3004 Union_fold_union ~> Sup_fold_sup
3005 inter_INTER_fold_inter ~> inf_INFI_fold_inf
3006 union_UNION_fold_union ~> sup_SUPR_fold_sup
3007 INTER_fold_inter ~> INFI_fold_inf
3008 UNION_fold_union ~> SUPR_fold_sup
3010 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
3011 replaced by the more convenient lemmas Inf_empty and Sup_empty.
3012 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
3013 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
3014 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
3015 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
3017 * Reorganized theory Multiset: swapped notation of pointwise and
3020 - pointwise ordering is instance of class order with standard syntax
3022 - multiset ordering has syntax <=# and <#; partial order properties
3023 are provided by means of interpretation with prefix
3025 - less duplication, less historical organization of sections,
3026 conversion from associations lists to multisets, rudimentary code
3028 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
3033 multiset_eq_conv_count_eq ~> multiset_ext_iff
3034 multi_count_ext ~> multiset_ext
3035 diff_union_inverse2 ~> diff_union_cancelR
3039 * Theory Permutation: replaced local "remove" by List.remove1.
3041 * Code generation: ML and OCaml code is decorated with signatures.
3043 * Theory List: added transpose.
3045 * Library/Nat_Bijection.thy is a collection of bijective functions
3046 between nat and other types, which supersedes the older libraries
3047 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
3050 Nat_Int_Bij.nat2_to_nat ~> prod_encode
3051 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
3052 Nat_Int_Bij.int_to_nat_bij ~> int_encode
3053 Nat_Int_Bij.nat_to_int_bij ~> int_decode
3054 Countable.pair_encode ~> prod_encode
3055 NatIso.prod2nat ~> prod_encode
3056 NatIso.nat2prod ~> prod_decode
3057 NatIso.sum2nat ~> sum_encode
3058 NatIso.nat2sum ~> sum_decode
3059 NatIso.list2nat ~> list_encode
3060 NatIso.nat2list ~> list_decode
3061 NatIso.set2nat ~> set_encode
3062 NatIso.nat2set ~> set_decode
3065 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
3066 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
3067 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
3068 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
3069 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
3070 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
3071 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
3072 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
3073 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
3074 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
3075 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
3076 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
3077 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
3080 - Renamed ATP commands:
3081 atp_info ~> sledgehammer running_atps
3082 atp_kill ~> sledgehammer kill_atps
3083 atp_messages ~> sledgehammer messages
3084 atp_minimize ~> sledgehammer minimize
3085 print_atps ~> sledgehammer available_atps
3087 - Added user's manual ("isabelle doc sledgehammer").
3088 - Added option syntax and "sledgehammer_params" to customize
3089 Sledgehammer's behavior. See the manual for details.
3090 - Modified the Isar proof reconstruction code so that it produces
3091 direct proofs rather than proofs by contradiction. (This feature
3092 is still experimental.)
3093 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
3095 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
3098 - Added and implemented "binary_ints" and "bits" options.
3099 - Added "std" option and implemented support for nonstandard models.
3100 - Added and implemented "finitize" option to improve the precision
3101 of infinite datatypes based on a monotonicity analysis.
3102 - Added support for quotient types.
3103 - Added support for "specification" and "ax_specification"
3105 - Added support for local definitions (for "function" and
3106 "termination" proofs).
3107 - Added support for term postprocessors.
3108 - Optimized "Multiset.multiset" and "FinFun.finfun".
3109 - Improved efficiency of "destroy_constrs" optimization.
3110 - Fixed soundness bugs related to "destroy_constrs" optimization and
3112 - Fixed soundness bug related to higher-order constructors.
3113 - Fixed soundness bug when "full_descrs" is enabled.
3114 - Improved precision of set constructs.
3115 - Added "atoms" option.
3116 - Added cache to speed up repeated Kodkod invocations on the same
3118 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
3119 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
3120 "SAT4J_Light". INCOMPATIBILITY.
3121 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
3122 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
3123 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
3125 * Method "induct" now takes instantiations of the form t, where t is not
3126 a variable, as a shorthand for "x == t", where x is a fresh variable.
3127 If this is not intended, t has to be enclosed in parentheses.
3128 By default, the equalities generated by definitional instantiations
3129 are pre-simplified, which may cause parameters of inductive cases
3130 to disappear, or may even delete some of the inductive cases.
3131 Use "induct (no_simp)" instead of "induct" to restore the old
3132 behaviour. The (no_simp) option is also understood by the "cases"
3133 and "nominal_induct" methods, which now perform pre-simplification, too.
3139 * Variable names in lemmas generated by the domain package have
3140 changed; the naming scheme is now consistent with the HOL datatype
3141 package. Some proof scripts may be affected, INCOMPATIBILITY.
3143 * The domain package no longer defines the function "foo_copy" for
3144 recursive domain "foo". The reach lemma is now stated directly in
3145 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
3146 be reformulated in terms of "foo_take", INCOMPATIBILITY.
3148 * Most definedness lemmas generated by the domain package (previously
3149 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
3150 like "foo$x = UU <-> x = UU", which works better as a simp rule.
3151 Proofs that used definedness lemmas as intro rules may break,
3152 potential INCOMPATIBILITY.
3154 * Induction and casedist rules generated by the domain package now
3155 declare proper case_names (one called "bottom", and one named for each
3156 constructor). INCOMPATIBILITY.
3158 * For mutually-recursive domains, separate "reach" and "take_lemma"
3159 rules are generated for each domain, INCOMPATIBILITY.
3161 foo_bar.reach ~> foo.reach bar.reach
3162 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
3164 * Some lemmas generated by the domain package have been renamed for
3165 consistency with the datatype package, INCOMPATIBILITY.
3167 foo.ind ~> foo.induct
3168 foo.finite_ind ~> foo.finite_induct
3169 foo.coind ~> foo.coinduct
3170 foo.casedist ~> foo.exhaust
3171 foo.exhaust ~> foo.nchotomy
3173 * For consistency with other definition packages, the fixrec package
3174 now generates qualified theorem names, INCOMPATIBILITY.
3176 foo_simps ~> foo.simps
3177 foo_unfold ~> foo.unfold
3178 foo_induct ~> foo.induct
3180 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
3181 method and internal fixrec proofs now use the default simpset instead.
3184 * The "contlub" predicate has been removed. Proof scripts should use
3185 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
3187 * The "admw" predicate has been removed, INCOMPATIBILITY.
3189 * The constants cpair, cfst, and csnd have been removed in favor of
3190 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
3195 * Antiquotations for basic formal entities:
3197 @{class NAME} -- type class
3198 @{class_syntax NAME} -- syntax representation of the above
3200 @{type_name NAME} -- logical type
3201 @{type_abbrev NAME} -- type abbreviation
3202 @{nonterminal NAME} -- type of concrete syntactic category
3203 @{type_syntax NAME} -- syntax representation of any of the above
3205 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
3206 @{const_abbrev NAME} -- abbreviated constant
3207 @{const_syntax NAME} -- syntax representation of any of the above
3209 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
3210 syntax constant (cf. 'syntax' command).
3212 * Antiquotation @{make_string} inlines a function to print arbitrary
3213 values similar to the ML toplevel. The result is compiler dependent
3214 and may fall back on "?" in certain situations.
3216 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
3217 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
3218 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
3219 not work with the asynchronous Isar document model.
3221 * Configuration options now admit dynamic default values, depending on
3222 the context or even global references.
3224 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
3225 uses an efficient external library if available (for Poly/ML).
3227 * Renamed some important ML structures, while keeping the old names
3228 for some time as aliases within the structure Legacy:
3230 OuterKeyword ~> Keyword
3233 OuterSyntax ~> Outer_Syntax
3234 PrintMode ~> Print_Mode
3235 SpecParse ~> Parse_Spec
3238 ThyOutput ~> Thy_Output
3239 TypeInfer ~> Type_Infer
3241 Note that "open Legacy" simplifies porting of sources, but forgetting
3242 to remove it again will complicate porting again in the future.
3244 * Most operations that refer to a global context are named
3245 accordingly, e.g. Simplifier.global_context or
3246 ProofContext.init_global. There are some situations where a global
3247 context actually works, but under normal circumstances one needs to
3248 pass the proper local context through the code!
3250 * Discontinued old TheoryDataFun with its copy/init operation -- data
3251 needs to be pure. Functor Theory_Data_PP retains the traditional
3252 Pretty.pp argument to merge, which is absent in the standard
3253 Theory_Data version.
3255 * Sorts.certify_sort and derived "cert" operations for types and terms
3256 no longer minimize sorts. Thus certification at the boundary of the
3257 inference kernel becomes invariant under addition of class relations,
3258 which is an important monotonicity principle. Sorts are now minimized
3259 in the syntax layer only, at the boundary between the end-user and the
3260 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
3261 explicitly in rare situations.
3263 * Renamed old-style Drule.standard to Drule.export_without_context, to
3264 emphasize that this is in no way a standard operation.
3267 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
3268 usual for resolution. Rare INCOMPATIBILITY.
3270 * Renamed varify/unvarify operations to varify_global/unvarify_global
3271 to emphasize that these only work in a global situation (which is
3274 * Curried take and drop in library.ML; negative length is interpreted
3275 as infinity (as in chop). Subtle INCOMPATIBILITY.
3277 * Proof terms: type substitutions on proof constants now use canonical
3278 order of type variables. INCOMPATIBILITY for tools working with proof
3281 * Raw axioms/defs may no longer carry sort constraints, and raw defs
3282 may no longer carry premises. User-level specifications are
3283 transformed accordingly by Thm.add_axiom/add_def.
3288 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
3289 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
3290 proof terms are enabled unconditionally in the new HOL-Proofs image.
3292 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
3293 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
3296 * Old lib/scripts/polyml-platform is superseded by the
3297 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
3298 variant, even on a 64 bit machine. The following example setting
3299 prefers 64 bit if available:
3301 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
3303 * The preliminary Isabelle/jEdit application demonstrates the emerging
3304 Isabelle/Scala layer for advanced prover interaction and integration.
3305 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
3308 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
3309 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
3310 similar to the default assignment of the document preparation system
3311 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
3312 provides some operations for direct access to the font without asking
3313 the user for manual installation.
3317 New in Isabelle2009-1 (December 2009)
3318 -------------------------------------
3322 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
3323 one backslash should be used, even in ML sources.
3328 * Locale interpretation propagates mixins along the locale hierarchy.
3329 The currently only available mixins are the equations used to map
3330 local definitions to terms of the target domain of an interpretation.
3332 * Reactivated diagnostic command 'print_interps'. Use "print_interps
3333 loc" to print all interpretations of locale "loc" in the theory.
3334 Interpretations in proofs are not shown.
3336 * Thoroughly revised locales tutorial. New section on conditional
3339 * On instantiation of classes, remaining undefined class parameters
3340 are formally declared. INCOMPATIBILITY.
3343 *** Document preparation ***
3345 * New generalized style concept for printing terms: @{foo (style) ...}
3346 instead of @{foo_style style ...} (old form is still retained for
3347 backward compatibility). Styles can be also applied for
3348 antiquotations prop, term_type and typeof.
3353 * New proof method "smt" for a combination of first-order logic with
3354 equality, linear and nonlinear (natural/integer/real) arithmetic, and
3355 fixed-size bitvectors; there is also basic support for higher-order
3356 features (esp. lambda abstractions). It is an incomplete decision
3357 procedure based on external SMT solvers using the oracle mechanism;
3358 for the SMT solver Z3, this method is proof-producing. Certificates
3359 are provided to avoid calling the external solvers solely for
3360 re-checking proofs. Due to a remote SMT service there is no need for
3361 installing SMT solvers locally. See src/HOL/SMT.
3363 * New commands to load and prove verification conditions generated by
3364 the Boogie program verifier or derived systems (e.g. the Verifying C
3365 Compiler (VCC) or Spec#). See src/HOL/Boogie.
3367 * New counterexample generator tool 'nitpick' based on the Kodkod
3368 relational model finder. See src/HOL/Tools/Nitpick and
3369 src/HOL/Nitpick_Examples.
3371 * New commands 'code_pred' and 'values' to invoke the predicate
3372 compiler and to enumerate values of inductive predicates.
3374 * A tabled implementation of the reflexive transitive closure.
3376 * New implementation of quickcheck uses generic code generator;
3377 default generators are provided for all suitable HOL types, records
3378 and datatypes. Old quickcheck can be re-activated importing theory
3379 Library/SML_Quickcheck.
3381 * New testing tool Mirabelle for automated proof tools. Applies
3382 several tools and tactics like sledgehammer, metis, or quickcheck, to
3383 every proof step in a theory. To be used in batch mode via the
3384 "mirabelle" utility.
3386 * New proof method "sos" (sum of squares) for nonlinear real
3387 arithmetic (originally due to John Harison). It requires theory
3388 Library/Sum_Of_Squares. It is not a complete decision procedure but
3389 works well in practice on quantifier-free real arithmetic with +, -,
3390 *, ^, =, <= and <, i.e. boolean combinations of equalities and
3391 inequalities between polynomials. It makes use of external
3392 semidefinite programming solvers. Method "sos" generates a
3393 certificate that can be pasted into the proof thus avoiding the need
3394 to call an external tool every time the proof is checked. See
3395 src/HOL/Library/Sum_Of_Squares.
3397 * New method "linarith" invokes existing linear arithmetic decision
3400 * New command 'atp_minimal' reduces result produced by Sledgehammer.
3402 * New Sledgehammer option "Full Types" in Proof General settings menu.
3403 Causes full type information to be output to the ATPs. This slows
3404 ATPs down considerably but eliminates a source of unsound "proofs"
3407 * New method "metisFT": A version of metis that uses full type
3408 information in order to avoid failures of proof reconstruction.
3410 * New evaluator "approximate" approximates an real valued term using
3411 the same method as the approximation method.
3413 * Method "approximate" now supports arithmetic expressions as
3414 boundaries of intervals and implements interval splitting and Taylor
3417 * ML antiquotation @{code_datatype} inserts definition of a datatype
3418 generated by the code generator; e.g. see src/HOL/Predicate.thy.
3420 * New theory SupInf of the supremum and infimum operators for sets of
3423 * New theory Probability, which contains a development of measure
3424 theory, eventually leading to Lebesgue integration and probability.
3426 * Extended Multivariate Analysis to include derivation and Brouwer's
3429 * Reorganization of number theory, INCOMPATIBILITY:
3430 - new number theory development for nat and int, in theories Divides
3431 and GCD as well as in new session Number_Theory
3432 - some constants and facts now suffixed with _nat and _int
3434 - former session NumberTheory now named Old_Number_Theory, including
3435 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
3436 - moved theory Pocklington from src/HOL/Library to
3437 src/HOL/Old_Number_Theory
3439 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
3440 lcm of finite and infinite sets. It is shown that they form a complete
3443 * Class semiring_div requires superclass no_zero_divisors and proof of
3444 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
3445 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
3446 generalized to class semiring_div, subsuming former theorems
3447 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
3448 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
3451 * Refinements to lattice classes and sets:
3452 - less default intro/elim rules in locale variant, more default
3453 intro/elim rules in class variant: more uniformity
3454 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
3456 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
3458 - renamed ACI to inf_sup_aci
3459 - new class "boolean_algebra"
3460 - class "complete_lattice" moved to separate theory
3461 "Complete_Lattice"; corresponding constants (and abbreviations)
3462 renamed and with authentic syntax:
3463 Set.Inf ~> Complete_Lattice.Inf
3464 Set.Sup ~> Complete_Lattice.Sup
3465 Set.INFI ~> Complete_Lattice.INFI
3466 Set.SUPR ~> Complete_Lattice.SUPR
3467 Set.Inter ~> Complete_Lattice.Inter
3468 Set.Union ~> Complete_Lattice.Union
3469 Set.INTER ~> Complete_Lattice.INTER
3470 Set.UNION ~> Complete_Lattice.UNION
3471 - authentic syntax for
3474 - mere abbreviations:
3477 Set.inter (for inf, formerly Set.Int)
3478 Set.union (for sup, formerly Set.Un)
3479 Complete_Lattice.Inter (for Inf)
3480 Complete_Lattice.Union (for Sup)
3481 Complete_Lattice.INTER (for INFI)
3482 Complete_Lattice.UNION (for SUPR)
3483 - object-logic definitions as far as appropriate
3485 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
3486 Un_subset_iff are explicitly deleted as default simp rules; then also
3487 their lattice counterparts le_inf_iff and le_sup_iff have to be
3488 deleted to achieve the desired effect.
3490 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
3491 rules by default any longer; the same applies to min_max.inf_absorb1
3492 etc. INCOMPATIBILITY.
3494 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
3495 pred_set_conv by default. INCOMPATIBILITY.
3497 * Power operations on relations and functions are now one dedicated
3498 constant "compow" with infix syntax "^^". Power operation on
3499 multiplicative monoids retains syntax "^" and is now defined generic
3500 in class power. INCOMPATIBILITY.
3502 * Relation composition "R O S" now has a more standard argument order:
3503 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
3504 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
3505 break, since the O_assoc rule was not rewritten like this. Fix using
3506 O_assoc[symmetric]. The same applies to the curried version "R OO S".
3508 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
3509 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
3512 * Most rules produced by inductive and datatype package have mandatory
3513 prefixes. INCOMPATIBILITY.
3515 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
3516 the attribute of the same name. Each of the theorems in the list
3517 DERIV_intros assumes composition with an additional function and
3518 matches a variable to the derivative, which has to be solved by the
3519 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
3520 of most elementary terms. Former Maclauren.DERIV_tac and
3521 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
3524 * Code generator attributes follow the usual underscore convention:
3525 code_unfold replaces code unfold
3526 code_post replaces code post
3531 sizechange -> size_change
3532 induct_scheme -> induction_schema
3535 * Discontinued abbreviation "arbitrary" of constant "undefined".
3536 INCOMPATIBILITY, use "undefined" directly.
3539 Suc_eq_add_numeral_1 -> Suc_eq_plus1
3540 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
3541 Suc_plus1 -> Suc_eq_plus1
3542 *anti_sym -> *antisym*
3543 vector_less_eq_def -> vector_le_def
3546 * Added theorem List.map_map as [simp]. Removed List.map_compose.
3549 * Removed predicate "M hassize n" (<--> card M = n & finite M).
3555 * Theory Representable defines a class "rep" of domains that are
3556 representable (via an ep-pair) in the universal domain type "udom".
3557 Instances are provided for all type constructors defined in HOLCF.
3559 * The 'new_domain' command is a purely definitional version of the
3560 domain package, for representable domains. Syntax is identical to the
3561 old domain package. The 'new_domain' package also supports indirect
3562 recursion using previously-defined type constructors. See
3563 src/HOLCF/ex/New_Domain.thy for examples.
3565 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
3566 on the left-hand side of an equation, and then performs
3567 simplification. Rewriting is done using rules declared with the
3568 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
3569 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
3571 * The pattern-match compiler in 'fixrec' can now handle constructors
3572 with HOL function types. Pattern-match combinators for the Pair
3573 constructor are pre-configured.
3575 * The 'fixrec' package now produces better fixed-point induction rules
3576 for mutually-recursive definitions: Induction rules have conclusions
3577 of the form "P foo bar" instead of "P <foo, bar>".
3579 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
3580 been renamed to "below". The name "below" now replaces "less" in many
3581 theorem names. (Legacy theorem names using "less" are still supported
3584 * The 'fixrec' package now supports "bottom patterns". Bottom
3585 patterns can be used to generate strictness rules, or to make
3586 functions more strict (much like the bang-patterns supported by the
3587 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
3593 * Support for Poly/ML 5.3.0, with improved reporting of compiler
3594 errors and run-time exceptions, including detailed source positions.
3596 * Structure Name_Space (formerly NameSpace) now manages uniquely
3597 identified entries, with some additional information such as source
3598 position, logical grouping etc.
3600 * Theory and context data is now introduced by the simplified and
3601 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
3602 to be pure, but the old TheoryDataFun for mutable data (with explicit
3603 copy operation) is still available for some time.
3605 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
3606 provides a high-level programming interface to synchronized state
3607 variables with atomic update. This works via pure function
3608 application within a critical section -- its runtime should be as
3609 short as possible; beware of deadlocks if critical code is nested,
3610 either directly or indirectly via other synchronized variables!
3612 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
3613 wraps raw ML references, explicitly indicating their non-thread-safe
3614 behaviour. The Isar toplevel keeps this structure open, to
3615 accommodate Proof General as well as quick and dirty interactive
3616 experiments with references.
3618 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
3619 parallel tactical reasoning.
3621 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
3622 are similar to SUBPROOF, but are slightly more flexible: only the
3623 specified parts of the subgoal are imported into the context, and the
3624 body tactic may introduce new subgoals and schematic variables.
3626 * Old tactical METAHYPS, which does not observe the proof context, has
3627 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
3628 or Subgoal.FOCUS etc.
3630 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
3631 functors have their own ML name space there is no point to mark them
3632 separately.) Minor INCOMPATIBILITY.
3634 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
3636 * Renamed several structures FooBar to Foo_Bar. Occasional,
3639 * Operations of structure Skip_Proof no longer require quick_and_dirty
3640 mode, which avoids critical setmp.
3642 * Eliminated old Attrib.add_attributes, Method.add_methods and related
3643 combinators for "args". INCOMPATIBILITY, need to use simplified
3644 Attrib/Method.setup introduced in Isabelle2009.
3646 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
3647 back on global_simpset_of, global_claset_of, global_clasimpset_of as
3648 last resort. INCOMPATIBILITY.
3650 * Display.pretty_thm now requires a proper context (cf. former
3651 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
3652 or even Display.pretty_thm_without_context as last resort.
3655 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
3656 Syntax.pretty_typ/term directly, preferably with proper context
3657 instead of global theory.
3662 * Further fine tuning of parallel proof checking, scales up to 8 cores
3663 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
3666 * Support for additional "Isabelle components" via etc/components, see
3667 also the system manual.
3669 * The isabelle makeall tool now operates on all components with
3670 IsaMakefile, not just hardwired "logics".
3672 * Removed "compress" option from isabelle-process and isabelle usedir;
3673 this is always enabled.
3675 * Discontinued support for Poly/ML 4.x versions.
3677 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
3678 on a given logic image. This requires the lighttpd webserver and is
3679 currently supported on Linux only.
3683 New in Isabelle2009 (April 2009)
3684 --------------------------------
3688 * Simplified main Isabelle executables, with less surprises on
3689 case-insensitive file-systems (such as Mac OS).
3691 - The main Isabelle tool wrapper is now called "isabelle" instead of
3694 - The former "isabelle" alias for "isabelle-process" has been
3695 removed (should rarely occur to regular users).
3697 - The former "isabelle-interface" and its alias "Isabelle" have been
3698 removed (interfaces are now regular Isabelle tools).
3700 Within scripts and make files, the Isabelle environment variables
3701 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
3702 respectively. (The latter are still available as legacy feature.)
3704 The old isabelle-interface wrapper could react in confusing ways if
3705 the interface was uninstalled or changed otherwise. Individual
3706 interface tool configuration is now more explicit, see also the
3707 Isabelle system manual. In particular, Proof General is now available
3708 via "isabelle emacs".
3710 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
3711 purge installed copies of Isabelle executables and re-run "isabelle
3712 install -p ...", or use symlinks.
3714 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
3715 old ~/isabelle, which was slightly non-standard and apt to cause
3716 surprises on case-insensitive file-systems (such as Mac OS).
3718 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
3719 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
3720 care is required when using older releases of Isabelle. Note that
3721 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
3722 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
3724 * Proofs of fully specified statements are run in parallel on
3725 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
3726 a regular 4-core machine, if the initial heap space is made reasonably
3727 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
3729 * The main reference manuals ("isar-ref", "implementation", and
3730 "system") have been updated and extended. Formally checked references
3731 as hyperlinks are now available uniformly.
3736 * Complete re-implementation of locales. INCOMPATIBILITY in several
3737 respects. The most important changes are listed below. See the
3738 Tutorial on Locales ("locales" manual) for details.
3740 - In locale expressions, instantiation replaces renaming. Parameters
3741 must be declared in a for clause. To aid compatibility with previous
3742 parameter inheritance, in locale declarations, parameters that are not
3743 'touched' (instantiation position "_" or omitted) are implicitly added
3744 with their syntax at the beginning of the for clause.
3746 - Syntax from abbreviations and definitions in locales is available in
3747 locale expressions and context elements. The latter is particularly
3748 useful in locale declarations.
3750 - More flexible mechanisms to qualify names generated by locale
3751 expressions. Qualifiers (prefixes) may be specified in locale
3752 expressions, and can be marked as mandatory (syntax: "name!:") or
3753 optional (syntax "name?:"). The default depends for plain "name:"
3754 depends on the situation where a locale expression is used: in
3755 commands 'locale' and 'sublocale' prefixes are optional, in
3756 'interpretation' and 'interpret' prefixes are mandatory. The old
3757 implicit qualifiers derived from the parameter names of a locale are
3758 no longer generated.
3760 - Command "sublocale l < e" replaces "interpretation l < e". The
3761 instantiation clause in "interpretation" and "interpret" (square
3762 brackets) is no longer available. Use locale expressions.
3764 - When converting proof scripts, mandatory qualifiers in
3765 'interpretation' and 'interpret' should be retained by default, even
3766 if this is an INCOMPATIBILITY compared to former behavior. In the
3767 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
3768 in locale expressions range over a single locale instance only.
3770 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
3771 In existing theorem specifications replace the includes element by the
3772 respective context elements of the included locale, omitting those
3773 that are already present in the theorem specification. Multiple
3774 assume elements of a locale should be replaced by a single one
3775 involving the locale predicate. In the proof body, declarations (most
3776 notably theorems) may be regained by interpreting the respective
3777 locales in the proof context as required (command "interpret").
3779 If using "includes" in replacement of a target solely because the
3780 parameter types in the theorem are not as general as in the target,
3781 consider declaring a new locale with additional type constraints on
3782 the parameters (context element "constrains").
3784 - Discontinued "locale (open)". INCOMPATIBILITY.
3786 - Locale interpretation commands no longer attempt to simplify goal.
3787 INCOMPATIBILITY: in rare situations the generated goal differs. Use
3788 methods intro_locales and unfold_locales to clarify.
3790 - Locale interpretation commands no longer accept interpretation
3791 attributes. INCOMPATIBILITY.
3793 * Class declaration: so-called "base sort" must not be given in import
3794 list any longer, but is inferred from the specification. Particularly
3801 class foo = type + ...
3803 * Class target: global versions of theorems stemming do not carry a
3804 parameter prefix any longer. INCOMPATIBILITY.
3806 * Class 'instance' command no longer accepts attached definitions.
3807 INCOMPATIBILITY, use proper 'instantiation' target instead.
3809 * Recovered hiding of consts, which was accidentally broken in
3810 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
3811 makes c inaccessible; consider using ``hide (open) const c'' instead.
3813 * Slightly more coherent Pure syntax, with updated documentation in
3814 isar-ref manual. Removed locales meta_term_syntax and
3815 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
3816 INCOMPATIBILITY in rare situations. Note that &&& should not be used
3817 directly in regular applications.
3819 * There is a new syntactic category "float_const" for signed decimal
3820 fractions (e.g. 123.45 or -123.45).
3822 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
3823 interface with 'setup' command instead.
3825 * Command 'local_setup' is similar to 'setup', but operates on a local
3828 * The 'axiomatization' command now only works within a global theory
3829 context. INCOMPATIBILITY.
3831 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
3832 hypotheses. Sorts required in the course of reasoning need to be
3833 covered by the constraints in the initial statement, completed by the
3834 type instance information of the background theory. Non-trivial sort
3835 hypotheses, which rarely occur in practice, may be specified via
3836 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
3838 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
3840 The result contains an implicit sort hypotheses as before --
3841 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
3844 * Generalized Isar history, with support for linear undo, direct state
3847 * Changed defaults for unify configuration options:
3849 unify_trace_bound = 50 (formerly 25)
3850 unify_search_bound = 60 (formerly 30)
3852 * Different bookkeeping for code equations (INCOMPATIBILITY):
3854 a) On theory merge, the last set of code equations for a particular
3855 constant is taken (in accordance with the policy applied by other
3856 parts of the code generator framework).
3858 b) Code equations stemming from explicit declarations (e.g. code
3859 attribute) gain priority over default code equations stemming
3860 from definition, primrec, fun etc.
3862 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
3864 * Unified theorem tables for both code generators. Thus [code
3865 func] has disappeared and only [code] remains. INCOMPATIBILITY.
3867 * Command 'find_consts' searches for constants based on type and name
3870 find_consts "_ => bool"
3872 By default, matching is against subtypes, but it may be restricted to
3873 the whole type. Searching by name is possible. Multiple queries are
3874 conjunctive and queries may be negated by prefixing them with a
3877 find_consts strict: "_ => bool" name: "Int" -"int => int"
3879 * New 'find_theorems' criterion "solves" matches theorems that
3880 directly solve the current goal (modulo higher-order unification).
3882 * Auto solve feature for main theorem statements: whenever a new goal
3883 is stated, "find_theorems solves" is called; any theorems that could
3884 solve the lemma directly are listed as part of the goal state.
3885 Cf. associated options in Proof General Isabelle settings menu,
3886 enabled by default, with reasonable timeout for pathological cases of
3887 higher-order unification.
3890 *** Document preparation ***
3892 * Antiquotation @{lemma} now imitates a regular terminal proof,
3893 demanding keyword 'by' and supporting the full method expression
3894 syntax just like the Isar command 'by'.
3899 * Integrated main parts of former image HOL-Complex with HOL. Entry
3900 points Main and Complex_Main remain as before.
3902 * Logic image HOL-Plain provides a minimal HOL with the most important
3903 tools available (inductive, datatype, primrec, ...). This facilitates
3904 experimentation and tool development. Note that user applications
3905 (and library theories) should never refer to anything below theory
3908 * Logic image HOL-Main stops at theory Main, and thus facilitates
3909 experimentation due to shorter build times.
3911 * Logic image HOL-NSA contains theories of nonstandard analysis which
3912 were previously part of former HOL-Complex. Entry point Hyperreal
3913 remains valid, but theories formerly using Complex_Main should now use
3914 new entry point Hypercomplex.
3916 * Generic ATP manager for Sledgehammer, based on ML threads instead of
3917 Posix processes. Avoids potentially expensive forking of the ML
3918 process. New thread-based implementation also works on non-Unix
3919 platforms (Cygwin). Provers are no longer hardwired, but defined
3920 within the theory via plain ML wrapper functions. Basic Sledgehammer
3921 commands are covered in the isar-ref manual.
3923 * Wrapper scripts for remote SystemOnTPTP service allows to use
3924 sledgehammer without local ATP installation (Vampire etc.). Other
3925 provers may be included via suitable ML wrappers, see also
3926 src/HOL/ATP_Linkup.thy.
3928 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
3931 * The metis method no longer fails because the theorem is too trivial
3932 (contains the empty clause).
3934 * The metis method now fails in the usual manner, rather than raising
3935 an exception, if it determines that it cannot prove the theorem.
3937 * Method "coherent" implements a prover for coherent logic (see also
3938 src/Tools/coherent.ML).
3940 * Constants "undefined" and "default" replace "arbitrary". Usually
3941 "undefined" is the right choice to replace "arbitrary", though
3942 logically there is no difference. INCOMPATIBILITY.
3944 * Command "value" now integrates different evaluation mechanisms. The
3945 result of the first successful evaluation mechanism is printed. In
3946 square brackets a particular named evaluation mechanisms may be
3947 specified (currently, [SML], [code] or [nbe]). See further
3948 src/HOL/ex/Eval_Examples.thy.
3950 * Normalization by evaluation now allows non-leftlinear equations.
3951 Declare with attribute [code nbe].
3953 * Methods "case_tac" and "induct_tac" now refer to the very same rules
3954 as the structured Isar versions "cases" and "induct", cf. the
3955 corresponding "cases" and "induct" attributes. Mutual induction rules
3956 are now presented as a list of individual projections
3957 (e.g. foo_bar.inducts for types foo and bar); the old format with
3958 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
3959 rare situations a different rule is selected --- notably nested tuple
3960 elimination instead of former prod.exhaust: use explicit (case_tac t
3961 rule: prod.exhaust) here.
3963 * Attributes "cases", "induct", "coinduct" support "del" option.
3965 * Removed fact "case_split_thm", which duplicates "case_split".
3967 * The option datatype has been moved to a new theory Option. Renamed
3968 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
3970 * New predicate "strict_mono" classifies strict functions on partial
3971 orders. With strict functions on linear orders, reasoning about
3972 (in)equalities is facilitated by theorems "strict_mono_eq",
3973 "strict_mono_less_eq" and "strict_mono_less".
3975 * Some set operations are now proper qualified constants with
3976 authentic syntax. INCOMPATIBILITY:
3987 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
3990 * Auxiliary class "itself" has disappeared -- classes without any
3991 parameter are treated as expected by the 'class' command.
3993 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
3995 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
3996 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
3998 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
3999 method "approximation". It proves formulas on real values by using
4000 interval arithmetic. In the formulas are also the transcendental
4001 functions sin, cos, tan, atan, ln, exp and the constant pi are
4002 allowed. For examples see
4003 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
4005 * Theory "Reflection" now resides in HOL/Library.
4007 * Entry point to Word library now simply named "Word".
4010 * Made source layout more coherent with logical distribution
4013 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
4014 src/HOL/Library/Code_Message.thy ~> src/HOL/
4015 src/HOL/Library/GCD.thy ~> src/HOL/
4016 src/HOL/Library/Order_Relation.thy ~> src/HOL/
4017 src/HOL/Library/Parity.thy ~> src/HOL/
4018 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
4019 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
4020 src/HOL/Real/Lubs.thy ~> src/HOL/
4021 src/HOL/Real/PReal.thy ~> src/HOL/
4022 src/HOL/Real/Rational.thy ~> src/HOL/
4023 src/HOL/Real/RComplete.thy ~> src/HOL/
4024 src/HOL/Real/RealDef.thy ~> src/HOL/
4025 src/HOL/Real/RealPow.thy ~> src/HOL/
4026 src/HOL/Real/Real.thy ~> src/HOL/
4027 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
4028 src/HOL/Complex/Complex.thy ~> src/HOL/
4029 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
4030 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
4031 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
4032 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
4033 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
4034 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
4035 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
4036 src/HOL/Hyperreal/Log.thy ~> src/HOL/
4037 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
4038 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
4039 src/HOL/Hyperreal/Series.thy ~> src/HOL/
4040 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
4041 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
4042 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
4043 src/HOL/Real/Float ~> src/HOL/Library/
4044 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
4045 src/HOL/Real/RealVector.thy ~> src/HOL/
4047 src/HOL/arith_data.ML ~> src/HOL/Tools
4048 src/HOL/hologic.ML ~> src/HOL/Tools
4049 src/HOL/simpdata.ML ~> src/HOL/Tools
4050 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
4051 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
4052 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
4053 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
4054 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
4055 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
4056 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
4058 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
4059 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
4060 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
4061 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
4062 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
4063 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
4065 * If methods "eval" and "evaluation" encounter a structured proof
4066 state with !!/==>, only the conclusion is evaluated to True (if
4067 possible), avoiding strange error messages.
4069 * Method "sizechange" automates termination proofs using (a
4070 modification of) the size-change principle. Requires SAT solver. See
4071 src/HOL/ex/Termination.thy for examples.
4073 * Simplifier: simproc for let expressions now unfolds if bound
4074 variable occurs at most once in let expression body. INCOMPATIBILITY.
4076 * Method "arith": Linear arithmetic now ignores all inequalities when
4077 fast_arith_neq_limit is exceeded, instead of giving up entirely.
4079 * New attribute "arith" for facts that should always be used
4080 automatically by arithmetic. It is intended to be used locally in
4083 assumes [arith]: "x > 0"
4085 Global usage is discouraged because of possible performance impact.
4087 * New classes "top" and "bot" with corresponding operations "top" and
4088 "bot" in theory Orderings; instantiation of class "complete_lattice"
4089 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
4091 * Changed definition lemma "less_fun_def" in order to provide an
4092 instance for preorders on functions; use lemma "less_le" instead.
4095 * Theory Orderings: class "wellorder" moved here, with explicit
4096 induction rule "less_induct" as assumption. For instantiation of
4097 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
4100 * Theory Orderings: added class "preorder" as superclass of "order".
4101 INCOMPATIBILITY: Instantiation proofs for order, linorder
4102 etc. slightly changed. Some theorems named order_class.* now named
4105 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
4108 * Theory Finite_Set: added a new fold combinator of type
4110 ('a => 'b => 'b) => 'b => 'a set => 'b
4112 Occasionally this is more convenient than the old fold combinator
4113 which is now defined in terms of the new one and renamed to
4116 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
4117 and "ring_simps" have been replaced by "algebra_simps" (which can be
4118 extended with further lemmas!). At the moment both still exist but
4119 the former will disappear at some point.
4121 * Theory Power: Lemma power_Suc is now declared as a simp rule in
4122 class recpower. Type-specific simp rules for various recpower types
4123 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
4125 rat_power_0 -> power_0
4126 rat_power_Suc -> power_Suc
4127 realpow_0 -> power_0
4128 realpow_Suc -> power_Suc
4129 complexpow_0 -> power_0
4130 complexpow_Suc -> power_Suc
4131 power_poly_0 -> power_0
4132 power_poly_Suc -> power_Suc
4134 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
4135 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
4136 dvd has been generalized to class comm_semiring_1. Likewise a bunch
4137 of lemmas from Divides has been generalized from nat to class
4138 semiring_div. INCOMPATIBILITY. This involves the following theorem
4139 renames resulting from duplicate elimination:
4141 dvd_def_mod ~> dvd_eq_mod_eq_0
4142 zero_dvd_iff ~> dvd_0_left_iff
4143 dvd_0 ~> dvd_0_right
4144 DIVISION_BY_ZERO_DIV ~> div_by_0
4145 DIVISION_BY_ZERO_MOD ~> mod_by_0
4146 mult_div ~> div_mult_self2_is_id
4147 mult_mod ~> mod_mult_self2_is_0
4149 * Theory IntDiv: removed many lemmas that are instances of class-based
4150 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
4151 rename old lemmas as follows:
4153 dvd_diff -> nat_dvd_diff
4154 dvd_zminus_iff -> dvd_minus_iff
4155 mod_add1_eq -> mod_add_eq
4156 mod_mult1_eq -> mod_mult_right_eq
4157 mod_mult1_eq' -> mod_mult_left_eq
4158 mod_mult_distrib_mod -> mod_mult_eq
4159 nat_mod_add_left_eq -> mod_add_left_eq
4160 nat_mod_add_right_eq -> mod_add_right_eq
4161 nat_mod_div_trivial -> mod_div_trivial
4162 nat_mod_mod_trivial -> mod_mod_trivial
4163 zdiv_zadd_self1 -> div_add_self1
4164 zdiv_zadd_self2 -> div_add_self2
4165 zdiv_zmult_self1 -> div_mult_self2_is_id
4166 zdiv_zmult_self2 -> div_mult_self1_is_id
4167 zdvd_triv_left -> dvd_triv_left
4168 zdvd_triv_right -> dvd_triv_right
4169 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
4170 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
4171 zmod_zadd_left_eq -> mod_add_left_eq
4172 zmod_zadd_right_eq -> mod_add_right_eq
4173 zmod_zadd_self1 -> mod_add_self1
4174 zmod_zadd_self2 -> mod_add_self2
4175 zmod_zadd1_eq -> mod_add_eq
4176 zmod_zdiff1_eq -> mod_diff_eq
4177 zmod_zdvd_zmod -> mod_mod_cancel
4178 zmod_zmod_cancel -> mod_mod_cancel
4179 zmod_zmult_self1 -> mod_mult_self2_is_0
4180 zmod_zmult_self2 -> mod_mult_self1_is_0
4183 zdvd_abs1 -> abs_dvd_iff
4184 zdvd_abs2 -> dvd_abs_iff
4185 zdvd_refl -> dvd_refl
4186 zdvd_trans -> dvd_trans
4187 zdvd_zadd -> dvd_add
4188 zdvd_zdiff -> dvd_diff
4189 zdvd_zminus_iff -> dvd_minus_iff
4190 zdvd_zminus2_iff -> minus_dvd_iff
4191 zdvd_zmultD -> dvd_mult_right
4192 zdvd_zmultD2 -> dvd_mult_left
4193 zdvd_zmult_mono -> mult_dvd_mono
4194 zdvd_0_right -> dvd_0_right
4195 zdvd_0_left -> dvd_0_left_iff
4196 zdvd_1_left -> one_dvd
4197 zminus_dvd_iff -> minus_dvd_iff
4199 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
4201 * The real numbers offer decimal input syntax: 12.34 is translated
4202 into 1234/10^2. This translation is not reversed upon output.
4204 * Theory Library/Polynomial defines an abstract type 'a poly of
4205 univariate polynomials with coefficients of type 'a. In addition to
4206 the standard ring operations, it also supports div and mod. Code
4207 generation is also supported, using list-style constructors.
4209 * Theory Library/Inner_Product defines a class of real_inner for real
4210 inner product spaces, with an overloaded operation inner :: 'a => 'a
4211 => real. Class real_inner is a subclass of real_normed_vector from
4214 * Theory Library/Product_Vector provides instances for the product
4215 type 'a * 'b of several classes from RealVector and Inner_Product.
4216 Definitions of addition, subtraction, scalar multiplication, norms,
4217 and inner products are included.
4219 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
4220 addition to the field operations, numerals and case syntax are also
4223 * Theory Library/Diagonalize provides constructive version of Cantor's
4224 first diagonalization argument.
4226 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
4227 zlcm (for int); carried together from various gcd/lcm developements in
4228 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
4229 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
4230 may recover tupled syntax as follows:
4232 hide (open) const gcd
4233 abbreviation gcd where
4234 "gcd == (%(a, b). GCD.gcd a b)"
4236 GCD.gcd ("gcd '(_, _')")
4238 The same works for lcm, zgcd, zlcm.
4240 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
4241 instantiations for algebraic structures. Removed some duplicate
4242 theorems. Changes in simp rules. INCOMPATIBILITY.
4244 * ML antiquotation @{code} takes a constant as argument and generates
4245 corresponding code in background and inserts name of the corresponding
4246 resulting ML value/function/datatype constructor binding in place.
4247 All occurrences of @{code} with a single ML block are generated
4248 simultaneously. Provides a generic and safe interface for
4249 instrumentalizing code generation. See
4250 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
4251 In future you ought to refrain from ad-hoc compiling generated SML
4252 code on the ML toplevel. Note that (for technical reasons) @{code}
4253 cannot refer to constants for which user-defined serializations are
4254 set. Refer to the corresponding ML counterpart directly in that
4257 * Command 'rep_datatype': instead of theorem names the command now
4258 takes a list of terms denoting the constructors of the type to be
4259 represented as datatype. The characteristic theorems have to be
4260 proven. INCOMPATIBILITY. Also observe that the following theorems
4261 have disappeared in favour of existing ones:
4263 unit_induct ~> unit.induct
4264 prod_induct ~> prod.induct
4265 sum_induct ~> sum.induct
4266 Suc_Suc_eq ~> nat.inject
4267 Suc_not_Zero Zero_not_Suc ~> nat.distinct
4272 * New locales for orders and lattices where the equivalence relation
4273 is not restricted to equality. INCOMPATIBILITY: all order and lattice
4274 locales use a record structure with field eq for the equivalence.
4276 * New theory of factorial domains.
4278 * Units_l_inv and Units_r_inv are now simp rules by default.
4279 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
4280 and/or r_inv will now also require deletion of these lemmas.
4282 * Renamed the following theorems, INCOMPATIBILITY:
4284 UpperD ~> Upper_memD
4285 LowerD ~> Lower_memD
4286 least_carrier ~> least_closed
4287 greatest_carrier ~> greatest_closed
4288 greatest_Lower_above ~> greatest_Lower_below
4289 one_zero ~> carrier_one_zero
4290 one_not_zero ~> carrier_one_not_zero (collision with assumption)
4295 * Nominal datatypes can now contain type-variables.
4297 * Commands 'nominal_inductive' and 'equivariance' work with local
4300 * Nominal primrec can now works with local theory targets and its
4301 specification syntax now conforms to the general format as seen in
4304 * Method "perm_simp" honours the standard simplifier attributes
4305 (no_asm), (no_asm_use) etc.
4307 * The new predicate #* is defined like freshness, except that on the
4308 left hand side can be a set or list of atoms.
4310 * Experimental command 'nominal_inductive2' derives strong induction
4311 principles for inductive definitions. In contrast to
4312 'nominal_inductive', which can only deal with a fixed number of
4313 binders, it can deal with arbitrary expressions standing for sets of
4314 atoms to be avoided. The only inductive definition we have at the
4315 moment that needs this generalisation is the typing rule for Lets in
4318 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
4319 -----------------------------------------------------------------
4320 Gamma |- Let x be t1 in t2 : T2
4322 In this rule one wants to avoid all the binders that are introduced by
4323 "close Gamma T1". We are looking for other examples where this
4324 feature might be useful. Please let us know.
4329 * Reimplemented the simplification procedure for proving continuity
4330 subgoals. The new simproc is extensible; users can declare additional
4331 continuity introduction rules with the attribute [cont2cont].
4333 * The continuity simproc now uses a different introduction rule for
4334 solving continuity subgoals on terms with lambda abstractions. In
4335 some rare cases the new simproc may fail to solve subgoals that the
4336 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
4337 Potential INCOMPATIBILITY.
4339 * Command 'fixrec': specification syntax now conforms to the general
4340 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
4341 examples. INCOMPATIBILITY.
4346 * Proof of Zorn's Lemma for partial orders.
4351 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
4352 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
4353 depends on multithreading, so timouts will not work before Poly/ML
4356 * High-level support for concurrent ML programming, see
4357 src/Pure/Cuncurrent. The data-oriented model of "future values" is
4358 particularly convenient to organize independent functional
4359 computations. The concept of "synchronized variables" provides a
4360 higher-order interface for components with shared state, avoiding the
4361 delicate details of mutexes and condition variables. (Requires
4362 Poly/ML 5.2.1 or later.)
4364 * ML bindings produced via Isar commands are stored within the Isar
4365 context (theory or proof). Consequently, commands like 'use' and 'ML'
4366 become thread-safe and work with undo as expected (concerning
4367 top-level bindings, not side-effects on global references).
4368 INCOMPATIBILITY, need to provide proper Isar context when invoking the
4369 compiler at runtime; really global bindings need to be given outside a
4370 theory. (Requires Poly/ML 5.2 or later.)
4372 * Command 'ML_prf' is analogous to 'ML' but works within a proof
4373 context. Top-level ML bindings are stored within the proof context in
4374 a purely sequential fashion, disregarding the nested proof structure.
4375 ML bindings introduced by 'ML_prf' are discarded at the end of the
4376 proof. (Requires Poly/ML 5.2 or later.)
4378 * Simplified ML attribute and method setup, cf. functions Attrib.setup
4379 and Method.setup, as well as Isar commands 'attribute_setup' and
4380 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
4381 existing code accordingly, or use plain 'setup' together with old
4384 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
4385 to 'a -> thm, while results are always tagged with an authentic oracle
4386 name. The Isar command 'oracle' is now polymorphic, no argument type
4387 is specified. INCOMPATIBILITY, need to simplify existing oracle code
4388 accordingly. Note that extra performance may be gained by producing
4389 the cterm carefully, avoiding slow Thm.cterm_of.
4391 * Simplified interface for defining document antiquotations via
4392 ThyOutput.antiquotation, ThyOutput.output, and optionally
4393 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
4394 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
4397 * More systematic treatment of long names, abstract name bindings, and
4398 name space operations. Basic operations on qualified names have been
4399 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
4400 Long_Name.append. Old type bstring has been mostly replaced by
4401 abstract type binding (see structure Binding), which supports precise
4402 qualification by packages and local theory targets, as well as proper
4403 tracking of source positions. INCOMPATIBILITY, need to wrap old
4404 bstring values into Binding.name, or better pass through abstract
4405 bindings everywhere. See further src/Pure/General/long_name.ML,
4406 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
4408 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
4409 LocalTheory.note etc.) now refer to the *full* internal name, not the
4410 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
4412 * Disposed old type and term read functions (Sign.read_def_typ,
4413 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
4414 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
4415 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
4416 Syntax.read_term_global etc.; see also OldGoals.read_term as last
4417 resort for legacy applications.
4419 * Disposed old declarations, tactics, tactic combinators that refer to
4420 the simpset or claset of an implicit theory (such as Addsimps,
4421 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
4422 embedded ML text, or local_simpset_of with a proper context passed as
4423 explicit runtime argument.
4425 * Rules and tactics that read instantiations (read_instantiate,
4426 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
4427 context, which is required for parsing and type-checking. Moreover,
4428 the variables are specified as plain indexnames, not string encodings
4429 thereof. INCOMPATIBILITY.
4431 * Generic Toplevel.add_hook interface allows to analyze the result of
4432 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
4433 for theorem dependency output of transactions resulting in a new
4436 * ML antiquotations: block-structured compilation context indicated by
4437 \<lbrace> ... \<rbrace>; additional antiquotation forms:
4439 @{binding name} - basic name binding
4440 @{let ?pat = term} - term abbreviation (HO matching)
4441 @{note name = fact} - fact abbreviation
4442 @{thm fact} - singleton fact (with attributes)
4443 @{thms fact} - general fact (with attributes)
4444 @{lemma prop by method} - singleton goal
4445 @{lemma prop by meth1 meth2} - singleton goal
4446 @{lemma prop1 ... propN by method} - general goal
4447 @{lemma prop1 ... propN by meth1 meth2} - general goal
4448 @{lemma (open) ...} - open derivation
4453 * The Isabelle "emacs" tool provides a specific interface to invoke
4454 Proof General / Emacs, with more explicit failure if that is not
4455 installed (the old isabelle-interface script silently falls back on
4456 isabelle-process). The PROOFGENERAL_HOME setting determines the
4457 installation location of the Proof General distribution.
4459 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
4460 the Isabelle process into a JVM/Scala application. See
4461 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
4462 process wrapper has been discontinued.)
4464 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
4466 * Various status messages (with exact source position information) are
4467 emitted, if proper markup print mode is enabled. This allows
4468 user-interface components to provide detailed feedback on internal
4473 New in Isabelle2008 (June 2008)
4474 -------------------------------
4478 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
4479 and updated, with formally checked references as hyperlinks.
4481 * Theory loader: use_thy (and similar operations) no longer set the
4482 implicit ML context, which was occasionally hard to predict and in
4483 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
4484 provides a proper context already.
4486 * Theory loader: old-style ML proof scripts being *attached* to a thy
4487 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
4488 'use' within a theory file will do the job.
4490 * Name space merge now observes canonical order, i.e. the second space
4491 is inserted into the first one, while existing entries in the first
4492 space take precedence. INCOMPATIBILITY in rare situations, may try to
4493 swap theory imports.
4495 * Syntax: symbol \<chi> is now considered a letter. Potential
4496 INCOMPATIBILITY in identifier syntax etc.
4498 * Outer syntax: string tokens no longer admit escaped white space,
4499 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
4500 white space without escapes.
4502 * Outer syntax: string tokens may contain arbitrary character codes
4503 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
4509 * Context-dependent token translations. Default setup reverts locally
4510 fixed variables, and adds hilite markup for undeclared frees.
4512 * Unused theorems can be found using the new command 'unused_thms'.
4513 There are three ways of invoking it:
4516 Only finds unused theorems in the current theory.
4518 (2) unused_thms thy_1 ... thy_n -
4519 Finds unused theorems in the current theory and all of its ancestors,
4520 excluding the theories thy_1 ... thy_n and all of their ancestors.
4522 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
4523 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
4524 their ancestors, excluding the theories thy_1 ... thy_n and all of
4527 In order to increase the readability of the list produced by
4528 unused_thms, theorems that have been created by a particular instance
4529 of a theory command such as 'inductive' or 'function' are considered
4530 to belong to the same "group", meaning that if at least one theorem in
4531 this group is used, the other theorems in the same group are no longer
4532 reported as unused. Moreover, if all theorems in the group are
4533 unused, only one theorem in the group is displayed.
4535 Note that proof objects have to be switched on in order for
4536 unused_thms to work properly (i.e. !proofs must be >= 1, which is
4537 usually the case when using Proof General with the default settings).
4539 * Authentic naming of facts disallows ad-hoc overwriting of previous
4540 theorems within the same name space. INCOMPATIBILITY, need to remove
4541 duplicate fact bindings, or even accidental fact duplications. Note
4542 that tools may maintain dynamically scoped facts systematically, using
4543 PureThy.add_thms_dynamic.
4545 * Command 'hide' now allows to hide from "fact" name space as well.
4547 * Eliminated destructive theorem database, simpset, claset, and
4548 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
4549 update of theories within ML code.
4551 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
4552 INCOMPATIBILITY, object-logics depending on former Pure require
4553 additional setup PureThy.old_appl_syntax_setup; object-logics
4554 depending on former CPure need to refer to Pure.
4556 * Commands 'use' and 'ML' are now purely functional, operating on
4557 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
4558 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
4561 * Command 'setup': discontinued implicit version with ML reference.
4563 * Instantiation target allows for simultaneous specification of class
4564 instance operations together with an instantiation proof.
4565 Type-checking phase allows to refer to class operations uniformly.
4566 See src/HOL/Complex/Complex.thy for an Isar example and
4567 src/HOL/Library/Eval.thy for an ML example.
4569 * Indexing of literal facts: be more serious about including only
4570 facts from the visible specification/proof context, but not the
4571 background context (locale etc.). Affects `prop` notation and method
4572 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
4575 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
4576 "(open)" option, which used to expose internal bound variables to the
4579 * Isar statements: removed obsolete case "rule_context".
4580 INCOMPATIBILITY, better use explicit fixes/assumes.
4582 * Locale proofs: default proof step now includes 'unfold_locales';
4583 hence 'proof' without argument may be used to unfold locale
4587 *** Document preparation ***
4589 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
4590 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
4591 obsolete thumbpdf setup (contemporary PDF viewers do this on the
4592 spot); renamed link color from "darkblue" to "linkcolor" (default
4593 value unchanged, can be redefined via \definecolor); no longer sets
4594 "a4paper" option (unnecessary or even intrusive).
4596 * Antiquotation @{lemma A method} proves proposition A by the given
4597 method (either a method name or a method name plus (optional) method
4598 arguments in parentheses) and prints A just like @{prop A}.
4603 * New primrec package. Specification syntax conforms in style to
4604 definition/function/.... No separate induction rule is provided. The
4605 "primrec" command distinguishes old-style and new-style specifications
4606 by syntax. The former primrec package is now named OldPrimrecPackage.
4607 When adjusting theories, beware: constants stemming from new-style
4608 primrec specifications have authentic syntax.
4610 * Metis prover is now an order of magnitude faster, and also works
4611 with multithreading.
4613 * Metis: the maximum number of clauses that can be produced from a
4614 theorem is now given by the attribute max_clauses. Theorems that
4615 exceed this number are ignored, with a warning printed.
4617 * Sledgehammer no longer produces structured proofs by default. To
4618 enable, declare [[sledgehammer_full = true]]. Attributes
4619 reconstruction_modulus, reconstruction_sorts renamed
4620 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
4622 * Method "induct_scheme" derives user-specified induction rules
4623 from well-founded induction and completeness of patterns. This factors
4624 out some operations that are done internally by the function package
4625 and makes them available separately. See
4626 src/HOL/ex/Induction_Scheme.thy for examples.
4628 * More flexible generation of measure functions for termination
4629 proofs: Measure functions can be declared by proving a rule of the
4630 form "is_measure f" and giving it the [measure_function] attribute.
4631 The "is_measure" predicate is logically meaningless (always true), and
4632 just guides the heuristic. To find suitable measure functions, the
4633 termination prover sets up the goal "is_measure ?f" of the appropriate
4634 type and generates all solutions by prolog-style backwards proof using
4637 This setup also deals with rules like
4639 "is_measure f ==> is_measure (list_size f)"
4641 which accommodates nested datatypes that recurse through lists.
4642 Similar rules are predeclared for products and option types.
4644 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
4648 - Definitions of overloaded constants on sets have to be replaced by
4649 definitions on => and bool.
4651 - Some definitions of overloaded operators on sets can now be proved
4652 using the definitions of the operators on => and bool. Therefore,
4653 the following theorems have been renamed:
4655 subset_def -> subset_eq
4656 psubset_def -> psubset_eq
4657 set_diff_def -> set_diff_eq
4658 Compl_def -> Compl_eq
4659 Sup_set_def -> Sup_set_eq
4660 Inf_set_def -> Inf_set_eq
4661 sup_set_def -> sup_set_eq
4662 inf_set_def -> inf_set_eq
4664 - Due to the incompleteness of the HO unification algorithm, some
4665 rules such as subst may require manual instantiation, if some of
4666 the unknowns in the rule is a set.
4668 - Higher order unification and forward proofs:
4671 have "P (S::'a set)" <...>
4672 then have "EX S. P S" ..
4674 no longer works (due to the incompleteness of the HO unification
4675 algorithm) and must be replaced by the pattern
4682 - Calculational reasoning with subst (or similar rules):
4685 have "P (S::'a set)" <...>
4686 also have "S = T" <...>
4687 finally have "P T" .
4689 no longer works (for similar reasons as the previous example) and
4690 must be replaced by something like
4692 have "P (S::'a set)" <...>
4693 moreover have "S = T" <...>
4694 ultimately have "P T" by simp
4696 - Tactics or packages written in ML code:
4697 Code performing pattern matching on types via
4699 Type ("set", [T]) => ...
4701 must be rewritten. Moreover, functions like strip_type or
4702 binder_types no longer return the right value when applied to a
4705 T1 => ... => Tn => U => bool
4709 T1 => ... => Tn => U set
4711 * Merged theories Wellfounded_Recursion, Accessible_Part and
4712 Wellfounded_Relations to theory Wellfounded.
4714 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
4716 * Class finite no longer treats UNIV as class parameter. Use class
4717 enum from theory Library/Enum instead to achieve a similar effect.
4720 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
4721 and "Cons". INCOMPATIBILITY.
4723 * HOL (and FOL): renamed variables in rules imp_elim and swap.
4724 Potential INCOMPATIBILITY.
4726 * Theory Product_Type: duplicated lemmas split_Pair_apply and
4727 injective_fst_snd removed, use split_eta and prod_eqI instead.
4728 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
4730 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
4731 the same name in theory Orderings:
4741 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
4742 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
4743 and different variable names.
4745 * Library/Option_ord.thy: Canonical order on option type.
4747 * Library/RBT.thy: Red-black trees, an efficient implementation of
4750 * Library/Countable.thy: Type class for countable types.
4752 * Theory Int: The representation of numerals has changed. The infix
4753 operator BIT and the bit datatype with constructors B0 and B1 have
4754 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
4755 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
4756 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
4759 * Theory Nat: definition of <= and < on natural numbers no longer
4760 depend on well-founded relations. INCOMPATIBILITY. Definitions
4761 le_def and less_def have disappeared. Consider lemmas not_less
4762 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
4764 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
4765 (whose purpose mainly is for various fold_set functionals) have been
4766 abandoned in favor of the existing algebraic classes
4767 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
4768 lower_semilattice (resp. upper_semilattice) and linorder.
4771 * Theory Transitive_Closure: induct and cases rules now declare proper
4772 case_names ("base" and "step"). INCOMPATIBILITY.
4774 * Theorem Inductive.lfp_ordinal_induct generalized to complete
4775 lattices. The form set-specific version is available as
4776 Inductive.lfp_ordinal_induct_set.
4778 * Renamed theorems "power.simps" to "power_int.simps".
4781 * Class semiring_div provides basic abstract properties of semirings
4782 with division and modulo operations. Subsumes former class dvd_mod.
4784 * Merged theories IntDef, Numeral and IntArith into unified theory
4785 Int. INCOMPATIBILITY.
4787 * Theory Library/Code_Index: type "index" now represents natural
4788 numbers rather than integers. INCOMPATIBILITY.
4790 * New class "uminus" with operation "uminus" (split of from class
4791 "minus" which now only has operation "minus", binary).
4794 * Constants "card", "internal_split", "option_map" now with authentic
4795 syntax. INCOMPATIBILITY.
4797 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
4798 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
4799 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
4800 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
4801 Sup_set_def, le_def, less_def, option_map_def now with object
4802 equality. INCOMPATIBILITY.
4804 * Records. Removed K_record, and replaced it by pure lambda term
4805 %x. c. The simplifier setup is now more robust against eta expansion.
4806 INCOMPATIBILITY: in cases explicitly referring to K_record.
4808 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
4810 * Library/ListVector: new theory of arithmetic vector operations.
4812 * Library/Order_Relation: new theory of various orderings as sets of
4813 pairs. Defines preorders, partial orders, linear orders and
4814 well-orders on sets and on types.
4819 * Renamed some theories to allow to loading both ZF and HOL in the
4822 Datatype -> Datatype_ZF
4823 Inductive -> Inductive_ZF
4830 INCOMPATIBILITY: ZF theories that import individual theories below
4831 Main might need to be adapted. Regular theory Main is still
4832 available, as trivial extension of Main_ZF.
4837 * ML within Isar: antiquotation @{const name} or @{const
4838 name(typargs)} produces statically-checked Const term.
4840 * Functor NamedThmsFun: data is available to the user as dynamic fact
4841 (of the same name). Removed obsolete print command.
4843 * Removed obsolete "use_legacy_bindings" function.
4845 * The ``print mode'' is now a thread-local value derived from a global
4846 template (the former print_mode reference), thus access becomes
4847 non-critical. The global print_mode reference is for session
4848 management only; user-code should use print_mode_value,
4849 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
4851 * Functions system/system_out provide a robust way to invoke external
4852 shell commands, with propagation of interrupts (requires Poly/ML
4853 5.2.1). Do not use OS.Process.system etc. from the basis library!
4858 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
4859 in accordance with Proof General 3.7, which prefers GNU emacs.
4861 * isatool tty runs Isabelle process with plain tty interaction;
4862 optional line editor may be specified via ISABELLE_LINE_EDITOR
4863 setting, the default settings attempt to locate "ledit" and "rlwrap".
4865 * isatool browser now works with Cygwin as well, using general
4866 "javapath" function defined in Isabelle process environment.
4868 * YXML notation provides a simple and efficient alternative to
4869 standard XML transfer syntax. See src/Pure/General/yxml.ML and
4870 isatool yxml as described in the Isabelle system manual.
4872 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
4873 provides general wrapper for managing an Isabelle process in a robust
4874 fashion, with ``cooked'' output from stdin/stderr.
4876 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
4877 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
4879 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
4880 way of changing the user's settings is via
4881 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
4884 * Multithreading.max_threads := 0 refers to the number of actual CPU
4885 cores of the underlying machine, which is a good starting point for
4886 optimal performance tuning. The corresponding usedir option -M allows
4887 "max" as an alias for "0". WARNING: does not work on certain versions
4888 of Mac OS (with Poly/ML 5.1).
4890 * isabelle-process: non-ML sessions are run with "nice", to reduce the
4891 adverse effect of Isabelle flooding interactive front-ends (notably
4892 ProofGeneral / XEmacs).
4896 New in Isabelle2007 (November 2007)
4897 -----------------------------------
4901 * More uniform information about legacy features, notably a
4902 warning/error of "Legacy feature: ...", depending on the state of the
4903 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
4904 legacy features will disappear eventually.
4906 * Theory syntax: the header format ``theory A = B + C:'' has been
4907 discontinued in favour of ``theory A imports B C begin''. Use isatool
4908 fixheaders to convert existing theory files. INCOMPATIBILITY.
4910 * Theory syntax: the old non-Isar theory file format has been
4911 discontinued altogether. Note that ML proof scripts may still be used
4912 with Isar theories; migration is usually quite simple with the ML
4913 function use_legacy_bindings. INCOMPATIBILITY.
4915 * Theory syntax: some popular names (e.g. 'class', 'declaration',
4916 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
4919 * Theory loader: be more serious about observing the static theory
4920 header specifications (including optional directories), but not the
4921 accidental file locations of previously successful loads. The strict
4922 update policy of former update_thy is now already performed by
4923 use_thy, so the former has been removed; use_thys updates several
4924 theories simultaneously, just as 'imports' within a theory header
4925 specification, but without merging the results. Potential
4926 INCOMPATIBILITY: may need to refine theory headers and commands
4927 ROOT.ML which depend on load order.
4929 * Theory loader: optional support for content-based file
4930 identification, instead of the traditional scheme of full physical
4931 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
4932 (cf. the system manual). The new scheme allows to work with
4933 non-finished theories in persistent session images, such that source
4934 files may be moved later on without requiring reloads.
4936 * Theory loader: old-style ML proof scripts being *attached* to a thy
4937 file (with the same base name as the theory) are considered a legacy
4938 feature, which will disappear eventually. Even now, the theory loader
4939 no longer maintains dependencies on such files.
4941 * Syntax: the scope for resolving ambiguities via type-inference is
4942 now limited to individual terms, instead of whole simultaneous
4943 specifications as before. This greatly reduces the complexity of the
4944 syntax module and improves flexibility by separating parsing and
4945 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
4946 'fixes' etc.) are required in rare situations.
4948 * Syntax: constants introduced by new-style packages ('definition',
4949 'abbreviation' etc.) are passed through the syntax module in
4950 ``authentic mode''. This means that associated mixfix annotations
4951 really stick to such constants, independently of potential name space
4952 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
4953 trees are represented slightly differently, may need to adapt syntax
4954 translations accordingly. Use CONST marker in 'translations' and
4955 @{const_syntax} antiquotation in 'parse_translation' etc.
4957 * Legacy goal package: reduced interface to the bare minimum required
4958 to keep existing proof scripts running. Most other user-level
4959 functions are now part of the OldGoals structure, which is *not* open
4960 by default (consider isatool expandshort before open OldGoals).
4961 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
4962 these tend to cause confusion about the actual goal (!) context being
4963 used here, which is not necessarily the same as the_context().
4965 * Command 'find_theorems': supports "*" wild-card in "name:"
4966 criterion; "with_dups" option. Certain ProofGeneral versions might
4967 support a specific search form (see ProofGeneral/CHANGES).
4969 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
4970 by default, which means that "prems" (and also "fixed variables") are
4971 suppressed from proof state output. Note that the ProofGeneral
4972 settings mechanism allows to change and save options persistently, but
4973 older versions of Isabelle will fail to start up if a negative prems
4976 * Local theory targets may be specified by non-nested blocks of
4977 ``context/locale/class ... begin'' followed by ``end''. The body may
4978 contain definitions, theorems etc., including any derived mechanism
4979 that has been implemented on top of these primitives. This concept
4980 generalizes the existing ``theorem (in ...)'' towards more versatility
4983 * Proof General interface: proper undo of final 'end' command;
4984 discontinued Isabelle/classic mode (ML proof scripts).
4987 *** Document preparation ***
4989 * Added antiquotation @{theory name} which prints the given name,
4990 after checking that it refers to a valid ancestor theory in the
4993 * Added antiquotations @{ML_type text} and @{ML_struct text} which
4994 check the given source text as ML type/structure, printing verbatim.
4996 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
4997 "c args == rhs" given in the current context. (Any number of
4998 arguments may be given on the LHS.)
5003 * The 'class' package offers a combination of axclass and locale to
5004 achieve Haskell-like type classes in Isabelle. Definitions and
5005 theorems within a class context produce both relative results (with
5006 implicit parameters according to the locale context), and polymorphic
5007 constants with qualified polymorphism (according to the class
5008 context). Within the body context of a 'class' target, a separate
5009 syntax layer ("user space type system") takes care of converting
5010 between global polymorphic consts and internal locale representation.
5011 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
5012 "isatool doc classes" provides a tutorial.
5014 * Generic code generator framework allows to generate executable
5015 code for ML and Haskell (including Isabelle classes). A short usage
5018 internal compilation:
5019 export_code <list of constants (term syntax)> in SML
5020 writing SML code to a file:
5021 export_code <list of constants (term syntax)> in SML <filename>
5022 writing OCaml code to a file:
5023 export_code <list of constants (term syntax)> in OCaml <filename>
5024 writing Haskell code to a bunch of files:
5025 export_code <list of constants (term syntax)> in Haskell <filename>
5027 evaluating closed propositions to True/False using code generation:
5030 Reasonable default setup of framework in HOL.
5032 Theorem attributs for selecting and transforming function equations theorems:
5034 [code fun]: select a theorem as function equation for a specific constant
5035 [code fun del]: deselect a theorem as function equation for a specific constant
5036 [code inline]: select an equation theorem for unfolding (inlining) in place
5037 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
5039 User-defined serializations (target in {SML, OCaml, Haskell}):
5041 code_const <and-list of constants (term syntax)>
5042 {(target) <and-list of const target syntax>}+
5044 code_type <and-list of type constructors>
5045 {(target) <and-list of type target syntax>}+
5047 code_instance <and-list of instances>
5049 where instance ::= <type constructor> :: <class>
5051 code_class <and_list of classes>
5052 {(target) <and-list of class target syntax>}+
5053 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
5055 code_instance and code_class only are effective to target Haskell.
5057 For example usage see src/HOL/ex/Codegenerator.thy and
5058 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
5059 generation from Isabelle/HOL theories is available via "isatool doc
5062 * Code generator: consts in 'consts_code' Isar commands are now
5063 referred to by usual term syntax (including optional type
5066 * Command 'no_translations' removes translation rules from theory
5069 * Overloaded definitions are now actually checked for acyclic
5070 dependencies. The overloading scheme is slightly more general than
5071 that of Haskell98, although Isabelle does not demand an exact
5072 correspondence to type class and instance declarations.
5073 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
5074 exotic versions of overloading -- at the discretion of the user!
5076 Polymorphic constants are represented via type arguments, i.e. the
5077 instantiation that matches an instance against the most general
5078 declaration given in the signature. For example, with the declaration
5079 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
5080 as c(nat). Overloading is essentially simultaneous structural
5081 recursion over such type arguments. Incomplete specification patterns
5082 impose global constraints on all occurrences, e.g. c('a * 'a) on the
5083 LHS means that more general c('a * 'b) will be disallowed on any RHS.
5084 Command 'print_theory' outputs the normalized system of recursive
5085 equations, see section "definitions".
5087 * Configuration options are maintained within the theory or proof
5088 context (with name and type bool/int/string), providing a very simple
5089 interface to a poor-man's version of general context data. Tools may
5090 declare options in ML (e.g. using Attrib.config_int) and then refer to
5091 these values using Config.get etc. Users may change options via an
5092 associated attribute of the same name. This form of context
5093 declaration works particularly well with commands 'declare' or
5094 'using', for example ``declare [[foo = 42]]''. Thus it has become
5095 very easy to avoid global references, which would not observe Isar
5096 toplevel undo/redo and fail to work with multithreading.
5098 Various global ML references of Pure and HOL have been turned into
5099 configuration options:
5101 Unify.search_bound unify_search_bound
5102 Unify.trace_bound unify_trace_bound
5103 Unify.trace_simp unify_trace_simp
5104 Unify.trace_types unify_trace_types
5105 Simplifier.simp_depth_limit simp_depth_limit
5106 Blast.depth_limit blast_depth_limit
5107 DatatypeProp.dtK datatype_distinctness_limit
5108 fast_arith_neq_limit fast_arith_neq_limit
5109 fast_arith_split_limit fast_arith_split_limit
5111 * Named collections of theorems may be easily installed as context
5112 data using the functor NamedThmsFun (see also
5113 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
5114 attributes; there is also a toplevel print command. This facility is
5115 just a common case of general context data, which is the preferred way
5116 for anything more complex than just a list of facts in canonical
5119 * Isar: command 'declaration' augments a local theory by generic
5120 declaration functions written in ML. This enables arbitrary content
5121 being added to the context, depending on a morphism that tells the
5122 difference of the original declaration context wrt. the application
5123 context encountered later on.
5125 * Isar: proper interfaces for simplification procedures. Command
5126 'simproc_setup' declares named simprocs (with match patterns, and body
5127 text in ML). Attribute "simproc" adds/deletes simprocs in the current
5128 context. ML antiquotation @{simproc name} retrieves named simprocs.
5130 * Isar: an extra pair of brackets around attribute declarations
5131 abbreviates a theorem reference involving an internal dummy fact,
5132 which will be ignored later --- only the effect of the attribute on
5133 the background context will persist. This form of in-place
5134 declarations is particularly useful with commands like 'declare' and
5135 'using', for example ``have A using [[simproc a]] by simp''.
5137 * Isar: method "assumption" (and implicit closing of subproofs) now
5138 takes simple non-atomic goal assumptions into account: after applying
5139 an assumption as a rule the resulting subgoals are solved by atomic
5140 assumption steps. This is particularly useful to finish 'obtain'
5141 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
5142 without referring to the original premise "!!x. P x ==> thesis" in the
5143 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
5146 * Isar: implicit use of prems from the Isar proof context is
5147 considered a legacy feature. Common applications like ``have A .''
5148 may be replaced by ``have A by fact'' or ``note `A`''. In general,
5149 referencing facts explicitly here improves readability and
5150 maintainability of proof texts.
5152 * Isar: improper proof element 'guess' is like 'obtain', but derives
5153 the obtained context from the course of reasoning! For example:
5155 assume "EX x y. A x & B y" -- "any previous fact"
5156 then guess x and y by clarify
5158 This technique is potentially adventurous, depending on the facts and
5159 proof tools being involved here.
5161 * Isar: known facts from the proof context may be specified as literal
5162 propositions, using ASCII back-quote syntax. This works wherever
5163 named facts used to be allowed so far, in proof commands, proof
5164 methods, attributes etc. Literal facts are retrieved from the context
5165 according to unification of type and term parameters. For example,
5166 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
5167 theorems in the current context, then these are valid literal facts:
5168 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
5170 There is also a proof method "fact" which does the same composition
5171 for explicit goal states, e.g. the following proof texts coincide with
5172 certain special cases of literal facts:
5174 have "A" by fact == note `A`
5175 have "A ==> B" by fact == note `A ==> B`
5176 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
5177 have "P a ==> Q a" by fact == note `P a ==> Q a`
5179 * Isar: ":" (colon) is no longer a symbolic identifier character in
5180 outer syntax. Thus symbolic identifiers may be used without
5181 additional white space in declarations like this: ``assume *: A''.
5183 * Isar: 'print_facts' prints all local facts of the current context,
5184 both named and unnamed ones.
5186 * Isar: 'def' now admits simultaneous definitions, e.g.:
5188 def x == "t" and y == "u"
5190 * Isar: added command 'unfolding', which is structurally similar to
5191 'using', but affects both the goal state and facts by unfolding given
5192 rewrite rules. Thus many occurrences of the 'unfold' method or
5193 'unfolded' attribute may be replaced by first-class proof text.
5195 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
5196 and command 'unfolding' now all support object-level equalities
5197 (potentially conditional). The underlying notion of rewrite rule is
5198 analogous to the 'rule_format' attribute, but *not* that of the
5199 Simplifier (which is usually more generous).
5201 * Isar: the new attribute [rotated n] (default n = 1) rotates the
5202 premises of a theorem by n. Useful in conjunction with drule.
5204 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
5205 method expression within a sandbox consisting of the first N
5206 sub-goals, which need to exist. For example, ``simp_all [3]''
5207 simplifies the first three sub-goals, while (rule foo, simp_all)[]
5208 simplifies all new goals that emerge from applying rule foo to the
5209 originally first one.
5211 * Isar: schematic goals are no longer restricted to higher-order
5212 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
5215 * Isar: the conclusion of a long theorem statement is now either
5216 'shows' (a simultaneous conjunction, as before), or 'obtains'
5217 (essentially a disjunction of cases with local parameters and
5218 assumptions). The latter allows to express general elimination rules
5219 adequately; in this notation common elimination rules look like this:
5221 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
5223 obtains x where "P x"
5225 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
5229 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
5235 The subsequent classical rules even refer to the formal "thesis"
5238 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
5241 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
5242 obtains "thesis ==> something"
5244 The actual proof of an 'obtains' statement is analogous to that of the
5245 Isar proof element 'obtain', only that there may be several cases.
5246 Optional case names may be specified in parentheses; these will be
5247 available both in the present proof and as annotations in the
5248 resulting rule, for later use with the 'cases' method (cf. attribute
5251 * Isar: the assumptions of a long theorem statement are available as
5252 "assms" fact in the proof context. This is more appropriate than the
5253 (historical) "prems", which refers to all assumptions of the current
5254 context, including those from the target locale, proof body etc.
5256 * Isar: 'print_statement' prints theorems from the current theory or
5257 proof context in long statement form, according to the syntax of a
5260 * Isar: 'obtain' takes an optional case name for the local context
5261 introduction rule (default "that").
5263 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
5264 explicit (is "_ ==> ?foo") in the rare cases where this still happens
5267 * Pure: syntax "CONST name" produces a fully internalized constant
5268 according to the current context. This is particularly useful for
5269 syntax translations that should refer to internal constant
5270 representations independently of name spaces.
5272 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
5273 instead of "FOO ". This allows multiple binder declarations to coexist
5274 in the same context. INCOMPATIBILITY.
5276 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
5277 primitive that also works in a locale context (both for constants and
5278 fixed variables). Type declaration and internal syntactic representation
5279 of given constants retrieved from the context. Likewise, the
5280 'no_notation' command allows to remove given syntax annotations from the
5283 * Isar/locales: new derived specification elements 'axiomatization',
5284 'definition', 'abbreviation', which support type-inference, admit
5285 object-level specifications (equality, equivalence). See also the
5286 isar-ref manual. Examples:
5289 eq (infix "===" 50) where
5290 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
5292 definition "f x y = x + y + 1"
5293 definition g where "g x = f x x"
5296 neq (infix "=!=" 50) where
5297 "x =!= y == ~ (x === y)"
5299 These specifications may be also used in a locale context. Then the
5300 constants being introduced depend on certain fixed parameters, and the
5301 constant name is qualified by the locale base name. An internal
5302 abbreviation takes care for convenient input and output, making the
5303 parameters implicit and using the original short name. See also
5304 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
5305 entities from a monomorphic theory.
5307 Presently, abbreviations are only available 'in' a target locale, but
5308 not inherited by general import expressions. Also note that
5309 'abbreviation' may be used as a type-safe replacement for 'syntax' +
5310 'translations' in common applications. The "no_abbrevs" print mode
5311 prevents folding of abbreviations in term output.
5313 Concrete syntax is attached to specified constants in internal form,
5314 independently of name spaces. The parse tree representation is
5315 slightly different -- use 'notation' instead of raw 'syntax', and
5316 'translations' with explicit "CONST" markup to accommodate this.
5318 * Pure/Isar: unified syntax for new-style specification mechanisms
5319 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
5320 full type inference and dummy patterns ("_"). For example:
5322 definition "K x _ = x"
5324 inductive conj for A B
5325 where "A ==> B ==> conj A B"
5327 * Pure: command 'print_abbrevs' prints all constant abbreviations of
5328 the current context. Print mode "no_abbrevs" prevents inversion of
5329 abbreviations on output.
5331 * Isar/locales: improved parameter handling: use of locales "var" and
5332 "struct" no longer necessary; - parameter renamings are no longer
5333 required to be injective. For example, this allows to define
5334 endomorphisms as locale endom = homom mult mult h.
5336 * Isar/locales: changed the way locales with predicates are defined.
5337 Instead of accumulating the specification, the imported expression is
5338 now an interpretation. INCOMPATIBILITY: different normal form of
5339 locale expressions. In particular, in interpretations of locales with
5340 predicates, goals repesenting already interpreted fragments are not
5341 removed automatically. Use methods `intro_locales' and
5342 `unfold_locales'; see below.
5344 * Isar/locales: new methods `intro_locales' and `unfold_locales'
5345 provide backward reasoning on locales predicates. The methods are
5346 aware of interpretations and discharge corresponding goals.
5347 `intro_locales' is less aggressive then `unfold_locales' and does not
5348 unfold predicates to assumptions.
5350 * Isar/locales: the order in which locale fragments are accumulated
5351 has changed. This enables to override declarations from fragments due
5352 to interpretations -- for example, unwanted simp rules.
5354 * Isar/locales: interpretation in theories and proof contexts has been
5355 extended. One may now specify (and prove) equations, which are
5356 unfolded in interpreted theorems. This is useful for replacing
5357 defined concepts (constants depending on locale parameters) by
5358 concepts already existing in the target context. Example:
5360 interpretation partial_order ["op <= :: [int, int] => bool"]
5361 where "partial_order.less (op <=) (x::int) y = (x < y)"
5363 Typically, the constant `partial_order.less' is created by a
5364 definition specification element in the context of locale
5367 * Method "induct": improved internal context management to support
5368 local fixes and defines on-the-fly. Thus explicit meta-level
5369 connectives !! and ==> are rarely required anymore in inductive goals
5370 (using object-logic connectives for this purpose has been long
5371 obsolete anyway). Common proof patterns are explained in
5372 src/HOL/Induct/Common_Patterns.thy, see also
5373 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
5376 * Method "induct": improved handling of simultaneous goals. Instead of
5377 introducing object-level conjunction, the statement is now split into
5378 several conclusions, while the corresponding symbolic cases are nested
5379 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
5380 see src/HOL/Induct/Common_Patterns.thy, for example.
5382 * Method "induct": mutual induction rules are now specified as a list
5383 of rule sharing the same induction cases. HOL packages usually provide
5384 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
5385 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
5386 mutual induction rules differently, i.e. like this:
5388 (induct rule: foo_bar.inducts)
5389 (induct set: foo bar)
5390 (induct pred: foo bar)
5391 (induct type: foo bar)
5393 The ML function ProjectRule.projections turns old-style rules into the
5396 * Method "coinduct": dual of induction, see
5397 src/HOL/Library/Coinductive_List.thy for various examples.
5399 * Method "cases", "induct", "coinduct": the ``(open)'' option is
5400 considered a legacy feature.
5402 * Attribute "symmetric" produces result with standardized schematic
5403 variables (index 0). Potential INCOMPATIBILITY.
5405 * Simplifier: by default the simplifier trace only shows top level
5406 rewrites now. That is, trace_simp_depth_limit is set to 1 by
5407 default. Thus there is less danger of being flooded by the trace. The
5408 trace indicates where parts have been suppressed.
5410 * Provers/classical: removed obsolete classical version of elim_format
5411 attribute; classical elim/dest rules are now treated uniformly when
5412 manipulating the claset.
5414 * Provers/classical: stricter checks to ensure that supplied intro,
5415 dest and elim rules are well-formed; dest and elim rules must have at
5418 * Provers/classical: attributes dest/elim/intro take an optional
5419 weight argument for the rule (just as the Pure versions). Weights are
5420 ignored by automated tools, but determine the search order of single
5423 * Syntax: input syntax now supports dummy variable binding "%_. b",
5424 where the body does not mention the bound variable. Note that dummy
5425 patterns implicitly depend on their context of bounds, which makes
5426 "{_. _}" match any set comprehension as expected. Potential
5427 INCOMPATIBILITY -- parse translations need to cope with syntactic
5428 constant "_idtdummy" in the binding position.
5430 * Syntax: removed obsolete syntactic constant "_K" and its associated
5431 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
5432 for example "A -> B" => "Pi A (%_. B)".
5434 * Pure: 'class_deps' command visualizes the subclass relation, using
5435 the graph browser tool.
5437 * Pure: 'print_theory' now suppresses certain internal declarations by
5438 default; use '!' option for full details.
5443 * Method "metis" proves goals by applying the Metis general-purpose
5444 resolution prover (see also http://gilith.com/software/metis/).
5445 Examples are in the directory MetisExamples. WARNING: the
5446 Isabelle/HOL-Metis integration does not yet work properly with
5449 * Command 'sledgehammer' invokes external automatic theorem provers as
5450 background processes. It generates calls to the "metis" method if
5451 successful. These can be pasted into the proof. Users do not have to
5452 wait for the automatic provers to return. WARNING: does not really
5453 work with multi-threading.
5455 * New "auto_quickcheck" feature tests outermost goal statements for
5456 potential counter-examples. Controlled by ML references
5457 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
5458 5000 milliseconds). Fails silently if statements is outside of
5459 executable fragment, or any other codgenerator problem occurs.
5461 * New constant "undefined" with axiom "undefined x = undefined".
5463 * Added class "HOL.eq", allowing for code generation with polymorphic
5466 * Some renaming of class constants due to canonical name prefixing in
5467 the new 'class' package:
5469 HOL.abs ~> HOL.abs_class.abs
5470 HOL.divide ~> HOL.divide_class.divide
5471 0 ~> HOL.zero_class.zero
5472 1 ~> HOL.one_class.one
5473 op + ~> HOL.plus_class.plus
5474 op - ~> HOL.minus_class.minus
5475 uminus ~> HOL.minus_class.uminus
5476 op * ~> HOL.times_class.times
5477 op < ~> HOL.ord_class.less
5478 op <= > HOL.ord_class.less_eq
5479 Nat.power ~> Power.power_class.power
5480 Nat.size ~> Nat.size_class.size
5481 Numeral.number_of ~> Numeral.number_class.number_of
5482 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
5483 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
5484 Orderings.min ~> Orderings.ord_class.min
5485 Orderings.max ~> Orderings.ord_class.max
5486 Divides.op div ~> Divides.div_class.div
5487 Divides.op mod ~> Divides.div_class.mod
5488 Divides.op dvd ~> Divides.div_class.dvd
5490 INCOMPATIBILITY. Adaptions may be required in the following cases:
5492 a) User-defined constants using any of the names "plus", "minus",
5493 "times", "less" or "less_eq". The standard syntax translations for
5494 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
5497 b) Variables named "plus", "minus", "times", "less", "less_eq"
5498 INCOMPATIBILITY: use more specific names.
5500 c) Permutative equations (e.g. "a + b = b + a")
5501 Since the change of names also changes the order of terms, permutative
5502 rewrite rules may get applied in a different order. Experience shows
5503 that this is rarely the case (only two adaptions in the whole Isabelle
5504 distribution). INCOMPATIBILITY: rewrite proofs
5506 d) ML code directly refering to constant names
5507 This in general only affects hand-written proof tactics, simprocs and
5508 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
5509 Consider using @{const_name} antiquotation.
5511 * New class "default" with associated constant "default".
5513 * Function "sgn" is now overloaded and available on int, real, complex
5514 (and other numeric types), using class "sgn". Two possible defs of
5515 sgn are given as equational assumptions in the classes sgn_if and
5516 sgn_div_norm; ordered_idom now also inherits from sgn_if.
5519 * Locale "partial_order" now unified with class "order" (cf. theory
5520 Orderings), added parameter "less". INCOMPATIBILITY.
5522 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
5523 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
5524 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
5526 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
5527 changed order of proof goals in instance proofs.
5529 * The transitivity reasoner for partial and linear orders is set up
5530 for classes "order" and "linorder". Instances of the reasoner are available
5531 in all contexts importing or interpreting the corresponding locales.
5532 Method "order" invokes the reasoner separately; the reasoner
5533 is also integrated with the Simplifier as a solver. Diagnostic
5534 command 'print_orders' shows the available instances of the reasoner
5535 in the current context.
5537 * Localized monotonicity predicate in theory "Orderings"; integrated
5538 lemmas max_of_mono and min_of_mono with this predicate.
5541 * Formulation of theorem "dense" changed slightly due to integration
5542 with new class dense_linear_order.
5544 * Uniform lattice theory development in HOL.
5546 constants "meet" and "join" now named "inf" and "sup"
5547 constant "Meet" now named "Inf"
5549 classes "meet_semilorder" and "join_semilorder" now named
5550 "lower_semilattice" and "upper_semilattice"
5551 class "lorder" now named "lattice"
5552 class "comp_lat" now named "complete_lattice"
5554 Instantiation of lattice classes allows explicit definitions
5555 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
5557 INCOMPATIBILITY. Theorem renames:
5559 meet_left_le ~> inf_le1
5560 meet_right_le ~> inf_le2
5561 join_left_le ~> sup_ge1
5562 join_right_le ~> sup_ge2
5563 meet_join_le ~> inf_sup_ord
5566 le_meet ~> le_inf_iff
5567 le_join ~> ge_sup_conv
5568 meet_idempotent ~> inf_idem
5569 join_idempotent ~> sup_idem
5570 meet_comm ~> inf_commute
5571 join_comm ~> sup_commute
5572 meet_leI1 ~> le_infI1
5573 meet_leI2 ~> le_infI2
5574 le_joinI1 ~> le_supI1
5575 le_joinI2 ~> le_supI2
5576 meet_assoc ~> inf_assoc
5577 join_assoc ~> sup_assoc
5578 meet_left_comm ~> inf_left_commute
5579 meet_left_idempotent ~> inf_left_idem
5580 join_left_comm ~> sup_left_commute
5581 join_left_idempotent ~> sup_left_idem
5584 le_def_meet ~> le_iff_inf
5585 le_def_join ~> le_iff_sup
5586 join_absorp2 ~> sup_absorb2
5587 join_absorp1 ~> sup_absorb1
5588 meet_absorp1 ~> inf_absorb1
5589 meet_absorp2 ~> inf_absorb2
5590 meet_join_absorp ~> inf_sup_absorb
5591 join_meet_absorp ~> sup_inf_absorb
5592 distrib_join_le ~> distrib_sup_le
5593 distrib_meet_le ~> distrib_inf_le
5595 add_meet_distrib_left ~> add_inf_distrib_left
5596 add_join_distrib_left ~> add_sup_distrib_left
5597 is_join_neg_meet ~> is_join_neg_inf
5598 is_meet_neg_join ~> is_meet_neg_sup
5599 add_meet_distrib_right ~> add_inf_distrib_right
5600 add_join_distrib_right ~> add_sup_distrib_right
5601 add_meet_join_distribs ~> add_sup_inf_distribs
5602 join_eq_neg_meet ~> sup_eq_neg_inf
5603 meet_eq_neg_join ~> inf_eq_neg_sup
5604 add_eq_meet_join ~> add_eq_inf_sup
5605 meet_0_imp_0 ~> inf_0_imp_0
5606 join_0_imp_0 ~> sup_0_imp_0
5607 meet_0_eq_0 ~> inf_0_eq_0
5608 join_0_eq_0 ~> sup_0_eq_0
5609 neg_meet_eq_join ~> neg_inf_eq_sup
5610 neg_join_eq_meet ~> neg_sup_eq_inf
5611 join_eq_if ~> sup_eq_if
5613 mono_meet ~> mono_inf
5614 mono_join ~> mono_sup
5615 meet_bool_eq ~> inf_bool_eq
5616 join_bool_eq ~> sup_bool_eq
5617 meet_fun_eq ~> inf_fun_eq
5618 join_fun_eq ~> sup_fun_eq
5619 meet_set_eq ~> inf_set_eq
5620 join_set_eq ~> sup_set_eq
5621 meet1_iff ~> inf1_iff
5622 meet2_iff ~> inf2_iff
5631 join1_iff ~> sup1_iff
5632 join2_iff ~> sup2_iff
5642 is_meet_Meet ~> is_meet_Inf
5643 Meet_bool_def ~> Inf_bool_def
5644 Meet_fun_def ~> Inf_fun_def
5645 Meet_greatest ~> Inf_greatest
5646 Meet_lower ~> Inf_lower
5647 Meet_set_def ~> Inf_set_def
5650 Sup_bool_eq ~> Sup_bool_def
5651 Sup_fun_eq ~> Sup_fun_def
5652 Sup_set_eq ~> Sup_set_def
5654 listsp_meetI ~> listsp_infI
5655 listsp_meet_eq ~> listsp_inf_eq
5660 * Added syntactic class "size"; overloaded constant "size" now has
5661 type "'a::size ==> bool"
5663 * Internal reorganisation of `size' of datatypes: size theorems
5664 "foo.size" are no longer subsumed by "foo.simps" (but are still
5665 simplification rules by default!); theorems "prod.size" now named
5668 * Class "div" now inherits from class "times" rather than "type".
5671 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
5672 Linorder etc. have disappeared; operations defined in terms of
5673 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
5675 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
5677 * HOL-Word: New extensive library and type for generic, fixed size
5678 machine words, with arithmetic, bit-wise, shifting and rotating
5679 operations, reflection into int, nat, and bool lists, automation for
5680 linear arithmetic (by automatic reflection into nat or int), including
5681 lemmas on overflow and monotonicity. Instantiated to all appropriate
5682 arithmetic type classes, supporting automatic simplification of
5683 numerals on all operations.
5685 * Library/Boolean_Algebra: locales for abstract boolean algebras.
5687 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
5689 * Code generator library theories:
5690 - Code_Integer represents HOL integers by big integer literals in target
5692 - Code_Char represents HOL characters by character literals in target
5694 - Code_Char_chr like Code_Char, but also offers treatment of character
5695 codes; includes Code_Integer.
5696 - Executable_Set allows to generate code for finite sets using lists.
5697 - Executable_Rat implements rational numbers as triples (sign, enumerator,
5699 - Executable_Real implements a subset of real numbers, namly those
5700 representable by rational numbers.
5701 - Efficient_Nat implements natural numbers by integers, which in general will
5702 result in higher efficency; pattern matching with 0/Suc is eliminated;
5703 includes Code_Integer.
5704 - Code_Index provides an additional datatype index which is mapped to
5705 target-language built-in integers.
5706 - Code_Message provides an additional datatype message_string which is isomorphic to
5707 strings; messages are mapped to target-language strings.
5709 * New package for inductive predicates
5711 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
5714 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5715 for z_1 :: U_1 and ... and z_n :: U_m
5717 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5720 with full support for type-inference, rather than
5722 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5724 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5725 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5727 inductive "s z_1 ... z_m"
5729 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5732 For backward compatibility, there is a wrapper allowing inductive
5733 sets to be defined with the new package via
5736 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5737 for z_1 :: U_1 and ... and z_n :: U_m
5739 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5745 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5746 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5747 for z_1 :: U_1 and ... and z_n :: U_m
5749 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5750 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5753 if the additional syntax "p ..." is required.
5755 Numerous examples can be found in the subdirectories src/HOL/Auth,
5756 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
5760 - Since declaration and definition of inductive sets or predicates
5761 is no longer separated, abbreviations involving the newly
5762 introduced sets or predicates must be specified together with the
5763 introduction rules after the 'where' keyword (see above), rather
5764 than before the actual inductive definition.
5766 - The variables in induction and elimination rules are now
5767 quantified in the order of their occurrence in the introduction
5768 rules, rather than in alphabetical order. Since this may break
5769 some proofs, these proofs either have to be repaired, e.g. by
5770 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
5771 statements of the form
5773 case (rule_i a_i_1 ... a_i_{k_i})
5775 or the old order of quantification has to be restored by explicitly adding
5776 meta-level quantifiers in the introduction rules, i.e.
5778 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
5780 - The format of the elimination rules is now
5782 p z_1 ... z_m x_1 ... x_n ==>
5783 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5788 (x_1, ..., x_n) : s z_1 ... z_m ==>
5789 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5792 for sets rather than
5794 x : s z_1 ... z_m ==>
5795 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
5798 This may require terms in goals to be expanded to n-tuples
5799 (e.g. using case_tac or simplification with the split_paired_all
5800 rule) before the above elimination rule is applicable.
5802 - The elimination or case analysis rules for (mutually) inductive
5803 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
5804 list of rules "p_1_..._p_k.elims" is no longer available.
5806 * New package "function"/"fun" for general recursive functions,
5807 supporting mutual and nested recursion, definitions in local contexts,
5808 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
5809 for small examples, and the separate tutorial on the function
5810 package. The old recdef "package" is still available as before, but
5811 users are encouraged to use the new package.
5813 * Method "lexicographic_order" automatically synthesizes termination
5814 relations as lexicographic combinations of size measures.
5816 * Case-expressions allow arbitrary constructor-patterns (including
5817 "_") and take their order into account, like in functional
5818 programming. Internally, this is translated into nested
5819 case-expressions; missing cases are added and mapped to the predefined
5820 constant "undefined". In complicated cases printing may no longer show
5821 the original input but the internal form. Lambda-abstractions allow
5822 the same form of pattern matching: "% pat1 => e1 | ..." is an
5823 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
5826 * IntDef: The constant "int :: nat => int" has been removed; now "int"
5827 is an abbreviation for "of_nat :: nat => int". The simplification
5828 rules for "of_nat" have been changed to work like "int" did
5829 previously. Potential INCOMPATIBILITY:
5830 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
5831 - of_nat_diff and of_nat_mult are no longer default simp rules
5833 * Method "algebra" solves polynomial equations over (semi)rings using
5834 Groebner bases. The (semi)ring structure is defined by locales and the
5835 tool setup depends on that generic context. Installing the method for
5836 a specific type involves instantiating the locale and possibly adding
5837 declarations for computation on the coefficients. The method is
5838 already instantiated for natural numbers and for the axiomatic class
5839 of idoms with numerals. See also the paper by Chaieb and Wenzel at
5840 CALCULEMUS 2007 for the general principles underlying this
5841 architecture of context-aware proof-tools.
5843 * Method "ferrack" implements quantifier elimination over
5844 special-purpose dense linear orders using locales (analogous to
5845 "algebra"). The method is already installed for class
5846 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
5849 * Former constant "List.op @" now named "List.append". Use ML
5850 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
5851 circumvent possible incompatibilities when working on ML level.
5853 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
5855 * New function listsum :: 'a list => 'a for arbitrary monoids.
5856 Special syntax: "SUM x <- xs. f x" (and latex variants)
5858 * New syntax for Haskell-like list comprehension (input only), eg.
5859 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
5861 * The special syntax for function "filter" has changed from [x :
5862 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
5863 comprehension syntax, and for uniformity. INCOMPATIBILITY.
5865 * [a..b] is now defined for arbitrary linear orders. It used to be
5866 defined on nat only, as an abbreviation for [a..<Suc b]
5869 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
5871 * New functions "sorted" and "sort" in src/HOL/List.thy.
5873 * New lemma collection field_simps (an extension of ring_simps) for
5874 manipulating (in)equations involving division. Multiplies with all
5875 denominators that can be proved to be non-zero (in equations) or
5876 positive/negative (in inequations).
5878 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
5879 have been improved and renamed to ring_simps, group_simps and
5880 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
5881 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
5883 * Theory Library/Commutative_Ring: switched from recdef to function
5884 package; constants add, mul, pow now curried. Infix syntax for
5885 algebraic operations.
5887 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
5890 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
5893 * HOL/records: generalised field-update to take a function on the
5894 field rather than the new value: r(|A := x|) is translated to A_update
5895 (K x) r The K-combinator that is internally used is called K_record.
5896 INCOMPATIBILITY: Usage of the plain update functions has to be
5899 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
5900 * x = 0, which are required for a semiring. Richer structures do not
5901 inherit from semiring_0 anymore, because this property is a theorem
5902 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
5903 there is more to prove, but this is mostly trivial.
5905 * Class "recpower" is generalized to arbitrary monoids, not just
5906 commutative semirings. INCOMPATIBILITY: may need to incorporate
5907 commutativity or semiring properties additionally.
5909 * Constant "List.list_all2" in List.thy now uses authentic syntax.
5910 INCOMPATIBILITY: translations containing list_all2 may go wrong,
5911 better use 'abbreviation'.
5913 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
5915 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
5916 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
5917 significant changes for setting up numeral syntax for types:
5918 - New constants Numeral.pred and Numeral.succ instead
5919 of former Numeral.bin_pred and Numeral.bin_succ.
5920 - Use integer operations instead of bin_add, bin_mult and so on.
5921 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
5922 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
5924 See src/HOL/Integ/IntArith.thy for an example setup.
5926 * Command 'normal_form' computes the normal form of a term that may
5927 contain free variables. For example ``normal_form "rev [a, b, c]"''
5928 produces ``[b, c, a]'' (without proof). This command is suitable for
5929 heavy-duty computations because the functions are compiled to ML
5930 first. Correspondingly, a method "normalization" is provided. See
5931 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
5933 * Alternative iff syntax "A <-> B" for equality on bool (with priority
5934 25 like -->); output depends on the "iff" print_mode, the default is
5935 "A = B" (with priority 50).
5937 * Relations less (<) and less_eq (<=) are also available on type bool.
5938 Modified syntax to disallow nesting without explicit parentheses,
5939 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
5942 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
5944 * Relation composition operator "op O" now has precedence 75 and binds
5945 stronger than union and intersection. INCOMPATIBILITY.
5947 * The old set interval syntax "{m..n(}" (and relatives) has been
5948 removed. Use "{m..<n}" (and relatives) instead.
5950 * In the context of the assumption "~(s = t)" the Simplifier rewrites
5951 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
5952 ``declare [[simproc del: neq]]''.
5954 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
5957 * Theorem Cons_eq_map_conv no longer declared as "simp".
5959 * Theorem setsum_mult renamed to setsum_right_distrib.
5961 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
5964 * Reimplemented methods "sat" and "satx", with several improvements:
5965 goals no longer need to be stated as "<prems> ==> False", equivalences
5966 (i.e. "=" on type bool) are handled, variable names of the form
5967 "lit_<n>" are no longer reserved, significant speedup.
5969 * Methods "sat" and "satx" can now replay MiniSat proof traces.
5970 zChaff is still supported as well.
5972 * 'inductive' and 'datatype': provide projections of mutual rules,
5973 bundled as foo_bar.inducts;
5975 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
5978 * Library: moved theory Accessible_Part to main HOL.
5980 * Library: added theory Coinductive_List of potentially infinite lists
5981 as greatest fixed-point.
5983 * Library: added theory AssocList which implements (finite) maps as
5986 * Method "evaluation" solves goals (i.e. a boolean expression)
5987 efficiently by compiling it to ML. The goal is "proved" (via an
5988 oracle) if it evaluates to True.
5990 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
5991 also when invoked by the simplifier. This results in the Simplifier
5992 being more powerful on arithmetic goals. INCOMPATIBILITY.
5993 Configuration option fast_arith_split_limit=0 recovers the old
5996 * Support for hex (0x20) and binary (0b1001) numerals.
5998 * New method: reify eqs (t), where eqs are equations for an
5999 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
6000 parameter, computes a term s::'b and a list xs::'a list and proves the
6001 theorem I xs s = t. This is also known as reification or quoting. The
6002 resulting theorem is applied to the subgoal to substitute t with I xs
6003 s. If t is omitted, the subgoal itself is reified.
6005 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
6006 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
6007 where f is supposed to be a computable function (in the sense of code
6008 generattion). The method uses reify to compute s and xs as above then
6009 applies corr_thm and uses normalization by evaluation to "prove" f s =
6010 r and finally gets the theorem t = r, which is again applied to the
6011 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
6013 * Reflection: Automatic reification now handels binding, an example is
6014 available in src/HOL/ex/ReflectionEx.thy
6016 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
6017 command 'statespace' that is similar to 'record', but introduces an
6018 abstract specification based on the locale infrastructure instead of
6019 HOL types. This leads to extra flexibility in composing state spaces,
6020 in particular multiple inheritance and renaming of components.
6025 * Hyperreal: Functions root and sqrt are now defined on negative real
6026 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
6027 Nonnegativity side conditions have been removed from many lemmas, so
6028 that more subgoals may now be solved by simplification; potential
6031 * Real: new type classes formalize real normed vector spaces and
6032 algebras, using new overloaded constants scaleR :: real => 'a => 'a
6033 and norm :: 'a => real.
6035 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
6036 reals into other types. The overloaded constant Reals :: 'a set is now
6037 defined as range of_real; potential INCOMPATIBILITY.
6039 * Real: proper support for ML code generation, including 'quickcheck'.
6040 Reals are implemented as arbitrary precision rationals.
6042 * Hyperreal: Several constants that previously worked only for the
6043 reals have been generalized, so they now work over arbitrary vector
6044 spaces. Type annotations may need to be added in some cases; potential
6047 Infinitesimal :: ('a::real_normed_vector) star set
6048 HFinite :: ('a::real_normed_vector) star set
6049 HInfinite :: ('a::real_normed_vector) star set
6050 approx :: ('a::real_normed_vector) star => 'a star => bool
6051 monad :: ('a::real_normed_vector) star => 'a star set
6052 galaxy :: ('a::real_normed_vector) star => 'a star set
6053 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
6054 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
6055 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
6056 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
6057 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
6058 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
6059 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
6060 sgn :: 'a::real_normed_vector => 'a
6061 exp :: 'a::{recpower,real_normed_field,banach} => 'a
6063 * Complex: Some complex-specific constants are now abbreviations for
6064 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
6065 hnorm. Other constants have been entirely removed in favor of the
6066 polymorphic versions (INCOMPATIBILITY):
6070 HInfinite <-- CInfinite
6071 Infinitesimal <-- CInfinitesimal
6074 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
6075 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
6076 (ns)deriv <-- (ns)cderiv
6081 * Formalisation of ideals and the quotient construction over rings.
6083 * Order and lattice theory no longer based on records.
6086 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
6087 greatest_closed. INCOMPATIBILITY.
6089 * Method algebra is now set up via an attribute. For examples see
6090 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
6091 of algebraic structures.
6093 * Renamed theory CRing to Ring.
6098 * Substantial, yet incomplete support for nominal datatypes (binding
6099 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
6100 src/HOL/Nominal/Examples. Prospective users should consult
6101 http://isabelle.in.tum.de/nominal/
6106 * ML basics: just one true type int, which coincides with IntInf.int
6109 * ML within Isar: antiquotations allow to embed statically-checked
6110 formal entities in the source, referring to the context available at
6111 compile-time. For example:
6113 ML {* @{sort "{zero,one}"} *}
6114 ML {* @{typ "'a => 'b"} *}
6115 ML {* @{term "%x. x"} *}
6116 ML {* @{prop "x == y"} *}
6117 ML {* @{ctyp "'a => 'b"} *}
6118 ML {* @{cterm "%x. x"} *}
6119 ML {* @{cprop "x == y"} *}
6120 ML {* @{thm asm_rl} *}
6121 ML {* @{thms asm_rl} *}
6122 ML {* @{type_name c} *}
6123 ML {* @{type_syntax c} *}
6124 ML {* @{const_name c} *}
6125 ML {* @{const_syntax c} *}
6128 ML {* @{theory Pure} *}
6129 ML {* @{theory_ref} *}
6130 ML {* @{theory_ref Pure} *}
6133 ML {* @{clasimpset} *}
6135 The same works for sources being ``used'' within an Isar context.
6137 * ML in Isar: improved error reporting; extra verbosity with
6138 ML_Context.trace enabled.
6140 * Pure/General/table.ML: the join operations now works via exceptions
6141 DUP/SAME instead of type option. This is simpler in simple cases, and
6142 admits slightly more efficient complex applications.
6144 * Pure: 'advanced' translation functions (parse_translation etc.) now
6145 use Context.generic instead of just theory.
6147 * Pure: datatype Context.generic joins theory/Proof.context and
6148 provides some facilities for code that works in either kind of
6149 context, notably GenericDataFun for uniform theory and proof data.
6151 * Pure: simplified internal attribute type, which is now always
6152 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
6153 local (Proof.context) attributes have been discontinued, while
6154 minimizing code duplication. Thm.rule_attribute and
6155 Thm.declaration_attribute build canonical attributes; see also structure
6156 Context for further operations on Context.generic, notably
6157 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
6158 declarations and definitions.
6160 * Context data interfaces (Theory/Proof/GenericDataFun): removed
6161 name/print, uninitialized data defaults to ad-hoc copy of empty value,
6162 init only required for impure data. INCOMPATIBILITY: empty really need
6163 to be empty (no dependencies on theory content!)
6165 * Pure/kernel: consts certification ignores sort constraints given in
6166 signature declarations. (This information is not relevant to the
6167 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
6168 potential INCOMPATIBILITY.
6170 * Pure: axiomatic type classes are now purely definitional, with
6171 explicit proofs of class axioms and super class relations performed
6172 internally. See Pure/axclass.ML for the main internal interfaces --
6173 notably AxClass.define_class supercedes AxClass.add_axclass, and
6174 AxClass.axiomatize_class/classrel/arity supersede
6175 Sign.add_classes/classrel/arities.
6177 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
6178 global/local versions on theory vs. Proof.context have been
6179 discontinued; Attrib.syntax and Method.syntax have been adapted
6180 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
6181 attributes, methods, etc.
6183 * Pure: several functions of signature "... -> theory -> theory * ..."
6184 have been reoriented to "... -> theory -> ... * theory" in order to
6185 allow natural usage in combination with the ||>, ||>>, |-> and
6186 fold_map combinators.
6188 * Pure: official theorem names (closed derivations) and additional
6189 comments (tags) are now strictly separate. Name hints -- which are
6190 maintained as tags -- may be attached any time without affecting the
6193 * Pure: primitive rule lift_rule now takes goal cterm instead of an
6194 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
6195 achieve the old behaviour.
6197 * Pure: the "Goal" constant is now called "prop", supporting a
6198 slightly more general idea of ``protecting'' meta-level rule
6201 * Pure: Logic.(un)varify only works in a global context, which is now
6202 enforced instead of silently assumed. INCOMPATIBILITY, may use
6203 Logic.legacy_(un)varify as temporary workaround.
6205 * Pure: structure Name provides scalable operations for generating
6206 internal variable names, notably Name.variants etc. This replaces
6207 some popular functions from term.ML:
6209 Term.variant -> Name.variant
6210 Term.variantlist -> Name.variant_list
6211 Term.invent_names -> Name.invent_list
6213 Note that low-level renaming rarely occurs in new code -- operations
6214 from structure Variable are used instead (see below).
6216 * Pure: structure Variable provides fundamental operations for proper
6217 treatment of fixed/schematic variables in a context. For example,
6218 Variable.import introduces fixes for schematics of given facts and
6219 Variable.export reverses the effect (up to renaming) -- this replaces
6220 various freeze_thaw operations.
6222 * Pure: structure Goal provides simple interfaces for
6223 init/conclude/finish and tactical prove operations (replacing former
6224 Tactic.prove). Goal.prove is the canonical way to prove results
6225 within a given context; Goal.prove_global is a degraded version for
6226 theory level goals, including a global Drule.standard. Note that
6227 OldGoals.prove_goalw_cterm has long been obsolete, since it is
6228 ill-behaved in a local proof context (e.g. with local fixes/assumes or
6229 in a locale context).
6231 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
6232 and type checking (Syntax.check_term etc.), with common combinations
6233 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
6234 which are considered legacy and await removal.
6236 * Pure/Syntax: generic interfaces for type unchecking
6237 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
6238 with common combinations (Syntax.pretty_term, Syntax.string_of_term
6239 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
6240 available for convenience, but refer to the very same operations using
6241 a mere theory instead of a full context.
6243 * Isar: simplified treatment of user-level errors, using exception
6244 ERROR of string uniformly. Function error now merely raises ERROR,
6245 without any side effect on output channels. The Isar toplevel takes
6246 care of proper display of ERROR exceptions. ML code may use plain
6247 handle/can/try; cat_error may be used to concatenate errors like this:
6249 ... handle ERROR msg => cat_error msg "..."
6251 Toplevel ML code (run directly or through the Isar toplevel) may be
6252 embedded into the Isar toplevel with exception display/debug like
6255 Isar.toplevel (fn () => ...)
6257 INCOMPATIBILITY, removed special transform_error facilities, removed
6258 obsolete variants of user-level exceptions (ERROR_MESSAGE,
6259 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
6260 -- use plain ERROR instead.
6262 * Isar: theory setup now has type (theory -> theory), instead of a
6263 list. INCOMPATIBILITY, may use #> to compose setup functions.
6265 * Isar: ML toplevel pretty printer for type Proof.context, subject to
6266 ProofContext.debug/verbose flags.
6268 * Isar: Toplevel.theory_to_proof admits transactions that modify the
6269 theory before entering a proof state. Transactions now always see a
6270 quasi-functional intermediate checkpoint, both in interactive and
6273 * Isar: simplified interfaces for outer syntax. Renamed
6274 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
6275 OuterSyntax.add_parsers -- this functionality is now included in
6276 OuterSyntax.command etc. INCOMPATIBILITY.
6278 * Simplifier: the simpset of a running simplification process now
6279 contains a proof context (cf. Simplifier.the_context), which is the
6280 very context that the initial simpset has been retrieved from (by
6281 simpset_of/local_simpset_of). Consequently, all plug-in components
6282 (solver, looper etc.) may depend on arbitrary proof data.
6284 * Simplifier.inherit_context inherits the proof context (plus the
6285 local bounds) of the current simplification process; any simproc
6286 etc. that calls the Simplifier recursively should do this! Removed
6287 former Simplifier.inherit_bounds, which is already included here --
6288 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
6289 specify an explicit context using Simplifier.context/theory_context.
6291 * Simplifier/Classical Reasoner: more abstract interfaces
6292 change_simpset/claset for modifying the simpset/claset reference of a
6293 theory; raw versions simpset/claset_ref etc. have been discontinued --
6296 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
6302 * settings: the default heap location within ISABELLE_HOME_USER now
6303 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
6304 Isabelle installations.
6306 * isabelle-process: option -S (secure mode) disables some critical
6307 operations, notably runtime compilation and evaluation of ML source
6310 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
6312 * Support for parallel execution, using native multicore support of
6313 Poly/ML 5.1. The theory loader exploits parallelism when processing
6314 independent theories, according to the given theory header
6315 specifications. The maximum number of worker threads is specified via
6316 usedir option -M or the "max-threads" setting in Proof General. A
6317 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
6318 to 6 on a 8-core machine. User-code needs to observe certain
6319 guidelines for thread-safe programming, see appendix A in the Isar
6320 Implementation manual.
6324 New in Isabelle2005 (October 2005)
6325 ----------------------------------
6329 * Theory headers: the new header syntax for Isar theories is
6332 imports <theory1> ... <theoryN>
6333 uses <file1> ... <fileM>
6336 where the 'uses' part is optional. The previous syntax
6338 theory <name> = <theory1> + ... + <theoryN>:
6340 will disappear in the next release. Use isatool fixheaders to convert
6341 existing theory files. Note that there is no change in ancient
6342 non-Isar theories now, but these will disappear soon.
6344 * Theory loader: parent theories can now also be referred to via
6345 relative and absolute paths.
6347 * Command 'find_theorems' searches for a list of criteria instead of a
6348 list of constants. Known criteria are: intro, elim, dest, name:string,
6349 simp:term, and any term. Criteria can be preceded by '-' to select
6350 theorems that do not match. Intro, elim, dest select theorems that
6351 match the current goal, name:s selects theorems whose fully qualified
6352 name contain s, and simp:term selects all simplification rules whose
6353 lhs match term. Any other term is interpreted as pattern and selects
6354 all theorems matching the pattern. Available in ProofGeneral under
6355 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
6357 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
6359 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
6360 matching the current goal as introduction rule and not having "HOL."
6361 in their name (i.e. not being defined in theory HOL).
6363 * Command 'thms_containing' has been discontinued in favour of
6364 'find_theorems'; INCOMPATIBILITY.
6366 * Communication with Proof General is now 8bit clean, which means that
6367 Unicode text in UTF-8 encoding may be used within theory texts (both
6368 formal and informal parts). Cf. option -U of the Isabelle Proof
6369 General interface. Here are some simple examples (cf. src/HOL/ex):
6371 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
6372 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
6374 * Improved efficiency of the Simplifier and, to a lesser degree, the
6375 Classical Reasoner. Typical big applications run around 2 times
6379 *** Document preparation ***
6381 * Commands 'display_drafts' and 'print_drafts' perform simple output
6382 of raw sources. Only those symbols that do not require additional
6383 LaTeX packages (depending on comments in isabellesym.sty) are
6384 displayed properly, everything else is left verbatim. isatool display
6385 and isatool print are used as front ends (these are subject to the
6386 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
6388 * Command tags control specific markup of certain regions of text,
6389 notably folding and hiding. Predefined tags include "theory" (for
6390 theory begin and end), "proof" for proof commands, and "ML" for
6391 commands involving ML code; the additional tags "visible" and
6392 "invisible" are unused by default. Users may give explicit tag
6393 specifications in the text, e.g. ''by %invisible (auto)''. The
6394 interpretation of tags is determined by the LaTeX job during document
6395 preparation: see option -V of isatool usedir, or options -n and -t of
6396 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
6399 Several document versions may be produced at the same time via isatool
6400 usedir (the generated index.html will link all of them). Typical
6401 specifications include ''-V document=theory,proof,ML'' to present
6402 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
6403 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
6404 these parts without any formal replacement text. The Isabelle site
6405 default settings produce ''document'' and ''outline'' versions as
6408 * Several new antiquotations:
6410 @{term_type term} prints a term with its type annotated;
6412 @{typeof term} prints the type of a term;
6414 @{const const} is the same as @{term const}, but checks that the
6415 argument is a known logical constant;
6417 @{term_style style term} and @{thm_style style thm} print a term or
6418 theorem applying a "style" to it
6422 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
6423 definitions, equations, inequations etc., 'concl' printing only the
6424 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
6425 to print the specified premise. TermStyle.add_style provides an ML
6426 interface for introducing further styles. See also the "LaTeX Sugar"
6427 document practical applications. The ML antiquotation prints
6428 type-checked ML expressions verbatim.
6430 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
6431 and 'text' support optional locale specification '(in loc)', which
6432 specifies the default context for interpreting antiquotations. For
6433 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
6435 * Option 'locale=NAME' of antiquotations specifies an alternative
6436 context interpreting the subsequent argument. For example: @{thm
6437 [locale=lattice] inf_assoc}.
6439 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
6442 * Proper output of antiquotations for theory commands involving a
6443 proof context (such as 'locale' or 'theorem (in loc) ...').
6445 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
6446 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
6448 * isatool usedir: new option -C (default true) controls whether option
6449 -D should include a copy of the original document directory; -C false
6450 prevents unwanted effects such as copying of administrative CVS data.
6455 * Considerably improved version of 'constdefs' command. Now performs
6456 automatic type-inference of declared constants; additional support for
6457 local structure declarations (cf. locales and HOL records), see also
6458 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
6459 sequential dependencies of definitions within a single 'constdefs'
6460 section; moreover, the declared name needs to be an identifier. If
6461 all fails, consider to fall back on 'consts' and 'defs' separately.
6463 * Improved indexed syntax and implicit structures. First of all,
6464 indexed syntax provides a notational device for subscripted
6465 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
6466 expressions. Secondly, in a local context with structure
6467 declarations, number indexes \<^sub>n or the empty index (default
6468 number 1) refer to a certain fixed variable implicitly; option
6469 show_structs controls printing of implicit structures. Typical
6470 applications of these concepts involve record types and locales.
6472 * New command 'no_syntax' removes grammar declarations (and
6473 translations) resulting from the given syntax specification, which is
6474 interpreted in the same manner as for the 'syntax' command.
6476 * 'Advanced' translation functions (parse_translation etc.) may depend
6477 on the signature of the theory context being presently used for
6478 parsing/printing, see also isar-ref manual.
6480 * Improved 'oracle' command provides a type-safe interface to turn an
6481 ML expression of type theory -> T -> term into a primitive rule of
6482 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
6483 is already included here); see also FOL/ex/IffExample.thy;
6486 * axclass: name space prefix for class "c" is now "c_class" (was "c"
6487 before); "cI" is no longer bound, use "c.intro" instead.
6488 INCOMPATIBILITY. This change avoids clashes of fact bindings for
6489 axclasses vs. locales.
6491 * Improved internal renaming of symbolic identifiers -- attach primes
6492 instead of base 26 numbers.
6494 * New flag show_question_marks controls printing of leading question
6495 marks in schematic variable names.
6497 * In schematic variable names, *any* symbol following \<^isub> or
6498 \<^isup> is now treated as part of the base name. For example, the
6499 following works without printing of awkward ".0" indexes:
6501 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
6504 * Inner syntax includes (*(*nested*) comments*).
6506 * Pretty printer now supports unbreakable blocks, specified in mixfix
6507 annotations as "(00...)".
6509 * Clear separation of logical types and nonterminals, where the latter
6510 may only occur in 'syntax' specifications or type abbreviations.
6511 Before that distinction was only partially implemented via type class
6512 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
6513 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
6514 exotic syntax specifications may require further adaption
6515 (e.g. Cube/Cube.thy).
6517 * Removed obsolete type class "logic", use the top sort {} instead.
6518 Note that non-logical types should be declared as 'nonterminals'
6519 rather than 'types'. INCOMPATIBILITY for new object-logic
6522 * Attributes 'induct' and 'cases': type or set names may now be
6523 locally fixed variables as well.
6525 * Simplifier: can now control the depth to which conditional rewriting
6526 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
6529 * Simplifier: simplification procedures may now take the current
6530 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
6531 interface), which is very useful for calling the Simplifier
6532 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
6533 is gone -- use prems_of_ss on the simpset instead. Moreover, the
6534 low-level mk_simproc no longer applies Logic.varify internally, to
6535 allow for use in a context of fixed variables.
6537 * thin_tac now works even if the assumption being deleted contains !!
6538 or ==>. More generally, erule now works even if the major premise of
6539 the elimination rule contains !! or ==>.
6541 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
6543 * Reorganized bootstrapping of the Pure theories; CPure is now derived
6544 from Pure, which contains all common declarations already. Both
6545 theories are defined via plain Isabelle/Isar .thy files.
6546 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
6547 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
6548 use isatool fixcpure to adapt your theory and ML sources.
6550 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
6551 selections of theorems in named facts via index ranges.
6553 * 'print_theorems': in theory mode, really print the difference
6554 wrt. the last state (works for interactive theory development only),
6555 in proof mode print all local facts (cf. 'print_facts');
6557 * 'hide': option '(open)' hides only base names.
6559 * More efficient treatment of intermediate checkpoints in interactive
6562 * Code generator is now invoked via code_module (incremental code
6563 generation) and code_library (modular code generation, ML structures
6564 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
6565 must be quoted when used as identifiers.
6567 * New 'value' command for reading, evaluating and printing terms using
6568 the code generator. INCOMPATIBILITY: command keyword 'value' must be
6569 quoted when used as identifier.
6574 * New commands for the interpretation of locale expressions in
6575 theories (1), locales (2) and proof contexts (3). These generate
6576 proof obligations from the expression specification. After the
6577 obligations have been discharged, theorems of the expression are added
6578 to the theory, target locale or proof context. The synopsis of the
6579 commands is a follows:
6581 (1) interpretation expr inst
6582 (2) interpretation target < expr
6583 (3) interpret expr inst
6585 Interpretation in theories and proof contexts require a parameter
6586 instantiation of terms from the current context. This is applied to
6587 specifications and theorems of the interpreted expression.
6588 Interpretation in locales only permits parameter renaming through the
6589 locale expression. Interpretation is smart in that interpretations
6590 that are active already do not occur in proof obligations, neither are
6591 instantiated theorems stored in duplicate. Use 'print_interps' to
6592 inspect active interpretations of a particular locale. For details,
6593 see the Isar Reference manual. Examples can be found in
6594 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
6596 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
6597 'interpret' instead.
6599 * New context element 'constrains' for adding type constraints to
6602 * Context expressions: renaming of parameters with syntax
6605 * Locale declaration: 'includes' disallowed.
6607 * Proper static binding of attribute syntax -- i.e. types / terms /
6608 facts mentioned as arguments are always those of the locale definition
6609 context, independently of the context of later invocations. Moreover,
6610 locale operations (renaming and type / term instantiation) are applied
6611 to attribute arguments as expected.
6613 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
6614 actual attributes; rare situations may require Attrib.attribute to
6615 embed those attributes into Attrib.src that lack concrete syntax.
6616 Attribute implementations need to cooperate properly with the static
6617 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
6618 Attrib.XXX_thm etc. already do the right thing without further
6619 intervention. Only unusual applications -- such as "where" or "of"
6620 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
6621 on the context and the facts involved -- may have to assign parsed
6622 values to argument tokens explicitly.
6624 * Changed parameter management in theorem generation for long goal
6625 statements with 'includes'. INCOMPATIBILITY: produces a different
6626 theorem statement in rare situations.
6628 * Locale inspection command 'print_locale' omits notes elements. Use
6629 'print_locale!' to have them included in the output.
6634 * Provers/hypsubst.ML: improved version of the subst method, for
6635 single-step rewriting: it now works in bound variable contexts. New is
6636 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
6637 rewrite a different subterm than the original subst method, which is
6638 still available as 'simplesubst'.
6640 * Provers/quasi.ML: new transitivity reasoners for transitivity only
6643 * Provers/trancl.ML: new transitivity reasoner for transitive and
6644 reflexive-transitive closure of relations.
6646 * Provers/blast.ML: new reference depth_limit to make blast's depth
6647 limit (previously hard-coded with a value of 20) user-definable.
6649 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
6650 is peformed already. Object-logics merely need to finish their
6651 initial simpset configuration as before. INCOMPATIBILITY.
6656 * Symbolic syntax of Hilbert Choice Operator is now as follows:
6659 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
6661 The symbol \<some> is displayed as the alternative epsilon of LaTeX
6662 and x-symbol; use option '-m epsilon' to get it actually printed.
6663 Moreover, the mathematically important symbolic identifier \<epsilon>
6664 becomes available as variable, constant etc. INCOMPATIBILITY,
6666 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
6667 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
6668 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
6669 support corresponding Isar calculations.
6671 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
6674 * theory SetInterval: changed the syntax for open intervals:
6683 The old syntax is still supported but will disappear in the next
6684 release. For conversion use the following Emacs search and replace
6685 patterns (these are not perfect but work quite well):
6687 {)\([^\.]*\)\.\. -> {\1<\.\.}
6688 \.\.\([^(}]*\)(} -> \.\.<\1}
6690 * Theory Commutative_Ring (in Library): method comm_ring for proving
6691 equalities in commutative rings; method 'algebra' provides a generic
6694 * Theory Finite_Set: changed the syntax for 'setsum', summation over
6695 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
6696 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
6699 Some new syntax forms are available:
6701 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
6702 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
6703 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
6704 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
6706 The latter form "\<Sum>x < k. e" used to be based on a separate
6707 function "Summation", which has been discontinued.
6709 * theory Finite_Set: in structured induction proofs, the insert case
6710 is now 'case (insert x F)' instead of the old counterintuitive 'case
6713 * The 'refute' command has been extended to support a much larger
6714 fragment of HOL, including axiomatic type classes, constdefs and
6715 typedefs, inductive datatypes and recursion.
6717 * New tactics 'sat' and 'satx' to prove propositional tautologies.
6718 Requires zChaff with proof generation to be installed. See
6719 HOL/ex/SAT_Examples.thy for examples.
6721 * Datatype induction via method 'induct' now preserves the name of the
6722 induction variable. For example, when proving P(xs::'a list) by
6723 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
6724 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
6725 in unstructured proof scripts.
6727 * Reworked implementation of records. Improved scalability for
6728 records with many fields, avoiding performance problems for type
6729 inference. Records are no longer composed of nested field types, but
6730 of nested extension types. Therefore the record type only grows linear
6731 in the number of extensions and not in the number of fields. The
6732 top-level (users) view on records is preserved. Potential
6733 INCOMPATIBILITY only in strange cases, where the theory depends on the
6734 old record representation. The type generated for a record is called
6735 <record_name>_ext_type.
6737 Flag record_quick_and_dirty_sensitive can be enabled to skip the
6738 proofs triggered by a record definition or a simproc (if
6739 quick_and_dirty is enabled). Definitions of large records can take
6742 New simproc record_upd_simproc for simplification of multiple record
6743 updates enabled by default. Moreover, trivial updates are also
6744 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
6745 occasionally, since simplification is more powerful by default.
6747 * typedef: proper support for polymorphic sets, which contain extra
6748 type-variables in the term.
6750 * Simplifier: automatically reasons about transitivity chains
6751 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
6752 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
6753 old proofs break occasionally as simplification may now solve more
6754 goals than previously.
6756 * Simplifier: converts x <= y into x = y if assumption y <= x is
6757 present. Works for all partial orders (class "order"), in particular
6758 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
6761 * Simplifier: new simproc for "let x = a in f x". If a is a free or
6762 bound variable or a constant then the let is unfolded. Otherwise
6763 first a is simplified to b, and then f b is simplified to g. If
6764 possible we abstract b from g arriving at "let x = b in h x",
6765 otherwise we unfold the let and arrive at g. The simproc can be
6766 enabled/disabled by the reference use_let_simproc. Potential
6767 INCOMPATIBILITY since simplification is more powerful by default.
6769 * Classical reasoning: the meson method now accepts theorems as arguments.
6771 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
6772 jobs to provide advice on the provability of subgoals.
6774 * Theory OrderedGroup and Ring_and_Field: various additions and
6775 improvements to faciliate calculations involving equalities and
6778 The following theorems have been eliminated or modified
6781 abs_eq now named abs_of_nonneg
6782 abs_of_ge_0 now named abs_of_nonneg
6783 abs_minus_eq now named abs_of_nonpos
6784 imp_abs_id now named abs_of_nonneg
6785 imp_abs_neg_id now named abs_of_nonpos
6786 mult_pos now named mult_pos_pos
6787 mult_pos_le now named mult_nonneg_nonneg
6788 mult_pos_neg_le now named mult_nonneg_nonpos
6789 mult_pos_neg2_le now named mult_nonneg_nonpos2
6790 mult_neg now named mult_neg_neg
6791 mult_neg_le now named mult_nonpos_nonpos
6793 * The following lemmas in Ring_and_Field have been added to the simplifier:
6796 not_square_less_zero
6798 The following lemmas have been deleted from Real/RealPow:
6808 * Theory Parity: added rules for simplifying exponents.
6812 The following theorems have been eliminated or modified
6815 list_all_Nil now named list_all.simps(1)
6816 list_all_Cons now named list_all.simps(2)
6817 list_all_conv now named list_all_iff
6818 set_mem_eq now named mem_iff
6820 * Theories SetsAndFunctions and BigO (see HOL/Library) support
6821 asymptotic "big O" calculations. See the notes in BigO.thy.
6826 * Theory RealDef: better support for embedding natural numbers and
6827 integers in the reals.
6829 The following theorems have been eliminated or modified
6832 exp_ge_add_one_self now requires no hypotheses
6833 real_of_int_add reversed direction of equality (use [symmetric])
6834 real_of_int_minus reversed direction of equality (use [symmetric])
6835 real_of_int_diff reversed direction of equality (use [symmetric])
6836 real_of_int_mult reversed direction of equality (use [symmetric])
6838 * Theory RComplete: expanded support for floor and ceiling functions.
6840 * Theory Ln is new, with properties of the natural logarithm
6842 * Hyperreal: There is a new type constructor "star" for making
6843 nonstandard types. The old type names are now type synonyms:
6847 hcomplex = complex star
6849 * Hyperreal: Many groups of similarly-defined constants have been
6850 replaced by polymorphic versions (INCOMPATIBILITY):
6852 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
6854 starset <-- starsetNat, starsetC
6855 *s* <-- *sNat*, *sc*
6856 starset_n <-- starsetNat_n, starsetC_n
6857 *sn* <-- *sNatn*, *scn*
6858 InternalSets <-- InternalNatSets, InternalCSets
6860 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6861 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
6862 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
6863 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
6864 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
6866 * Hyperreal: Many type-specific theorems have been removed in favor of
6867 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
6869 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
6870 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
6871 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
6872 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
6873 right_minus <-- hypreal_add_minus
6874 left_minus <-- {hypreal,hcomplex}_add_minus_left
6875 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
6876 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
6877 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
6878 mult_1_right <-- hcomplex_mult_one_right
6879 mult_zero_left <-- hcomplex_mult_zero_left
6880 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
6881 right_distrib <-- hypnat_add_mult_distrib2
6882 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
6883 right_inverse <-- hypreal_mult_inverse
6884 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
6885 order_refl <-- {hypreal,hypnat}_le_refl
6886 order_trans <-- {hypreal,hypnat}_le_trans
6887 order_antisym <-- {hypreal,hypnat}_le_anti_sym
6888 order_less_le <-- {hypreal,hypnat}_less_le
6889 linorder_linear <-- {hypreal,hypnat}_le_linear
6890 add_left_mono <-- {hypreal,hypnat}_add_left_mono
6891 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
6892 add_nonneg_nonneg <-- hypreal_le_add_order
6894 * Hyperreal: Separate theorems having to do with type-specific
6895 versions of constants have been merged into theorems that apply to the
6896 new polymorphic constants (INCOMPATIBILITY):
6898 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
6899 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
6900 STAR_Un <-- {STAR,NatStar,STARC}_Un
6901 STAR_Int <-- {STAR,NatStar,STARC}_Int
6902 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
6903 STAR_subset <-- {STAR,NatStar,STARC}_subset
6904 STAR_mem <-- {STAR,NatStar,STARC}_mem
6905 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
6906 STAR_diff <-- {STAR,STARC}_diff
6907 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
6908 STARC_hcomplex_of_complex}_image_subset
6909 starset_n_Un <-- starset{Nat,C}_n_Un
6910 starset_n_Int <-- starset{Nat,C}_n_Int
6911 starset_n_Compl <-- starset{Nat,C}_n_Compl
6912 starset_n_diff <-- starset{Nat,C}_n_diff
6913 InternalSets_Un <-- Internal{Nat,C}Sets_Un
6914 InternalSets_Int <-- Internal{Nat,C}Sets_Int
6915 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
6916 InternalSets_diff <-- Internal{Nat,C}Sets_diff
6917 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
6918 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
6919 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
6920 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
6921 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
6922 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6923 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
6924 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
6925 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
6926 starfun_diff <-- starfun{C,RC,CR}_diff
6927 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
6928 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
6929 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
6930 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
6931 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
6932 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
6933 starfun_Id <-- starfunC_Id
6934 starfun_approx <-- starfun{Nat,CR}_approx
6935 starfun_capprox <-- starfun{C,RC}_capprox
6936 starfun_abs <-- starfunNat_rabs
6937 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
6938 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
6939 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
6940 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
6941 starfun_add_capprox <-- starfun{C,RC}_add_capprox
6942 starfun_add_approx <-- starfunCR_add_approx
6943 starfun_inverse_inverse <-- starfunC_inverse_inverse
6944 starfun_divide <-- starfun{C,CR,RC}_divide
6945 starfun_n <-- starfun{Nat,C}_n
6946 starfun_n_mult <-- starfun{Nat,C}_n_mult
6947 starfun_n_add <-- starfun{Nat,C}_n_add
6948 starfun_n_add_minus <-- starfunNat_n_add_minus
6949 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
6950 starfun_n_minus <-- starfun{Nat,C}_n_minus
6951 starfun_n_eq <-- starfun{Nat,C}_n_eq
6953 star_n_add <-- {hypreal,hypnat,hcomplex}_add
6954 star_n_minus <-- {hypreal,hcomplex}_minus
6955 star_n_diff <-- {hypreal,hcomplex}_diff
6956 star_n_mult <-- {hypreal,hcomplex}_mult
6957 star_n_inverse <-- {hypreal,hcomplex}_inverse
6958 star_n_le <-- {hypreal,hypnat}_le
6959 star_n_less <-- {hypreal,hypnat}_less
6960 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
6961 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
6962 star_n_abs <-- hypreal_hrabs
6963 star_n_divide <-- hcomplex_divide
6965 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
6966 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
6967 star_of_diff <-- hypreal_of_real_diff
6968 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
6969 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
6970 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
6971 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
6972 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
6973 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
6974 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
6975 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
6976 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
6977 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
6978 star_of_number_of <-- {hypreal,hcomplex}_number_of
6979 star_of_number_less <-- number_of_less_hypreal_of_real_iff
6980 star_of_number_le <-- number_of_le_hypreal_of_real_iff
6981 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
6982 star_of_less_number <-- hypreal_of_real_less_number_of_iff
6983 star_of_le_number <-- hypreal_of_real_le_number_of_iff
6984 star_of_power <-- hypreal_of_real_power
6985 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
6987 * Hyperreal: new method "transfer" that implements the transfer
6988 principle of nonstandard analysis. With a subgoal that mentions
6989 nonstandard types like "'a star", the command "apply transfer"
6990 replaces it with an equivalent one that mentions only standard types.
6991 To be successful, all free variables must have standard types; non-
6992 standard variables must have explicit universal quantifiers.
6994 * Hyperreal: A theory of Taylor series.
6999 * Discontinued special version of 'constdefs' (which used to support
7000 continuous functions) in favor of the general Pure one with full
7003 * New simplification procedure for solving continuity conditions; it
7004 is much faster on terms with many nested lambda abstractions (cubic
7005 instead of exponential time).
7007 * New syntax for domain package: selector names are now optional.
7008 Parentheses should be omitted unless argument is lazy, for example:
7010 domain 'a stream = cons "'a" (lazy "'a stream")
7012 * New command 'fixrec' for defining recursive functions with pattern
7013 matching; defining multiple functions with mutual recursion is also
7014 supported. Patterns may include the constants cpair, spair, up, sinl,
7015 sinr, or any data constructor defined by the domain package. The given
7016 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
7017 syntax and examples.
7019 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
7020 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
7021 but the proof obligation additionally includes an admissibility
7022 requirement. The packages generate instances of class cpo or pcpo,
7023 with continuity and strictness theorems for Rep and Abs.
7025 * HOLCF: Many theorems have been renamed according to a more standard naming
7026 scheme (INCOMPATIBILITY):
7028 foo_inject: "foo$x = foo$y ==> x = y"
7029 foo_eq: "(foo$x = foo$y) = (x = y)"
7030 foo_less: "(foo$x << foo$y) = (x << y)"
7031 foo_strict: "foo$UU = UU"
7032 foo_defined: "... ==> foo$x ~= UU"
7033 foo_defined_iff: "(foo$x = UU) = (x = UU)"
7038 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
7039 including the First Isomorphism Theorem (on quotienting by the kernel
7042 * ZF/Simplifier: install second copy of type solver that actually
7043 makes use of TC rules declared to Isar proof contexts (or locales);
7044 the old version is still required for ML proof scripts.
7049 * Converted to Isar theory format; use locales instead of axiomatic
7055 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
7058 * Pure/library.ML no longer defines its own option datatype, but uses
7059 that of the SML basis, which has constructors NONE and SOME instead of
7060 None and Some, as well as exception Option.Option instead of OPTION.
7061 The functions the, if_none, is_some, is_none have been adapted
7062 accordingly, while Option.map replaces apsome.
7064 * Pure/library.ML: the exception LIST has been given up in favour of
7065 the standard exceptions Empty and Subscript, as well as
7066 Library.UnequalLengths. Function like Library.hd and Library.tl are
7067 superceded by the standard hd and tl functions etc.
7069 A number of basic list functions are no longer exported to the ML
7070 toplevel, as they are variants of predefined functions. The following
7071 suggests how one can translate existing code:
7073 rev_append xs ys = List.revAppend (xs, ys)
7074 nth_elem (i, xs) = List.nth (xs, i)
7075 last_elem xs = List.last xs
7076 flat xss = List.concat xss
7077 seq fs = List.app fs
7078 partition P xs = List.partition P xs
7079 mapfilter f xs = List.mapPartial f xs
7081 * Pure/library.ML: several combinators for linear functional
7082 transformations, notably reverse application and composition:
7085 (x, y) |-> f f #-> g
7087 * Pure/library.ML: introduced/changed precedence of infix operators:
7089 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
7091 infix 3 o oo ooo oooo;
7092 infix 4 ~~ upto downto;
7094 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
7097 * Pure/library.ML: natural list combinators fold, fold_rev, and
7098 fold_map support linear functional transformations and nesting. For
7101 fold f [x1, ..., xN] y =
7102 y |> f x1 |> ... |> f xN
7104 (fold o fold) f [xs1, ..., xsN] y =
7105 y |> fold f xs1 |> ... |> fold f xsN
7107 fold f [x1, ..., xN] =
7110 (fold o fold) f [xs1, ..., xsN] =
7111 fold f xs1 #> ... #> fold f xsN
7113 * Pure/library.ML: the following selectors on type 'a option are
7116 the: 'a option -> 'a (*partial*)
7117 these: 'a option -> 'a where 'a = 'b list
7118 the_default: 'a -> 'a option -> 'a
7119 the_list: 'a option -> 'a list
7121 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7122 basic operations for association lists, following natural argument
7123 order; moreover the explicit equality predicate passed here avoids
7124 potentially expensive polymorphic runtime equality checks.
7125 The old functions may be expressed as follows:
7127 assoc = uncurry (AList.lookup (op =))
7128 assocs = these oo AList.lookup (op =)
7129 overwrite = uncurry (AList.update (op =)) o swap
7131 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7133 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
7134 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
7136 replacing make_keylist and keyfilter (occassionally used)
7139 make_keylist = AList.make
7140 keyfilter = AList.find (op =)
7142 * eq_fst and eq_snd now take explicit equality parameter, thus
7143 avoiding eqtypes. Naive rewrites:
7145 eq_fst = eq_fst (op =)
7146 eq_snd = eq_snd (op =)
7148 * Removed deprecated apl and apr (rarely used).
7151 apl (n, op) =>>= curry op n
7152 apr (op, m) =>>= fn n => op (n, m)
7154 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
7155 provides a reasonably efficient light-weight implementation of sets as
7158 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
7159 few new operations; existing lookup and update are now curried to
7160 follow natural argument order (for use with fold etc.);
7161 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
7163 * Pure/General: output via the Isabelle channels of
7164 writeln/warning/error etc. is now passed through Output.output, with a
7165 hook for arbitrary transformations depending on the print_mode
7166 (cf. Output.add_mode -- the first active mode that provides a output
7167 function wins). Already formatted output may be embedded into further
7168 text via Output.raw; the result of Pretty.string_of/str_of and derived
7169 functions (string_of_term/cterm/thm etc.) is already marked raw to
7170 accommodate easy composition of diagnostic messages etc. Programmers
7171 rarely need to care about Output.output or Output.raw at all, with
7172 some notable exceptions: Output.output is required when bypassing the
7173 standard channels (writeln etc.), or in token translations to produce
7174 properly formatted results; Output.raw is required when capturing
7175 already output material that will eventually be presented to the user
7176 a second time. For the default print mode, both Output.output and
7177 Output.raw have no effect.
7179 * Pure/General: Output.time_accumulator NAME creates an operator ('a
7180 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
7181 cumulative results are displayed at the end of a batch session.
7183 * Pure/General: File.sysify_path and File.quote_sysify path have been
7184 replaced by File.platform_path and File.shell_path (with appropriate
7185 hooks). This provides a clean interface for unusual systems where the
7186 internal and external process view of file names are different.
7188 * Pure: more efficient orders for basic syntactic entities: added
7189 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
7190 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
7191 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
7192 orders now -- potential INCOMPATIBILITY for code that depends on a
7193 particular order for Symtab.keys, Symtab.dest, etc. (consider using
7194 Library.sort_strings on result).
7196 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
7197 fold_types traverse types/terms from left to right, observing natural
7198 argument order. Supercedes previous foldl_XXX versions, add_frees,
7199 add_vars etc. have been adapted as well: INCOMPATIBILITY.
7201 * Pure: name spaces have been refined, with significant changes of the
7202 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
7203 to extern(_table). The plain name entry path is superceded by a
7204 general 'naming' context, which also includes the 'policy' to produce
7205 a fully qualified name and external accesses of a fully qualified
7206 name; NameSpace.extend is superceded by context dependent
7207 Sign.declare_name. Several theory and proof context operations modify
7208 the naming context. Especially note Theory.restore_naming and
7209 ProofContext.restore_naming to get back to a sane state; note that
7210 Theory.add_path is no longer sufficient to recover from
7211 Theory.absolute_path in particular.
7213 * Pure: new flags short_names (default false) and unique_names
7214 (default true) for controlling output of qualified names. If
7215 short_names is set, names are printed unqualified. If unique_names is
7216 reset, the name prefix is reduced to the minimum required to achieve
7217 the original result when interning again, even if there is an overlap
7218 with earlier declarations.
7220 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
7221 now 'extend', and 'merge' gets an additional Pretty.pp argument
7222 (useful for printing error messages). INCOMPATIBILITY.
7224 * Pure: major reorganization of the theory context. Type Sign.sg and
7225 Theory.theory are now identified, referring to the universal
7226 Context.theory (see Pure/context.ML). Actual signature and theory
7227 content is managed as theory data. The old code and interfaces were
7228 spread over many files and structures; the new arrangement introduces
7229 considerable INCOMPATIBILITY to gain more clarity:
7231 Context -- theory management operations (name, identity, inclusion,
7232 parents, ancestors, merge, etc.), plus generic theory data;
7234 Sign -- logical signature and syntax operations (declaring consts,
7235 types, etc.), plus certify/read for common entities;
7237 Theory -- logical theory operations (stating axioms, definitions,
7238 oracles), plus a copy of logical signature operations (consts,
7239 types, etc.); also a few basic management operations (Theory.copy,
7242 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
7243 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
7244 for convenience -- they merely return the theory.
7246 * Pure: type Type.tsig is superceded by theory in most interfaces.
7248 * Pure: the Isar proof context type is already defined early in Pure
7249 as Context.proof (note that ProofContext.context and Proof.context are
7250 aliases, where the latter is the preferred name). This enables other
7251 Isabelle components to refer to that type even before Isar is present.
7253 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
7254 typeK, constK, axiomK, oracleK), but provide explicit operations for
7255 any of these kinds. For example, Sign.intern typeK is now
7256 Sign.intern_type, Theory.hide_space Sign.typeK is now
7257 Theory.hide_types. Also note that former
7258 Theory.hide_classes/types/consts are now
7259 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
7260 internalize their arguments! INCOMPATIBILITY.
7262 * Pure: get_thm interface (of PureThy and ProofContext) expects
7263 datatype thmref (with constructors Name and NameSelection) instead of
7264 plain string -- INCOMPATIBILITY;
7266 * Pure: cases produced by proof methods specify options, where NONE
7267 means to remove case bindings -- INCOMPATIBILITY in
7270 * Pure: the following operations retrieve axioms or theorems from a
7271 theory node or theory hierarchy, respectively:
7273 Theory.axioms_of: theory -> (string * term) list
7274 Theory.all_axioms_of: theory -> (string * term) list
7275 PureThy.thms_of: theory -> (string * thm) list
7276 PureThy.all_thms_of: theory -> (string * thm) list
7278 * Pure: print_tac now outputs the goal through the trace channel.
7280 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
7281 Reference Toplevel.debug (default false) controls detailed printing
7282 and tracing of low-level exceptions; Toplevel.profiling (default 0)
7283 controls execution profiling -- set to 1 for time and 2 for space
7284 (both increase the runtime).
7286 * Isar session: The initial use of ROOT.ML is now always timed,
7287 i.e. the log will show the actual process times, in contrast to the
7288 elapsed wall-clock time that the outer shell wrapper produces.
7290 * Simplifier: improved handling of bound variables (nameless
7291 representation, avoid allocating new strings). Simprocs that invoke
7292 the Simplifier recursively should use Simplifier.inherit_bounds to
7293 avoid local name clashes. Failure to do so produces warnings
7294 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
7295 for further details.
7297 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
7298 bindings for all theorems stored within a given theory; this may help
7299 in porting non-Isar theories to Isar ones, while keeping ML proof
7300 scripts for the time being.
7302 * ML operator HTML.with_charset specifies the charset begin used for
7303 generated HTML files. For example:
7305 HTML.with_charset "utf-8" use_thy "Hebrew";
7306 HTML.with_charset "utf-8" use_thy "Chinese";
7311 * Allow symlinks to all proper Isabelle executables (Isabelle,
7312 isabelle, isatool etc.).
7314 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
7315 isatool doc, isatool mkdir, display_drafts etc.).
7317 * isatool usedir: option -f allows specification of the ML file to be
7318 used by Isabelle; default is ROOT.ML.
7320 * New isatool version outputs the version identifier of the Isabelle
7321 distribution being used.
7323 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
7324 (containing Boolean satisfiability problems) into Isabelle/HOL
7329 New in Isabelle2004 (April 2004)
7330 --------------------------------
7334 * Provers/order.ML: new efficient reasoner for partial and linear orders.
7335 Replaces linorder.ML.
7337 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
7338 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
7339 (\<a>...\<z>), are now considered normal letters, and can therefore
7340 be used anywhere where an ASCII letter (a...zA...Z) has until
7341 now. COMPATIBILITY: This obviously changes the parsing of some
7342 terms, especially where a symbol has been used as a binder, say
7343 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
7344 as an identifier. Fix it by inserting a space around former
7345 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
7346 existing theory and ML files.
7348 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
7350 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
7351 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
7352 a normal (but invisible) letter. For multiple letter subscripts repeat
7353 \<^isub> like this: x\<^isub>1\<^isub>2.
7355 * Pure: There are now sub-/superscripts that can span more than one
7356 character. Text between \<^bsub> and \<^esub> is set in subscript in
7357 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
7358 superscript. The new control characters are not identifier parts.
7360 * Pure: Control-symbols of the form \<^raw:...> will literally print the
7361 content of "..." to the latex file instead of \isacntrl... . The "..."
7362 may consist of any printable characters excluding the end bracket >.
7364 * Pure: Using new Isar command "finalconsts" (or the ML functions
7365 Theory.add_finals or Theory.add_finals_i) it is now possible to
7366 declare constants "final", which prevents their being given a definition
7367 later. It is useful for constants whose behaviour is fixed axiomatically
7368 rather than definitionally, such as the meta-logic connectives.
7370 * Pure: 'instance' now handles general arities with general sorts
7371 (i.e. intersections of classes),
7373 * Presentation: generated HTML now uses a CSS style sheet to make layout
7374 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
7375 It can be changed to alter the colors/layout of generated pages.
7380 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
7381 cut_tac, subgoal_tac and thin_tac:
7382 - Now understand static (Isar) contexts. As a consequence, users of Isar
7383 locales are no longer forced to write Isar proof scripts.
7384 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
7386 - INCOMPATIBILITY: names of variables to be instantiated may no
7387 longer be enclosed in quotes. Instead, precede variable name with `?'.
7388 This is consistent with the instantiation attribute "where".
7390 * Attributes "where" and "of":
7391 - Now take type variables of instantiated theorem into account when reading
7392 the instantiation string. This fixes a bug that caused instantiated
7393 theorems to have too special types in some circumstances.
7394 - "where" permits explicit instantiations of type variables.
7396 * Calculation commands "moreover" and "also" no longer interfere with
7397 current facts ("this"), admitting arbitrary combinations with "then"
7401 - Goal statements involving the context element "includes" no longer
7402 generate theorems with internal delta predicates (those ending on
7403 "_axioms") in the premise.
7404 Resolve particular premise with <locale>.intro to obtain old form.
7405 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
7406 specification and "includes" elements in goal statement.
7407 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
7408 [intro?] and [elim?] (respectively) by default.
7409 - Experimental command for instantiation of locales in proof contexts:
7410 instantiate <label>[<attrs>]: <loc>
7411 Instantiates locale <loc> and adds all its theorems to the current context
7412 taking into account their attributes. Label and attrs are optional
7413 modifiers, like in theorem declarations. If present, names of
7414 instantiated theorems are qualified with <label>, and the attributes
7415 <attrs> are applied after any attributes these theorems might have already.
7416 If the locale has assumptions, a chained fact of the form
7417 "<loc> t1 ... tn" is expected from which instantiations of the parameters
7418 are derived. The command does not support old-style locales declared
7419 with "locale (open)".
7420 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
7422 * HOL: Tactic emulation methods induct_tac and case_tac understand static
7428 * Proof import: new image HOL4 contains the imported library from
7429 the HOL4 system with about 2500 theorems. It is imported by
7430 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
7431 can be used like any other Isabelle image. See
7432 HOL/Import/HOL/README for more information.
7435 - Much improved handling of linear and partial orders.
7436 Reasoners for linear and partial orders are set up for type classes
7437 "linorder" and "order" respectively, and are added to the default simpset
7438 as solvers. This means that the simplifier can build transitivity chains
7439 to solve goals from the assumptions.
7440 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
7441 of blast or auto after simplification become unnecessary because the goal
7442 is solved by simplification already.
7444 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
7445 all proved in axiomatic type classes for semirings, rings and fields.
7448 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
7449 now formalized using the Ring_and_Field theory mentioned above.
7450 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
7451 than before, because now they are set up once in a generic manner.
7452 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
7453 Look for the general versions in Ring_and_Field (and Power if they concern
7456 * Type "rat" of the rational numbers is now available in HOL-Complex.
7459 - Record types are now by default printed with their type abbreviation
7460 instead of the list of all field types. This can be configured via
7461 the reference "print_record_type_abbr".
7462 - Simproc "record_upd_simproc" for simplification of multiple updates added
7463 (not enabled by default).
7464 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
7465 EX x. x = sel r to True (not enabled by default).
7466 - Tactic "record_split_simp_tac" to split and simplify records added.
7468 * 'specification' command added, allowing for definition by
7469 specification. There is also an 'ax_specification' command that
7470 introduces the new constants axiomatically.
7472 * arith(_tac) is now able to generate counterexamples for reals as well.
7474 * HOL-Algebra: new locale "ring" for non-commutative rings.
7476 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
7477 definitions, thanks to Sava Krsti\'{c} and John Matthews.
7479 * HOL-Matrix: a first theory for matrices in HOL with an application of
7480 matrix theory to linear programming.
7482 * Unions and Intersections:
7483 The latex output syntax of UN and INT has been changed
7484 from "\Union x \in A. B" to "\Union_{x \in A} B"
7485 i.e. the index formulae has become a subscript.
7486 Similarly for "\Union x. B", and for \Inter instead of \Union.
7488 * Unions and Intersections over Intervals:
7489 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
7490 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
7491 like in normal math, and corresponding versions for < and for intersection.
7493 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
7494 lexicographic dictonary ordering has been added as "lexord".
7496 * ML: the legacy theory structures Int and List have been removed. They had
7497 conflicted with ML Basis Library structures having the same names.
7499 * 'refute' command added to search for (finite) countermodels. Only works
7500 for a fragment of HOL. The installation of an external SAT solver is
7501 highly recommended. See "HOL/Refute.thy" for details.
7503 * 'quickcheck' command: Allows to find counterexamples by evaluating
7504 formulae under an assignment of free variables to random values.
7505 In contrast to 'refute', it can deal with inductive datatypes,
7506 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
7512 * Streams now come with concatenation and are part of the HOLCF image
7516 New in Isabelle2003 (May 2003)
7517 ------------------------------
7521 * Provers/simplifier:
7523 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
7524 Assumptions are now subject to complete mutual simplification,
7525 not just from left to right. The simplifier now preserves
7526 the order of assumptions.
7528 Potential INCOMPATIBILITY:
7530 -- simp sometimes diverges where the old version did
7531 not, e.g. invoking simp on the goal
7533 [| P (f x); y = x; f x = f y |] ==> Q
7535 now gives rise to the infinite reduction sequence
7537 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
7539 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
7542 -- Tactics combining classical reasoner and simplification (such as auto)
7543 are also affected by this change, because many of them rely on
7544 simp. They may sometimes diverge as well or yield a different numbers
7545 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
7546 in case of problems. Sometimes subsequent calls to the classical
7547 reasoner will fail because a preceeding call to the simplifier too
7548 eagerly simplified the goal, e.g. deleted redundant premises.
7550 - The simplifier trace now shows the names of the applied rewrite rules
7552 - You can limit the number of recursive invocations of the simplifier
7553 during conditional rewriting (where the simplifie tries to solve the
7554 conditions before applying the rewrite rule):
7555 ML "simp_depth_limit := n"
7556 where n is an integer. Thus you can force termination where previously
7557 the simplifier would diverge.
7559 - Accepts free variables as head terms in congruence rules. Useful in Isar.
7561 - No longer aborts on failed congruence proof. Instead, the
7562 congruence is ignored.
7564 * Pure: New generic framework for extracting programs from constructive
7565 proofs. See HOL/Extraction.thy for an example instantiation, as well
7566 as HOL/Extraction for some case studies.
7568 * Pure: The main goal of the proof state is no longer shown by default, only
7569 the subgoals. This behaviour is controlled by a new flag.
7570 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
7571 (ML: Proof.show_main_goal).
7573 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
7574 rules whose conclusion matches subgoal 1:
7575 PG menu: Isabelle/Isar -> Show me -> matching rules
7576 The rules are ordered by how closely they match the subgoal.
7577 In particular, rules that solve a subgoal outright are displayed first
7578 (or rather last, the way they are printed).
7579 (ML: ProofGeneral.print_intros())
7581 * Pure: New flag trace_unify_fail causes unification to print
7582 diagnostic information (PG: in trace buffer) when it fails. This is
7583 useful for figuring out why single step proofs like rule, erule or
7586 * Pure: Locale specifications now produce predicate definitions
7587 according to the body of text (covering assumptions modulo local
7588 definitions); predicate "loc_axioms" covers newly introduced text,
7589 while "loc" is cumulative wrt. all included locale expressions; the
7590 latter view is presented only on export into the global theory
7591 context; potential INCOMPATIBILITY, use "(open)" option to fall back
7592 on the old view without predicates;
7594 * Pure: predefined locales "var" and "struct" are useful for sharing
7595 parameters (as in CASL, for example); just specify something like
7596 ``var x + var y + struct M'' as import;
7598 * Pure: improved thms_containing: proper indexing of facts instead of
7599 raw theorems; check validity of results wrt. current name space;
7600 include local facts of proof configuration (also covers active
7601 locales), cover fixed variables in index; may use "_" in term
7602 specification; an optional limit for the number of printed facts may
7603 be given (the default is 40);
7605 * Pure: disallow duplicate fact bindings within new-style theory files
7608 * Provers: improved induct method: assumptions introduced by case
7609 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
7610 the goal statement); "foo" still refers to all facts collectively;
7612 * Provers: the function blast.overloaded has been removed: all constants
7613 are regarded as potentially overloaded, which improves robustness in exchange
7614 for slight decrease in efficiency;
7616 * Provers/linorder: New generic prover for transitivity reasoning over
7617 linear orders. Note: this prover is not efficient!
7619 * Isar: preview of problems to finish 'show' now produce an error
7620 rather than just a warning (in interactive mode);
7627 - Produces a counter example if it cannot prove a goal.
7628 Note that the counter example may be spurious if the goal is not a formula
7629 of quantifier-free linear arithmetic.
7630 In ProofGeneral the counter example appears in the trace buffer.
7632 - Knows about div k and mod k where k is a numeral of type nat or int.
7634 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
7635 linear arithmetic fails. This takes account of quantifiers and divisibility.
7636 Presburger arithmetic can also be called explicitly via presburger(_tac).
7638 * simp's arithmetic capabilities have been enhanced a bit: it now
7639 takes ~= in premises into account (by performing a case split);
7641 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
7642 are distributed over a sum of terms;
7644 * New tactic "trans_tac" and method "trans" instantiate
7645 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
7648 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
7649 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
7651 * 'typedef' command has new option "open" to suppress the set
7654 * functions Min and Max on finite sets have been introduced (theory
7657 * attribute [symmetric] now works for relations as well; it turns
7658 (x,y) : R^-1 into (y,x) : R, and vice versa;
7660 * induct over a !!-quantified statement (say !!x1..xn):
7661 each "case" automatically performs "fix x1 .. xn" with exactly those names.
7663 * Map: `empty' is no longer a constant but a syntactic abbreviation for
7664 %x. None. Warning: empty_def now refers to the previously hidden definition
7667 * Algebra: formalization of classical algebra. Intended as base for
7668 any algebraic development in Isabelle. Currently covers group theory
7669 (up to Sylow's theorem) and ring theory (Universal Property of
7670 Univariate Polynomials). Contributions welcome;
7672 * GroupTheory: deleted, since its material has been moved to Algebra;
7674 * Complex: new directory of the complex numbers with numeric constants,
7675 nonstandard complex numbers, and some complex analysis, standard and
7676 nonstandard (Jacques Fleuriot);
7678 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
7680 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
7683 * Real/HahnBanach: updated and adapted to locales;
7685 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
7688 * UNITY: added the Meier-Sanders theory of progress sets;
7690 * MicroJava: bytecode verifier and lightweight bytecode verifier
7691 as abstract algorithms, instantiated to the JVM;
7693 * Bali: Java source language formalization. Type system, operational
7694 semantics, axiomatic semantics. Supported language features:
7695 classes, interfaces, objects,virtual methods, static methods,
7696 static/instance fields, arrays, access modifiers, definite
7697 assignment, exceptions.
7702 * ZF/Constructible: consistency proof for AC (Gdel's constructible
7705 * Main ZF: virtually all theories converted to new-style format;
7710 * Pure: Tactic.prove provides sane interface for internal proofs;
7711 omits the infamous "standard" operation, so this is more appropriate
7712 than prove_goalw_cterm in many situations (e.g. in simprocs);
7714 * Pure: improved error reporting of simprocs;
7716 * Provers: Simplifier.simproc(_i) provides sane interface for setting
7720 *** Document preparation ***
7722 * uses \par instead of \\ for line breaks in theory text. This may
7723 shift some page breaks in large documents. To get the old behaviour
7724 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
7726 * minimized dependencies of isabelle.sty and isabellesym.sty on
7729 * \<euro> now needs package babel/greek instead of marvosym (which
7732 * normal size for \<zero>...\<nine> (uses \mathbf instead of
7737 New in Isabelle2002 (March 2002)
7738 --------------------------------
7740 *** Document preparation ***
7742 * greatly simplified document preparation setup, including more
7743 graceful interpretation of isatool usedir -i/-d/-D options, and more
7744 instructive isatool mkdir; users should basically be able to get
7745 started with "isatool mkdir HOL Test && isatool make"; alternatively,
7746 users may run a separate document processing stage manually like this:
7747 "isatool usedir -D output HOL Test && isatool document Test/output";
7749 * theory dependency graph may now be incorporated into documents;
7750 isatool usedir -g true will produce session_graph.eps/.pdf for use
7751 with \includegraphics of LaTeX;
7753 * proper spacing of consecutive markup elements, especially text
7754 blocks after section headings;
7756 * support bold style (for single symbols only), input syntax is like
7757 this: "\<^bold>\<alpha>" or "\<^bold>A";
7759 * \<bullet> is now output as bold \cdot by default, which looks much
7760 better in printed text;
7762 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
7763 note that these symbols are currently unavailable in Proof General /
7764 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
7766 * isatool latex no longer depends on changed TEXINPUTS, instead
7767 isatool document copies the Isabelle style files to the target
7773 * Pure/Provers: improved proof by cases and induction;
7774 - 'case' command admits impromptu naming of parameters (such as
7776 - 'induct' method divinates rule instantiation from the inductive
7777 claim; no longer requires excessive ?P bindings for proper
7778 instantiation of cases;
7779 - 'induct' method properly enumerates all possibilities of set/type
7780 rules; as a consequence facts may be also passed through *type*
7781 rules without further ado;
7782 - 'induct' method now derives symbolic cases from the *rulified*
7783 rule (before it used to rulify cases stemming from the internal
7784 atomized version); this means that the context of a non-atomic
7785 statement becomes is included in the hypothesis, avoiding the
7786 slightly cumbersome show "PROP ?case" form;
7787 - 'induct' may now use elim-style induction rules without chaining
7788 facts, using ``missing'' premises from the goal state; this allows
7789 rules stemming from inductive sets to be applied in unstructured
7790 scripts, while still benefitting from proper handling of non-atomic
7791 statements; NB: major inductive premises need to be put first, all
7792 the rest of the goal is passed through the induction;
7793 - 'induct' proper support for mutual induction involving non-atomic
7794 rule statements (uses the new concept of simultaneous goals, see
7796 - append all possible rule selections, but only use the first
7797 success (no backtracking);
7798 - removed obsolete "(simplified)" and "(stripped)" options of methods;
7799 - undeclared rule case names default to numbers 1, 2, 3, ...;
7800 - added 'print_induct_rules' (covered by help item in recent Proof
7802 - moved induct/cases attributes to Pure, methods to Provers;
7803 - generic method setup instantiated for FOL and HOL;
7805 * Pure: support multiple simultaneous goal statements, for example
7806 "have a: A and b: B" (same for 'theorem' etc.); being a pure
7807 meta-level mechanism, this acts as if several individual goals had
7808 been stated separately; in particular common proof methods need to be
7809 repeated in order to cover all claims; note that a single elimination
7810 step is *not* sufficient to establish the two conjunctions, so this
7813 assume "A & B" then have A and B .. (*".." fails*)
7815 better use "obtain" in situations as above; alternative refer to
7816 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
7818 * Pure: proper integration with ``locales''; unlike the original
7819 version by Florian Kammller, Isar locales package high-level proof
7820 contexts rather than raw logical ones (e.g. we admit to include
7821 attributes everywhere); operations on locales include merge and
7822 rename; support for implicit arguments (``structures''); simultaneous
7823 type-inference over imports and text; see also HOL/ex/Locales.thy for
7826 * Pure: the following commands have been ``localized'', supporting a
7827 target locale specification "(in name)": 'lemma', 'theorem',
7828 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
7829 stored both within the locale and at the theory level (exported and
7830 qualified by the locale name);
7832 * Pure: theory goals may now be specified in ``long'' form, with
7833 ad-hoc contexts consisting of arbitrary locale elements. for example
7834 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
7835 definitions may be given, too); the result is a meta-level rule with
7836 the context elements being discharged in the obvious way;
7838 * Pure: new proof command 'using' allows to augment currently used
7839 facts after a goal statement ('using' is syntactically analogous to
7840 'apply', but acts on the goal's facts only); this allows chained facts
7841 to be separated into parts given before and after a claim, as in
7842 ``from a and b have C using d and e <proof>'';
7844 * Pure: renamed "antecedent" case to "rule_context";
7846 * Pure: new 'judgment' command records explicit information about the
7847 object-logic embedding (used by several tools internally); no longer
7848 use hard-wired "Trueprop";
7850 * Pure: added 'corollary' command;
7852 * Pure: fixed 'token_translation' command;
7854 * Pure: removed obsolete 'exported' attribute;
7856 * Pure: dummy pattern "_" in is/let is now automatically lifted over
7857 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
7858 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
7860 * Pure: method 'atomize' presents local goal premises as object-level
7861 statements (atomic meta-level propositions); setup controlled via
7862 rewrite rules declarations of 'atomize' attribute; example
7863 application: 'induct' method with proper rule statements in improper
7866 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
7867 now consider the syntactic context of assumptions, giving a better
7868 chance to get type-inference of the arguments right (this is
7869 especially important for locales);
7871 * Pure: "sorry" no longer requires quick_and_dirty in interactive
7874 * Pure/obtain: the formal conclusion "thesis", being marked as
7875 ``internal'', may no longer be reference directly in the text;
7876 potential INCOMPATIBILITY, may need to use "?thesis" in rare
7879 * Pure: generic 'sym' attribute which declares a rule both as pure
7880 'elim?' and for the 'symmetric' operation;
7882 * Pure: marginal comments ``--'' may now occur just anywhere in the
7883 text; the fixed correlation with particular command syntax has been
7886 * Pure: new method 'rules' is particularly well-suited for proof
7887 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
7888 but often produces more compact proof terms with less detours;
7890 * Pure/Provers/classical: simplified integration with pure rule
7891 attributes and methods; the classical "intro?/elim?/dest?"
7892 declarations coincide with the pure ones; the "rule" method no longer
7893 includes classically swapped intros; "intro" and "elim" methods no
7894 longer pick rules from the context; also got rid of ML declarations
7895 AddXIs/AddXEs/AddXDs; all of this has some potential for
7898 * Provers/classical: attribute 'swapped' produces classical inversions
7899 of introduction rules;
7901 * Provers/simplifier: 'simplified' attribute may refer to explicit
7902 rules instead of full simplifier context; 'iff' attribute handles
7905 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
7907 * HOL: 'recdef' now fails on unfinished automated proofs, use
7908 "(permissive)" option to recover old behavior;
7910 * HOL: 'inductive' no longer features separate (collective) attributes
7911 for 'intros' (was found too confusing);
7913 * HOL: properly declared induction rules less_induct and
7919 * HOL: moved over to sane numeral syntax; the new policy is as
7922 - 0 and 1 are polymorphic constants, which are defined on any
7923 numeric type (nat, int, real etc.);
7925 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
7926 binary representation internally;
7928 - type nat has special constructor Suc, and generally prefers Suc 0
7929 over 1::nat and Suc (Suc 0) over 2::nat;
7931 This change may cause significant problems of INCOMPATIBILITY; here
7932 are some hints on converting existing sources:
7934 - due to the new "num" token, "-0" and "-1" etc. are now atomic
7935 entities, so expressions involving "-" (unary or binary minus) need
7936 to be spaced properly;
7938 - existing occurrences of "1" may need to be constraint "1::nat" or
7939 even replaced by Suc 0; similar for old "2";
7941 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
7943 - remove all special provisions on numerals in proofs;
7945 * HOL: simp rules nat_number expand numerals on nat to Suc/0
7946 representation (depends on bin_arith_simps in the default context);
7948 * HOL: symbolic syntax for x^2 (numeral 2);
7950 * HOL: the class of all HOL types is now called "type" rather than
7951 "term"; INCOMPATIBILITY, need to adapt references to this type class
7952 in axclass/classes, instance/arities, and (usually rare) occurrences
7953 in typings (of consts etc.); internally the class is called
7954 "HOL.type", ML programs should refer to HOLogic.typeS;
7956 * HOL/record package improvements:
7957 - new derived operations "fields" to build a partial record section,
7958 "extend" to promote a fixed record to a record scheme, and
7959 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
7960 declared as simp by default;
7961 - shared operations ("more", "fields", etc.) now need to be always
7962 qualified) --- potential INCOMPATIBILITY;
7963 - removed "make_scheme" operations (use "make" with "extend") --
7965 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
7966 - provides cases/induct rules for use with corresponding Isar
7967 methods (for concrete records, record schemes, concrete more
7968 parts, and schematic more parts -- in that order);
7969 - internal definitions directly based on a light-weight abstract
7970 theory of product types over typedef rather than datatype;
7972 * HOL: generic code generator for generating executable ML code from
7973 specifications; specific support for HOL constructs such as inductive
7974 datatypes and sets, as well as recursive functions; can be invoked
7975 via 'generate_code' theory section;
7977 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
7979 * HOL: consolidated and renamed several theories. In particular:
7980 Ord.thy has been absorbed into HOL.thy
7981 String.thy has been absorbed into List.thy
7983 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
7984 (beware of argument permutation!);
7986 * HOL: linorder_less_split superseded by linorder_cases;
7988 * HOL/List: "nodups" renamed to "distinct";
7990 * HOL: added "The" definite description operator; move Hilbert's "Eps"
7991 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
7992 - Ex_def has changed, now need to use some_eq_ex
7994 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
7995 in this (rare) case use:
7997 delSWrapper "split_all_tac"
7998 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
8000 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
8003 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
8004 Isabelle's type classes, ^ on functions and relations has too general
8005 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
8006 necessary to attach explicit type constraints;
8008 * HOL/Relation: the prefix name of the infix "O" has been changed from
8009 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
8010 renamed accordingly (eg "compI" -> "rel_compI").
8012 * HOL: syntax translations now work properly with numerals and records
8015 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
8016 of "lam" -- INCOMPATIBILITY;
8018 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
8019 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
8020 renamed "Product_Type.unit";
8022 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
8024 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
8025 the "cases" method);
8027 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
8030 * HOL/IMP: updated and converted to new-style theory format; several
8031 parts turned into readable document, with proper Isar proof texts and
8032 some explanations (by Gerwin Klein);
8034 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
8036 * HOL-Hyperreal is now a logic image;
8041 * Isar: consts/constdefs supports mixfix syntax for continuous
8044 * Isar: domain package adapted to new-style theory format, e.g. see
8047 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
8048 potential INCOMPATIBILITY; now use plain induct_tac instead of former
8049 lift.induct_tac, always use UU instead of Undef;
8051 * HOLCF/IMP: updated and converted to new-style theory;
8056 * Isar: proper integration of logic-specific tools and packages,
8057 including theory commands '(co)inductive', '(co)datatype',
8058 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
8059 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
8061 * theory Main no longer includes AC; for the Axiom of Choice, base
8062 your theory on Main_ZFC;
8064 * the integer library now covers quotients and remainders, with many
8065 laws relating division to addition, multiplication, etc.;
8067 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
8068 typeless version of the formalism;
8070 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
8073 * ZF/Induct: new directory for examples of inductive definitions,
8074 including theory Multiset for multiset orderings; converted to
8075 new-style theory format;
8077 * ZF: many new theorems about lists, ordinals, etc.;
8082 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
8083 variable proof controls level of detail: 0 = no proofs (only oracle
8084 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
8085 also ref manual for further ML interfaces;
8087 * Pure/axclass: removed obsolete ML interface
8088 goal_subclass/goal_arity;
8090 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
8091 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
8092 separate tokens, so expressions involving minus need to be spaced
8095 * Pure/syntax: support non-oriented infixes, using keyword "infix"
8096 rather than "infixl" or "infixr";
8098 * Pure/syntax: concrete syntax for dummy type variables admits genuine
8099 sort constraint specifications in type inference; e.g. "x::_::foo"
8100 ensures that the type of "x" is of sort "foo" (but not necessarily a
8103 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
8104 control output of nested => (types); the default behavior is
8107 * Pure/syntax: builtin parse translation for "_constify" turns valued
8108 tokens into AST constants;
8110 * Pure/syntax: prefer later declarations of translations and print
8111 translation functions; potential INCOMPATIBILITY: need to reverse
8112 multiple declarations for same syntax element constant;
8114 * Pure/show_hyps reset by default (in accordance to existing Isar
8117 * Provers/classical: renamed addaltern to addafter, addSaltern to
8120 * Provers/clasimp: ``iff'' declarations now handle conditional rules
8123 * system: tested support for MacOS X; should be able to get Isabelle +
8124 Proof General to work in a plain Terminal after installing Poly/ML
8125 (e.g. from the Isabelle distribution area) and GNU bash alone
8126 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
8127 support requires further installations, e.g. from
8128 http://fink.sourceforge.net/);
8130 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
8132 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
8133 of 40 MB), cf. ML_OPTIONS;
8135 * system: Proof General keywords specification is now part of the
8136 Isabelle distribution (see etc/isar-keywords.el);
8138 * system: support for persistent Proof General sessions (refrain from
8139 outdating all loaded theories on startup); user may create writable
8140 logic images like this: ``isabelle -q HOL Test'';
8142 * system: smart selection of Isabelle process versus Isabelle
8143 interface, accommodates case-insensitive file systems (e.g. HFS+); may
8144 run both "isabelle" and "Isabelle" even if file names are badly
8145 damaged (executable inspects the case of the first letter of its own
8146 name); added separate "isabelle-process" and "isabelle-interface";
8148 * system: refrain from any attempt at filtering input streams; no
8149 longer support ``8bit'' encoding of old isabelle font, instead proper
8150 iso-latin characters may now be used; the related isatools
8151 "symbolinput" and "nonascii" have disappeared as well;
8153 * system: removed old "xterm" interface (the print modes "xterm" and
8154 "xterm_color" are still available for direct use in a suitable
8159 New in Isabelle99-2 (February 2001)
8160 -----------------------------------
8162 *** Overview of INCOMPATIBILITIES ***
8164 * HOL: please note that theories in the Library and elsewhere often use the
8165 new-style (Isar) format; to refer to their theorems in an ML script you must
8166 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
8168 * HOL: inductive package no longer splits induction rule aggressively,
8169 but only as far as specified by the introductions given; the old
8170 format may be recovered via ML function complete_split_rule or attribute
8171 'split_rule (complete)';
8173 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
8174 gfp_Tarski to gfp_unfold;
8176 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
8178 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
8179 relation); infix "^^" has been renamed "``"; infix "``" has been
8180 renamed "`"; "univalent" has been renamed "single_valued";
8182 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
8185 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
8187 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
8189 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
8190 consequence, it is no longer monotonic wrt. the local goal context
8191 (which is now passed through the inductive cases);
8193 * Document preparation: renamed standard symbols \<ll> to \<lless> and
8194 \<gg> to \<ggreater>;
8197 *** Document preparation ***
8199 * \isabellestyle{NAME} selects version of Isabelle output (currently
8200 available: are "it" for near math-mode best-style output, "sl" for
8201 slanted text style, and "tt" for plain type-writer; if no
8202 \isabellestyle command is given, output is according to slanted
8205 * support sub/super scripts (for single symbols only), input syntax is
8206 like this: "A\<^sup>*" or "A\<^sup>\<star>";
8208 * some more standard symbols; see Appendix A of the system manual for
8209 the complete list of symbols defined in isabellesym.sty;
8211 * improved isabelle style files; more abstract symbol implementation
8212 (should now use \isamath{...} and \isatext{...} in custom symbol
8215 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
8216 state; Note that presentation of goal states does not conform to
8217 actual human-readable proof documents. Please do not include goal
8218 states into document output unless you really know what you are doing!
8220 * proper indentation of antiquoted output with proportional LaTeX
8223 * no_document ML operator temporarily disables LaTeX document
8226 * isatool unsymbolize tunes sources for plain ASCII communication;
8231 * Pure: Isar now suffers initial goal statements to contain unbound
8232 schematic variables (this does not conform to actual readable proof
8233 documents, due to unpredictable outcome and non-compositional proof
8234 checking); users who know what they are doing may use schematic goals
8235 for Prolog-style synthesis of proven results;
8237 * Pure: assumption method (an implicit finishing) now handles actual
8240 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
8241 initial goal, declare "that" only as Pure intro (only for single
8242 steps); the "that" rule assumption may now be involved in implicit
8243 finishing, thus ".." becomes a feasible for trivial obtains;
8245 * Pure: default proof step now includes 'intro_classes'; thus trivial
8246 instance proofs may be performed by "..";
8248 * Pure: ?thesis / ?this / "..." now work for pure meta-level
8251 * Pure: more robust selection of calculational rules;
8253 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
8254 rule (as well as the assumption rule);
8256 * Pure: 'thm_deps' command visualizes dependencies of theorems and
8257 lemmas, using the graph browser tool;
8259 * Pure: predict failure of "show" in interactive mode;
8261 * Pure: 'thms_containing' now takes actual terms as arguments;
8263 * HOL: improved method 'induct' --- now handles non-atomic goals
8264 (potential INCOMPATIBILITY); tuned error handling;
8266 * HOL: cases and induct rules now provide explicit hints about the
8267 number of facts to be consumed (0 for "type" and 1 for "set" rules);
8268 any remaining facts are inserted into the goal verbatim;
8270 * HOL: local contexts (aka cases) may now contain term bindings as
8271 well; the 'cases' and 'induct' methods new provide a ?case binding for
8272 the result to be shown in each case;
8274 * HOL: added 'recdef_tc' command;
8276 * isatool convert assists in eliminating legacy ML scripts;
8281 * HOL/Library: a collection of generic theories to be used together
8282 with main HOL; the theory loader path already includes this directory
8283 by default; the following existing theories have been moved here:
8284 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
8285 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
8287 * HOL/Unix: "Some aspects of Unix file-system security", a typical
8288 modelling and verification task performed in Isabelle/HOL +
8289 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
8291 * HOL/Algebra: special summation operator SUM no longer exists, it has
8292 been replaced by setsum; infix 'assoc' now has priority 50 (like
8293 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
8294 'domain', this makes the theory consistent with mathematical
8297 * HOL basics: added overloaded operations "inverse" and "divide"
8298 (infix "/"), syntax for generic "abs" operation, generic summation
8301 * HOL/typedef: simplified package, provide more useful rules (see also
8304 * HOL/datatype: induction rule for arbitrarily branching datatypes is
8305 now expressed as a proper nested rule (old-style tactic scripts may
8306 require atomize_strip_tac to cope with non-atomic premises);
8308 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
8309 to "split_conv" (old name still available for compatibility);
8311 * HOL: improved concrete syntax for strings (e.g. allows translation
8312 rules with string literals);
8314 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
8315 and Fleuriot's mechanization of analysis, including the transcendental
8316 functions for the reals;
8318 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
8323 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
8324 "lam" is displayed as TWO lambda-symbols
8326 * CTT: theory Main now available, containing everything (that is, Bool
8332 * Pure: the Simplifier has been implemented properly as a derived rule
8333 outside of the actual kernel (at last!); the overall performance
8334 penalty in practical applications is about 50%, while reliability of
8335 the Isabelle inference kernel has been greatly improved;
8337 * print modes "brackets" and "no_brackets" control output of nested =>
8338 (types) and ==> (props); the default behaviour is "brackets";
8340 * Provers: fast_tac (and friends) now handle actual object-logic rules
8341 as assumptions as well;
8343 * system: support Poly/ML 4.0;
8345 * system: isatool install handles KDE version 1 or 2;
8349 New in Isabelle99-1 (October 2000)
8350 ----------------------------------
8352 *** Overview of INCOMPATIBILITIES ***
8354 * HOL: simplification of natural numbers is much changed; to partly
8355 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
8356 issue the following ML commands:
8358 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
8359 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
8361 * HOL: simplification no longer dives into case-expressions; this is
8362 controlled by "t.weak_case_cong" for each datatype t;
8364 * HOL: nat_less_induct renamed to less_induct;
8366 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
8367 fixsome to patch .thy and .ML sources automatically;
8369 select_equality -> some_equality
8370 select_eq_Ex -> some_eq_ex
8371 selectI2EX -> someI2_ex
8374 select1_equality -> some1_equality
8375 Eps_sym_eq -> some_sym_eq_trivial
8376 Eps_eq -> some_eq_trivial
8378 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
8380 * HOL: removed obsolete theorem binding expand_if (refer to split_if
8383 * HOL: the recursion equations generated by 'recdef' are now called
8384 f.simps instead of f.rules;
8386 * HOL: qed_spec_mp now also handles bounded ALL as well;
8388 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
8389 sometimes be needed;
8391 * HOL: the constant for "f``x" is now "image" rather than "op ``";
8393 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
8395 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
8396 product is now "<*>" instead of "Times"; the lexicographic product is
8397 now "<*lex*>" instead of "**";
8399 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
8400 of main HOL, but was unused); better use HOL's datatype package;
8402 * HOL: removed "symbols" syntax for constant "override" of theory Map;
8403 the old syntax may be recovered as follows:
8406 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
8407 (infixl "\\<oplus>" 100)
8409 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8411 * HOL/ML: even fewer consts are declared as global (see theories Ord,
8412 Lfp, Gfp, WF); this only affects ML packages that refer to const names
8415 * HOL and ZF: syntax for quotienting wrt an equivalence relation
8416 changed from A/r to A//r;
8418 * ZF: new treatment of arithmetic (nat & int) may break some old
8421 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
8422 rulify -> rule_format, elimify -> elim_format, ...);
8424 * Isar/Provers: intro/elim/dest attributes changed; renamed
8425 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
8426 should have to change intro!! to intro? only); replaced "delrule" by
8429 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
8431 * Provers: strengthened force_tac by using new first_best_tac;
8433 * LaTeX document preparation: several changes of isabelle.sty (see
8437 *** Document preparation ***
8439 * formal comments (text blocks etc.) in new-style theories may now
8440 contain antiquotations of thm/prop/term/typ/text to be presented
8441 according to latex print mode; concrete syntax is like this:
8442 @{term[show_types] "f(x) = a + x"};
8444 * isatool mkdir provides easy setup of Isabelle session directories,
8445 including proper document sources;
8447 * generated LaTeX sources are now deleted after successful run
8448 (isatool document -c); may retain a copy somewhere else via -D option
8451 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
8452 style files, achieving self-contained LaTeX sources and simplifying
8455 * old-style theories now produce (crude) LaTeX output as well;
8457 * browser info session directories are now self-contained (may be put
8458 on WWW server seperately); improved graphs of nested sessions; removed
8459 graph for 'all sessions';
8461 * several improvements in isabelle style files; \isabellestyle{it}
8462 produces fake math mode output; \isamarkupheader is now \section by
8463 default; see lib/texinputs/isabelle.sty etc.;
8468 * Isar/Pure: local results and corresponding term bindings are now
8469 subject to Hindley-Milner polymorphism (similar to ML); this
8470 accommodates incremental type-inference very nicely;
8472 * Isar/Pure: new derived language element 'obtain' supports
8473 generalized existence reasoning;
8475 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
8476 support accumulation of results, without applying any rules yet;
8477 useful to collect intermediate results without explicit name
8478 references, and for use with transitivity rules with more than 2
8481 * Isar/Pure: scalable support for case-analysis type proofs: new
8482 'case' language element refers to local contexts symbolically, as
8483 produced by certain proof methods; internally, case names are attached
8484 to theorems as "tags";
8486 * Isar/Pure: theory command 'hide' removes declarations from
8487 class/type/const name spaces;
8489 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
8490 indicate potential overloading;
8492 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
8494 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
8495 "{a,b,c}" instead of {a,b,c};
8497 * Isar/Pure now provides its own version of intro/elim/dest
8498 attributes; useful for building new logics, but beware of confusion
8499 with the version in Provers/classical;
8501 * Isar/Pure: the local context of (non-atomic) goals is provided via
8502 case name 'antecedent';
8504 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
8505 to the current context is now done automatically);
8507 * Isar/Pure: theory command 'method_setup' provides a simple interface
8508 for definining proof methods in ML;
8510 * Isar/Provers: intro/elim/dest attributes changed; renamed
8511 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
8512 most cases, one should have to change intro!! to intro? only);
8513 replaced "delrule" by "rule del";
8515 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
8516 'symmetric' attribute (the latter supercedes [RS sym]);
8518 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
8519 method modifier); 'simp' method: 'only:' modifier removes loopers as
8520 well (including splits);
8522 * Isar/Provers: Simplifier and Classical methods now support all kind
8523 of modifiers used in the past, including 'cong', 'iff', etc.
8525 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
8526 of Simplifier and Classical reasoner);
8528 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
8529 now support named cases; major packages (inductive, datatype, primrec,
8530 recdef) support case names and properly name parameters;
8532 * Isar/HOL: new transitivity rules for substitution in inequalities --
8533 monotonicity conditions are extracted to be proven at end of
8536 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
8539 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
8540 split_if split_if_asm; datatype package provides theorems foo.splits =
8541 foo.split foo.split_asm for each datatype;
8543 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
8544 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
8545 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
8546 use "(cases (simplified))" method in proper proof texts);
8548 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
8550 * Isar: names of theorems etc. may be natural numbers as well;
8552 * Isar: 'pr' command: optional arguments for goals_limit and
8553 ProofContext.prems_limit; no longer prints theory contexts, but only
8556 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
8557 additional print modes to be specified; e.g. "pr(latex)" will print
8558 proof state according to the Isabelle LaTeX style;
8560 * Isar: improved support for emulating tactic scripts, including proof
8561 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
8562 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
8563 (for HOL datatypes);
8565 * Isar: simplified (more robust) goal selection of proof methods: 1st
8566 goal, all goals, or explicit goal specifier (tactic emulation); thus
8567 'proof method scripts' have to be in depth-first order;
8569 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
8571 * Isar: removed 'help' command, which hasn't been too helpful anyway;
8572 should instead use individual commands for printing items
8573 (print_commands, print_methods etc.);
8575 * Isar: added 'nothing' --- the empty list of theorems;
8580 * HOL/MicroJava: formalization of a fragment of Java, together with a
8581 corresponding virtual machine and a specification of its bytecode
8582 verifier and a lightweight bytecode verifier, including proofs of
8583 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
8584 Cornelia Pusch (see also the homepage of project Bali at
8585 http://isabelle.in.tum.de/Bali/);
8587 * HOL/Algebra: new theory of rings and univariate polynomials, by
8590 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
8591 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
8594 * HOL/Lattice: fundamental concepts of lattice theory and order
8595 structures, including duals, properties of bounds versus algebraic
8596 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
8597 Theorem for complete lattices etc.; may also serve as a demonstration
8598 for abstract algebraic reasoning using axiomatic type classes, and
8599 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
8601 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
8604 * HOL/IMPP: extension of IMP with local variables and mutually
8605 recursive procedures, by David von Oheimb;
8607 * HOL/Lambda: converted into new-style theory and document;
8609 * HOL/ex/Multiquote: example of multiple nested quotations and
8610 anti-quotations -- basically a generalized version of de-Bruijn
8611 representation; very useful in avoiding lifting of operations;
8613 * HOL/record: added general record equality rule to simpset; fixed
8614 select-update simplification procedure to handle extended records as
8615 well; admit "r" as field name;
8617 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
8618 other numeric types and also as the identity of groups, rings, etc.;
8620 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
8621 Types nat and int belong to this axclass;
8623 * HOL: greatly improved simplification involving numerals of type nat, int, real:
8624 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
8625 i*j + k + j*#3*i simplifies to #4*(i*j) + k
8626 two terms #m*u and #n*u are replaced by #(m+n)*u
8627 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
8628 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
8629 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
8631 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
8632 powerful prover for predicate logic but knows nothing of clasets; see
8633 ex/mesontest.ML and ex/mesontest2.ML for example applications;
8635 * HOL: new version of "case_tac" subsumes both boolean case split and
8636 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
8637 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
8639 * HOL: simplification no longer dives into case-expressions: only the
8640 selector expression is simplified, but not the remaining arms; to
8641 enable full simplification of case-expressions for datatype t, you may
8642 remove t.weak_case_cong from the simpset, either globally (Delcongs
8643 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
8645 * HOL/recdef: the recursion equations generated by 'recdef' for
8646 function 'f' are now called f.simps instead of f.rules; if all
8647 termination conditions are proved automatically, these simplification
8648 rules are added to the simpset, as in primrec; rules may be named
8649 individually as well, resulting in a separate list of theorems for
8652 * HOL/While is a new theory that provides a while-combinator. It
8653 permits the definition of tail-recursive functions without the
8654 provision of a termination measure. The latter is necessary once the
8655 invariant proof rule for while is applied.
8657 * HOL: new (overloaded) notation for the set of elements below/above
8658 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
8660 * HOL: theorems impI, allI, ballI bound as "strip";
8662 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
8663 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
8664 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
8666 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8668 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
8669 main HOL, but was unused);
8671 * HOL: fewer consts declared as global (e.g. have to refer to
8672 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
8674 * HOL: tuned AST representation of nested pairs, avoiding bogus output
8675 in case of overlap with user translations (e.g. judgements over
8676 tuples); (note that the underlying logical represenation is still
8682 * ZF: simplification automatically cancels common terms in arithmetic
8683 expressions over nat and int;
8685 * ZF: new treatment of nat to minimize type-checking: all operators
8686 coerce their operands to a natural number using the function natify,
8687 making the algebraic laws unconditional;
8689 * ZF: as above, for int: operators coerce their operands to an integer
8690 using the function intify;
8692 * ZF: the integer library now contains many of the usual laws for the
8693 orderings, including $<=, and monotonicity laws for $+ and $*;
8695 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
8698 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
8699 to the simplifier and classical reasoner simultaneously;
8704 * Provers: blast_tac now handles actual object-logic rules as
8705 assumptions; note that auto_tac uses blast_tac internally as well;
8707 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
8708 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
8710 * Provers: delrules now handles destruct rules as well (no longer need
8711 explicit make_elim);
8713 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
8714 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8715 use instead the strong form,
8716 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8717 in HOL, FOL and ZF the function cla_make_elim will create such rules
8718 from destruct-rules;
8720 * Provers: Simplifier.easy_setup provides a fast path to basic
8721 Simplifier setup for new object-logics;
8723 * Pure: AST translation rules no longer require constant head on LHS;
8725 * Pure: improved name spaces: ambiguous output is qualified; support
8726 for hiding of names;
8728 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
8729 XSYMBOL_HOME; no longer need to do manual configuration in most
8732 * system: compression of ML heaps images may now be controlled via -c
8733 option of isabelle and isatool usedir (currently only observed by
8736 * system: isatool installfonts may handle X-Symbol fonts as well (very
8737 useful for remote X11);
8739 * system: provide TAGS file for Isabelle sources;
8741 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
8744 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
8745 timing flag supersedes proof_timing and Toplevel.trace;
8747 * ML: new combinators |>> and |>>> for incremental transformations
8748 with secondary results (e.g. certain theory extensions):
8750 * ML: PureThy.add_defs gets additional argument to indicate potential
8751 overloading (usually false);
8753 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
8758 New in Isabelle99 (October 1999)
8759 --------------------------------
8761 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8763 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
8764 are no longer simplified. (This allows the simplifier to unfold recursive
8765 functional programs.) To restore the old behaviour, declare
8767 Delcongs [if_weak_cong];
8769 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
8772 * HOL: the predicate "inj" is now defined by translation to "inj_on";
8774 * HOL/datatype: mutual_induct_tac no longer exists --
8775 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
8777 * HOL/typedef: fixed type inference for representing set; type
8778 arguments now have to occur explicitly on the rhs as type constraints;
8780 * ZF: The con_defs part of an inductive definition may no longer refer
8781 to constants declared in the same theory;
8783 * HOL, ZF: the function mk_cases, generated by the inductive
8784 definition package, has lost an argument. To simplify its result, it
8785 uses the default simpset instead of a supplied list of theorems.
8787 * HOL/List: the constructors of type list are now Nil and Cons;
8789 * Simplifier: the type of the infix ML functions
8790 setSSolver addSSolver setSolver addSolver
8791 is now simpset * solver -> simpset where `solver' is a new abstract type
8792 for packaging solvers. A solver is created via
8793 mk_solver: string -> (thm list -> int -> tactic) -> solver
8794 where the string argument is only a comment.
8799 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
8800 decision procedure for linear arithmetic. Currently it is used for
8801 types `nat', `int', and `real' in HOL (see below); it can, should and
8802 will be instantiated for other types and logics as well.
8804 * The simplifier now accepts rewrite rules with flexible heads, eg
8805 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
8806 They are applied like any rule with a non-pattern lhs, i.e. by first-order
8812 * New Isabelle/Isar subsystem provides an alternative to traditional
8813 tactical theorem proving; together with the ProofGeneral/isar user
8814 interface it offers an interactive environment for developing human
8815 readable proof documents (Isar == Intelligible semi-automated
8816 reasoning); for further information see isatool doc isar-ref,
8817 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
8819 * improved and simplified presentation of theories: better HTML markup
8820 (including colors), graph views in several sizes; isatool usedir now
8821 provides a proper interface for user theories (via -P option); actual
8822 document preparation based on (PDF)LaTeX is available as well (for
8823 new-style theories only); see isatool doc system for more information;
8825 * native support for Proof General, both for classic Isabelle and
8828 * ML function thm_deps visualizes dependencies of theorems and lemmas,
8829 using the graph browser tool;
8831 * Isabelle manuals now also available as PDF;
8833 * theory loader rewritten from scratch (may not be fully
8834 bug-compatible); old loadpath variable has been replaced by show_path,
8835 add_path, del_path, reset_path functions; new operations such as
8836 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
8839 * improved isatool install: option -k creates KDE application icon,
8840 option -p DIR installs standalone binaries;
8842 * added ML_PLATFORM setting (useful for cross-platform installations);
8843 more robust handling of platform specific ML images for SML/NJ;
8845 * the settings environment is now statically scoped, i.e. it is never
8846 created again in sub-processes invoked from isabelle, isatool, or
8849 * path element specification '~~' refers to '$ISABELLE_HOME';
8851 * in locales, the "assumes" and "defines" parts may be omitted if
8854 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
8857 * new print_mode "HTML";
8859 * new flag show_tags controls display of tags of theorems (which are
8860 basically just comments that may be attached by some tools);
8862 * Isamode 2.6 requires patch to accomodate change of Isabelle font
8863 mode and goal output format:
8865 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
8867 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
8869 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
8870 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
8872 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
8874 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
8876 * function bind_thms stores lists of theorems (cf. bind_thm);
8878 * new shorthand tactics ftac, eatac, datac, fatac;
8880 * qed (and friends) now accept "" as result name; in that case the
8881 theorem is not stored, but proper checks and presentation of the
8884 * theorem database now also indexes constants "Trueprop", "all",
8885 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
8890 ** HOL arithmetic **
8892 * There are now decision procedures for linear arithmetic over nat and
8895 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
8896 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
8897 are treated as atomic; subformulae not involving type `nat' or `int'
8898 are ignored; quantified subformulae are ignored unless they are
8899 positive universal or negative existential. The tactic has to be
8900 invoked by hand and can be a little bit slow. In particular, the
8901 running time is exponential in the number of occurrences of `min' and
8902 `max', and `-' on `nat'.
8904 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
8905 (negated) (in)equalities among the premises and the conclusion into
8906 account (i.e. no compound formulae) and does not know about `min' and
8907 `max', and `-' on `nat'. It is fast and is used automatically by the
8910 NB: At the moment, these decision procedures do not cope with mixed
8911 nat/int formulae where the two parts interact, such as `m < n ==>
8914 * HOL/Numeral provides a generic theory of numerals (encoded
8915 efficiently as bit strings); setup for types nat/int/real is in place;
8916 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
8917 int, existing theories and proof scripts may require a few additional
8920 * integer division and remainder can now be performed on constant
8923 * many properties of integer multiplication, division and remainder
8926 * An interface to the Stanford Validity Checker (SVC) is available through the
8927 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
8928 are proved automatically. SVC must be installed separately, and its results
8929 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
8930 invocation of the underlying oracle). For SVC see
8931 http://verify.stanford.edu/SVC
8933 * IsaMakefile: the HOL-Real target now builds an actual image;
8938 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
8939 (in Isabelle/Isar) -- by Gertrud Bauer;
8941 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
8942 analysis for assembly languages with subtypes;
8944 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
8945 -- avoids syntactic ambiguities and treats state, transition, and
8946 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
8947 changed syntax and (many) tactics;
8949 * HOL/inductive: Now also handles more general introduction rules such
8950 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
8951 theorems are now maintained within the theory (maintained via the
8954 * HOL/datatype: Now also handles arbitrarily branching datatypes
8955 (using function types) such as
8957 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
8959 * HOL/record: record_simproc (part of the default simpset) takes care
8960 of selectors applied to updated records; record_split_tac is no longer
8961 part of the default claset; update_defs may now be removed from the
8962 simpset in many cases; COMPATIBILITY: old behavior achieved by
8964 claset_ref () := claset() addSWrapper record_split_wrapper;
8965 Delsimprocs [record_simproc]
8967 * HOL/typedef: fixed type inference for representing set; type
8968 arguments now have to occur explicitly on the rhs as type constraints;
8970 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
8971 names rather than an ML expression;
8973 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
8974 supplied later. Program schemes can be defined, such as
8975 "While B C s = (if B s then While B C (C s) else s)"
8976 where the well-founded relation can be chosen after B and C have been given.
8978 * HOL/List: the constructors of type list are now Nil and Cons;
8979 INCOMPATIBILITY: while [] and infix # syntax is still there, of
8980 course, ML tools referring to List.list.op # etc. have to be adapted;
8982 * HOL_quantifiers flag superseded by "HOL" print mode, which is
8983 disabled by default; run isabelle with option -m HOL to get back to
8984 the original Gordon/HOL-style output;
8986 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
8987 ALL x<=y. P, EX x<y. P, EX x<=y. P;
8989 * HOL basic syntax simplified (more orthogonal): all variants of
8990 All/Ex now support plain / symbolic / HOL notation; plain syntax for
8991 Eps operator is provided as well: "SOME x. P[x]";
8993 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
8995 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
8996 thus available for user theories;
8998 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
8999 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
9002 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
9003 several times and then mp;
9008 * the notation <<...>> is now available as a notation for sequences of
9011 * the simplifier is now installed
9013 * the axiom system has been generalized (thanks to Soren Heilmann)
9015 * the classical reasoner now has a default rule database
9020 * new primrec section allows primitive recursive functions to be given
9021 directly (as in HOL) over datatypes and the natural numbers;
9023 * new tactics induct_tac and exhaust_tac for induction (or case
9024 analysis) over datatypes and the natural numbers;
9026 * the datatype declaration of type T now defines the recursor T_rec;
9028 * simplification automatically does freeness reasoning for datatype
9031 * automatic type-inference, with AddTCs command to insert new
9032 type-checking rules;
9034 * datatype introduction rules are now added as Safe Introduction rules
9037 * the syntax "if P then x else y" is now available in addition to
9041 *** Internal programming interfaces ***
9043 * tuned simplifier trace output; new flag debug_simp;
9045 * structures Vartab / Termtab (instances of TableFun) offer efficient
9046 tables indexed by indexname_ord / term_ord (compatible with aconv);
9048 * AxClass.axclass_tac lost the theory argument;
9050 * tuned current_goals_markers semantics: begin / end goal avoids
9051 printing empty lines;
9053 * removed prs and prs_fn hook, which was broken because it did not
9054 include \n in its semantics, forcing writeln to add one
9055 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
9056 string -> unit if you really want to output text without newline;
9058 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
9059 plain output, interface builders may have to enable 'isabelle_font'
9060 mode to get Isabelle font glyphs as before;
9062 * refined token_translation interface; INCOMPATIBILITY: output length
9063 now of type real instead of int;
9065 * theory loader actions may be traced via new ThyInfo.add_hook
9066 interface (see src/Pure/Thy/thy_info.ML); example application: keep
9067 your own database of information attached to *whole* theories -- as
9068 opposed to intra-theory data slots offered via TheoryDataFun;
9070 * proper handling of dangling sort hypotheses (at last!);
9071 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
9072 extra sort hypotheses that can be witnessed from the type signature;
9073 the force_strip_shyps flag is gone, any remaining shyps are simply
9074 left in the theorem (with a warning issued by strip_shyps_warning);
9078 New in Isabelle98-1 (October 1998)
9079 ----------------------------------
9081 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9083 * several changes of automated proof tools;
9085 * HOL: major changes to the inductive and datatype packages, including
9086 some minor incompatibilities of theory syntax;
9088 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
9091 * HOL: removed duplicate thms in Arith:
9092 less_imp_add_less should be replaced by trans_less_add1
9093 le_imp_add_le should be replaced by trans_le_add1
9095 * HOL: unary minus is now overloaded (new type constraints may be
9098 * HOL and ZF: unary minus for integers is now #- instead of #~. In
9099 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
9100 now taken as an integer constant.
9102 * Pure: ML function 'theory_of' renamed to 'theory';
9108 1. Asm_full_simp_tac is now more aggressive.
9109 1. It will sometimes reorient premises if that increases their power to
9111 2. It does no longer proceed strictly from left to right but may also
9112 rotate premises to achieve further simplification.
9113 For compatibility reasons there is now Asm_lr_simp_tac which is like the
9114 old Asm_full_simp_tac in that it does not rotate premises.
9115 2. The simplifier now knows a little bit about nat-arithmetic.
9117 * Classical reasoner: wrapper mechanism for the classical reasoner now
9118 allows for selected deletion of wrappers, by introduction of names for
9119 wrapper functionals. This implies that addbefore, addSbefore,
9120 addaltern, and addSaltern now take a pair (name, tactic) as argument,
9121 and that adding two tactics with the same name overwrites the first
9122 one (emitting a warning).
9123 type wrapper = (int -> tactic) -> (int -> tactic)
9124 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
9125 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
9126 delWrapper, delSWrapper: claset * string -> claset
9127 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
9129 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
9130 semantics; addbefore now affects only the unsafe part of step_tac
9131 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
9132 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
9135 * Classical reasoner: setwrapper to setWrapper and compwrapper to
9136 compWrapper; added safe wrapper (and access functions for it);
9138 * HOL/split_all_tac is now much faster and fails if there is nothing
9139 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
9140 and the names of the automatically generated variables have changed.
9141 split_all_tac has moved within claset() from unsafe wrappers to safe
9142 wrappers, which means that !!-bound variables are split much more
9143 aggressively, and safe_tac and clarify_tac now split such variables.
9144 If this splitting is not appropriate, use delSWrapper "split_all_tac".
9145 Note: the same holds for record_split_tac, which does the job of
9146 split_all_tac for record fields.
9148 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
9149 permanently to the default simpset using Addsplits just like
9150 Addsimps. They can be removed via Delsplits just like
9151 Delsimps. Lower-case versions are also available.
9153 * HOL/Simplifier: The rule split_if is now part of the default
9154 simpset. This means that the simplifier will eliminate all occurrences
9155 of if-then-else in the conclusion of a goal. To prevent this, you can
9156 either remove split_if completely from the default simpset by
9157 `Delsplits [split_if]' or remove it in a specific call of the
9158 simplifier using `... delsplits [split_if]'. You can also add/delete
9159 other case splitting rules to/from the default simpset: every datatype
9160 generates suitable rules `split_t_case' and `split_t_case_asm' (where
9161 t is the name of the datatype).
9163 * Classical reasoner / Simplifier combination: new force_tac (and
9164 derivatives Force_tac, force) combines rewriting and classical
9165 reasoning (and whatever other tools) similarly to auto_tac, but is
9166 aimed to solve the given subgoal completely.
9171 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
9172 and `goalw': the theory is no longer needed as an explicit argument -
9173 the current theory context is used; assumptions are no longer returned
9174 at the ML-level unless one of them starts with ==> or !!; it is
9175 recommended to convert to these new commands using isatool fixgoal
9176 (backup your sources first!);
9178 * new top-level commands 'thm' and 'thms' for retrieving theorems from
9179 the current theory context, and 'theory' to lookup stored theories;
9181 * new theory section 'locale' for declaring constants, assumptions and
9182 definitions that have local scope;
9184 * new theory section 'nonterminals' for purely syntactic types;
9186 * new theory section 'setup' for generic ML setup functions
9187 (e.g. package initialization);
9189 * the distribution now includes Isabelle icons: see
9190 lib/logo/isabelle-{small,tiny}.xpm;
9192 * isatool install - install binaries with absolute references to
9195 * isatool logo -- create instances of the Isabelle logo (as EPS);
9197 * print mode 'emacs' reserved for Isamode;
9199 * support multiple print (ast) translations per constant name;
9201 * theorems involving oracles are now printed with a suffixed [!];
9206 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
9208 * HOL/inductive package reorganized and improved: now supports mutual
9214 oddI "n : EVEN ==> Suc n : ODD"
9215 evenI "n : ODD ==> Suc n : EVEN"
9217 new theorem list "elims" contains an elimination rule for each of the
9218 recursive sets; inductive definitions now handle disjunctive premises
9219 correctly (also ZF);
9221 INCOMPATIBILITIES: requires Inductive as an ancestor; component
9222 "mutual_induct" no longer exists - the induction rule is always
9223 contained in "induct";
9226 * HOL/datatype package re-implemented and greatly improved: now
9227 supports mutually recursive datatypes such as
9230 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
9231 | SUM ('a aexp) ('a aexp)
9232 | DIFF ('a aexp) ('a aexp)
9235 'a bexp = LESS ('a aexp) ('a aexp)
9236 | AND ('a bexp) ('a bexp)
9237 | OR ('a bexp) ('a bexp)
9239 as well as indirectly recursive datatypes such as
9242 ('a, 'b) term = Var 'a
9243 | App 'b ((('a, 'b) term) list)
9245 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
9246 induction on mutually / indirectly recursive datatypes.
9248 Primrec equations are now stored in theory and can be accessed via
9249 <function_name>.simps.
9253 - Theories using datatypes must now have theory Datatype as an
9255 - The specific <typename>.induct_tac no longer exists - use the
9256 generic induct_tac instead.
9257 - natE has been renamed to nat.exhaust - use exhaust_tac
9258 instead of res_inst_tac ... natE. Note that the variable
9259 names in nat.exhaust differ from the names in natE, this
9260 may cause some "fragile" proofs to fail.
9261 - The theorems split_<typename>_case and split_<typename>_case_asm
9262 have been renamed to <typename>.split and <typename>.split_asm.
9263 - Since default sorts of type variables are now handled correctly,
9264 some datatype definitions may have to be annotated with explicit
9266 - Primrec definitions no longer require function name and type
9267 of recursive argument.
9269 Consider using isatool fixdatatype to adapt your theories and proof
9270 scripts to the new package (backup your sources first!).
9273 * HOL/record package: considerably improved implementation; now
9274 includes concrete syntax for record types, terms, updates; theorems
9275 for surjective pairing and splitting !!-bound record variables; proof
9276 support is as follows:
9278 1) standard conversions (selectors or updates applied to record
9279 constructor terms) are part of the standard simpset;
9281 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
9282 made part of standard simpset and claset via addIffs;
9284 3) a tactic for record field splitting (record_split_tac) is part of
9285 the standard claset (addSWrapper);
9287 To get a better idea about these rules you may retrieve them via
9288 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
9289 the name of your record type.
9291 The split tactic 3) conceptually simplifies by the following rule:
9293 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
9295 Thus any record variable that is bound by meta-all will automatically
9296 blow up into some record constructor term, consequently the
9297 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
9298 solve record problems automatically.
9301 * reorganized the main HOL image: HOL/Integ and String loaded by
9302 default; theory Main includes everything;
9304 * automatic simplification of integer sums and comparisons, using cancellation;
9306 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
9308 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
9310 * many new identities for unions, intersections, set difference, etc.;
9312 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
9313 called split_if, split_split, split_sum_case and split_nat_case (to go
9314 with add/delsplits);
9316 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
9317 (?x::unit) = (); this is made part of the default simpset, which COULD
9318 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
9319 'Delsimprocs [unit_eq_proc];' as last resort); also note that
9320 unit_abs_eta_conv is added in order to counter the effect of
9321 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
9324 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
9327 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9328 It and 'sym RS equals0D' are now in the default claset, giving automatic
9329 disjointness reasoning but breaking a few old proofs.
9331 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
9332 to 'converse' from 'inverse' (for compatibility with ZF and some
9335 * HOL/recdef can now declare non-recursive functions, with {} supplied as
9336 the well-founded relation;
9338 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
9339 Compl A. The "Compl" syntax remains available as input syntax for this
9342 * HOL/Update: new theory of function updates:
9343 f(a:=b) == %x. if x=a then b else f x
9344 may also be iterated as in f(a:=b,c:=d,...);
9346 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
9349 - new function list_update written xs[i:=v] that updates the i-th
9350 list position. May also be iterated as in xs[i:=a,j:=b,...].
9351 - new function `upt' written [i..j(] which generates the list
9352 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
9353 bound write [i..j], which is a shorthand for [i..j+1(].
9354 - new lexicographic orderings and corresponding wellfoundedness theorems.
9357 - removed 'pred' (predecessor) function;
9358 - generalized some theorems about n-1;
9359 - many new laws about "div" and "mod";
9360 - new laws about greatest common divisors (see theory ex/Primes);
9362 * HOL/Relation: renamed the relational operator r^-1 "converse"
9363 instead of "inverse";
9365 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
9366 of the multiset ordering;
9368 * directory HOL/Real: a construction of the reals using Dedekind cuts
9369 (not included by default);
9371 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
9373 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
9374 programs, i.e. different program variables may have different types.
9376 * calling (stac rew i) now fails if "rew" has no effect on the goal
9377 [previously, this check worked only if the rewrite rule was unconditional]
9378 Now rew can involve either definitions or equalities (either == or =).
9383 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
9384 only the theorems proved on ZF.ML;
9386 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9387 It and 'sym RS equals0D' are now in the default claset, giving automatic
9388 disjointness reasoning but breaking a few old proofs.
9390 * ZF/Update: new theory of function updates
9391 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
9392 may also be iterated as in f(a:=b,c:=d,...);
9394 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
9396 * calling (stac rew i) now fails if "rew" has no effect on the goal
9397 [previously, this check worked only if the rewrite rule was unconditional]
9398 Now rew can involve either definitions or equalities (either == or =).
9400 * case_tac provided for compatibility with HOL
9401 (like the old excluded_middle_tac, but with subgoals swapped)
9404 *** Internal programming interfaces ***
9406 * Pure: several new basic modules made available for general use, see
9407 also src/Pure/README;
9409 * improved the theory data mechanism to support encapsulation (data
9410 kind name replaced by private Object.kind, acting as authorization
9411 key); new type-safe user interface via functor TheoryDataFun; generic
9412 print_data function becomes basically useless;
9414 * removed global_names compatibility flag -- all theory declarations
9415 are qualified by default;
9417 * module Pure/Syntax now offers quote / antiquote translation
9418 functions (useful for Hoare logic etc. with implicit dependencies);
9419 see HOL/ex/Antiquote for an example use;
9421 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
9424 * new tactical CHANGED_GOAL for checking that a tactic modifies a
9427 * Display.print_goals function moved to Locale.print_goals;
9429 * standard print function for goals supports current_goals_markers
9430 variable for marking begin of proof, end of proof, start of goal; the
9431 default is ("", "", ""); setting current_goals_markers := ("<proof>",
9432 "</proof>", "<goal>") causes SGML like tagged proof state printing,
9437 New in Isabelle98 (January 1998)
9438 --------------------------------
9440 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9442 * changed lexical syntax of terms / types: dots made part of long
9443 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
9445 * simpset (and claset) reference variable replaced by functions
9446 simpset / simpset_ref;
9448 * no longer supports theory aliases (via merge) and non-trivial
9449 implicit merge of thms' signatures;
9451 * most internal names of constants changed due to qualified names;
9453 * changed Pure/Sequence interface (see Pure/seq.ML);
9456 *** General Changes ***
9458 * hierachically structured name spaces (for consts, types, axms, thms
9459 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
9460 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
9461 isatool fixdots ensures space after dots (e.g. "%x. x"); set
9462 long_names for fully qualified output names; NOTE: ML programs
9463 (special tactics, packages etc.) referring to internal names may have
9464 to be adapted to cope with fully qualified names; in case of severe
9465 backward campatibility problems try setting 'global_names' at compile
9466 time to have enrything declared within a flat name space; one may also
9467 fine tune name declarations in theories via the 'global' and 'local'
9470 * reimplemented the implicit simpset and claset using the new anytype
9471 data filed in signatures; references simpset:simpset ref etc. are
9472 replaced by functions simpset:unit->simpset and
9473 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
9474 to patch your ML files accordingly;
9476 * HTML output now includes theory graph data for display with Java
9477 applet or isatool browser; data generated automatically via isatool
9478 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
9480 * defs may now be conditional; improved rewrite_goals_tac to handle
9481 conditional equations;
9483 * defs now admits additional type arguments, using TYPE('a) syntax;
9485 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
9486 creates a new theory node; implicit merge of thms' signatures is
9487 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
9488 transfer:theory->thm->thm in (rare) cases;
9490 * improved handling of draft signatures / theories; draft thms (and
9491 ctyps, cterms) are automatically promoted to real ones;
9493 * slightly changed interfaces for oracles: admit many per theory, named
9494 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
9496 * print_goals: optional output of const types (set show_consts and
9499 * improved output of warnings (###) and errors (***);
9501 * subgoal_tac displays a warning if the new subgoal has type variables;
9503 * removed old README and Makefiles;
9505 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
9507 * removed obsolete init_pps and init_database;
9509 * deleted the obsolete tactical STATE, which was declared by
9510 fun STATE tacfun st = tacfun st st;
9512 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
9513 (which abbreviates $HOME);
9515 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
9516 use isatool fixseq to adapt your ML programs (this works for fully
9517 qualified references to the Sequence structure only!);
9519 * use_thy no longer requires writable current directory; it always
9520 reloads .ML *and* .thy file, if either one is out of date;
9523 *** Classical Reasoner ***
9525 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
9526 tactics that use classical reasoning to simplify a subgoal without
9527 splitting it into several subgoals;
9529 * Safe_tac: like safe_tac but uses the default claset;
9534 * added simplification meta rules:
9535 (asm_)(full_)simplify: simpset -> thm -> thm;
9537 * simplifier.ML no longer part of Pure -- has to be loaded by object
9540 * added prems argument to simplification procedures;
9542 * HOL, FOL, ZF: added infix function `addsplits':
9543 instead of `<simpset> setloop (split_tac <thms>)'
9544 you can simply write `<simpset> addsplits <thms>'
9549 * TYPE('a) syntax for type reflection terms;
9551 * no longer handles consts with name "" -- declare as 'syntax' instead;
9553 * pretty printer: changed order of mixfix annotation preference (again!);
9555 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
9560 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
9561 with `addloop' of the simplifier to faciliate case splitting in premises.
9563 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
9565 * HOL/Auth: new protocol proofs including some for the Internet
9568 * HOL/Map: new theory of `maps' a la VDM;
9570 * HOL/simplifier: simplification procedures nat_cancel_sums for
9571 cancelling out common nat summands from =, <, <= (in)equalities, or
9572 differences; simplification procedures nat_cancel_factor for
9573 cancelling common factor from =, <, <= (in)equalities over natural
9574 sums; nat_cancel contains both kinds of procedures, it is installed by
9575 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
9577 * HOL/simplifier: terms of the form
9578 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
9580 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
9581 and those of the form
9582 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
9584 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
9587 Each datatype `t' now comes with a theorem `split_t_case' of the form
9589 P(t_case f1 ... fn x) =
9590 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
9592 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
9595 and a theorem `split_t_case_asm' of the form
9597 P(t_case f1 ... fn x) =
9598 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
9600 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
9602 which can be added to a simpset via `addsplits'. The existing theorems
9603 expand_list_case and expand_option_case have been renamed to
9604 split_list_case and split_option_case.
9607 - `pred n' is automatically converted to `n-1'.
9608 Users are strongly encouraged not to use `pred' any longer,
9609 because it will disappear altogether at some point.
9610 - Users are strongly encouraged to write "0 < n" rather than
9611 "n ~= 0". Theorems and proof tools have been modified towards this
9615 the function "set_of_list" has been renamed "set" (and its theorems too);
9616 the function "nth" now takes its arguments in the reverse order and
9617 has acquired the infix notation "!" as in "xs!n".
9619 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
9621 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
9622 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
9624 * HOL/record: extensible records with schematic structural subtyping
9625 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
9626 still lacks various theorems and concrete record syntax;
9631 * removed "axioms" and "generated by" sections;
9633 * replaced "ops" section by extended "consts" section, which is capable of
9634 handling the continuous function space "->" directly;
9637 . proves theorems immediately and stores them in the theory,
9638 . creates hierachical name space,
9639 . now uses normal mixfix annotations (instead of cinfix...),
9640 . minor changes to some names and values (for consistency),
9641 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
9642 . separator between mutual domain defs: changed "," to "and",
9643 . improved handling of sort constraints; now they have to
9644 appear on the left-hand side of the equations only;
9646 * fixed LAM <x,y,zs>.b syntax;
9648 * added extended adm_tac to simplifier in HOLCF -- can now discharge
9649 adm (%x. P (t x)), where P is chainfinite and t continuous;
9654 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
9655 with `addloop' of the simplifier to faciliate case splitting in premises.
9657 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
9658 in HOL, they strip ALL and --> from proved theorems;
9662 New in Isabelle94-8 (May 1997)
9663 ------------------------------
9665 *** General Changes ***
9667 * new utilities to build / run / maintain Isabelle etc. (in parts
9668 still somewhat experimental); old Makefiles etc. still functional;
9670 * new 'Isabelle System Manual';
9672 * INSTALL text, together with ./configure and ./build scripts;
9674 * reimplemented type inference for greater efficiency, better error
9675 messages and clean internal interface;
9677 * prlim command for dealing with lots of subgoals (an easier way of
9678 setting goals_limit);
9683 * supports alternative (named) syntax tables (parser and pretty
9684 printer); internal interface is provided by add_modesyntax(_i);
9686 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
9687 be used in conjunction with the Isabelle symbol font; uses the
9688 "symbols" syntax table;
9690 * added token_translation interface (may translate name tokens in
9691 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
9692 the current print_mode); IMPORTANT: user print translation functions
9693 are responsible for marking newly introduced bounds
9694 (Syntax.mark_boundT);
9696 * token translations for modes "xterm" and "xterm_color" that display
9697 names in bold, underline etc. or colors (which requires a color
9700 * infixes may now be declared with names independent of their syntax;
9702 * added typed_print_translation (like print_translation, but may
9703 access type of constant);
9706 *** Classical Reasoner ***
9708 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
9709 some limitations. Blast_tac...
9710 + ignores addss, addbefore, addafter; this restriction is intrinsic
9711 + ignores elimination rules that don't have the correct format
9712 (the conclusion MUST be a formula variable)
9713 + ignores types, which can make HOL proofs fail
9714 + rules must not require higher-order unification, e.g. apply_type in ZF
9715 [message "Function Var's argument not a bound variable" relates to this]
9716 + its proof strategy is more general but can actually be slower
9718 * substitution with equality assumptions no longer permutes other
9721 * minor changes in semantics of addafter (now called addaltern); renamed
9722 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
9723 (and access functions for it);
9725 * improved combination of classical reasoner and simplifier:
9726 + functions for handling clasimpsets
9727 + improvement of addss: now the simplifier is called _after_ the
9729 + safe variant of addss called addSss: uses safe simplifications
9730 _during_ the safe steps. It is more complete as it allows multiple
9731 instantiations of unknowns (e.g. with slow_tac).
9735 * added interface for simplification procedures (functions that
9736 produce *proven* rewrite rules on the fly, depending on current
9739 * ordering on terms as parameter (used for ordered rewriting);
9741 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
9743 * the solver is now split into a safe and an unsafe part.
9744 This should be invisible for the normal user, except that the
9745 functions setsolver and addsolver have been renamed to setSolver and
9746 addSolver; added safe_asm_full_simp_tac;
9751 * a generic induction tactic `induct_tac' which works for all datatypes and
9752 also for type `nat';
9754 * a generic case distinction tactic `exhaust_tac' which works for all
9755 datatypes and also for type `nat';
9757 * each datatype comes with a function `size';
9759 * patterns in case expressions allow tuple patterns as arguments to
9760 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
9762 * primrec now also works with type nat;
9764 * recdef: a new declaration form, allows general recursive functions to be
9765 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
9767 * the constant for negation has been renamed from "not" to "Not" to
9768 harmonize with FOL, ZF, LK, etc.;
9770 * HOL/ex/LFilter theory of a corecursive "filter" functional for
9773 * HOL/Modelcheck demonstrates invocation of model checker oracle;
9775 * HOL/ex/Ring.thy declares cring_simp, which solves equational
9776 problems in commutative rings, using axiomatic type classes for + and *;
9778 * more examples in HOL/MiniML and HOL/Auth;
9780 * more default rewrite rules for quantifiers, union/intersection;
9782 * a new constant `arbitrary == @x.False';
9784 * HOLCF/IOA replaces old HOL/IOA;
9786 * HOLCF changes: derived all rules and arities
9787 + axiomatic type classes instead of classes
9788 + typedef instead of faking type definitions
9789 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
9790 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
9791 + eliminated the types void, one, tr
9792 + use unit lift and bool lift (with translations) instead of one and tr
9793 + eliminated blift from Lift3.thy (use Def instead of blift)
9794 all eliminated rules are derived as theorems --> no visible changes ;
9799 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
9800 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
9801 as ZF_cs addSIs [equalityI];
9805 New in Isabelle94-7 (November 96)
9806 ---------------------------------
9808 * allowing negative levels (as offsets) in prlev and choplev;
9810 * super-linear speedup for large simplifications;
9812 * FOL, ZF and HOL now use miniscoping: rewriting pushes
9813 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
9814 FAIL); can suppress it using the command Delsimps (ex_simps @
9815 all_simps); De Morgan laws are also now included, by default;
9817 * improved printing of ==> : ~:
9819 * new object-logic "Sequents" adds linear logic, while replacing LK
9820 and Modal (thanks to Sara Kalvala);
9822 * HOL/Auth: correctness proofs for authentication protocols;
9824 * HOL: new auto_tac combines rewriting and classical reasoning (many
9825 examples on HOL/Auth);
9827 * HOL: new command AddIffs for declaring theorems of the form P=Q to
9828 the rewriter and classical reasoner simultaneously;
9830 * function uresult no longer returns theorems in "standard" format;
9831 regain previous version by: val uresult = standard o uresult;
9838 * oracles -- these establish an interface between Isabelle and trusted
9839 external reasoners, which may deliver results as theorems;
9841 * proof objects (in particular record all uses of oracles);
9843 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
9845 * "constdefs" section in theory files;
9847 * "primrec" section (HOL) no longer requires names;
9849 * internal type "tactic" now simply "thm -> thm Sequence.seq";
9856 * reduced space requirements;
9858 * automatic HTML generation from theories;
9860 * theory files no longer require "..." (quotes) around most types;
9862 * new examples, including two proofs of the Church-Rosser theorem;
9864 * non-curried (1994) version of HOL is no longer distributed;
9871 * greatly reduced space requirements;
9873 * theory files (.thy) no longer require \...\ escapes at line breaks;
9875 * searchable theorem database (see the section "Retrieving theorems" on
9876 page 8 of the Reference Manual);
9878 * new examples, including Grabczewski's monumental case study of the
9881 * The previous version of HOL renamed to Old_HOL;
9883 * The new version of HOL (previously called CHOL) uses a curried syntax
9884 for functions. Application looks like f a b instead of f(a,b);
9886 * Mutually recursive inductive definitions finally work in HOL;
9888 * In ZF, pattern-matching on tuples is now available in all abstractions and
9889 translates to the operator "split";
9896 * new infix operator, addss, allowing the classical reasoner to
9897 perform simplification at each step of its search. Example:
9898 fast_tac (cs addss ss)
9900 * a new logic, CHOL, the same as HOL, but with a curried syntax
9901 for functions. Application looks like f a b instead of f(a,b). Also pairs
9902 look like (a,b) instead of <a,b>;
9904 * PLEASE NOTE: CHOL will eventually replace HOL!
9906 * In CHOL, pattern-matching on tuples is now available in all abstractions.
9907 It translates to the operator "split". A new theory of integers is available;
9909 * In ZF, integer numerals now denote two's-complement binary integers.
9910 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
9912 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
9913 of the Axiom of Choice;
9920 * Significantly faster resolution;
9922 * the different sections in a .thy file can now be mixed and repeated
9925 * Database of theorems for FOL, HOL and ZF. New
9926 commands including qed, qed_goal and bind_thm store theorems in the database.
9928 * Simple database queries: return a named theorem (get_thm) or all theorems of
9929 a given theory (thms_of), or find out what theory a theorem was proved in
9932 * Bugs fixed in the inductive definition and datatype packages;
9934 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
9935 and HOL_dup_cs obsolete;
9937 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
9940 * Simpler definition of function space in ZF;
9942 * new results about cardinal and ordinal arithmetic in ZF;
9944 * 'subtype' facility in HOL for introducing new types as subsets of existing
9947 :mode=text:wrap=hard:maxLineLen=72: