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.
26 * Various options that affect pretty printing etc. are now properly
27 handled within the context via configuration options, instead of
28 unsynchronized references. There are both ML Config.T entities and
29 Isar declaration attributes to access these.
31 ML (Config.T) Isar (attribute)
33 eta_contract eta_contract
34 show_brackets show_brackets
37 show_question_marks show_question_marks
38 show_consts show_consts
40 Syntax.ambiguity_level syntax_ambiguity_level
42 Goal_Display.goals_limit goals_limit
43 Goal_Display.show_main_goal show_main_goal
45 Thy_Output.display thy_output_display
46 Thy_Output.quotes thy_output_quotes
47 Thy_Output.indent thy_output_indent
48 Thy_Output.source thy_output_source
49 Thy_Output.break thy_output_break
51 Note that corresponding "..._default" references in ML may be only
52 changed globally at the ROOT session setup, but *not* within a theory.
57 * Interpretation command 'interpret' accepts a list of equations like
58 'interpretation' does.
60 * Diagnostic command 'print_interps' prints interpretations in proofs
61 in addition to interpretations in theories.
63 * Discontinued obsolete 'global' and 'local' commands to manipulate
64 the theory name space. Rare INCOMPATIBILITY. The ML functions
65 Sign.root_path and Sign.local_path may be applied directly where this
66 feature is still required for historical reasons.
68 * Discontinued ancient 'constdefs' command. INCOMPATIBILITY, use
74 * Renamed lemmas: expand_fun_eq -> ext_iff, expand_set_eq -> set_ext_iff
76 * Renamed class eq and constant eq (for code generation) to class equal
77 and constant equal, plus renaming of related facts and various tuning.
80 * Scala (2.8 or higher) has been added to the target languages of
83 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
85 * Theory SetsAndFunctions has been split into Function_Algebras and Set_Algebras;
86 canonical names for instance definitions for functions; various improvements.
89 * Records: logical foundation type for records do not carry a '_type' suffix
90 any longer. INCOMPATIBILITY.
92 * Code generation for records: more idiomatic representation of record types.
93 Warning: records are not covered by ancient SML code generation any longer.
94 INCOMPATIBILITY. In cases of need, a suitable rep_datatype declaration
95 helps to succeed then:
99 rep_datatype foo_ext ...
101 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
104 * Quickcheck in locales considers interpretations of that locale for
105 counter example search.
107 * Theory Library/Monad_Syntax provides do-syntax for monad types. Syntax
108 in Library/State_Monad has been changed to avoid ambiguities.
111 * Code generator: export_code without explicit file declaration prints
112 to standard output. INCOMPATIBILITY.
114 * Abolished symbol type names: "prod" and "sum" replace "*" and "+"
115 respectively. INCOMPATIBILITY.
117 * Constant "split" has been merged with constant "prod_case"; names
118 of ML functions, facts etc. involving split have been retained so far,
119 though. INCOMPATIBILITY.
121 * Dropped old infix syntax "mem" for List.member; use "in set"
122 instead. INCOMPATIBILITY.
124 * Refactoring of code-generation specific operations in List.thy
130 mem_iff ~> member_def
131 null_empty ~> null_def
133 INCOMPATIBILITY. Note that these were not suppossed to be used
134 regularly unless for striking reasons; their main purpose was code
137 * Some previously unqualified names have been qualified:
144 Trueprop ~> HOL.Trueprop
149 op --> ~> HOL.implies
161 Pair ~> Product_Type.Pair
162 fst ~> Product_Type.fst
163 snd ~> Product_Type.snd
164 curry ~> Product_Type.curry
166 Collect ~> Set.Collect
170 * Removed simplifier congruence rule of "prod_case", as has for long
171 been the case with "split". INCOMPATIBILITY.
173 * Datatype package: theorems generated for executable equality
174 (class eq) carry proper names and are treated as default code
177 * Removed lemma Option.is_none_none (Duplicate of is_none_def).
180 * List.thy: use various operations from the Haskell prelude when
181 generating Haskell code.
183 * code_simp.ML and method code_simp: simplification with rules determined
186 * code generator: do not print function definitions for case
187 combinators any longer.
189 * Multivariate Analysis: Introduced a type class for euclidean space. Most
190 theorems are now stated in terms of euclidean spaces instead of finite
194 real ^ 'n ~> 'a::real_vector
195 ~> 'a::euclidean_space
196 ~> 'a::ordered_euclidean_space
197 (depends on your needs)
201 \<chi> x. _ ~> \<chi>\<chi> x. _
204 Also note that the indices are now natural numbers and not from some finite
205 type. Finite cartesian products of euclidean spaces, products of euclidean
206 spaces the real and complex numbers are instantiated to be euclidean_spaces.
210 * Probability: Introduced pinfreal as real numbers with infinity. Use pinfreal
211 as value for measures. Introduces Lebesgue Measure based on the integral in
212 Multivariate Analysis. Proved Radon Nikodym for arbitrary sigma finite measure
217 * Inductive package: offers new command "inductive_simps" to automatically
218 derive instantiated and simplified equations for inductive predicates,
219 similar to inductive_cases.
221 * "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". surj_on is a
222 generalization of surj, and "surj f" is now a abbreviation of "surj_on f UNIV".
223 The theorems bij_def and surj_def are unchanged.
227 * All constant names are now qualified. INCOMPATIBILITY.
232 * All constant names are now qualified. INCOMPATIBILITY.
237 * Configuration option show_question_marks only affects regular pretty
238 printing of types and terms, not raw Term.string_of_vname.
240 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
241 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
242 @{thms} for most purposes.
244 * ML structure Unsynchronized never opened, not even in Isar
245 interaction mode as before. Old Unsynchronized.set etc. have been
246 discontinued -- use plain := instead. This should be *rare* anyway,
247 since modern tools always work via official context data, notably
248 configuration options.
250 * ML antiquotations @{theory} and @{theory_ref} refer to named
251 theories from the ancestry of the current context, not any accidental
252 theory loader state as before. Potential INCOMPATIBILITY, subtle
258 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
262 New in Isabelle2009-2 (June 2010)
263 ---------------------------------
267 * Authentic syntax for *all* logical entities (type classes, type
268 constructors, term constants): provides simple and robust
269 correspondence between formal entities and concrete syntax. Within
270 the parse tree / AST representations, "constants" are decorated by
271 their category (class, type, const) and spelled out explicitly with
272 their full internal name.
274 Substantial INCOMPATIBILITY concerning low-level syntax declarations
275 and translations (translation rules and translation functions in ML).
276 Some hints on upgrading:
278 - Many existing uses of 'syntax' and 'translations' can be replaced
279 by more modern 'type_notation', 'notation' and 'abbreviation',
280 which are independent of this issue.
282 - 'translations' require markup within the AST; the term syntax
283 provides the following special forms:
285 CONST c -- produces syntax version of constant c from context
286 XCONST c -- literally c, checked as constant from context
287 c -- literally c, if declared by 'syntax'
289 Plain identifiers are treated as AST variables -- occasionally the
290 system indicates accidental variables via the error "rhs contains
293 Type classes and type constructors are marked according to their
294 concrete syntax. Some old translations rules need to be written
295 for the "type" category, using type constructor application
296 instead of pseudo-term application of the default category
299 - 'parse_translation' etc. in ML may use the following
302 @{class_syntax c} -- type class c within parse tree / AST
303 @{term_syntax c} -- type constructor c within parse tree / AST
304 @{const_syntax c} -- ML version of "CONST c" above
305 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
307 - Literal types within 'typed_print_translations', i.e. those *not*
308 represented as pseudo-terms are represented verbatim. Use @{class
309 c} or @{type_name c} here instead of the above syntax
312 Note that old non-authentic syntax was based on unqualified base
313 names, so all of the above "constant" names would coincide. Recall
314 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
315 diagnose syntax problems.
317 * Type constructors admit general mixfix syntax, not just infix.
319 * Concrete syntax may be attached to local entities without a proof
320 body, too. This works via regular mixfix annotations for 'fix',
321 'def', 'obtain' etc. or via the explicit 'write' command, which is
322 similar to the 'notation' command in theory specifications.
324 * Discontinued unnamed infix syntax (legacy feature for many years) --
325 need to specify constant name and syntax separately. Internal ML
326 datatype constructors have been renamed from InfixName to Infix etc.
327 Minor INCOMPATIBILITY.
329 * Schematic theorem statements need to be explicitly markup as such,
330 via commands 'schematic_lemma', 'schematic_theorem',
331 'schematic_corollary'. Thus the relevance of the proof is made
332 syntactically clear, which impacts performance in a parallel or
333 asynchronous interactive environment. Minor INCOMPATIBILITY.
335 * Use of cumulative prems via "!" in some proof methods has been
336 discontinued (old legacy feature).
338 * References 'trace_simp' and 'debug_simp' have been replaced by
339 configuration options stored in the context. Enabling tracing (the
340 case of debugging is similar) in proofs works via
342 using [[trace_simp = true]]
344 Tracing is then active for all invocations of the simplifier in
345 subsequent goal refinement steps. Tracing may also still be enabled or
346 disabled via the ProofGeneral settings menu.
348 * Separate commands 'hide_class', 'hide_type', 'hide_const',
349 'hide_fact' replace the former 'hide' KIND command. Minor
352 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
353 more efficient than combinations with -q1 or -q2.
358 * Proofterms record type-class reasoning explicitly, using the
359 "unconstrain" operation internally. This eliminates all sort
360 constraints from a theorem and proof, introducing explicit
361 OFCLASS-premises. On the proof term level, this operation is
362 automatically applied at theorem boundaries, such that closed proofs
363 are always free of sort constraints. INCOMPATIBILITY for tools that
366 * Local theory specifications may depend on extra type variables that
367 are not present in the result type -- arguments TYPE('a) :: 'a itself
368 are added internally. For example:
370 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
372 * Predicates of locales introduced by classes carry a mandatory
373 "class" prefix. INCOMPATIBILITY.
375 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
377 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
380 * Command 'code_reflect' allows to incorporate generated ML code into
381 runtime environment; replaces immature code_datatype antiquotation.
384 * Code generator: simple concept for abstract datatypes obeying
387 * Code generator: details of internal data cache have no impact on the
388 user space functionality any longer.
390 * Methods "unfold_locales" and "intro_locales" ignore non-locale
391 subgoals. This is more appropriate for interpretations with 'where'.
394 * Command 'example_proof' opens an empty proof body. This allows to
395 experiment with Isar, without producing any persistent result.
397 * Commands 'type_notation' and 'no_type_notation' declare type syntax
398 within a local theory context, with explicit checking of the
399 constructors involved (in contrast to the raw 'syntax' versions).
401 * Commands 'types' and 'typedecl' now work within a local theory
402 context -- without introducing dependencies on parameters or
403 assumptions, which is not possible in Isabelle/Pure.
405 * Command 'defaultsort' has been renamed to 'default_sort', it works
406 within a local theory context. Minor INCOMPATIBILITY.
411 * Command 'typedef' now works within a local theory context -- without
412 introducing dependencies on parameters or assumptions, which is not
413 possible in Isabelle/Pure/HOL. Note that the logical environment may
414 contain multiple interpretations of local typedefs (with different
415 non-emptiness proofs), even in a global theory context.
417 * New package for quotient types. Commands 'quotient_type' and
418 'quotient_definition' may be used for defining types and constants by
419 quotient constructions. An example is the type of integers created by
420 quotienting pairs of natural numbers:
423 intrel :: "(nat * nat) => (nat * nat) => bool"
425 "intrel (x, y) (u, v) = (x + v = u + y)"
427 quotient_type int = "nat * nat" / intrel
428 by (auto simp add: equivp_def expand_fun_eq)
431 "0::int" is "(0::nat, 0::nat)"
433 The method "lifting" can be used to lift of theorems from the
434 underlying "raw" type to the quotient type. The example
435 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
436 construction and provides a reasoning infrastructure for finite sets.
438 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
439 clash with new theory Quotient in Main HOL.
441 * Moved the SMT binding into the main HOL session, eliminating
442 separate HOL-SMT session.
444 * List membership infix mem operation is only an input abbreviation.
447 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
448 for future developements; former Library/Word.thy is still present in
449 the AFP entry RSAPPS.
451 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
452 longer shadowed. INCOMPATIBILITY.
454 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
457 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
460 * Dropped normalizing_semiring etc; use the facts in semiring classes
461 instead. INCOMPATIBILITY.
463 * Dropped several real-specific versions of lemmas about floor and
464 ceiling; use the generic lemmas from theory "Archimedean_Field"
465 instead. INCOMPATIBILITY.
467 floor_number_of_eq ~> floor_number_of
468 le_floor_eq_number_of ~> number_of_le_floor
469 le_floor_eq_zero ~> zero_le_floor
470 le_floor_eq_one ~> one_le_floor
471 floor_less_eq_number_of ~> floor_less_number_of
472 floor_less_eq_zero ~> floor_less_zero
473 floor_less_eq_one ~> floor_less_one
474 less_floor_eq_number_of ~> number_of_less_floor
475 less_floor_eq_zero ~> zero_less_floor
476 less_floor_eq_one ~> one_less_floor
477 floor_le_eq_number_of ~> floor_le_number_of
478 floor_le_eq_zero ~> floor_le_zero
479 floor_le_eq_one ~> floor_le_one
480 floor_subtract_number_of ~> floor_diff_number_of
481 floor_subtract_one ~> floor_diff_one
482 ceiling_number_of_eq ~> ceiling_number_of
483 ceiling_le_eq_number_of ~> ceiling_le_number_of
484 ceiling_le_zero_eq ~> ceiling_le_zero
485 ceiling_le_eq_one ~> ceiling_le_one
486 less_ceiling_eq_number_of ~> number_of_less_ceiling
487 less_ceiling_eq_zero ~> zero_less_ceiling
488 less_ceiling_eq_one ~> one_less_ceiling
489 ceiling_less_eq_number_of ~> ceiling_less_number_of
490 ceiling_less_eq_zero ~> ceiling_less_zero
491 ceiling_less_eq_one ~> ceiling_less_one
492 le_ceiling_eq_number_of ~> number_of_le_ceiling
493 le_ceiling_eq_zero ~> zero_le_ceiling
494 le_ceiling_eq_one ~> one_le_ceiling
495 ceiling_subtract_number_of ~> ceiling_diff_number_of
496 ceiling_subtract_one ~> ceiling_diff_one
498 * Theory "Finite_Set": various folding_XXX locales facilitate the
499 application of the various fold combinators on finite sets.
501 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
502 provides abstract red-black tree type which is backed by "RBT_Impl" as
503 implementation. INCOMPATIBILTY.
505 * Theory Library/Coinductive_List has been removed -- superseded by
506 AFP/thys/Coinductive.
508 * Theory PReal, including the type "preal" and related operations, has
509 been removed. INCOMPATIBILITY.
511 * Real: new development using Cauchy Sequences.
513 * Split off theory "Big_Operators" containing setsum, setprod,
514 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
516 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
517 "Int" etc. INCOMPATIBILITY.
519 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
521 * New set of rules "ac_simps" provides combined assoc / commute
522 rewrites for all interpretations of the appropriate generic locales.
524 * Renamed theory "OrderedGroup" to "Groups" and split theory
525 "Ring_and_Field" into theories "Rings" and "Fields"; for more
526 appropriate and more consistent names suitable for name prefixes
527 within the HOL theories. INCOMPATIBILITY.
529 * Some generic constants have been put to appropriate theories:
530 - less_eq, less: Orderings
531 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
532 - inverse, divide: Rings
535 * More consistent naming of type classes involving orderings (and
538 lower_semilattice ~> semilattice_inf
539 upper_semilattice ~> semilattice_sup
541 dense_linear_order ~> dense_linorder
543 pordered_ab_group_add ~> ordered_ab_group_add
544 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
545 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
546 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
547 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
548 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
549 pordered_cancel_semiring ~> ordered_cancel_semiring
550 pordered_comm_monoid_add ~> ordered_comm_monoid_add
551 pordered_comm_ring ~> ordered_comm_ring
552 pordered_comm_semiring ~> ordered_comm_semiring
553 pordered_ring ~> ordered_ring
554 pordered_ring_abs ~> ordered_ring_abs
555 pordered_semiring ~> ordered_semiring
557 ordered_ab_group_add ~> linordered_ab_group_add
558 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
559 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
560 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
561 ordered_field ~> linordered_field
562 ordered_field_no_lb ~> linordered_field_no_lb
563 ordered_field_no_ub ~> linordered_field_no_ub
564 ordered_field_dense_linear_order ~> dense_linordered_field
565 ordered_idom ~> linordered_idom
566 ordered_ring ~> linordered_ring
567 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
568 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
569 ordered_ring_strict ~> linordered_ring_strict
570 ordered_semidom ~> linordered_semidom
571 ordered_semiring ~> linordered_semiring
572 ordered_semiring_1 ~> linordered_semiring_1
573 ordered_semiring_1_strict ~> linordered_semiring_1_strict
574 ordered_semiring_strict ~> linordered_semiring_strict
576 The following slightly odd type classes have been moved to a
577 separate theory Library/Lattice_Algebras:
579 lordered_ab_group_add ~> lattice_ab_group_add
580 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
581 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
582 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
583 lordered_ring ~> lattice_ring
587 * Refined field classes:
588 - classes division_ring_inverse_zero, field_inverse_zero,
589 linordered_field_inverse_zero include rule inverse 0 = 0 --
590 subsumes former division_by_zero class;
591 - numerous lemmas have been ported from field to division_ring.
594 * Refined algebra theorem collections:
595 - dropped theorem group group_simps, use algebra_simps instead;
596 - dropped theorem group ring_simps, use field_simps instead;
597 - proper theorem collection field_simps subsumes former theorem
598 groups field_eq_simps and field_simps;
599 - dropped lemma eq_minus_self_iff which is a duplicate for
603 * Theory Finite_Set and List: some lemmas have been generalized from
606 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
607 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
608 inter_Inter_fold_inter ~> inf_Inf_fold_inf
609 union_Union_fold_union ~> sup_Sup_fold_sup
610 Inter_fold_inter ~> Inf_fold_inf
611 Union_fold_union ~> Sup_fold_sup
612 inter_INTER_fold_inter ~> inf_INFI_fold_inf
613 union_UNION_fold_union ~> sup_SUPR_fold_sup
614 INTER_fold_inter ~> INFI_fold_inf
615 UNION_fold_union ~> SUPR_fold_sup
617 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
618 replaced by the more convenient lemmas Inf_empty and Sup_empty.
619 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
620 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
621 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
622 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
624 * Reorganized theory Multiset: swapped notation of pointwise and
627 - pointwise ordering is instance of class order with standard syntax
629 - multiset ordering has syntax <=# and <#; partial order properties
630 are provided by means of interpretation with prefix
632 - less duplication, less historical organization of sections,
633 conversion from associations lists to multisets, rudimentary code
635 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
640 multiset_eq_conv_count_eq ~> multiset_ext_iff
641 multi_count_ext ~> multiset_ext
642 diff_union_inverse2 ~> diff_union_cancelR
646 * Theory Permutation: replaced local "remove" by List.remove1.
648 * Code generation: ML and OCaml code is decorated with signatures.
650 * Theory List: added transpose.
652 * Library/Nat_Bijection.thy is a collection of bijective functions
653 between nat and other types, which supersedes the older libraries
654 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
657 Nat_Int_Bij.nat2_to_nat ~> prod_encode
658 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
659 Nat_Int_Bij.int_to_nat_bij ~> int_encode
660 Nat_Int_Bij.nat_to_int_bij ~> int_decode
661 Countable.pair_encode ~> prod_encode
662 NatIso.prod2nat ~> prod_encode
663 NatIso.nat2prod ~> prod_decode
664 NatIso.sum2nat ~> sum_encode
665 NatIso.nat2sum ~> sum_decode
666 NatIso.list2nat ~> list_encode
667 NatIso.nat2list ~> list_decode
668 NatIso.set2nat ~> set_encode
669 NatIso.nat2set ~> set_decode
672 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
673 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
674 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
675 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
676 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
677 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
678 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
679 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
680 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
681 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
682 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
683 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
684 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
687 - Renamed ATP commands:
688 atp_info ~> sledgehammer running_atps
689 atp_kill ~> sledgehammer kill_atps
690 atp_messages ~> sledgehammer messages
691 atp_minimize ~> sledgehammer minimize
692 print_atps ~> sledgehammer available_atps
694 - Added user's manual ("isabelle doc sledgehammer").
695 - Added option syntax and "sledgehammer_params" to customize
696 Sledgehammer's behavior. See the manual for details.
697 - Modified the Isar proof reconstruction code so that it produces
698 direct proofs rather than proofs by contradiction. (This feature
699 is still experimental.)
700 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
702 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
705 - Added and implemented "binary_ints" and "bits" options.
706 - Added "std" option and implemented support for nonstandard models.
707 - Added and implemented "finitize" option to improve the precision
708 of infinite datatypes based on a monotonicity analysis.
709 - Added support for quotient types.
710 - Added support for "specification" and "ax_specification"
712 - Added support for local definitions (for "function" and
713 "termination" proofs).
714 - Added support for term postprocessors.
715 - Optimized "Multiset.multiset" and "FinFun.finfun".
716 - Improved efficiency of "destroy_constrs" optimization.
717 - Fixed soundness bugs related to "destroy_constrs" optimization and
719 - Fixed soundness bug related to higher-order constructors.
720 - Fixed soundness bug when "full_descrs" is enabled.
721 - Improved precision of set constructs.
722 - Added "atoms" option.
723 - Added cache to speed up repeated Kodkod invocations on the same
725 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
726 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
727 "SAT4J_Light". INCOMPATIBILITY.
728 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
729 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
730 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
732 * Method "induct" now takes instantiations of the form t, where t is not
733 a variable, as a shorthand for "x == t", where x is a fresh variable.
734 If this is not intended, t has to be enclosed in parentheses.
735 By default, the equalities generated by definitional instantiations
736 are pre-simplified, which may cause parameters of inductive cases
737 to disappear, or may even delete some of the inductive cases.
738 Use "induct (no_simp)" instead of "induct" to restore the old
739 behaviour. The (no_simp) option is also understood by the "cases"
740 and "nominal_induct" methods, which now perform pre-simplification, too.
746 * Variable names in lemmas generated by the domain package have
747 changed; the naming scheme is now consistent with the HOL datatype
748 package. Some proof scripts may be affected, INCOMPATIBILITY.
750 * The domain package no longer defines the function "foo_copy" for
751 recursive domain "foo". The reach lemma is now stated directly in
752 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
753 be reformulated in terms of "foo_take", INCOMPATIBILITY.
755 * Most definedness lemmas generated by the domain package (previously
756 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
757 like "foo$x = UU <-> x = UU", which works better as a simp rule.
758 Proofs that used definedness lemmas as intro rules may break,
759 potential INCOMPATIBILITY.
761 * Induction and casedist rules generated by the domain package now
762 declare proper case_names (one called "bottom", and one named for each
763 constructor). INCOMPATIBILITY.
765 * For mutually-recursive domains, separate "reach" and "take_lemma"
766 rules are generated for each domain, INCOMPATIBILITY.
768 foo_bar.reach ~> foo.reach bar.reach
769 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
771 * Some lemmas generated by the domain package have been renamed for
772 consistency with the datatype package, INCOMPATIBILITY.
774 foo.ind ~> foo.induct
775 foo.finite_ind ~> foo.finite_induct
776 foo.coind ~> foo.coinduct
777 foo.casedist ~> foo.exhaust
778 foo.exhaust ~> foo.nchotomy
780 * For consistency with other definition packages, the fixrec package
781 now generates qualified theorem names, INCOMPATIBILITY.
783 foo_simps ~> foo.simps
784 foo_unfold ~> foo.unfold
785 foo_induct ~> foo.induct
787 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
788 method and internal fixrec proofs now use the default simpset instead.
791 * The "contlub" predicate has been removed. Proof scripts should use
792 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
794 * The "admw" predicate has been removed, INCOMPATIBILITY.
796 * The constants cpair, cfst, and csnd have been removed in favor of
797 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
802 * Antiquotations for basic formal entities:
804 @{class NAME} -- type class
805 @{class_syntax NAME} -- syntax representation of the above
807 @{type_name NAME} -- logical type
808 @{type_abbrev NAME} -- type abbreviation
809 @{nonterminal NAME} -- type of concrete syntactic category
810 @{type_syntax NAME} -- syntax representation of any of the above
812 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
813 @{const_abbrev NAME} -- abbreviated constant
814 @{const_syntax NAME} -- syntax representation of any of the above
816 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
817 syntax constant (cf. 'syntax' command).
819 * Antiquotation @{make_string} inlines a function to print arbitrary
820 values similar to the ML toplevel. The result is compiler dependent
821 and may fall back on "?" in certain situations.
823 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
824 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
825 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
826 not work with the asynchronous Isar document model.
828 * Configuration options now admit dynamic default values, depending on
829 the context or even global references.
831 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
832 uses an efficient external library if available (for Poly/ML).
834 * Renamed some important ML structures, while keeping the old names
835 for some time as aliases within the structure Legacy:
837 OuterKeyword ~> Keyword
840 OuterSyntax ~> Outer_Syntax
841 PrintMode ~> Print_Mode
842 SpecParse ~> Parse_Spec
845 ThyOutput ~> Thy_Output
846 TypeInfer ~> Type_Infer
848 Note that "open Legacy" simplifies porting of sources, but forgetting
849 to remove it again will complicate porting again in the future.
851 * Most operations that refer to a global context are named
852 accordingly, e.g. Simplifier.global_context or
853 ProofContext.init_global. There are some situations where a global
854 context actually works, but under normal circumstances one needs to
855 pass the proper local context through the code!
857 * Discontinued old TheoryDataFun with its copy/init operation -- data
858 needs to be pure. Functor Theory_Data_PP retains the traditional
859 Pretty.pp argument to merge, which is absent in the standard
862 * Sorts.certify_sort and derived "cert" operations for types and terms
863 no longer minimize sorts. Thus certification at the boundary of the
864 inference kernel becomes invariant under addition of class relations,
865 which is an important monotonicity principle. Sorts are now minimized
866 in the syntax layer only, at the boundary between the end-user and the
867 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
868 explicitly in rare situations.
870 * Renamed old-style Drule.standard to Drule.export_without_context, to
871 emphasize that this is in no way a standard operation.
874 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
875 usual for resolution. Rare INCOMPATIBILITY.
877 * Renamed varify/unvarify operations to varify_global/unvarify_global
878 to emphasize that these only work in a global situation (which is
881 * Curried take and drop in library.ML; negative length is interpreted
882 as infinity (as in chop). Subtle INCOMPATIBILITY.
884 * Proof terms: type substitutions on proof constants now use canonical
885 order of type variables. INCOMPATIBILITY for tools working with proof
888 * Raw axioms/defs may no longer carry sort constraints, and raw defs
889 may no longer carry premises. User-level specifications are
890 transformed accordingly by Thm.add_axiom/add_def.
895 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
896 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
897 proof terms are enabled unconditionally in the new HOL-Proofs image.
899 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
900 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
903 * Old lib/scripts/polyml-platform is superseded by the
904 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
905 variant, even on a 64 bit machine. The following example setting
906 prefers 64 bit if available:
908 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
910 * The preliminary Isabelle/jEdit application demonstrates the emerging
911 Isabelle/Scala layer for advanced prover interaction and integration.
912 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
915 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
916 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
917 similar to the default assignment of the document preparation system
918 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
919 provides some operations for direct access to the font without asking
920 the user for manual installation.
924 New in Isabelle2009-1 (December 2009)
925 -------------------------------------
929 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
930 one backslash should be used, even in ML sources.
935 * Locale interpretation propagates mixins along the locale hierarchy.
936 The currently only available mixins are the equations used to map
937 local definitions to terms of the target domain of an interpretation.
939 * Reactivated diagnostic command 'print_interps'. Use "print_interps
940 loc" to print all interpretations of locale "loc" in the theory.
941 Interpretations in proofs are not shown.
943 * Thoroughly revised locales tutorial. New section on conditional
946 * On instantiation of classes, remaining undefined class parameters
947 are formally declared. INCOMPATIBILITY.
950 *** Document preparation ***
952 * New generalized style concept for printing terms: @{foo (style) ...}
953 instead of @{foo_style style ...} (old form is still retained for
954 backward compatibility). Styles can be also applied for
955 antiquotations prop, term_type and typeof.
960 * New proof method "smt" for a combination of first-order logic with
961 equality, linear and nonlinear (natural/integer/real) arithmetic, and
962 fixed-size bitvectors; there is also basic support for higher-order
963 features (esp. lambda abstractions). It is an incomplete decision
964 procedure based on external SMT solvers using the oracle mechanism;
965 for the SMT solver Z3, this method is proof-producing. Certificates
966 are provided to avoid calling the external solvers solely for
967 re-checking proofs. Due to a remote SMT service there is no need for
968 installing SMT solvers locally. See src/HOL/SMT.
970 * New commands to load and prove verification conditions generated by
971 the Boogie program verifier or derived systems (e.g. the Verifying C
972 Compiler (VCC) or Spec#). See src/HOL/Boogie.
974 * New counterexample generator tool 'nitpick' based on the Kodkod
975 relational model finder. See src/HOL/Tools/Nitpick and
976 src/HOL/Nitpick_Examples.
978 * New commands 'code_pred' and 'values' to invoke the predicate
979 compiler and to enumerate values of inductive predicates.
981 * A tabled implementation of the reflexive transitive closure.
983 * New implementation of quickcheck uses generic code generator;
984 default generators are provided for all suitable HOL types, records
985 and datatypes. Old quickcheck can be re-activated importing theory
986 Library/SML_Quickcheck.
988 * New testing tool Mirabelle for automated proof tools. Applies
989 several tools and tactics like sledgehammer, metis, or quickcheck, to
990 every proof step in a theory. To be used in batch mode via the
993 * New proof method "sos" (sum of squares) for nonlinear real
994 arithmetic (originally due to John Harison). It requires theory
995 Library/Sum_Of_Squares. It is not a complete decision procedure but
996 works well in practice on quantifier-free real arithmetic with +, -,
997 *, ^, =, <= and <, i.e. boolean combinations of equalities and
998 inequalities between polynomials. It makes use of external
999 semidefinite programming solvers. Method "sos" generates a
1000 certificate that can be pasted into the proof thus avoiding the need
1001 to call an external tool every time the proof is checked. See
1002 src/HOL/Library/Sum_Of_Squares.
1004 * New method "linarith" invokes existing linear arithmetic decision
1007 * New command 'atp_minimal' reduces result produced by Sledgehammer.
1009 * New Sledgehammer option "Full Types" in Proof General settings menu.
1010 Causes full type information to be output to the ATPs. This slows
1011 ATPs down considerably but eliminates a source of unsound "proofs"
1014 * New method "metisFT": A version of metis that uses full type
1015 information in order to avoid failures of proof reconstruction.
1017 * New evaluator "approximate" approximates an real valued term using
1018 the same method as the approximation method.
1020 * Method "approximate" now supports arithmetic expressions as
1021 boundaries of intervals and implements interval splitting and Taylor
1024 * ML antiquotation @{code_datatype} inserts definition of a datatype
1025 generated by the code generator; e.g. see src/HOL/Predicate.thy.
1027 * New theory SupInf of the supremum and infimum operators for sets of
1030 * New theory Probability, which contains a development of measure
1031 theory, eventually leading to Lebesgue integration and probability.
1033 * Extended Multivariate Analysis to include derivation and Brouwer's
1036 * Reorganization of number theory, INCOMPATIBILITY:
1037 - new number theory development for nat and int, in theories Divides
1038 and GCD as well as in new session Number_Theory
1039 - some constants and facts now suffixed with _nat and _int
1041 - former session NumberTheory now named Old_Number_Theory, including
1042 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
1043 - moved theory Pocklington from src/HOL/Library to
1044 src/HOL/Old_Number_Theory
1046 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
1047 lcm of finite and infinite sets. It is shown that they form a complete
1050 * Class semiring_div requires superclass no_zero_divisors and proof of
1051 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
1052 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
1053 generalized to class semiring_div, subsuming former theorems
1054 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
1055 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
1058 * Refinements to lattice classes and sets:
1059 - less default intro/elim rules in locale variant, more default
1060 intro/elim rules in class variant: more uniformity
1061 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
1063 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
1065 - renamed ACI to inf_sup_aci
1066 - new class "boolean_algebra"
1067 - class "complete_lattice" moved to separate theory
1068 "Complete_Lattice"; corresponding constants (and abbreviations)
1069 renamed and with authentic syntax:
1070 Set.Inf ~> Complete_Lattice.Inf
1071 Set.Sup ~> Complete_Lattice.Sup
1072 Set.INFI ~> Complete_Lattice.INFI
1073 Set.SUPR ~> Complete_Lattice.SUPR
1074 Set.Inter ~> Complete_Lattice.Inter
1075 Set.Union ~> Complete_Lattice.Union
1076 Set.INTER ~> Complete_Lattice.INTER
1077 Set.UNION ~> Complete_Lattice.UNION
1078 - authentic syntax for
1081 - mere abbreviations:
1084 Set.inter (for inf, formerly Set.Int)
1085 Set.union (for sup, formerly Set.Un)
1086 Complete_Lattice.Inter (for Inf)
1087 Complete_Lattice.Union (for Sup)
1088 Complete_Lattice.INTER (for INFI)
1089 Complete_Lattice.UNION (for SUPR)
1090 - object-logic definitions as far as appropriate
1092 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
1093 Un_subset_iff are explicitly deleted as default simp rules; then also
1094 their lattice counterparts le_inf_iff and le_sup_iff have to be
1095 deleted to achieve the desired effect.
1097 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
1098 rules by default any longer; the same applies to min_max.inf_absorb1
1099 etc. INCOMPATIBILITY.
1101 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
1102 pred_set_conv by default. INCOMPATIBILITY.
1104 * Power operations on relations and functions are now one dedicated
1105 constant "compow" with infix syntax "^^". Power operation on
1106 multiplicative monoids retains syntax "^" and is now defined generic
1107 in class power. INCOMPATIBILITY.
1109 * Relation composition "R O S" now has a more standard argument order:
1110 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
1111 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
1112 break, since the O_assoc rule was not rewritten like this. Fix using
1113 O_assoc[symmetric]. The same applies to the curried version "R OO S".
1115 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
1116 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
1119 * Most rules produced by inductive and datatype package have mandatory
1120 prefixes. INCOMPATIBILITY.
1122 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
1123 the attribute of the same name. Each of the theorems in the list
1124 DERIV_intros assumes composition with an additional function and
1125 matches a variable to the derivative, which has to be solved by the
1126 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
1127 of most elementary terms. Former Maclauren.DERIV_tac and
1128 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
1131 * Code generator attributes follow the usual underscore convention:
1132 code_unfold replaces code unfold
1133 code_post replaces code post
1138 sizechange -> size_change
1139 induct_scheme -> induction_schema
1142 * Discontinued abbreviation "arbitrary" of constant "undefined".
1143 INCOMPATIBILITY, use "undefined" directly.
1146 Suc_eq_add_numeral_1 -> Suc_eq_plus1
1147 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
1148 Suc_plus1 -> Suc_eq_plus1
1149 *anti_sym -> *antisym*
1150 vector_less_eq_def -> vector_le_def
1153 * Added theorem List.map_map as [simp]. Removed List.map_compose.
1156 * Removed predicate "M hassize n" (<--> card M = n & finite M).
1162 * Theory Representable defines a class "rep" of domains that are
1163 representable (via an ep-pair) in the universal domain type "udom".
1164 Instances are provided for all type constructors defined in HOLCF.
1166 * The 'new_domain' command is a purely definitional version of the
1167 domain package, for representable domains. Syntax is identical to the
1168 old domain package. The 'new_domain' package also supports indirect
1169 recursion using previously-defined type constructors. See
1170 src/HOLCF/ex/New_Domain.thy for examples.
1172 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
1173 on the left-hand side of an equation, and then performs
1174 simplification. Rewriting is done using rules declared with the
1175 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
1176 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
1178 * The pattern-match compiler in 'fixrec' can now handle constructors
1179 with HOL function types. Pattern-match combinators for the Pair
1180 constructor are pre-configured.
1182 * The 'fixrec' package now produces better fixed-point induction rules
1183 for mutually-recursive definitions: Induction rules have conclusions
1184 of the form "P foo bar" instead of "P <foo, bar>".
1186 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
1187 been renamed to "below". The name "below" now replaces "less" in many
1188 theorem names. (Legacy theorem names using "less" are still supported
1191 * The 'fixrec' package now supports "bottom patterns". Bottom
1192 patterns can be used to generate strictness rules, or to make
1193 functions more strict (much like the bang-patterns supported by the
1194 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
1200 * Support for Poly/ML 5.3.0, with improved reporting of compiler
1201 errors and run-time exceptions, including detailed source positions.
1203 * Structure Name_Space (formerly NameSpace) now manages uniquely
1204 identified entries, with some additional information such as source
1205 position, logical grouping etc.
1207 * Theory and context data is now introduced by the simplified and
1208 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
1209 to be pure, but the old TheoryDataFun for mutable data (with explicit
1210 copy operation) is still available for some time.
1212 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
1213 provides a high-level programming interface to synchronized state
1214 variables with atomic update. This works via pure function
1215 application within a critical section -- its runtime should be as
1216 short as possible; beware of deadlocks if critical code is nested,
1217 either directly or indirectly via other synchronized variables!
1219 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
1220 wraps raw ML references, explicitly indicating their non-thread-safe
1221 behaviour. The Isar toplevel keeps this structure open, to
1222 accommodate Proof General as well as quick and dirty interactive
1223 experiments with references.
1225 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
1226 parallel tactical reasoning.
1228 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
1229 are similar to SUBPROOF, but are slightly more flexible: only the
1230 specified parts of the subgoal are imported into the context, and the
1231 body tactic may introduce new subgoals and schematic variables.
1233 * Old tactical METAHYPS, which does not observe the proof context, has
1234 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
1235 or Subgoal.FOCUS etc.
1237 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
1238 functors have their own ML name space there is no point to mark them
1239 separately.) Minor INCOMPATIBILITY.
1241 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
1243 * Renamed several structures FooBar to Foo_Bar. Occasional,
1246 * Operations of structure Skip_Proof no longer require quick_and_dirty
1247 mode, which avoids critical setmp.
1249 * Eliminated old Attrib.add_attributes, Method.add_methods and related
1250 combinators for "args". INCOMPATIBILITY, need to use simplified
1251 Attrib/Method.setup introduced in Isabelle2009.
1253 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
1254 back on global_simpset_of, global_claset_of, global_clasimpset_of as
1255 last resort. INCOMPATIBILITY.
1257 * Display.pretty_thm now requires a proper context (cf. former
1258 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
1259 or even Display.pretty_thm_without_context as last resort.
1262 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
1263 Syntax.pretty_typ/term directly, preferably with proper context
1264 instead of global theory.
1269 * Further fine tuning of parallel proof checking, scales up to 8 cores
1270 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
1273 * Support for additional "Isabelle components" via etc/components, see
1274 also the system manual.
1276 * The isabelle makeall tool now operates on all components with
1277 IsaMakefile, not just hardwired "logics".
1279 * Removed "compress" option from isabelle-process and isabelle usedir;
1280 this is always enabled.
1282 * Discontinued support for Poly/ML 4.x versions.
1284 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
1285 on a given logic image. This requires the lighttpd webserver and is
1286 currently supported on Linux only.
1290 New in Isabelle2009 (April 2009)
1291 --------------------------------
1295 * Simplified main Isabelle executables, with less surprises on
1296 case-insensitive file-systems (such as Mac OS).
1298 - The main Isabelle tool wrapper is now called "isabelle" instead of
1301 - The former "isabelle" alias for "isabelle-process" has been
1302 removed (should rarely occur to regular users).
1304 - The former "isabelle-interface" and its alias "Isabelle" have been
1305 removed (interfaces are now regular Isabelle tools).
1307 Within scripts and make files, the Isabelle environment variables
1308 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
1309 respectively. (The latter are still available as legacy feature.)
1311 The old isabelle-interface wrapper could react in confusing ways if
1312 the interface was uninstalled or changed otherwise. Individual
1313 interface tool configuration is now more explicit, see also the
1314 Isabelle system manual. In particular, Proof General is now available
1315 via "isabelle emacs".
1317 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
1318 purge installed copies of Isabelle executables and re-run "isabelle
1319 install -p ...", or use symlinks.
1321 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
1322 old ~/isabelle, which was slightly non-standard and apt to cause
1323 surprises on case-insensitive file-systems (such as Mac OS).
1325 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
1326 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
1327 care is required when using older releases of Isabelle. Note that
1328 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
1329 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
1331 * Proofs of fully specified statements are run in parallel on
1332 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
1333 a regular 4-core machine, if the initial heap space is made reasonably
1334 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
1336 * The main reference manuals ("isar-ref", "implementation", and
1337 "system") have been updated and extended. Formally checked references
1338 as hyperlinks are now available uniformly.
1343 * Complete re-implementation of locales. INCOMPATIBILITY in several
1344 respects. The most important changes are listed below. See the
1345 Tutorial on Locales ("locales" manual) for details.
1347 - In locale expressions, instantiation replaces renaming. Parameters
1348 must be declared in a for clause. To aid compatibility with previous
1349 parameter inheritance, in locale declarations, parameters that are not
1350 'touched' (instantiation position "_" or omitted) are implicitly added
1351 with their syntax at the beginning of the for clause.
1353 - Syntax from abbreviations and definitions in locales is available in
1354 locale expressions and context elements. The latter is particularly
1355 useful in locale declarations.
1357 - More flexible mechanisms to qualify names generated by locale
1358 expressions. Qualifiers (prefixes) may be specified in locale
1359 expressions, and can be marked as mandatory (syntax: "name!:") or
1360 optional (syntax "name?:"). The default depends for plain "name:"
1361 depends on the situation where a locale expression is used: in
1362 commands 'locale' and 'sublocale' prefixes are optional, in
1363 'interpretation' and 'interpret' prefixes are mandatory. The old
1364 implicit qualifiers derived from the parameter names of a locale are
1365 no longer generated.
1367 - Command "sublocale l < e" replaces "interpretation l < e". The
1368 instantiation clause in "interpretation" and "interpret" (square
1369 brackets) is no longer available. Use locale expressions.
1371 - When converting proof scripts, mandatory qualifiers in
1372 'interpretation' and 'interpret' should be retained by default, even
1373 if this is an INCOMPATIBILITY compared to former behavior. In the
1374 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
1375 in locale expressions range over a single locale instance only.
1377 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
1378 In existing theorem specifications replace the includes element by the
1379 respective context elements of the included locale, omitting those
1380 that are already present in the theorem specification. Multiple
1381 assume elements of a locale should be replaced by a single one
1382 involving the locale predicate. In the proof body, declarations (most
1383 notably theorems) may be regained by interpreting the respective
1384 locales in the proof context as required (command "interpret").
1386 If using "includes" in replacement of a target solely because the
1387 parameter types in the theorem are not as general as in the target,
1388 consider declaring a new locale with additional type constraints on
1389 the parameters (context element "constrains").
1391 - Discontinued "locale (open)". INCOMPATIBILITY.
1393 - Locale interpretation commands no longer attempt to simplify goal.
1394 INCOMPATIBILITY: in rare situations the generated goal differs. Use
1395 methods intro_locales and unfold_locales to clarify.
1397 - Locale interpretation commands no longer accept interpretation
1398 attributes. INCOMPATIBILITY.
1400 * Class declaration: so-called "base sort" must not be given in import
1401 list any longer, but is inferred from the specification. Particularly
1408 class foo = type + ...
1410 * Class target: global versions of theorems stemming do not carry a
1411 parameter prefix any longer. INCOMPATIBILITY.
1413 * Class 'instance' command no longer accepts attached definitions.
1414 INCOMPATIBILITY, use proper 'instantiation' target instead.
1416 * Recovered hiding of consts, which was accidentally broken in
1417 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
1418 makes c inaccessible; consider using ``hide (open) const c'' instead.
1420 * Slightly more coherent Pure syntax, with updated documentation in
1421 isar-ref manual. Removed locales meta_term_syntax and
1422 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
1423 INCOMPATIBILITY in rare situations. Note that &&& should not be used
1424 directly in regular applications.
1426 * There is a new syntactic category "float_const" for signed decimal
1427 fractions (e.g. 123.45 or -123.45).
1429 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
1430 interface with 'setup' command instead.
1432 * Command 'local_setup' is similar to 'setup', but operates on a local
1435 * The 'axiomatization' command now only works within a global theory
1436 context. INCOMPATIBILITY.
1438 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
1439 hypotheses. Sorts required in the course of reasoning need to be
1440 covered by the constraints in the initial statement, completed by the
1441 type instance information of the background theory. Non-trivial sort
1442 hypotheses, which rarely occur in practice, may be specified via
1443 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
1445 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
1447 The result contains an implicit sort hypotheses as before --
1448 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
1451 * Generalized Isar history, with support for linear undo, direct state
1454 * Changed defaults for unify configuration options:
1456 unify_trace_bound = 50 (formerly 25)
1457 unify_search_bound = 60 (formerly 30)
1459 * Different bookkeeping for code equations (INCOMPATIBILITY):
1461 a) On theory merge, the last set of code equations for a particular
1462 constant is taken (in accordance with the policy applied by other
1463 parts of the code generator framework).
1465 b) Code equations stemming from explicit declarations (e.g. code
1466 attribute) gain priority over default code equations stemming
1467 from definition, primrec, fun etc.
1469 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1471 * Unified theorem tables for both code generators. Thus [code
1472 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1474 * Command 'find_consts' searches for constants based on type and name
1477 find_consts "_ => bool"
1479 By default, matching is against subtypes, but it may be restricted to
1480 the whole type. Searching by name is possible. Multiple queries are
1481 conjunctive and queries may be negated by prefixing them with a
1484 find_consts strict: "_ => bool" name: "Int" -"int => int"
1486 * New 'find_theorems' criterion "solves" matches theorems that
1487 directly solve the current goal (modulo higher-order unification).
1489 * Auto solve feature for main theorem statements: whenever a new goal
1490 is stated, "find_theorems solves" is called; any theorems that could
1491 solve the lemma directly are listed as part of the goal state.
1492 Cf. associated options in Proof General Isabelle settings menu,
1493 enabled by default, with reasonable timeout for pathological cases of
1494 higher-order unification.
1497 *** Document preparation ***
1499 * Antiquotation @{lemma} now imitates a regular terminal proof,
1500 demanding keyword 'by' and supporting the full method expression
1501 syntax just like the Isar command 'by'.
1506 * Integrated main parts of former image HOL-Complex with HOL. Entry
1507 points Main and Complex_Main remain as before.
1509 * Logic image HOL-Plain provides a minimal HOL with the most important
1510 tools available (inductive, datatype, primrec, ...). This facilitates
1511 experimentation and tool development. Note that user applications
1512 (and library theories) should never refer to anything below theory
1515 * Logic image HOL-Main stops at theory Main, and thus facilitates
1516 experimentation due to shorter build times.
1518 * Logic image HOL-NSA contains theories of nonstandard analysis which
1519 were previously part of former HOL-Complex. Entry point Hyperreal
1520 remains valid, but theories formerly using Complex_Main should now use
1521 new entry point Hypercomplex.
1523 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1524 Posix processes. Avoids potentially expensive forking of the ML
1525 process. New thread-based implementation also works on non-Unix
1526 platforms (Cygwin). Provers are no longer hardwired, but defined
1527 within the theory via plain ML wrapper functions. Basic Sledgehammer
1528 commands are covered in the isar-ref manual.
1530 * Wrapper scripts for remote SystemOnTPTP service allows to use
1531 sledgehammer without local ATP installation (Vampire etc.). Other
1532 provers may be included via suitable ML wrappers, see also
1533 src/HOL/ATP_Linkup.thy.
1535 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1538 * The metis method no longer fails because the theorem is too trivial
1539 (contains the empty clause).
1541 * The metis method now fails in the usual manner, rather than raising
1542 an exception, if it determines that it cannot prove the theorem.
1544 * Method "coherent" implements a prover for coherent logic (see also
1545 src/Tools/coherent.ML).
1547 * Constants "undefined" and "default" replace "arbitrary". Usually
1548 "undefined" is the right choice to replace "arbitrary", though
1549 logically there is no difference. INCOMPATIBILITY.
1551 * Command "value" now integrates different evaluation mechanisms. The
1552 result of the first successful evaluation mechanism is printed. In
1553 square brackets a particular named evaluation mechanisms may be
1554 specified (currently, [SML], [code] or [nbe]). See further
1555 src/HOL/ex/Eval_Examples.thy.
1557 * Normalization by evaluation now allows non-leftlinear equations.
1558 Declare with attribute [code nbe].
1560 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1561 as the structured Isar versions "cases" and "induct", cf. the
1562 corresponding "cases" and "induct" attributes. Mutual induction rules
1563 are now presented as a list of individual projections
1564 (e.g. foo_bar.inducts for types foo and bar); the old format with
1565 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1566 rare situations a different rule is selected --- notably nested tuple
1567 elimination instead of former prod.exhaust: use explicit (case_tac t
1568 rule: prod.exhaust) here.
1570 * Attributes "cases", "induct", "coinduct" support "del" option.
1572 * Removed fact "case_split_thm", which duplicates "case_split".
1574 * The option datatype has been moved to a new theory Option. Renamed
1575 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1577 * New predicate "strict_mono" classifies strict functions on partial
1578 orders. With strict functions on linear orders, reasoning about
1579 (in)equalities is facilitated by theorems "strict_mono_eq",
1580 "strict_mono_less_eq" and "strict_mono_less".
1582 * Some set operations are now proper qualified constants with
1583 authentic syntax. INCOMPATIBILITY:
1594 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1597 * Auxiliary class "itself" has disappeared -- classes without any
1598 parameter are treated as expected by the 'class' command.
1600 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1602 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1603 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1605 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1606 method "approximation". It proves formulas on real values by using
1607 interval arithmetic. In the formulas are also the transcendental
1608 functions sin, cos, tan, atan, ln, exp and the constant pi are
1609 allowed. For examples see
1610 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1612 * Theory "Reflection" now resides in HOL/Library.
1614 * Entry point to Word library now simply named "Word".
1617 * Made source layout more coherent with logical distribution
1620 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1621 src/HOL/Library/Code_Message.thy ~> src/HOL/
1622 src/HOL/Library/GCD.thy ~> src/HOL/
1623 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1624 src/HOL/Library/Parity.thy ~> src/HOL/
1625 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1626 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1627 src/HOL/Real/Lubs.thy ~> src/HOL/
1628 src/HOL/Real/PReal.thy ~> src/HOL/
1629 src/HOL/Real/Rational.thy ~> src/HOL/
1630 src/HOL/Real/RComplete.thy ~> src/HOL/
1631 src/HOL/Real/RealDef.thy ~> src/HOL/
1632 src/HOL/Real/RealPow.thy ~> src/HOL/
1633 src/HOL/Real/Real.thy ~> src/HOL/
1634 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1635 src/HOL/Complex/Complex.thy ~> src/HOL/
1636 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1637 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1638 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1639 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1640 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1641 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1642 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1643 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1644 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1645 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1646 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1647 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1648 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1649 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1650 src/HOL/Real/Float ~> src/HOL/Library/
1651 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1652 src/HOL/Real/RealVector.thy ~> src/HOL/
1654 src/HOL/arith_data.ML ~> src/HOL/Tools
1655 src/HOL/hologic.ML ~> src/HOL/Tools
1656 src/HOL/simpdata.ML ~> src/HOL/Tools
1657 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1658 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1659 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1660 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1661 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1662 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1663 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1665 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1666 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1667 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1668 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1669 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1670 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1672 * If methods "eval" and "evaluation" encounter a structured proof
1673 state with !!/==>, only the conclusion is evaluated to True (if
1674 possible), avoiding strange error messages.
1676 * Method "sizechange" automates termination proofs using (a
1677 modification of) the size-change principle. Requires SAT solver. See
1678 src/HOL/ex/Termination.thy for examples.
1680 * Simplifier: simproc for let expressions now unfolds if bound
1681 variable occurs at most once in let expression body. INCOMPATIBILITY.
1683 * Method "arith": Linear arithmetic now ignores all inequalities when
1684 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1686 * New attribute "arith" for facts that should always be used
1687 automatically by arithmetic. It is intended to be used locally in
1690 assumes [arith]: "x > 0"
1692 Global usage is discouraged because of possible performance impact.
1694 * New classes "top" and "bot" with corresponding operations "top" and
1695 "bot" in theory Orderings; instantiation of class "complete_lattice"
1696 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1698 * Changed definition lemma "less_fun_def" in order to provide an
1699 instance for preorders on functions; use lemma "less_le" instead.
1702 * Theory Orderings: class "wellorder" moved here, with explicit
1703 induction rule "less_induct" as assumption. For instantiation of
1704 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1707 * Theory Orderings: added class "preorder" as superclass of "order".
1708 INCOMPATIBILITY: Instantiation proofs for order, linorder
1709 etc. slightly changed. Some theorems named order_class.* now named
1712 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1715 * Theory Finite_Set: added a new fold combinator of type
1717 ('a => 'b => 'b) => 'b => 'a set => 'b
1719 Occasionally this is more convenient than the old fold combinator
1720 which is now defined in terms of the new one and renamed to
1723 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1724 and "ring_simps" have been replaced by "algebra_simps" (which can be
1725 extended with further lemmas!). At the moment both still exist but
1726 the former will disappear at some point.
1728 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1729 class recpower. Type-specific simp rules for various recpower types
1730 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1732 rat_power_0 -> power_0
1733 rat_power_Suc -> power_Suc
1734 realpow_0 -> power_0
1735 realpow_Suc -> power_Suc
1736 complexpow_0 -> power_0
1737 complexpow_Suc -> power_Suc
1738 power_poly_0 -> power_0
1739 power_poly_Suc -> power_Suc
1741 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1742 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1743 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1744 of lemmas from Divides has been generalized from nat to class
1745 semiring_div. INCOMPATIBILITY. This involves the following theorem
1746 renames resulting from duplicate elimination:
1748 dvd_def_mod ~> dvd_eq_mod_eq_0
1749 zero_dvd_iff ~> dvd_0_left_iff
1750 dvd_0 ~> dvd_0_right
1751 DIVISION_BY_ZERO_DIV ~> div_by_0
1752 DIVISION_BY_ZERO_MOD ~> mod_by_0
1753 mult_div ~> div_mult_self2_is_id
1754 mult_mod ~> mod_mult_self2_is_0
1756 * Theory IntDiv: removed many lemmas that are instances of class-based
1757 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1758 rename old lemmas as follows:
1760 dvd_diff -> nat_dvd_diff
1761 dvd_zminus_iff -> dvd_minus_iff
1762 mod_add1_eq -> mod_add_eq
1763 mod_mult1_eq -> mod_mult_right_eq
1764 mod_mult1_eq' -> mod_mult_left_eq
1765 mod_mult_distrib_mod -> mod_mult_eq
1766 nat_mod_add_left_eq -> mod_add_left_eq
1767 nat_mod_add_right_eq -> mod_add_right_eq
1768 nat_mod_div_trivial -> mod_div_trivial
1769 nat_mod_mod_trivial -> mod_mod_trivial
1770 zdiv_zadd_self1 -> div_add_self1
1771 zdiv_zadd_self2 -> div_add_self2
1772 zdiv_zmult_self1 -> div_mult_self2_is_id
1773 zdiv_zmult_self2 -> div_mult_self1_is_id
1774 zdvd_triv_left -> dvd_triv_left
1775 zdvd_triv_right -> dvd_triv_right
1776 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1777 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1778 zmod_zadd_left_eq -> mod_add_left_eq
1779 zmod_zadd_right_eq -> mod_add_right_eq
1780 zmod_zadd_self1 -> mod_add_self1
1781 zmod_zadd_self2 -> mod_add_self2
1782 zmod_zadd1_eq -> mod_add_eq
1783 zmod_zdiff1_eq -> mod_diff_eq
1784 zmod_zdvd_zmod -> mod_mod_cancel
1785 zmod_zmod_cancel -> mod_mod_cancel
1786 zmod_zmult_self1 -> mod_mult_self2_is_0
1787 zmod_zmult_self2 -> mod_mult_self1_is_0
1790 zdvd_abs1 -> abs_dvd_iff
1791 zdvd_abs2 -> dvd_abs_iff
1792 zdvd_refl -> dvd_refl
1793 zdvd_trans -> dvd_trans
1794 zdvd_zadd -> dvd_add
1795 zdvd_zdiff -> dvd_diff
1796 zdvd_zminus_iff -> dvd_minus_iff
1797 zdvd_zminus2_iff -> minus_dvd_iff
1798 zdvd_zmultD -> dvd_mult_right
1799 zdvd_zmultD2 -> dvd_mult_left
1800 zdvd_zmult_mono -> mult_dvd_mono
1801 zdvd_0_right -> dvd_0_right
1802 zdvd_0_left -> dvd_0_left_iff
1803 zdvd_1_left -> one_dvd
1804 zminus_dvd_iff -> minus_dvd_iff
1806 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1808 * The real numbers offer decimal input syntax: 12.34 is translated
1809 into 1234/10^2. This translation is not reversed upon output.
1811 * Theory Library/Polynomial defines an abstract type 'a poly of
1812 univariate polynomials with coefficients of type 'a. In addition to
1813 the standard ring operations, it also supports div and mod. Code
1814 generation is also supported, using list-style constructors.
1816 * Theory Library/Inner_Product defines a class of real_inner for real
1817 inner product spaces, with an overloaded operation inner :: 'a => 'a
1818 => real. Class real_inner is a subclass of real_normed_vector from
1821 * Theory Library/Product_Vector provides instances for the product
1822 type 'a * 'b of several classes from RealVector and Inner_Product.
1823 Definitions of addition, subtraction, scalar multiplication, norms,
1824 and inner products are included.
1826 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1827 addition to the field operations, numerals and case syntax are also
1830 * Theory Library/Diagonalize provides constructive version of Cantor's
1831 first diagonalization argument.
1833 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1834 zlcm (for int); carried together from various gcd/lcm developements in
1835 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1836 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1837 may recover tupled syntax as follows:
1839 hide (open) const gcd
1840 abbreviation gcd where
1841 "gcd == (%(a, b). GCD.gcd a b)"
1843 GCD.gcd ("gcd '(_, _')")
1845 The same works for lcm, zgcd, zlcm.
1847 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1848 instantiations for algebraic structures. Removed some duplicate
1849 theorems. Changes in simp rules. INCOMPATIBILITY.
1851 * ML antiquotation @{code} takes a constant as argument and generates
1852 corresponding code in background and inserts name of the corresponding
1853 resulting ML value/function/datatype constructor binding in place.
1854 All occurrences of @{code} with a single ML block are generated
1855 simultaneously. Provides a generic and safe interface for
1856 instrumentalizing code generation. See
1857 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1858 In future you ought to refrain from ad-hoc compiling generated SML
1859 code on the ML toplevel. Note that (for technical reasons) @{code}
1860 cannot refer to constants for which user-defined serializations are
1861 set. Refer to the corresponding ML counterpart directly in that
1864 * Command 'rep_datatype': instead of theorem names the command now
1865 takes a list of terms denoting the constructors of the type to be
1866 represented as datatype. The characteristic theorems have to be
1867 proven. INCOMPATIBILITY. Also observe that the following theorems
1868 have disappeared in favour of existing ones:
1870 unit_induct ~> unit.induct
1871 prod_induct ~> prod.induct
1872 sum_induct ~> sum.induct
1873 Suc_Suc_eq ~> nat.inject
1874 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1879 * New locales for orders and lattices where the equivalence relation
1880 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1881 locales use a record structure with field eq for the equivalence.
1883 * New theory of factorial domains.
1885 * Units_l_inv and Units_r_inv are now simp rules by default.
1886 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1887 and/or r_inv will now also require deletion of these lemmas.
1889 * Renamed the following theorems, INCOMPATIBILITY:
1891 UpperD ~> Upper_memD
1892 LowerD ~> Lower_memD
1893 least_carrier ~> least_closed
1894 greatest_carrier ~> greatest_closed
1895 greatest_Lower_above ~> greatest_Lower_below
1896 one_zero ~> carrier_one_zero
1897 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1902 * Nominal datatypes can now contain type-variables.
1904 * Commands 'nominal_inductive' and 'equivariance' work with local
1907 * Nominal primrec can now works with local theory targets and its
1908 specification syntax now conforms to the general format as seen in
1911 * Method "perm_simp" honours the standard simplifier attributes
1912 (no_asm), (no_asm_use) etc.
1914 * The new predicate #* is defined like freshness, except that on the
1915 left hand side can be a set or list of atoms.
1917 * Experimental command 'nominal_inductive2' derives strong induction
1918 principles for inductive definitions. In contrast to
1919 'nominal_inductive', which can only deal with a fixed number of
1920 binders, it can deal with arbitrary expressions standing for sets of
1921 atoms to be avoided. The only inductive definition we have at the
1922 moment that needs this generalisation is the typing rule for Lets in
1925 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1926 -----------------------------------------------------------------
1927 Gamma |- Let x be t1 in t2 : T2
1929 In this rule one wants to avoid all the binders that are introduced by
1930 "close Gamma T1". We are looking for other examples where this
1931 feature might be useful. Please let us know.
1936 * Reimplemented the simplification procedure for proving continuity
1937 subgoals. The new simproc is extensible; users can declare additional
1938 continuity introduction rules with the attribute [cont2cont].
1940 * The continuity simproc now uses a different introduction rule for
1941 solving continuity subgoals on terms with lambda abstractions. In
1942 some rare cases the new simproc may fail to solve subgoals that the
1943 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1944 Potential INCOMPATIBILITY.
1946 * Command 'fixrec': specification syntax now conforms to the general
1947 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1948 examples. INCOMPATIBILITY.
1953 * Proof of Zorn's Lemma for partial orders.
1958 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1959 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1960 depends on multithreading, so timouts will not work before Poly/ML
1963 * High-level support for concurrent ML programming, see
1964 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1965 particularly convenient to organize independent functional
1966 computations. The concept of "synchronized variables" provides a
1967 higher-order interface for components with shared state, avoiding the
1968 delicate details of mutexes and condition variables. (Requires
1969 Poly/ML 5.2.1 or later.)
1971 * ML bindings produced via Isar commands are stored within the Isar
1972 context (theory or proof). Consequently, commands like 'use' and 'ML'
1973 become thread-safe and work with undo as expected (concerning
1974 top-level bindings, not side-effects on global references).
1975 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1976 compiler at runtime; really global bindings need to be given outside a
1977 theory. (Requires Poly/ML 5.2 or later.)
1979 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1980 context. Top-level ML bindings are stored within the proof context in
1981 a purely sequential fashion, disregarding the nested proof structure.
1982 ML bindings introduced by 'ML_prf' are discarded at the end of the
1983 proof. (Requires Poly/ML 5.2 or later.)
1985 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1986 and Method.setup, as well as Isar commands 'attribute_setup' and
1987 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1988 existing code accordingly, or use plain 'setup' together with old
1991 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1992 to 'a -> thm, while results are always tagged with an authentic oracle
1993 name. The Isar command 'oracle' is now polymorphic, no argument type
1994 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1995 accordingly. Note that extra performance may be gained by producing
1996 the cterm carefully, avoiding slow Thm.cterm_of.
1998 * Simplified interface for defining document antiquotations via
1999 ThyOutput.antiquotation, ThyOutput.output, and optionally
2000 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
2001 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
2004 * More systematic treatment of long names, abstract name bindings, and
2005 name space operations. Basic operations on qualified names have been
2006 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
2007 Long_Name.append. Old type bstring has been mostly replaced by
2008 abstract type binding (see structure Binding), which supports precise
2009 qualification by packages and local theory targets, as well as proper
2010 tracking of source positions. INCOMPATIBILITY, need to wrap old
2011 bstring values into Binding.name, or better pass through abstract
2012 bindings everywhere. See further src/Pure/General/long_name.ML,
2013 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
2015 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
2016 LocalTheory.note etc.) now refer to the *full* internal name, not the
2017 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
2019 * Disposed old type and term read functions (Sign.read_def_typ,
2020 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
2021 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
2022 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
2023 Syntax.read_term_global etc.; see also OldGoals.read_term as last
2024 resort for legacy applications.
2026 * Disposed old declarations, tactics, tactic combinators that refer to
2027 the simpset or claset of an implicit theory (such as Addsimps,
2028 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
2029 embedded ML text, or local_simpset_of with a proper context passed as
2030 explicit runtime argument.
2032 * Rules and tactics that read instantiations (read_instantiate,
2033 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
2034 context, which is required for parsing and type-checking. Moreover,
2035 the variables are specified as plain indexnames, not string encodings
2036 thereof. INCOMPATIBILITY.
2038 * Generic Toplevel.add_hook interface allows to analyze the result of
2039 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
2040 for theorem dependency output of transactions resulting in a new
2043 * ML antiquotations: block-structured compilation context indicated by
2044 \<lbrace> ... \<rbrace>; additional antiquotation forms:
2046 @{binding name} - basic name binding
2047 @{let ?pat = term} - term abbreviation (HO matching)
2048 @{note name = fact} - fact abbreviation
2049 @{thm fact} - singleton fact (with attributes)
2050 @{thms fact} - general fact (with attributes)
2051 @{lemma prop by method} - singleton goal
2052 @{lemma prop by meth1 meth2} - singleton goal
2053 @{lemma prop1 ... propN by method} - general goal
2054 @{lemma prop1 ... propN by meth1 meth2} - general goal
2055 @{lemma (open) ...} - open derivation
2060 * The Isabelle "emacs" tool provides a specific interface to invoke
2061 Proof General / Emacs, with more explicit failure if that is not
2062 installed (the old isabelle-interface script silently falls back on
2063 isabelle-process). The PROOFGENERAL_HOME setting determines the
2064 installation location of the Proof General distribution.
2066 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
2067 the Isabelle process into a JVM/Scala application. See
2068 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
2069 process wrapper has been discontinued.)
2071 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
2073 * Various status messages (with exact source position information) are
2074 emitted, if proper markup print mode is enabled. This allows
2075 user-interface components to provide detailed feedback on internal
2080 New in Isabelle2008 (June 2008)
2081 -------------------------------
2085 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
2086 and updated, with formally checked references as hyperlinks.
2088 * Theory loader: use_thy (and similar operations) no longer set the
2089 implicit ML context, which was occasionally hard to predict and in
2090 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
2091 provides a proper context already.
2093 * Theory loader: old-style ML proof scripts being *attached* to a thy
2094 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
2095 'use' within a theory file will do the job.
2097 * Name space merge now observes canonical order, i.e. the second space
2098 is inserted into the first one, while existing entries in the first
2099 space take precedence. INCOMPATIBILITY in rare situations, may try to
2100 swap theory imports.
2102 * Syntax: symbol \<chi> is now considered a letter. Potential
2103 INCOMPATIBILITY in identifier syntax etc.
2105 * Outer syntax: string tokens no longer admit escaped white space,
2106 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
2107 white space without escapes.
2109 * Outer syntax: string tokens may contain arbitrary character codes
2110 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
2116 * Context-dependent token translations. Default setup reverts locally
2117 fixed variables, and adds hilite markup for undeclared frees.
2119 * Unused theorems can be found using the new command 'unused_thms'.
2120 There are three ways of invoking it:
2123 Only finds unused theorems in the current theory.
2125 (2) unused_thms thy_1 ... thy_n -
2126 Finds unused theorems in the current theory and all of its ancestors,
2127 excluding the theories thy_1 ... thy_n and all of their ancestors.
2129 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
2130 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
2131 their ancestors, excluding the theories thy_1 ... thy_n and all of
2134 In order to increase the readability of the list produced by
2135 unused_thms, theorems that have been created by a particular instance
2136 of a theory command such as 'inductive' or 'function' are considered
2137 to belong to the same "group", meaning that if at least one theorem in
2138 this group is used, the other theorems in the same group are no longer
2139 reported as unused. Moreover, if all theorems in the group are
2140 unused, only one theorem in the group is displayed.
2142 Note that proof objects have to be switched on in order for
2143 unused_thms to work properly (i.e. !proofs must be >= 1, which is
2144 usually the case when using Proof General with the default settings).
2146 * Authentic naming of facts disallows ad-hoc overwriting of previous
2147 theorems within the same name space. INCOMPATIBILITY, need to remove
2148 duplicate fact bindings, or even accidental fact duplications. Note
2149 that tools may maintain dynamically scoped facts systematically, using
2150 PureThy.add_thms_dynamic.
2152 * Command 'hide' now allows to hide from "fact" name space as well.
2154 * Eliminated destructive theorem database, simpset, claset, and
2155 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
2156 update of theories within ML code.
2158 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
2159 INCOMPATIBILITY, object-logics depending on former Pure require
2160 additional setup PureThy.old_appl_syntax_setup; object-logics
2161 depending on former CPure need to refer to Pure.
2163 * Commands 'use' and 'ML' are now purely functional, operating on
2164 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
2165 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
2168 * Command 'setup': discontinued implicit version with ML reference.
2170 * Instantiation target allows for simultaneous specification of class
2171 instance operations together with an instantiation proof.
2172 Type-checking phase allows to refer to class operations uniformly.
2173 See src/HOL/Complex/Complex.thy for an Isar example and
2174 src/HOL/Library/Eval.thy for an ML example.
2176 * Indexing of literal facts: be more serious about including only
2177 facts from the visible specification/proof context, but not the
2178 background context (locale etc.). Affects `prop` notation and method
2179 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
2182 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
2183 "(open)" option, which used to expose internal bound variables to the
2186 * Isar statements: removed obsolete case "rule_context".
2187 INCOMPATIBILITY, better use explicit fixes/assumes.
2189 * Locale proofs: default proof step now includes 'unfold_locales';
2190 hence 'proof' without argument may be used to unfold locale
2194 *** Document preparation ***
2196 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
2197 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
2198 obsolete thumbpdf setup (contemporary PDF viewers do this on the
2199 spot); renamed link color from "darkblue" to "linkcolor" (default
2200 value unchanged, can be redefined via \definecolor); no longer sets
2201 "a4paper" option (unnecessary or even intrusive).
2203 * Antiquotation @{lemma A method} proves proposition A by the given
2204 method (either a method name or a method name plus (optional) method
2205 arguments in parentheses) and prints A just like @{prop A}.
2210 * New primrec package. Specification syntax conforms in style to
2211 definition/function/.... No separate induction rule is provided. The
2212 "primrec" command distinguishes old-style and new-style specifications
2213 by syntax. The former primrec package is now named OldPrimrecPackage.
2214 When adjusting theories, beware: constants stemming from new-style
2215 primrec specifications have authentic syntax.
2217 * Metis prover is now an order of magnitude faster, and also works
2218 with multithreading.
2220 * Metis: the maximum number of clauses that can be produced from a
2221 theorem is now given by the attribute max_clauses. Theorems that
2222 exceed this number are ignored, with a warning printed.
2224 * Sledgehammer no longer produces structured proofs by default. To
2225 enable, declare [[sledgehammer_full = true]]. Attributes
2226 reconstruction_modulus, reconstruction_sorts renamed
2227 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
2229 * Method "induct_scheme" derives user-specified induction rules
2230 from well-founded induction and completeness of patterns. This factors
2231 out some operations that are done internally by the function package
2232 and makes them available separately. See
2233 src/HOL/ex/Induction_Scheme.thy for examples.
2235 * More flexible generation of measure functions for termination
2236 proofs: Measure functions can be declared by proving a rule of the
2237 form "is_measure f" and giving it the [measure_function] attribute.
2238 The "is_measure" predicate is logically meaningless (always true), and
2239 just guides the heuristic. To find suitable measure functions, the
2240 termination prover sets up the goal "is_measure ?f" of the appropriate
2241 type and generates all solutions by prolog-style backwards proof using
2244 This setup also deals with rules like
2246 "is_measure f ==> is_measure (list_size f)"
2248 which accommodates nested datatypes that recurse through lists.
2249 Similar rules are predeclared for products and option types.
2251 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
2255 - Definitions of overloaded constants on sets have to be replaced by
2256 definitions on => and bool.
2258 - Some definitions of overloaded operators on sets can now be proved
2259 using the definitions of the operators on => and bool. Therefore,
2260 the following theorems have been renamed:
2262 subset_def -> subset_eq
2263 psubset_def -> psubset_eq
2264 set_diff_def -> set_diff_eq
2265 Compl_def -> Compl_eq
2266 Sup_set_def -> Sup_set_eq
2267 Inf_set_def -> Inf_set_eq
2268 sup_set_def -> sup_set_eq
2269 inf_set_def -> inf_set_eq
2271 - Due to the incompleteness of the HO unification algorithm, some
2272 rules such as subst may require manual instantiation, if some of
2273 the unknowns in the rule is a set.
2275 - Higher order unification and forward proofs:
2278 have "P (S::'a set)" <...>
2279 then have "EX S. P S" ..
2281 no longer works (due to the incompleteness of the HO unification
2282 algorithm) and must be replaced by the pattern
2289 - Calculational reasoning with subst (or similar rules):
2292 have "P (S::'a set)" <...>
2293 also have "S = T" <...>
2294 finally have "P T" .
2296 no longer works (for similar reasons as the previous example) and
2297 must be replaced by something like
2299 have "P (S::'a set)" <...>
2300 moreover have "S = T" <...>
2301 ultimately have "P T" by simp
2303 - Tactics or packages written in ML code:
2304 Code performing pattern matching on types via
2306 Type ("set", [T]) => ...
2308 must be rewritten. Moreover, functions like strip_type or
2309 binder_types no longer return the right value when applied to a
2312 T1 => ... => Tn => U => bool
2316 T1 => ... => Tn => U set
2318 * Merged theories Wellfounded_Recursion, Accessible_Part and
2319 Wellfounded_Relations to theory Wellfounded.
2321 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
2323 * Class finite no longer treats UNIV as class parameter. Use class
2324 enum from theory Library/Enum instead to achieve a similar effect.
2327 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
2328 and "Cons". INCOMPATIBILITY.
2330 * HOL (and FOL): renamed variables in rules imp_elim and swap.
2331 Potential INCOMPATIBILITY.
2333 * Theory Product_Type: duplicated lemmas split_Pair_apply and
2334 injective_fst_snd removed, use split_eta and prod_eqI instead.
2335 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
2337 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
2338 the same name in theory Orderings:
2348 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2349 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2350 and different variable names.
2352 * Library/Option_ord.thy: Canonical order on option type.
2354 * Library/RBT.thy: Red-black trees, an efficient implementation of
2357 * Library/Countable.thy: Type class for countable types.
2359 * Theory Int: The representation of numerals has changed. The infix
2360 operator BIT and the bit datatype with constructors B0 and B1 have
2361 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2362 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2363 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
2366 * Theory Nat: definition of <= and < on natural numbers no longer
2367 depend on well-founded relations. INCOMPATIBILITY. Definitions
2368 le_def and less_def have disappeared. Consider lemmas not_less
2369 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
2371 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
2372 (whose purpose mainly is for various fold_set functionals) have been
2373 abandoned in favor of the existing algebraic classes
2374 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
2375 lower_semilattice (resp. upper_semilattice) and linorder.
2378 * Theory Transitive_Closure: induct and cases rules now declare proper
2379 case_names ("base" and "step"). INCOMPATIBILITY.
2381 * Theorem Inductive.lfp_ordinal_induct generalized to complete
2382 lattices. The form set-specific version is available as
2383 Inductive.lfp_ordinal_induct_set.
2385 * Renamed theorems "power.simps" to "power_int.simps".
2388 * Class semiring_div provides basic abstract properties of semirings
2389 with division and modulo operations. Subsumes former class dvd_mod.
2391 * Merged theories IntDef, Numeral and IntArith into unified theory
2392 Int. INCOMPATIBILITY.
2394 * Theory Library/Code_Index: type "index" now represents natural
2395 numbers rather than integers. INCOMPATIBILITY.
2397 * New class "uminus" with operation "uminus" (split of from class
2398 "minus" which now only has operation "minus", binary).
2401 * Constants "card", "internal_split", "option_map" now with authentic
2402 syntax. INCOMPATIBILITY.
2404 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
2405 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
2406 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
2407 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
2408 Sup_set_def, le_def, less_def, option_map_def now with object
2409 equality. INCOMPATIBILITY.
2411 * Records. Removed K_record, and replaced it by pure lambda term
2412 %x. c. The simplifier setup is now more robust against eta expansion.
2413 INCOMPATIBILITY: in cases explicitly referring to K_record.
2415 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
2417 * Library/ListVector: new theory of arithmetic vector operations.
2419 * Library/Order_Relation: new theory of various orderings as sets of
2420 pairs. Defines preorders, partial orders, linear orders and
2421 well-orders on sets and on types.
2426 * Renamed some theories to allow to loading both ZF and HOL in the
2429 Datatype -> Datatype_ZF
2430 Inductive -> Inductive_ZF
2437 INCOMPATIBILITY: ZF theories that import individual theories below
2438 Main might need to be adapted. Regular theory Main is still
2439 available, as trivial extension of Main_ZF.
2444 * ML within Isar: antiquotation @{const name} or @{const
2445 name(typargs)} produces statically-checked Const term.
2447 * Functor NamedThmsFun: data is available to the user as dynamic fact
2448 (of the same name). Removed obsolete print command.
2450 * Removed obsolete "use_legacy_bindings" function.
2452 * The ``print mode'' is now a thread-local value derived from a global
2453 template (the former print_mode reference), thus access becomes
2454 non-critical. The global print_mode reference is for session
2455 management only; user-code should use print_mode_value,
2456 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
2458 * Functions system/system_out provide a robust way to invoke external
2459 shell commands, with propagation of interrupts (requires Poly/ML
2460 5.2.1). Do not use OS.Process.system etc. from the basis library!
2465 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2466 in accordance with Proof General 3.7, which prefers GNU emacs.
2468 * isatool tty runs Isabelle process with plain tty interaction;
2469 optional line editor may be specified via ISABELLE_LINE_EDITOR
2470 setting, the default settings attempt to locate "ledit" and "rlwrap".
2472 * isatool browser now works with Cygwin as well, using general
2473 "javapath" function defined in Isabelle process environment.
2475 * YXML notation provides a simple and efficient alternative to
2476 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2477 isatool yxml as described in the Isabelle system manual.
2479 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2480 provides general wrapper for managing an Isabelle process in a robust
2481 fashion, with ``cooked'' output from stdin/stderr.
2483 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2484 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2486 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2487 way of changing the user's settings is via
2488 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2491 * Multithreading.max_threads := 0 refers to the number of actual CPU
2492 cores of the underlying machine, which is a good starting point for
2493 optimal performance tuning. The corresponding usedir option -M allows
2494 "max" as an alias for "0". WARNING: does not work on certain versions
2495 of Mac OS (with Poly/ML 5.1).
2497 * isabelle-process: non-ML sessions are run with "nice", to reduce the
2498 adverse effect of Isabelle flooding interactive front-ends (notably
2499 ProofGeneral / XEmacs).
2503 New in Isabelle2007 (November 2007)
2504 -----------------------------------
2508 * More uniform information about legacy features, notably a
2509 warning/error of "Legacy feature: ...", depending on the state of the
2510 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
2511 legacy features will disappear eventually.
2513 * Theory syntax: the header format ``theory A = B + C:'' has been
2514 discontinued in favour of ``theory A imports B C begin''. Use isatool
2515 fixheaders to convert existing theory files. INCOMPATIBILITY.
2517 * Theory syntax: the old non-Isar theory file format has been
2518 discontinued altogether. Note that ML proof scripts may still be used
2519 with Isar theories; migration is usually quite simple with the ML
2520 function use_legacy_bindings. INCOMPATIBILITY.
2522 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2523 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2526 * Theory loader: be more serious about observing the static theory
2527 header specifications (including optional directories), but not the
2528 accidental file locations of previously successful loads. The strict
2529 update policy of former update_thy is now already performed by
2530 use_thy, so the former has been removed; use_thys updates several
2531 theories simultaneously, just as 'imports' within a theory header
2532 specification, but without merging the results. Potential
2533 INCOMPATIBILITY: may need to refine theory headers and commands
2534 ROOT.ML which depend on load order.
2536 * Theory loader: optional support for content-based file
2537 identification, instead of the traditional scheme of full physical
2538 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2539 (cf. the system manual). The new scheme allows to work with
2540 non-finished theories in persistent session images, such that source
2541 files may be moved later on without requiring reloads.
2543 * Theory loader: old-style ML proof scripts being *attached* to a thy
2544 file (with the same base name as the theory) are considered a legacy
2545 feature, which will disappear eventually. Even now, the theory loader
2546 no longer maintains dependencies on such files.
2548 * Syntax: the scope for resolving ambiguities via type-inference is
2549 now limited to individual terms, instead of whole simultaneous
2550 specifications as before. This greatly reduces the complexity of the
2551 syntax module and improves flexibility by separating parsing and
2552 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2553 'fixes' etc.) are required in rare situations.
2555 * Syntax: constants introduced by new-style packages ('definition',
2556 'abbreviation' etc.) are passed through the syntax module in
2557 ``authentic mode''. This means that associated mixfix annotations
2558 really stick to such constants, independently of potential name space
2559 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2560 trees are represented slightly differently, may need to adapt syntax
2561 translations accordingly. Use CONST marker in 'translations' and
2562 @{const_syntax} antiquotation in 'parse_translation' etc.
2564 * Legacy goal package: reduced interface to the bare minimum required
2565 to keep existing proof scripts running. Most other user-level
2566 functions are now part of the OldGoals structure, which is *not* open
2567 by default (consider isatool expandshort before open OldGoals).
2568 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2569 these tend to cause confusion about the actual goal (!) context being
2570 used here, which is not necessarily the same as the_context().
2572 * Command 'find_theorems': supports "*" wild-card in "name:"
2573 criterion; "with_dups" option. Certain ProofGeneral versions might
2574 support a specific search form (see ProofGeneral/CHANGES).
2576 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2577 by default, which means that "prems" (and also "fixed variables") are
2578 suppressed from proof state output. Note that the ProofGeneral
2579 settings mechanism allows to change and save options persistently, but
2580 older versions of Isabelle will fail to start up if a negative prems
2583 * Local theory targets may be specified by non-nested blocks of
2584 ``context/locale/class ... begin'' followed by ``end''. The body may
2585 contain definitions, theorems etc., including any derived mechanism
2586 that has been implemented on top of these primitives. This concept
2587 generalizes the existing ``theorem (in ...)'' towards more versatility
2590 * Proof General interface: proper undo of final 'end' command;
2591 discontinued Isabelle/classic mode (ML proof scripts).
2594 *** Document preparation ***
2596 * Added antiquotation @{theory name} which prints the given name,
2597 after checking that it refers to a valid ancestor theory in the
2600 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2601 check the given source text as ML type/structure, printing verbatim.
2603 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2604 "c args == rhs" given in the current context. (Any number of
2605 arguments may be given on the LHS.)
2610 * The 'class' package offers a combination of axclass and locale to
2611 achieve Haskell-like type classes in Isabelle. Definitions and
2612 theorems within a class context produce both relative results (with
2613 implicit parameters according to the locale context), and polymorphic
2614 constants with qualified polymorphism (according to the class
2615 context). Within the body context of a 'class' target, a separate
2616 syntax layer ("user space type system") takes care of converting
2617 between global polymorphic consts and internal locale representation.
2618 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2619 "isatool doc classes" provides a tutorial.
2621 * Generic code generator framework allows to generate executable
2622 code for ML and Haskell (including Isabelle classes). A short usage
2625 internal compilation:
2626 export_code <list of constants (term syntax)> in SML
2627 writing SML code to a file:
2628 export_code <list of constants (term syntax)> in SML <filename>
2629 writing OCaml code to a file:
2630 export_code <list of constants (term syntax)> in OCaml <filename>
2631 writing Haskell code to a bunch of files:
2632 export_code <list of constants (term syntax)> in Haskell <filename>
2634 evaluating closed propositions to True/False using code generation:
2637 Reasonable default setup of framework in HOL.
2639 Theorem attributs for selecting and transforming function equations theorems:
2641 [code fun]: select a theorem as function equation for a specific constant
2642 [code fun del]: deselect a theorem as function equation for a specific constant
2643 [code inline]: select an equation theorem for unfolding (inlining) in place
2644 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2646 User-defined serializations (target in {SML, OCaml, Haskell}):
2648 code_const <and-list of constants (term syntax)>
2649 {(target) <and-list of const target syntax>}+
2651 code_type <and-list of type constructors>
2652 {(target) <and-list of type target syntax>}+
2654 code_instance <and-list of instances>
2656 where instance ::= <type constructor> :: <class>
2658 code_class <and_list of classes>
2659 {(target) <and-list of class target syntax>}+
2660 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2662 code_instance and code_class only are effective to target Haskell.
2664 For example usage see src/HOL/ex/Codegenerator.thy and
2665 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2666 generation from Isabelle/HOL theories is available via "isatool doc
2669 * Code generator: consts in 'consts_code' Isar commands are now
2670 referred to by usual term syntax (including optional type
2673 * Command 'no_translations' removes translation rules from theory
2676 * Overloaded definitions are now actually checked for acyclic
2677 dependencies. The overloading scheme is slightly more general than
2678 that of Haskell98, although Isabelle does not demand an exact
2679 correspondence to type class and instance declarations.
2680 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2681 exotic versions of overloading -- at the discretion of the user!
2683 Polymorphic constants are represented via type arguments, i.e. the
2684 instantiation that matches an instance against the most general
2685 declaration given in the signature. For example, with the declaration
2686 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2687 as c(nat). Overloading is essentially simultaneous structural
2688 recursion over such type arguments. Incomplete specification patterns
2689 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2690 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2691 Command 'print_theory' outputs the normalized system of recursive
2692 equations, see section "definitions".
2694 * Configuration options are maintained within the theory or proof
2695 context (with name and type bool/int/string), providing a very simple
2696 interface to a poor-man's version of general context data. Tools may
2697 declare options in ML (e.g. using Attrib.config_int) and then refer to
2698 these values using Config.get etc. Users may change options via an
2699 associated attribute of the same name. This form of context
2700 declaration works particularly well with commands 'declare' or
2701 'using', for example ``declare [[foo = 42]]''. Thus it has become
2702 very easy to avoid global references, which would not observe Isar
2703 toplevel undo/redo and fail to work with multithreading.
2705 Various global ML references of Pure and HOL have been turned into
2706 configuration options:
2708 Unify.search_bound unify_search_bound
2709 Unify.trace_bound unify_trace_bound
2710 Unify.trace_simp unify_trace_simp
2711 Unify.trace_types unify_trace_types
2712 Simplifier.simp_depth_limit simp_depth_limit
2713 Blast.depth_limit blast_depth_limit
2714 DatatypeProp.dtK datatype_distinctness_limit
2715 fast_arith_neq_limit fast_arith_neq_limit
2716 fast_arith_split_limit fast_arith_split_limit
2718 * Named collections of theorems may be easily installed as context
2719 data using the functor NamedThmsFun (see also
2720 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2721 attributes; there is also a toplevel print command. This facility is
2722 just a common case of general context data, which is the preferred way
2723 for anything more complex than just a list of facts in canonical
2726 * Isar: command 'declaration' augments a local theory by generic
2727 declaration functions written in ML. This enables arbitrary content
2728 being added to the context, depending on a morphism that tells the
2729 difference of the original declaration context wrt. the application
2730 context encountered later on.
2732 * Isar: proper interfaces for simplification procedures. Command
2733 'simproc_setup' declares named simprocs (with match patterns, and body
2734 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2735 context. ML antiquotation @{simproc name} retrieves named simprocs.
2737 * Isar: an extra pair of brackets around attribute declarations
2738 abbreviates a theorem reference involving an internal dummy fact,
2739 which will be ignored later --- only the effect of the attribute on
2740 the background context will persist. This form of in-place
2741 declarations is particularly useful with commands like 'declare' and
2742 'using', for example ``have A using [[simproc a]] by simp''.
2744 * Isar: method "assumption" (and implicit closing of subproofs) now
2745 takes simple non-atomic goal assumptions into account: after applying
2746 an assumption as a rule the resulting subgoals are solved by atomic
2747 assumption steps. This is particularly useful to finish 'obtain'
2748 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2749 without referring to the original premise "!!x. P x ==> thesis" in the
2750 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2753 * Isar: implicit use of prems from the Isar proof context is
2754 considered a legacy feature. Common applications like ``have A .''
2755 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2756 referencing facts explicitly here improves readability and
2757 maintainability of proof texts.
2759 * Isar: improper proof element 'guess' is like 'obtain', but derives
2760 the obtained context from the course of reasoning! For example:
2762 assume "EX x y. A x & B y" -- "any previous fact"
2763 then guess x and y by clarify
2765 This technique is potentially adventurous, depending on the facts and
2766 proof tools being involved here.
2768 * Isar: known facts from the proof context may be specified as literal
2769 propositions, using ASCII back-quote syntax. This works wherever
2770 named facts used to be allowed so far, in proof commands, proof
2771 methods, attributes etc. Literal facts are retrieved from the context
2772 according to unification of type and term parameters. For example,
2773 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2774 theorems in the current context, then these are valid literal facts:
2775 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2777 There is also a proof method "fact" which does the same composition
2778 for explicit goal states, e.g. the following proof texts coincide with
2779 certain special cases of literal facts:
2781 have "A" by fact == note `A`
2782 have "A ==> B" by fact == note `A ==> B`
2783 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2784 have "P a ==> Q a" by fact == note `P a ==> Q a`
2786 * Isar: ":" (colon) is no longer a symbolic identifier character in
2787 outer syntax. Thus symbolic identifiers may be used without
2788 additional white space in declarations like this: ``assume *: A''.
2790 * Isar: 'print_facts' prints all local facts of the current context,
2791 both named and unnamed ones.
2793 * Isar: 'def' now admits simultaneous definitions, e.g.:
2795 def x == "t" and y == "u"
2797 * Isar: added command 'unfolding', which is structurally similar to
2798 'using', but affects both the goal state and facts by unfolding given
2799 rewrite rules. Thus many occurrences of the 'unfold' method or
2800 'unfolded' attribute may be replaced by first-class proof text.
2802 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2803 and command 'unfolding' now all support object-level equalities
2804 (potentially conditional). The underlying notion of rewrite rule is
2805 analogous to the 'rule_format' attribute, but *not* that of the
2806 Simplifier (which is usually more generous).
2808 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2809 premises of a theorem by n. Useful in conjunction with drule.
2811 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2812 method expression within a sandbox consisting of the first N
2813 sub-goals, which need to exist. For example, ``simp_all [3]''
2814 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2815 simplifies all new goals that emerge from applying rule foo to the
2816 originally first one.
2818 * Isar: schematic goals are no longer restricted to higher-order
2819 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2822 * Isar: the conclusion of a long theorem statement is now either
2823 'shows' (a simultaneous conjunction, as before), or 'obtains'
2824 (essentially a disjunction of cases with local parameters and
2825 assumptions). The latter allows to express general elimination rules
2826 adequately; in this notation common elimination rules look like this:
2828 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2830 obtains x where "P x"
2832 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2836 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2842 The subsequent classical rules even refer to the formal "thesis"
2845 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2848 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2849 obtains "thesis ==> something"
2851 The actual proof of an 'obtains' statement is analogous to that of the
2852 Isar proof element 'obtain', only that there may be several cases.
2853 Optional case names may be specified in parentheses; these will be
2854 available both in the present proof and as annotations in the
2855 resulting rule, for later use with the 'cases' method (cf. attribute
2858 * Isar: the assumptions of a long theorem statement are available as
2859 "assms" fact in the proof context. This is more appropriate than the
2860 (historical) "prems", which refers to all assumptions of the current
2861 context, including those from the target locale, proof body etc.
2863 * Isar: 'print_statement' prints theorems from the current theory or
2864 proof context in long statement form, according to the syntax of a
2867 * Isar: 'obtain' takes an optional case name for the local context
2868 introduction rule (default "that").
2870 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2871 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2874 * Pure: syntax "CONST name" produces a fully internalized constant
2875 according to the current context. This is particularly useful for
2876 syntax translations that should refer to internal constant
2877 representations independently of name spaces.
2879 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2880 instead of "FOO ". This allows multiple binder declarations to coexist
2881 in the same context. INCOMPATIBILITY.
2883 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2884 primitive that also works in a locale context (both for constants and
2885 fixed variables). Type declaration and internal syntactic representation
2886 of given constants retrieved from the context. Likewise, the
2887 'no_notation' command allows to remove given syntax annotations from the
2890 * Isar/locales: new derived specification elements 'axiomatization',
2891 'definition', 'abbreviation', which support type-inference, admit
2892 object-level specifications (equality, equivalence). See also the
2893 isar-ref manual. Examples:
2896 eq (infix "===" 50) where
2897 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2899 definition "f x y = x + y + 1"
2900 definition g where "g x = f x x"
2903 neq (infix "=!=" 50) where
2904 "x =!= y == ~ (x === y)"
2906 These specifications may be also used in a locale context. Then the
2907 constants being introduced depend on certain fixed parameters, and the
2908 constant name is qualified by the locale base name. An internal
2909 abbreviation takes care for convenient input and output, making the
2910 parameters implicit and using the original short name. See also
2911 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2912 entities from a monomorphic theory.
2914 Presently, abbreviations are only available 'in' a target locale, but
2915 not inherited by general import expressions. Also note that
2916 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2917 'translations' in common applications. The "no_abbrevs" print mode
2918 prevents folding of abbreviations in term output.
2920 Concrete syntax is attached to specified constants in internal form,
2921 independently of name spaces. The parse tree representation is
2922 slightly different -- use 'notation' instead of raw 'syntax', and
2923 'translations' with explicit "CONST" markup to accommodate this.
2925 * Pure/Isar: unified syntax for new-style specification mechanisms
2926 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2927 full type inference and dummy patterns ("_"). For example:
2929 definition "K x _ = x"
2931 inductive conj for A B
2932 where "A ==> B ==> conj A B"
2934 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2935 the current context. Print mode "no_abbrevs" prevents inversion of
2936 abbreviations on output.
2938 * Isar/locales: improved parameter handling: use of locales "var" and
2939 "struct" no longer necessary; - parameter renamings are no longer
2940 required to be injective. For example, this allows to define
2941 endomorphisms as locale endom = homom mult mult h.
2943 * Isar/locales: changed the way locales with predicates are defined.
2944 Instead of accumulating the specification, the imported expression is
2945 now an interpretation. INCOMPATIBILITY: different normal form of
2946 locale expressions. In particular, in interpretations of locales with
2947 predicates, goals repesenting already interpreted fragments are not
2948 removed automatically. Use methods `intro_locales' and
2949 `unfold_locales'; see below.
2951 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2952 provide backward reasoning on locales predicates. The methods are
2953 aware of interpretations and discharge corresponding goals.
2954 `intro_locales' is less aggressive then `unfold_locales' and does not
2955 unfold predicates to assumptions.
2957 * Isar/locales: the order in which locale fragments are accumulated
2958 has changed. This enables to override declarations from fragments due
2959 to interpretations -- for example, unwanted simp rules.
2961 * Isar/locales: interpretation in theories and proof contexts has been
2962 extended. One may now specify (and prove) equations, which are
2963 unfolded in interpreted theorems. This is useful for replacing
2964 defined concepts (constants depending on locale parameters) by
2965 concepts already existing in the target context. Example:
2967 interpretation partial_order ["op <= :: [int, int] => bool"]
2968 where "partial_order.less (op <=) (x::int) y = (x < y)"
2970 Typically, the constant `partial_order.less' is created by a
2971 definition specification element in the context of locale
2974 * Method "induct": improved internal context management to support
2975 local fixes and defines on-the-fly. Thus explicit meta-level
2976 connectives !! and ==> are rarely required anymore in inductive goals
2977 (using object-logic connectives for this purpose has been long
2978 obsolete anyway). Common proof patterns are explained in
2979 src/HOL/Induct/Common_Patterns.thy, see also
2980 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2983 * Method "induct": improved handling of simultaneous goals. Instead of
2984 introducing object-level conjunction, the statement is now split into
2985 several conclusions, while the corresponding symbolic cases are nested
2986 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2987 see src/HOL/Induct/Common_Patterns.thy, for example.
2989 * Method "induct": mutual induction rules are now specified as a list
2990 of rule sharing the same induction cases. HOL packages usually provide
2991 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2992 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2993 mutual induction rules differently, i.e. like this:
2995 (induct rule: foo_bar.inducts)
2996 (induct set: foo bar)
2997 (induct pred: foo bar)
2998 (induct type: foo bar)
3000 The ML function ProjectRule.projections turns old-style rules into the
3003 * Method "coinduct": dual of induction, see
3004 src/HOL/Library/Coinductive_List.thy for various examples.
3006 * Method "cases", "induct", "coinduct": the ``(open)'' option is
3007 considered a legacy feature.
3009 * Attribute "symmetric" produces result with standardized schematic
3010 variables (index 0). Potential INCOMPATIBILITY.
3012 * Simplifier: by default the simplifier trace only shows top level
3013 rewrites now. That is, trace_simp_depth_limit is set to 1 by
3014 default. Thus there is less danger of being flooded by the trace. The
3015 trace indicates where parts have been suppressed.
3017 * Provers/classical: removed obsolete classical version of elim_format
3018 attribute; classical elim/dest rules are now treated uniformly when
3019 manipulating the claset.
3021 * Provers/classical: stricter checks to ensure that supplied intro,
3022 dest and elim rules are well-formed; dest and elim rules must have at
3025 * Provers/classical: attributes dest/elim/intro take an optional
3026 weight argument for the rule (just as the Pure versions). Weights are
3027 ignored by automated tools, but determine the search order of single
3030 * Syntax: input syntax now supports dummy variable binding "%_. b",
3031 where the body does not mention the bound variable. Note that dummy
3032 patterns implicitly depend on their context of bounds, which makes
3033 "{_. _}" match any set comprehension as expected. Potential
3034 INCOMPATIBILITY -- parse translations need to cope with syntactic
3035 constant "_idtdummy" in the binding position.
3037 * Syntax: removed obsolete syntactic constant "_K" and its associated
3038 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
3039 for example "A -> B" => "Pi A (%_. B)".
3041 * Pure: 'class_deps' command visualizes the subclass relation, using
3042 the graph browser tool.
3044 * Pure: 'print_theory' now suppresses certain internal declarations by
3045 default; use '!' option for full details.
3050 * Method "metis" proves goals by applying the Metis general-purpose
3051 resolution prover (see also http://gilith.com/software/metis/).
3052 Examples are in the directory MetisExamples. WARNING: the
3053 Isabelle/HOL-Metis integration does not yet work properly with
3056 * Command 'sledgehammer' invokes external automatic theorem provers as
3057 background processes. It generates calls to the "metis" method if
3058 successful. These can be pasted into the proof. Users do not have to
3059 wait for the automatic provers to return. WARNING: does not really
3060 work with multi-threading.
3062 * New "auto_quickcheck" feature tests outermost goal statements for
3063 potential counter-examples. Controlled by ML references
3064 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
3065 5000 milliseconds). Fails silently if statements is outside of
3066 executable fragment, or any other codgenerator problem occurs.
3068 * New constant "undefined" with axiom "undefined x = undefined".
3070 * Added class "HOL.eq", allowing for code generation with polymorphic
3073 * Some renaming of class constants due to canonical name prefixing in
3074 the new 'class' package:
3076 HOL.abs ~> HOL.abs_class.abs
3077 HOL.divide ~> HOL.divide_class.divide
3078 0 ~> HOL.zero_class.zero
3079 1 ~> HOL.one_class.one
3080 op + ~> HOL.plus_class.plus
3081 op - ~> HOL.minus_class.minus
3082 uminus ~> HOL.minus_class.uminus
3083 op * ~> HOL.times_class.times
3084 op < ~> HOL.ord_class.less
3085 op <= > HOL.ord_class.less_eq
3086 Nat.power ~> Power.power_class.power
3087 Nat.size ~> Nat.size_class.size
3088 Numeral.number_of ~> Numeral.number_class.number_of
3089 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
3090 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
3091 Orderings.min ~> Orderings.ord_class.min
3092 Orderings.max ~> Orderings.ord_class.max
3093 Divides.op div ~> Divides.div_class.div
3094 Divides.op mod ~> Divides.div_class.mod
3095 Divides.op dvd ~> Divides.div_class.dvd
3097 INCOMPATIBILITY. Adaptions may be required in the following cases:
3099 a) User-defined constants using any of the names "plus", "minus",
3100 "times", "less" or "less_eq". The standard syntax translations for
3101 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
3104 b) Variables named "plus", "minus", "times", "less", "less_eq"
3105 INCOMPATIBILITY: use more specific names.
3107 c) Permutative equations (e.g. "a + b = b + a")
3108 Since the change of names also changes the order of terms, permutative
3109 rewrite rules may get applied in a different order. Experience shows
3110 that this is rarely the case (only two adaptions in the whole Isabelle
3111 distribution). INCOMPATIBILITY: rewrite proofs
3113 d) ML code directly refering to constant names
3114 This in general only affects hand-written proof tactics, simprocs and
3115 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
3116 Consider using @{const_name} antiquotation.
3118 * New class "default" with associated constant "default".
3120 * Function "sgn" is now overloaded and available on int, real, complex
3121 (and other numeric types), using class "sgn". Two possible defs of
3122 sgn are given as equational assumptions in the classes sgn_if and
3123 sgn_div_norm; ordered_idom now also inherits from sgn_if.
3126 * Locale "partial_order" now unified with class "order" (cf. theory
3127 Orderings), added parameter "less". INCOMPATIBILITY.
3129 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
3130 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
3131 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
3133 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
3134 changed order of proof goals in instance proofs.
3136 * The transitivity reasoner for partial and linear orders is set up
3137 for classes "order" and "linorder". Instances of the reasoner are available
3138 in all contexts importing or interpreting the corresponding locales.
3139 Method "order" invokes the reasoner separately; the reasoner
3140 is also integrated with the Simplifier as a solver. Diagnostic
3141 command 'print_orders' shows the available instances of the reasoner
3142 in the current context.
3144 * Localized monotonicity predicate in theory "Orderings"; integrated
3145 lemmas max_of_mono and min_of_mono with this predicate.
3148 * Formulation of theorem "dense" changed slightly due to integration
3149 with new class dense_linear_order.
3151 * Uniform lattice theory development in HOL.
3153 constants "meet" and "join" now named "inf" and "sup"
3154 constant "Meet" now named "Inf"
3156 classes "meet_semilorder" and "join_semilorder" now named
3157 "lower_semilattice" and "upper_semilattice"
3158 class "lorder" now named "lattice"
3159 class "comp_lat" now named "complete_lattice"
3161 Instantiation of lattice classes allows explicit definitions
3162 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
3164 INCOMPATIBILITY. Theorem renames:
3166 meet_left_le ~> inf_le1
3167 meet_right_le ~> inf_le2
3168 join_left_le ~> sup_ge1
3169 join_right_le ~> sup_ge2
3170 meet_join_le ~> inf_sup_ord
3173 le_meet ~> le_inf_iff
3174 le_join ~> ge_sup_conv
3175 meet_idempotent ~> inf_idem
3176 join_idempotent ~> sup_idem
3177 meet_comm ~> inf_commute
3178 join_comm ~> sup_commute
3179 meet_leI1 ~> le_infI1
3180 meet_leI2 ~> le_infI2
3181 le_joinI1 ~> le_supI1
3182 le_joinI2 ~> le_supI2
3183 meet_assoc ~> inf_assoc
3184 join_assoc ~> sup_assoc
3185 meet_left_comm ~> inf_left_commute
3186 meet_left_idempotent ~> inf_left_idem
3187 join_left_comm ~> sup_left_commute
3188 join_left_idempotent ~> sup_left_idem
3191 le_def_meet ~> le_iff_inf
3192 le_def_join ~> le_iff_sup
3193 join_absorp2 ~> sup_absorb2
3194 join_absorp1 ~> sup_absorb1
3195 meet_absorp1 ~> inf_absorb1
3196 meet_absorp2 ~> inf_absorb2
3197 meet_join_absorp ~> inf_sup_absorb
3198 join_meet_absorp ~> sup_inf_absorb
3199 distrib_join_le ~> distrib_sup_le
3200 distrib_meet_le ~> distrib_inf_le
3202 add_meet_distrib_left ~> add_inf_distrib_left
3203 add_join_distrib_left ~> add_sup_distrib_left
3204 is_join_neg_meet ~> is_join_neg_inf
3205 is_meet_neg_join ~> is_meet_neg_sup
3206 add_meet_distrib_right ~> add_inf_distrib_right
3207 add_join_distrib_right ~> add_sup_distrib_right
3208 add_meet_join_distribs ~> add_sup_inf_distribs
3209 join_eq_neg_meet ~> sup_eq_neg_inf
3210 meet_eq_neg_join ~> inf_eq_neg_sup
3211 add_eq_meet_join ~> add_eq_inf_sup
3212 meet_0_imp_0 ~> inf_0_imp_0
3213 join_0_imp_0 ~> sup_0_imp_0
3214 meet_0_eq_0 ~> inf_0_eq_0
3215 join_0_eq_0 ~> sup_0_eq_0
3216 neg_meet_eq_join ~> neg_inf_eq_sup
3217 neg_join_eq_meet ~> neg_sup_eq_inf
3218 join_eq_if ~> sup_eq_if
3220 mono_meet ~> mono_inf
3221 mono_join ~> mono_sup
3222 meet_bool_eq ~> inf_bool_eq
3223 join_bool_eq ~> sup_bool_eq
3224 meet_fun_eq ~> inf_fun_eq
3225 join_fun_eq ~> sup_fun_eq
3226 meet_set_eq ~> inf_set_eq
3227 join_set_eq ~> sup_set_eq
3228 meet1_iff ~> inf1_iff
3229 meet2_iff ~> inf2_iff
3238 join1_iff ~> sup1_iff
3239 join2_iff ~> sup2_iff
3249 is_meet_Meet ~> is_meet_Inf
3250 Meet_bool_def ~> Inf_bool_def
3251 Meet_fun_def ~> Inf_fun_def
3252 Meet_greatest ~> Inf_greatest
3253 Meet_lower ~> Inf_lower
3254 Meet_set_def ~> Inf_set_def
3257 Sup_bool_eq ~> Sup_bool_def
3258 Sup_fun_eq ~> Sup_fun_def
3259 Sup_set_eq ~> Sup_set_def
3261 listsp_meetI ~> listsp_infI
3262 listsp_meet_eq ~> listsp_inf_eq
3267 * Added syntactic class "size"; overloaded constant "size" now has
3268 type "'a::size ==> bool"
3270 * Internal reorganisation of `size' of datatypes: size theorems
3271 "foo.size" are no longer subsumed by "foo.simps" (but are still
3272 simplification rules by default!); theorems "prod.size" now named
3275 * Class "div" now inherits from class "times" rather than "type".
3278 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
3279 Linorder etc. have disappeared; operations defined in terms of
3280 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
3282 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
3284 * HOL-Word: New extensive library and type for generic, fixed size
3285 machine words, with arithemtic, bit-wise, shifting and rotating
3286 operations, reflection into int, nat, and bool lists, automation for
3287 linear arithmetic (by automatic reflection into nat or int), including
3288 lemmas on overflow and monotonicity. Instantiated to all appropriate
3289 arithmetic type classes, supporting automatic simplification of
3290 numerals on all operations.
3292 * Library/Boolean_Algebra: locales for abstract boolean algebras.
3294 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
3296 * Code generator library theories:
3297 - Code_Integer represents HOL integers by big integer literals in target
3299 - Code_Char represents HOL characters by character literals in target
3301 - Code_Char_chr like Code_Char, but also offers treatment of character
3302 codes; includes Code_Integer.
3303 - Executable_Set allows to generate code for finite sets using lists.
3304 - Executable_Rat implements rational numbers as triples (sign, enumerator,
3306 - Executable_Real implements a subset of real numbers, namly those
3307 representable by rational numbers.
3308 - Efficient_Nat implements natural numbers by integers, which in general will
3309 result in higher efficency; pattern matching with 0/Suc is eliminated;
3310 includes Code_Integer.
3311 - Code_Index provides an additional datatype index which is mapped to
3312 target-language built-in integers.
3313 - Code_Message provides an additional datatype message_string which is isomorphic to
3314 strings; messages are mapped to target-language strings.
3316 * New package for inductive predicates
3318 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
3321 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3322 for z_1 :: U_1 and ... and z_n :: U_m
3324 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3327 with full support for type-inference, rather than
3329 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3331 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3332 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3334 inductive "s z_1 ... z_m"
3336 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3339 For backward compatibility, there is a wrapper allowing inductive
3340 sets to be defined with the new package via
3343 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3344 for z_1 :: U_1 and ... and z_n :: U_m
3346 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3352 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3353 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3354 for z_1 :: U_1 and ... and z_n :: U_m
3356 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3357 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3360 if the additional syntax "p ..." is required.
3362 Numerous examples can be found in the subdirectories src/HOL/Auth,
3363 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
3367 - Since declaration and definition of inductive sets or predicates
3368 is no longer separated, abbreviations involving the newly
3369 introduced sets or predicates must be specified together with the
3370 introduction rules after the 'where' keyword (see above), rather
3371 than before the actual inductive definition.
3373 - The variables in induction and elimination rules are now
3374 quantified in the order of their occurrence in the introduction
3375 rules, rather than in alphabetical order. Since this may break
3376 some proofs, these proofs either have to be repaired, e.g. by
3377 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
3378 statements of the form
3380 case (rule_i a_i_1 ... a_i_{k_i})
3382 or the old order of quantification has to be restored by explicitly adding
3383 meta-level quantifiers in the introduction rules, i.e.
3385 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
3387 - The format of the elimination rules is now
3389 p z_1 ... z_m x_1 ... x_n ==>
3390 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3395 (x_1, ..., x_n) : s z_1 ... z_m ==>
3396 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3399 for sets rather than
3401 x : s z_1 ... z_m ==>
3402 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
3405 This may require terms in goals to be expanded to n-tuples
3406 (e.g. using case_tac or simplification with the split_paired_all
3407 rule) before the above elimination rule is applicable.
3409 - The elimination or case analysis rules for (mutually) inductive
3410 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
3411 list of rules "p_1_..._p_k.elims" is no longer available.
3413 * New package "function"/"fun" for general recursive functions,
3414 supporting mutual and nested recursion, definitions in local contexts,
3415 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
3416 for small examples, and the separate tutorial on the function
3417 package. The old recdef "package" is still available as before, but
3418 users are encouraged to use the new package.
3420 * Method "lexicographic_order" automatically synthesizes termination
3421 relations as lexicographic combinations of size measures.
3423 * Case-expressions allow arbitrary constructor-patterns (including
3424 "_") and take their order into account, like in functional
3425 programming. Internally, this is translated into nested
3426 case-expressions; missing cases are added and mapped to the predefined
3427 constant "undefined". In complicated cases printing may no longer show
3428 the original input but the internal form. Lambda-abstractions allow
3429 the same form of pattern matching: "% pat1 => e1 | ..." is an
3430 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
3433 * IntDef: The constant "int :: nat => int" has been removed; now "int"
3434 is an abbreviation for "of_nat :: nat => int". The simplification
3435 rules for "of_nat" have been changed to work like "int" did
3436 previously. Potential INCOMPATIBILITY:
3437 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
3438 - of_nat_diff and of_nat_mult are no longer default simp rules
3440 * Method "algebra" solves polynomial equations over (semi)rings using
3441 Groebner bases. The (semi)ring structure is defined by locales and the
3442 tool setup depends on that generic context. Installing the method for
3443 a specific type involves instantiating the locale and possibly adding
3444 declarations for computation on the coefficients. The method is
3445 already instantiated for natural numbers and for the axiomatic class
3446 of idoms with numerals. See also the paper by Chaieb and Wenzel at
3447 CALCULEMUS 2007 for the general principles underlying this
3448 architecture of context-aware proof-tools.
3450 * Method "ferrack" implements quantifier elimination over
3451 special-purpose dense linear orders using locales (analogous to
3452 "algebra"). The method is already installed for class
3453 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
3456 * Former constant "List.op @" now named "List.append". Use ML
3457 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
3458 circumvent possible incompatibilities when working on ML level.
3460 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3462 * New function listsum :: 'a list => 'a for arbitrary monoids.
3463 Special syntax: "SUM x <- xs. f x" (and latex variants)
3465 * New syntax for Haskell-like list comprehension (input only), eg.
3466 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3468 * The special syntax for function "filter" has changed from [x :
3469 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3470 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3472 * [a..b] is now defined for arbitrary linear orders. It used to be
3473 defined on nat only, as an abbreviation for [a..<Suc b]
3476 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3478 * New functions "sorted" and "sort" in src/HOL/List.thy.
3480 * New lemma collection field_simps (an extension of ring_simps) for
3481 manipulating (in)equations involving division. Multiplies with all
3482 denominators that can be proved to be non-zero (in equations) or
3483 positive/negative (in inequations).
3485 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3486 have been improved and renamed to ring_simps, group_simps and
3487 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3488 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3490 * Theory Library/Commutative_Ring: switched from recdef to function
3491 package; constants add, mul, pow now curried. Infix syntax for
3492 algebraic operations.
3494 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
3497 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
3500 * HOL/records: generalised field-update to take a function on the
3501 field rather than the new value: r(|A := x|) is translated to A_update
3502 (K x) r The K-combinator that is internally used is called K_record.
3503 INCOMPATIBILITY: Usage of the plain update functions has to be
3506 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
3507 * x = 0, which are required for a semiring. Richer structures do not
3508 inherit from semiring_0 anymore, because this property is a theorem
3509 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
3510 there is more to prove, but this is mostly trivial.
3512 * Class "recpower" is generalized to arbitrary monoids, not just
3513 commutative semirings. INCOMPATIBILITY: may need to incorporate
3514 commutativity or semiring properties additionally.
3516 * Constant "List.list_all2" in List.thy now uses authentic syntax.
3517 INCOMPATIBILITY: translations containing list_all2 may go wrong,
3518 better use 'abbreviation'.
3520 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3522 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3523 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3524 significant changes for setting up numeral syntax for types:
3525 - New constants Numeral.pred and Numeral.succ instead
3526 of former Numeral.bin_pred and Numeral.bin_succ.
3527 - Use integer operations instead of bin_add, bin_mult and so on.
3528 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3529 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3531 See src/HOL/Integ/IntArith.thy for an example setup.
3533 * Command 'normal_form' computes the normal form of a term that may
3534 contain free variables. For example ``normal_form "rev [a, b, c]"''
3535 produces ``[b, c, a]'' (without proof). This command is suitable for
3536 heavy-duty computations because the functions are compiled to ML
3537 first. Correspondingly, a method "normalization" is provided. See
3538 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3540 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3541 25 like -->); output depends on the "iff" print_mode, the default is
3542 "A = B" (with priority 50).
3544 * Relations less (<) and less_eq (<=) are also available on type bool.
3545 Modified syntax to disallow nesting without explicit parentheses,
3546 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3549 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3551 * Relation composition operator "op O" now has precedence 75 and binds
3552 stronger than union and intersection. INCOMPATIBILITY.
3554 * The old set interval syntax "{m..n(}" (and relatives) has been
3555 removed. Use "{m..<n}" (and relatives) instead.
3557 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3558 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3559 ``declare [[simproc del: neq]]''.
3561 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3564 * Theorem Cons_eq_map_conv no longer declared as "simp".
3566 * Theorem setsum_mult renamed to setsum_right_distrib.
3568 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3571 * Reimplemented methods "sat" and "satx", with several improvements:
3572 goals no longer need to be stated as "<prems> ==> False", equivalences
3573 (i.e. "=" on type bool) are handled, variable names of the form
3574 "lit_<n>" are no longer reserved, significant speedup.
3576 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3577 zChaff is still supported as well.
3579 * 'inductive' and 'datatype': provide projections of mutual rules,
3580 bundled as foo_bar.inducts;
3582 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3585 * Library: moved theory Accessible_Part to main HOL.
3587 * Library: added theory Coinductive_List of potentially infinite lists
3588 as greatest fixed-point.
3590 * Library: added theory AssocList which implements (finite) maps as
3593 * Method "evaluation" solves goals (i.e. a boolean expression)
3594 efficiently by compiling it to ML. The goal is "proved" (via an
3595 oracle) if it evaluates to True.
3597 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3598 also when invoked by the simplifier. This results in the Simplifier
3599 being more powerful on arithmetic goals. INCOMPATIBILITY.
3600 Configuration option fast_arith_split_limit=0 recovers the old
3603 * Support for hex (0x20) and binary (0b1001) numerals.
3605 * New method: reify eqs (t), where eqs are equations for an
3606 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3607 parameter, computes a term s::'b and a list xs::'a list and proves the
3608 theorem I xs s = t. This is also known as reification or quoting. The
3609 resulting theorem is applied to the subgoal to substitute t with I xs
3610 s. If t is omitted, the subgoal itself is reified.
3612 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3613 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3614 where f is supposed to be a computable function (in the sense of code
3615 generattion). The method uses reify to compute s and xs as above then
3616 applies corr_thm and uses normalization by evaluation to "prove" f s =
3617 r and finally gets the theorem t = r, which is again applied to the
3618 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3620 * Reflection: Automatic reification now handels binding, an example is
3621 available in src/HOL/ex/ReflectionEx.thy
3623 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3624 command 'statespace' that is similar to 'record', but introduces an
3625 abstract specification based on the locale infrastructure instead of
3626 HOL types. This leads to extra flexibility in composing state spaces,
3627 in particular multiple inheritance and renaming of components.
3632 * Hyperreal: Functions root and sqrt are now defined on negative real
3633 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3634 Nonnegativity side conditions have been removed from many lemmas, so
3635 that more subgoals may now be solved by simplification; potential
3638 * Real: new type classes formalize real normed vector spaces and
3639 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3640 and norm :: 'a => real.
3642 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3643 reals into other types. The overloaded constant Reals :: 'a set is now
3644 defined as range of_real; potential INCOMPATIBILITY.
3646 * Real: proper support for ML code generation, including 'quickcheck'.
3647 Reals are implemented as arbitrary precision rationals.
3649 * Hyperreal: Several constants that previously worked only for the
3650 reals have been generalized, so they now work over arbitrary vector
3651 spaces. Type annotations may need to be added in some cases; potential
3654 Infinitesimal :: ('a::real_normed_vector) star set
3655 HFinite :: ('a::real_normed_vector) star set
3656 HInfinite :: ('a::real_normed_vector) star set
3657 approx :: ('a::real_normed_vector) star => 'a star => bool
3658 monad :: ('a::real_normed_vector) star => 'a star set
3659 galaxy :: ('a::real_normed_vector) star => 'a star set
3660 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3661 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3662 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3663 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3664 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3665 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3666 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3667 sgn :: 'a::real_normed_vector => 'a
3668 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3670 * Complex: Some complex-specific constants are now abbreviations for
3671 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3672 hnorm. Other constants have been entirely removed in favor of the
3673 polymorphic versions (INCOMPATIBILITY):
3677 HInfinite <-- CInfinite
3678 Infinitesimal <-- CInfinitesimal
3681 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3682 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3683 (ns)deriv <-- (ns)cderiv
3688 * Formalisation of ideals and the quotient construction over rings.
3690 * Order and lattice theory no longer based on records.
3693 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3694 greatest_closed. INCOMPATIBILITY.
3696 * Method algebra is now set up via an attribute. For examples see
3697 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3698 of algebraic structures.
3700 * Renamed theory CRing to Ring.
3705 * Substantial, yet incomplete support for nominal datatypes (binding
3706 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3707 src/HOL/Nominal/Examples. Prospective users should consult
3708 http://isabelle.in.tum.de/nominal/
3713 * ML basics: just one true type int, which coincides with IntInf.int
3716 * ML within Isar: antiquotations allow to embed statically-checked
3717 formal entities in the source, referring to the context available at
3718 compile-time. For example:
3720 ML {* @{sort "{zero,one}"} *}
3721 ML {* @{typ "'a => 'b"} *}
3722 ML {* @{term "%x. x"} *}
3723 ML {* @{prop "x == y"} *}
3724 ML {* @{ctyp "'a => 'b"} *}
3725 ML {* @{cterm "%x. x"} *}
3726 ML {* @{cprop "x == y"} *}
3727 ML {* @{thm asm_rl} *}
3728 ML {* @{thms asm_rl} *}
3729 ML {* @{type_name c} *}
3730 ML {* @{type_syntax c} *}
3731 ML {* @{const_name c} *}
3732 ML {* @{const_syntax c} *}
3735 ML {* @{theory Pure} *}
3736 ML {* @{theory_ref} *}
3737 ML {* @{theory_ref Pure} *}
3740 ML {* @{clasimpset} *}
3742 The same works for sources being ``used'' within an Isar context.
3744 * ML in Isar: improved error reporting; extra verbosity with
3745 ML_Context.trace enabled.
3747 * Pure/General/table.ML: the join operations now works via exceptions
3748 DUP/SAME instead of type option. This is simpler in simple cases, and
3749 admits slightly more efficient complex applications.
3751 * Pure: 'advanced' translation functions (parse_translation etc.) now
3752 use Context.generic instead of just theory.
3754 * Pure: datatype Context.generic joins theory/Proof.context and
3755 provides some facilities for code that works in either kind of
3756 context, notably GenericDataFun for uniform theory and proof data.
3758 * Pure: simplified internal attribute type, which is now always
3759 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3760 local (Proof.context) attributes have been discontinued, while
3761 minimizing code duplication. Thm.rule_attribute and
3762 Thm.declaration_attribute build canonical attributes; see also structure
3763 Context for further operations on Context.generic, notably
3764 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3765 declarations and definitions.
3767 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3768 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3769 init only required for impure data. INCOMPATIBILITY: empty really need
3770 to be empty (no dependencies on theory content!)
3772 * Pure/kernel: consts certification ignores sort constraints given in
3773 signature declarations. (This information is not relevant to the
3774 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3775 potential INCOMPATIBILITY.
3777 * Pure: axiomatic type classes are now purely definitional, with
3778 explicit proofs of class axioms and super class relations performed
3779 internally. See Pure/axclass.ML for the main internal interfaces --
3780 notably AxClass.define_class supercedes AxClass.add_axclass, and
3781 AxClass.axiomatize_class/classrel/arity supersede
3782 Sign.add_classes/classrel/arities.
3784 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3785 global/local versions on theory vs. Proof.context have been
3786 discontinued; Attrib.syntax and Method.syntax have been adapted
3787 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3788 attributes, methods, etc.
3790 * Pure: several functions of signature "... -> theory -> theory * ..."
3791 have been reoriented to "... -> theory -> ... * theory" in order to
3792 allow natural usage in combination with the ||>, ||>>, |-> and
3793 fold_map combinators.
3795 * Pure: official theorem names (closed derivations) and additional
3796 comments (tags) are now strictly separate. Name hints -- which are
3797 maintained as tags -- may be attached any time without affecting the
3800 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3801 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3802 achieve the old behaviour.
3804 * Pure: the "Goal" constant is now called "prop", supporting a
3805 slightly more general idea of ``protecting'' meta-level rule
3808 * Pure: Logic.(un)varify only works in a global context, which is now
3809 enforced instead of silently assumed. INCOMPATIBILITY, may use
3810 Logic.legacy_(un)varify as temporary workaround.
3812 * Pure: structure Name provides scalable operations for generating
3813 internal variable names, notably Name.variants etc. This replaces
3814 some popular functions from term.ML:
3816 Term.variant -> Name.variant
3817 Term.variantlist -> Name.variant_list
3818 Term.invent_names -> Name.invent_list
3820 Note that low-level renaming rarely occurs in new code -- operations
3821 from structure Variable are used instead (see below).
3823 * Pure: structure Variable provides fundamental operations for proper
3824 treatment of fixed/schematic variables in a context. For example,
3825 Variable.import introduces fixes for schematics of given facts and
3826 Variable.export reverses the effect (up to renaming) -- this replaces
3827 various freeze_thaw operations.
3829 * Pure: structure Goal provides simple interfaces for
3830 init/conclude/finish and tactical prove operations (replacing former
3831 Tactic.prove). Goal.prove is the canonical way to prove results
3832 within a given context; Goal.prove_global is a degraded version for
3833 theory level goals, including a global Drule.standard. Note that
3834 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3835 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3836 in a locale context).
3838 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3839 and type checking (Syntax.check_term etc.), with common combinations
3840 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3841 which are considered legacy and await removal.
3843 * Pure/Syntax: generic interfaces for type unchecking
3844 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3845 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3846 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3847 available for convenience, but refer to the very same operations using
3848 a mere theory instead of a full context.
3850 * Isar: simplified treatment of user-level errors, using exception
3851 ERROR of string uniformly. Function error now merely raises ERROR,
3852 without any side effect on output channels. The Isar toplevel takes
3853 care of proper display of ERROR exceptions. ML code may use plain
3854 handle/can/try; cat_error may be used to concatenate errors like this:
3856 ... handle ERROR msg => cat_error msg "..."
3858 Toplevel ML code (run directly or through the Isar toplevel) may be
3859 embedded into the Isar toplevel with exception display/debug like
3862 Isar.toplevel (fn () => ...)
3864 INCOMPATIBILITY, removed special transform_error facilities, removed
3865 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3866 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3867 -- use plain ERROR instead.
3869 * Isar: theory setup now has type (theory -> theory), instead of a
3870 list. INCOMPATIBILITY, may use #> to compose setup functions.
3872 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3873 ProofContext.debug/verbose flags.
3875 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3876 theory before entering a proof state. Transactions now always see a
3877 quasi-functional intermediate checkpoint, both in interactive and
3880 * Isar: simplified interfaces for outer syntax. Renamed
3881 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3882 OuterSyntax.add_parsers -- this functionality is now included in
3883 OuterSyntax.command etc. INCOMPATIBILITY.
3885 * Simplifier: the simpset of a running simplification process now
3886 contains a proof context (cf. Simplifier.the_context), which is the
3887 very context that the initial simpset has been retrieved from (by
3888 simpset_of/local_simpset_of). Consequently, all plug-in components
3889 (solver, looper etc.) may depend on arbitrary proof data.
3891 * Simplifier.inherit_context inherits the proof context (plus the
3892 local bounds) of the current simplification process; any simproc
3893 etc. that calls the Simplifier recursively should do this! Removed
3894 former Simplifier.inherit_bounds, which is already included here --
3895 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3896 specify an explicit context using Simplifier.context/theory_context.
3898 * Simplifier/Classical Reasoner: more abstract interfaces
3899 change_simpset/claset for modifying the simpset/claset reference of a
3900 theory; raw versions simpset/claset_ref etc. have been discontinued --
3903 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3909 * settings: the default heap location within ISABELLE_HOME_USER now
3910 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3911 Isabelle installations.
3913 * isabelle-process: option -S (secure mode) disables some critical
3914 operations, notably runtime compilation and evaluation of ML source
3917 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3919 * Support for parallel execution, using native multicore support of
3920 Poly/ML 5.1. The theory loader exploits parallelism when processing
3921 independent theories, according to the given theory header
3922 specifications. The maximum number of worker threads is specified via
3923 usedir option -M or the "max-threads" setting in Proof General. A
3924 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3925 to 6 on a 8-core machine. User-code needs to observe certain
3926 guidelines for thread-safe programming, see appendix A in the Isar
3927 Implementation manual.
3931 New in Isabelle2005 (October 2005)
3932 ----------------------------------
3936 * Theory headers: the new header syntax for Isar theories is
3939 imports <theory1> ... <theoryN>
3940 uses <file1> ... <fileM>
3943 where the 'uses' part is optional. The previous syntax
3945 theory <name> = <theory1> + ... + <theoryN>:
3947 will disappear in the next release. Use isatool fixheaders to convert
3948 existing theory files. Note that there is no change in ancient
3949 non-Isar theories now, but these will disappear soon.
3951 * Theory loader: parent theories can now also be referred to via
3952 relative and absolute paths.
3954 * Command 'find_theorems' searches for a list of criteria instead of a
3955 list of constants. Known criteria are: intro, elim, dest, name:string,
3956 simp:term, and any term. Criteria can be preceded by '-' to select
3957 theorems that do not match. Intro, elim, dest select theorems that
3958 match the current goal, name:s selects theorems whose fully qualified
3959 name contain s, and simp:term selects all simplification rules whose
3960 lhs match term. Any other term is interpreted as pattern and selects
3961 all theorems matching the pattern. Available in ProofGeneral under
3962 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3964 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3966 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3967 matching the current goal as introduction rule and not having "HOL."
3968 in their name (i.e. not being defined in theory HOL).
3970 * Command 'thms_containing' has been discontinued in favour of
3971 'find_theorems'; INCOMPATIBILITY.
3973 * Communication with Proof General is now 8bit clean, which means that
3974 Unicode text in UTF-8 encoding may be used within theory texts (both
3975 formal and informal parts). Cf. option -U of the Isabelle Proof
3976 General interface. Here are some simple examples (cf. src/HOL/ex):
3978 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3979 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3981 * Improved efficiency of the Simplifier and, to a lesser degree, the
3982 Classical Reasoner. Typical big applications run around 2 times
3986 *** Document preparation ***
3988 * Commands 'display_drafts' and 'print_drafts' perform simple output
3989 of raw sources. Only those symbols that do not require additional
3990 LaTeX packages (depending on comments in isabellesym.sty) are
3991 displayed properly, everything else is left verbatim. isatool display
3992 and isatool print are used as front ends (these are subject to the
3993 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3995 * Command tags control specific markup of certain regions of text,
3996 notably folding and hiding. Predefined tags include "theory" (for
3997 theory begin and end), "proof" for proof commands, and "ML" for
3998 commands involving ML code; the additional tags "visible" and
3999 "invisible" are unused by default. Users may give explicit tag
4000 specifications in the text, e.g. ''by %invisible (auto)''. The
4001 interpretation of tags is determined by the LaTeX job during document
4002 preparation: see option -V of isatool usedir, or options -n and -t of
4003 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
4006 Several document versions may be produced at the same time via isatool
4007 usedir (the generated index.html will link all of them). Typical
4008 specifications include ''-V document=theory,proof,ML'' to present
4009 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
4010 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
4011 these parts without any formal replacement text. The Isabelle site
4012 default settings produce ''document'' and ''outline'' versions as
4015 * Several new antiquotations:
4017 @{term_type term} prints a term with its type annotated;
4019 @{typeof term} prints the type of a term;
4021 @{const const} is the same as @{term const}, but checks that the
4022 argument is a known logical constant;
4024 @{term_style style term} and @{thm_style style thm} print a term or
4025 theorem applying a "style" to it
4029 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
4030 definitions, equations, inequations etc., 'concl' printing only the
4031 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
4032 to print the specified premise. TermStyle.add_style provides an ML
4033 interface for introducing further styles. See also the "LaTeX Sugar"
4034 document practical applications. The ML antiquotation prints
4035 type-checked ML expressions verbatim.
4037 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
4038 and 'text' support optional locale specification '(in loc)', which
4039 specifies the default context for interpreting antiquotations. For
4040 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
4042 * Option 'locale=NAME' of antiquotations specifies an alternative
4043 context interpreting the subsequent argument. For example: @{thm
4044 [locale=lattice] inf_assoc}.
4046 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
4049 * Proper output of antiquotations for theory commands involving a
4050 proof context (such as 'locale' or 'theorem (in loc) ...').
4052 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
4053 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
4055 * isatool usedir: new option -C (default true) controls whether option
4056 -D should include a copy of the original document directory; -C false
4057 prevents unwanted effects such as copying of administrative CVS data.
4062 * Considerably improved version of 'constdefs' command. Now performs
4063 automatic type-inference of declared constants; additional support for
4064 local structure declarations (cf. locales and HOL records), see also
4065 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
4066 sequential dependencies of definitions within a single 'constdefs'
4067 section; moreover, the declared name needs to be an identifier. If
4068 all fails, consider to fall back on 'consts' and 'defs' separately.
4070 * Improved indexed syntax and implicit structures. First of all,
4071 indexed syntax provides a notational device for subscripted
4072 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
4073 expressions. Secondly, in a local context with structure
4074 declarations, number indexes \<^sub>n or the empty index (default
4075 number 1) refer to a certain fixed variable implicitly; option
4076 show_structs controls printing of implicit structures. Typical
4077 applications of these concepts involve record types and locales.
4079 * New command 'no_syntax' removes grammar declarations (and
4080 translations) resulting from the given syntax specification, which is
4081 interpreted in the same manner as for the 'syntax' command.
4083 * 'Advanced' translation functions (parse_translation etc.) may depend
4084 on the signature of the theory context being presently used for
4085 parsing/printing, see also isar-ref manual.
4087 * Improved 'oracle' command provides a type-safe interface to turn an
4088 ML expression of type theory -> T -> term into a primitive rule of
4089 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
4090 is already included here); see also FOL/ex/IffExample.thy;
4093 * axclass: name space prefix for class "c" is now "c_class" (was "c"
4094 before); "cI" is no longer bound, use "c.intro" instead.
4095 INCOMPATIBILITY. This change avoids clashes of fact bindings for
4096 axclasses vs. locales.
4098 * Improved internal renaming of symbolic identifiers -- attach primes
4099 instead of base 26 numbers.
4101 * New flag show_question_marks controls printing of leading question
4102 marks in schematic variable names.
4104 * In schematic variable names, *any* symbol following \<^isub> or
4105 \<^isup> is now treated as part of the base name. For example, the
4106 following works without printing of awkward ".0" indexes:
4108 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
4111 * Inner syntax includes (*(*nested*) comments*).
4113 * Pretty printer now supports unbreakable blocks, specified in mixfix
4114 annotations as "(00...)".
4116 * Clear separation of logical types and nonterminals, where the latter
4117 may only occur in 'syntax' specifications or type abbreviations.
4118 Before that distinction was only partially implemented via type class
4119 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
4120 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
4121 exotic syntax specifications may require further adaption
4122 (e.g. Cube/Cube.thy).
4124 * Removed obsolete type class "logic", use the top sort {} instead.
4125 Note that non-logical types should be declared as 'nonterminals'
4126 rather than 'types'. INCOMPATIBILITY for new object-logic
4129 * Attributes 'induct' and 'cases': type or set names may now be
4130 locally fixed variables as well.
4132 * Simplifier: can now control the depth to which conditional rewriting
4133 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
4136 * Simplifier: simplification procedures may now take the current
4137 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
4138 interface), which is very useful for calling the Simplifier
4139 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
4140 is gone -- use prems_of_ss on the simpset instead. Moreover, the
4141 low-level mk_simproc no longer applies Logic.varify internally, to
4142 allow for use in a context of fixed variables.
4144 * thin_tac now works even if the assumption being deleted contains !!
4145 or ==>. More generally, erule now works even if the major premise of
4146 the elimination rule contains !! or ==>.
4148 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
4150 * Reorganized bootstrapping of the Pure theories; CPure is now derived
4151 from Pure, which contains all common declarations already. Both
4152 theories are defined via plain Isabelle/Isar .thy files.
4153 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
4154 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
4155 use isatool fixcpure to adapt your theory and ML sources.
4157 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
4158 selections of theorems in named facts via index ranges.
4160 * 'print_theorems': in theory mode, really print the difference
4161 wrt. the last state (works for interactive theory development only),
4162 in proof mode print all local facts (cf. 'print_facts');
4164 * 'hide': option '(open)' hides only base names.
4166 * More efficient treatment of intermediate checkpoints in interactive
4169 * Code generator is now invoked via code_module (incremental code
4170 generation) and code_library (modular code generation, ML structures
4171 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
4172 must be quoted when used as identifiers.
4174 * New 'value' command for reading, evaluating and printing terms using
4175 the code generator. INCOMPATIBILITY: command keyword 'value' must be
4176 quoted when used as identifier.
4181 * New commands for the interpretation of locale expressions in
4182 theories (1), locales (2) and proof contexts (3). These generate
4183 proof obligations from the expression specification. After the
4184 obligations have been discharged, theorems of the expression are added
4185 to the theory, target locale or proof context. The synopsis of the
4186 commands is a follows:
4188 (1) interpretation expr inst
4189 (2) interpretation target < expr
4190 (3) interpret expr inst
4192 Interpretation in theories and proof contexts require a parameter
4193 instantiation of terms from the current context. This is applied to
4194 specifications and theorems of the interpreted expression.
4195 Interpretation in locales only permits parameter renaming through the
4196 locale expression. Interpretation is smart in that interpretations
4197 that are active already do not occur in proof obligations, neither are
4198 instantiated theorems stored in duplicate. Use 'print_interps' to
4199 inspect active interpretations of a particular locale. For details,
4200 see the Isar Reference manual. Examples can be found in
4201 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
4203 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
4204 'interpret' instead.
4206 * New context element 'constrains' for adding type constraints to
4209 * Context expressions: renaming of parameters with syntax
4212 * Locale declaration: 'includes' disallowed.
4214 * Proper static binding of attribute syntax -- i.e. types / terms /
4215 facts mentioned as arguments are always those of the locale definition
4216 context, independently of the context of later invocations. Moreover,
4217 locale operations (renaming and type / term instantiation) are applied
4218 to attribute arguments as expected.
4220 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
4221 actual attributes; rare situations may require Attrib.attribute to
4222 embed those attributes into Attrib.src that lack concrete syntax.
4223 Attribute implementations need to cooperate properly with the static
4224 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
4225 Attrib.XXX_thm etc. already do the right thing without further
4226 intervention. Only unusual applications -- such as "where" or "of"
4227 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
4228 on the context and the facts involved -- may have to assign parsed
4229 values to argument tokens explicitly.
4231 * Changed parameter management in theorem generation for long goal
4232 statements with 'includes'. INCOMPATIBILITY: produces a different
4233 theorem statement in rare situations.
4235 * Locale inspection command 'print_locale' omits notes elements. Use
4236 'print_locale!' to have them included in the output.
4241 * Provers/hypsubst.ML: improved version of the subst method, for
4242 single-step rewriting: it now works in bound variable contexts. New is
4243 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
4244 rewrite a different subterm than the original subst method, which is
4245 still available as 'simplesubst'.
4247 * Provers/quasi.ML: new transitivity reasoners for transitivity only
4250 * Provers/trancl.ML: new transitivity reasoner for transitive and
4251 reflexive-transitive closure of relations.
4253 * Provers/blast.ML: new reference depth_limit to make blast's depth
4254 limit (previously hard-coded with a value of 20) user-definable.
4256 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
4257 is peformed already. Object-logics merely need to finish their
4258 initial simpset configuration as before. INCOMPATIBILITY.
4263 * Symbolic syntax of Hilbert Choice Operator is now as follows:
4266 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
4268 The symbol \<some> is displayed as the alternative epsilon of LaTeX
4269 and x-symbol; use option '-m epsilon' to get it actually printed.
4270 Moreover, the mathematically important symbolic identifier \<epsilon>
4271 becomes available as variable, constant etc. INCOMPATIBILITY,
4273 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
4274 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
4275 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
4276 support corresponding Isar calculations.
4278 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
4281 * theory SetInterval: changed the syntax for open intervals:
4290 The old syntax is still supported but will disappear in the next
4291 release. For conversion use the following Emacs search and replace
4292 patterns (these are not perfect but work quite well):
4294 {)\([^\.]*\)\.\. -> {\1<\.\.}
4295 \.\.\([^(}]*\)(} -> \.\.<\1}
4297 * Theory Commutative_Ring (in Library): method comm_ring for proving
4298 equalities in commutative rings; method 'algebra' provides a generic
4301 * Theory Finite_Set: changed the syntax for 'setsum', summation over
4302 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
4303 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
4306 Some new syntax forms are available:
4308 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
4309 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
4310 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
4311 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
4313 The latter form "\<Sum>x < k. e" used to be based on a separate
4314 function "Summation", which has been discontinued.
4316 * theory Finite_Set: in structured induction proofs, the insert case
4317 is now 'case (insert x F)' instead of the old counterintuitive 'case
4320 * The 'refute' command has been extended to support a much larger
4321 fragment of HOL, including axiomatic type classes, constdefs and
4322 typedefs, inductive datatypes and recursion.
4324 * New tactics 'sat' and 'satx' to prove propositional tautologies.
4325 Requires zChaff with proof generation to be installed. See
4326 HOL/ex/SAT_Examples.thy for examples.
4328 * Datatype induction via method 'induct' now preserves the name of the
4329 induction variable. For example, when proving P(xs::'a list) by
4330 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
4331 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
4332 in unstructured proof scripts.
4334 * Reworked implementation of records. Improved scalability for
4335 records with many fields, avoiding performance problems for type
4336 inference. Records are no longer composed of nested field types, but
4337 of nested extension types. Therefore the record type only grows linear
4338 in the number of extensions and not in the number of fields. The
4339 top-level (users) view on records is preserved. Potential
4340 INCOMPATIBILITY only in strange cases, where the theory depends on the
4341 old record representation. The type generated for a record is called
4342 <record_name>_ext_type.
4344 Flag record_quick_and_dirty_sensitive can be enabled to skip the
4345 proofs triggered by a record definition or a simproc (if
4346 quick_and_dirty is enabled). Definitions of large records can take
4349 New simproc record_upd_simproc for simplification of multiple record
4350 updates enabled by default. Moreover, trivial updates are also
4351 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4352 occasionally, since simplification is more powerful by default.
4354 * typedef: proper support for polymorphic sets, which contain extra
4355 type-variables in the term.
4357 * Simplifier: automatically reasons about transitivity chains
4358 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4359 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4360 old proofs break occasionally as simplification may now solve more
4361 goals than previously.
4363 * Simplifier: converts x <= y into x = y if assumption y <= x is
4364 present. Works for all partial orders (class "order"), in particular
4365 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
4368 * Simplifier: new simproc for "let x = a in f x". If a is a free or
4369 bound variable or a constant then the let is unfolded. Otherwise
4370 first a is simplified to b, and then f b is simplified to g. If
4371 possible we abstract b from g arriving at "let x = b in h x",
4372 otherwise we unfold the let and arrive at g. The simproc can be
4373 enabled/disabled by the reference use_let_simproc. Potential
4374 INCOMPATIBILITY since simplification is more powerful by default.
4376 * Classical reasoning: the meson method now accepts theorems as arguments.
4378 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
4379 jobs to provide advice on the provability of subgoals.
4381 * Theory OrderedGroup and Ring_and_Field: various additions and
4382 improvements to faciliate calculations involving equalities and
4385 The following theorems have been eliminated or modified
4388 abs_eq now named abs_of_nonneg
4389 abs_of_ge_0 now named abs_of_nonneg
4390 abs_minus_eq now named abs_of_nonpos
4391 imp_abs_id now named abs_of_nonneg
4392 imp_abs_neg_id now named abs_of_nonpos
4393 mult_pos now named mult_pos_pos
4394 mult_pos_le now named mult_nonneg_nonneg
4395 mult_pos_neg_le now named mult_nonneg_nonpos
4396 mult_pos_neg2_le now named mult_nonneg_nonpos2
4397 mult_neg now named mult_neg_neg
4398 mult_neg_le now named mult_nonpos_nonpos
4400 * The following lemmas in Ring_and_Field have been added to the simplifier:
4403 not_square_less_zero
4405 The following lemmas have been deleted from Real/RealPow:
4415 * Theory Parity: added rules for simplifying exponents.
4419 The following theorems have been eliminated or modified
4422 list_all_Nil now named list_all.simps(1)
4423 list_all_Cons now named list_all.simps(2)
4424 list_all_conv now named list_all_iff
4425 set_mem_eq now named mem_iff
4427 * Theories SetsAndFunctions and BigO (see HOL/Library) support
4428 asymptotic "big O" calculations. See the notes in BigO.thy.
4433 * Theory RealDef: better support for embedding natural numbers and
4434 integers in the reals.
4436 The following theorems have been eliminated or modified
4439 exp_ge_add_one_self now requires no hypotheses
4440 real_of_int_add reversed direction of equality (use [symmetric])
4441 real_of_int_minus reversed direction of equality (use [symmetric])
4442 real_of_int_diff reversed direction of equality (use [symmetric])
4443 real_of_int_mult reversed direction of equality (use [symmetric])
4445 * Theory RComplete: expanded support for floor and ceiling functions.
4447 * Theory Ln is new, with properties of the natural logarithm
4449 * Hyperreal: There is a new type constructor "star" for making
4450 nonstandard types. The old type names are now type synonyms:
4454 hcomplex = complex star
4456 * Hyperreal: Many groups of similarly-defined constants have been
4457 replaced by polymorphic versions (INCOMPATIBILITY):
4459 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4461 starset <-- starsetNat, starsetC
4462 *s* <-- *sNat*, *sc*
4463 starset_n <-- starsetNat_n, starsetC_n
4464 *sn* <-- *sNatn*, *scn*
4465 InternalSets <-- InternalNatSets, InternalCSets
4467 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4468 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4469 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4470 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4471 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4473 * Hyperreal: Many type-specific theorems have been removed in favor of
4474 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4476 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4477 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4478 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4479 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4480 right_minus <-- hypreal_add_minus
4481 left_minus <-- {hypreal,hcomplex}_add_minus_left
4482 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4483 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4484 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4485 mult_1_right <-- hcomplex_mult_one_right
4486 mult_zero_left <-- hcomplex_mult_zero_left
4487 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4488 right_distrib <-- hypnat_add_mult_distrib2
4489 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4490 right_inverse <-- hypreal_mult_inverse
4491 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4492 order_refl <-- {hypreal,hypnat}_le_refl
4493 order_trans <-- {hypreal,hypnat}_le_trans
4494 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4495 order_less_le <-- {hypreal,hypnat}_less_le
4496 linorder_linear <-- {hypreal,hypnat}_le_linear
4497 add_left_mono <-- {hypreal,hypnat}_add_left_mono
4498 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
4499 add_nonneg_nonneg <-- hypreal_le_add_order
4501 * Hyperreal: Separate theorems having to do with type-specific
4502 versions of constants have been merged into theorems that apply to the
4503 new polymorphic constants (INCOMPATIBILITY):
4505 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
4506 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
4507 STAR_Un <-- {STAR,NatStar,STARC}_Un
4508 STAR_Int <-- {STAR,NatStar,STARC}_Int
4509 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
4510 STAR_subset <-- {STAR,NatStar,STARC}_subset
4511 STAR_mem <-- {STAR,NatStar,STARC}_mem
4512 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
4513 STAR_diff <-- {STAR,STARC}_diff
4514 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
4515 STARC_hcomplex_of_complex}_image_subset
4516 starset_n_Un <-- starset{Nat,C}_n_Un
4517 starset_n_Int <-- starset{Nat,C}_n_Int
4518 starset_n_Compl <-- starset{Nat,C}_n_Compl
4519 starset_n_diff <-- starset{Nat,C}_n_diff
4520 InternalSets_Un <-- Internal{Nat,C}Sets_Un
4521 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4522 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4523 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4524 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4525 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4526 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4527 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4528 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4529 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4530 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4531 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4532 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4533 starfun_diff <-- starfun{C,RC,CR}_diff
4534 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4535 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4536 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4537 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4538 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4539 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4540 starfun_Id <-- starfunC_Id
4541 starfun_approx <-- starfun{Nat,CR}_approx
4542 starfun_capprox <-- starfun{C,RC}_capprox
4543 starfun_abs <-- starfunNat_rabs
4544 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4545 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4546 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4547 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4548 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4549 starfun_add_approx <-- starfunCR_add_approx
4550 starfun_inverse_inverse <-- starfunC_inverse_inverse
4551 starfun_divide <-- starfun{C,CR,RC}_divide
4552 starfun_n <-- starfun{Nat,C}_n
4553 starfun_n_mult <-- starfun{Nat,C}_n_mult
4554 starfun_n_add <-- starfun{Nat,C}_n_add
4555 starfun_n_add_minus <-- starfunNat_n_add_minus
4556 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4557 starfun_n_minus <-- starfun{Nat,C}_n_minus
4558 starfun_n_eq <-- starfun{Nat,C}_n_eq
4560 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4561 star_n_minus <-- {hypreal,hcomplex}_minus
4562 star_n_diff <-- {hypreal,hcomplex}_diff
4563 star_n_mult <-- {hypreal,hcomplex}_mult
4564 star_n_inverse <-- {hypreal,hcomplex}_inverse
4565 star_n_le <-- {hypreal,hypnat}_le
4566 star_n_less <-- {hypreal,hypnat}_less
4567 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4568 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4569 star_n_abs <-- hypreal_hrabs
4570 star_n_divide <-- hcomplex_divide
4572 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4573 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4574 star_of_diff <-- hypreal_of_real_diff
4575 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4576 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4577 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4578 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4579 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4580 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4581 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4582 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4583 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4584 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4585 star_of_number_of <-- {hypreal,hcomplex}_number_of
4586 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4587 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4588 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4589 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4590 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4591 star_of_power <-- hypreal_of_real_power
4592 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4594 * Hyperreal: new method "transfer" that implements the transfer
4595 principle of nonstandard analysis. With a subgoal that mentions
4596 nonstandard types like "'a star", the command "apply transfer"
4597 replaces it with an equivalent one that mentions only standard types.
4598 To be successful, all free variables must have standard types; non-
4599 standard variables must have explicit universal quantifiers.
4601 * Hyperreal: A theory of Taylor series.
4606 * Discontinued special version of 'constdefs' (which used to support
4607 continuous functions) in favor of the general Pure one with full
4610 * New simplification procedure for solving continuity conditions; it
4611 is much faster on terms with many nested lambda abstractions (cubic
4612 instead of exponential time).
4614 * New syntax for domain package: selector names are now optional.
4615 Parentheses should be omitted unless argument is lazy, for example:
4617 domain 'a stream = cons "'a" (lazy "'a stream")
4619 * New command 'fixrec' for defining recursive functions with pattern
4620 matching; defining multiple functions with mutual recursion is also
4621 supported. Patterns may include the constants cpair, spair, up, sinl,
4622 sinr, or any data constructor defined by the domain package. The given
4623 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4624 syntax and examples.
4626 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4627 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4628 but the proof obligation additionally includes an admissibility
4629 requirement. The packages generate instances of class cpo or pcpo,
4630 with continuity and strictness theorems for Rep and Abs.
4632 * HOLCF: Many theorems have been renamed according to a more standard naming
4633 scheme (INCOMPATIBILITY):
4635 foo_inject: "foo$x = foo$y ==> x = y"
4636 foo_eq: "(foo$x = foo$y) = (x = y)"
4637 foo_less: "(foo$x << foo$y) = (x << y)"
4638 foo_strict: "foo$UU = UU"
4639 foo_defined: "... ==> foo$x ~= UU"
4640 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4645 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4646 including the First Isomorphism Theorem (on quotienting by the kernel
4649 * ZF/Simplifier: install second copy of type solver that actually
4650 makes use of TC rules declared to Isar proof contexts (or locales);
4651 the old version is still required for ML proof scripts.
4656 * Converted to Isar theory format; use locales instead of axiomatic
4662 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4665 * Pure/library.ML no longer defines its own option datatype, but uses
4666 that of the SML basis, which has constructors NONE and SOME instead of
4667 None and Some, as well as exception Option.Option instead of OPTION.
4668 The functions the, if_none, is_some, is_none have been adapted
4669 accordingly, while Option.map replaces apsome.
4671 * Pure/library.ML: the exception LIST has been given up in favour of
4672 the standard exceptions Empty and Subscript, as well as
4673 Library.UnequalLengths. Function like Library.hd and Library.tl are
4674 superceded by the standard hd and tl functions etc.
4676 A number of basic list functions are no longer exported to the ML
4677 toplevel, as they are variants of predefined functions. The following
4678 suggests how one can translate existing code:
4680 rev_append xs ys = List.revAppend (xs, ys)
4681 nth_elem (i, xs) = List.nth (xs, i)
4682 last_elem xs = List.last xs
4683 flat xss = List.concat xss
4684 seq fs = List.app fs
4685 partition P xs = List.partition P xs
4686 mapfilter f xs = List.mapPartial f xs
4688 * Pure/library.ML: several combinators for linear functional
4689 transformations, notably reverse application and composition:
4692 (x, y) |-> f f #-> g
4694 * Pure/library.ML: introduced/changed precedence of infix operators:
4696 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4698 infix 3 o oo ooo oooo;
4699 infix 4 ~~ upto downto;
4701 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4704 * Pure/library.ML: natural list combinators fold, fold_rev, and
4705 fold_map support linear functional transformations and nesting. For
4708 fold f [x1, ..., xN] y =
4709 y |> f x1 |> ... |> f xN
4711 (fold o fold) f [xs1, ..., xsN] y =
4712 y |> fold f xs1 |> ... |> fold f xsN
4714 fold f [x1, ..., xN] =
4717 (fold o fold) f [xs1, ..., xsN] =
4718 fold f xs1 #> ... #> fold f xsN
4720 * Pure/library.ML: the following selectors on type 'a option are
4723 the: 'a option -> 'a (*partial*)
4724 these: 'a option -> 'a where 'a = 'b list
4725 the_default: 'a -> 'a option -> 'a
4726 the_list: 'a option -> 'a list
4728 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4729 basic operations for association lists, following natural argument
4730 order; moreover the explicit equality predicate passed here avoids
4731 potentially expensive polymorphic runtime equality checks.
4732 The old functions may be expressed as follows:
4734 assoc = uncurry (AList.lookup (op =))
4735 assocs = these oo AList.lookup (op =)
4736 overwrite = uncurry (AList.update (op =)) o swap
4738 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4740 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4741 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4743 replacing make_keylist and keyfilter (occassionally used)
4746 make_keylist = AList.make
4747 keyfilter = AList.find (op =)
4749 * eq_fst and eq_snd now take explicit equality parameter, thus
4750 avoiding eqtypes. Naive rewrites:
4752 eq_fst = eq_fst (op =)
4753 eq_snd = eq_snd (op =)
4755 * Removed deprecated apl and apr (rarely used).
4758 apl (n, op) =>>= curry op n
4759 apr (op, m) =>>= fn n => op (n, m)
4761 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4762 provides a reasonably efficient light-weight implementation of sets as
4765 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4766 few new operations; existing lookup and update are now curried to
4767 follow natural argument order (for use with fold etc.);
4768 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4770 * Pure/General: output via the Isabelle channels of
4771 writeln/warning/error etc. is now passed through Output.output, with a
4772 hook for arbitrary transformations depending on the print_mode
4773 (cf. Output.add_mode -- the first active mode that provides a output
4774 function wins). Already formatted output may be embedded into further
4775 text via Output.raw; the result of Pretty.string_of/str_of and derived
4776 functions (string_of_term/cterm/thm etc.) is already marked raw to
4777 accommodate easy composition of diagnostic messages etc. Programmers
4778 rarely need to care about Output.output or Output.raw at all, with
4779 some notable exceptions: Output.output is required when bypassing the
4780 standard channels (writeln etc.), or in token translations to produce
4781 properly formatted results; Output.raw is required when capturing
4782 already output material that will eventually be presented to the user
4783 a second time. For the default print mode, both Output.output and
4784 Output.raw have no effect.
4786 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4787 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4788 cumulative results are displayed at the end of a batch session.
4790 * Pure/General: File.sysify_path and File.quote_sysify path have been
4791 replaced by File.platform_path and File.shell_path (with appropriate
4792 hooks). This provides a clean interface for unusual systems where the
4793 internal and external process view of file names are different.
4795 * Pure: more efficient orders for basic syntactic entities: added
4796 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4797 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4798 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4799 orders now -- potential INCOMPATIBILITY for code that depends on a
4800 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4801 Library.sort_strings on result).
4803 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4804 fold_types traverse types/terms from left to right, observing natural
4805 argument order. Supercedes previous foldl_XXX versions, add_frees,
4806 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4808 * Pure: name spaces have been refined, with significant changes of the
4809 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4810 to extern(_table). The plain name entry path is superceded by a
4811 general 'naming' context, which also includes the 'policy' to produce
4812 a fully qualified name and external accesses of a fully qualified
4813 name; NameSpace.extend is superceded by context dependent
4814 Sign.declare_name. Several theory and proof context operations modify
4815 the naming context. Especially note Theory.restore_naming and
4816 ProofContext.restore_naming to get back to a sane state; note that
4817 Theory.add_path is no longer sufficient to recover from
4818 Theory.absolute_path in particular.
4820 * Pure: new flags short_names (default false) and unique_names
4821 (default true) for controlling output of qualified names. If
4822 short_names is set, names are printed unqualified. If unique_names is
4823 reset, the name prefix is reduced to the minimum required to achieve
4824 the original result when interning again, even if there is an overlap
4825 with earlier declarations.
4827 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4828 now 'extend', and 'merge' gets an additional Pretty.pp argument
4829 (useful for printing error messages). INCOMPATIBILITY.
4831 * Pure: major reorganization of the theory context. Type Sign.sg and
4832 Theory.theory are now identified, referring to the universal
4833 Context.theory (see Pure/context.ML). Actual signature and theory
4834 content is managed as theory data. The old code and interfaces were
4835 spread over many files and structures; the new arrangement introduces
4836 considerable INCOMPATIBILITY to gain more clarity:
4838 Context -- theory management operations (name, identity, inclusion,
4839 parents, ancestors, merge, etc.), plus generic theory data;
4841 Sign -- logical signature and syntax operations (declaring consts,
4842 types, etc.), plus certify/read for common entities;
4844 Theory -- logical theory operations (stating axioms, definitions,
4845 oracles), plus a copy of logical signature operations (consts,
4846 types, etc.); also a few basic management operations (Theory.copy,
4849 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4850 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4851 for convenience -- they merely return the theory.
4853 * Pure: type Type.tsig is superceded by theory in most interfaces.
4855 * Pure: the Isar proof context type is already defined early in Pure
4856 as Context.proof (note that ProofContext.context and Proof.context are
4857 aliases, where the latter is the preferred name). This enables other
4858 Isabelle components to refer to that type even before Isar is present.
4860 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4861 typeK, constK, axiomK, oracleK), but provide explicit operations for
4862 any of these kinds. For example, Sign.intern typeK is now
4863 Sign.intern_type, Theory.hide_space Sign.typeK is now
4864 Theory.hide_types. Also note that former
4865 Theory.hide_classes/types/consts are now
4866 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4867 internalize their arguments! INCOMPATIBILITY.
4869 * Pure: get_thm interface (of PureThy and ProofContext) expects
4870 datatype thmref (with constructors Name and NameSelection) instead of
4871 plain string -- INCOMPATIBILITY;
4873 * Pure: cases produced by proof methods specify options, where NONE
4874 means to remove case bindings -- INCOMPATIBILITY in
4877 * Pure: the following operations retrieve axioms or theorems from a
4878 theory node or theory hierarchy, respectively:
4880 Theory.axioms_of: theory -> (string * term) list
4881 Theory.all_axioms_of: theory -> (string * term) list
4882 PureThy.thms_of: theory -> (string * thm) list
4883 PureThy.all_thms_of: theory -> (string * thm) list
4885 * Pure: print_tac now outputs the goal through the trace channel.
4887 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4888 Reference Toplevel.debug (default false) controls detailed printing
4889 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4890 controls execution profiling -- set to 1 for time and 2 for space
4891 (both increase the runtime).
4893 * Isar session: The initial use of ROOT.ML is now always timed,
4894 i.e. the log will show the actual process times, in contrast to the
4895 elapsed wall-clock time that the outer shell wrapper produces.
4897 * Simplifier: improved handling of bound variables (nameless
4898 representation, avoid allocating new strings). Simprocs that invoke
4899 the Simplifier recursively should use Simplifier.inherit_bounds to
4900 avoid local name clashes. Failure to do so produces warnings
4901 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4902 for further details.
4904 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4905 bindings for all theorems stored within a given theory; this may help
4906 in porting non-Isar theories to Isar ones, while keeping ML proof
4907 scripts for the time being.
4909 * ML operator HTML.with_charset specifies the charset begin used for
4910 generated HTML files. For example:
4912 HTML.with_charset "utf-8" use_thy "Hebrew";
4913 HTML.with_charset "utf-8" use_thy "Chinese";
4918 * Allow symlinks to all proper Isabelle executables (Isabelle,
4919 isabelle, isatool etc.).
4921 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4922 isatool doc, isatool mkdir, display_drafts etc.).
4924 * isatool usedir: option -f allows specification of the ML file to be
4925 used by Isabelle; default is ROOT.ML.
4927 * New isatool version outputs the version identifier of the Isabelle
4928 distribution being used.
4930 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4931 (containing Boolean satisfiability problems) into Isabelle/HOL
4936 New in Isabelle2004 (April 2004)
4937 --------------------------------
4941 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4942 Replaces linorder.ML.
4944 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4945 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4946 (\<a>...\<z>), are now considered normal letters, and can therefore
4947 be used anywhere where an ASCII letter (a...zA...Z) has until
4948 now. COMPATIBILITY: This obviously changes the parsing of some
4949 terms, especially where a symbol has been used as a binder, say
4950 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4951 as an identifier. Fix it by inserting a space around former
4952 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4953 existing theory and ML files.
4955 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4957 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4958 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4959 a normal (but invisible) letter. For multiple letter subscripts repeat
4960 \<^isub> like this: x\<^isub>1\<^isub>2.
4962 * Pure: There are now sub-/superscripts that can span more than one
4963 character. Text between \<^bsub> and \<^esub> is set in subscript in
4964 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4965 superscript. The new control characters are not identifier parts.
4967 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4968 content of "..." to the latex file instead of \isacntrl... . The "..."
4969 may consist of any printable characters excluding the end bracket >.
4971 * Pure: Using new Isar command "finalconsts" (or the ML functions
4972 Theory.add_finals or Theory.add_finals_i) it is now possible to
4973 declare constants "final", which prevents their being given a definition
4974 later. It is useful for constants whose behaviour is fixed axiomatically
4975 rather than definitionally, such as the meta-logic connectives.
4977 * Pure: 'instance' now handles general arities with general sorts
4978 (i.e. intersections of classes),
4980 * Presentation: generated HTML now uses a CSS style sheet to make layout
4981 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4982 It can be changed to alter the colors/layout of generated pages.
4987 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4988 cut_tac, subgoal_tac and thin_tac:
4989 - Now understand static (Isar) contexts. As a consequence, users of Isar
4990 locales are no longer forced to write Isar proof scripts.
4991 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4993 - INCOMPATIBILITY: names of variables to be instantiated may no
4994 longer be enclosed in quotes. Instead, precede variable name with `?'.
4995 This is consistent with the instantiation attribute "where".
4997 * Attributes "where" and "of":
4998 - Now take type variables of instantiated theorem into account when reading
4999 the instantiation string. This fixes a bug that caused instantiated
5000 theorems to have too special types in some circumstances.
5001 - "where" permits explicit instantiations of type variables.
5003 * Calculation commands "moreover" and "also" no longer interfere with
5004 current facts ("this"), admitting arbitrary combinations with "then"
5008 - Goal statements involving the context element "includes" no longer
5009 generate theorems with internal delta predicates (those ending on
5010 "_axioms") in the premise.
5011 Resolve particular premise with <locale>.intro to obtain old form.
5012 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
5013 specification and "includes" elements in goal statement.
5014 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
5015 [intro?] and [elim?] (respectively) by default.
5016 - Experimental command for instantiation of locales in proof contexts:
5017 instantiate <label>[<attrs>]: <loc>
5018 Instantiates locale <loc> and adds all its theorems to the current context
5019 taking into account their attributes. Label and attrs are optional
5020 modifiers, like in theorem declarations. If present, names of
5021 instantiated theorems are qualified with <label>, and the attributes
5022 <attrs> are applied after any attributes these theorems might have already.
5023 If the locale has assumptions, a chained fact of the form
5024 "<loc> t1 ... tn" is expected from which instantiations of the parameters
5025 are derived. The command does not support old-style locales declared
5026 with "locale (open)".
5027 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
5029 * HOL: Tactic emulation methods induct_tac and case_tac understand static
5035 * Proof import: new image HOL4 contains the imported library from
5036 the HOL4 system with about 2500 theorems. It is imported by
5037 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
5038 can be used like any other Isabelle image. See
5039 HOL/Import/HOL/README for more information.
5042 - Much improved handling of linear and partial orders.
5043 Reasoners for linear and partial orders are set up for type classes
5044 "linorder" and "order" respectively, and are added to the default simpset
5045 as solvers. This means that the simplifier can build transitivity chains
5046 to solve goals from the assumptions.
5047 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
5048 of blast or auto after simplification become unnecessary because the goal
5049 is solved by simplification already.
5051 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
5052 all proved in axiomatic type classes for semirings, rings and fields.
5055 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
5056 now formalized using the Ring_and_Field theory mentioned above.
5057 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
5058 than before, because now they are set up once in a generic manner.
5059 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
5060 Look for the general versions in Ring_and_Field (and Power if they concern
5063 * Type "rat" of the rational numbers is now available in HOL-Complex.
5066 - Record types are now by default printed with their type abbreviation
5067 instead of the list of all field types. This can be configured via
5068 the reference "print_record_type_abbr".
5069 - Simproc "record_upd_simproc" for simplification of multiple updates added
5070 (not enabled by default).
5071 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
5072 EX x. x = sel r to True (not enabled by default).
5073 - Tactic "record_split_simp_tac" to split and simplify records added.
5075 * 'specification' command added, allowing for definition by
5076 specification. There is also an 'ax_specification' command that
5077 introduces the new constants axiomatically.
5079 * arith(_tac) is now able to generate counterexamples for reals as well.
5081 * HOL-Algebra: new locale "ring" for non-commutative rings.
5083 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
5084 definitions, thanks to Sava Krsti\'{c} and John Matthews.
5086 * HOL-Matrix: a first theory for matrices in HOL with an application of
5087 matrix theory to linear programming.
5089 * Unions and Intersections:
5090 The latex output syntax of UN and INT has been changed
5091 from "\Union x \in A. B" to "\Union_{x \in A} B"
5092 i.e. the index formulae has become a subscript.
5093 Similarly for "\Union x. B", and for \Inter instead of \Union.
5095 * Unions and Intersections over Intervals:
5096 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
5097 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
5098 like in normal math, and corresponding versions for < and for intersection.
5100 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
5101 lexicographic dictonary ordering has been added as "lexord".
5103 * ML: the legacy theory structures Int and List have been removed. They had
5104 conflicted with ML Basis Library structures having the same names.
5106 * 'refute' command added to search for (finite) countermodels. Only works
5107 for a fragment of HOL. The installation of an external SAT solver is
5108 highly recommended. See "HOL/Refute.thy" for details.
5110 * 'quickcheck' command: Allows to find counterexamples by evaluating
5111 formulae under an assignment of free variables to random values.
5112 In contrast to 'refute', it can deal with inductive datatypes,
5113 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
5119 * Streams now come with concatenation and are part of the HOLCF image
5123 New in Isabelle2003 (May 2003)
5124 ------------------------------
5128 * Provers/simplifier:
5130 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
5131 Assumptions are now subject to complete mutual simplification,
5132 not just from left to right. The simplifier now preserves
5133 the order of assumptions.
5135 Potential INCOMPATIBILITY:
5137 -- simp sometimes diverges where the old version did
5138 not, e.g. invoking simp on the goal
5140 [| P (f x); y = x; f x = f y |] ==> Q
5142 now gives rise to the infinite reduction sequence
5144 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
5146 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
5149 -- Tactics combining classical reasoner and simplification (such as auto)
5150 are also affected by this change, because many of them rely on
5151 simp. They may sometimes diverge as well or yield a different numbers
5152 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
5153 in case of problems. Sometimes subsequent calls to the classical
5154 reasoner will fail because a preceeding call to the simplifier too
5155 eagerly simplified the goal, e.g. deleted redundant premises.
5157 - The simplifier trace now shows the names of the applied rewrite rules
5159 - You can limit the number of recursive invocations of the simplifier
5160 during conditional rewriting (where the simplifie tries to solve the
5161 conditions before applying the rewrite rule):
5162 ML "simp_depth_limit := n"
5163 where n is an integer. Thus you can force termination where previously
5164 the simplifier would diverge.
5166 - Accepts free variables as head terms in congruence rules. Useful in Isar.
5168 - No longer aborts on failed congruence proof. Instead, the
5169 congruence is ignored.
5171 * Pure: New generic framework for extracting programs from constructive
5172 proofs. See HOL/Extraction.thy for an example instantiation, as well
5173 as HOL/Extraction for some case studies.
5175 * Pure: The main goal of the proof state is no longer shown by default, only
5176 the subgoals. This behaviour is controlled by a new flag.
5177 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
5178 (ML: Proof.show_main_goal).
5180 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
5181 rules whose conclusion matches subgoal 1:
5182 PG menu: Isabelle/Isar -> Show me -> matching rules
5183 The rules are ordered by how closely they match the subgoal.
5184 In particular, rules that solve a subgoal outright are displayed first
5185 (or rather last, the way they are printed).
5186 (ML: ProofGeneral.print_intros())
5188 * Pure: New flag trace_unify_fail causes unification to print
5189 diagnostic information (PG: in trace buffer) when it fails. This is
5190 useful for figuring out why single step proofs like rule, erule or
5193 * Pure: Locale specifications now produce predicate definitions
5194 according to the body of text (covering assumptions modulo local
5195 definitions); predicate "loc_axioms" covers newly introduced text,
5196 while "loc" is cumulative wrt. all included locale expressions; the
5197 latter view is presented only on export into the global theory
5198 context; potential INCOMPATIBILITY, use "(open)" option to fall back
5199 on the old view without predicates;
5201 * Pure: predefined locales "var" and "struct" are useful for sharing
5202 parameters (as in CASL, for example); just specify something like
5203 ``var x + var y + struct M'' as import;
5205 * Pure: improved thms_containing: proper indexing of facts instead of
5206 raw theorems; check validity of results wrt. current name space;
5207 include local facts of proof configuration (also covers active
5208 locales), cover fixed variables in index; may use "_" in term
5209 specification; an optional limit for the number of printed facts may
5210 be given (the default is 40);
5212 * Pure: disallow duplicate fact bindings within new-style theory files
5215 * Provers: improved induct method: assumptions introduced by case
5216 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
5217 the goal statement); "foo" still refers to all facts collectively;
5219 * Provers: the function blast.overloaded has been removed: all constants
5220 are regarded as potentially overloaded, which improves robustness in exchange
5221 for slight decrease in efficiency;
5223 * Provers/linorder: New generic prover for transitivity reasoning over
5224 linear orders. Note: this prover is not efficient!
5226 * Isar: preview of problems to finish 'show' now produce an error
5227 rather than just a warning (in interactive mode);
5234 - Produces a counter example if it cannot prove a goal.
5235 Note that the counter example may be spurious if the goal is not a formula
5236 of quantifier-free linear arithmetic.
5237 In ProofGeneral the counter example appears in the trace buffer.
5239 - Knows about div k and mod k where k is a numeral of type nat or int.
5241 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
5242 linear arithmetic fails. This takes account of quantifiers and divisibility.
5243 Presburger arithmetic can also be called explicitly via presburger(_tac).
5245 * simp's arithmetic capabilities have been enhanced a bit: it now
5246 takes ~= in premises into account (by performing a case split);
5248 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
5249 are distributed over a sum of terms;
5251 * New tactic "trans_tac" and method "trans" instantiate
5252 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
5255 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
5256 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
5258 * 'typedef' command has new option "open" to suppress the set
5261 * functions Min and Max on finite sets have been introduced (theory
5264 * attribute [symmetric] now works for relations as well; it turns
5265 (x,y) : R^-1 into (y,x) : R, and vice versa;
5267 * induct over a !!-quantified statement (say !!x1..xn):
5268 each "case" automatically performs "fix x1 .. xn" with exactly those names.
5270 * Map: `empty' is no longer a constant but a syntactic abbreviation for
5271 %x. None. Warning: empty_def now refers to the previously hidden definition
5274 * Algebra: formalization of classical algebra. Intended as base for
5275 any algebraic development in Isabelle. Currently covers group theory
5276 (up to Sylow's theorem) and ring theory (Universal Property of
5277 Univariate Polynomials). Contributions welcome;
5279 * GroupTheory: deleted, since its material has been moved to Algebra;
5281 * Complex: new directory of the complex numbers with numeric constants,
5282 nonstandard complex numbers, and some complex analysis, standard and
5283 nonstandard (Jacques Fleuriot);
5285 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
5287 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
5290 * Real/HahnBanach: updated and adapted to locales;
5292 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
5295 * UNITY: added the Meier-Sanders theory of progress sets;
5297 * MicroJava: bytecode verifier and lightweight bytecode verifier
5298 as abstract algorithms, instantiated to the JVM;
5300 * Bali: Java source language formalization. Type system, operational
5301 semantics, axiomatic semantics. Supported language features:
5302 classes, interfaces, objects,virtual methods, static methods,
5303 static/instance fields, arrays, access modifiers, definite
5304 assignment, exceptions.
5309 * ZF/Constructible: consistency proof for AC (Gdel's constructible
5312 * Main ZF: virtually all theories converted to new-style format;
5317 * Pure: Tactic.prove provides sane interface for internal proofs;
5318 omits the infamous "standard" operation, so this is more appropriate
5319 than prove_goalw_cterm in many situations (e.g. in simprocs);
5321 * Pure: improved error reporting of simprocs;
5323 * Provers: Simplifier.simproc(_i) provides sane interface for setting
5327 *** Document preparation ***
5329 * uses \par instead of \\ for line breaks in theory text. This may
5330 shift some page breaks in large documents. To get the old behaviour
5331 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
5333 * minimized dependencies of isabelle.sty and isabellesym.sty on
5336 * \<euro> now needs package babel/greek instead of marvosym (which
5339 * normal size for \<zero>...\<nine> (uses \mathbf instead of
5344 New in Isabelle2002 (March 2002)
5345 --------------------------------
5347 *** Document preparation ***
5349 * greatly simplified document preparation setup, including more
5350 graceful interpretation of isatool usedir -i/-d/-D options, and more
5351 instructive isatool mkdir; users should basically be able to get
5352 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5353 users may run a separate document processing stage manually like this:
5354 "isatool usedir -D output HOL Test && isatool document Test/output";
5356 * theory dependency graph may now be incorporated into documents;
5357 isatool usedir -g true will produce session_graph.eps/.pdf for use
5358 with \includegraphics of LaTeX;
5360 * proper spacing of consecutive markup elements, especially text
5361 blocks after section headings;
5363 * support bold style (for single symbols only), input syntax is like
5364 this: "\<^bold>\<alpha>" or "\<^bold>A";
5366 * \<bullet> is now output as bold \cdot by default, which looks much
5367 better in printed text;
5369 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
5370 note that these symbols are currently unavailable in Proof General /
5371 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
5373 * isatool latex no longer depends on changed TEXINPUTS, instead
5374 isatool document copies the Isabelle style files to the target
5380 * Pure/Provers: improved proof by cases and induction;
5381 - 'case' command admits impromptu naming of parameters (such as
5383 - 'induct' method divinates rule instantiation from the inductive
5384 claim; no longer requires excessive ?P bindings for proper
5385 instantiation of cases;
5386 - 'induct' method properly enumerates all possibilities of set/type
5387 rules; as a consequence facts may be also passed through *type*
5388 rules without further ado;
5389 - 'induct' method now derives symbolic cases from the *rulified*
5390 rule (before it used to rulify cases stemming from the internal
5391 atomized version); this means that the context of a non-atomic
5392 statement becomes is included in the hypothesis, avoiding the
5393 slightly cumbersome show "PROP ?case" form;
5394 - 'induct' may now use elim-style induction rules without chaining
5395 facts, using ``missing'' premises from the goal state; this allows
5396 rules stemming from inductive sets to be applied in unstructured
5397 scripts, while still benefitting from proper handling of non-atomic
5398 statements; NB: major inductive premises need to be put first, all
5399 the rest of the goal is passed through the induction;
5400 - 'induct' proper support for mutual induction involving non-atomic
5401 rule statements (uses the new concept of simultaneous goals, see
5403 - append all possible rule selections, but only use the first
5404 success (no backtracking);
5405 - removed obsolete "(simplified)" and "(stripped)" options of methods;
5406 - undeclared rule case names default to numbers 1, 2, 3, ...;
5407 - added 'print_induct_rules' (covered by help item in recent Proof
5409 - moved induct/cases attributes to Pure, methods to Provers;
5410 - generic method setup instantiated for FOL and HOL;
5412 * Pure: support multiple simultaneous goal statements, for example
5413 "have a: A and b: B" (same for 'theorem' etc.); being a pure
5414 meta-level mechanism, this acts as if several individual goals had
5415 been stated separately; in particular common proof methods need to be
5416 repeated in order to cover all claims; note that a single elimination
5417 step is *not* sufficient to establish the two conjunctions, so this
5420 assume "A & B" then have A and B .. (*".." fails*)
5422 better use "obtain" in situations as above; alternative refer to
5423 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
5425 * Pure: proper integration with ``locales''; unlike the original
5426 version by Florian Kammller, Isar locales package high-level proof
5427 contexts rather than raw logical ones (e.g. we admit to include
5428 attributes everywhere); operations on locales include merge and
5429 rename; support for implicit arguments (``structures''); simultaneous
5430 type-inference over imports and text; see also HOL/ex/Locales.thy for
5433 * Pure: the following commands have been ``localized'', supporting a
5434 target locale specification "(in name)": 'lemma', 'theorem',
5435 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
5436 stored both within the locale and at the theory level (exported and
5437 qualified by the locale name);
5439 * Pure: theory goals may now be specified in ``long'' form, with
5440 ad-hoc contexts consisting of arbitrary locale elements. for example
5441 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
5442 definitions may be given, too); the result is a meta-level rule with
5443 the context elements being discharged in the obvious way;
5445 * Pure: new proof command 'using' allows to augment currently used
5446 facts after a goal statement ('using' is syntactically analogous to
5447 'apply', but acts on the goal's facts only); this allows chained facts
5448 to be separated into parts given before and after a claim, as in
5449 ``from a and b have C using d and e <proof>'';
5451 * Pure: renamed "antecedent" case to "rule_context";
5453 * Pure: new 'judgment' command records explicit information about the
5454 object-logic embedding (used by several tools internally); no longer
5455 use hard-wired "Trueprop";
5457 * Pure: added 'corollary' command;
5459 * Pure: fixed 'token_translation' command;
5461 * Pure: removed obsolete 'exported' attribute;
5463 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5464 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5465 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5467 * Pure: method 'atomize' presents local goal premises as object-level
5468 statements (atomic meta-level propositions); setup controlled via
5469 rewrite rules declarations of 'atomize' attribute; example
5470 application: 'induct' method with proper rule statements in improper
5473 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5474 now consider the syntactic context of assumptions, giving a better
5475 chance to get type-inference of the arguments right (this is
5476 especially important for locales);
5478 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5481 * Pure/obtain: the formal conclusion "thesis", being marked as
5482 ``internal'', may no longer be reference directly in the text;
5483 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5486 * Pure: generic 'sym' attribute which declares a rule both as pure
5487 'elim?' and for the 'symmetric' operation;
5489 * Pure: marginal comments ``--'' may now occur just anywhere in the
5490 text; the fixed correlation with particular command syntax has been
5493 * Pure: new method 'rules' is particularly well-suited for proof
5494 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5495 but often produces more compact proof terms with less detours;
5497 * Pure/Provers/classical: simplified integration with pure rule
5498 attributes and methods; the classical "intro?/elim?/dest?"
5499 declarations coincide with the pure ones; the "rule" method no longer
5500 includes classically swapped intros; "intro" and "elim" methods no
5501 longer pick rules from the context; also got rid of ML declarations
5502 AddXIs/AddXEs/AddXDs; all of this has some potential for
5505 * Provers/classical: attribute 'swapped' produces classical inversions
5506 of introduction rules;
5508 * Provers/simplifier: 'simplified' attribute may refer to explicit
5509 rules instead of full simplifier context; 'iff' attribute handles
5512 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
5514 * HOL: 'recdef' now fails on unfinished automated proofs, use
5515 "(permissive)" option to recover old behavior;
5517 * HOL: 'inductive' no longer features separate (collective) attributes
5518 for 'intros' (was found too confusing);
5520 * HOL: properly declared induction rules less_induct and
5526 * HOL: moved over to sane numeral syntax; the new policy is as
5529 - 0 and 1 are polymorphic constants, which are defined on any
5530 numeric type (nat, int, real etc.);
5532 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5533 binary representation internally;
5535 - type nat has special constructor Suc, and generally prefers Suc 0
5536 over 1::nat and Suc (Suc 0) over 2::nat;
5538 This change may cause significant problems of INCOMPATIBILITY; here
5539 are some hints on converting existing sources:
5541 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5542 entities, so expressions involving "-" (unary or binary minus) need
5543 to be spaced properly;
5545 - existing occurrences of "1" may need to be constraint "1::nat" or
5546 even replaced by Suc 0; similar for old "2";
5548 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5550 - remove all special provisions on numerals in proofs;
5552 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5553 representation (depends on bin_arith_simps in the default context);
5555 * HOL: symbolic syntax for x^2 (numeral 2);
5557 * HOL: the class of all HOL types is now called "type" rather than
5558 "term"; INCOMPATIBILITY, need to adapt references to this type class
5559 in axclass/classes, instance/arities, and (usually rare) occurrences
5560 in typings (of consts etc.); internally the class is called
5561 "HOL.type", ML programs should refer to HOLogic.typeS;
5563 * HOL/record package improvements:
5564 - new derived operations "fields" to build a partial record section,
5565 "extend" to promote a fixed record to a record scheme, and
5566 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5567 declared as simp by default;
5568 - shared operations ("more", "fields", etc.) now need to be always
5569 qualified) --- potential INCOMPATIBILITY;
5570 - removed "make_scheme" operations (use "make" with "extend") --
5572 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5573 - provides cases/induct rules for use with corresponding Isar
5574 methods (for concrete records, record schemes, concrete more
5575 parts, and schematic more parts -- in that order);
5576 - internal definitions directly based on a light-weight abstract
5577 theory of product types over typedef rather than datatype;
5579 * HOL: generic code generator for generating executable ML code from
5580 specifications; specific support for HOL constructs such as inductive
5581 datatypes and sets, as well as recursive functions; can be invoked
5582 via 'generate_code' theory section;
5584 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5586 * HOL: consolidated and renamed several theories. In particular:
5587 Ord.thy has been absorbed into HOL.thy
5588 String.thy has been absorbed into List.thy
5590 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5591 (beware of argument permutation!);
5593 * HOL: linorder_less_split superseded by linorder_cases;
5595 * HOL/List: "nodups" renamed to "distinct";
5597 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5598 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5599 - Ex_def has changed, now need to use some_eq_ex
5601 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5602 in this (rare) case use:
5604 delSWrapper "split_all_tac"
5605 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5607 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5610 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5611 Isabelle's type classes, ^ on functions and relations has too general
5612 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5613 necessary to attach explicit type constraints;
5615 * HOL/Relation: the prefix name of the infix "O" has been changed from
5616 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5617 renamed accordingly (eg "compI" -> "rel_compI").
5619 * HOL: syntax translations now work properly with numerals and records
5622 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5623 of "lam" -- INCOMPATIBILITY;
5625 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5626 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5627 renamed "Product_Type.unit";
5629 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5631 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5632 the "cases" method);
5634 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5637 * HOL/IMP: updated and converted to new-style theory format; several
5638 parts turned into readable document, with proper Isar proof texts and
5639 some explanations (by Gerwin Klein);
5641 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5643 * HOL-Hyperreal is now a logic image;
5648 * Isar: consts/constdefs supports mixfix syntax for continuous
5651 * Isar: domain package adapted to new-style theory format, e.g. see
5654 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5655 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5656 lift.induct_tac, always use UU instead of Undef;
5658 * HOLCF/IMP: updated and converted to new-style theory;
5663 * Isar: proper integration of logic-specific tools and packages,
5664 including theory commands '(co)inductive', '(co)datatype',
5665 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5666 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5668 * theory Main no longer includes AC; for the Axiom of Choice, base
5669 your theory on Main_ZFC;
5671 * the integer library now covers quotients and remainders, with many
5672 laws relating division to addition, multiplication, etc.;
5674 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5675 typeless version of the formalism;
5677 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5680 * ZF/Induct: new directory for examples of inductive definitions,
5681 including theory Multiset for multiset orderings; converted to
5682 new-style theory format;
5684 * ZF: many new theorems about lists, ordinals, etc.;
5689 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5690 variable proof controls level of detail: 0 = no proofs (only oracle
5691 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5692 also ref manual for further ML interfaces;
5694 * Pure/axclass: removed obsolete ML interface
5695 goal_subclass/goal_arity;
5697 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5698 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5699 separate tokens, so expressions involving minus need to be spaced
5702 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5703 rather than "infixl" or "infixr";
5705 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5706 sort constraint specifications in type inference; e.g. "x::_::foo"
5707 ensures that the type of "x" is of sort "foo" (but not necessarily a
5710 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5711 control output of nested => (types); the default behavior is
5714 * Pure/syntax: builtin parse translation for "_constify" turns valued
5715 tokens into AST constants;
5717 * Pure/syntax: prefer later declarations of translations and print
5718 translation functions; potential INCOMPATIBILITY: need to reverse
5719 multiple declarations for same syntax element constant;
5721 * Pure/show_hyps reset by default (in accordance to existing Isar
5724 * Provers/classical: renamed addaltern to addafter, addSaltern to
5727 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5730 * system: tested support for MacOS X; should be able to get Isabelle +
5731 Proof General to work in a plain Terminal after installing Poly/ML
5732 (e.g. from the Isabelle distribution area) and GNU bash alone
5733 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5734 support requires further installations, e.g. from
5735 http://fink.sourceforge.net/);
5737 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5739 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5740 of 40 MB), cf. ML_OPTIONS;
5742 * system: Proof General keywords specification is now part of the
5743 Isabelle distribution (see etc/isar-keywords.el);
5745 * system: support for persistent Proof General sessions (refrain from
5746 outdating all loaded theories on startup); user may create writable
5747 logic images like this: ``isabelle -q HOL Test'';
5749 * system: smart selection of Isabelle process versus Isabelle
5750 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5751 run both "isabelle" and "Isabelle" even if file names are badly
5752 damaged (executable inspects the case of the first letter of its own
5753 name); added separate "isabelle-process" and "isabelle-interface";
5755 * system: refrain from any attempt at filtering input streams; no
5756 longer support ``8bit'' encoding of old isabelle font, instead proper
5757 iso-latin characters may now be used; the related isatools
5758 "symbolinput" and "nonascii" have disappeared as well;
5760 * system: removed old "xterm" interface (the print modes "xterm" and
5761 "xterm_color" are still available for direct use in a suitable
5766 New in Isabelle99-2 (February 2001)
5767 -----------------------------------
5769 *** Overview of INCOMPATIBILITIES ***
5771 * HOL: please note that theories in the Library and elsewhere often use the
5772 new-style (Isar) format; to refer to their theorems in an ML script you must
5773 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5775 * HOL: inductive package no longer splits induction rule aggressively,
5776 but only as far as specified by the introductions given; the old
5777 format may be recovered via ML function complete_split_rule or attribute
5778 'split_rule (complete)';
5780 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5781 gfp_Tarski to gfp_unfold;
5783 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5785 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5786 relation); infix "^^" has been renamed "``"; infix "``" has been
5787 renamed "`"; "univalent" has been renamed "single_valued";
5789 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5792 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5794 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5796 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5797 consequence, it is no longer monotonic wrt. the local goal context
5798 (which is now passed through the inductive cases);
5800 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5801 \<gg> to \<ggreater>;
5804 *** Document preparation ***
5806 * \isabellestyle{NAME} selects version of Isabelle output (currently
5807 available: are "it" for near math-mode best-style output, "sl" for
5808 slanted text style, and "tt" for plain type-writer; if no
5809 \isabellestyle command is given, output is according to slanted
5812 * support sub/super scripts (for single symbols only), input syntax is
5813 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5815 * some more standard symbols; see Appendix A of the system manual for
5816 the complete list of symbols defined in isabellesym.sty;
5818 * improved isabelle style files; more abstract symbol implementation
5819 (should now use \isamath{...} and \isatext{...} in custom symbol
5822 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5823 state; Note that presentation of goal states does not conform to
5824 actual human-readable proof documents. Please do not include goal
5825 states into document output unless you really know what you are doing!
5827 * proper indentation of antiquoted output with proportional LaTeX
5830 * no_document ML operator temporarily disables LaTeX document
5833 * isatool unsymbolize tunes sources for plain ASCII communication;
5838 * Pure: Isar now suffers initial goal statements to contain unbound
5839 schematic variables (this does not conform to actual readable proof
5840 documents, due to unpredictable outcome and non-compositional proof
5841 checking); users who know what they are doing may use schematic goals
5842 for Prolog-style synthesis of proven results;
5844 * Pure: assumption method (an implicit finishing) now handles actual
5847 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5848 initial goal, declare "that" only as Pure intro (only for single
5849 steps); the "that" rule assumption may now be involved in implicit
5850 finishing, thus ".." becomes a feasible for trivial obtains;
5852 * Pure: default proof step now includes 'intro_classes'; thus trivial
5853 instance proofs may be performed by "..";
5855 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5858 * Pure: more robust selection of calculational rules;
5860 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5861 rule (as well as the assumption rule);
5863 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5864 lemmas, using the graph browser tool;
5866 * Pure: predict failure of "show" in interactive mode;
5868 * Pure: 'thms_containing' now takes actual terms as arguments;
5870 * HOL: improved method 'induct' --- now handles non-atomic goals
5871 (potential INCOMPATIBILITY); tuned error handling;
5873 * HOL: cases and induct rules now provide explicit hints about the
5874 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5875 any remaining facts are inserted into the goal verbatim;
5877 * HOL: local contexts (aka cases) may now contain term bindings as
5878 well; the 'cases' and 'induct' methods new provide a ?case binding for
5879 the result to be shown in each case;
5881 * HOL: added 'recdef_tc' command;
5883 * isatool convert assists in eliminating legacy ML scripts;
5888 * HOL/Library: a collection of generic theories to be used together
5889 with main HOL; the theory loader path already includes this directory
5890 by default; the following existing theories have been moved here:
5891 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5892 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5894 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5895 modelling and verification task performed in Isabelle/HOL +
5896 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5898 * HOL/Algebra: special summation operator SUM no longer exists, it has
5899 been replaced by setsum; infix 'assoc' now has priority 50 (like
5900 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5901 'domain', this makes the theory consistent with mathematical
5904 * HOL basics: added overloaded operations "inverse" and "divide"
5905 (infix "/"), syntax for generic "abs" operation, generic summation
5908 * HOL/typedef: simplified package, provide more useful rules (see also
5911 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5912 now expressed as a proper nested rule (old-style tactic scripts may
5913 require atomize_strip_tac to cope with non-atomic premises);
5915 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5916 to "split_conv" (old name still available for compatibility);
5918 * HOL: improved concrete syntax for strings (e.g. allows translation
5919 rules with string literals);
5921 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5922 and Fleuriot's mechanization of analysis, including the transcendental
5923 functions for the reals;
5925 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5930 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5931 "lam" is displayed as TWO lambda-symbols
5933 * CTT: theory Main now available, containing everything (that is, Bool
5939 * Pure: the Simplifier has been implemented properly as a derived rule
5940 outside of the actual kernel (at last!); the overall performance
5941 penalty in practical applications is about 50%, while reliability of
5942 the Isabelle inference kernel has been greatly improved;
5944 * print modes "brackets" and "no_brackets" control output of nested =>
5945 (types) and ==> (props); the default behaviour is "brackets";
5947 * Provers: fast_tac (and friends) now handle actual object-logic rules
5948 as assumptions as well;
5950 * system: support Poly/ML 4.0;
5952 * system: isatool install handles KDE version 1 or 2;
5956 New in Isabelle99-1 (October 2000)
5957 ----------------------------------
5959 *** Overview of INCOMPATIBILITIES ***
5961 * HOL: simplification of natural numbers is much changed; to partly
5962 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5963 issue the following ML commands:
5965 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5966 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5968 * HOL: simplification no longer dives into case-expressions; this is
5969 controlled by "t.weak_case_cong" for each datatype t;
5971 * HOL: nat_less_induct renamed to less_induct;
5973 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5974 fixsome to patch .thy and .ML sources automatically;
5976 select_equality -> some_equality
5977 select_eq_Ex -> some_eq_ex
5978 selectI2EX -> someI2_ex
5981 select1_equality -> some1_equality
5982 Eps_sym_eq -> some_sym_eq_trivial
5983 Eps_eq -> some_eq_trivial
5985 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5987 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5990 * HOL: the recursion equations generated by 'recdef' are now called
5991 f.simps instead of f.rules;
5993 * HOL: qed_spec_mp now also handles bounded ALL as well;
5995 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5996 sometimes be needed;
5998 * HOL: the constant for "f``x" is now "image" rather than "op ``";
6000 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
6002 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
6003 product is now "<*>" instead of "Times"; the lexicographic product is
6004 now "<*lex*>" instead of "**";
6006 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
6007 of main HOL, but was unused); better use HOL's datatype package;
6009 * HOL: removed "symbols" syntax for constant "override" of theory Map;
6010 the old syntax may be recovered as follows:
6013 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
6014 (infixl "\\<oplus>" 100)
6016 * HOL/Real: "rabs" replaced by overloaded "abs" function;
6018 * HOL/ML: even fewer consts are declared as global (see theories Ord,
6019 Lfp, Gfp, WF); this only affects ML packages that refer to const names
6022 * HOL and ZF: syntax for quotienting wrt an equivalence relation
6023 changed from A/r to A//r;
6025 * ZF: new treatment of arithmetic (nat & int) may break some old
6028 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
6029 rulify -> rule_format, elimify -> elim_format, ...);
6031 * Isar/Provers: intro/elim/dest attributes changed; renamed
6032 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
6033 should have to change intro!! to intro? only); replaced "delrule" by
6036 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
6038 * Provers: strengthened force_tac by using new first_best_tac;
6040 * LaTeX document preparation: several changes of isabelle.sty (see
6044 *** Document preparation ***
6046 * formal comments (text blocks etc.) in new-style theories may now
6047 contain antiquotations of thm/prop/term/typ/text to be presented
6048 according to latex print mode; concrete syntax is like this:
6049 @{term[show_types] "f(x) = a + x"};
6051 * isatool mkdir provides easy setup of Isabelle session directories,
6052 including proper document sources;
6054 * generated LaTeX sources are now deleted after successful run
6055 (isatool document -c); may retain a copy somewhere else via -D option
6058 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
6059 style files, achieving self-contained LaTeX sources and simplifying
6062 * old-style theories now produce (crude) LaTeX output as well;
6064 * browser info session directories are now self-contained (may be put
6065 on WWW server seperately); improved graphs of nested sessions; removed
6066 graph for 'all sessions';
6068 * several improvements in isabelle style files; \isabellestyle{it}
6069 produces fake math mode output; \isamarkupheader is now \section by
6070 default; see lib/texinputs/isabelle.sty etc.;
6075 * Isar/Pure: local results and corresponding term bindings are now
6076 subject to Hindley-Milner polymorphism (similar to ML); this
6077 accommodates incremental type-inference very nicely;
6079 * Isar/Pure: new derived language element 'obtain' supports
6080 generalized existence reasoning;
6082 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
6083 support accumulation of results, without applying any rules yet;
6084 useful to collect intermediate results without explicit name
6085 references, and for use with transitivity rules with more than 2
6088 * Isar/Pure: scalable support for case-analysis type proofs: new
6089 'case' language element refers to local contexts symbolically, as
6090 produced by certain proof methods; internally, case names are attached
6091 to theorems as "tags";
6093 * Isar/Pure: theory command 'hide' removes declarations from
6094 class/type/const name spaces;
6096 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
6097 indicate potential overloading;
6099 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
6101 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
6102 "{a,b,c}" instead of {a,b,c};
6104 * Isar/Pure now provides its own version of intro/elim/dest
6105 attributes; useful for building new logics, but beware of confusion
6106 with the version in Provers/classical;
6108 * Isar/Pure: the local context of (non-atomic) goals is provided via
6109 case name 'antecedent';
6111 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
6112 to the current context is now done automatically);
6114 * Isar/Pure: theory command 'method_setup' provides a simple interface
6115 for definining proof methods in ML;
6117 * Isar/Provers: intro/elim/dest attributes changed; renamed
6118 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
6119 most cases, one should have to change intro!! to intro? only);
6120 replaced "delrule" by "rule del";
6122 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
6123 'symmetric' attribute (the latter supercedes [RS sym]);
6125 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
6126 method modifier); 'simp' method: 'only:' modifier removes loopers as
6127 well (including splits);
6129 * Isar/Provers: Simplifier and Classical methods now support all kind
6130 of modifiers used in the past, including 'cong', 'iff', etc.
6132 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
6133 of Simplifier and Classical reasoner);
6135 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
6136 now support named cases; major packages (inductive, datatype, primrec,
6137 recdef) support case names and properly name parameters;
6139 * Isar/HOL: new transitivity rules for substitution in inequalities --
6140 monotonicity conditions are extracted to be proven at end of
6143 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
6146 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
6147 split_if split_if_asm; datatype package provides theorems foo.splits =
6148 foo.split foo.split_asm for each datatype;
6150 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
6151 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
6152 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
6153 use "(cases (simplified))" method in proper proof texts);
6155 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
6157 * Isar: names of theorems etc. may be natural numbers as well;
6159 * Isar: 'pr' command: optional arguments for goals_limit and
6160 ProofContext.prems_limit; no longer prints theory contexts, but only
6163 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
6164 additional print modes to be specified; e.g. "pr(latex)" will print
6165 proof state according to the Isabelle LaTeX style;
6167 * Isar: improved support for emulating tactic scripts, including proof
6168 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
6169 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
6170 (for HOL datatypes);
6172 * Isar: simplified (more robust) goal selection of proof methods: 1st
6173 goal, all goals, or explicit goal specifier (tactic emulation); thus
6174 'proof method scripts' have to be in depth-first order;
6176 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
6178 * Isar: removed 'help' command, which hasn't been too helpful anyway;
6179 should instead use individual commands for printing items
6180 (print_commands, print_methods etc.);
6182 * Isar: added 'nothing' --- the empty list of theorems;
6187 * HOL/MicroJava: formalization of a fragment of Java, together with a
6188 corresponding virtual machine and a specification of its bytecode
6189 verifier and a lightweight bytecode verifier, including proofs of
6190 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
6191 Cornelia Pusch (see also the homepage of project Bali at
6192 http://isabelle.in.tum.de/Bali/);
6194 * HOL/Algebra: new theory of rings and univariate polynomials, by
6197 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
6198 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
6201 * HOL/Lattice: fundamental concepts of lattice theory and order
6202 structures, including duals, properties of bounds versus algebraic
6203 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
6204 Theorem for complete lattices etc.; may also serve as a demonstration
6205 for abstract algebraic reasoning using axiomatic type classes, and
6206 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
6208 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
6211 * HOL/IMPP: extension of IMP with local variables and mutually
6212 recursive procedures, by David von Oheimb;
6214 * HOL/Lambda: converted into new-style theory and document;
6216 * HOL/ex/Multiquote: example of multiple nested quotations and
6217 anti-quotations -- basically a generalized version of de-Bruijn
6218 representation; very useful in avoiding lifting of operations;
6220 * HOL/record: added general record equality rule to simpset; fixed
6221 select-update simplification procedure to handle extended records as
6222 well; admit "r" as field name;
6224 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
6225 other numeric types and also as the identity of groups, rings, etc.;
6227 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
6228 Types nat and int belong to this axclass;
6230 * HOL: greatly improved simplification involving numerals of type nat, int, real:
6231 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
6232 i*j + k + j*#3*i simplifies to #4*(i*j) + k
6233 two terms #m*u and #n*u are replaced by #(m+n)*u
6234 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
6235 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
6236 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
6238 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
6239 powerful prover for predicate logic but knows nothing of clasets; see
6240 ex/mesontest.ML and ex/mesontest2.ML for example applications;
6242 * HOL: new version of "case_tac" subsumes both boolean case split and
6243 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
6244 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
6246 * HOL: simplification no longer dives into case-expressions: only the
6247 selector expression is simplified, but not the remaining arms; to
6248 enable full simplification of case-expressions for datatype t, you may
6249 remove t.weak_case_cong from the simpset, either globally (Delcongs
6250 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
6252 * HOL/recdef: the recursion equations generated by 'recdef' for
6253 function 'f' are now called f.simps instead of f.rules; if all
6254 termination conditions are proved automatically, these simplification
6255 rules are added to the simpset, as in primrec; rules may be named
6256 individually as well, resulting in a separate list of theorems for
6259 * HOL/While is a new theory that provides a while-combinator. It
6260 permits the definition of tail-recursive functions without the
6261 provision of a termination measure. The latter is necessary once the
6262 invariant proof rule for while is applied.
6264 * HOL: new (overloaded) notation for the set of elements below/above
6265 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
6267 * HOL: theorems impI, allI, ballI bound as "strip";
6269 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
6270 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
6271 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
6273 * HOL/Real: "rabs" replaced by overloaded "abs" function;
6275 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
6276 main HOL, but was unused);
6278 * HOL: fewer consts declared as global (e.g. have to refer to
6279 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
6281 * HOL: tuned AST representation of nested pairs, avoiding bogus output
6282 in case of overlap with user translations (e.g. judgements over
6283 tuples); (note that the underlying logical represenation is still
6289 * ZF: simplification automatically cancels common terms in arithmetic
6290 expressions over nat and int;
6292 * ZF: new treatment of nat to minimize type-checking: all operators
6293 coerce their operands to a natural number using the function natify,
6294 making the algebraic laws unconditional;
6296 * ZF: as above, for int: operators coerce their operands to an integer
6297 using the function intify;
6299 * ZF: the integer library now contains many of the usual laws for the
6300 orderings, including $<=, and monotonicity laws for $+ and $*;
6302 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
6305 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
6306 to the simplifier and classical reasoner simultaneously;
6311 * Provers: blast_tac now handles actual object-logic rules as
6312 assumptions; note that auto_tac uses blast_tac internally as well;
6314 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
6315 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
6317 * Provers: delrules now handles destruct rules as well (no longer need
6318 explicit make_elim);
6320 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
6321 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6322 use instead the strong form,
6323 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6324 in HOL, FOL and ZF the function cla_make_elim will create such rules
6325 from destruct-rules;
6327 * Provers: Simplifier.easy_setup provides a fast path to basic
6328 Simplifier setup for new object-logics;
6330 * Pure: AST translation rules no longer require constant head on LHS;
6332 * Pure: improved name spaces: ambiguous output is qualified; support
6333 for hiding of names;
6335 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
6336 XSYMBOL_HOME; no longer need to do manual configuration in most
6339 * system: compression of ML heaps images may now be controlled via -c
6340 option of isabelle and isatool usedir (currently only observed by
6343 * system: isatool installfonts may handle X-Symbol fonts as well (very
6344 useful for remote X11);
6346 * system: provide TAGS file for Isabelle sources;
6348 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6351 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6352 timing flag supersedes proof_timing and Toplevel.trace;
6354 * ML: new combinators |>> and |>>> for incremental transformations
6355 with secondary results (e.g. certain theory extensions):
6357 * ML: PureThy.add_defs gets additional argument to indicate potential
6358 overloading (usually false);
6360 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
6365 New in Isabelle99 (October 1999)
6366 --------------------------------
6368 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6370 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
6371 are no longer simplified. (This allows the simplifier to unfold recursive
6372 functional programs.) To restore the old behaviour, declare
6374 Delcongs [if_weak_cong];
6376 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
6379 * HOL: the predicate "inj" is now defined by translation to "inj_on";
6381 * HOL/datatype: mutual_induct_tac no longer exists --
6382 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
6384 * HOL/typedef: fixed type inference for representing set; type
6385 arguments now have to occur explicitly on the rhs as type constraints;
6387 * ZF: The con_defs part of an inductive definition may no longer refer
6388 to constants declared in the same theory;
6390 * HOL, ZF: the function mk_cases, generated by the inductive
6391 definition package, has lost an argument. To simplify its result, it
6392 uses the default simpset instead of a supplied list of theorems.
6394 * HOL/List: the constructors of type list are now Nil and Cons;
6396 * Simplifier: the type of the infix ML functions
6397 setSSolver addSSolver setSolver addSolver
6398 is now simpset * solver -> simpset where `solver' is a new abstract type
6399 for packaging solvers. A solver is created via
6400 mk_solver: string -> (thm list -> int -> tactic) -> solver
6401 where the string argument is only a comment.
6406 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
6407 decision procedure for linear arithmetic. Currently it is used for
6408 types `nat', `int', and `real' in HOL (see below); it can, should and
6409 will be instantiated for other types and logics as well.
6411 * The simplifier now accepts rewrite rules with flexible heads, eg
6412 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
6413 They are applied like any rule with a non-pattern lhs, i.e. by first-order
6419 * New Isabelle/Isar subsystem provides an alternative to traditional
6420 tactical theorem proving; together with the ProofGeneral/isar user
6421 interface it offers an interactive environment for developing human
6422 readable proof documents (Isar == Intelligible semi-automated
6423 reasoning); for further information see isatool doc isar-ref,
6424 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
6426 * improved and simplified presentation of theories: better HTML markup
6427 (including colors), graph views in several sizes; isatool usedir now
6428 provides a proper interface for user theories (via -P option); actual
6429 document preparation based on (PDF)LaTeX is available as well (for
6430 new-style theories only); see isatool doc system for more information;
6432 * native support for Proof General, both for classic Isabelle and
6435 * ML function thm_deps visualizes dependencies of theorems and lemmas,
6436 using the graph browser tool;
6438 * Isabelle manuals now also available as PDF;
6440 * theory loader rewritten from scratch (may not be fully
6441 bug-compatible); old loadpath variable has been replaced by show_path,
6442 add_path, del_path, reset_path functions; new operations such as
6443 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
6446 * improved isatool install: option -k creates KDE application icon,
6447 option -p DIR installs standalone binaries;
6449 * added ML_PLATFORM setting (useful for cross-platform installations);
6450 more robust handling of platform specific ML images for SML/NJ;
6452 * the settings environment is now statically scoped, i.e. it is never
6453 created again in sub-processes invoked from isabelle, isatool, or
6456 * path element specification '~~' refers to '$ISABELLE_HOME';
6458 * in locales, the "assumes" and "defines" parts may be omitted if
6461 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6464 * new print_mode "HTML";
6466 * new flag show_tags controls display of tags of theorems (which are
6467 basically just comments that may be attached by some tools);
6469 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6470 mode and goal output format:
6472 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6474 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6476 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6477 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6479 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6481 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6483 * function bind_thms stores lists of theorems (cf. bind_thm);
6485 * new shorthand tactics ftac, eatac, datac, fatac;
6487 * qed (and friends) now accept "" as result name; in that case the
6488 theorem is not stored, but proper checks and presentation of the
6491 * theorem database now also indexes constants "Trueprop", "all",
6492 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
6497 ** HOL arithmetic **
6499 * There are now decision procedures for linear arithmetic over nat and
6502 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
6503 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
6504 are treated as atomic; subformulae not involving type `nat' or `int'
6505 are ignored; quantified subformulae are ignored unless they are
6506 positive universal or negative existential. The tactic has to be
6507 invoked by hand and can be a little bit slow. In particular, the
6508 running time is exponential in the number of occurrences of `min' and
6509 `max', and `-' on `nat'.
6511 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
6512 (negated) (in)equalities among the premises and the conclusion into
6513 account (i.e. no compound formulae) and does not know about `min' and
6514 `max', and `-' on `nat'. It is fast and is used automatically by the
6517 NB: At the moment, these decision procedures do not cope with mixed
6518 nat/int formulae where the two parts interact, such as `m < n ==>
6521 * HOL/Numeral provides a generic theory of numerals (encoded
6522 efficiently as bit strings); setup for types nat/int/real is in place;
6523 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6524 int, existing theories and proof scripts may require a few additional
6527 * integer division and remainder can now be performed on constant
6530 * many properties of integer multiplication, division and remainder
6533 * An interface to the Stanford Validity Checker (SVC) is available through the
6534 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6535 are proved automatically. SVC must be installed separately, and its results
6536 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6537 invocation of the underlying oracle). For SVC see
6538 http://verify.stanford.edu/SVC
6540 * IsaMakefile: the HOL-Real target now builds an actual image;
6545 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6546 (in Isabelle/Isar) -- by Gertrud Bauer;
6548 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6549 analysis for assembly languages with subtypes;
6551 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6552 -- avoids syntactic ambiguities and treats state, transition, and
6553 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6554 changed syntax and (many) tactics;
6556 * HOL/inductive: Now also handles more general introduction rules such
6557 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6558 theorems are now maintained within the theory (maintained via the
6561 * HOL/datatype: Now also handles arbitrarily branching datatypes
6562 (using function types) such as
6564 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6566 * HOL/record: record_simproc (part of the default simpset) takes care
6567 of selectors applied to updated records; record_split_tac is no longer
6568 part of the default claset; update_defs may now be removed from the
6569 simpset in many cases; COMPATIBILITY: old behavior achieved by
6571 claset_ref () := claset() addSWrapper record_split_wrapper;
6572 Delsimprocs [record_simproc]
6574 * HOL/typedef: fixed type inference for representing set; type
6575 arguments now have to occur explicitly on the rhs as type constraints;
6577 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6578 names rather than an ML expression;
6580 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6581 supplied later. Program schemes can be defined, such as
6582 "While B C s = (if B s then While B C (C s) else s)"
6583 where the well-founded relation can be chosen after B and C have been given.
6585 * HOL/List: the constructors of type list are now Nil and Cons;
6586 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6587 course, ML tools referring to List.list.op # etc. have to be adapted;
6589 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6590 disabled by default; run isabelle with option -m HOL to get back to
6591 the original Gordon/HOL-style output;
6593 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6594 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6596 * HOL basic syntax simplified (more orthogonal): all variants of
6597 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6598 Eps operator is provided as well: "SOME x. P[x]";
6600 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6602 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6603 thus available for user theories;
6605 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6606 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6609 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6610 several times and then mp;
6615 * the notation <<...>> is now available as a notation for sequences of
6618 * the simplifier is now installed
6620 * the axiom system has been generalized (thanks to Soren Heilmann)
6622 * the classical reasoner now has a default rule database
6627 * new primrec section allows primitive recursive functions to be given
6628 directly (as in HOL) over datatypes and the natural numbers;
6630 * new tactics induct_tac and exhaust_tac for induction (or case
6631 analysis) over datatypes and the natural numbers;
6633 * the datatype declaration of type T now defines the recursor T_rec;
6635 * simplification automatically does freeness reasoning for datatype
6638 * automatic type-inference, with AddTCs command to insert new
6639 type-checking rules;
6641 * datatype introduction rules are now added as Safe Introduction rules
6644 * the syntax "if P then x else y" is now available in addition to
6648 *** Internal programming interfaces ***
6650 * tuned simplifier trace output; new flag debug_simp;
6652 * structures Vartab / Termtab (instances of TableFun) offer efficient
6653 tables indexed by indexname_ord / term_ord (compatible with aconv);
6655 * AxClass.axclass_tac lost the theory argument;
6657 * tuned current_goals_markers semantics: begin / end goal avoids
6658 printing empty lines;
6660 * removed prs and prs_fn hook, which was broken because it did not
6661 include \n in its semantics, forcing writeln to add one
6662 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6663 string -> unit if you really want to output text without newline;
6665 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6666 plain output, interface builders may have to enable 'isabelle_font'
6667 mode to get Isabelle font glyphs as before;
6669 * refined token_translation interface; INCOMPATIBILITY: output length
6670 now of type real instead of int;
6672 * theory loader actions may be traced via new ThyInfo.add_hook
6673 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6674 your own database of information attached to *whole* theories -- as
6675 opposed to intra-theory data slots offered via TheoryDataFun;
6677 * proper handling of dangling sort hypotheses (at last!);
6678 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6679 extra sort hypotheses that can be witnessed from the type signature;
6680 the force_strip_shyps flag is gone, any remaining shyps are simply
6681 left in the theorem (with a warning issued by strip_shyps_warning);
6685 New in Isabelle98-1 (October 1998)
6686 ----------------------------------
6688 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6690 * several changes of automated proof tools;
6692 * HOL: major changes to the inductive and datatype packages, including
6693 some minor incompatibilities of theory syntax;
6695 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6698 * HOL: removed duplicate thms in Arith:
6699 less_imp_add_less should be replaced by trans_less_add1
6700 le_imp_add_le should be replaced by trans_le_add1
6702 * HOL: unary minus is now overloaded (new type constraints may be
6705 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6706 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6707 now taken as an integer constant.
6709 * Pure: ML function 'theory_of' renamed to 'theory';
6715 1. Asm_full_simp_tac is now more aggressive.
6716 1. It will sometimes reorient premises if that increases their power to
6718 2. It does no longer proceed strictly from left to right but may also
6719 rotate premises to achieve further simplification.
6720 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6721 old Asm_full_simp_tac in that it does not rotate premises.
6722 2. The simplifier now knows a little bit about nat-arithmetic.
6724 * Classical reasoner: wrapper mechanism for the classical reasoner now
6725 allows for selected deletion of wrappers, by introduction of names for
6726 wrapper functionals. This implies that addbefore, addSbefore,
6727 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6728 and that adding two tactics with the same name overwrites the first
6729 one (emitting a warning).
6730 type wrapper = (int -> tactic) -> (int -> tactic)
6731 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6732 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6733 delWrapper, delSWrapper: claset * string -> claset
6734 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6736 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6737 semantics; addbefore now affects only the unsafe part of step_tac
6738 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6739 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6742 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6743 compWrapper; added safe wrapper (and access functions for it);
6745 * HOL/split_all_tac is now much faster and fails if there is nothing
6746 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6747 and the names of the automatically generated variables have changed.
6748 split_all_tac has moved within claset() from unsafe wrappers to safe
6749 wrappers, which means that !!-bound variables are split much more
6750 aggressively, and safe_tac and clarify_tac now split such variables.
6751 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6752 Note: the same holds for record_split_tac, which does the job of
6753 split_all_tac for record fields.
6755 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6756 permanently to the default simpset using Addsplits just like
6757 Addsimps. They can be removed via Delsplits just like
6758 Delsimps. Lower-case versions are also available.
6760 * HOL/Simplifier: The rule split_if is now part of the default
6761 simpset. This means that the simplifier will eliminate all occurrences
6762 of if-then-else in the conclusion of a goal. To prevent this, you can
6763 either remove split_if completely from the default simpset by
6764 `Delsplits [split_if]' or remove it in a specific call of the
6765 simplifier using `... delsplits [split_if]'. You can also add/delete
6766 other case splitting rules to/from the default simpset: every datatype
6767 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6768 t is the name of the datatype).
6770 * Classical reasoner / Simplifier combination: new force_tac (and
6771 derivatives Force_tac, force) combines rewriting and classical
6772 reasoning (and whatever other tools) similarly to auto_tac, but is
6773 aimed to solve the given subgoal completely.
6778 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6779 and `goalw': the theory is no longer needed as an explicit argument -
6780 the current theory context is used; assumptions are no longer returned
6781 at the ML-level unless one of them starts with ==> or !!; it is
6782 recommended to convert to these new commands using isatool fixgoal
6783 (backup your sources first!);
6785 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6786 the current theory context, and 'theory' to lookup stored theories;
6788 * new theory section 'locale' for declaring constants, assumptions and
6789 definitions that have local scope;
6791 * new theory section 'nonterminals' for purely syntactic types;
6793 * new theory section 'setup' for generic ML setup functions
6794 (e.g. package initialization);
6796 * the distribution now includes Isabelle icons: see
6797 lib/logo/isabelle-{small,tiny}.xpm;
6799 * isatool install - install binaries with absolute references to
6802 * isatool logo -- create instances of the Isabelle logo (as EPS);
6804 * print mode 'emacs' reserved for Isamode;
6806 * support multiple print (ast) translations per constant name;
6808 * theorems involving oracles are now printed with a suffixed [!];
6813 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6815 * HOL/inductive package reorganized and improved: now supports mutual
6821 oddI "n : EVEN ==> Suc n : ODD"
6822 evenI "n : ODD ==> Suc n : EVEN"
6824 new theorem list "elims" contains an elimination rule for each of the
6825 recursive sets; inductive definitions now handle disjunctive premises
6826 correctly (also ZF);
6828 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6829 "mutual_induct" no longer exists - the induction rule is always
6830 contained in "induct";
6833 * HOL/datatype package re-implemented and greatly improved: now
6834 supports mutually recursive datatypes such as
6837 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6838 | SUM ('a aexp) ('a aexp)
6839 | DIFF ('a aexp) ('a aexp)
6842 'a bexp = LESS ('a aexp) ('a aexp)
6843 | AND ('a bexp) ('a bexp)
6844 | OR ('a bexp) ('a bexp)
6846 as well as indirectly recursive datatypes such as
6849 ('a, 'b) term = Var 'a
6850 | App 'b ((('a, 'b) term) list)
6852 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6853 induction on mutually / indirectly recursive datatypes.
6855 Primrec equations are now stored in theory and can be accessed via
6856 <function_name>.simps.
6860 - Theories using datatypes must now have theory Datatype as an
6862 - The specific <typename>.induct_tac no longer exists - use the
6863 generic induct_tac instead.
6864 - natE has been renamed to nat.exhaust - use exhaust_tac
6865 instead of res_inst_tac ... natE. Note that the variable
6866 names in nat.exhaust differ from the names in natE, this
6867 may cause some "fragile" proofs to fail.
6868 - The theorems split_<typename>_case and split_<typename>_case_asm
6869 have been renamed to <typename>.split and <typename>.split_asm.
6870 - Since default sorts of type variables are now handled correctly,
6871 some datatype definitions may have to be annotated with explicit
6873 - Primrec definitions no longer require function name and type
6874 of recursive argument.
6876 Consider using isatool fixdatatype to adapt your theories and proof
6877 scripts to the new package (backup your sources first!).
6880 * HOL/record package: considerably improved implementation; now
6881 includes concrete syntax for record types, terms, updates; theorems
6882 for surjective pairing and splitting !!-bound record variables; proof
6883 support is as follows:
6885 1) standard conversions (selectors or updates applied to record
6886 constructor terms) are part of the standard simpset;
6888 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6889 made part of standard simpset and claset via addIffs;
6891 3) a tactic for record field splitting (record_split_tac) is part of
6892 the standard claset (addSWrapper);
6894 To get a better idea about these rules you may retrieve them via
6895 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6896 the name of your record type.
6898 The split tactic 3) conceptually simplifies by the following rule:
6900 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6902 Thus any record variable that is bound by meta-all will automatically
6903 blow up into some record constructor term, consequently the
6904 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6905 solve record problems automatically.
6908 * reorganized the main HOL image: HOL/Integ and String loaded by
6909 default; theory Main includes everything;
6911 * automatic simplification of integer sums and comparisons, using cancellation;
6913 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6915 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6917 * many new identities for unions, intersections, set difference, etc.;
6919 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6920 called split_if, split_split, split_sum_case and split_nat_case (to go
6921 with add/delsplits);
6923 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6924 (?x::unit) = (); this is made part of the default simpset, which COULD
6925 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6926 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6927 unit_abs_eta_conv is added in order to counter the effect of
6928 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6931 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6934 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6935 It and 'sym RS equals0D' are now in the default claset, giving automatic
6936 disjointness reasoning but breaking a few old proofs.
6938 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6939 to 'converse' from 'inverse' (for compatibility with ZF and some
6942 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6943 the well-founded relation;
6945 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6946 Compl A. The "Compl" syntax remains available as input syntax for this
6949 * HOL/Update: new theory of function updates:
6950 f(a:=b) == %x. if x=a then b else f x
6951 may also be iterated as in f(a:=b,c:=d,...);
6953 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6956 - new function list_update written xs[i:=v] that updates the i-th
6957 list position. May also be iterated as in xs[i:=a,j:=b,...].
6958 - new function `upt' written [i..j(] which generates the list
6959 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6960 bound write [i..j], which is a shorthand for [i..j+1(].
6961 - new lexicographic orderings and corresponding wellfoundedness theorems.
6964 - removed 'pred' (predecessor) function;
6965 - generalized some theorems about n-1;
6966 - many new laws about "div" and "mod";
6967 - new laws about greatest common divisors (see theory ex/Primes);
6969 * HOL/Relation: renamed the relational operator r^-1 "converse"
6970 instead of "inverse";
6972 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6973 of the multiset ordering;
6975 * directory HOL/Real: a construction of the reals using Dedekind cuts
6976 (not included by default);
6978 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6980 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6981 programs, i.e. different program variables may have different types.
6983 * calling (stac rew i) now fails if "rew" has no effect on the goal
6984 [previously, this check worked only if the rewrite rule was unconditional]
6985 Now rew can involve either definitions or equalities (either == or =).
6990 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6991 only the theorems proved on ZF.ML;
6993 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6994 It and 'sym RS equals0D' are now in the default claset, giving automatic
6995 disjointness reasoning but breaking a few old proofs.
6997 * ZF/Update: new theory of function updates
6998 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6999 may also be iterated as in f(a:=b,c:=d,...);
7001 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
7003 * calling (stac rew i) now fails if "rew" has no effect on the goal
7004 [previously, this check worked only if the rewrite rule was unconditional]
7005 Now rew can involve either definitions or equalities (either == or =).
7007 * case_tac provided for compatibility with HOL
7008 (like the old excluded_middle_tac, but with subgoals swapped)
7011 *** Internal programming interfaces ***
7013 * Pure: several new basic modules made available for general use, see
7014 also src/Pure/README;
7016 * improved the theory data mechanism to support encapsulation (data
7017 kind name replaced by private Object.kind, acting as authorization
7018 key); new type-safe user interface via functor TheoryDataFun; generic
7019 print_data function becomes basically useless;
7021 * removed global_names compatibility flag -- all theory declarations
7022 are qualified by default;
7024 * module Pure/Syntax now offers quote / antiquote translation
7025 functions (useful for Hoare logic etc. with implicit dependencies);
7026 see HOL/ex/Antiquote for an example use;
7028 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
7031 * new tactical CHANGED_GOAL for checking that a tactic modifies a
7034 * Display.print_goals function moved to Locale.print_goals;
7036 * standard print function for goals supports current_goals_markers
7037 variable for marking begin of proof, end of proof, start of goal; the
7038 default is ("", "", ""); setting current_goals_markers := ("<proof>",
7039 "</proof>", "<goal>") causes SGML like tagged proof state printing,
7044 New in Isabelle98 (January 1998)
7045 --------------------------------
7047 *** Overview of INCOMPATIBILITIES (see below for more details) ***
7049 * changed lexical syntax of terms / types: dots made part of long
7050 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
7052 * simpset (and claset) reference variable replaced by functions
7053 simpset / simpset_ref;
7055 * no longer supports theory aliases (via merge) and non-trivial
7056 implicit merge of thms' signatures;
7058 * most internal names of constants changed due to qualified names;
7060 * changed Pure/Sequence interface (see Pure/seq.ML);
7063 *** General Changes ***
7065 * hierachically structured name spaces (for consts, types, axms, thms
7066 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
7067 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
7068 isatool fixdots ensures space after dots (e.g. "%x. x"); set
7069 long_names for fully qualified output names; NOTE: ML programs
7070 (special tactics, packages etc.) referring to internal names may have
7071 to be adapted to cope with fully qualified names; in case of severe
7072 backward campatibility problems try setting 'global_names' at compile
7073 time to have enrything declared within a flat name space; one may also
7074 fine tune name declarations in theories via the 'global' and 'local'
7077 * reimplemented the implicit simpset and claset using the new anytype
7078 data filed in signatures; references simpset:simpset ref etc. are
7079 replaced by functions simpset:unit->simpset and
7080 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
7081 to patch your ML files accordingly;
7083 * HTML output now includes theory graph data for display with Java
7084 applet or isatool browser; data generated automatically via isatool
7085 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
7087 * defs may now be conditional; improved rewrite_goals_tac to handle
7088 conditional equations;
7090 * defs now admits additional type arguments, using TYPE('a) syntax;
7092 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
7093 creates a new theory node; implicit merge of thms' signatures is
7094 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
7095 transfer:theory->thm->thm in (rare) cases;
7097 * improved handling of draft signatures / theories; draft thms (and
7098 ctyps, cterms) are automatically promoted to real ones;
7100 * slightly changed interfaces for oracles: admit many per theory, named
7101 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
7103 * print_goals: optional output of const types (set show_consts and
7106 * improved output of warnings (###) and errors (***);
7108 * subgoal_tac displays a warning if the new subgoal has type variables;
7110 * removed old README and Makefiles;
7112 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
7114 * removed obsolete init_pps and init_database;
7116 * deleted the obsolete tactical STATE, which was declared by
7117 fun STATE tacfun st = tacfun st st;
7119 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
7120 (which abbreviates $HOME);
7122 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
7123 use isatool fixseq to adapt your ML programs (this works for fully
7124 qualified references to the Sequence structure only!);
7126 * use_thy no longer requires writable current directory; it always
7127 reloads .ML *and* .thy file, if either one is out of date;
7130 *** Classical Reasoner ***
7132 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
7133 tactics that use classical reasoning to simplify a subgoal without
7134 splitting it into several subgoals;
7136 * Safe_tac: like safe_tac but uses the default claset;
7141 * added simplification meta rules:
7142 (asm_)(full_)simplify: simpset -> thm -> thm;
7144 * simplifier.ML no longer part of Pure -- has to be loaded by object
7147 * added prems argument to simplification procedures;
7149 * HOL, FOL, ZF: added infix function `addsplits':
7150 instead of `<simpset> setloop (split_tac <thms>)'
7151 you can simply write `<simpset> addsplits <thms>'
7156 * TYPE('a) syntax for type reflection terms;
7158 * no longer handles consts with name "" -- declare as 'syntax' instead;
7160 * pretty printer: changed order of mixfix annotation preference (again!);
7162 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
7167 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
7168 with `addloop' of the simplifier to faciliate case splitting in premises.
7170 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
7172 * HOL/Auth: new protocol proofs including some for the Internet
7175 * HOL/Map: new theory of `maps' a la VDM;
7177 * HOL/simplifier: simplification procedures nat_cancel_sums for
7178 cancelling out common nat summands from =, <, <= (in)equalities, or
7179 differences; simplification procedures nat_cancel_factor for
7180 cancelling common factor from =, <, <= (in)equalities over natural
7181 sums; nat_cancel contains both kinds of procedures, it is installed by
7182 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
7184 * HOL/simplifier: terms of the form
7185 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
7187 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
7188 and those of the form
7189 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
7191 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
7194 Each datatype `t' now comes with a theorem `split_t_case' of the form
7196 P(t_case f1 ... fn x) =
7197 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
7199 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
7202 and a theorem `split_t_case_asm' of the form
7204 P(t_case f1 ... fn x) =
7205 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
7207 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
7209 which can be added to a simpset via `addsplits'. The existing theorems
7210 expand_list_case and expand_option_case have been renamed to
7211 split_list_case and split_option_case.
7214 - `pred n' is automatically converted to `n-1'.
7215 Users are strongly encouraged not to use `pred' any longer,
7216 because it will disappear altogether at some point.
7217 - Users are strongly encouraged to write "0 < n" rather than
7218 "n ~= 0". Theorems and proof tools have been modified towards this
7222 the function "set_of_list" has been renamed "set" (and its theorems too);
7223 the function "nth" now takes its arguments in the reverse order and
7224 has acquired the infix notation "!" as in "xs!n".
7226 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
7228 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
7229 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
7231 * HOL/record: extensible records with schematic structural subtyping
7232 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
7233 still lacks various theorems and concrete record syntax;
7238 * removed "axioms" and "generated by" sections;
7240 * replaced "ops" section by extended "consts" section, which is capable of
7241 handling the continuous function space "->" directly;
7244 . proves theorems immediately and stores them in the theory,
7245 . creates hierachical name space,
7246 . now uses normal mixfix annotations (instead of cinfix...),
7247 . minor changes to some names and values (for consistency),
7248 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
7249 . separator between mutual domain defs: changed "," to "and",
7250 . improved handling of sort constraints; now they have to
7251 appear on the left-hand side of the equations only;
7253 * fixed LAM <x,y,zs>.b syntax;
7255 * added extended adm_tac to simplifier in HOLCF -- can now discharge
7256 adm (%x. P (t x)), where P is chainfinite and t continuous;
7261 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
7262 with `addloop' of the simplifier to faciliate case splitting in premises.
7264 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
7265 in HOL, they strip ALL and --> from proved theorems;
7269 New in Isabelle94-8 (May 1997)
7270 ------------------------------
7272 *** General Changes ***
7274 * new utilities to build / run / maintain Isabelle etc. (in parts
7275 still somewhat experimental); old Makefiles etc. still functional;
7277 * new 'Isabelle System Manual';
7279 * INSTALL text, together with ./configure and ./build scripts;
7281 * reimplemented type inference for greater efficiency, better error
7282 messages and clean internal interface;
7284 * prlim command for dealing with lots of subgoals (an easier way of
7285 setting goals_limit);
7290 * supports alternative (named) syntax tables (parser and pretty
7291 printer); internal interface is provided by add_modesyntax(_i);
7293 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
7294 be used in conjunction with the Isabelle symbol font; uses the
7295 "symbols" syntax table;
7297 * added token_translation interface (may translate name tokens in
7298 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
7299 the current print_mode); IMPORTANT: user print translation functions
7300 are responsible for marking newly introduced bounds
7301 (Syntax.mark_boundT);
7303 * token translations for modes "xterm" and "xterm_color" that display
7304 names in bold, underline etc. or colors (which requires a color
7307 * infixes may now be declared with names independent of their syntax;
7309 * added typed_print_translation (like print_translation, but may
7310 access type of constant);
7313 *** Classical Reasoner ***
7315 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
7316 some limitations. Blast_tac...
7317 + ignores addss, addbefore, addafter; this restriction is intrinsic
7318 + ignores elimination rules that don't have the correct format
7319 (the conclusion MUST be a formula variable)
7320 + ignores types, which can make HOL proofs fail
7321 + rules must not require higher-order unification, e.g. apply_type in ZF
7322 [message "Function Var's argument not a bound variable" relates to this]
7323 + its proof strategy is more general but can actually be slower
7325 * substitution with equality assumptions no longer permutes other
7328 * minor changes in semantics of addafter (now called addaltern); renamed
7329 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
7330 (and access functions for it);
7332 * improved combination of classical reasoner and simplifier:
7333 + functions for handling clasimpsets
7334 + improvement of addss: now the simplifier is called _after_ the
7336 + safe variant of addss called addSss: uses safe simplifications
7337 _during_ the safe steps. It is more complete as it allows multiple
7338 instantiations of unknowns (e.g. with slow_tac).
7342 * added interface for simplification procedures (functions that
7343 produce *proven* rewrite rules on the fly, depending on current
7346 * ordering on terms as parameter (used for ordered rewriting);
7348 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7350 * the solver is now split into a safe and an unsafe part.
7351 This should be invisible for the normal user, except that the
7352 functions setsolver and addsolver have been renamed to setSolver and
7353 addSolver; added safe_asm_full_simp_tac;
7358 * a generic induction tactic `induct_tac' which works for all datatypes and
7359 also for type `nat';
7361 * a generic case distinction tactic `exhaust_tac' which works for all
7362 datatypes and also for type `nat';
7364 * each datatype comes with a function `size';
7366 * patterns in case expressions allow tuple patterns as arguments to
7367 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
7369 * primrec now also works with type nat;
7371 * recdef: a new declaration form, allows general recursive functions to be
7372 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
7374 * the constant for negation has been renamed from "not" to "Not" to
7375 harmonize with FOL, ZF, LK, etc.;
7377 * HOL/ex/LFilter theory of a corecursive "filter" functional for
7380 * HOL/Modelcheck demonstrates invocation of model checker oracle;
7382 * HOL/ex/Ring.thy declares cring_simp, which solves equational
7383 problems in commutative rings, using axiomatic type classes for + and *;
7385 * more examples in HOL/MiniML and HOL/Auth;
7387 * more default rewrite rules for quantifiers, union/intersection;
7389 * a new constant `arbitrary == @x.False';
7391 * HOLCF/IOA replaces old HOL/IOA;
7393 * HOLCF changes: derived all rules and arities
7394 + axiomatic type classes instead of classes
7395 + typedef instead of faking type definitions
7396 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
7397 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
7398 + eliminated the types void, one, tr
7399 + use unit lift and bool lift (with translations) instead of one and tr
7400 + eliminated blift from Lift3.thy (use Def instead of blift)
7401 all eliminated rules are derived as theorems --> no visible changes ;
7406 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
7407 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
7408 as ZF_cs addSIs [equalityI];
7412 New in Isabelle94-7 (November 96)
7413 ---------------------------------
7415 * allowing negative levels (as offsets) in prlev and choplev;
7417 * super-linear speedup for large simplifications;
7419 * FOL, ZF and HOL now use miniscoping: rewriting pushes
7420 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
7421 FAIL); can suppress it using the command Delsimps (ex_simps @
7422 all_simps); De Morgan laws are also now included, by default;
7424 * improved printing of ==> : ~:
7426 * new object-logic "Sequents" adds linear logic, while replacing LK
7427 and Modal (thanks to Sara Kalvala);
7429 * HOL/Auth: correctness proofs for authentication protocols;
7431 * HOL: new auto_tac combines rewriting and classical reasoning (many
7432 examples on HOL/Auth);
7434 * HOL: new command AddIffs for declaring theorems of the form P=Q to
7435 the rewriter and classical reasoner simultaneously;
7437 * function uresult no longer returns theorems in "standard" format;
7438 regain previous version by: val uresult = standard o uresult;
7445 * oracles -- these establish an interface between Isabelle and trusted
7446 external reasoners, which may deliver results as theorems;
7448 * proof objects (in particular record all uses of oracles);
7450 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
7452 * "constdefs" section in theory files;
7454 * "primrec" section (HOL) no longer requires names;
7456 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7463 * reduced space requirements;
7465 * automatic HTML generation from theories;
7467 * theory files no longer require "..." (quotes) around most types;
7469 * new examples, including two proofs of the Church-Rosser theorem;
7471 * non-curried (1994) version of HOL is no longer distributed;
7478 * greatly reduced space requirements;
7480 * theory files (.thy) no longer require \...\ escapes at line breaks;
7482 * searchable theorem database (see the section "Retrieving theorems" on
7483 page 8 of the Reference Manual);
7485 * new examples, including Grabczewski's monumental case study of the
7488 * The previous version of HOL renamed to Old_HOL;
7490 * The new version of HOL (previously called CHOL) uses a curried syntax
7491 for functions. Application looks like f a b instead of f(a,b);
7493 * Mutually recursive inductive definitions finally work in HOL;
7495 * In ZF, pattern-matching on tuples is now available in all abstractions and
7496 translates to the operator "split";
7503 * new infix operator, addss, allowing the classical reasoner to
7504 perform simplification at each step of its search. Example:
7505 fast_tac (cs addss ss)
7507 * a new logic, CHOL, the same as HOL, but with a curried syntax
7508 for functions. Application looks like f a b instead of f(a,b). Also pairs
7509 look like (a,b) instead of <a,b>;
7511 * PLEASE NOTE: CHOL will eventually replace HOL!
7513 * In CHOL, pattern-matching on tuples is now available in all abstractions.
7514 It translates to the operator "split". A new theory of integers is available;
7516 * In ZF, integer numerals now denote two's-complement binary integers.
7517 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
7519 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
7520 of the Axiom of Choice;
7527 * Significantly faster resolution;
7529 * the different sections in a .thy file can now be mixed and repeated
7532 * Database of theorems for FOL, HOL and ZF. New
7533 commands including qed, qed_goal and bind_thm store theorems in the database.
7535 * Simple database queries: return a named theorem (get_thm) or all theorems of
7536 a given theory (thms_of), or find out what theory a theorem was proved in
7539 * Bugs fixed in the inductive definition and datatype packages;
7541 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7542 and HOL_dup_cs obsolete;
7544 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7547 * Simpler definition of function space in ZF;
7549 * new results about cardinal and ordinal arithmetic in ZF;
7551 * 'subtype' facility in HOL for introducing new types as subsets of existing
7554 :mode=text:wrap=hard:maxLineLen=72: