1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Explicit treatment of UTF8 sequences as Isabelle symbols, such that
10 a Unicode character is treated as a single symbol, not a sequence of
11 non-ASCII bytes as before. Since Isabelle/ML string literals may
12 contain symbols without further backslash escapes, Unicode can now be
13 used here as well. Recall that Symbol.explode in ML provides a
14 consistent view on symbols, while raw explode (or String.explode)
15 merely give a byte-oriented representation.
17 * Theory loading: only the master source file is looked-up in the
18 implicit load path, all other files are addressed relatively to its
19 directory. Minor INCOMPATIBILITY, subtle change in semantics.
21 * Special treatment of ML file names has been discontinued.
22 Historically, optional extensions .ML or .sml were added on demand --
23 at the cost of clarity of file dependencies. Recall that Isabelle/ML
24 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
29 * Interpretation command 'interpret' accepts a list of equations like
30 'interpretation' does.
32 * Diagnostic command 'print_interps' prints interpretations in proofs
33 in addition to interpretations in theories.
35 * Discontinued obsolete 'global' and 'local' commands to manipulate
36 the theory name space. Rare INCOMPATIBILITY. The ML functions
37 Sign.root_path and Sign.local_path may be applied directly where this
38 feature is still required for historical reasons.
43 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
45 * Theory SetsAndFunctions has been split into Function_Algebras and Set_Algebras;
46 canonical names for instance definitions for functions; various improvements.
49 * Records: logical foundation type for records do not carry a '_type' suffix
50 any longer. INCOMPATIBILITY.
52 * Code generation for records: more idiomatic representation of record types.
53 Warning: records are not covered by ancient SML code generation any longer.
54 INCOMPATIBILITY. In cases of need, a suitable rep_datatype declaration
55 helps to succeed then:
59 rep_datatype foo_ext ...
61 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
64 * Quickcheck in locales considers interpretations of that locale for
65 counter example search.
67 * Theory Library/Monad_Syntax provides do-syntax for monad types. Syntax
68 in Library/State_Monad has been changed to avoid ambiguities.
71 * Code generator: export_code without explicit file declaration prints
72 to standard output. INCOMPATIBILITY.
74 * Abolished symbol type names: "prod" and "sum" replace "*" and "+"
75 respectively. INCOMPATIBILITY.
77 * Constant "split" has been merged with constant "prod_case"; names
78 of ML functions, facts etc. involving split have been retained so far,
79 though. INCOMPATIBILITY.
81 * Dropped old infix syntax "mem" for List.member; use "in set"
82 instead. INCOMPATIBILITY.
84 * Refactoring of code-generation specific operations in List.thy
91 null_empty ~> null_def
93 INCOMPATIBILITY. Note that these were not suppossed to be used
94 regularly unless for striking reasons; their main purpose was code
97 * Some previously unqualified names have been qualified:
104 Trueprop ~> HOL.Trueprop
117 Pair ~> Product_Type.Pair
118 fst ~> Product_Type.fst
119 snd ~> Product_Type.snd
120 curry ~> Product_Type.curry
122 Collect ~> Set.Collect
126 * Removed simplifier congruence rule of "prod_case", as has for long
127 been the case with "split". INCOMPATIBILITY.
129 * Datatype package: theorems generated for executable equality
130 (class eq) carry proper names and are treated as default code
133 * List.thy: use various operations from the Haskell prelude when
134 generating Haskell code.
136 * code_simp.ML and method code_simp: simplification with rules determined
139 * code generator: do not print function definitions for case
140 combinators any longer.
142 * Multivariate Analysis: Introduced a type class for euclidean space. Most
143 theorems are now stated in terms of euclidean spaces instead of finite
147 real ^ 'n ~> 'a::real_vector
148 ~> 'a::euclidean_space
149 ~> 'a::ordered_euclidean_space
150 (depends on your needs)
154 \<chi> x. _ ~> \<chi>\<chi> x. _
157 Also note that the indices are now natural numbers and not from some finite
158 type. Finite cartesian products of euclidean spaces, products of euclidean
159 spaces the real and complex numbers are instantiated to be euclidean_spaces.
163 * Probability: Introduced pinfreal as real numbers with infinity. Use pinfreal
164 as value for measures. Introduces Lebesgue Measure based on the integral in
165 Multivariate Analysis. Proved Radon Nikodym for arbitrary sigma finite measure
170 * Inductive package: offers new command "inductive_simps" to automatically
171 derive instantiated and simplified equations for inductive predicates,
172 similar to inductive_cases.
177 * All constant names are now qualified. INCOMPATIBILITY.
182 * All constant names are now qualified. INCOMPATIBILITY.
187 * ML antiquotations @{theory} and @{theory_ref} refer to named
188 theories from the ancestry of the current context, not any accidental
189 theory loader state as before. Potential INCOMPATIBILITY, subtle
195 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
199 New in Isabelle2009-2 (June 2010)
200 ---------------------------------
204 * Authentic syntax for *all* logical entities (type classes, type
205 constructors, term constants): provides simple and robust
206 correspondence between formal entities and concrete syntax. Within
207 the parse tree / AST representations, "constants" are decorated by
208 their category (class, type, const) and spelled out explicitly with
209 their full internal name.
211 Substantial INCOMPATIBILITY concerning low-level syntax declarations
212 and translations (translation rules and translation functions in ML).
213 Some hints on upgrading:
215 - Many existing uses of 'syntax' and 'translations' can be replaced
216 by more modern 'type_notation', 'notation' and 'abbreviation',
217 which are independent of this issue.
219 - 'translations' require markup within the AST; the term syntax
220 provides the following special forms:
222 CONST c -- produces syntax version of constant c from context
223 XCONST c -- literally c, checked as constant from context
224 c -- literally c, if declared by 'syntax'
226 Plain identifiers are treated as AST variables -- occasionally the
227 system indicates accidental variables via the error "rhs contains
230 Type classes and type constructors are marked according to their
231 concrete syntax. Some old translations rules need to be written
232 for the "type" category, using type constructor application
233 instead of pseudo-term application of the default category
236 - 'parse_translation' etc. in ML may use the following
239 @{class_syntax c} -- type class c within parse tree / AST
240 @{term_syntax c} -- type constructor c within parse tree / AST
241 @{const_syntax c} -- ML version of "CONST c" above
242 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
244 - Literal types within 'typed_print_translations', i.e. those *not*
245 represented as pseudo-terms are represented verbatim. Use @{class
246 c} or @{type_name c} here instead of the above syntax
249 Note that old non-authentic syntax was based on unqualified base
250 names, so all of the above "constant" names would coincide. Recall
251 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
252 diagnose syntax problems.
254 * Type constructors admit general mixfix syntax, not just infix.
256 * Concrete syntax may be attached to local entities without a proof
257 body, too. This works via regular mixfix annotations for 'fix',
258 'def', 'obtain' etc. or via the explicit 'write' command, which is
259 similar to the 'notation' command in theory specifications.
261 * Discontinued unnamed infix syntax (legacy feature for many years) --
262 need to specify constant name and syntax separately. Internal ML
263 datatype constructors have been renamed from InfixName to Infix etc.
264 Minor INCOMPATIBILITY.
266 * Schematic theorem statements need to be explicitly markup as such,
267 via commands 'schematic_lemma', 'schematic_theorem',
268 'schematic_corollary'. Thus the relevance of the proof is made
269 syntactically clear, which impacts performance in a parallel or
270 asynchronous interactive environment. Minor INCOMPATIBILITY.
272 * Use of cumulative prems via "!" in some proof methods has been
273 discontinued (old legacy feature).
275 * References 'trace_simp' and 'debug_simp' have been replaced by
276 configuration options stored in the context. Enabling tracing (the
277 case of debugging is similar) in proofs works via
279 using [[trace_simp = true]]
281 Tracing is then active for all invocations of the simplifier in
282 subsequent goal refinement steps. Tracing may also still be enabled or
283 disabled via the ProofGeneral settings menu.
285 * Separate commands 'hide_class', 'hide_type', 'hide_const',
286 'hide_fact' replace the former 'hide' KIND command. Minor
289 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
290 more efficient than combinations with -q1 or -q2.
295 * Proofterms record type-class reasoning explicitly, using the
296 "unconstrain" operation internally. This eliminates all sort
297 constraints from a theorem and proof, introducing explicit
298 OFCLASS-premises. On the proof term level, this operation is
299 automatically applied at theorem boundaries, such that closed proofs
300 are always free of sort constraints. INCOMPATIBILITY for tools that
303 * Local theory specifications may depend on extra type variables that
304 are not present in the result type -- arguments TYPE('a) :: 'a itself
305 are added internally. For example:
307 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
309 * Predicates of locales introduced by classes carry a mandatory
310 "class" prefix. INCOMPATIBILITY.
312 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
314 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
317 * Command 'code_reflect' allows to incorporate generated ML code into
318 runtime environment; replaces immature code_datatype antiquotation.
321 * Code generator: simple concept for abstract datatypes obeying
324 * Code generator: details of internal data cache have no impact on the
325 user space functionality any longer.
327 * Methods "unfold_locales" and "intro_locales" ignore non-locale
328 subgoals. This is more appropriate for interpretations with 'where'.
331 * Command 'example_proof' opens an empty proof body. This allows to
332 experiment with Isar, without producing any persistent result.
334 * Commands 'type_notation' and 'no_type_notation' declare type syntax
335 within a local theory context, with explicit checking of the
336 constructors involved (in contrast to the raw 'syntax' versions).
338 * Commands 'types' and 'typedecl' now work within a local theory
339 context -- without introducing dependencies on parameters or
340 assumptions, which is not possible in Isabelle/Pure.
342 * Command 'defaultsort' has been renamed to 'default_sort', it works
343 within a local theory context. Minor INCOMPATIBILITY.
348 * Command 'typedef' now works within a local theory context -- without
349 introducing dependencies on parameters or assumptions, which is not
350 possible in Isabelle/Pure/HOL. Note that the logical environment may
351 contain multiple interpretations of local typedefs (with different
352 non-emptiness proofs), even in a global theory context.
354 * New package for quotient types. Commands 'quotient_type' and
355 'quotient_definition' may be used for defining types and constants by
356 quotient constructions. An example is the type of integers created by
357 quotienting pairs of natural numbers:
360 intrel :: "(nat * nat) => (nat * nat) => bool"
362 "intrel (x, y) (u, v) = (x + v = u + y)"
364 quotient_type int = "nat * nat" / intrel
365 by (auto simp add: equivp_def expand_fun_eq)
368 "0::int" is "(0::nat, 0::nat)"
370 The method "lifting" can be used to lift of theorems from the
371 underlying "raw" type to the quotient type. The example
372 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
373 construction and provides a reasoning infrastructure for finite sets.
375 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
376 clash with new theory Quotient in Main HOL.
378 * Moved the SMT binding into the main HOL session, eliminating
379 separate HOL-SMT session.
381 * List membership infix mem operation is only an input abbreviation.
384 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
385 for future developements; former Library/Word.thy is still present in
386 the AFP entry RSAPPS.
388 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
389 longer shadowed. INCOMPATIBILITY.
391 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
394 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
397 * Dropped normalizing_semiring etc; use the facts in semiring classes
398 instead. INCOMPATIBILITY.
400 * Dropped several real-specific versions of lemmas about floor and
401 ceiling; use the generic lemmas from theory "Archimedean_Field"
402 instead. INCOMPATIBILITY.
404 floor_number_of_eq ~> floor_number_of
405 le_floor_eq_number_of ~> number_of_le_floor
406 le_floor_eq_zero ~> zero_le_floor
407 le_floor_eq_one ~> one_le_floor
408 floor_less_eq_number_of ~> floor_less_number_of
409 floor_less_eq_zero ~> floor_less_zero
410 floor_less_eq_one ~> floor_less_one
411 less_floor_eq_number_of ~> number_of_less_floor
412 less_floor_eq_zero ~> zero_less_floor
413 less_floor_eq_one ~> one_less_floor
414 floor_le_eq_number_of ~> floor_le_number_of
415 floor_le_eq_zero ~> floor_le_zero
416 floor_le_eq_one ~> floor_le_one
417 floor_subtract_number_of ~> floor_diff_number_of
418 floor_subtract_one ~> floor_diff_one
419 ceiling_number_of_eq ~> ceiling_number_of
420 ceiling_le_eq_number_of ~> ceiling_le_number_of
421 ceiling_le_zero_eq ~> ceiling_le_zero
422 ceiling_le_eq_one ~> ceiling_le_one
423 less_ceiling_eq_number_of ~> number_of_less_ceiling
424 less_ceiling_eq_zero ~> zero_less_ceiling
425 less_ceiling_eq_one ~> one_less_ceiling
426 ceiling_less_eq_number_of ~> ceiling_less_number_of
427 ceiling_less_eq_zero ~> ceiling_less_zero
428 ceiling_less_eq_one ~> ceiling_less_one
429 le_ceiling_eq_number_of ~> number_of_le_ceiling
430 le_ceiling_eq_zero ~> zero_le_ceiling
431 le_ceiling_eq_one ~> one_le_ceiling
432 ceiling_subtract_number_of ~> ceiling_diff_number_of
433 ceiling_subtract_one ~> ceiling_diff_one
435 * Theory "Finite_Set": various folding_XXX locales facilitate the
436 application of the various fold combinators on finite sets.
438 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
439 provides abstract red-black tree type which is backed by "RBT_Impl" as
440 implementation. INCOMPATIBILTY.
442 * Theory Library/Coinductive_List has been removed -- superseded by
443 AFP/thys/Coinductive.
445 * Theory PReal, including the type "preal" and related operations, has
446 been removed. INCOMPATIBILITY.
448 * Real: new development using Cauchy Sequences.
450 * Split off theory "Big_Operators" containing setsum, setprod,
451 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
453 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
454 "Int" etc. INCOMPATIBILITY.
456 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
458 * New set of rules "ac_simps" provides combined assoc / commute
459 rewrites for all interpretations of the appropriate generic locales.
461 * Renamed theory "OrderedGroup" to "Groups" and split theory
462 "Ring_and_Field" into theories "Rings" and "Fields"; for more
463 appropriate and more consistent names suitable for name prefixes
464 within the HOL theories. INCOMPATIBILITY.
466 * Some generic constants have been put to appropriate theories:
467 - less_eq, less: Orderings
468 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
469 - inverse, divide: Rings
472 * More consistent naming of type classes involving orderings (and
475 lower_semilattice ~> semilattice_inf
476 upper_semilattice ~> semilattice_sup
478 dense_linear_order ~> dense_linorder
480 pordered_ab_group_add ~> ordered_ab_group_add
481 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
482 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
483 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
484 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
485 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
486 pordered_cancel_semiring ~> ordered_cancel_semiring
487 pordered_comm_monoid_add ~> ordered_comm_monoid_add
488 pordered_comm_ring ~> ordered_comm_ring
489 pordered_comm_semiring ~> ordered_comm_semiring
490 pordered_ring ~> ordered_ring
491 pordered_ring_abs ~> ordered_ring_abs
492 pordered_semiring ~> ordered_semiring
494 ordered_ab_group_add ~> linordered_ab_group_add
495 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
496 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
497 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
498 ordered_field ~> linordered_field
499 ordered_field_no_lb ~> linordered_field_no_lb
500 ordered_field_no_ub ~> linordered_field_no_ub
501 ordered_field_dense_linear_order ~> dense_linordered_field
502 ordered_idom ~> linordered_idom
503 ordered_ring ~> linordered_ring
504 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
505 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
506 ordered_ring_strict ~> linordered_ring_strict
507 ordered_semidom ~> linordered_semidom
508 ordered_semiring ~> linordered_semiring
509 ordered_semiring_1 ~> linordered_semiring_1
510 ordered_semiring_1_strict ~> linordered_semiring_1_strict
511 ordered_semiring_strict ~> linordered_semiring_strict
513 The following slightly odd type classes have been moved to a
514 separate theory Library/Lattice_Algebras:
516 lordered_ab_group_add ~> lattice_ab_group_add
517 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
518 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
519 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
520 lordered_ring ~> lattice_ring
524 * Refined field classes:
525 - classes division_ring_inverse_zero, field_inverse_zero,
526 linordered_field_inverse_zero include rule inverse 0 = 0 --
527 subsumes former division_by_zero class;
528 - numerous lemmas have been ported from field to division_ring.
531 * Refined algebra theorem collections:
532 - dropped theorem group group_simps, use algebra_simps instead;
533 - dropped theorem group ring_simps, use field_simps instead;
534 - proper theorem collection field_simps subsumes former theorem
535 groups field_eq_simps and field_simps;
536 - dropped lemma eq_minus_self_iff which is a duplicate for
540 * Theory Finite_Set and List: some lemmas have been generalized from
543 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
544 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
545 inter_Inter_fold_inter ~> inf_Inf_fold_inf
546 union_Union_fold_union ~> sup_Sup_fold_sup
547 Inter_fold_inter ~> Inf_fold_inf
548 Union_fold_union ~> Sup_fold_sup
549 inter_INTER_fold_inter ~> inf_INFI_fold_inf
550 union_UNION_fold_union ~> sup_SUPR_fold_sup
551 INTER_fold_inter ~> INFI_fold_inf
552 UNION_fold_union ~> SUPR_fold_sup
554 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
555 replaced by the more convenient lemmas Inf_empty and Sup_empty.
556 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
557 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
558 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
559 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
561 * Reorganized theory Multiset: swapped notation of pointwise and
564 - pointwise ordering is instance of class order with standard syntax
566 - multiset ordering has syntax <=# and <#; partial order properties
567 are provided by means of interpretation with prefix
569 - less duplication, less historical organization of sections,
570 conversion from associations lists to multisets, rudimentary code
572 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
577 multiset_eq_conv_count_eq ~> multiset_ext_iff
578 multi_count_ext ~> multiset_ext
579 diff_union_inverse2 ~> diff_union_cancelR
583 * Theory Permutation: replaced local "remove" by List.remove1.
585 * Code generation: ML and OCaml code is decorated with signatures.
587 * Theory List: added transpose.
589 * Library/Nat_Bijection.thy is a collection of bijective functions
590 between nat and other types, which supersedes the older libraries
591 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
594 Nat_Int_Bij.nat2_to_nat ~> prod_encode
595 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
596 Nat_Int_Bij.int_to_nat_bij ~> int_encode
597 Nat_Int_Bij.nat_to_int_bij ~> int_decode
598 Countable.pair_encode ~> prod_encode
599 NatIso.prod2nat ~> prod_encode
600 NatIso.nat2prod ~> prod_decode
601 NatIso.sum2nat ~> sum_encode
602 NatIso.nat2sum ~> sum_decode
603 NatIso.list2nat ~> list_encode
604 NatIso.nat2list ~> list_decode
605 NatIso.set2nat ~> set_encode
606 NatIso.nat2set ~> set_decode
609 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
610 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
611 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
612 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
613 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
614 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
615 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
616 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
617 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
618 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
619 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
620 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
621 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
624 - Renamed ATP commands:
625 atp_info ~> sledgehammer running_atps
626 atp_kill ~> sledgehammer kill_atps
627 atp_messages ~> sledgehammer messages
628 atp_minimize ~> sledgehammer minimize
629 print_atps ~> sledgehammer available_atps
631 - Added user's manual ("isabelle doc sledgehammer").
632 - Added option syntax and "sledgehammer_params" to customize
633 Sledgehammer's behavior. See the manual for details.
634 - Modified the Isar proof reconstruction code so that it produces
635 direct proofs rather than proofs by contradiction. (This feature
636 is still experimental.)
637 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
639 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
642 - Added and implemented "binary_ints" and "bits" options.
643 - Added "std" option and implemented support for nonstandard models.
644 - Added and implemented "finitize" option to improve the precision
645 of infinite datatypes based on a monotonicity analysis.
646 - Added support for quotient types.
647 - Added support for "specification" and "ax_specification"
649 - Added support for local definitions (for "function" and
650 "termination" proofs).
651 - Added support for term postprocessors.
652 - Optimized "Multiset.multiset" and "FinFun.finfun".
653 - Improved efficiency of "destroy_constrs" optimization.
654 - Fixed soundness bugs related to "destroy_constrs" optimization and
656 - Fixed soundness bug related to higher-order constructors.
657 - Fixed soundness bug when "full_descrs" is enabled.
658 - Improved precision of set constructs.
659 - Added "atoms" option.
660 - Added cache to speed up repeated Kodkod invocations on the same
662 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
663 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
664 "SAT4J_Light". INCOMPATIBILITY.
665 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
666 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
667 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
669 * Method "induct" now takes instantiations of the form t, where t is not
670 a variable, as a shorthand for "x == t", where x is a fresh variable.
671 If this is not intended, t has to be enclosed in parentheses.
672 By default, the equalities generated by definitional instantiations
673 are pre-simplified, which may cause parameters of inductive cases
674 to disappear, or may even delete some of the inductive cases.
675 Use "induct (no_simp)" instead of "induct" to restore the old
676 behaviour. The (no_simp) option is also understood by the "cases"
677 and "nominal_induct" methods, which now perform pre-simplification, too.
683 * Variable names in lemmas generated by the domain package have
684 changed; the naming scheme is now consistent with the HOL datatype
685 package. Some proof scripts may be affected, INCOMPATIBILITY.
687 * The domain package no longer defines the function "foo_copy" for
688 recursive domain "foo". The reach lemma is now stated directly in
689 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
690 be reformulated in terms of "foo_take", INCOMPATIBILITY.
692 * Most definedness lemmas generated by the domain package (previously
693 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
694 like "foo$x = UU <-> x = UU", which works better as a simp rule.
695 Proofs that used definedness lemmas as intro rules may break,
696 potential INCOMPATIBILITY.
698 * Induction and casedist rules generated by the domain package now
699 declare proper case_names (one called "bottom", and one named for each
700 constructor). INCOMPATIBILITY.
702 * For mutually-recursive domains, separate "reach" and "take_lemma"
703 rules are generated for each domain, INCOMPATIBILITY.
705 foo_bar.reach ~> foo.reach bar.reach
706 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
708 * Some lemmas generated by the domain package have been renamed for
709 consistency with the datatype package, INCOMPATIBILITY.
711 foo.ind ~> foo.induct
712 foo.finite_ind ~> foo.finite_induct
713 foo.coind ~> foo.coinduct
714 foo.casedist ~> foo.exhaust
715 foo.exhaust ~> foo.nchotomy
717 * For consistency with other definition packages, the fixrec package
718 now generates qualified theorem names, INCOMPATIBILITY.
720 foo_simps ~> foo.simps
721 foo_unfold ~> foo.unfold
722 foo_induct ~> foo.induct
724 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
725 method and internal fixrec proofs now use the default simpset instead.
728 * The "contlub" predicate has been removed. Proof scripts should use
729 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
731 * The "admw" predicate has been removed, INCOMPATIBILITY.
733 * The constants cpair, cfst, and csnd have been removed in favor of
734 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
739 * Antiquotations for basic formal entities:
741 @{class NAME} -- type class
742 @{class_syntax NAME} -- syntax representation of the above
744 @{type_name NAME} -- logical type
745 @{type_abbrev NAME} -- type abbreviation
746 @{nonterminal NAME} -- type of concrete syntactic category
747 @{type_syntax NAME} -- syntax representation of any of the above
749 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
750 @{const_abbrev NAME} -- abbreviated constant
751 @{const_syntax NAME} -- syntax representation of any of the above
753 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
754 syntax constant (cf. 'syntax' command).
756 * Antiquotation @{make_string} inlines a function to print arbitrary
757 values similar to the ML toplevel. The result is compiler dependent
758 and may fall back on "?" in certain situations.
760 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
761 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
762 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
763 not work with the asynchronous Isar document model.
765 * Configuration options now admit dynamic default values, depending on
766 the context or even global references.
768 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
769 uses an efficient external library if available (for Poly/ML).
771 * Renamed some important ML structures, while keeping the old names
772 for some time as aliases within the structure Legacy:
774 OuterKeyword ~> Keyword
777 OuterSyntax ~> Outer_Syntax
778 PrintMode ~> Print_Mode
779 SpecParse ~> Parse_Spec
782 ThyOutput ~> Thy_Output
783 TypeInfer ~> Type_Infer
785 Note that "open Legacy" simplifies porting of sources, but forgetting
786 to remove it again will complicate porting again in the future.
788 * Most operations that refer to a global context are named
789 accordingly, e.g. Simplifier.global_context or
790 ProofContext.init_global. There are some situations where a global
791 context actually works, but under normal circumstances one needs to
792 pass the proper local context through the code!
794 * Discontinued old TheoryDataFun with its copy/init operation -- data
795 needs to be pure. Functor Theory_Data_PP retains the traditional
796 Pretty.pp argument to merge, which is absent in the standard
799 * Sorts.certify_sort and derived "cert" operations for types and terms
800 no longer minimize sorts. Thus certification at the boundary of the
801 inference kernel becomes invariant under addition of class relations,
802 which is an important monotonicity principle. Sorts are now minimized
803 in the syntax layer only, at the boundary between the end-user and the
804 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
805 explicitly in rare situations.
807 * Renamed old-style Drule.standard to Drule.export_without_context, to
808 emphasize that this is in no way a standard operation.
811 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
812 usual for resolution. Rare INCOMPATIBILITY.
814 * Renamed varify/unvarify operations to varify_global/unvarify_global
815 to emphasize that these only work in a global situation (which is
818 * Curried take and drop in library.ML; negative length is interpreted
819 as infinity (as in chop). Subtle INCOMPATIBILITY.
821 * Proof terms: type substitutions on proof constants now use canonical
822 order of type variables. INCOMPATIBILITY for tools working with proof
825 * Raw axioms/defs may no longer carry sort constraints, and raw defs
826 may no longer carry premises. User-level specifications are
827 transformed accordingly by Thm.add_axiom/add_def.
832 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
833 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
834 proof terms are enabled unconditionally in the new HOL-Proofs image.
836 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
837 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
840 * Old lib/scripts/polyml-platform is superseded by the
841 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
842 variant, even on a 64 bit machine. The following example setting
843 prefers 64 bit if available:
845 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
847 * The preliminary Isabelle/jEdit application demonstrates the emerging
848 Isabelle/Scala layer for advanced prover interaction and integration.
849 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
852 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
853 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
854 similar to the default assignment of the document preparation system
855 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
856 provides some operations for direct access to the font without asking
857 the user for manual installation.
861 New in Isabelle2009-1 (December 2009)
862 -------------------------------------
866 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
867 one backslash should be used, even in ML sources.
872 * Locale interpretation propagates mixins along the locale hierarchy.
873 The currently only available mixins are the equations used to map
874 local definitions to terms of the target domain of an interpretation.
876 * Reactivated diagnostic command 'print_interps'. Use "print_interps
877 loc" to print all interpretations of locale "loc" in the theory.
878 Interpretations in proofs are not shown.
880 * Thoroughly revised locales tutorial. New section on conditional
883 * On instantiation of classes, remaining undefined class parameters
884 are formally declared. INCOMPATIBILITY.
887 *** Document preparation ***
889 * New generalized style concept for printing terms: @{foo (style) ...}
890 instead of @{foo_style style ...} (old form is still retained for
891 backward compatibility). Styles can be also applied for
892 antiquotations prop, term_type and typeof.
897 * New proof method "smt" for a combination of first-order logic with
898 equality, linear and nonlinear (natural/integer/real) arithmetic, and
899 fixed-size bitvectors; there is also basic support for higher-order
900 features (esp. lambda abstractions). It is an incomplete decision
901 procedure based on external SMT solvers using the oracle mechanism;
902 for the SMT solver Z3, this method is proof-producing. Certificates
903 are provided to avoid calling the external solvers solely for
904 re-checking proofs. Due to a remote SMT service there is no need for
905 installing SMT solvers locally. See src/HOL/SMT.
907 * New commands to load and prove verification conditions generated by
908 the Boogie program verifier or derived systems (e.g. the Verifying C
909 Compiler (VCC) or Spec#). See src/HOL/Boogie.
911 * New counterexample generator tool 'nitpick' based on the Kodkod
912 relational model finder. See src/HOL/Tools/Nitpick and
913 src/HOL/Nitpick_Examples.
915 * New commands 'code_pred' and 'values' to invoke the predicate
916 compiler and to enumerate values of inductive predicates.
918 * A tabled implementation of the reflexive transitive closure.
920 * New implementation of quickcheck uses generic code generator;
921 default generators are provided for all suitable HOL types, records
922 and datatypes. Old quickcheck can be re-activated importing theory
923 Library/SML_Quickcheck.
925 * New testing tool Mirabelle for automated proof tools. Applies
926 several tools and tactics like sledgehammer, metis, or quickcheck, to
927 every proof step in a theory. To be used in batch mode via the
930 * New proof method "sos" (sum of squares) for nonlinear real
931 arithmetic (originally due to John Harison). It requires theory
932 Library/Sum_Of_Squares. It is not a complete decision procedure but
933 works well in practice on quantifier-free real arithmetic with +, -,
934 *, ^, =, <= and <, i.e. boolean combinations of equalities and
935 inequalities between polynomials. It makes use of external
936 semidefinite programming solvers. Method "sos" generates a
937 certificate that can be pasted into the proof thus avoiding the need
938 to call an external tool every time the proof is checked. See
939 src/HOL/Library/Sum_Of_Squares.
941 * New method "linarith" invokes existing linear arithmetic decision
944 * New command 'atp_minimal' reduces result produced by Sledgehammer.
946 * New Sledgehammer option "Full Types" in Proof General settings menu.
947 Causes full type information to be output to the ATPs. This slows
948 ATPs down considerably but eliminates a source of unsound "proofs"
951 * New method "metisFT": A version of metis that uses full type
952 information in order to avoid failures of proof reconstruction.
954 * New evaluator "approximate" approximates an real valued term using
955 the same method as the approximation method.
957 * Method "approximate" now supports arithmetic expressions as
958 boundaries of intervals and implements interval splitting and Taylor
961 * ML antiquotation @{code_datatype} inserts definition of a datatype
962 generated by the code generator; e.g. see src/HOL/Predicate.thy.
964 * New theory SupInf of the supremum and infimum operators for sets of
967 * New theory Probability, which contains a development of measure
968 theory, eventually leading to Lebesgue integration and probability.
970 * Extended Multivariate Analysis to include derivation and Brouwer's
973 * Reorganization of number theory, INCOMPATIBILITY:
974 - new number theory development for nat and int, in theories Divides
975 and GCD as well as in new session Number_Theory
976 - some constants and facts now suffixed with _nat and _int
978 - former session NumberTheory now named Old_Number_Theory, including
979 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
980 - moved theory Pocklington from src/HOL/Library to
981 src/HOL/Old_Number_Theory
983 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
984 lcm of finite and infinite sets. It is shown that they form a complete
987 * Class semiring_div requires superclass no_zero_divisors and proof of
988 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
989 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
990 generalized to class semiring_div, subsuming former theorems
991 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
992 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
995 * Refinements to lattice classes and sets:
996 - less default intro/elim rules in locale variant, more default
997 intro/elim rules in class variant: more uniformity
998 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
1000 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
1002 - renamed ACI to inf_sup_aci
1003 - new class "boolean_algebra"
1004 - class "complete_lattice" moved to separate theory
1005 "Complete_Lattice"; corresponding constants (and abbreviations)
1006 renamed and with authentic syntax:
1007 Set.Inf ~> Complete_Lattice.Inf
1008 Set.Sup ~> Complete_Lattice.Sup
1009 Set.INFI ~> Complete_Lattice.INFI
1010 Set.SUPR ~> Complete_Lattice.SUPR
1011 Set.Inter ~> Complete_Lattice.Inter
1012 Set.Union ~> Complete_Lattice.Union
1013 Set.INTER ~> Complete_Lattice.INTER
1014 Set.UNION ~> Complete_Lattice.UNION
1015 - authentic syntax for
1018 - mere abbreviations:
1021 Set.inter (for inf, formerly Set.Int)
1022 Set.union (for sup, formerly Set.Un)
1023 Complete_Lattice.Inter (for Inf)
1024 Complete_Lattice.Union (for Sup)
1025 Complete_Lattice.INTER (for INFI)
1026 Complete_Lattice.UNION (for SUPR)
1027 - object-logic definitions as far as appropriate
1029 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
1030 Un_subset_iff are explicitly deleted as default simp rules; then also
1031 their lattice counterparts le_inf_iff and le_sup_iff have to be
1032 deleted to achieve the desired effect.
1034 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
1035 rules by default any longer; the same applies to min_max.inf_absorb1
1036 etc. INCOMPATIBILITY.
1038 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
1039 pred_set_conv by default. INCOMPATIBILITY.
1041 * Power operations on relations and functions are now one dedicated
1042 constant "compow" with infix syntax "^^". Power operation on
1043 multiplicative monoids retains syntax "^" and is now defined generic
1044 in class power. INCOMPATIBILITY.
1046 * Relation composition "R O S" now has a more standard argument order:
1047 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
1048 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
1049 break, since the O_assoc rule was not rewritten like this. Fix using
1050 O_assoc[symmetric]. The same applies to the curried version "R OO S".
1052 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
1053 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
1056 * Most rules produced by inductive and datatype package have mandatory
1057 prefixes. INCOMPATIBILITY.
1059 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
1060 the attribute of the same name. Each of the theorems in the list
1061 DERIV_intros assumes composition with an additional function and
1062 matches a variable to the derivative, which has to be solved by the
1063 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
1064 of most elementary terms. Former Maclauren.DERIV_tac and
1065 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
1068 * Code generator attributes follow the usual underscore convention:
1069 code_unfold replaces code unfold
1070 code_post replaces code post
1075 sizechange -> size_change
1076 induct_scheme -> induction_schema
1079 * Discontinued abbreviation "arbitrary" of constant "undefined".
1080 INCOMPATIBILITY, use "undefined" directly.
1083 Suc_eq_add_numeral_1 -> Suc_eq_plus1
1084 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
1085 Suc_plus1 -> Suc_eq_plus1
1086 *anti_sym -> *antisym*
1087 vector_less_eq_def -> vector_le_def
1090 * Added theorem List.map_map as [simp]. Removed List.map_compose.
1093 * Removed predicate "M hassize n" (<--> card M = n & finite M).
1099 * Theory Representable defines a class "rep" of domains that are
1100 representable (via an ep-pair) in the universal domain type "udom".
1101 Instances are provided for all type constructors defined in HOLCF.
1103 * The 'new_domain' command is a purely definitional version of the
1104 domain package, for representable domains. Syntax is identical to the
1105 old domain package. The 'new_domain' package also supports indirect
1106 recursion using previously-defined type constructors. See
1107 src/HOLCF/ex/New_Domain.thy for examples.
1109 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
1110 on the left-hand side of an equation, and then performs
1111 simplification. Rewriting is done using rules declared with the
1112 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
1113 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
1115 * The pattern-match compiler in 'fixrec' can now handle constructors
1116 with HOL function types. Pattern-match combinators for the Pair
1117 constructor are pre-configured.
1119 * The 'fixrec' package now produces better fixed-point induction rules
1120 for mutually-recursive definitions: Induction rules have conclusions
1121 of the form "P foo bar" instead of "P <foo, bar>".
1123 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
1124 been renamed to "below". The name "below" now replaces "less" in many
1125 theorem names. (Legacy theorem names using "less" are still supported
1128 * The 'fixrec' package now supports "bottom patterns". Bottom
1129 patterns can be used to generate strictness rules, or to make
1130 functions more strict (much like the bang-patterns supported by the
1131 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
1137 * Support for Poly/ML 5.3.0, with improved reporting of compiler
1138 errors and run-time exceptions, including detailed source positions.
1140 * Structure Name_Space (formerly NameSpace) now manages uniquely
1141 identified entries, with some additional information such as source
1142 position, logical grouping etc.
1144 * Theory and context data is now introduced by the simplified and
1145 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
1146 to be pure, but the old TheoryDataFun for mutable data (with explicit
1147 copy operation) is still available for some time.
1149 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
1150 provides a high-level programming interface to synchronized state
1151 variables with atomic update. This works via pure function
1152 application within a critical section -- its runtime should be as
1153 short as possible; beware of deadlocks if critical code is nested,
1154 either directly or indirectly via other synchronized variables!
1156 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
1157 wraps raw ML references, explicitly indicating their non-thread-safe
1158 behaviour. The Isar toplevel keeps this structure open, to
1159 accommodate Proof General as well as quick and dirty interactive
1160 experiments with references.
1162 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
1163 parallel tactical reasoning.
1165 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
1166 are similar to SUBPROOF, but are slightly more flexible: only the
1167 specified parts of the subgoal are imported into the context, and the
1168 body tactic may introduce new subgoals and schematic variables.
1170 * Old tactical METAHYPS, which does not observe the proof context, has
1171 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
1172 or Subgoal.FOCUS etc.
1174 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
1175 functors have their own ML name space there is no point to mark them
1176 separately.) Minor INCOMPATIBILITY.
1178 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
1180 * Renamed several structures FooBar to Foo_Bar. Occasional,
1183 * Operations of structure Skip_Proof no longer require quick_and_dirty
1184 mode, which avoids critical setmp.
1186 * Eliminated old Attrib.add_attributes, Method.add_methods and related
1187 combinators for "args". INCOMPATIBILITY, need to use simplified
1188 Attrib/Method.setup introduced in Isabelle2009.
1190 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
1191 back on global_simpset_of, global_claset_of, global_clasimpset_of as
1192 last resort. INCOMPATIBILITY.
1194 * Display.pretty_thm now requires a proper context (cf. former
1195 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
1196 or even Display.pretty_thm_without_context as last resort.
1199 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
1200 Syntax.pretty_typ/term directly, preferably with proper context
1201 instead of global theory.
1206 * Further fine tuning of parallel proof checking, scales up to 8 cores
1207 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
1210 * Support for additional "Isabelle components" via etc/components, see
1211 also the system manual.
1213 * The isabelle makeall tool now operates on all components with
1214 IsaMakefile, not just hardwired "logics".
1216 * Removed "compress" option from isabelle-process and isabelle usedir;
1217 this is always enabled.
1219 * Discontinued support for Poly/ML 4.x versions.
1221 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
1222 on a given logic image. This requires the lighttpd webserver and is
1223 currently supported on Linux only.
1227 New in Isabelle2009 (April 2009)
1228 --------------------------------
1232 * Simplified main Isabelle executables, with less surprises on
1233 case-insensitive file-systems (such as Mac OS).
1235 - The main Isabelle tool wrapper is now called "isabelle" instead of
1238 - The former "isabelle" alias for "isabelle-process" has been
1239 removed (should rarely occur to regular users).
1241 - The former "isabelle-interface" and its alias "Isabelle" have been
1242 removed (interfaces are now regular Isabelle tools).
1244 Within scripts and make files, the Isabelle environment variables
1245 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
1246 respectively. (The latter are still available as legacy feature.)
1248 The old isabelle-interface wrapper could react in confusing ways if
1249 the interface was uninstalled or changed otherwise. Individual
1250 interface tool configuration is now more explicit, see also the
1251 Isabelle system manual. In particular, Proof General is now available
1252 via "isabelle emacs".
1254 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
1255 purge installed copies of Isabelle executables and re-run "isabelle
1256 install -p ...", or use symlinks.
1258 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
1259 old ~/isabelle, which was slightly non-standard and apt to cause
1260 surprises on case-insensitive file-systems (such as Mac OS).
1262 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
1263 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
1264 care is required when using older releases of Isabelle. Note that
1265 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
1266 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
1268 * Proofs of fully specified statements are run in parallel on
1269 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
1270 a regular 4-core machine, if the initial heap space is made reasonably
1271 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
1273 * The main reference manuals ("isar-ref", "implementation", and
1274 "system") have been updated and extended. Formally checked references
1275 as hyperlinks are now available uniformly.
1280 * Complete re-implementation of locales. INCOMPATIBILITY in several
1281 respects. The most important changes are listed below. See the
1282 Tutorial on Locales ("locales" manual) for details.
1284 - In locale expressions, instantiation replaces renaming. Parameters
1285 must be declared in a for clause. To aid compatibility with previous
1286 parameter inheritance, in locale declarations, parameters that are not
1287 'touched' (instantiation position "_" or omitted) are implicitly added
1288 with their syntax at the beginning of the for clause.
1290 - Syntax from abbreviations and definitions in locales is available in
1291 locale expressions and context elements. The latter is particularly
1292 useful in locale declarations.
1294 - More flexible mechanisms to qualify names generated by locale
1295 expressions. Qualifiers (prefixes) may be specified in locale
1296 expressions, and can be marked as mandatory (syntax: "name!:") or
1297 optional (syntax "name?:"). The default depends for plain "name:"
1298 depends on the situation where a locale expression is used: in
1299 commands 'locale' and 'sublocale' prefixes are optional, in
1300 'interpretation' and 'interpret' prefixes are mandatory. The old
1301 implicit qualifiers derived from the parameter names of a locale are
1302 no longer generated.
1304 - Command "sublocale l < e" replaces "interpretation l < e". The
1305 instantiation clause in "interpretation" and "interpret" (square
1306 brackets) is no longer available. Use locale expressions.
1308 - When converting proof scripts, mandatory qualifiers in
1309 'interpretation' and 'interpret' should be retained by default, even
1310 if this is an INCOMPATIBILITY compared to former behavior. In the
1311 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
1312 in locale expressions range over a single locale instance only.
1314 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
1315 In existing theorem specifications replace the includes element by the
1316 respective context elements of the included locale, omitting those
1317 that are already present in the theorem specification. Multiple
1318 assume elements of a locale should be replaced by a single one
1319 involving the locale predicate. In the proof body, declarations (most
1320 notably theorems) may be regained by interpreting the respective
1321 locales in the proof context as required (command "interpret").
1323 If using "includes" in replacement of a target solely because the
1324 parameter types in the theorem are not as general as in the target,
1325 consider declaring a new locale with additional type constraints on
1326 the parameters (context element "constrains").
1328 - Discontinued "locale (open)". INCOMPATIBILITY.
1330 - Locale interpretation commands no longer attempt to simplify goal.
1331 INCOMPATIBILITY: in rare situations the generated goal differs. Use
1332 methods intro_locales and unfold_locales to clarify.
1334 - Locale interpretation commands no longer accept interpretation
1335 attributes. INCOMPATIBILITY.
1337 * Class declaration: so-called "base sort" must not be given in import
1338 list any longer, but is inferred from the specification. Particularly
1345 class foo = type + ...
1347 * Class target: global versions of theorems stemming do not carry a
1348 parameter prefix any longer. INCOMPATIBILITY.
1350 * Class 'instance' command no longer accepts attached definitions.
1351 INCOMPATIBILITY, use proper 'instantiation' target instead.
1353 * Recovered hiding of consts, which was accidentally broken in
1354 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
1355 makes c inaccessible; consider using ``hide (open) const c'' instead.
1357 * Slightly more coherent Pure syntax, with updated documentation in
1358 isar-ref manual. Removed locales meta_term_syntax and
1359 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
1360 INCOMPATIBILITY in rare situations. Note that &&& should not be used
1361 directly in regular applications.
1363 * There is a new syntactic category "float_const" for signed decimal
1364 fractions (e.g. 123.45 or -123.45).
1366 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
1367 interface with 'setup' command instead.
1369 * Command 'local_setup' is similar to 'setup', but operates on a local
1372 * The 'axiomatization' command now only works within a global theory
1373 context. INCOMPATIBILITY.
1375 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
1376 hypotheses. Sorts required in the course of reasoning need to be
1377 covered by the constraints in the initial statement, completed by the
1378 type instance information of the background theory. Non-trivial sort
1379 hypotheses, which rarely occur in practice, may be specified via
1380 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
1382 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
1384 The result contains an implicit sort hypotheses as before --
1385 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
1388 * Generalized Isar history, with support for linear undo, direct state
1391 * Changed defaults for unify configuration options:
1393 unify_trace_bound = 50 (formerly 25)
1394 unify_search_bound = 60 (formerly 30)
1396 * Different bookkeeping for code equations (INCOMPATIBILITY):
1398 a) On theory merge, the last set of code equations for a particular
1399 constant is taken (in accordance with the policy applied by other
1400 parts of the code generator framework).
1402 b) Code equations stemming from explicit declarations (e.g. code
1403 attribute) gain priority over default code equations stemming
1404 from definition, primrec, fun etc.
1406 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1408 * Unified theorem tables for both code generators. Thus [code
1409 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1411 * Command 'find_consts' searches for constants based on type and name
1414 find_consts "_ => bool"
1416 By default, matching is against subtypes, but it may be restricted to
1417 the whole type. Searching by name is possible. Multiple queries are
1418 conjunctive and queries may be negated by prefixing them with a
1421 find_consts strict: "_ => bool" name: "Int" -"int => int"
1423 * New 'find_theorems' criterion "solves" matches theorems that
1424 directly solve the current goal (modulo higher-order unification).
1426 * Auto solve feature for main theorem statements: whenever a new goal
1427 is stated, "find_theorems solves" is called; any theorems that could
1428 solve the lemma directly are listed as part of the goal state.
1429 Cf. associated options in Proof General Isabelle settings menu,
1430 enabled by default, with reasonable timeout for pathological cases of
1431 higher-order unification.
1434 *** Document preparation ***
1436 * Antiquotation @{lemma} now imitates a regular terminal proof,
1437 demanding keyword 'by' and supporting the full method expression
1438 syntax just like the Isar command 'by'.
1443 * Integrated main parts of former image HOL-Complex with HOL. Entry
1444 points Main and Complex_Main remain as before.
1446 * Logic image HOL-Plain provides a minimal HOL with the most important
1447 tools available (inductive, datatype, primrec, ...). This facilitates
1448 experimentation and tool development. Note that user applications
1449 (and library theories) should never refer to anything below theory
1452 * Logic image HOL-Main stops at theory Main, and thus facilitates
1453 experimentation due to shorter build times.
1455 * Logic image HOL-NSA contains theories of nonstandard analysis which
1456 were previously part of former HOL-Complex. Entry point Hyperreal
1457 remains valid, but theories formerly using Complex_Main should now use
1458 new entry point Hypercomplex.
1460 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1461 Posix processes. Avoids potentially expensive forking of the ML
1462 process. New thread-based implementation also works on non-Unix
1463 platforms (Cygwin). Provers are no longer hardwired, but defined
1464 within the theory via plain ML wrapper functions. Basic Sledgehammer
1465 commands are covered in the isar-ref manual.
1467 * Wrapper scripts for remote SystemOnTPTP service allows to use
1468 sledgehammer without local ATP installation (Vampire etc.). Other
1469 provers may be included via suitable ML wrappers, see also
1470 src/HOL/ATP_Linkup.thy.
1472 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1475 * The metis method no longer fails because the theorem is too trivial
1476 (contains the empty clause).
1478 * The metis method now fails in the usual manner, rather than raising
1479 an exception, if it determines that it cannot prove the theorem.
1481 * Method "coherent" implements a prover for coherent logic (see also
1482 src/Tools/coherent.ML).
1484 * Constants "undefined" and "default" replace "arbitrary". Usually
1485 "undefined" is the right choice to replace "arbitrary", though
1486 logically there is no difference. INCOMPATIBILITY.
1488 * Command "value" now integrates different evaluation mechanisms. The
1489 result of the first successful evaluation mechanism is printed. In
1490 square brackets a particular named evaluation mechanisms may be
1491 specified (currently, [SML], [code] or [nbe]). See further
1492 src/HOL/ex/Eval_Examples.thy.
1494 * Normalization by evaluation now allows non-leftlinear equations.
1495 Declare with attribute [code nbe].
1497 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1498 as the structured Isar versions "cases" and "induct", cf. the
1499 corresponding "cases" and "induct" attributes. Mutual induction rules
1500 are now presented as a list of individual projections
1501 (e.g. foo_bar.inducts for types foo and bar); the old format with
1502 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1503 rare situations a different rule is selected --- notably nested tuple
1504 elimination instead of former prod.exhaust: use explicit (case_tac t
1505 rule: prod.exhaust) here.
1507 * Attributes "cases", "induct", "coinduct" support "del" option.
1509 * Removed fact "case_split_thm", which duplicates "case_split".
1511 * The option datatype has been moved to a new theory Option. Renamed
1512 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1514 * New predicate "strict_mono" classifies strict functions on partial
1515 orders. With strict functions on linear orders, reasoning about
1516 (in)equalities is facilitated by theorems "strict_mono_eq",
1517 "strict_mono_less_eq" and "strict_mono_less".
1519 * Some set operations are now proper qualified constants with
1520 authentic syntax. INCOMPATIBILITY:
1531 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1534 * Auxiliary class "itself" has disappeared -- classes without any
1535 parameter are treated as expected by the 'class' command.
1537 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1539 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1540 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1542 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1543 method "approximation". It proves formulas on real values by using
1544 interval arithmetic. In the formulas are also the transcendental
1545 functions sin, cos, tan, atan, ln, exp and the constant pi are
1546 allowed. For examples see
1547 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1549 * Theory "Reflection" now resides in HOL/Library.
1551 * Entry point to Word library now simply named "Word".
1554 * Made source layout more coherent with logical distribution
1557 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1558 src/HOL/Library/Code_Message.thy ~> src/HOL/
1559 src/HOL/Library/GCD.thy ~> src/HOL/
1560 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1561 src/HOL/Library/Parity.thy ~> src/HOL/
1562 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1563 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1564 src/HOL/Real/Lubs.thy ~> src/HOL/
1565 src/HOL/Real/PReal.thy ~> src/HOL/
1566 src/HOL/Real/Rational.thy ~> src/HOL/
1567 src/HOL/Real/RComplete.thy ~> src/HOL/
1568 src/HOL/Real/RealDef.thy ~> src/HOL/
1569 src/HOL/Real/RealPow.thy ~> src/HOL/
1570 src/HOL/Real/Real.thy ~> src/HOL/
1571 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1572 src/HOL/Complex/Complex.thy ~> src/HOL/
1573 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1574 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1575 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1576 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1577 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1578 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1579 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1580 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1581 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1582 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1583 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1584 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1585 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1586 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1587 src/HOL/Real/Float ~> src/HOL/Library/
1588 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1589 src/HOL/Real/RealVector.thy ~> src/HOL/
1591 src/HOL/arith_data.ML ~> src/HOL/Tools
1592 src/HOL/hologic.ML ~> src/HOL/Tools
1593 src/HOL/simpdata.ML ~> src/HOL/Tools
1594 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1595 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1596 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1597 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1598 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1599 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1600 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1602 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1603 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1604 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1605 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1606 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1607 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1609 * If methods "eval" and "evaluation" encounter a structured proof
1610 state with !!/==>, only the conclusion is evaluated to True (if
1611 possible), avoiding strange error messages.
1613 * Method "sizechange" automates termination proofs using (a
1614 modification of) the size-change principle. Requires SAT solver. See
1615 src/HOL/ex/Termination.thy for examples.
1617 * Simplifier: simproc for let expressions now unfolds if bound
1618 variable occurs at most once in let expression body. INCOMPATIBILITY.
1620 * Method "arith": Linear arithmetic now ignores all inequalities when
1621 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1623 * New attribute "arith" for facts that should always be used
1624 automatically by arithmetic. It is intended to be used locally in
1627 assumes [arith]: "x > 0"
1629 Global usage is discouraged because of possible performance impact.
1631 * New classes "top" and "bot" with corresponding operations "top" and
1632 "bot" in theory Orderings; instantiation of class "complete_lattice"
1633 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1635 * Changed definition lemma "less_fun_def" in order to provide an
1636 instance for preorders on functions; use lemma "less_le" instead.
1639 * Theory Orderings: class "wellorder" moved here, with explicit
1640 induction rule "less_induct" as assumption. For instantiation of
1641 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1644 * Theory Orderings: added class "preorder" as superclass of "order".
1645 INCOMPATIBILITY: Instantiation proofs for order, linorder
1646 etc. slightly changed. Some theorems named order_class.* now named
1649 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1652 * Theory Finite_Set: added a new fold combinator of type
1654 ('a => 'b => 'b) => 'b => 'a set => 'b
1656 Occasionally this is more convenient than the old fold combinator
1657 which is now defined in terms of the new one and renamed to
1660 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1661 and "ring_simps" have been replaced by "algebra_simps" (which can be
1662 extended with further lemmas!). At the moment both still exist but
1663 the former will disappear at some point.
1665 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1666 class recpower. Type-specific simp rules for various recpower types
1667 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1669 rat_power_0 -> power_0
1670 rat_power_Suc -> power_Suc
1671 realpow_0 -> power_0
1672 realpow_Suc -> power_Suc
1673 complexpow_0 -> power_0
1674 complexpow_Suc -> power_Suc
1675 power_poly_0 -> power_0
1676 power_poly_Suc -> power_Suc
1678 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1679 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1680 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1681 of lemmas from Divides has been generalized from nat to class
1682 semiring_div. INCOMPATIBILITY. This involves the following theorem
1683 renames resulting from duplicate elimination:
1685 dvd_def_mod ~> dvd_eq_mod_eq_0
1686 zero_dvd_iff ~> dvd_0_left_iff
1687 dvd_0 ~> dvd_0_right
1688 DIVISION_BY_ZERO_DIV ~> div_by_0
1689 DIVISION_BY_ZERO_MOD ~> mod_by_0
1690 mult_div ~> div_mult_self2_is_id
1691 mult_mod ~> mod_mult_self2_is_0
1693 * Theory IntDiv: removed many lemmas that are instances of class-based
1694 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1695 rename old lemmas as follows:
1697 dvd_diff -> nat_dvd_diff
1698 dvd_zminus_iff -> dvd_minus_iff
1699 mod_add1_eq -> mod_add_eq
1700 mod_mult1_eq -> mod_mult_right_eq
1701 mod_mult1_eq' -> mod_mult_left_eq
1702 mod_mult_distrib_mod -> mod_mult_eq
1703 nat_mod_add_left_eq -> mod_add_left_eq
1704 nat_mod_add_right_eq -> mod_add_right_eq
1705 nat_mod_div_trivial -> mod_div_trivial
1706 nat_mod_mod_trivial -> mod_mod_trivial
1707 zdiv_zadd_self1 -> div_add_self1
1708 zdiv_zadd_self2 -> div_add_self2
1709 zdiv_zmult_self1 -> div_mult_self2_is_id
1710 zdiv_zmult_self2 -> div_mult_self1_is_id
1711 zdvd_triv_left -> dvd_triv_left
1712 zdvd_triv_right -> dvd_triv_right
1713 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1714 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1715 zmod_zadd_left_eq -> mod_add_left_eq
1716 zmod_zadd_right_eq -> mod_add_right_eq
1717 zmod_zadd_self1 -> mod_add_self1
1718 zmod_zadd_self2 -> mod_add_self2
1719 zmod_zadd1_eq -> mod_add_eq
1720 zmod_zdiff1_eq -> mod_diff_eq
1721 zmod_zdvd_zmod -> mod_mod_cancel
1722 zmod_zmod_cancel -> mod_mod_cancel
1723 zmod_zmult_self1 -> mod_mult_self2_is_0
1724 zmod_zmult_self2 -> mod_mult_self1_is_0
1727 zdvd_abs1 -> abs_dvd_iff
1728 zdvd_abs2 -> dvd_abs_iff
1729 zdvd_refl -> dvd_refl
1730 zdvd_trans -> dvd_trans
1731 zdvd_zadd -> dvd_add
1732 zdvd_zdiff -> dvd_diff
1733 zdvd_zminus_iff -> dvd_minus_iff
1734 zdvd_zminus2_iff -> minus_dvd_iff
1735 zdvd_zmultD -> dvd_mult_right
1736 zdvd_zmultD2 -> dvd_mult_left
1737 zdvd_zmult_mono -> mult_dvd_mono
1738 zdvd_0_right -> dvd_0_right
1739 zdvd_0_left -> dvd_0_left_iff
1740 zdvd_1_left -> one_dvd
1741 zminus_dvd_iff -> minus_dvd_iff
1743 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1745 * The real numbers offer decimal input syntax: 12.34 is translated
1746 into 1234/10^2. This translation is not reversed upon output.
1748 * Theory Library/Polynomial defines an abstract type 'a poly of
1749 univariate polynomials with coefficients of type 'a. In addition to
1750 the standard ring operations, it also supports div and mod. Code
1751 generation is also supported, using list-style constructors.
1753 * Theory Library/Inner_Product defines a class of real_inner for real
1754 inner product spaces, with an overloaded operation inner :: 'a => 'a
1755 => real. Class real_inner is a subclass of real_normed_vector from
1758 * Theory Library/Product_Vector provides instances for the product
1759 type 'a * 'b of several classes from RealVector and Inner_Product.
1760 Definitions of addition, subtraction, scalar multiplication, norms,
1761 and inner products are included.
1763 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1764 addition to the field operations, numerals and case syntax are also
1767 * Theory Library/Diagonalize provides constructive version of Cantor's
1768 first diagonalization argument.
1770 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1771 zlcm (for int); carried together from various gcd/lcm developements in
1772 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1773 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1774 may recover tupled syntax as follows:
1776 hide (open) const gcd
1777 abbreviation gcd where
1778 "gcd == (%(a, b). GCD.gcd a b)"
1780 GCD.gcd ("gcd '(_, _')")
1782 The same works for lcm, zgcd, zlcm.
1784 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1785 instantiations for algebraic structures. Removed some duplicate
1786 theorems. Changes in simp rules. INCOMPATIBILITY.
1788 * ML antiquotation @{code} takes a constant as argument and generates
1789 corresponding code in background and inserts name of the corresponding
1790 resulting ML value/function/datatype constructor binding in place.
1791 All occurrences of @{code} with a single ML block are generated
1792 simultaneously. Provides a generic and safe interface for
1793 instrumentalizing code generation. See
1794 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1795 In future you ought to refrain from ad-hoc compiling generated SML
1796 code on the ML toplevel. Note that (for technical reasons) @{code}
1797 cannot refer to constants for which user-defined serializations are
1798 set. Refer to the corresponding ML counterpart directly in that
1801 * Command 'rep_datatype': instead of theorem names the command now
1802 takes a list of terms denoting the constructors of the type to be
1803 represented as datatype. The characteristic theorems have to be
1804 proven. INCOMPATIBILITY. Also observe that the following theorems
1805 have disappeared in favour of existing ones:
1807 unit_induct ~> unit.induct
1808 prod_induct ~> prod.induct
1809 sum_induct ~> sum.induct
1810 Suc_Suc_eq ~> nat.inject
1811 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1816 * New locales for orders and lattices where the equivalence relation
1817 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1818 locales use a record structure with field eq for the equivalence.
1820 * New theory of factorial domains.
1822 * Units_l_inv and Units_r_inv are now simp rules by default.
1823 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1824 and/or r_inv will now also require deletion of these lemmas.
1826 * Renamed the following theorems, INCOMPATIBILITY:
1828 UpperD ~> Upper_memD
1829 LowerD ~> Lower_memD
1830 least_carrier ~> least_closed
1831 greatest_carrier ~> greatest_closed
1832 greatest_Lower_above ~> greatest_Lower_below
1833 one_zero ~> carrier_one_zero
1834 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1839 * Nominal datatypes can now contain type-variables.
1841 * Commands 'nominal_inductive' and 'equivariance' work with local
1844 * Nominal primrec can now works with local theory targets and its
1845 specification syntax now conforms to the general format as seen in
1848 * Method "perm_simp" honours the standard simplifier attributes
1849 (no_asm), (no_asm_use) etc.
1851 * The new predicate #* is defined like freshness, except that on the
1852 left hand side can be a set or list of atoms.
1854 * Experimental command 'nominal_inductive2' derives strong induction
1855 principles for inductive definitions. In contrast to
1856 'nominal_inductive', which can only deal with a fixed number of
1857 binders, it can deal with arbitrary expressions standing for sets of
1858 atoms to be avoided. The only inductive definition we have at the
1859 moment that needs this generalisation is the typing rule for Lets in
1862 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1863 -----------------------------------------------------------------
1864 Gamma |- Let x be t1 in t2 : T2
1866 In this rule one wants to avoid all the binders that are introduced by
1867 "close Gamma T1". We are looking for other examples where this
1868 feature might be useful. Please let us know.
1873 * Reimplemented the simplification procedure for proving continuity
1874 subgoals. The new simproc is extensible; users can declare additional
1875 continuity introduction rules with the attribute [cont2cont].
1877 * The continuity simproc now uses a different introduction rule for
1878 solving continuity subgoals on terms with lambda abstractions. In
1879 some rare cases the new simproc may fail to solve subgoals that the
1880 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1881 Potential INCOMPATIBILITY.
1883 * Command 'fixrec': specification syntax now conforms to the general
1884 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1885 examples. INCOMPATIBILITY.
1890 * Proof of Zorn's Lemma for partial orders.
1895 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1896 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1897 depends on multithreading, so timouts will not work before Poly/ML
1900 * High-level support for concurrent ML programming, see
1901 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1902 particularly convenient to organize independent functional
1903 computations. The concept of "synchronized variables" provides a
1904 higher-order interface for components with shared state, avoiding the
1905 delicate details of mutexes and condition variables. (Requires
1906 Poly/ML 5.2.1 or later.)
1908 * ML bindings produced via Isar commands are stored within the Isar
1909 context (theory or proof). Consequently, commands like 'use' and 'ML'
1910 become thread-safe and work with undo as expected (concerning
1911 top-level bindings, not side-effects on global references).
1912 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1913 compiler at runtime; really global bindings need to be given outside a
1914 theory. (Requires Poly/ML 5.2 or later.)
1916 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1917 context. Top-level ML bindings are stored within the proof context in
1918 a purely sequential fashion, disregarding the nested proof structure.
1919 ML bindings introduced by 'ML_prf' are discarded at the end of the
1920 proof. (Requires Poly/ML 5.2 or later.)
1922 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1923 and Method.setup, as well as Isar commands 'attribute_setup' and
1924 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1925 existing code accordingly, or use plain 'setup' together with old
1928 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1929 to 'a -> thm, while results are always tagged with an authentic oracle
1930 name. The Isar command 'oracle' is now polymorphic, no argument type
1931 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1932 accordingly. Note that extra performance may be gained by producing
1933 the cterm carefully, avoiding slow Thm.cterm_of.
1935 * Simplified interface for defining document antiquotations via
1936 ThyOutput.antiquotation, ThyOutput.output, and optionally
1937 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1938 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1941 * More systematic treatment of long names, abstract name bindings, and
1942 name space operations. Basic operations on qualified names have been
1943 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1944 Long_Name.append. Old type bstring has been mostly replaced by
1945 abstract type binding (see structure Binding), which supports precise
1946 qualification by packages and local theory targets, as well as proper
1947 tracking of source positions. INCOMPATIBILITY, need to wrap old
1948 bstring values into Binding.name, or better pass through abstract
1949 bindings everywhere. See further src/Pure/General/long_name.ML,
1950 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1952 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1953 LocalTheory.note etc.) now refer to the *full* internal name, not the
1954 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1956 * Disposed old type and term read functions (Sign.read_def_typ,
1957 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1958 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1959 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1960 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1961 resort for legacy applications.
1963 * Disposed old declarations, tactics, tactic combinators that refer to
1964 the simpset or claset of an implicit theory (such as Addsimps,
1965 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1966 embedded ML text, or local_simpset_of with a proper context passed as
1967 explicit runtime argument.
1969 * Rules and tactics that read instantiations (read_instantiate,
1970 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1971 context, which is required for parsing and type-checking. Moreover,
1972 the variables are specified as plain indexnames, not string encodings
1973 thereof. INCOMPATIBILITY.
1975 * Generic Toplevel.add_hook interface allows to analyze the result of
1976 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1977 for theorem dependency output of transactions resulting in a new
1980 * ML antiquotations: block-structured compilation context indicated by
1981 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1983 @{binding name} - basic name binding
1984 @{let ?pat = term} - term abbreviation (HO matching)
1985 @{note name = fact} - fact abbreviation
1986 @{thm fact} - singleton fact (with attributes)
1987 @{thms fact} - general fact (with attributes)
1988 @{lemma prop by method} - singleton goal
1989 @{lemma prop by meth1 meth2} - singleton goal
1990 @{lemma prop1 ... propN by method} - general goal
1991 @{lemma prop1 ... propN by meth1 meth2} - general goal
1992 @{lemma (open) ...} - open derivation
1997 * The Isabelle "emacs" tool provides a specific interface to invoke
1998 Proof General / Emacs, with more explicit failure if that is not
1999 installed (the old isabelle-interface script silently falls back on
2000 isabelle-process). The PROOFGENERAL_HOME setting determines the
2001 installation location of the Proof General distribution.
2003 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
2004 the Isabelle process into a JVM/Scala application. See
2005 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
2006 process wrapper has been discontinued.)
2008 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
2010 * Various status messages (with exact source position information) are
2011 emitted, if proper markup print mode is enabled. This allows
2012 user-interface components to provide detailed feedback on internal
2017 New in Isabelle2008 (June 2008)
2018 -------------------------------
2022 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
2023 and updated, with formally checked references as hyperlinks.
2025 * Theory loader: use_thy (and similar operations) no longer set the
2026 implicit ML context, which was occasionally hard to predict and in
2027 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
2028 provides a proper context already.
2030 * Theory loader: old-style ML proof scripts being *attached* to a thy
2031 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
2032 'use' within a theory file will do the job.
2034 * Name space merge now observes canonical order, i.e. the second space
2035 is inserted into the first one, while existing entries in the first
2036 space take precedence. INCOMPATIBILITY in rare situations, may try to
2037 swap theory imports.
2039 * Syntax: symbol \<chi> is now considered a letter. Potential
2040 INCOMPATIBILITY in identifier syntax etc.
2042 * Outer syntax: string tokens no longer admit escaped white space,
2043 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
2044 white space without escapes.
2046 * Outer syntax: string tokens may contain arbitrary character codes
2047 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
2053 * Context-dependent token translations. Default setup reverts locally
2054 fixed variables, and adds hilite markup for undeclared frees.
2056 * Unused theorems can be found using the new command 'unused_thms'.
2057 There are three ways of invoking it:
2060 Only finds unused theorems in the current theory.
2062 (2) unused_thms thy_1 ... thy_n -
2063 Finds unused theorems in the current theory and all of its ancestors,
2064 excluding the theories thy_1 ... thy_n and all of their ancestors.
2066 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
2067 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
2068 their ancestors, excluding the theories thy_1 ... thy_n and all of
2071 In order to increase the readability of the list produced by
2072 unused_thms, theorems that have been created by a particular instance
2073 of a theory command such as 'inductive' or 'function' are considered
2074 to belong to the same "group", meaning that if at least one theorem in
2075 this group is used, the other theorems in the same group are no longer
2076 reported as unused. Moreover, if all theorems in the group are
2077 unused, only one theorem in the group is displayed.
2079 Note that proof objects have to be switched on in order for
2080 unused_thms to work properly (i.e. !proofs must be >= 1, which is
2081 usually the case when using Proof General with the default settings).
2083 * Authentic naming of facts disallows ad-hoc overwriting of previous
2084 theorems within the same name space. INCOMPATIBILITY, need to remove
2085 duplicate fact bindings, or even accidental fact duplications. Note
2086 that tools may maintain dynamically scoped facts systematically, using
2087 PureThy.add_thms_dynamic.
2089 * Command 'hide' now allows to hide from "fact" name space as well.
2091 * Eliminated destructive theorem database, simpset, claset, and
2092 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
2093 update of theories within ML code.
2095 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
2096 INCOMPATIBILITY, object-logics depending on former Pure require
2097 additional setup PureThy.old_appl_syntax_setup; object-logics
2098 depending on former CPure need to refer to Pure.
2100 * Commands 'use' and 'ML' are now purely functional, operating on
2101 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
2102 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
2105 * Command 'setup': discontinued implicit version with ML reference.
2107 * Instantiation target allows for simultaneous specification of class
2108 instance operations together with an instantiation proof.
2109 Type-checking phase allows to refer to class operations uniformly.
2110 See src/HOL/Complex/Complex.thy for an Isar example and
2111 src/HOL/Library/Eval.thy for an ML example.
2113 * Indexing of literal facts: be more serious about including only
2114 facts from the visible specification/proof context, but not the
2115 background context (locale etc.). Affects `prop` notation and method
2116 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
2119 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
2120 "(open)" option, which used to expose internal bound variables to the
2123 * Isar statements: removed obsolete case "rule_context".
2124 INCOMPATIBILITY, better use explicit fixes/assumes.
2126 * Locale proofs: default proof step now includes 'unfold_locales';
2127 hence 'proof' without argument may be used to unfold locale
2131 *** Document preparation ***
2133 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
2134 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
2135 obsolete thumbpdf setup (contemporary PDF viewers do this on the
2136 spot); renamed link color from "darkblue" to "linkcolor" (default
2137 value unchanged, can be redefined via \definecolor); no longer sets
2138 "a4paper" option (unnecessary or even intrusive).
2140 * Antiquotation @{lemma A method} proves proposition A by the given
2141 method (either a method name or a method name plus (optional) method
2142 arguments in parentheses) and prints A just like @{prop A}.
2147 * New primrec package. Specification syntax conforms in style to
2148 definition/function/.... No separate induction rule is provided. The
2149 "primrec" command distinguishes old-style and new-style specifications
2150 by syntax. The former primrec package is now named OldPrimrecPackage.
2151 When adjusting theories, beware: constants stemming from new-style
2152 primrec specifications have authentic syntax.
2154 * Metis prover is now an order of magnitude faster, and also works
2155 with multithreading.
2157 * Metis: the maximum number of clauses that can be produced from a
2158 theorem is now given by the attribute max_clauses. Theorems that
2159 exceed this number are ignored, with a warning printed.
2161 * Sledgehammer no longer produces structured proofs by default. To
2162 enable, declare [[sledgehammer_full = true]]. Attributes
2163 reconstruction_modulus, reconstruction_sorts renamed
2164 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
2166 * Method "induct_scheme" derives user-specified induction rules
2167 from well-founded induction and completeness of patterns. This factors
2168 out some operations that are done internally by the function package
2169 and makes them available separately. See
2170 src/HOL/ex/Induction_Scheme.thy for examples.
2172 * More flexible generation of measure functions for termination
2173 proofs: Measure functions can be declared by proving a rule of the
2174 form "is_measure f" and giving it the [measure_function] attribute.
2175 The "is_measure" predicate is logically meaningless (always true), and
2176 just guides the heuristic. To find suitable measure functions, the
2177 termination prover sets up the goal "is_measure ?f" of the appropriate
2178 type and generates all solutions by prolog-style backwards proof using
2181 This setup also deals with rules like
2183 "is_measure f ==> is_measure (list_size f)"
2185 which accommodates nested datatypes that recurse through lists.
2186 Similar rules are predeclared for products and option types.
2188 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
2192 - Definitions of overloaded constants on sets have to be replaced by
2193 definitions on => and bool.
2195 - Some definitions of overloaded operators on sets can now be proved
2196 using the definitions of the operators on => and bool. Therefore,
2197 the following theorems have been renamed:
2199 subset_def -> subset_eq
2200 psubset_def -> psubset_eq
2201 set_diff_def -> set_diff_eq
2202 Compl_def -> Compl_eq
2203 Sup_set_def -> Sup_set_eq
2204 Inf_set_def -> Inf_set_eq
2205 sup_set_def -> sup_set_eq
2206 inf_set_def -> inf_set_eq
2208 - Due to the incompleteness of the HO unification algorithm, some
2209 rules such as subst may require manual instantiation, if some of
2210 the unknowns in the rule is a set.
2212 - Higher order unification and forward proofs:
2215 have "P (S::'a set)" <...>
2216 then have "EX S. P S" ..
2218 no longer works (due to the incompleteness of the HO unification
2219 algorithm) and must be replaced by the pattern
2226 - Calculational reasoning with subst (or similar rules):
2229 have "P (S::'a set)" <...>
2230 also have "S = T" <...>
2231 finally have "P T" .
2233 no longer works (for similar reasons as the previous example) and
2234 must be replaced by something like
2236 have "P (S::'a set)" <...>
2237 moreover have "S = T" <...>
2238 ultimately have "P T" by simp
2240 - Tactics or packages written in ML code:
2241 Code performing pattern matching on types via
2243 Type ("set", [T]) => ...
2245 must be rewritten. Moreover, functions like strip_type or
2246 binder_types no longer return the right value when applied to a
2249 T1 => ... => Tn => U => bool
2253 T1 => ... => Tn => U set
2255 * Merged theories Wellfounded_Recursion, Accessible_Part and
2256 Wellfounded_Relations to theory Wellfounded.
2258 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
2260 * Class finite no longer treats UNIV as class parameter. Use class
2261 enum from theory Library/Enum instead to achieve a similar effect.
2264 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
2265 and "Cons". INCOMPATIBILITY.
2267 * HOL (and FOL): renamed variables in rules imp_elim and swap.
2268 Potential INCOMPATIBILITY.
2270 * Theory Product_Type: duplicated lemmas split_Pair_apply and
2271 injective_fst_snd removed, use split_eta and prod_eqI instead.
2272 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
2274 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
2275 the same name in theory Orderings:
2285 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2286 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2287 and different variable names.
2289 * Library/Option_ord.thy: Canonical order on option type.
2291 * Library/RBT.thy: Red-black trees, an efficient implementation of
2294 * Library/Countable.thy: Type class for countable types.
2296 * Theory Int: The representation of numerals has changed. The infix
2297 operator BIT and the bit datatype with constructors B0 and B1 have
2298 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2299 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2300 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
2303 * Theory Nat: definition of <= and < on natural numbers no longer
2304 depend on well-founded relations. INCOMPATIBILITY. Definitions
2305 le_def and less_def have disappeared. Consider lemmas not_less
2306 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
2308 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
2309 (whose purpose mainly is for various fold_set functionals) have been
2310 abandoned in favor of the existing algebraic classes
2311 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
2312 lower_semilattice (resp. upper_semilattice) and linorder.
2315 * Theory Transitive_Closure: induct and cases rules now declare proper
2316 case_names ("base" and "step"). INCOMPATIBILITY.
2318 * Theorem Inductive.lfp_ordinal_induct generalized to complete
2319 lattices. The form set-specific version is available as
2320 Inductive.lfp_ordinal_induct_set.
2322 * Renamed theorems "power.simps" to "power_int.simps".
2325 * Class semiring_div provides basic abstract properties of semirings
2326 with division and modulo operations. Subsumes former class dvd_mod.
2328 * Merged theories IntDef, Numeral and IntArith into unified theory
2329 Int. INCOMPATIBILITY.
2331 * Theory Library/Code_Index: type "index" now represents natural
2332 numbers rather than integers. INCOMPATIBILITY.
2334 * New class "uminus" with operation "uminus" (split of from class
2335 "minus" which now only has operation "minus", binary).
2338 * Constants "card", "internal_split", "option_map" now with authentic
2339 syntax. INCOMPATIBILITY.
2341 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
2342 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
2343 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
2344 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
2345 Sup_set_def, le_def, less_def, option_map_def now with object
2346 equality. INCOMPATIBILITY.
2348 * Records. Removed K_record, and replaced it by pure lambda term
2349 %x. c. The simplifier setup is now more robust against eta expansion.
2350 INCOMPATIBILITY: in cases explicitly referring to K_record.
2352 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
2354 * Library/ListVector: new theory of arithmetic vector operations.
2356 * Library/Order_Relation: new theory of various orderings as sets of
2357 pairs. Defines preorders, partial orders, linear orders and
2358 well-orders on sets and on types.
2363 * Renamed some theories to allow to loading both ZF and HOL in the
2366 Datatype -> Datatype_ZF
2367 Inductive -> Inductive_ZF
2374 INCOMPATIBILITY: ZF theories that import individual theories below
2375 Main might need to be adapted. Regular theory Main is still
2376 available, as trivial extension of Main_ZF.
2381 * ML within Isar: antiquotation @{const name} or @{const
2382 name(typargs)} produces statically-checked Const term.
2384 * Functor NamedThmsFun: data is available to the user as dynamic fact
2385 (of the same name). Removed obsolete print command.
2387 * Removed obsolete "use_legacy_bindings" function.
2389 * The ``print mode'' is now a thread-local value derived from a global
2390 template (the former print_mode reference), thus access becomes
2391 non-critical. The global print_mode reference is for session
2392 management only; user-code should use print_mode_value,
2393 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
2395 * Functions system/system_out provide a robust way to invoke external
2396 shell commands, with propagation of interrupts (requires Poly/ML
2397 5.2.1). Do not use OS.Process.system etc. from the basis library!
2402 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2403 in accordance with Proof General 3.7, which prefers GNU emacs.
2405 * isatool tty runs Isabelle process with plain tty interaction;
2406 optional line editor may be specified via ISABELLE_LINE_EDITOR
2407 setting, the default settings attempt to locate "ledit" and "rlwrap".
2409 * isatool browser now works with Cygwin as well, using general
2410 "javapath" function defined in Isabelle process environment.
2412 * YXML notation provides a simple and efficient alternative to
2413 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2414 isatool yxml as described in the Isabelle system manual.
2416 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2417 provides general wrapper for managing an Isabelle process in a robust
2418 fashion, with ``cooked'' output from stdin/stderr.
2420 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2421 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2423 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2424 way of changing the user's settings is via
2425 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2428 * Multithreading.max_threads := 0 refers to the number of actual CPU
2429 cores of the underlying machine, which is a good starting point for
2430 optimal performance tuning. The corresponding usedir option -M allows
2431 "max" as an alias for "0". WARNING: does not work on certain versions
2432 of Mac OS (with Poly/ML 5.1).
2434 * isabelle-process: non-ML sessions are run with "nice", to reduce the
2435 adverse effect of Isabelle flooding interactive front-ends (notably
2436 ProofGeneral / XEmacs).
2440 New in Isabelle2007 (November 2007)
2441 -----------------------------------
2445 * More uniform information about legacy features, notably a
2446 warning/error of "Legacy feature: ...", depending on the state of the
2447 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
2448 legacy features will disappear eventually.
2450 * Theory syntax: the header format ``theory A = B + C:'' has been
2451 discontinued in favour of ``theory A imports B C begin''. Use isatool
2452 fixheaders to convert existing theory files. INCOMPATIBILITY.
2454 * Theory syntax: the old non-Isar theory file format has been
2455 discontinued altogether. Note that ML proof scripts may still be used
2456 with Isar theories; migration is usually quite simple with the ML
2457 function use_legacy_bindings. INCOMPATIBILITY.
2459 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2460 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2463 * Theory loader: be more serious about observing the static theory
2464 header specifications (including optional directories), but not the
2465 accidental file locations of previously successful loads. The strict
2466 update policy of former update_thy is now already performed by
2467 use_thy, so the former has been removed; use_thys updates several
2468 theories simultaneously, just as 'imports' within a theory header
2469 specification, but without merging the results. Potential
2470 INCOMPATIBILITY: may need to refine theory headers and commands
2471 ROOT.ML which depend on load order.
2473 * Theory loader: optional support for content-based file
2474 identification, instead of the traditional scheme of full physical
2475 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2476 (cf. the system manual). The new scheme allows to work with
2477 non-finished theories in persistent session images, such that source
2478 files may be moved later on without requiring reloads.
2480 * Theory loader: old-style ML proof scripts being *attached* to a thy
2481 file (with the same base name as the theory) are considered a legacy
2482 feature, which will disappear eventually. Even now, the theory loader
2483 no longer maintains dependencies on such files.
2485 * Syntax: the scope for resolving ambiguities via type-inference is
2486 now limited to individual terms, instead of whole simultaneous
2487 specifications as before. This greatly reduces the complexity of the
2488 syntax module and improves flexibility by separating parsing and
2489 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2490 'fixes' etc.) are required in rare situations.
2492 * Syntax: constants introduced by new-style packages ('definition',
2493 'abbreviation' etc.) are passed through the syntax module in
2494 ``authentic mode''. This means that associated mixfix annotations
2495 really stick to such constants, independently of potential name space
2496 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2497 trees are represented slightly differently, may need to adapt syntax
2498 translations accordingly. Use CONST marker in 'translations' and
2499 @{const_syntax} antiquotation in 'parse_translation' etc.
2501 * Legacy goal package: reduced interface to the bare minimum required
2502 to keep existing proof scripts running. Most other user-level
2503 functions are now part of the OldGoals structure, which is *not* open
2504 by default (consider isatool expandshort before open OldGoals).
2505 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2506 these tend to cause confusion about the actual goal (!) context being
2507 used here, which is not necessarily the same as the_context().
2509 * Command 'find_theorems': supports "*" wild-card in "name:"
2510 criterion; "with_dups" option. Certain ProofGeneral versions might
2511 support a specific search form (see ProofGeneral/CHANGES).
2513 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2514 by default, which means that "prems" (and also "fixed variables") are
2515 suppressed from proof state output. Note that the ProofGeneral
2516 settings mechanism allows to change and save options persistently, but
2517 older versions of Isabelle will fail to start up if a negative prems
2520 * Local theory targets may be specified by non-nested blocks of
2521 ``context/locale/class ... begin'' followed by ``end''. The body may
2522 contain definitions, theorems etc., including any derived mechanism
2523 that has been implemented on top of these primitives. This concept
2524 generalizes the existing ``theorem (in ...)'' towards more versatility
2527 * Proof General interface: proper undo of final 'end' command;
2528 discontinued Isabelle/classic mode (ML proof scripts).
2531 *** Document preparation ***
2533 * Added antiquotation @{theory name} which prints the given name,
2534 after checking that it refers to a valid ancestor theory in the
2537 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2538 check the given source text as ML type/structure, printing verbatim.
2540 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2541 "c args == rhs" given in the current context. (Any number of
2542 arguments may be given on the LHS.)
2547 * The 'class' package offers a combination of axclass and locale to
2548 achieve Haskell-like type classes in Isabelle. Definitions and
2549 theorems within a class context produce both relative results (with
2550 implicit parameters according to the locale context), and polymorphic
2551 constants with qualified polymorphism (according to the class
2552 context). Within the body context of a 'class' target, a separate
2553 syntax layer ("user space type system") takes care of converting
2554 between global polymorphic consts and internal locale representation.
2555 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2556 "isatool doc classes" provides a tutorial.
2558 * Generic code generator framework allows to generate executable
2559 code for ML and Haskell (including Isabelle classes). A short usage
2562 internal compilation:
2563 export_code <list of constants (term syntax)> in SML
2564 writing SML code to a file:
2565 export_code <list of constants (term syntax)> in SML <filename>
2566 writing OCaml code to a file:
2567 export_code <list of constants (term syntax)> in OCaml <filename>
2568 writing Haskell code to a bunch of files:
2569 export_code <list of constants (term syntax)> in Haskell <filename>
2571 evaluating closed propositions to True/False using code generation:
2574 Reasonable default setup of framework in HOL.
2576 Theorem attributs for selecting and transforming function equations theorems:
2578 [code fun]: select a theorem as function equation for a specific constant
2579 [code fun del]: deselect a theorem as function equation for a specific constant
2580 [code inline]: select an equation theorem for unfolding (inlining) in place
2581 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2583 User-defined serializations (target in {SML, OCaml, Haskell}):
2585 code_const <and-list of constants (term syntax)>
2586 {(target) <and-list of const target syntax>}+
2588 code_type <and-list of type constructors>
2589 {(target) <and-list of type target syntax>}+
2591 code_instance <and-list of instances>
2593 where instance ::= <type constructor> :: <class>
2595 code_class <and_list of classes>
2596 {(target) <and-list of class target syntax>}+
2597 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2599 code_instance and code_class only are effective to target Haskell.
2601 For example usage see src/HOL/ex/Codegenerator.thy and
2602 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2603 generation from Isabelle/HOL theories is available via "isatool doc
2606 * Code generator: consts in 'consts_code' Isar commands are now
2607 referred to by usual term syntax (including optional type
2610 * Command 'no_translations' removes translation rules from theory
2613 * Overloaded definitions are now actually checked for acyclic
2614 dependencies. The overloading scheme is slightly more general than
2615 that of Haskell98, although Isabelle does not demand an exact
2616 correspondence to type class and instance declarations.
2617 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2618 exotic versions of overloading -- at the discretion of the user!
2620 Polymorphic constants are represented via type arguments, i.e. the
2621 instantiation that matches an instance against the most general
2622 declaration given in the signature. For example, with the declaration
2623 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2624 as c(nat). Overloading is essentially simultaneous structural
2625 recursion over such type arguments. Incomplete specification patterns
2626 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2627 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2628 Command 'print_theory' outputs the normalized system of recursive
2629 equations, see section "definitions".
2631 * Configuration options are maintained within the theory or proof
2632 context (with name and type bool/int/string), providing a very simple
2633 interface to a poor-man's version of general context data. Tools may
2634 declare options in ML (e.g. using Attrib.config_int) and then refer to
2635 these values using Config.get etc. Users may change options via an
2636 associated attribute of the same name. This form of context
2637 declaration works particularly well with commands 'declare' or
2638 'using', for example ``declare [[foo = 42]]''. Thus it has become
2639 very easy to avoid global references, which would not observe Isar
2640 toplevel undo/redo and fail to work with multithreading.
2642 Various global ML references of Pure and HOL have been turned into
2643 configuration options:
2645 Unify.search_bound unify_search_bound
2646 Unify.trace_bound unify_trace_bound
2647 Unify.trace_simp unify_trace_simp
2648 Unify.trace_types unify_trace_types
2649 Simplifier.simp_depth_limit simp_depth_limit
2650 Blast.depth_limit blast_depth_limit
2651 DatatypeProp.dtK datatype_distinctness_limit
2652 fast_arith_neq_limit fast_arith_neq_limit
2653 fast_arith_split_limit fast_arith_split_limit
2655 * Named collections of theorems may be easily installed as context
2656 data using the functor NamedThmsFun (see also
2657 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2658 attributes; there is also a toplevel print command. This facility is
2659 just a common case of general context data, which is the preferred way
2660 for anything more complex than just a list of facts in canonical
2663 * Isar: command 'declaration' augments a local theory by generic
2664 declaration functions written in ML. This enables arbitrary content
2665 being added to the context, depending on a morphism that tells the
2666 difference of the original declaration context wrt. the application
2667 context encountered later on.
2669 * Isar: proper interfaces for simplification procedures. Command
2670 'simproc_setup' declares named simprocs (with match patterns, and body
2671 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2672 context. ML antiquotation @{simproc name} retrieves named simprocs.
2674 * Isar: an extra pair of brackets around attribute declarations
2675 abbreviates a theorem reference involving an internal dummy fact,
2676 which will be ignored later --- only the effect of the attribute on
2677 the background context will persist. This form of in-place
2678 declarations is particularly useful with commands like 'declare' and
2679 'using', for example ``have A using [[simproc a]] by simp''.
2681 * Isar: method "assumption" (and implicit closing of subproofs) now
2682 takes simple non-atomic goal assumptions into account: after applying
2683 an assumption as a rule the resulting subgoals are solved by atomic
2684 assumption steps. This is particularly useful to finish 'obtain'
2685 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2686 without referring to the original premise "!!x. P x ==> thesis" in the
2687 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2690 * Isar: implicit use of prems from the Isar proof context is
2691 considered a legacy feature. Common applications like ``have A .''
2692 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2693 referencing facts explicitly here improves readability and
2694 maintainability of proof texts.
2696 * Isar: improper proof element 'guess' is like 'obtain', but derives
2697 the obtained context from the course of reasoning! For example:
2699 assume "EX x y. A x & B y" -- "any previous fact"
2700 then guess x and y by clarify
2702 This technique is potentially adventurous, depending on the facts and
2703 proof tools being involved here.
2705 * Isar: known facts from the proof context may be specified as literal
2706 propositions, using ASCII back-quote syntax. This works wherever
2707 named facts used to be allowed so far, in proof commands, proof
2708 methods, attributes etc. Literal facts are retrieved from the context
2709 according to unification of type and term parameters. For example,
2710 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2711 theorems in the current context, then these are valid literal facts:
2712 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2714 There is also a proof method "fact" which does the same composition
2715 for explicit goal states, e.g. the following proof texts coincide with
2716 certain special cases of literal facts:
2718 have "A" by fact == note `A`
2719 have "A ==> B" by fact == note `A ==> B`
2720 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2721 have "P a ==> Q a" by fact == note `P a ==> Q a`
2723 * Isar: ":" (colon) is no longer a symbolic identifier character in
2724 outer syntax. Thus symbolic identifiers may be used without
2725 additional white space in declarations like this: ``assume *: A''.
2727 * Isar: 'print_facts' prints all local facts of the current context,
2728 both named and unnamed ones.
2730 * Isar: 'def' now admits simultaneous definitions, e.g.:
2732 def x == "t" and y == "u"
2734 * Isar: added command 'unfolding', which is structurally similar to
2735 'using', but affects both the goal state and facts by unfolding given
2736 rewrite rules. Thus many occurrences of the 'unfold' method or
2737 'unfolded' attribute may be replaced by first-class proof text.
2739 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2740 and command 'unfolding' now all support object-level equalities
2741 (potentially conditional). The underlying notion of rewrite rule is
2742 analogous to the 'rule_format' attribute, but *not* that of the
2743 Simplifier (which is usually more generous).
2745 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2746 premises of a theorem by n. Useful in conjunction with drule.
2748 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2749 method expression within a sandbox consisting of the first N
2750 sub-goals, which need to exist. For example, ``simp_all [3]''
2751 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2752 simplifies all new goals that emerge from applying rule foo to the
2753 originally first one.
2755 * Isar: schematic goals are no longer restricted to higher-order
2756 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2759 * Isar: the conclusion of a long theorem statement is now either
2760 'shows' (a simultaneous conjunction, as before), or 'obtains'
2761 (essentially a disjunction of cases with local parameters and
2762 assumptions). The latter allows to express general elimination rules
2763 adequately; in this notation common elimination rules look like this:
2765 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2767 obtains x where "P x"
2769 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2773 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2779 The subsequent classical rules even refer to the formal "thesis"
2782 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2785 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2786 obtains "thesis ==> something"
2788 The actual proof of an 'obtains' statement is analogous to that of the
2789 Isar proof element 'obtain', only that there may be several cases.
2790 Optional case names may be specified in parentheses; these will be
2791 available both in the present proof and as annotations in the
2792 resulting rule, for later use with the 'cases' method (cf. attribute
2795 * Isar: the assumptions of a long theorem statement are available as
2796 "assms" fact in the proof context. This is more appropriate than the
2797 (historical) "prems", which refers to all assumptions of the current
2798 context, including those from the target locale, proof body etc.
2800 * Isar: 'print_statement' prints theorems from the current theory or
2801 proof context in long statement form, according to the syntax of a
2804 * Isar: 'obtain' takes an optional case name for the local context
2805 introduction rule (default "that").
2807 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2808 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2811 * Pure: syntax "CONST name" produces a fully internalized constant
2812 according to the current context. This is particularly useful for
2813 syntax translations that should refer to internal constant
2814 representations independently of name spaces.
2816 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2817 instead of "FOO ". This allows multiple binder declarations to coexist
2818 in the same context. INCOMPATIBILITY.
2820 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2821 primitive that also works in a locale context (both for constants and
2822 fixed variables). Type declaration and internal syntactic representation
2823 of given constants retrieved from the context. Likewise, the
2824 'no_notation' command allows to remove given syntax annotations from the
2827 * Isar/locales: new derived specification elements 'axiomatization',
2828 'definition', 'abbreviation', which support type-inference, admit
2829 object-level specifications (equality, equivalence). See also the
2830 isar-ref manual. Examples:
2833 eq (infix "===" 50) where
2834 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2836 definition "f x y = x + y + 1"
2837 definition g where "g x = f x x"
2840 neq (infix "=!=" 50) where
2841 "x =!= y == ~ (x === y)"
2843 These specifications may be also used in a locale context. Then the
2844 constants being introduced depend on certain fixed parameters, and the
2845 constant name is qualified by the locale base name. An internal
2846 abbreviation takes care for convenient input and output, making the
2847 parameters implicit and using the original short name. See also
2848 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2849 entities from a monomorphic theory.
2851 Presently, abbreviations are only available 'in' a target locale, but
2852 not inherited by general import expressions. Also note that
2853 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2854 'translations' in common applications. The "no_abbrevs" print mode
2855 prevents folding of abbreviations in term output.
2857 Concrete syntax is attached to specified constants in internal form,
2858 independently of name spaces. The parse tree representation is
2859 slightly different -- use 'notation' instead of raw 'syntax', and
2860 'translations' with explicit "CONST" markup to accommodate this.
2862 * Pure/Isar: unified syntax for new-style specification mechanisms
2863 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2864 full type inference and dummy patterns ("_"). For example:
2866 definition "K x _ = x"
2868 inductive conj for A B
2869 where "A ==> B ==> conj A B"
2871 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2872 the current context. Print mode "no_abbrevs" prevents inversion of
2873 abbreviations on output.
2875 * Isar/locales: improved parameter handling: use of locales "var" and
2876 "struct" no longer necessary; - parameter renamings are no longer
2877 required to be injective. For example, this allows to define
2878 endomorphisms as locale endom = homom mult mult h.
2880 * Isar/locales: changed the way locales with predicates are defined.
2881 Instead of accumulating the specification, the imported expression is
2882 now an interpretation. INCOMPATIBILITY: different normal form of
2883 locale expressions. In particular, in interpretations of locales with
2884 predicates, goals repesenting already interpreted fragments are not
2885 removed automatically. Use methods `intro_locales' and
2886 `unfold_locales'; see below.
2888 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2889 provide backward reasoning on locales predicates. The methods are
2890 aware of interpretations and discharge corresponding goals.
2891 `intro_locales' is less aggressive then `unfold_locales' and does not
2892 unfold predicates to assumptions.
2894 * Isar/locales: the order in which locale fragments are accumulated
2895 has changed. This enables to override declarations from fragments due
2896 to interpretations -- for example, unwanted simp rules.
2898 * Isar/locales: interpretation in theories and proof contexts has been
2899 extended. One may now specify (and prove) equations, which are
2900 unfolded in interpreted theorems. This is useful for replacing
2901 defined concepts (constants depending on locale parameters) by
2902 concepts already existing in the target context. Example:
2904 interpretation partial_order ["op <= :: [int, int] => bool"]
2905 where "partial_order.less (op <=) (x::int) y = (x < y)"
2907 Typically, the constant `partial_order.less' is created by a
2908 definition specification element in the context of locale
2911 * Method "induct": improved internal context management to support
2912 local fixes and defines on-the-fly. Thus explicit meta-level
2913 connectives !! and ==> are rarely required anymore in inductive goals
2914 (using object-logic connectives for this purpose has been long
2915 obsolete anyway). Common proof patterns are explained in
2916 src/HOL/Induct/Common_Patterns.thy, see also
2917 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2920 * Method "induct": improved handling of simultaneous goals. Instead of
2921 introducing object-level conjunction, the statement is now split into
2922 several conclusions, while the corresponding symbolic cases are nested
2923 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2924 see src/HOL/Induct/Common_Patterns.thy, for example.
2926 * Method "induct": mutual induction rules are now specified as a list
2927 of rule sharing the same induction cases. HOL packages usually provide
2928 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2929 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2930 mutual induction rules differently, i.e. like this:
2932 (induct rule: foo_bar.inducts)
2933 (induct set: foo bar)
2934 (induct pred: foo bar)
2935 (induct type: foo bar)
2937 The ML function ProjectRule.projections turns old-style rules into the
2940 * Method "coinduct": dual of induction, see
2941 src/HOL/Library/Coinductive_List.thy for various examples.
2943 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2944 considered a legacy feature.
2946 * Attribute "symmetric" produces result with standardized schematic
2947 variables (index 0). Potential INCOMPATIBILITY.
2949 * Simplifier: by default the simplifier trace only shows top level
2950 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2951 default. Thus there is less danger of being flooded by the trace. The
2952 trace indicates where parts have been suppressed.
2954 * Provers/classical: removed obsolete classical version of elim_format
2955 attribute; classical elim/dest rules are now treated uniformly when
2956 manipulating the claset.
2958 * Provers/classical: stricter checks to ensure that supplied intro,
2959 dest and elim rules are well-formed; dest and elim rules must have at
2962 * Provers/classical: attributes dest/elim/intro take an optional
2963 weight argument for the rule (just as the Pure versions). Weights are
2964 ignored by automated tools, but determine the search order of single
2967 * Syntax: input syntax now supports dummy variable binding "%_. b",
2968 where the body does not mention the bound variable. Note that dummy
2969 patterns implicitly depend on their context of bounds, which makes
2970 "{_. _}" match any set comprehension as expected. Potential
2971 INCOMPATIBILITY -- parse translations need to cope with syntactic
2972 constant "_idtdummy" in the binding position.
2974 * Syntax: removed obsolete syntactic constant "_K" and its associated
2975 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2976 for example "A -> B" => "Pi A (%_. B)".
2978 * Pure: 'class_deps' command visualizes the subclass relation, using
2979 the graph browser tool.
2981 * Pure: 'print_theory' now suppresses certain internal declarations by
2982 default; use '!' option for full details.
2987 * Method "metis" proves goals by applying the Metis general-purpose
2988 resolution prover (see also http://gilith.com/software/metis/).
2989 Examples are in the directory MetisExamples. WARNING: the
2990 Isabelle/HOL-Metis integration does not yet work properly with
2993 * Command 'sledgehammer' invokes external automatic theorem provers as
2994 background processes. It generates calls to the "metis" method if
2995 successful. These can be pasted into the proof. Users do not have to
2996 wait for the automatic provers to return. WARNING: does not really
2997 work with multi-threading.
2999 * New "auto_quickcheck" feature tests outermost goal statements for
3000 potential counter-examples. Controlled by ML references
3001 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
3002 5000 milliseconds). Fails silently if statements is outside of
3003 executable fragment, or any other codgenerator problem occurs.
3005 * New constant "undefined" with axiom "undefined x = undefined".
3007 * Added class "HOL.eq", allowing for code generation with polymorphic
3010 * Some renaming of class constants due to canonical name prefixing in
3011 the new 'class' package:
3013 HOL.abs ~> HOL.abs_class.abs
3014 HOL.divide ~> HOL.divide_class.divide
3015 0 ~> HOL.zero_class.zero
3016 1 ~> HOL.one_class.one
3017 op + ~> HOL.plus_class.plus
3018 op - ~> HOL.minus_class.minus
3019 uminus ~> HOL.minus_class.uminus
3020 op * ~> HOL.times_class.times
3021 op < ~> HOL.ord_class.less
3022 op <= > HOL.ord_class.less_eq
3023 Nat.power ~> Power.power_class.power
3024 Nat.size ~> Nat.size_class.size
3025 Numeral.number_of ~> Numeral.number_class.number_of
3026 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
3027 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
3028 Orderings.min ~> Orderings.ord_class.min
3029 Orderings.max ~> Orderings.ord_class.max
3030 Divides.op div ~> Divides.div_class.div
3031 Divides.op mod ~> Divides.div_class.mod
3032 Divides.op dvd ~> Divides.div_class.dvd
3034 INCOMPATIBILITY. Adaptions may be required in the following cases:
3036 a) User-defined constants using any of the names "plus", "minus",
3037 "times", "less" or "less_eq". The standard syntax translations for
3038 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
3041 b) Variables named "plus", "minus", "times", "less", "less_eq"
3042 INCOMPATIBILITY: use more specific names.
3044 c) Permutative equations (e.g. "a + b = b + a")
3045 Since the change of names also changes the order of terms, permutative
3046 rewrite rules may get applied in a different order. Experience shows
3047 that this is rarely the case (only two adaptions in the whole Isabelle
3048 distribution). INCOMPATIBILITY: rewrite proofs
3050 d) ML code directly refering to constant names
3051 This in general only affects hand-written proof tactics, simprocs and
3052 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
3053 Consider using @{const_name} antiquotation.
3055 * New class "default" with associated constant "default".
3057 * Function "sgn" is now overloaded and available on int, real, complex
3058 (and other numeric types), using class "sgn". Two possible defs of
3059 sgn are given as equational assumptions in the classes sgn_if and
3060 sgn_div_norm; ordered_idom now also inherits from sgn_if.
3063 * Locale "partial_order" now unified with class "order" (cf. theory
3064 Orderings), added parameter "less". INCOMPATIBILITY.
3066 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
3067 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
3068 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
3070 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
3071 changed order of proof goals in instance proofs.
3073 * The transitivity reasoner for partial and linear orders is set up
3074 for classes "order" and "linorder". Instances of the reasoner are available
3075 in all contexts importing or interpreting the corresponding locales.
3076 Method "order" invokes the reasoner separately; the reasoner
3077 is also integrated with the Simplifier as a solver. Diagnostic
3078 command 'print_orders' shows the available instances of the reasoner
3079 in the current context.
3081 * Localized monotonicity predicate in theory "Orderings"; integrated
3082 lemmas max_of_mono and min_of_mono with this predicate.
3085 * Formulation of theorem "dense" changed slightly due to integration
3086 with new class dense_linear_order.
3088 * Uniform lattice theory development in HOL.
3090 constants "meet" and "join" now named "inf" and "sup"
3091 constant "Meet" now named "Inf"
3093 classes "meet_semilorder" and "join_semilorder" now named
3094 "lower_semilattice" and "upper_semilattice"
3095 class "lorder" now named "lattice"
3096 class "comp_lat" now named "complete_lattice"
3098 Instantiation of lattice classes allows explicit definitions
3099 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
3101 INCOMPATIBILITY. Theorem renames:
3103 meet_left_le ~> inf_le1
3104 meet_right_le ~> inf_le2
3105 join_left_le ~> sup_ge1
3106 join_right_le ~> sup_ge2
3107 meet_join_le ~> inf_sup_ord
3110 le_meet ~> le_inf_iff
3111 le_join ~> ge_sup_conv
3112 meet_idempotent ~> inf_idem
3113 join_idempotent ~> sup_idem
3114 meet_comm ~> inf_commute
3115 join_comm ~> sup_commute
3116 meet_leI1 ~> le_infI1
3117 meet_leI2 ~> le_infI2
3118 le_joinI1 ~> le_supI1
3119 le_joinI2 ~> le_supI2
3120 meet_assoc ~> inf_assoc
3121 join_assoc ~> sup_assoc
3122 meet_left_comm ~> inf_left_commute
3123 meet_left_idempotent ~> inf_left_idem
3124 join_left_comm ~> sup_left_commute
3125 join_left_idempotent ~> sup_left_idem
3128 le_def_meet ~> le_iff_inf
3129 le_def_join ~> le_iff_sup
3130 join_absorp2 ~> sup_absorb2
3131 join_absorp1 ~> sup_absorb1
3132 meet_absorp1 ~> inf_absorb1
3133 meet_absorp2 ~> inf_absorb2
3134 meet_join_absorp ~> inf_sup_absorb
3135 join_meet_absorp ~> sup_inf_absorb
3136 distrib_join_le ~> distrib_sup_le
3137 distrib_meet_le ~> distrib_inf_le
3139 add_meet_distrib_left ~> add_inf_distrib_left
3140 add_join_distrib_left ~> add_sup_distrib_left
3141 is_join_neg_meet ~> is_join_neg_inf
3142 is_meet_neg_join ~> is_meet_neg_sup
3143 add_meet_distrib_right ~> add_inf_distrib_right
3144 add_join_distrib_right ~> add_sup_distrib_right
3145 add_meet_join_distribs ~> add_sup_inf_distribs
3146 join_eq_neg_meet ~> sup_eq_neg_inf
3147 meet_eq_neg_join ~> inf_eq_neg_sup
3148 add_eq_meet_join ~> add_eq_inf_sup
3149 meet_0_imp_0 ~> inf_0_imp_0
3150 join_0_imp_0 ~> sup_0_imp_0
3151 meet_0_eq_0 ~> inf_0_eq_0
3152 join_0_eq_0 ~> sup_0_eq_0
3153 neg_meet_eq_join ~> neg_inf_eq_sup
3154 neg_join_eq_meet ~> neg_sup_eq_inf
3155 join_eq_if ~> sup_eq_if
3157 mono_meet ~> mono_inf
3158 mono_join ~> mono_sup
3159 meet_bool_eq ~> inf_bool_eq
3160 join_bool_eq ~> sup_bool_eq
3161 meet_fun_eq ~> inf_fun_eq
3162 join_fun_eq ~> sup_fun_eq
3163 meet_set_eq ~> inf_set_eq
3164 join_set_eq ~> sup_set_eq
3165 meet1_iff ~> inf1_iff
3166 meet2_iff ~> inf2_iff
3175 join1_iff ~> sup1_iff
3176 join2_iff ~> sup2_iff
3186 is_meet_Meet ~> is_meet_Inf
3187 Meet_bool_def ~> Inf_bool_def
3188 Meet_fun_def ~> Inf_fun_def
3189 Meet_greatest ~> Inf_greatest
3190 Meet_lower ~> Inf_lower
3191 Meet_set_def ~> Inf_set_def
3194 Sup_bool_eq ~> Sup_bool_def
3195 Sup_fun_eq ~> Sup_fun_def
3196 Sup_set_eq ~> Sup_set_def
3198 listsp_meetI ~> listsp_infI
3199 listsp_meet_eq ~> listsp_inf_eq
3204 * Added syntactic class "size"; overloaded constant "size" now has
3205 type "'a::size ==> bool"
3207 * Internal reorganisation of `size' of datatypes: size theorems
3208 "foo.size" are no longer subsumed by "foo.simps" (but are still
3209 simplification rules by default!); theorems "prod.size" now named
3212 * Class "div" now inherits from class "times" rather than "type".
3215 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
3216 Linorder etc. have disappeared; operations defined in terms of
3217 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
3219 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
3221 * HOL-Word: New extensive library and type for generic, fixed size
3222 machine words, with arithemtic, bit-wise, shifting and rotating
3223 operations, reflection into int, nat, and bool lists, automation for
3224 linear arithmetic (by automatic reflection into nat or int), including
3225 lemmas on overflow and monotonicity. Instantiated to all appropriate
3226 arithmetic type classes, supporting automatic simplification of
3227 numerals on all operations.
3229 * Library/Boolean_Algebra: locales for abstract boolean algebras.
3231 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
3233 * Code generator library theories:
3234 - Code_Integer represents HOL integers by big integer literals in target
3236 - Code_Char represents HOL characters by character literals in target
3238 - Code_Char_chr like Code_Char, but also offers treatment of character
3239 codes; includes Code_Integer.
3240 - Executable_Set allows to generate code for finite sets using lists.
3241 - Executable_Rat implements rational numbers as triples (sign, enumerator,
3243 - Executable_Real implements a subset of real numbers, namly those
3244 representable by rational numbers.
3245 - Efficient_Nat implements natural numbers by integers, which in general will
3246 result in higher efficency; pattern matching with 0/Suc is eliminated;
3247 includes Code_Integer.
3248 - Code_Index provides an additional datatype index which is mapped to
3249 target-language built-in integers.
3250 - Code_Message provides an additional datatype message_string which is isomorphic to
3251 strings; messages are mapped to target-language strings.
3253 * New package for inductive predicates
3255 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
3258 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3259 for z_1 :: U_1 and ... and z_n :: U_m
3261 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3264 with full support for type-inference, rather than
3266 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3268 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3269 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3271 inductive "s z_1 ... z_m"
3273 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3276 For backward compatibility, there is a wrapper allowing inductive
3277 sets to be defined with the new package via
3280 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3281 for z_1 :: U_1 and ... and z_n :: U_m
3283 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3289 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3290 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3291 for z_1 :: U_1 and ... and z_n :: U_m
3293 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3294 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3297 if the additional syntax "p ..." is required.
3299 Numerous examples can be found in the subdirectories src/HOL/Auth,
3300 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
3304 - Since declaration and definition of inductive sets or predicates
3305 is no longer separated, abbreviations involving the newly
3306 introduced sets or predicates must be specified together with the
3307 introduction rules after the 'where' keyword (see above), rather
3308 than before the actual inductive definition.
3310 - The variables in induction and elimination rules are now
3311 quantified in the order of their occurrence in the introduction
3312 rules, rather than in alphabetical order. Since this may break
3313 some proofs, these proofs either have to be repaired, e.g. by
3314 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
3315 statements of the form
3317 case (rule_i a_i_1 ... a_i_{k_i})
3319 or the old order of quantification has to be restored by explicitly adding
3320 meta-level quantifiers in the introduction rules, i.e.
3322 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
3324 - The format of the elimination rules is now
3326 p z_1 ... z_m x_1 ... x_n ==>
3327 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3332 (x_1, ..., x_n) : s z_1 ... z_m ==>
3333 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3336 for sets rather than
3338 x : s z_1 ... z_m ==>
3339 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
3342 This may require terms in goals to be expanded to n-tuples
3343 (e.g. using case_tac or simplification with the split_paired_all
3344 rule) before the above elimination rule is applicable.
3346 - The elimination or case analysis rules for (mutually) inductive
3347 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
3348 list of rules "p_1_..._p_k.elims" is no longer available.
3350 * New package "function"/"fun" for general recursive functions,
3351 supporting mutual and nested recursion, definitions in local contexts,
3352 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
3353 for small examples, and the separate tutorial on the function
3354 package. The old recdef "package" is still available as before, but
3355 users are encouraged to use the new package.
3357 * Method "lexicographic_order" automatically synthesizes termination
3358 relations as lexicographic combinations of size measures.
3360 * Case-expressions allow arbitrary constructor-patterns (including
3361 "_") and take their order into account, like in functional
3362 programming. Internally, this is translated into nested
3363 case-expressions; missing cases are added and mapped to the predefined
3364 constant "undefined". In complicated cases printing may no longer show
3365 the original input but the internal form. Lambda-abstractions allow
3366 the same form of pattern matching: "% pat1 => e1 | ..." is an
3367 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
3370 * IntDef: The constant "int :: nat => int" has been removed; now "int"
3371 is an abbreviation for "of_nat :: nat => int". The simplification
3372 rules for "of_nat" have been changed to work like "int" did
3373 previously. Potential INCOMPATIBILITY:
3374 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
3375 - of_nat_diff and of_nat_mult are no longer default simp rules
3377 * Method "algebra" solves polynomial equations over (semi)rings using
3378 Groebner bases. The (semi)ring structure is defined by locales and the
3379 tool setup depends on that generic context. Installing the method for
3380 a specific type involves instantiating the locale and possibly adding
3381 declarations for computation on the coefficients. The method is
3382 already instantiated for natural numbers and for the axiomatic class
3383 of idoms with numerals. See also the paper by Chaieb and Wenzel at
3384 CALCULEMUS 2007 for the general principles underlying this
3385 architecture of context-aware proof-tools.
3387 * Method "ferrack" implements quantifier elimination over
3388 special-purpose dense linear orders using locales (analogous to
3389 "algebra"). The method is already installed for class
3390 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
3393 * Former constant "List.op @" now named "List.append". Use ML
3394 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
3395 circumvent possible incompatibilities when working on ML level.
3397 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3399 * New function listsum :: 'a list => 'a for arbitrary monoids.
3400 Special syntax: "SUM x <- xs. f x" (and latex variants)
3402 * New syntax for Haskell-like list comprehension (input only), eg.
3403 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3405 * The special syntax for function "filter" has changed from [x :
3406 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3407 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3409 * [a..b] is now defined for arbitrary linear orders. It used to be
3410 defined on nat only, as an abbreviation for [a..<Suc b]
3413 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3415 * New functions "sorted" and "sort" in src/HOL/List.thy.
3417 * New lemma collection field_simps (an extension of ring_simps) for
3418 manipulating (in)equations involving division. Multiplies with all
3419 denominators that can be proved to be non-zero (in equations) or
3420 positive/negative (in inequations).
3422 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3423 have been improved and renamed to ring_simps, group_simps and
3424 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3425 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3427 * Theory Library/Commutative_Ring: switched from recdef to function
3428 package; constants add, mul, pow now curried. Infix syntax for
3429 algebraic operations.
3431 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
3434 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
3437 * HOL/records: generalised field-update to take a function on the
3438 field rather than the new value: r(|A := x|) is translated to A_update
3439 (K x) r The K-combinator that is internally used is called K_record.
3440 INCOMPATIBILITY: Usage of the plain update functions has to be
3443 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
3444 * x = 0, which are required for a semiring. Richer structures do not
3445 inherit from semiring_0 anymore, because this property is a theorem
3446 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
3447 there is more to prove, but this is mostly trivial.
3449 * Class "recpower" is generalized to arbitrary monoids, not just
3450 commutative semirings. INCOMPATIBILITY: may need to incorporate
3451 commutativity or semiring properties additionally.
3453 * Constant "List.list_all2" in List.thy now uses authentic syntax.
3454 INCOMPATIBILITY: translations containing list_all2 may go wrong,
3455 better use 'abbreviation'.
3457 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3459 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3460 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3461 significant changes for setting up numeral syntax for types:
3462 - New constants Numeral.pred and Numeral.succ instead
3463 of former Numeral.bin_pred and Numeral.bin_succ.
3464 - Use integer operations instead of bin_add, bin_mult and so on.
3465 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3466 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3468 See src/HOL/Integ/IntArith.thy for an example setup.
3470 * Command 'normal_form' computes the normal form of a term that may
3471 contain free variables. For example ``normal_form "rev [a, b, c]"''
3472 produces ``[b, c, a]'' (without proof). This command is suitable for
3473 heavy-duty computations because the functions are compiled to ML
3474 first. Correspondingly, a method "normalization" is provided. See
3475 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3477 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3478 25 like -->); output depends on the "iff" print_mode, the default is
3479 "A = B" (with priority 50).
3481 * Relations less (<) and less_eq (<=) are also available on type bool.
3482 Modified syntax to disallow nesting without explicit parentheses,
3483 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3486 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3488 * Relation composition operator "op O" now has precedence 75 and binds
3489 stronger than union and intersection. INCOMPATIBILITY.
3491 * The old set interval syntax "{m..n(}" (and relatives) has been
3492 removed. Use "{m..<n}" (and relatives) instead.
3494 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3495 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3496 ``declare [[simproc del: neq]]''.
3498 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3501 * Theorem Cons_eq_map_conv no longer declared as "simp".
3503 * Theorem setsum_mult renamed to setsum_right_distrib.
3505 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3508 * Reimplemented methods "sat" and "satx", with several improvements:
3509 goals no longer need to be stated as "<prems> ==> False", equivalences
3510 (i.e. "=" on type bool) are handled, variable names of the form
3511 "lit_<n>" are no longer reserved, significant speedup.
3513 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3514 zChaff is still supported as well.
3516 * 'inductive' and 'datatype': provide projections of mutual rules,
3517 bundled as foo_bar.inducts;
3519 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3522 * Library: moved theory Accessible_Part to main HOL.
3524 * Library: added theory Coinductive_List of potentially infinite lists
3525 as greatest fixed-point.
3527 * Library: added theory AssocList which implements (finite) maps as
3530 * Method "evaluation" solves goals (i.e. a boolean expression)
3531 efficiently by compiling it to ML. The goal is "proved" (via an
3532 oracle) if it evaluates to True.
3534 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3535 also when invoked by the simplifier. This results in the Simplifier
3536 being more powerful on arithmetic goals. INCOMPATIBILITY.
3537 Configuration option fast_arith_split_limit=0 recovers the old
3540 * Support for hex (0x20) and binary (0b1001) numerals.
3542 * New method: reify eqs (t), where eqs are equations for an
3543 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3544 parameter, computes a term s::'b and a list xs::'a list and proves the
3545 theorem I xs s = t. This is also known as reification or quoting. The
3546 resulting theorem is applied to the subgoal to substitute t with I xs
3547 s. If t is omitted, the subgoal itself is reified.
3549 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3550 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3551 where f is supposed to be a computable function (in the sense of code
3552 generattion). The method uses reify to compute s and xs as above then
3553 applies corr_thm and uses normalization by evaluation to "prove" f s =
3554 r and finally gets the theorem t = r, which is again applied to the
3555 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3557 * Reflection: Automatic reification now handels binding, an example is
3558 available in src/HOL/ex/ReflectionEx.thy
3560 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3561 command 'statespace' that is similar to 'record', but introduces an
3562 abstract specification based on the locale infrastructure instead of
3563 HOL types. This leads to extra flexibility in composing state spaces,
3564 in particular multiple inheritance and renaming of components.
3569 * Hyperreal: Functions root and sqrt are now defined on negative real
3570 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3571 Nonnegativity side conditions have been removed from many lemmas, so
3572 that more subgoals may now be solved by simplification; potential
3575 * Real: new type classes formalize real normed vector spaces and
3576 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3577 and norm :: 'a => real.
3579 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3580 reals into other types. The overloaded constant Reals :: 'a set is now
3581 defined as range of_real; potential INCOMPATIBILITY.
3583 * Real: proper support for ML code generation, including 'quickcheck'.
3584 Reals are implemented as arbitrary precision rationals.
3586 * Hyperreal: Several constants that previously worked only for the
3587 reals have been generalized, so they now work over arbitrary vector
3588 spaces. Type annotations may need to be added in some cases; potential
3591 Infinitesimal :: ('a::real_normed_vector) star set
3592 HFinite :: ('a::real_normed_vector) star set
3593 HInfinite :: ('a::real_normed_vector) star set
3594 approx :: ('a::real_normed_vector) star => 'a star => bool
3595 monad :: ('a::real_normed_vector) star => 'a star set
3596 galaxy :: ('a::real_normed_vector) star => 'a star set
3597 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3598 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3599 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3600 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3601 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3602 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3603 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3604 sgn :: 'a::real_normed_vector => 'a
3605 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3607 * Complex: Some complex-specific constants are now abbreviations for
3608 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3609 hnorm. Other constants have been entirely removed in favor of the
3610 polymorphic versions (INCOMPATIBILITY):
3614 HInfinite <-- CInfinite
3615 Infinitesimal <-- CInfinitesimal
3618 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3619 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3620 (ns)deriv <-- (ns)cderiv
3625 * Formalisation of ideals and the quotient construction over rings.
3627 * Order and lattice theory no longer based on records.
3630 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3631 greatest_closed. INCOMPATIBILITY.
3633 * Method algebra is now set up via an attribute. For examples see
3634 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3635 of algebraic structures.
3637 * Renamed theory CRing to Ring.
3642 * Substantial, yet incomplete support for nominal datatypes (binding
3643 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3644 src/HOL/Nominal/Examples. Prospective users should consult
3645 http://isabelle.in.tum.de/nominal/
3650 * ML basics: just one true type int, which coincides with IntInf.int
3653 * ML within Isar: antiquotations allow to embed statically-checked
3654 formal entities in the source, referring to the context available at
3655 compile-time. For example:
3657 ML {* @{sort "{zero,one}"} *}
3658 ML {* @{typ "'a => 'b"} *}
3659 ML {* @{term "%x. x"} *}
3660 ML {* @{prop "x == y"} *}
3661 ML {* @{ctyp "'a => 'b"} *}
3662 ML {* @{cterm "%x. x"} *}
3663 ML {* @{cprop "x == y"} *}
3664 ML {* @{thm asm_rl} *}
3665 ML {* @{thms asm_rl} *}
3666 ML {* @{type_name c} *}
3667 ML {* @{type_syntax c} *}
3668 ML {* @{const_name c} *}
3669 ML {* @{const_syntax c} *}
3672 ML {* @{theory Pure} *}
3673 ML {* @{theory_ref} *}
3674 ML {* @{theory_ref Pure} *}
3677 ML {* @{clasimpset} *}
3679 The same works for sources being ``used'' within an Isar context.
3681 * ML in Isar: improved error reporting; extra verbosity with
3682 ML_Context.trace enabled.
3684 * Pure/General/table.ML: the join operations now works via exceptions
3685 DUP/SAME instead of type option. This is simpler in simple cases, and
3686 admits slightly more efficient complex applications.
3688 * Pure: 'advanced' translation functions (parse_translation etc.) now
3689 use Context.generic instead of just theory.
3691 * Pure: datatype Context.generic joins theory/Proof.context and
3692 provides some facilities for code that works in either kind of
3693 context, notably GenericDataFun for uniform theory and proof data.
3695 * Pure: simplified internal attribute type, which is now always
3696 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3697 local (Proof.context) attributes have been discontinued, while
3698 minimizing code duplication. Thm.rule_attribute and
3699 Thm.declaration_attribute build canonical attributes; see also structure
3700 Context for further operations on Context.generic, notably
3701 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3702 declarations and definitions.
3704 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3705 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3706 init only required for impure data. INCOMPATIBILITY: empty really need
3707 to be empty (no dependencies on theory content!)
3709 * Pure/kernel: consts certification ignores sort constraints given in
3710 signature declarations. (This information is not relevant to the
3711 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3712 potential INCOMPATIBILITY.
3714 * Pure: axiomatic type classes are now purely definitional, with
3715 explicit proofs of class axioms and super class relations performed
3716 internally. See Pure/axclass.ML for the main internal interfaces --
3717 notably AxClass.define_class supercedes AxClass.add_axclass, and
3718 AxClass.axiomatize_class/classrel/arity supersede
3719 Sign.add_classes/classrel/arities.
3721 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3722 global/local versions on theory vs. Proof.context have been
3723 discontinued; Attrib.syntax and Method.syntax have been adapted
3724 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3725 attributes, methods, etc.
3727 * Pure: several functions of signature "... -> theory -> theory * ..."
3728 have been reoriented to "... -> theory -> ... * theory" in order to
3729 allow natural usage in combination with the ||>, ||>>, |-> and
3730 fold_map combinators.
3732 * Pure: official theorem names (closed derivations) and additional
3733 comments (tags) are now strictly separate. Name hints -- which are
3734 maintained as tags -- may be attached any time without affecting the
3737 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3738 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3739 achieve the old behaviour.
3741 * Pure: the "Goal" constant is now called "prop", supporting a
3742 slightly more general idea of ``protecting'' meta-level rule
3745 * Pure: Logic.(un)varify only works in a global context, which is now
3746 enforced instead of silently assumed. INCOMPATIBILITY, may use
3747 Logic.legacy_(un)varify as temporary workaround.
3749 * Pure: structure Name provides scalable operations for generating
3750 internal variable names, notably Name.variants etc. This replaces
3751 some popular functions from term.ML:
3753 Term.variant -> Name.variant
3754 Term.variantlist -> Name.variant_list
3755 Term.invent_names -> Name.invent_list
3757 Note that low-level renaming rarely occurs in new code -- operations
3758 from structure Variable are used instead (see below).
3760 * Pure: structure Variable provides fundamental operations for proper
3761 treatment of fixed/schematic variables in a context. For example,
3762 Variable.import introduces fixes for schematics of given facts and
3763 Variable.export reverses the effect (up to renaming) -- this replaces
3764 various freeze_thaw operations.
3766 * Pure: structure Goal provides simple interfaces for
3767 init/conclude/finish and tactical prove operations (replacing former
3768 Tactic.prove). Goal.prove is the canonical way to prove results
3769 within a given context; Goal.prove_global is a degraded version for
3770 theory level goals, including a global Drule.standard. Note that
3771 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3772 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3773 in a locale context).
3775 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3776 and type checking (Syntax.check_term etc.), with common combinations
3777 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3778 which are considered legacy and await removal.
3780 * Pure/Syntax: generic interfaces for type unchecking
3781 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3782 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3783 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3784 available for convenience, but refer to the very same operations using
3785 a mere theory instead of a full context.
3787 * Isar: simplified treatment of user-level errors, using exception
3788 ERROR of string uniformly. Function error now merely raises ERROR,
3789 without any side effect on output channels. The Isar toplevel takes
3790 care of proper display of ERROR exceptions. ML code may use plain
3791 handle/can/try; cat_error may be used to concatenate errors like this:
3793 ... handle ERROR msg => cat_error msg "..."
3795 Toplevel ML code (run directly or through the Isar toplevel) may be
3796 embedded into the Isar toplevel with exception display/debug like
3799 Isar.toplevel (fn () => ...)
3801 INCOMPATIBILITY, removed special transform_error facilities, removed
3802 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3803 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3804 -- use plain ERROR instead.
3806 * Isar: theory setup now has type (theory -> theory), instead of a
3807 list. INCOMPATIBILITY, may use #> to compose setup functions.
3809 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3810 ProofContext.debug/verbose flags.
3812 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3813 theory before entering a proof state. Transactions now always see a
3814 quasi-functional intermediate checkpoint, both in interactive and
3817 * Isar: simplified interfaces for outer syntax. Renamed
3818 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3819 OuterSyntax.add_parsers -- this functionality is now included in
3820 OuterSyntax.command etc. INCOMPATIBILITY.
3822 * Simplifier: the simpset of a running simplification process now
3823 contains a proof context (cf. Simplifier.the_context), which is the
3824 very context that the initial simpset has been retrieved from (by
3825 simpset_of/local_simpset_of). Consequently, all plug-in components
3826 (solver, looper etc.) may depend on arbitrary proof data.
3828 * Simplifier.inherit_context inherits the proof context (plus the
3829 local bounds) of the current simplification process; any simproc
3830 etc. that calls the Simplifier recursively should do this! Removed
3831 former Simplifier.inherit_bounds, which is already included here --
3832 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3833 specify an explicit context using Simplifier.context/theory_context.
3835 * Simplifier/Classical Reasoner: more abstract interfaces
3836 change_simpset/claset for modifying the simpset/claset reference of a
3837 theory; raw versions simpset/claset_ref etc. have been discontinued --
3840 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3846 * settings: the default heap location within ISABELLE_HOME_USER now
3847 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3848 Isabelle installations.
3850 * isabelle-process: option -S (secure mode) disables some critical
3851 operations, notably runtime compilation and evaluation of ML source
3854 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3856 * Support for parallel execution, using native multicore support of
3857 Poly/ML 5.1. The theory loader exploits parallelism when processing
3858 independent theories, according to the given theory header
3859 specifications. The maximum number of worker threads is specified via
3860 usedir option -M or the "max-threads" setting in Proof General. A
3861 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3862 to 6 on a 8-core machine. User-code needs to observe certain
3863 guidelines for thread-safe programming, see appendix A in the Isar
3864 Implementation manual.
3868 New in Isabelle2005 (October 2005)
3869 ----------------------------------
3873 * Theory headers: the new header syntax for Isar theories is
3876 imports <theory1> ... <theoryN>
3877 uses <file1> ... <fileM>
3880 where the 'uses' part is optional. The previous syntax
3882 theory <name> = <theory1> + ... + <theoryN>:
3884 will disappear in the next release. Use isatool fixheaders to convert
3885 existing theory files. Note that there is no change in ancient
3886 non-Isar theories now, but these will disappear soon.
3888 * Theory loader: parent theories can now also be referred to via
3889 relative and absolute paths.
3891 * Command 'find_theorems' searches for a list of criteria instead of a
3892 list of constants. Known criteria are: intro, elim, dest, name:string,
3893 simp:term, and any term. Criteria can be preceded by '-' to select
3894 theorems that do not match. Intro, elim, dest select theorems that
3895 match the current goal, name:s selects theorems whose fully qualified
3896 name contain s, and simp:term selects all simplification rules whose
3897 lhs match term. Any other term is interpreted as pattern and selects
3898 all theorems matching the pattern. Available in ProofGeneral under
3899 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3901 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3903 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3904 matching the current goal as introduction rule and not having "HOL."
3905 in their name (i.e. not being defined in theory HOL).
3907 * Command 'thms_containing' has been discontinued in favour of
3908 'find_theorems'; INCOMPATIBILITY.
3910 * Communication with Proof General is now 8bit clean, which means that
3911 Unicode text in UTF-8 encoding may be used within theory texts (both
3912 formal and informal parts). Cf. option -U of the Isabelle Proof
3913 General interface. Here are some simple examples (cf. src/HOL/ex):
3915 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3916 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3918 * Improved efficiency of the Simplifier and, to a lesser degree, the
3919 Classical Reasoner. Typical big applications run around 2 times
3923 *** Document preparation ***
3925 * Commands 'display_drafts' and 'print_drafts' perform simple output
3926 of raw sources. Only those symbols that do not require additional
3927 LaTeX packages (depending on comments in isabellesym.sty) are
3928 displayed properly, everything else is left verbatim. isatool display
3929 and isatool print are used as front ends (these are subject to the
3930 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3932 * Command tags control specific markup of certain regions of text,
3933 notably folding and hiding. Predefined tags include "theory" (for
3934 theory begin and end), "proof" for proof commands, and "ML" for
3935 commands involving ML code; the additional tags "visible" and
3936 "invisible" are unused by default. Users may give explicit tag
3937 specifications in the text, e.g. ''by %invisible (auto)''. The
3938 interpretation of tags is determined by the LaTeX job during document
3939 preparation: see option -V of isatool usedir, or options -n and -t of
3940 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3943 Several document versions may be produced at the same time via isatool
3944 usedir (the generated index.html will link all of them). Typical
3945 specifications include ''-V document=theory,proof,ML'' to present
3946 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3947 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3948 these parts without any formal replacement text. The Isabelle site
3949 default settings produce ''document'' and ''outline'' versions as
3952 * Several new antiquotations:
3954 @{term_type term} prints a term with its type annotated;
3956 @{typeof term} prints the type of a term;
3958 @{const const} is the same as @{term const}, but checks that the
3959 argument is a known logical constant;
3961 @{term_style style term} and @{thm_style style thm} print a term or
3962 theorem applying a "style" to it
3966 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3967 definitions, equations, inequations etc., 'concl' printing only the
3968 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3969 to print the specified premise. TermStyle.add_style provides an ML
3970 interface for introducing further styles. See also the "LaTeX Sugar"
3971 document practical applications. The ML antiquotation prints
3972 type-checked ML expressions verbatim.
3974 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3975 and 'text' support optional locale specification '(in loc)', which
3976 specifies the default context for interpreting antiquotations. For
3977 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3979 * Option 'locale=NAME' of antiquotations specifies an alternative
3980 context interpreting the subsequent argument. For example: @{thm
3981 [locale=lattice] inf_assoc}.
3983 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3986 * Proper output of antiquotations for theory commands involving a
3987 proof context (such as 'locale' or 'theorem (in loc) ...').
3989 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3990 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3992 * isatool usedir: new option -C (default true) controls whether option
3993 -D should include a copy of the original document directory; -C false
3994 prevents unwanted effects such as copying of administrative CVS data.
3999 * Considerably improved version of 'constdefs' command. Now performs
4000 automatic type-inference of declared constants; additional support for
4001 local structure declarations (cf. locales and HOL records), see also
4002 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
4003 sequential dependencies of definitions within a single 'constdefs'
4004 section; moreover, the declared name needs to be an identifier. If
4005 all fails, consider to fall back on 'consts' and 'defs' separately.
4007 * Improved indexed syntax and implicit structures. First of all,
4008 indexed syntax provides a notational device for subscripted
4009 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
4010 expressions. Secondly, in a local context with structure
4011 declarations, number indexes \<^sub>n or the empty index (default
4012 number 1) refer to a certain fixed variable implicitly; option
4013 show_structs controls printing of implicit structures. Typical
4014 applications of these concepts involve record types and locales.
4016 * New command 'no_syntax' removes grammar declarations (and
4017 translations) resulting from the given syntax specification, which is
4018 interpreted in the same manner as for the 'syntax' command.
4020 * 'Advanced' translation functions (parse_translation etc.) may depend
4021 on the signature of the theory context being presently used for
4022 parsing/printing, see also isar-ref manual.
4024 * Improved 'oracle' command provides a type-safe interface to turn an
4025 ML expression of type theory -> T -> term into a primitive rule of
4026 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
4027 is already included here); see also FOL/ex/IffExample.thy;
4030 * axclass: name space prefix for class "c" is now "c_class" (was "c"
4031 before); "cI" is no longer bound, use "c.intro" instead.
4032 INCOMPATIBILITY. This change avoids clashes of fact bindings for
4033 axclasses vs. locales.
4035 * Improved internal renaming of symbolic identifiers -- attach primes
4036 instead of base 26 numbers.
4038 * New flag show_question_marks controls printing of leading question
4039 marks in schematic variable names.
4041 * In schematic variable names, *any* symbol following \<^isub> or
4042 \<^isup> is now treated as part of the base name. For example, the
4043 following works without printing of awkward ".0" indexes:
4045 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
4048 * Inner syntax includes (*(*nested*) comments*).
4050 * Pretty printer now supports unbreakable blocks, specified in mixfix
4051 annotations as "(00...)".
4053 * Clear separation of logical types and nonterminals, where the latter
4054 may only occur in 'syntax' specifications or type abbreviations.
4055 Before that distinction was only partially implemented via type class
4056 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
4057 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
4058 exotic syntax specifications may require further adaption
4059 (e.g. Cube/Cube.thy).
4061 * Removed obsolete type class "logic", use the top sort {} instead.
4062 Note that non-logical types should be declared as 'nonterminals'
4063 rather than 'types'. INCOMPATIBILITY for new object-logic
4066 * Attributes 'induct' and 'cases': type or set names may now be
4067 locally fixed variables as well.
4069 * Simplifier: can now control the depth to which conditional rewriting
4070 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
4073 * Simplifier: simplification procedures may now take the current
4074 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
4075 interface), which is very useful for calling the Simplifier
4076 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
4077 is gone -- use prems_of_ss on the simpset instead. Moreover, the
4078 low-level mk_simproc no longer applies Logic.varify internally, to
4079 allow for use in a context of fixed variables.
4081 * thin_tac now works even if the assumption being deleted contains !!
4082 or ==>. More generally, erule now works even if the major premise of
4083 the elimination rule contains !! or ==>.
4085 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
4087 * Reorganized bootstrapping of the Pure theories; CPure is now derived
4088 from Pure, which contains all common declarations already. Both
4089 theories are defined via plain Isabelle/Isar .thy files.
4090 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
4091 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
4092 use isatool fixcpure to adapt your theory and ML sources.
4094 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
4095 selections of theorems in named facts via index ranges.
4097 * 'print_theorems': in theory mode, really print the difference
4098 wrt. the last state (works for interactive theory development only),
4099 in proof mode print all local facts (cf. 'print_facts');
4101 * 'hide': option '(open)' hides only base names.
4103 * More efficient treatment of intermediate checkpoints in interactive
4106 * Code generator is now invoked via code_module (incremental code
4107 generation) and code_library (modular code generation, ML structures
4108 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
4109 must be quoted when used as identifiers.
4111 * New 'value' command for reading, evaluating and printing terms using
4112 the code generator. INCOMPATIBILITY: command keyword 'value' must be
4113 quoted when used as identifier.
4118 * New commands for the interpretation of locale expressions in
4119 theories (1), locales (2) and proof contexts (3). These generate
4120 proof obligations from the expression specification. After the
4121 obligations have been discharged, theorems of the expression are added
4122 to the theory, target locale or proof context. The synopsis of the
4123 commands is a follows:
4125 (1) interpretation expr inst
4126 (2) interpretation target < expr
4127 (3) interpret expr inst
4129 Interpretation in theories and proof contexts require a parameter
4130 instantiation of terms from the current context. This is applied to
4131 specifications and theorems of the interpreted expression.
4132 Interpretation in locales only permits parameter renaming through the
4133 locale expression. Interpretation is smart in that interpretations
4134 that are active already do not occur in proof obligations, neither are
4135 instantiated theorems stored in duplicate. Use 'print_interps' to
4136 inspect active interpretations of a particular locale. For details,
4137 see the Isar Reference manual. Examples can be found in
4138 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
4140 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
4141 'interpret' instead.
4143 * New context element 'constrains' for adding type constraints to
4146 * Context expressions: renaming of parameters with syntax
4149 * Locale declaration: 'includes' disallowed.
4151 * Proper static binding of attribute syntax -- i.e. types / terms /
4152 facts mentioned as arguments are always those of the locale definition
4153 context, independently of the context of later invocations. Moreover,
4154 locale operations (renaming and type / term instantiation) are applied
4155 to attribute arguments as expected.
4157 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
4158 actual attributes; rare situations may require Attrib.attribute to
4159 embed those attributes into Attrib.src that lack concrete syntax.
4160 Attribute implementations need to cooperate properly with the static
4161 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
4162 Attrib.XXX_thm etc. already do the right thing without further
4163 intervention. Only unusual applications -- such as "where" or "of"
4164 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
4165 on the context and the facts involved -- may have to assign parsed
4166 values to argument tokens explicitly.
4168 * Changed parameter management in theorem generation for long goal
4169 statements with 'includes'. INCOMPATIBILITY: produces a different
4170 theorem statement in rare situations.
4172 * Locale inspection command 'print_locale' omits notes elements. Use
4173 'print_locale!' to have them included in the output.
4178 * Provers/hypsubst.ML: improved version of the subst method, for
4179 single-step rewriting: it now works in bound variable contexts. New is
4180 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
4181 rewrite a different subterm than the original subst method, which is
4182 still available as 'simplesubst'.
4184 * Provers/quasi.ML: new transitivity reasoners for transitivity only
4187 * Provers/trancl.ML: new transitivity reasoner for transitive and
4188 reflexive-transitive closure of relations.
4190 * Provers/blast.ML: new reference depth_limit to make blast's depth
4191 limit (previously hard-coded with a value of 20) user-definable.
4193 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
4194 is peformed already. Object-logics merely need to finish their
4195 initial simpset configuration as before. INCOMPATIBILITY.
4200 * Symbolic syntax of Hilbert Choice Operator is now as follows:
4203 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
4205 The symbol \<some> is displayed as the alternative epsilon of LaTeX
4206 and x-symbol; use option '-m epsilon' to get it actually printed.
4207 Moreover, the mathematically important symbolic identifier \<epsilon>
4208 becomes available as variable, constant etc. INCOMPATIBILITY,
4210 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
4211 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
4212 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
4213 support corresponding Isar calculations.
4215 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
4218 * theory SetInterval: changed the syntax for open intervals:
4227 The old syntax is still supported but will disappear in the next
4228 release. For conversion use the following Emacs search and replace
4229 patterns (these are not perfect but work quite well):
4231 {)\([^\.]*\)\.\. -> {\1<\.\.}
4232 \.\.\([^(}]*\)(} -> \.\.<\1}
4234 * Theory Commutative_Ring (in Library): method comm_ring for proving
4235 equalities in commutative rings; method 'algebra' provides a generic
4238 * Theory Finite_Set: changed the syntax for 'setsum', summation over
4239 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
4240 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
4243 Some new syntax forms are available:
4245 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
4246 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
4247 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
4248 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
4250 The latter form "\<Sum>x < k. e" used to be based on a separate
4251 function "Summation", which has been discontinued.
4253 * theory Finite_Set: in structured induction proofs, the insert case
4254 is now 'case (insert x F)' instead of the old counterintuitive 'case
4257 * The 'refute' command has been extended to support a much larger
4258 fragment of HOL, including axiomatic type classes, constdefs and
4259 typedefs, inductive datatypes and recursion.
4261 * New tactics 'sat' and 'satx' to prove propositional tautologies.
4262 Requires zChaff with proof generation to be installed. See
4263 HOL/ex/SAT_Examples.thy for examples.
4265 * Datatype induction via method 'induct' now preserves the name of the
4266 induction variable. For example, when proving P(xs::'a list) by
4267 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
4268 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
4269 in unstructured proof scripts.
4271 * Reworked implementation of records. Improved scalability for
4272 records with many fields, avoiding performance problems for type
4273 inference. Records are no longer composed of nested field types, but
4274 of nested extension types. Therefore the record type only grows linear
4275 in the number of extensions and not in the number of fields. The
4276 top-level (users) view on records is preserved. Potential
4277 INCOMPATIBILITY only in strange cases, where the theory depends on the
4278 old record representation. The type generated for a record is called
4279 <record_name>_ext_type.
4281 Flag record_quick_and_dirty_sensitive can be enabled to skip the
4282 proofs triggered by a record definition or a simproc (if
4283 quick_and_dirty is enabled). Definitions of large records can take
4286 New simproc record_upd_simproc for simplification of multiple record
4287 updates enabled by default. Moreover, trivial updates are also
4288 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4289 occasionally, since simplification is more powerful by default.
4291 * typedef: proper support for polymorphic sets, which contain extra
4292 type-variables in the term.
4294 * Simplifier: automatically reasons about transitivity chains
4295 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4296 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4297 old proofs break occasionally as simplification may now solve more
4298 goals than previously.
4300 * Simplifier: converts x <= y into x = y if assumption y <= x is
4301 present. Works for all partial orders (class "order"), in particular
4302 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
4305 * Simplifier: new simproc for "let x = a in f x". If a is a free or
4306 bound variable or a constant then the let is unfolded. Otherwise
4307 first a is simplified to b, and then f b is simplified to g. If
4308 possible we abstract b from g arriving at "let x = b in h x",
4309 otherwise we unfold the let and arrive at g. The simproc can be
4310 enabled/disabled by the reference use_let_simproc. Potential
4311 INCOMPATIBILITY since simplification is more powerful by default.
4313 * Classical reasoning: the meson method now accepts theorems as arguments.
4315 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
4316 jobs to provide advice on the provability of subgoals.
4318 * Theory OrderedGroup and Ring_and_Field: various additions and
4319 improvements to faciliate calculations involving equalities and
4322 The following theorems have been eliminated or modified
4325 abs_eq now named abs_of_nonneg
4326 abs_of_ge_0 now named abs_of_nonneg
4327 abs_minus_eq now named abs_of_nonpos
4328 imp_abs_id now named abs_of_nonneg
4329 imp_abs_neg_id now named abs_of_nonpos
4330 mult_pos now named mult_pos_pos
4331 mult_pos_le now named mult_nonneg_nonneg
4332 mult_pos_neg_le now named mult_nonneg_nonpos
4333 mult_pos_neg2_le now named mult_nonneg_nonpos2
4334 mult_neg now named mult_neg_neg
4335 mult_neg_le now named mult_nonpos_nonpos
4337 * The following lemmas in Ring_and_Field have been added to the simplifier:
4340 not_square_less_zero
4342 The following lemmas have been deleted from Real/RealPow:
4352 * Theory Parity: added rules for simplifying exponents.
4356 The following theorems have been eliminated or modified
4359 list_all_Nil now named list_all.simps(1)
4360 list_all_Cons now named list_all.simps(2)
4361 list_all_conv now named list_all_iff
4362 set_mem_eq now named mem_iff
4364 * Theories SetsAndFunctions and BigO (see HOL/Library) support
4365 asymptotic "big O" calculations. See the notes in BigO.thy.
4370 * Theory RealDef: better support for embedding natural numbers and
4371 integers in the reals.
4373 The following theorems have been eliminated or modified
4376 exp_ge_add_one_self now requires no hypotheses
4377 real_of_int_add reversed direction of equality (use [symmetric])
4378 real_of_int_minus reversed direction of equality (use [symmetric])
4379 real_of_int_diff reversed direction of equality (use [symmetric])
4380 real_of_int_mult reversed direction of equality (use [symmetric])
4382 * Theory RComplete: expanded support for floor and ceiling functions.
4384 * Theory Ln is new, with properties of the natural logarithm
4386 * Hyperreal: There is a new type constructor "star" for making
4387 nonstandard types. The old type names are now type synonyms:
4391 hcomplex = complex star
4393 * Hyperreal: Many groups of similarly-defined constants have been
4394 replaced by polymorphic versions (INCOMPATIBILITY):
4396 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4398 starset <-- starsetNat, starsetC
4399 *s* <-- *sNat*, *sc*
4400 starset_n <-- starsetNat_n, starsetC_n
4401 *sn* <-- *sNatn*, *scn*
4402 InternalSets <-- InternalNatSets, InternalCSets
4404 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4405 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4406 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4407 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4408 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4410 * Hyperreal: Many type-specific theorems have been removed in favor of
4411 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4413 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4414 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4415 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4416 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4417 right_minus <-- hypreal_add_minus
4418 left_minus <-- {hypreal,hcomplex}_add_minus_left
4419 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4420 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4421 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4422 mult_1_right <-- hcomplex_mult_one_right
4423 mult_zero_left <-- hcomplex_mult_zero_left
4424 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4425 right_distrib <-- hypnat_add_mult_distrib2
4426 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4427 right_inverse <-- hypreal_mult_inverse
4428 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4429 order_refl <-- {hypreal,hypnat}_le_refl
4430 order_trans <-- {hypreal,hypnat}_le_trans
4431 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4432 order_less_le <-- {hypreal,hypnat}_less_le
4433 linorder_linear <-- {hypreal,hypnat}_le_linear
4434 add_left_mono <-- {hypreal,hypnat}_add_left_mono
4435 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
4436 add_nonneg_nonneg <-- hypreal_le_add_order
4438 * Hyperreal: Separate theorems having to do with type-specific
4439 versions of constants have been merged into theorems that apply to the
4440 new polymorphic constants (INCOMPATIBILITY):
4442 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
4443 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
4444 STAR_Un <-- {STAR,NatStar,STARC}_Un
4445 STAR_Int <-- {STAR,NatStar,STARC}_Int
4446 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
4447 STAR_subset <-- {STAR,NatStar,STARC}_subset
4448 STAR_mem <-- {STAR,NatStar,STARC}_mem
4449 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
4450 STAR_diff <-- {STAR,STARC}_diff
4451 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
4452 STARC_hcomplex_of_complex}_image_subset
4453 starset_n_Un <-- starset{Nat,C}_n_Un
4454 starset_n_Int <-- starset{Nat,C}_n_Int
4455 starset_n_Compl <-- starset{Nat,C}_n_Compl
4456 starset_n_diff <-- starset{Nat,C}_n_diff
4457 InternalSets_Un <-- Internal{Nat,C}Sets_Un
4458 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4459 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4460 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4461 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4462 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4463 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4464 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4465 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4466 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4467 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4468 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4469 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4470 starfun_diff <-- starfun{C,RC,CR}_diff
4471 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4472 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4473 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4474 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4475 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4476 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4477 starfun_Id <-- starfunC_Id
4478 starfun_approx <-- starfun{Nat,CR}_approx
4479 starfun_capprox <-- starfun{C,RC}_capprox
4480 starfun_abs <-- starfunNat_rabs
4481 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4482 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4483 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4484 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4485 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4486 starfun_add_approx <-- starfunCR_add_approx
4487 starfun_inverse_inverse <-- starfunC_inverse_inverse
4488 starfun_divide <-- starfun{C,CR,RC}_divide
4489 starfun_n <-- starfun{Nat,C}_n
4490 starfun_n_mult <-- starfun{Nat,C}_n_mult
4491 starfun_n_add <-- starfun{Nat,C}_n_add
4492 starfun_n_add_minus <-- starfunNat_n_add_minus
4493 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4494 starfun_n_minus <-- starfun{Nat,C}_n_minus
4495 starfun_n_eq <-- starfun{Nat,C}_n_eq
4497 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4498 star_n_minus <-- {hypreal,hcomplex}_minus
4499 star_n_diff <-- {hypreal,hcomplex}_diff
4500 star_n_mult <-- {hypreal,hcomplex}_mult
4501 star_n_inverse <-- {hypreal,hcomplex}_inverse
4502 star_n_le <-- {hypreal,hypnat}_le
4503 star_n_less <-- {hypreal,hypnat}_less
4504 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4505 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4506 star_n_abs <-- hypreal_hrabs
4507 star_n_divide <-- hcomplex_divide
4509 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4510 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4511 star_of_diff <-- hypreal_of_real_diff
4512 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4513 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4514 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4515 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4516 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4517 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4518 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4519 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4520 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4521 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4522 star_of_number_of <-- {hypreal,hcomplex}_number_of
4523 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4524 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4525 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4526 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4527 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4528 star_of_power <-- hypreal_of_real_power
4529 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4531 * Hyperreal: new method "transfer" that implements the transfer
4532 principle of nonstandard analysis. With a subgoal that mentions
4533 nonstandard types like "'a star", the command "apply transfer"
4534 replaces it with an equivalent one that mentions only standard types.
4535 To be successful, all free variables must have standard types; non-
4536 standard variables must have explicit universal quantifiers.
4538 * Hyperreal: A theory of Taylor series.
4543 * Discontinued special version of 'constdefs' (which used to support
4544 continuous functions) in favor of the general Pure one with full
4547 * New simplification procedure for solving continuity conditions; it
4548 is much faster on terms with many nested lambda abstractions (cubic
4549 instead of exponential time).
4551 * New syntax for domain package: selector names are now optional.
4552 Parentheses should be omitted unless argument is lazy, for example:
4554 domain 'a stream = cons "'a" (lazy "'a stream")
4556 * New command 'fixrec' for defining recursive functions with pattern
4557 matching; defining multiple functions with mutual recursion is also
4558 supported. Patterns may include the constants cpair, spair, up, sinl,
4559 sinr, or any data constructor defined by the domain package. The given
4560 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4561 syntax and examples.
4563 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4564 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4565 but the proof obligation additionally includes an admissibility
4566 requirement. The packages generate instances of class cpo or pcpo,
4567 with continuity and strictness theorems for Rep and Abs.
4569 * HOLCF: Many theorems have been renamed according to a more standard naming
4570 scheme (INCOMPATIBILITY):
4572 foo_inject: "foo$x = foo$y ==> x = y"
4573 foo_eq: "(foo$x = foo$y) = (x = y)"
4574 foo_less: "(foo$x << foo$y) = (x << y)"
4575 foo_strict: "foo$UU = UU"
4576 foo_defined: "... ==> foo$x ~= UU"
4577 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4582 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4583 including the First Isomorphism Theorem (on quotienting by the kernel
4586 * ZF/Simplifier: install second copy of type solver that actually
4587 makes use of TC rules declared to Isar proof contexts (or locales);
4588 the old version is still required for ML proof scripts.
4593 * Converted to Isar theory format; use locales instead of axiomatic
4599 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4602 * Pure/library.ML no longer defines its own option datatype, but uses
4603 that of the SML basis, which has constructors NONE and SOME instead of
4604 None and Some, as well as exception Option.Option instead of OPTION.
4605 The functions the, if_none, is_some, is_none have been adapted
4606 accordingly, while Option.map replaces apsome.
4608 * Pure/library.ML: the exception LIST has been given up in favour of
4609 the standard exceptions Empty and Subscript, as well as
4610 Library.UnequalLengths. Function like Library.hd and Library.tl are
4611 superceded by the standard hd and tl functions etc.
4613 A number of basic list functions are no longer exported to the ML
4614 toplevel, as they are variants of predefined functions. The following
4615 suggests how one can translate existing code:
4617 rev_append xs ys = List.revAppend (xs, ys)
4618 nth_elem (i, xs) = List.nth (xs, i)
4619 last_elem xs = List.last xs
4620 flat xss = List.concat xss
4621 seq fs = List.app fs
4622 partition P xs = List.partition P xs
4623 mapfilter f xs = List.mapPartial f xs
4625 * Pure/library.ML: several combinators for linear functional
4626 transformations, notably reverse application and composition:
4629 (x, y) |-> f f #-> g
4631 * Pure/library.ML: introduced/changed precedence of infix operators:
4633 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4635 infix 3 o oo ooo oooo;
4636 infix 4 ~~ upto downto;
4638 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4641 * Pure/library.ML: natural list combinators fold, fold_rev, and
4642 fold_map support linear functional transformations and nesting. For
4645 fold f [x1, ..., xN] y =
4646 y |> f x1 |> ... |> f xN
4648 (fold o fold) f [xs1, ..., xsN] y =
4649 y |> fold f xs1 |> ... |> fold f xsN
4651 fold f [x1, ..., xN] =
4654 (fold o fold) f [xs1, ..., xsN] =
4655 fold f xs1 #> ... #> fold f xsN
4657 * Pure/library.ML: the following selectors on type 'a option are
4660 the: 'a option -> 'a (*partial*)
4661 these: 'a option -> 'a where 'a = 'b list
4662 the_default: 'a -> 'a option -> 'a
4663 the_list: 'a option -> 'a list
4665 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4666 basic operations for association lists, following natural argument
4667 order; moreover the explicit equality predicate passed here avoids
4668 potentially expensive polymorphic runtime equality checks.
4669 The old functions may be expressed as follows:
4671 assoc = uncurry (AList.lookup (op =))
4672 assocs = these oo AList.lookup (op =)
4673 overwrite = uncurry (AList.update (op =)) o swap
4675 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4677 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4678 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4680 replacing make_keylist and keyfilter (occassionally used)
4683 make_keylist = AList.make
4684 keyfilter = AList.find (op =)
4686 * eq_fst and eq_snd now take explicit equality parameter, thus
4687 avoiding eqtypes. Naive rewrites:
4689 eq_fst = eq_fst (op =)
4690 eq_snd = eq_snd (op =)
4692 * Removed deprecated apl and apr (rarely used).
4695 apl (n, op) =>>= curry op n
4696 apr (op, m) =>>= fn n => op (n, m)
4698 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4699 provides a reasonably efficient light-weight implementation of sets as
4702 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4703 few new operations; existing lookup and update are now curried to
4704 follow natural argument order (for use with fold etc.);
4705 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4707 * Pure/General: output via the Isabelle channels of
4708 writeln/warning/error etc. is now passed through Output.output, with a
4709 hook for arbitrary transformations depending on the print_mode
4710 (cf. Output.add_mode -- the first active mode that provides a output
4711 function wins). Already formatted output may be embedded into further
4712 text via Output.raw; the result of Pretty.string_of/str_of and derived
4713 functions (string_of_term/cterm/thm etc.) is already marked raw to
4714 accommodate easy composition of diagnostic messages etc. Programmers
4715 rarely need to care about Output.output or Output.raw at all, with
4716 some notable exceptions: Output.output is required when bypassing the
4717 standard channels (writeln etc.), or in token translations to produce
4718 properly formatted results; Output.raw is required when capturing
4719 already output material that will eventually be presented to the user
4720 a second time. For the default print mode, both Output.output and
4721 Output.raw have no effect.
4723 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4724 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4725 cumulative results are displayed at the end of a batch session.
4727 * Pure/General: File.sysify_path and File.quote_sysify path have been
4728 replaced by File.platform_path and File.shell_path (with appropriate
4729 hooks). This provides a clean interface for unusual systems where the
4730 internal and external process view of file names are different.
4732 * Pure: more efficient orders for basic syntactic entities: added
4733 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4734 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4735 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4736 orders now -- potential INCOMPATIBILITY for code that depends on a
4737 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4738 Library.sort_strings on result).
4740 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4741 fold_types traverse types/terms from left to right, observing natural
4742 argument order. Supercedes previous foldl_XXX versions, add_frees,
4743 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4745 * Pure: name spaces have been refined, with significant changes of the
4746 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4747 to extern(_table). The plain name entry path is superceded by a
4748 general 'naming' context, which also includes the 'policy' to produce
4749 a fully qualified name and external accesses of a fully qualified
4750 name; NameSpace.extend is superceded by context dependent
4751 Sign.declare_name. Several theory and proof context operations modify
4752 the naming context. Especially note Theory.restore_naming and
4753 ProofContext.restore_naming to get back to a sane state; note that
4754 Theory.add_path is no longer sufficient to recover from
4755 Theory.absolute_path in particular.
4757 * Pure: new flags short_names (default false) and unique_names
4758 (default true) for controlling output of qualified names. If
4759 short_names is set, names are printed unqualified. If unique_names is
4760 reset, the name prefix is reduced to the minimum required to achieve
4761 the original result when interning again, even if there is an overlap
4762 with earlier declarations.
4764 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4765 now 'extend', and 'merge' gets an additional Pretty.pp argument
4766 (useful for printing error messages). INCOMPATIBILITY.
4768 * Pure: major reorganization of the theory context. Type Sign.sg and
4769 Theory.theory are now identified, referring to the universal
4770 Context.theory (see Pure/context.ML). Actual signature and theory
4771 content is managed as theory data. The old code and interfaces were
4772 spread over many files and structures; the new arrangement introduces
4773 considerable INCOMPATIBILITY to gain more clarity:
4775 Context -- theory management operations (name, identity, inclusion,
4776 parents, ancestors, merge, etc.), plus generic theory data;
4778 Sign -- logical signature and syntax operations (declaring consts,
4779 types, etc.), plus certify/read for common entities;
4781 Theory -- logical theory operations (stating axioms, definitions,
4782 oracles), plus a copy of logical signature operations (consts,
4783 types, etc.); also a few basic management operations (Theory.copy,
4786 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4787 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4788 for convenience -- they merely return the theory.
4790 * Pure: type Type.tsig is superceded by theory in most interfaces.
4792 * Pure: the Isar proof context type is already defined early in Pure
4793 as Context.proof (note that ProofContext.context and Proof.context are
4794 aliases, where the latter is the preferred name). This enables other
4795 Isabelle components to refer to that type even before Isar is present.
4797 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4798 typeK, constK, axiomK, oracleK), but provide explicit operations for
4799 any of these kinds. For example, Sign.intern typeK is now
4800 Sign.intern_type, Theory.hide_space Sign.typeK is now
4801 Theory.hide_types. Also note that former
4802 Theory.hide_classes/types/consts are now
4803 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4804 internalize their arguments! INCOMPATIBILITY.
4806 * Pure: get_thm interface (of PureThy and ProofContext) expects
4807 datatype thmref (with constructors Name and NameSelection) instead of
4808 plain string -- INCOMPATIBILITY;
4810 * Pure: cases produced by proof methods specify options, where NONE
4811 means to remove case bindings -- INCOMPATIBILITY in
4814 * Pure: the following operations retrieve axioms or theorems from a
4815 theory node or theory hierarchy, respectively:
4817 Theory.axioms_of: theory -> (string * term) list
4818 Theory.all_axioms_of: theory -> (string * term) list
4819 PureThy.thms_of: theory -> (string * thm) list
4820 PureThy.all_thms_of: theory -> (string * thm) list
4822 * Pure: print_tac now outputs the goal through the trace channel.
4824 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4825 Reference Toplevel.debug (default false) controls detailed printing
4826 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4827 controls execution profiling -- set to 1 for time and 2 for space
4828 (both increase the runtime).
4830 * Isar session: The initial use of ROOT.ML is now always timed,
4831 i.e. the log will show the actual process times, in contrast to the
4832 elapsed wall-clock time that the outer shell wrapper produces.
4834 * Simplifier: improved handling of bound variables (nameless
4835 representation, avoid allocating new strings). Simprocs that invoke
4836 the Simplifier recursively should use Simplifier.inherit_bounds to
4837 avoid local name clashes. Failure to do so produces warnings
4838 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4839 for further details.
4841 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4842 bindings for all theorems stored within a given theory; this may help
4843 in porting non-Isar theories to Isar ones, while keeping ML proof
4844 scripts for the time being.
4846 * ML operator HTML.with_charset specifies the charset begin used for
4847 generated HTML files. For example:
4849 HTML.with_charset "utf-8" use_thy "Hebrew";
4850 HTML.with_charset "utf-8" use_thy "Chinese";
4855 * Allow symlinks to all proper Isabelle executables (Isabelle,
4856 isabelle, isatool etc.).
4858 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4859 isatool doc, isatool mkdir, display_drafts etc.).
4861 * isatool usedir: option -f allows specification of the ML file to be
4862 used by Isabelle; default is ROOT.ML.
4864 * New isatool version outputs the version identifier of the Isabelle
4865 distribution being used.
4867 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4868 (containing Boolean satisfiability problems) into Isabelle/HOL
4873 New in Isabelle2004 (April 2004)
4874 --------------------------------
4878 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4879 Replaces linorder.ML.
4881 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4882 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4883 (\<a>...\<z>), are now considered normal letters, and can therefore
4884 be used anywhere where an ASCII letter (a...zA...Z) has until
4885 now. COMPATIBILITY: This obviously changes the parsing of some
4886 terms, especially where a symbol has been used as a binder, say
4887 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4888 as an identifier. Fix it by inserting a space around former
4889 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4890 existing theory and ML files.
4892 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4894 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4895 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4896 a normal (but invisible) letter. For multiple letter subscripts repeat
4897 \<^isub> like this: x\<^isub>1\<^isub>2.
4899 * Pure: There are now sub-/superscripts that can span more than one
4900 character. Text between \<^bsub> and \<^esub> is set in subscript in
4901 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4902 superscript. The new control characters are not identifier parts.
4904 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4905 content of "..." to the latex file instead of \isacntrl... . The "..."
4906 may consist of any printable characters excluding the end bracket >.
4908 * Pure: Using new Isar command "finalconsts" (or the ML functions
4909 Theory.add_finals or Theory.add_finals_i) it is now possible to
4910 declare constants "final", which prevents their being given a definition
4911 later. It is useful for constants whose behaviour is fixed axiomatically
4912 rather than definitionally, such as the meta-logic connectives.
4914 * Pure: 'instance' now handles general arities with general sorts
4915 (i.e. intersections of classes),
4917 * Presentation: generated HTML now uses a CSS style sheet to make layout
4918 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4919 It can be changed to alter the colors/layout of generated pages.
4924 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4925 cut_tac, subgoal_tac and thin_tac:
4926 - Now understand static (Isar) contexts. As a consequence, users of Isar
4927 locales are no longer forced to write Isar proof scripts.
4928 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4930 - INCOMPATIBILITY: names of variables to be instantiated may no
4931 longer be enclosed in quotes. Instead, precede variable name with `?'.
4932 This is consistent with the instantiation attribute "where".
4934 * Attributes "where" and "of":
4935 - Now take type variables of instantiated theorem into account when reading
4936 the instantiation string. This fixes a bug that caused instantiated
4937 theorems to have too special types in some circumstances.
4938 - "where" permits explicit instantiations of type variables.
4940 * Calculation commands "moreover" and "also" no longer interfere with
4941 current facts ("this"), admitting arbitrary combinations with "then"
4945 - Goal statements involving the context element "includes" no longer
4946 generate theorems with internal delta predicates (those ending on
4947 "_axioms") in the premise.
4948 Resolve particular premise with <locale>.intro to obtain old form.
4949 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4950 specification and "includes" elements in goal statement.
4951 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4952 [intro?] and [elim?] (respectively) by default.
4953 - Experimental command for instantiation of locales in proof contexts:
4954 instantiate <label>[<attrs>]: <loc>
4955 Instantiates locale <loc> and adds all its theorems to the current context
4956 taking into account their attributes. Label and attrs are optional
4957 modifiers, like in theorem declarations. If present, names of
4958 instantiated theorems are qualified with <label>, and the attributes
4959 <attrs> are applied after any attributes these theorems might have already.
4960 If the locale has assumptions, a chained fact of the form
4961 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4962 are derived. The command does not support old-style locales declared
4963 with "locale (open)".
4964 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4966 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4972 * Proof import: new image HOL4 contains the imported library from
4973 the HOL4 system with about 2500 theorems. It is imported by
4974 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4975 can be used like any other Isabelle image. See
4976 HOL/Import/HOL/README for more information.
4979 - Much improved handling of linear and partial orders.
4980 Reasoners for linear and partial orders are set up for type classes
4981 "linorder" and "order" respectively, and are added to the default simpset
4982 as solvers. This means that the simplifier can build transitivity chains
4983 to solve goals from the assumptions.
4984 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4985 of blast or auto after simplification become unnecessary because the goal
4986 is solved by simplification already.
4988 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4989 all proved in axiomatic type classes for semirings, rings and fields.
4992 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4993 now formalized using the Ring_and_Field theory mentioned above.
4994 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4995 than before, because now they are set up once in a generic manner.
4996 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4997 Look for the general versions in Ring_and_Field (and Power if they concern
5000 * Type "rat" of the rational numbers is now available in HOL-Complex.
5003 - Record types are now by default printed with their type abbreviation
5004 instead of the list of all field types. This can be configured via
5005 the reference "print_record_type_abbr".
5006 - Simproc "record_upd_simproc" for simplification of multiple updates added
5007 (not enabled by default).
5008 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
5009 EX x. x = sel r to True (not enabled by default).
5010 - Tactic "record_split_simp_tac" to split and simplify records added.
5012 * 'specification' command added, allowing for definition by
5013 specification. There is also an 'ax_specification' command that
5014 introduces the new constants axiomatically.
5016 * arith(_tac) is now able to generate counterexamples for reals as well.
5018 * HOL-Algebra: new locale "ring" for non-commutative rings.
5020 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
5021 definitions, thanks to Sava Krsti\'{c} and John Matthews.
5023 * HOL-Matrix: a first theory for matrices in HOL with an application of
5024 matrix theory to linear programming.
5026 * Unions and Intersections:
5027 The latex output syntax of UN and INT has been changed
5028 from "\Union x \in A. B" to "\Union_{x \in A} B"
5029 i.e. the index formulae has become a subscript.
5030 Similarly for "\Union x. B", and for \Inter instead of \Union.
5032 * Unions and Intersections over Intervals:
5033 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
5034 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
5035 like in normal math, and corresponding versions for < and for intersection.
5037 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
5038 lexicographic dictonary ordering has been added as "lexord".
5040 * ML: the legacy theory structures Int and List have been removed. They had
5041 conflicted with ML Basis Library structures having the same names.
5043 * 'refute' command added to search for (finite) countermodels. Only works
5044 for a fragment of HOL. The installation of an external SAT solver is
5045 highly recommended. See "HOL/Refute.thy" for details.
5047 * 'quickcheck' command: Allows to find counterexamples by evaluating
5048 formulae under an assignment of free variables to random values.
5049 In contrast to 'refute', it can deal with inductive datatypes,
5050 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
5056 * Streams now come with concatenation and are part of the HOLCF image
5060 New in Isabelle2003 (May 2003)
5061 ------------------------------
5065 * Provers/simplifier:
5067 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
5068 Assumptions are now subject to complete mutual simplification,
5069 not just from left to right. The simplifier now preserves
5070 the order of assumptions.
5072 Potential INCOMPATIBILITY:
5074 -- simp sometimes diverges where the old version did
5075 not, e.g. invoking simp on the goal
5077 [| P (f x); y = x; f x = f y |] ==> Q
5079 now gives rise to the infinite reduction sequence
5081 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
5083 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
5086 -- Tactics combining classical reasoner and simplification (such as auto)
5087 are also affected by this change, because many of them rely on
5088 simp. They may sometimes diverge as well or yield a different numbers
5089 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
5090 in case of problems. Sometimes subsequent calls to the classical
5091 reasoner will fail because a preceeding call to the simplifier too
5092 eagerly simplified the goal, e.g. deleted redundant premises.
5094 - The simplifier trace now shows the names of the applied rewrite rules
5096 - You can limit the number of recursive invocations of the simplifier
5097 during conditional rewriting (where the simplifie tries to solve the
5098 conditions before applying the rewrite rule):
5099 ML "simp_depth_limit := n"
5100 where n is an integer. Thus you can force termination where previously
5101 the simplifier would diverge.
5103 - Accepts free variables as head terms in congruence rules. Useful in Isar.
5105 - No longer aborts on failed congruence proof. Instead, the
5106 congruence is ignored.
5108 * Pure: New generic framework for extracting programs from constructive
5109 proofs. See HOL/Extraction.thy for an example instantiation, as well
5110 as HOL/Extraction for some case studies.
5112 * Pure: The main goal of the proof state is no longer shown by default, only
5113 the subgoals. This behaviour is controlled by a new flag.
5114 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
5115 (ML: Proof.show_main_goal).
5117 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
5118 rules whose conclusion matches subgoal 1:
5119 PG menu: Isabelle/Isar -> Show me -> matching rules
5120 The rules are ordered by how closely they match the subgoal.
5121 In particular, rules that solve a subgoal outright are displayed first
5122 (or rather last, the way they are printed).
5123 (ML: ProofGeneral.print_intros())
5125 * Pure: New flag trace_unify_fail causes unification to print
5126 diagnostic information (PG: in trace buffer) when it fails. This is
5127 useful for figuring out why single step proofs like rule, erule or
5130 * Pure: Locale specifications now produce predicate definitions
5131 according to the body of text (covering assumptions modulo local
5132 definitions); predicate "loc_axioms" covers newly introduced text,
5133 while "loc" is cumulative wrt. all included locale expressions; the
5134 latter view is presented only on export into the global theory
5135 context; potential INCOMPATIBILITY, use "(open)" option to fall back
5136 on the old view without predicates;
5138 * Pure: predefined locales "var" and "struct" are useful for sharing
5139 parameters (as in CASL, for example); just specify something like
5140 ``var x + var y + struct M'' as import;
5142 * Pure: improved thms_containing: proper indexing of facts instead of
5143 raw theorems; check validity of results wrt. current name space;
5144 include local facts of proof configuration (also covers active
5145 locales), cover fixed variables in index; may use "_" in term
5146 specification; an optional limit for the number of printed facts may
5147 be given (the default is 40);
5149 * Pure: disallow duplicate fact bindings within new-style theory files
5152 * Provers: improved induct method: assumptions introduced by case
5153 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
5154 the goal statement); "foo" still refers to all facts collectively;
5156 * Provers: the function blast.overloaded has been removed: all constants
5157 are regarded as potentially overloaded, which improves robustness in exchange
5158 for slight decrease in efficiency;
5160 * Provers/linorder: New generic prover for transitivity reasoning over
5161 linear orders. Note: this prover is not efficient!
5163 * Isar: preview of problems to finish 'show' now produce an error
5164 rather than just a warning (in interactive mode);
5171 - Produces a counter example if it cannot prove a goal.
5172 Note that the counter example may be spurious if the goal is not a formula
5173 of quantifier-free linear arithmetic.
5174 In ProofGeneral the counter example appears in the trace buffer.
5176 - Knows about div k and mod k where k is a numeral of type nat or int.
5178 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
5179 linear arithmetic fails. This takes account of quantifiers and divisibility.
5180 Presburger arithmetic can also be called explicitly via presburger(_tac).
5182 * simp's arithmetic capabilities have been enhanced a bit: it now
5183 takes ~= in premises into account (by performing a case split);
5185 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
5186 are distributed over a sum of terms;
5188 * New tactic "trans_tac" and method "trans" instantiate
5189 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
5192 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
5193 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
5195 * 'typedef' command has new option "open" to suppress the set
5198 * functions Min and Max on finite sets have been introduced (theory
5201 * attribute [symmetric] now works for relations as well; it turns
5202 (x,y) : R^-1 into (y,x) : R, and vice versa;
5204 * induct over a !!-quantified statement (say !!x1..xn):
5205 each "case" automatically performs "fix x1 .. xn" with exactly those names.
5207 * Map: `empty' is no longer a constant but a syntactic abbreviation for
5208 %x. None. Warning: empty_def now refers to the previously hidden definition
5211 * Algebra: formalization of classical algebra. Intended as base for
5212 any algebraic development in Isabelle. Currently covers group theory
5213 (up to Sylow's theorem) and ring theory (Universal Property of
5214 Univariate Polynomials). Contributions welcome;
5216 * GroupTheory: deleted, since its material has been moved to Algebra;
5218 * Complex: new directory of the complex numbers with numeric constants,
5219 nonstandard complex numbers, and some complex analysis, standard and
5220 nonstandard (Jacques Fleuriot);
5222 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
5224 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
5227 * Real/HahnBanach: updated and adapted to locales;
5229 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
5232 * UNITY: added the Meier-Sanders theory of progress sets;
5234 * MicroJava: bytecode verifier and lightweight bytecode verifier
5235 as abstract algorithms, instantiated to the JVM;
5237 * Bali: Java source language formalization. Type system, operational
5238 semantics, axiomatic semantics. Supported language features:
5239 classes, interfaces, objects,virtual methods, static methods,
5240 static/instance fields, arrays, access modifiers, definite
5241 assignment, exceptions.
5246 * ZF/Constructible: consistency proof for AC (Gdel's constructible
5249 * Main ZF: virtually all theories converted to new-style format;
5254 * Pure: Tactic.prove provides sane interface for internal proofs;
5255 omits the infamous "standard" operation, so this is more appropriate
5256 than prove_goalw_cterm in many situations (e.g. in simprocs);
5258 * Pure: improved error reporting of simprocs;
5260 * Provers: Simplifier.simproc(_i) provides sane interface for setting
5264 *** Document preparation ***
5266 * uses \par instead of \\ for line breaks in theory text. This may
5267 shift some page breaks in large documents. To get the old behaviour
5268 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
5270 * minimized dependencies of isabelle.sty and isabellesym.sty on
5273 * \<euro> now needs package babel/greek instead of marvosym (which
5276 * normal size for \<zero>...\<nine> (uses \mathbf instead of
5281 New in Isabelle2002 (March 2002)
5282 --------------------------------
5284 *** Document preparation ***
5286 * greatly simplified document preparation setup, including more
5287 graceful interpretation of isatool usedir -i/-d/-D options, and more
5288 instructive isatool mkdir; users should basically be able to get
5289 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5290 users may run a separate document processing stage manually like this:
5291 "isatool usedir -D output HOL Test && isatool document Test/output";
5293 * theory dependency graph may now be incorporated into documents;
5294 isatool usedir -g true will produce session_graph.eps/.pdf for use
5295 with \includegraphics of LaTeX;
5297 * proper spacing of consecutive markup elements, especially text
5298 blocks after section headings;
5300 * support bold style (for single symbols only), input syntax is like
5301 this: "\<^bold>\<alpha>" or "\<^bold>A";
5303 * \<bullet> is now output as bold \cdot by default, which looks much
5304 better in printed text;
5306 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
5307 note that these symbols are currently unavailable in Proof General /
5308 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
5310 * isatool latex no longer depends on changed TEXINPUTS, instead
5311 isatool document copies the Isabelle style files to the target
5317 * Pure/Provers: improved proof by cases and induction;
5318 - 'case' command admits impromptu naming of parameters (such as
5320 - 'induct' method divinates rule instantiation from the inductive
5321 claim; no longer requires excessive ?P bindings for proper
5322 instantiation of cases;
5323 - 'induct' method properly enumerates all possibilities of set/type
5324 rules; as a consequence facts may be also passed through *type*
5325 rules without further ado;
5326 - 'induct' method now derives symbolic cases from the *rulified*
5327 rule (before it used to rulify cases stemming from the internal
5328 atomized version); this means that the context of a non-atomic
5329 statement becomes is included in the hypothesis, avoiding the
5330 slightly cumbersome show "PROP ?case" form;
5331 - 'induct' may now use elim-style induction rules without chaining
5332 facts, using ``missing'' premises from the goal state; this allows
5333 rules stemming from inductive sets to be applied in unstructured
5334 scripts, while still benefitting from proper handling of non-atomic
5335 statements; NB: major inductive premises need to be put first, all
5336 the rest of the goal is passed through the induction;
5337 - 'induct' proper support for mutual induction involving non-atomic
5338 rule statements (uses the new concept of simultaneous goals, see
5340 - append all possible rule selections, but only use the first
5341 success (no backtracking);
5342 - removed obsolete "(simplified)" and "(stripped)" options of methods;
5343 - undeclared rule case names default to numbers 1, 2, 3, ...;
5344 - added 'print_induct_rules' (covered by help item in recent Proof
5346 - moved induct/cases attributes to Pure, methods to Provers;
5347 - generic method setup instantiated for FOL and HOL;
5349 * Pure: support multiple simultaneous goal statements, for example
5350 "have a: A and b: B" (same for 'theorem' etc.); being a pure
5351 meta-level mechanism, this acts as if several individual goals had
5352 been stated separately; in particular common proof methods need to be
5353 repeated in order to cover all claims; note that a single elimination
5354 step is *not* sufficient to establish the two conjunctions, so this
5357 assume "A & B" then have A and B .. (*".." fails*)
5359 better use "obtain" in situations as above; alternative refer to
5360 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
5362 * Pure: proper integration with ``locales''; unlike the original
5363 version by Florian Kammller, Isar locales package high-level proof
5364 contexts rather than raw logical ones (e.g. we admit to include
5365 attributes everywhere); operations on locales include merge and
5366 rename; support for implicit arguments (``structures''); simultaneous
5367 type-inference over imports and text; see also HOL/ex/Locales.thy for
5370 * Pure: the following commands have been ``localized'', supporting a
5371 target locale specification "(in name)": 'lemma', 'theorem',
5372 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
5373 stored both within the locale and at the theory level (exported and
5374 qualified by the locale name);
5376 * Pure: theory goals may now be specified in ``long'' form, with
5377 ad-hoc contexts consisting of arbitrary locale elements. for example
5378 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
5379 definitions may be given, too); the result is a meta-level rule with
5380 the context elements being discharged in the obvious way;
5382 * Pure: new proof command 'using' allows to augment currently used
5383 facts after a goal statement ('using' is syntactically analogous to
5384 'apply', but acts on the goal's facts only); this allows chained facts
5385 to be separated into parts given before and after a claim, as in
5386 ``from a and b have C using d and e <proof>'';
5388 * Pure: renamed "antecedent" case to "rule_context";
5390 * Pure: new 'judgment' command records explicit information about the
5391 object-logic embedding (used by several tools internally); no longer
5392 use hard-wired "Trueprop";
5394 * Pure: added 'corollary' command;
5396 * Pure: fixed 'token_translation' command;
5398 * Pure: removed obsolete 'exported' attribute;
5400 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5401 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5402 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5404 * Pure: method 'atomize' presents local goal premises as object-level
5405 statements (atomic meta-level propositions); setup controlled via
5406 rewrite rules declarations of 'atomize' attribute; example
5407 application: 'induct' method with proper rule statements in improper
5410 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5411 now consider the syntactic context of assumptions, giving a better
5412 chance to get type-inference of the arguments right (this is
5413 especially important for locales);
5415 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5418 * Pure/obtain: the formal conclusion "thesis", being marked as
5419 ``internal'', may no longer be reference directly in the text;
5420 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5423 * Pure: generic 'sym' attribute which declares a rule both as pure
5424 'elim?' and for the 'symmetric' operation;
5426 * Pure: marginal comments ``--'' may now occur just anywhere in the
5427 text; the fixed correlation with particular command syntax has been
5430 * Pure: new method 'rules' is particularly well-suited for proof
5431 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5432 but often produces more compact proof terms with less detours;
5434 * Pure/Provers/classical: simplified integration with pure rule
5435 attributes and methods; the classical "intro?/elim?/dest?"
5436 declarations coincide with the pure ones; the "rule" method no longer
5437 includes classically swapped intros; "intro" and "elim" methods no
5438 longer pick rules from the context; also got rid of ML declarations
5439 AddXIs/AddXEs/AddXDs; all of this has some potential for
5442 * Provers/classical: attribute 'swapped' produces classical inversions
5443 of introduction rules;
5445 * Provers/simplifier: 'simplified' attribute may refer to explicit
5446 rules instead of full simplifier context; 'iff' attribute handles
5449 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
5451 * HOL: 'recdef' now fails on unfinished automated proofs, use
5452 "(permissive)" option to recover old behavior;
5454 * HOL: 'inductive' no longer features separate (collective) attributes
5455 for 'intros' (was found too confusing);
5457 * HOL: properly declared induction rules less_induct and
5463 * HOL: moved over to sane numeral syntax; the new policy is as
5466 - 0 and 1 are polymorphic constants, which are defined on any
5467 numeric type (nat, int, real etc.);
5469 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5470 binary representation internally;
5472 - type nat has special constructor Suc, and generally prefers Suc 0
5473 over 1::nat and Suc (Suc 0) over 2::nat;
5475 This change may cause significant problems of INCOMPATIBILITY; here
5476 are some hints on converting existing sources:
5478 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5479 entities, so expressions involving "-" (unary or binary minus) need
5480 to be spaced properly;
5482 - existing occurrences of "1" may need to be constraint "1::nat" or
5483 even replaced by Suc 0; similar for old "2";
5485 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5487 - remove all special provisions on numerals in proofs;
5489 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5490 representation (depends on bin_arith_simps in the default context);
5492 * HOL: symbolic syntax for x^2 (numeral 2);
5494 * HOL: the class of all HOL types is now called "type" rather than
5495 "term"; INCOMPATIBILITY, need to adapt references to this type class
5496 in axclass/classes, instance/arities, and (usually rare) occurrences
5497 in typings (of consts etc.); internally the class is called
5498 "HOL.type", ML programs should refer to HOLogic.typeS;
5500 * HOL/record package improvements:
5501 - new derived operations "fields" to build a partial record section,
5502 "extend" to promote a fixed record to a record scheme, and
5503 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5504 declared as simp by default;
5505 - shared operations ("more", "fields", etc.) now need to be always
5506 qualified) --- potential INCOMPATIBILITY;
5507 - removed "make_scheme" operations (use "make" with "extend") --
5509 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5510 - provides cases/induct rules for use with corresponding Isar
5511 methods (for concrete records, record schemes, concrete more
5512 parts, and schematic more parts -- in that order);
5513 - internal definitions directly based on a light-weight abstract
5514 theory of product types over typedef rather than datatype;
5516 * HOL: generic code generator for generating executable ML code from
5517 specifications; specific support for HOL constructs such as inductive
5518 datatypes and sets, as well as recursive functions; can be invoked
5519 via 'generate_code' theory section;
5521 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5523 * HOL: consolidated and renamed several theories. In particular:
5524 Ord.thy has been absorbed into HOL.thy
5525 String.thy has been absorbed into List.thy
5527 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5528 (beware of argument permutation!);
5530 * HOL: linorder_less_split superseded by linorder_cases;
5532 * HOL/List: "nodups" renamed to "distinct";
5534 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5535 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5536 - Ex_def has changed, now need to use some_eq_ex
5538 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5539 in this (rare) case use:
5541 delSWrapper "split_all_tac"
5542 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5544 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5547 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5548 Isabelle's type classes, ^ on functions and relations has too general
5549 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5550 necessary to attach explicit type constraints;
5552 * HOL/Relation: the prefix name of the infix "O" has been changed from
5553 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5554 renamed accordingly (eg "compI" -> "rel_compI").
5556 * HOL: syntax translations now work properly with numerals and records
5559 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5560 of "lam" -- INCOMPATIBILITY;
5562 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5563 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5564 renamed "Product_Type.unit";
5566 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5568 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5569 the "cases" method);
5571 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5574 * HOL/IMP: updated and converted to new-style theory format; several
5575 parts turned into readable document, with proper Isar proof texts and
5576 some explanations (by Gerwin Klein);
5578 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5580 * HOL-Hyperreal is now a logic image;
5585 * Isar: consts/constdefs supports mixfix syntax for continuous
5588 * Isar: domain package adapted to new-style theory format, e.g. see
5591 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5592 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5593 lift.induct_tac, always use UU instead of Undef;
5595 * HOLCF/IMP: updated and converted to new-style theory;
5600 * Isar: proper integration of logic-specific tools and packages,
5601 including theory commands '(co)inductive', '(co)datatype',
5602 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5603 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5605 * theory Main no longer includes AC; for the Axiom of Choice, base
5606 your theory on Main_ZFC;
5608 * the integer library now covers quotients and remainders, with many
5609 laws relating division to addition, multiplication, etc.;
5611 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5612 typeless version of the formalism;
5614 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5617 * ZF/Induct: new directory for examples of inductive definitions,
5618 including theory Multiset for multiset orderings; converted to
5619 new-style theory format;
5621 * ZF: many new theorems about lists, ordinals, etc.;
5626 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5627 variable proof controls level of detail: 0 = no proofs (only oracle
5628 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5629 also ref manual for further ML interfaces;
5631 * Pure/axclass: removed obsolete ML interface
5632 goal_subclass/goal_arity;
5634 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5635 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5636 separate tokens, so expressions involving minus need to be spaced
5639 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5640 rather than "infixl" or "infixr";
5642 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5643 sort constraint specifications in type inference; e.g. "x::_::foo"
5644 ensures that the type of "x" is of sort "foo" (but not necessarily a
5647 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5648 control output of nested => (types); the default behavior is
5651 * Pure/syntax: builtin parse translation for "_constify" turns valued
5652 tokens into AST constants;
5654 * Pure/syntax: prefer later declarations of translations and print
5655 translation functions; potential INCOMPATIBILITY: need to reverse
5656 multiple declarations for same syntax element constant;
5658 * Pure/show_hyps reset by default (in accordance to existing Isar
5661 * Provers/classical: renamed addaltern to addafter, addSaltern to
5664 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5667 * system: tested support for MacOS X; should be able to get Isabelle +
5668 Proof General to work in a plain Terminal after installing Poly/ML
5669 (e.g. from the Isabelle distribution area) and GNU bash alone
5670 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5671 support requires further installations, e.g. from
5672 http://fink.sourceforge.net/);
5674 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5676 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5677 of 40 MB), cf. ML_OPTIONS;
5679 * system: Proof General keywords specification is now part of the
5680 Isabelle distribution (see etc/isar-keywords.el);
5682 * system: support for persistent Proof General sessions (refrain from
5683 outdating all loaded theories on startup); user may create writable
5684 logic images like this: ``isabelle -q HOL Test'';
5686 * system: smart selection of Isabelle process versus Isabelle
5687 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5688 run both "isabelle" and "Isabelle" even if file names are badly
5689 damaged (executable inspects the case of the first letter of its own
5690 name); added separate "isabelle-process" and "isabelle-interface";
5692 * system: refrain from any attempt at filtering input streams; no
5693 longer support ``8bit'' encoding of old isabelle font, instead proper
5694 iso-latin characters may now be used; the related isatools
5695 "symbolinput" and "nonascii" have disappeared as well;
5697 * system: removed old "xterm" interface (the print modes "xterm" and
5698 "xterm_color" are still available for direct use in a suitable
5703 New in Isabelle99-2 (February 2001)
5704 -----------------------------------
5706 *** Overview of INCOMPATIBILITIES ***
5708 * HOL: please note that theories in the Library and elsewhere often use the
5709 new-style (Isar) format; to refer to their theorems in an ML script you must
5710 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5712 * HOL: inductive package no longer splits induction rule aggressively,
5713 but only as far as specified by the introductions given; the old
5714 format may be recovered via ML function complete_split_rule or attribute
5715 'split_rule (complete)';
5717 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5718 gfp_Tarski to gfp_unfold;
5720 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5722 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5723 relation); infix "^^" has been renamed "``"; infix "``" has been
5724 renamed "`"; "univalent" has been renamed "single_valued";
5726 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5729 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5731 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5733 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5734 consequence, it is no longer monotonic wrt. the local goal context
5735 (which is now passed through the inductive cases);
5737 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5738 \<gg> to \<ggreater>;
5741 *** Document preparation ***
5743 * \isabellestyle{NAME} selects version of Isabelle output (currently
5744 available: are "it" for near math-mode best-style output, "sl" for
5745 slanted text style, and "tt" for plain type-writer; if no
5746 \isabellestyle command is given, output is according to slanted
5749 * support sub/super scripts (for single symbols only), input syntax is
5750 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5752 * some more standard symbols; see Appendix A of the system manual for
5753 the complete list of symbols defined in isabellesym.sty;
5755 * improved isabelle style files; more abstract symbol implementation
5756 (should now use \isamath{...} and \isatext{...} in custom symbol
5759 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5760 state; Note that presentation of goal states does not conform to
5761 actual human-readable proof documents. Please do not include goal
5762 states into document output unless you really know what you are doing!
5764 * proper indentation of antiquoted output with proportional LaTeX
5767 * no_document ML operator temporarily disables LaTeX document
5770 * isatool unsymbolize tunes sources for plain ASCII communication;
5775 * Pure: Isar now suffers initial goal statements to contain unbound
5776 schematic variables (this does not conform to actual readable proof
5777 documents, due to unpredictable outcome and non-compositional proof
5778 checking); users who know what they are doing may use schematic goals
5779 for Prolog-style synthesis of proven results;
5781 * Pure: assumption method (an implicit finishing) now handles actual
5784 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5785 initial goal, declare "that" only as Pure intro (only for single
5786 steps); the "that" rule assumption may now be involved in implicit
5787 finishing, thus ".." becomes a feasible for trivial obtains;
5789 * Pure: default proof step now includes 'intro_classes'; thus trivial
5790 instance proofs may be performed by "..";
5792 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5795 * Pure: more robust selection of calculational rules;
5797 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5798 rule (as well as the assumption rule);
5800 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5801 lemmas, using the graph browser tool;
5803 * Pure: predict failure of "show" in interactive mode;
5805 * Pure: 'thms_containing' now takes actual terms as arguments;
5807 * HOL: improved method 'induct' --- now handles non-atomic goals
5808 (potential INCOMPATIBILITY); tuned error handling;
5810 * HOL: cases and induct rules now provide explicit hints about the
5811 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5812 any remaining facts are inserted into the goal verbatim;
5814 * HOL: local contexts (aka cases) may now contain term bindings as
5815 well; the 'cases' and 'induct' methods new provide a ?case binding for
5816 the result to be shown in each case;
5818 * HOL: added 'recdef_tc' command;
5820 * isatool convert assists in eliminating legacy ML scripts;
5825 * HOL/Library: a collection of generic theories to be used together
5826 with main HOL; the theory loader path already includes this directory
5827 by default; the following existing theories have been moved here:
5828 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5829 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5831 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5832 modelling and verification task performed in Isabelle/HOL +
5833 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5835 * HOL/Algebra: special summation operator SUM no longer exists, it has
5836 been replaced by setsum; infix 'assoc' now has priority 50 (like
5837 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5838 'domain', this makes the theory consistent with mathematical
5841 * HOL basics: added overloaded operations "inverse" and "divide"
5842 (infix "/"), syntax for generic "abs" operation, generic summation
5845 * HOL/typedef: simplified package, provide more useful rules (see also
5848 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5849 now expressed as a proper nested rule (old-style tactic scripts may
5850 require atomize_strip_tac to cope with non-atomic premises);
5852 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5853 to "split_conv" (old name still available for compatibility);
5855 * HOL: improved concrete syntax for strings (e.g. allows translation
5856 rules with string literals);
5858 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5859 and Fleuriot's mechanization of analysis, including the transcendental
5860 functions for the reals;
5862 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5867 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5868 "lam" is displayed as TWO lambda-symbols
5870 * CTT: theory Main now available, containing everything (that is, Bool
5876 * Pure: the Simplifier has been implemented properly as a derived rule
5877 outside of the actual kernel (at last!); the overall performance
5878 penalty in practical applications is about 50%, while reliability of
5879 the Isabelle inference kernel has been greatly improved;
5881 * print modes "brackets" and "no_brackets" control output of nested =>
5882 (types) and ==> (props); the default behaviour is "brackets";
5884 * Provers: fast_tac (and friends) now handle actual object-logic rules
5885 as assumptions as well;
5887 * system: support Poly/ML 4.0;
5889 * system: isatool install handles KDE version 1 or 2;
5893 New in Isabelle99-1 (October 2000)
5894 ----------------------------------
5896 *** Overview of INCOMPATIBILITIES ***
5898 * HOL: simplification of natural numbers is much changed; to partly
5899 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5900 issue the following ML commands:
5902 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5903 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5905 * HOL: simplification no longer dives into case-expressions; this is
5906 controlled by "t.weak_case_cong" for each datatype t;
5908 * HOL: nat_less_induct renamed to less_induct;
5910 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5911 fixsome to patch .thy and .ML sources automatically;
5913 select_equality -> some_equality
5914 select_eq_Ex -> some_eq_ex
5915 selectI2EX -> someI2_ex
5918 select1_equality -> some1_equality
5919 Eps_sym_eq -> some_sym_eq_trivial
5920 Eps_eq -> some_eq_trivial
5922 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5924 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5927 * HOL: the recursion equations generated by 'recdef' are now called
5928 f.simps instead of f.rules;
5930 * HOL: qed_spec_mp now also handles bounded ALL as well;
5932 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5933 sometimes be needed;
5935 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5937 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5939 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5940 product is now "<*>" instead of "Times"; the lexicographic product is
5941 now "<*lex*>" instead of "**";
5943 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5944 of main HOL, but was unused); better use HOL's datatype package;
5946 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5947 the old syntax may be recovered as follows:
5950 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5951 (infixl "\\<oplus>" 100)
5953 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5955 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5956 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5959 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5960 changed from A/r to A//r;
5962 * ZF: new treatment of arithmetic (nat & int) may break some old
5965 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5966 rulify -> rule_format, elimify -> elim_format, ...);
5968 * Isar/Provers: intro/elim/dest attributes changed; renamed
5969 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5970 should have to change intro!! to intro? only); replaced "delrule" by
5973 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5975 * Provers: strengthened force_tac by using new first_best_tac;
5977 * LaTeX document preparation: several changes of isabelle.sty (see
5981 *** Document preparation ***
5983 * formal comments (text blocks etc.) in new-style theories may now
5984 contain antiquotations of thm/prop/term/typ/text to be presented
5985 according to latex print mode; concrete syntax is like this:
5986 @{term[show_types] "f(x) = a + x"};
5988 * isatool mkdir provides easy setup of Isabelle session directories,
5989 including proper document sources;
5991 * generated LaTeX sources are now deleted after successful run
5992 (isatool document -c); may retain a copy somewhere else via -D option
5995 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5996 style files, achieving self-contained LaTeX sources and simplifying
5999 * old-style theories now produce (crude) LaTeX output as well;
6001 * browser info session directories are now self-contained (may be put
6002 on WWW server seperately); improved graphs of nested sessions; removed
6003 graph for 'all sessions';
6005 * several improvements in isabelle style files; \isabellestyle{it}
6006 produces fake math mode output; \isamarkupheader is now \section by
6007 default; see lib/texinputs/isabelle.sty etc.;
6012 * Isar/Pure: local results and corresponding term bindings are now
6013 subject to Hindley-Milner polymorphism (similar to ML); this
6014 accommodates incremental type-inference very nicely;
6016 * Isar/Pure: new derived language element 'obtain' supports
6017 generalized existence reasoning;
6019 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
6020 support accumulation of results, without applying any rules yet;
6021 useful to collect intermediate results without explicit name
6022 references, and for use with transitivity rules with more than 2
6025 * Isar/Pure: scalable support for case-analysis type proofs: new
6026 'case' language element refers to local contexts symbolically, as
6027 produced by certain proof methods; internally, case names are attached
6028 to theorems as "tags";
6030 * Isar/Pure: theory command 'hide' removes declarations from
6031 class/type/const name spaces;
6033 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
6034 indicate potential overloading;
6036 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
6038 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
6039 "{a,b,c}" instead of {a,b,c};
6041 * Isar/Pure now provides its own version of intro/elim/dest
6042 attributes; useful for building new logics, but beware of confusion
6043 with the version in Provers/classical;
6045 * Isar/Pure: the local context of (non-atomic) goals is provided via
6046 case name 'antecedent';
6048 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
6049 to the current context is now done automatically);
6051 * Isar/Pure: theory command 'method_setup' provides a simple interface
6052 for definining proof methods in ML;
6054 * Isar/Provers: intro/elim/dest attributes changed; renamed
6055 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
6056 most cases, one should have to change intro!! to intro? only);
6057 replaced "delrule" by "rule del";
6059 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
6060 'symmetric' attribute (the latter supercedes [RS sym]);
6062 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
6063 method modifier); 'simp' method: 'only:' modifier removes loopers as
6064 well (including splits);
6066 * Isar/Provers: Simplifier and Classical methods now support all kind
6067 of modifiers used in the past, including 'cong', 'iff', etc.
6069 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
6070 of Simplifier and Classical reasoner);
6072 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
6073 now support named cases; major packages (inductive, datatype, primrec,
6074 recdef) support case names and properly name parameters;
6076 * Isar/HOL: new transitivity rules for substitution in inequalities --
6077 monotonicity conditions are extracted to be proven at end of
6080 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
6083 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
6084 split_if split_if_asm; datatype package provides theorems foo.splits =
6085 foo.split foo.split_asm for each datatype;
6087 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
6088 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
6089 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
6090 use "(cases (simplified))" method in proper proof texts);
6092 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
6094 * Isar: names of theorems etc. may be natural numbers as well;
6096 * Isar: 'pr' command: optional arguments for goals_limit and
6097 ProofContext.prems_limit; no longer prints theory contexts, but only
6100 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
6101 additional print modes to be specified; e.g. "pr(latex)" will print
6102 proof state according to the Isabelle LaTeX style;
6104 * Isar: improved support for emulating tactic scripts, including proof
6105 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
6106 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
6107 (for HOL datatypes);
6109 * Isar: simplified (more robust) goal selection of proof methods: 1st
6110 goal, all goals, or explicit goal specifier (tactic emulation); thus
6111 'proof method scripts' have to be in depth-first order;
6113 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
6115 * Isar: removed 'help' command, which hasn't been too helpful anyway;
6116 should instead use individual commands for printing items
6117 (print_commands, print_methods etc.);
6119 * Isar: added 'nothing' --- the empty list of theorems;
6124 * HOL/MicroJava: formalization of a fragment of Java, together with a
6125 corresponding virtual machine and a specification of its bytecode
6126 verifier and a lightweight bytecode verifier, including proofs of
6127 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
6128 Cornelia Pusch (see also the homepage of project Bali at
6129 http://isabelle.in.tum.de/Bali/);
6131 * HOL/Algebra: new theory of rings and univariate polynomials, by
6134 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
6135 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
6138 * HOL/Lattice: fundamental concepts of lattice theory and order
6139 structures, including duals, properties of bounds versus algebraic
6140 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
6141 Theorem for complete lattices etc.; may also serve as a demonstration
6142 for abstract algebraic reasoning using axiomatic type classes, and
6143 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
6145 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
6148 * HOL/IMPP: extension of IMP with local variables and mutually
6149 recursive procedures, by David von Oheimb;
6151 * HOL/Lambda: converted into new-style theory and document;
6153 * HOL/ex/Multiquote: example of multiple nested quotations and
6154 anti-quotations -- basically a generalized version of de-Bruijn
6155 representation; very useful in avoiding lifting of operations;
6157 * HOL/record: added general record equality rule to simpset; fixed
6158 select-update simplification procedure to handle extended records as
6159 well; admit "r" as field name;
6161 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
6162 other numeric types and also as the identity of groups, rings, etc.;
6164 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
6165 Types nat and int belong to this axclass;
6167 * HOL: greatly improved simplification involving numerals of type nat, int, real:
6168 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
6169 i*j + k + j*#3*i simplifies to #4*(i*j) + k
6170 two terms #m*u and #n*u are replaced by #(m+n)*u
6171 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
6172 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
6173 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
6175 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
6176 powerful prover for predicate logic but knows nothing of clasets; see
6177 ex/mesontest.ML and ex/mesontest2.ML for example applications;
6179 * HOL: new version of "case_tac" subsumes both boolean case split and
6180 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
6181 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
6183 * HOL: simplification no longer dives into case-expressions: only the
6184 selector expression is simplified, but not the remaining arms; to
6185 enable full simplification of case-expressions for datatype t, you may
6186 remove t.weak_case_cong from the simpset, either globally (Delcongs
6187 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
6189 * HOL/recdef: the recursion equations generated by 'recdef' for
6190 function 'f' are now called f.simps instead of f.rules; if all
6191 termination conditions are proved automatically, these simplification
6192 rules are added to the simpset, as in primrec; rules may be named
6193 individually as well, resulting in a separate list of theorems for
6196 * HOL/While is a new theory that provides a while-combinator. It
6197 permits the definition of tail-recursive functions without the
6198 provision of a termination measure. The latter is necessary once the
6199 invariant proof rule for while is applied.
6201 * HOL: new (overloaded) notation for the set of elements below/above
6202 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
6204 * HOL: theorems impI, allI, ballI bound as "strip";
6206 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
6207 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
6208 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
6210 * HOL/Real: "rabs" replaced by overloaded "abs" function;
6212 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
6213 main HOL, but was unused);
6215 * HOL: fewer consts declared as global (e.g. have to refer to
6216 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
6218 * HOL: tuned AST representation of nested pairs, avoiding bogus output
6219 in case of overlap with user translations (e.g. judgements over
6220 tuples); (note that the underlying logical represenation is still
6226 * ZF: simplification automatically cancels common terms in arithmetic
6227 expressions over nat and int;
6229 * ZF: new treatment of nat to minimize type-checking: all operators
6230 coerce their operands to a natural number using the function natify,
6231 making the algebraic laws unconditional;
6233 * ZF: as above, for int: operators coerce their operands to an integer
6234 using the function intify;
6236 * ZF: the integer library now contains many of the usual laws for the
6237 orderings, including $<=, and monotonicity laws for $+ and $*;
6239 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
6242 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
6243 to the simplifier and classical reasoner simultaneously;
6248 * Provers: blast_tac now handles actual object-logic rules as
6249 assumptions; note that auto_tac uses blast_tac internally as well;
6251 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
6252 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
6254 * Provers: delrules now handles destruct rules as well (no longer need
6255 explicit make_elim);
6257 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
6258 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6259 use instead the strong form,
6260 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6261 in HOL, FOL and ZF the function cla_make_elim will create such rules
6262 from destruct-rules;
6264 * Provers: Simplifier.easy_setup provides a fast path to basic
6265 Simplifier setup for new object-logics;
6267 * Pure: AST translation rules no longer require constant head on LHS;
6269 * Pure: improved name spaces: ambiguous output is qualified; support
6270 for hiding of names;
6272 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
6273 XSYMBOL_HOME; no longer need to do manual configuration in most
6276 * system: compression of ML heaps images may now be controlled via -c
6277 option of isabelle and isatool usedir (currently only observed by
6280 * system: isatool installfonts may handle X-Symbol fonts as well (very
6281 useful for remote X11);
6283 * system: provide TAGS file for Isabelle sources;
6285 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6288 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6289 timing flag supersedes proof_timing and Toplevel.trace;
6291 * ML: new combinators |>> and |>>> for incremental transformations
6292 with secondary results (e.g. certain theory extensions):
6294 * ML: PureThy.add_defs gets additional argument to indicate potential
6295 overloading (usually false);
6297 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
6302 New in Isabelle99 (October 1999)
6303 --------------------------------
6305 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6307 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
6308 are no longer simplified. (This allows the simplifier to unfold recursive
6309 functional programs.) To restore the old behaviour, declare
6311 Delcongs [if_weak_cong];
6313 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
6316 * HOL: the predicate "inj" is now defined by translation to "inj_on";
6318 * HOL/datatype: mutual_induct_tac no longer exists --
6319 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
6321 * HOL/typedef: fixed type inference for representing set; type
6322 arguments now have to occur explicitly on the rhs as type constraints;
6324 * ZF: The con_defs part of an inductive definition may no longer refer
6325 to constants declared in the same theory;
6327 * HOL, ZF: the function mk_cases, generated by the inductive
6328 definition package, has lost an argument. To simplify its result, it
6329 uses the default simpset instead of a supplied list of theorems.
6331 * HOL/List: the constructors of type list are now Nil and Cons;
6333 * Simplifier: the type of the infix ML functions
6334 setSSolver addSSolver setSolver addSolver
6335 is now simpset * solver -> simpset where `solver' is a new abstract type
6336 for packaging solvers. A solver is created via
6337 mk_solver: string -> (thm list -> int -> tactic) -> solver
6338 where the string argument is only a comment.
6343 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
6344 decision procedure for linear arithmetic. Currently it is used for
6345 types `nat', `int', and `real' in HOL (see below); it can, should and
6346 will be instantiated for other types and logics as well.
6348 * The simplifier now accepts rewrite rules with flexible heads, eg
6349 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
6350 They are applied like any rule with a non-pattern lhs, i.e. by first-order
6356 * New Isabelle/Isar subsystem provides an alternative to traditional
6357 tactical theorem proving; together with the ProofGeneral/isar user
6358 interface it offers an interactive environment for developing human
6359 readable proof documents (Isar == Intelligible semi-automated
6360 reasoning); for further information see isatool doc isar-ref,
6361 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
6363 * improved and simplified presentation of theories: better HTML markup
6364 (including colors), graph views in several sizes; isatool usedir now
6365 provides a proper interface for user theories (via -P option); actual
6366 document preparation based on (PDF)LaTeX is available as well (for
6367 new-style theories only); see isatool doc system for more information;
6369 * native support for Proof General, both for classic Isabelle and
6372 * ML function thm_deps visualizes dependencies of theorems and lemmas,
6373 using the graph browser tool;
6375 * Isabelle manuals now also available as PDF;
6377 * theory loader rewritten from scratch (may not be fully
6378 bug-compatible); old loadpath variable has been replaced by show_path,
6379 add_path, del_path, reset_path functions; new operations such as
6380 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
6383 * improved isatool install: option -k creates KDE application icon,
6384 option -p DIR installs standalone binaries;
6386 * added ML_PLATFORM setting (useful for cross-platform installations);
6387 more robust handling of platform specific ML images for SML/NJ;
6389 * the settings environment is now statically scoped, i.e. it is never
6390 created again in sub-processes invoked from isabelle, isatool, or
6393 * path element specification '~~' refers to '$ISABELLE_HOME';
6395 * in locales, the "assumes" and "defines" parts may be omitted if
6398 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6401 * new print_mode "HTML";
6403 * new flag show_tags controls display of tags of theorems (which are
6404 basically just comments that may be attached by some tools);
6406 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6407 mode and goal output format:
6409 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6411 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6413 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6414 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6416 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6418 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6420 * function bind_thms stores lists of theorems (cf. bind_thm);
6422 * new shorthand tactics ftac, eatac, datac, fatac;
6424 * qed (and friends) now accept "" as result name; in that case the
6425 theorem is not stored, but proper checks and presentation of the
6428 * theorem database now also indexes constants "Trueprop", "all",
6429 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
6434 ** HOL arithmetic **
6436 * There are now decision procedures for linear arithmetic over nat and
6439 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
6440 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
6441 are treated as atomic; subformulae not involving type `nat' or `int'
6442 are ignored; quantified subformulae are ignored unless they are
6443 positive universal or negative existential. The tactic has to be
6444 invoked by hand and can be a little bit slow. In particular, the
6445 running time is exponential in the number of occurrences of `min' and
6446 `max', and `-' on `nat'.
6448 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
6449 (negated) (in)equalities among the premises and the conclusion into
6450 account (i.e. no compound formulae) and does not know about `min' and
6451 `max', and `-' on `nat'. It is fast and is used automatically by the
6454 NB: At the moment, these decision procedures do not cope with mixed
6455 nat/int formulae where the two parts interact, such as `m < n ==>
6458 * HOL/Numeral provides a generic theory of numerals (encoded
6459 efficiently as bit strings); setup for types nat/int/real is in place;
6460 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6461 int, existing theories and proof scripts may require a few additional
6464 * integer division and remainder can now be performed on constant
6467 * many properties of integer multiplication, division and remainder
6470 * An interface to the Stanford Validity Checker (SVC) is available through the
6471 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6472 are proved automatically. SVC must be installed separately, and its results
6473 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6474 invocation of the underlying oracle). For SVC see
6475 http://verify.stanford.edu/SVC
6477 * IsaMakefile: the HOL-Real target now builds an actual image;
6482 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6483 (in Isabelle/Isar) -- by Gertrud Bauer;
6485 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6486 analysis for assembly languages with subtypes;
6488 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6489 -- avoids syntactic ambiguities and treats state, transition, and
6490 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6491 changed syntax and (many) tactics;
6493 * HOL/inductive: Now also handles more general introduction rules such
6494 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6495 theorems are now maintained within the theory (maintained via the
6498 * HOL/datatype: Now also handles arbitrarily branching datatypes
6499 (using function types) such as
6501 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6503 * HOL/record: record_simproc (part of the default simpset) takes care
6504 of selectors applied to updated records; record_split_tac is no longer
6505 part of the default claset; update_defs may now be removed from the
6506 simpset in many cases; COMPATIBILITY: old behavior achieved by
6508 claset_ref () := claset() addSWrapper record_split_wrapper;
6509 Delsimprocs [record_simproc]
6511 * HOL/typedef: fixed type inference for representing set; type
6512 arguments now have to occur explicitly on the rhs as type constraints;
6514 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6515 names rather than an ML expression;
6517 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6518 supplied later. Program schemes can be defined, such as
6519 "While B C s = (if B s then While B C (C s) else s)"
6520 where the well-founded relation can be chosen after B and C have been given.
6522 * HOL/List: the constructors of type list are now Nil and Cons;
6523 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6524 course, ML tools referring to List.list.op # etc. have to be adapted;
6526 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6527 disabled by default; run isabelle with option -m HOL to get back to
6528 the original Gordon/HOL-style output;
6530 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6531 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6533 * HOL basic syntax simplified (more orthogonal): all variants of
6534 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6535 Eps operator is provided as well: "SOME x. P[x]";
6537 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6539 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6540 thus available for user theories;
6542 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6543 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6546 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6547 several times and then mp;
6552 * the notation <<...>> is now available as a notation for sequences of
6555 * the simplifier is now installed
6557 * the axiom system has been generalized (thanks to Soren Heilmann)
6559 * the classical reasoner now has a default rule database
6564 * new primrec section allows primitive recursive functions to be given
6565 directly (as in HOL) over datatypes and the natural numbers;
6567 * new tactics induct_tac and exhaust_tac for induction (or case
6568 analysis) over datatypes and the natural numbers;
6570 * the datatype declaration of type T now defines the recursor T_rec;
6572 * simplification automatically does freeness reasoning for datatype
6575 * automatic type-inference, with AddTCs command to insert new
6576 type-checking rules;
6578 * datatype introduction rules are now added as Safe Introduction rules
6581 * the syntax "if P then x else y" is now available in addition to
6585 *** Internal programming interfaces ***
6587 * tuned simplifier trace output; new flag debug_simp;
6589 * structures Vartab / Termtab (instances of TableFun) offer efficient
6590 tables indexed by indexname_ord / term_ord (compatible with aconv);
6592 * AxClass.axclass_tac lost the theory argument;
6594 * tuned current_goals_markers semantics: begin / end goal avoids
6595 printing empty lines;
6597 * removed prs and prs_fn hook, which was broken because it did not
6598 include \n in its semantics, forcing writeln to add one
6599 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6600 string -> unit if you really want to output text without newline;
6602 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6603 plain output, interface builders may have to enable 'isabelle_font'
6604 mode to get Isabelle font glyphs as before;
6606 * refined token_translation interface; INCOMPATIBILITY: output length
6607 now of type real instead of int;
6609 * theory loader actions may be traced via new ThyInfo.add_hook
6610 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6611 your own database of information attached to *whole* theories -- as
6612 opposed to intra-theory data slots offered via TheoryDataFun;
6614 * proper handling of dangling sort hypotheses (at last!);
6615 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6616 extra sort hypotheses that can be witnessed from the type signature;
6617 the force_strip_shyps flag is gone, any remaining shyps are simply
6618 left in the theorem (with a warning issued by strip_shyps_warning);
6622 New in Isabelle98-1 (October 1998)
6623 ----------------------------------
6625 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6627 * several changes of automated proof tools;
6629 * HOL: major changes to the inductive and datatype packages, including
6630 some minor incompatibilities of theory syntax;
6632 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6635 * HOL: removed duplicate thms in Arith:
6636 less_imp_add_less should be replaced by trans_less_add1
6637 le_imp_add_le should be replaced by trans_le_add1
6639 * HOL: unary minus is now overloaded (new type constraints may be
6642 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6643 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6644 now taken as an integer constant.
6646 * Pure: ML function 'theory_of' renamed to 'theory';
6652 1. Asm_full_simp_tac is now more aggressive.
6653 1. It will sometimes reorient premises if that increases their power to
6655 2. It does no longer proceed strictly from left to right but may also
6656 rotate premises to achieve further simplification.
6657 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6658 old Asm_full_simp_tac in that it does not rotate premises.
6659 2. The simplifier now knows a little bit about nat-arithmetic.
6661 * Classical reasoner: wrapper mechanism for the classical reasoner now
6662 allows for selected deletion of wrappers, by introduction of names for
6663 wrapper functionals. This implies that addbefore, addSbefore,
6664 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6665 and that adding two tactics with the same name overwrites the first
6666 one (emitting a warning).
6667 type wrapper = (int -> tactic) -> (int -> tactic)
6668 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6669 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6670 delWrapper, delSWrapper: claset * string -> claset
6671 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6673 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6674 semantics; addbefore now affects only the unsafe part of step_tac
6675 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6676 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6679 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6680 compWrapper; added safe wrapper (and access functions for it);
6682 * HOL/split_all_tac is now much faster and fails if there is nothing
6683 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6684 and the names of the automatically generated variables have changed.
6685 split_all_tac has moved within claset() from unsafe wrappers to safe
6686 wrappers, which means that !!-bound variables are split much more
6687 aggressively, and safe_tac and clarify_tac now split such variables.
6688 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6689 Note: the same holds for record_split_tac, which does the job of
6690 split_all_tac for record fields.
6692 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6693 permanently to the default simpset using Addsplits just like
6694 Addsimps. They can be removed via Delsplits just like
6695 Delsimps. Lower-case versions are also available.
6697 * HOL/Simplifier: The rule split_if is now part of the default
6698 simpset. This means that the simplifier will eliminate all occurrences
6699 of if-then-else in the conclusion of a goal. To prevent this, you can
6700 either remove split_if completely from the default simpset by
6701 `Delsplits [split_if]' or remove it in a specific call of the
6702 simplifier using `... delsplits [split_if]'. You can also add/delete
6703 other case splitting rules to/from the default simpset: every datatype
6704 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6705 t is the name of the datatype).
6707 * Classical reasoner / Simplifier combination: new force_tac (and
6708 derivatives Force_tac, force) combines rewriting and classical
6709 reasoning (and whatever other tools) similarly to auto_tac, but is
6710 aimed to solve the given subgoal completely.
6715 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6716 and `goalw': the theory is no longer needed as an explicit argument -
6717 the current theory context is used; assumptions are no longer returned
6718 at the ML-level unless one of them starts with ==> or !!; it is
6719 recommended to convert to these new commands using isatool fixgoal
6720 (backup your sources first!);
6722 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6723 the current theory context, and 'theory' to lookup stored theories;
6725 * new theory section 'locale' for declaring constants, assumptions and
6726 definitions that have local scope;
6728 * new theory section 'nonterminals' for purely syntactic types;
6730 * new theory section 'setup' for generic ML setup functions
6731 (e.g. package initialization);
6733 * the distribution now includes Isabelle icons: see
6734 lib/logo/isabelle-{small,tiny}.xpm;
6736 * isatool install - install binaries with absolute references to
6739 * isatool logo -- create instances of the Isabelle logo (as EPS);
6741 * print mode 'emacs' reserved for Isamode;
6743 * support multiple print (ast) translations per constant name;
6745 * theorems involving oracles are now printed with a suffixed [!];
6750 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6752 * HOL/inductive package reorganized and improved: now supports mutual
6758 oddI "n : EVEN ==> Suc n : ODD"
6759 evenI "n : ODD ==> Suc n : EVEN"
6761 new theorem list "elims" contains an elimination rule for each of the
6762 recursive sets; inductive definitions now handle disjunctive premises
6763 correctly (also ZF);
6765 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6766 "mutual_induct" no longer exists - the induction rule is always
6767 contained in "induct";
6770 * HOL/datatype package re-implemented and greatly improved: now
6771 supports mutually recursive datatypes such as
6774 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6775 | SUM ('a aexp) ('a aexp)
6776 | DIFF ('a aexp) ('a aexp)
6779 'a bexp = LESS ('a aexp) ('a aexp)
6780 | AND ('a bexp) ('a bexp)
6781 | OR ('a bexp) ('a bexp)
6783 as well as indirectly recursive datatypes such as
6786 ('a, 'b) term = Var 'a
6787 | App 'b ((('a, 'b) term) list)
6789 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6790 induction on mutually / indirectly recursive datatypes.
6792 Primrec equations are now stored in theory and can be accessed via
6793 <function_name>.simps.
6797 - Theories using datatypes must now have theory Datatype as an
6799 - The specific <typename>.induct_tac no longer exists - use the
6800 generic induct_tac instead.
6801 - natE has been renamed to nat.exhaust - use exhaust_tac
6802 instead of res_inst_tac ... natE. Note that the variable
6803 names in nat.exhaust differ from the names in natE, this
6804 may cause some "fragile" proofs to fail.
6805 - The theorems split_<typename>_case and split_<typename>_case_asm
6806 have been renamed to <typename>.split and <typename>.split_asm.
6807 - Since default sorts of type variables are now handled correctly,
6808 some datatype definitions may have to be annotated with explicit
6810 - Primrec definitions no longer require function name and type
6811 of recursive argument.
6813 Consider using isatool fixdatatype to adapt your theories and proof
6814 scripts to the new package (backup your sources first!).
6817 * HOL/record package: considerably improved implementation; now
6818 includes concrete syntax for record types, terms, updates; theorems
6819 for surjective pairing and splitting !!-bound record variables; proof
6820 support is as follows:
6822 1) standard conversions (selectors or updates applied to record
6823 constructor terms) are part of the standard simpset;
6825 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6826 made part of standard simpset and claset via addIffs;
6828 3) a tactic for record field splitting (record_split_tac) is part of
6829 the standard claset (addSWrapper);
6831 To get a better idea about these rules you may retrieve them via
6832 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6833 the name of your record type.
6835 The split tactic 3) conceptually simplifies by the following rule:
6837 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6839 Thus any record variable that is bound by meta-all will automatically
6840 blow up into some record constructor term, consequently the
6841 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6842 solve record problems automatically.
6845 * reorganized the main HOL image: HOL/Integ and String loaded by
6846 default; theory Main includes everything;
6848 * automatic simplification of integer sums and comparisons, using cancellation;
6850 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6852 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6854 * many new identities for unions, intersections, set difference, etc.;
6856 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6857 called split_if, split_split, split_sum_case and split_nat_case (to go
6858 with add/delsplits);
6860 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6861 (?x::unit) = (); this is made part of the default simpset, which COULD
6862 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6863 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6864 unit_abs_eta_conv is added in order to counter the effect of
6865 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6868 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6871 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6872 It and 'sym RS equals0D' are now in the default claset, giving automatic
6873 disjointness reasoning but breaking a few old proofs.
6875 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6876 to 'converse' from 'inverse' (for compatibility with ZF and some
6879 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6880 the well-founded relation;
6882 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6883 Compl A. The "Compl" syntax remains available as input syntax for this
6886 * HOL/Update: new theory of function updates:
6887 f(a:=b) == %x. if x=a then b else f x
6888 may also be iterated as in f(a:=b,c:=d,...);
6890 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6893 - new function list_update written xs[i:=v] that updates the i-th
6894 list position. May also be iterated as in xs[i:=a,j:=b,...].
6895 - new function `upt' written [i..j(] which generates the list
6896 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6897 bound write [i..j], which is a shorthand for [i..j+1(].
6898 - new lexicographic orderings and corresponding wellfoundedness theorems.
6901 - removed 'pred' (predecessor) function;
6902 - generalized some theorems about n-1;
6903 - many new laws about "div" and "mod";
6904 - new laws about greatest common divisors (see theory ex/Primes);
6906 * HOL/Relation: renamed the relational operator r^-1 "converse"
6907 instead of "inverse";
6909 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6910 of the multiset ordering;
6912 * directory HOL/Real: a construction of the reals using Dedekind cuts
6913 (not included by default);
6915 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6917 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6918 programs, i.e. different program variables may have different types.
6920 * calling (stac rew i) now fails if "rew" has no effect on the goal
6921 [previously, this check worked only if the rewrite rule was unconditional]
6922 Now rew can involve either definitions or equalities (either == or =).
6927 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6928 only the theorems proved on ZF.ML;
6930 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6931 It and 'sym RS equals0D' are now in the default claset, giving automatic
6932 disjointness reasoning but breaking a few old proofs.
6934 * ZF/Update: new theory of function updates
6935 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6936 may also be iterated as in f(a:=b,c:=d,...);
6938 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6940 * calling (stac rew i) now fails if "rew" has no effect on the goal
6941 [previously, this check worked only if the rewrite rule was unconditional]
6942 Now rew can involve either definitions or equalities (either == or =).
6944 * case_tac provided for compatibility with HOL
6945 (like the old excluded_middle_tac, but with subgoals swapped)
6948 *** Internal programming interfaces ***
6950 * Pure: several new basic modules made available for general use, see
6951 also src/Pure/README;
6953 * improved the theory data mechanism to support encapsulation (data
6954 kind name replaced by private Object.kind, acting as authorization
6955 key); new type-safe user interface via functor TheoryDataFun; generic
6956 print_data function becomes basically useless;
6958 * removed global_names compatibility flag -- all theory declarations
6959 are qualified by default;
6961 * module Pure/Syntax now offers quote / antiquote translation
6962 functions (useful for Hoare logic etc. with implicit dependencies);
6963 see HOL/ex/Antiquote for an example use;
6965 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6968 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6971 * Display.print_goals function moved to Locale.print_goals;
6973 * standard print function for goals supports current_goals_markers
6974 variable for marking begin of proof, end of proof, start of goal; the
6975 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6976 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6981 New in Isabelle98 (January 1998)
6982 --------------------------------
6984 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6986 * changed lexical syntax of terms / types: dots made part of long
6987 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6989 * simpset (and claset) reference variable replaced by functions
6990 simpset / simpset_ref;
6992 * no longer supports theory aliases (via merge) and non-trivial
6993 implicit merge of thms' signatures;
6995 * most internal names of constants changed due to qualified names;
6997 * changed Pure/Sequence interface (see Pure/seq.ML);
7000 *** General Changes ***
7002 * hierachically structured name spaces (for consts, types, axms, thms
7003 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
7004 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
7005 isatool fixdots ensures space after dots (e.g. "%x. x"); set
7006 long_names for fully qualified output names; NOTE: ML programs
7007 (special tactics, packages etc.) referring to internal names may have
7008 to be adapted to cope with fully qualified names; in case of severe
7009 backward campatibility problems try setting 'global_names' at compile
7010 time to have enrything declared within a flat name space; one may also
7011 fine tune name declarations in theories via the 'global' and 'local'
7014 * reimplemented the implicit simpset and claset using the new anytype
7015 data filed in signatures; references simpset:simpset ref etc. are
7016 replaced by functions simpset:unit->simpset and
7017 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
7018 to patch your ML files accordingly;
7020 * HTML output now includes theory graph data for display with Java
7021 applet or isatool browser; data generated automatically via isatool
7022 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
7024 * defs may now be conditional; improved rewrite_goals_tac to handle
7025 conditional equations;
7027 * defs now admits additional type arguments, using TYPE('a) syntax;
7029 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
7030 creates a new theory node; implicit merge of thms' signatures is
7031 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
7032 transfer:theory->thm->thm in (rare) cases;
7034 * improved handling of draft signatures / theories; draft thms (and
7035 ctyps, cterms) are automatically promoted to real ones;
7037 * slightly changed interfaces for oracles: admit many per theory, named
7038 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
7040 * print_goals: optional output of const types (set show_consts and
7043 * improved output of warnings (###) and errors (***);
7045 * subgoal_tac displays a warning if the new subgoal has type variables;
7047 * removed old README and Makefiles;
7049 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
7051 * removed obsolete init_pps and init_database;
7053 * deleted the obsolete tactical STATE, which was declared by
7054 fun STATE tacfun st = tacfun st st;
7056 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
7057 (which abbreviates $HOME);
7059 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
7060 use isatool fixseq to adapt your ML programs (this works for fully
7061 qualified references to the Sequence structure only!);
7063 * use_thy no longer requires writable current directory; it always
7064 reloads .ML *and* .thy file, if either one is out of date;
7067 *** Classical Reasoner ***
7069 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
7070 tactics that use classical reasoning to simplify a subgoal without
7071 splitting it into several subgoals;
7073 * Safe_tac: like safe_tac but uses the default claset;
7078 * added simplification meta rules:
7079 (asm_)(full_)simplify: simpset -> thm -> thm;
7081 * simplifier.ML no longer part of Pure -- has to be loaded by object
7084 * added prems argument to simplification procedures;
7086 * HOL, FOL, ZF: added infix function `addsplits':
7087 instead of `<simpset> setloop (split_tac <thms>)'
7088 you can simply write `<simpset> addsplits <thms>'
7093 * TYPE('a) syntax for type reflection terms;
7095 * no longer handles consts with name "" -- declare as 'syntax' instead;
7097 * pretty printer: changed order of mixfix annotation preference (again!);
7099 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
7104 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
7105 with `addloop' of the simplifier to faciliate case splitting in premises.
7107 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
7109 * HOL/Auth: new protocol proofs including some for the Internet
7112 * HOL/Map: new theory of `maps' a la VDM;
7114 * HOL/simplifier: simplification procedures nat_cancel_sums for
7115 cancelling out common nat summands from =, <, <= (in)equalities, or
7116 differences; simplification procedures nat_cancel_factor for
7117 cancelling common factor from =, <, <= (in)equalities over natural
7118 sums; nat_cancel contains both kinds of procedures, it is installed by
7119 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
7121 * HOL/simplifier: terms of the form
7122 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
7124 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
7125 and those of the form
7126 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
7128 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
7131 Each datatype `t' now comes with a theorem `split_t_case' of the form
7133 P(t_case f1 ... fn x) =
7134 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
7136 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
7139 and a theorem `split_t_case_asm' of the form
7141 P(t_case f1 ... fn x) =
7142 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
7144 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
7146 which can be added to a simpset via `addsplits'. The existing theorems
7147 expand_list_case and expand_option_case have been renamed to
7148 split_list_case and split_option_case.
7151 - `pred n' is automatically converted to `n-1'.
7152 Users are strongly encouraged not to use `pred' any longer,
7153 because it will disappear altogether at some point.
7154 - Users are strongly encouraged to write "0 < n" rather than
7155 "n ~= 0". Theorems and proof tools have been modified towards this
7159 the function "set_of_list" has been renamed "set" (and its theorems too);
7160 the function "nth" now takes its arguments in the reverse order and
7161 has acquired the infix notation "!" as in "xs!n".
7163 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
7165 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
7166 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
7168 * HOL/record: extensible records with schematic structural subtyping
7169 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
7170 still lacks various theorems and concrete record syntax;
7175 * removed "axioms" and "generated by" sections;
7177 * replaced "ops" section by extended "consts" section, which is capable of
7178 handling the continuous function space "->" directly;
7181 . proves theorems immediately and stores them in the theory,
7182 . creates hierachical name space,
7183 . now uses normal mixfix annotations (instead of cinfix...),
7184 . minor changes to some names and values (for consistency),
7185 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
7186 . separator between mutual domain defs: changed "," to "and",
7187 . improved handling of sort constraints; now they have to
7188 appear on the left-hand side of the equations only;
7190 * fixed LAM <x,y,zs>.b syntax;
7192 * added extended adm_tac to simplifier in HOLCF -- can now discharge
7193 adm (%x. P (t x)), where P is chainfinite and t continuous;
7198 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
7199 with `addloop' of the simplifier to faciliate case splitting in premises.
7201 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
7202 in HOL, they strip ALL and --> from proved theorems;
7206 New in Isabelle94-8 (May 1997)
7207 ------------------------------
7209 *** General Changes ***
7211 * new utilities to build / run / maintain Isabelle etc. (in parts
7212 still somewhat experimental); old Makefiles etc. still functional;
7214 * new 'Isabelle System Manual';
7216 * INSTALL text, together with ./configure and ./build scripts;
7218 * reimplemented type inference for greater efficiency, better error
7219 messages and clean internal interface;
7221 * prlim command for dealing with lots of subgoals (an easier way of
7222 setting goals_limit);
7227 * supports alternative (named) syntax tables (parser and pretty
7228 printer); internal interface is provided by add_modesyntax(_i);
7230 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
7231 be used in conjunction with the Isabelle symbol font; uses the
7232 "symbols" syntax table;
7234 * added token_translation interface (may translate name tokens in
7235 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
7236 the current print_mode); IMPORTANT: user print translation functions
7237 are responsible for marking newly introduced bounds
7238 (Syntax.mark_boundT);
7240 * token translations for modes "xterm" and "xterm_color" that display
7241 names in bold, underline etc. or colors (which requires a color
7244 * infixes may now be declared with names independent of their syntax;
7246 * added typed_print_translation (like print_translation, but may
7247 access type of constant);
7250 *** Classical Reasoner ***
7252 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
7253 some limitations. Blast_tac...
7254 + ignores addss, addbefore, addafter; this restriction is intrinsic
7255 + ignores elimination rules that don't have the correct format
7256 (the conclusion MUST be a formula variable)
7257 + ignores types, which can make HOL proofs fail
7258 + rules must not require higher-order unification, e.g. apply_type in ZF
7259 [message "Function Var's argument not a bound variable" relates to this]
7260 + its proof strategy is more general but can actually be slower
7262 * substitution with equality assumptions no longer permutes other
7265 * minor changes in semantics of addafter (now called addaltern); renamed
7266 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
7267 (and access functions for it);
7269 * improved combination of classical reasoner and simplifier:
7270 + functions for handling clasimpsets
7271 + improvement of addss: now the simplifier is called _after_ the
7273 + safe variant of addss called addSss: uses safe simplifications
7274 _during_ the safe steps. It is more complete as it allows multiple
7275 instantiations of unknowns (e.g. with slow_tac).
7279 * added interface for simplification procedures (functions that
7280 produce *proven* rewrite rules on the fly, depending on current
7283 * ordering on terms as parameter (used for ordered rewriting);
7285 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7287 * the solver is now split into a safe and an unsafe part.
7288 This should be invisible for the normal user, except that the
7289 functions setsolver and addsolver have been renamed to setSolver and
7290 addSolver; added safe_asm_full_simp_tac;
7295 * a generic induction tactic `induct_tac' which works for all datatypes and
7296 also for type `nat';
7298 * a generic case distinction tactic `exhaust_tac' which works for all
7299 datatypes and also for type `nat';
7301 * each datatype comes with a function `size';
7303 * patterns in case expressions allow tuple patterns as arguments to
7304 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
7306 * primrec now also works with type nat;
7308 * recdef: a new declaration form, allows general recursive functions to be
7309 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
7311 * the constant for negation has been renamed from "not" to "Not" to
7312 harmonize with FOL, ZF, LK, etc.;
7314 * HOL/ex/LFilter theory of a corecursive "filter" functional for
7317 * HOL/Modelcheck demonstrates invocation of model checker oracle;
7319 * HOL/ex/Ring.thy declares cring_simp, which solves equational
7320 problems in commutative rings, using axiomatic type classes for + and *;
7322 * more examples in HOL/MiniML and HOL/Auth;
7324 * more default rewrite rules for quantifiers, union/intersection;
7326 * a new constant `arbitrary == @x.False';
7328 * HOLCF/IOA replaces old HOL/IOA;
7330 * HOLCF changes: derived all rules and arities
7331 + axiomatic type classes instead of classes
7332 + typedef instead of faking type definitions
7333 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
7334 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
7335 + eliminated the types void, one, tr
7336 + use unit lift and bool lift (with translations) instead of one and tr
7337 + eliminated blift from Lift3.thy (use Def instead of blift)
7338 all eliminated rules are derived as theorems --> no visible changes ;
7343 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
7344 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
7345 as ZF_cs addSIs [equalityI];
7349 New in Isabelle94-7 (November 96)
7350 ---------------------------------
7352 * allowing negative levels (as offsets) in prlev and choplev;
7354 * super-linear speedup for large simplifications;
7356 * FOL, ZF and HOL now use miniscoping: rewriting pushes
7357 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
7358 FAIL); can suppress it using the command Delsimps (ex_simps @
7359 all_simps); De Morgan laws are also now included, by default;
7361 * improved printing of ==> : ~:
7363 * new object-logic "Sequents" adds linear logic, while replacing LK
7364 and Modal (thanks to Sara Kalvala);
7366 * HOL/Auth: correctness proofs for authentication protocols;
7368 * HOL: new auto_tac combines rewriting and classical reasoning (many
7369 examples on HOL/Auth);
7371 * HOL: new command AddIffs for declaring theorems of the form P=Q to
7372 the rewriter and classical reasoner simultaneously;
7374 * function uresult no longer returns theorems in "standard" format;
7375 regain previous version by: val uresult = standard o uresult;
7382 * oracles -- these establish an interface between Isabelle and trusted
7383 external reasoners, which may deliver results as theorems;
7385 * proof objects (in particular record all uses of oracles);
7387 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
7389 * "constdefs" section in theory files;
7391 * "primrec" section (HOL) no longer requires names;
7393 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7400 * reduced space requirements;
7402 * automatic HTML generation from theories;
7404 * theory files no longer require "..." (quotes) around most types;
7406 * new examples, including two proofs of the Church-Rosser theorem;
7408 * non-curried (1994) version of HOL is no longer distributed;
7415 * greatly reduced space requirements;
7417 * theory files (.thy) no longer require \...\ escapes at line breaks;
7419 * searchable theorem database (see the section "Retrieving theorems" on
7420 page 8 of the Reference Manual);
7422 * new examples, including Grabczewski's monumental case study of the
7425 * The previous version of HOL renamed to Old_HOL;
7427 * The new version of HOL (previously called CHOL) uses a curried syntax
7428 for functions. Application looks like f a b instead of f(a,b);
7430 * Mutually recursive inductive definitions finally work in HOL;
7432 * In ZF, pattern-matching on tuples is now available in all abstractions and
7433 translates to the operator "split";
7440 * new infix operator, addss, allowing the classical reasoner to
7441 perform simplification at each step of its search. Example:
7442 fast_tac (cs addss ss)
7444 * a new logic, CHOL, the same as HOL, but with a curried syntax
7445 for functions. Application looks like f a b instead of f(a,b). Also pairs
7446 look like (a,b) instead of <a,b>;
7448 * PLEASE NOTE: CHOL will eventually replace HOL!
7450 * In CHOL, pattern-matching on tuples is now available in all abstractions.
7451 It translates to the operator "split". A new theory of integers is available;
7453 * In ZF, integer numerals now denote two's-complement binary integers.
7454 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
7456 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
7457 of the Axiom of Choice;
7464 * Significantly faster resolution;
7466 * the different sections in a .thy file can now be mixed and repeated
7469 * Database of theorems for FOL, HOL and ZF. New
7470 commands including qed, qed_goal and bind_thm store theorems in the database.
7472 * Simple database queries: return a named theorem (get_thm) or all theorems of
7473 a given theory (thms_of), or find out what theory a theorem was proved in
7476 * Bugs fixed in the inductive definition and datatype packages;
7478 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7479 and HOL_dup_cs obsolete;
7481 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7484 * Simpler definition of function space in ZF;
7486 * new results about cardinal and ordinal arithmetic in ZF;
7488 * 'subtype' facility in HOL for introducing new types as subsets of existing
7491 :mode=text:wrap=hard:maxLineLen=72: